Find Research Output

Research Output
  • All
  • Scholar Profiles
  • Research Units
  • Research Output
Department Publication Year Content Type Data Sources


Clear all


Author:Stankovic, N


Abstract:We report on our experience with two pedagogies over a two year period, using one approach in each academic year, but the learning outcome remained the same. The first approach, in the first year, was backed up by Ian Sommerville's textbook, and the second by Bruegge and Dutoit's. The students came from three different curricula, and the class size in the second year was three times that in the first year. The difference in the outcome and in the meeting of the learning outcome has been strongly in favour of the second pedagogy. In this paper we compare the outcomes, provide a number of examples that explain the issues that the students had to deal with, and how the change in the pedagogy has improved the quality of the laboratory work without changing the project framework itself.

2.Perturbation modelling of a corner deleted circular polarised microstrip antenna with offset feed

Author:Lim,Eng Gee;Huang,Yi;Liau,Vui Kien

Source:2010 WRI International Conference on Communications and Mobile Computing, CMC 2010,2010,Vol.2

Abstract:A perturbation model with a single-offset microstrip feed is used in the design of a corner-deleted square patch microstrip antenna. It is shown that the use of the offset-feedsignificantly increases the size of the deleted segments and thus relaxing the fabrication tolerance. © 2010 IEEE.

3.E-commerce systems for software agents: Challenges and opportunities

Author:Tadjouddine,Emmanuel M.

Source:E-Business Issues, Challenges and Opportunities for SMEs: Driving Competitiveness,2010,Vol.

Abstract:It is hoped agent mediated e-commerce will be carried out as open systems of agents interoperating between different institutions, where different auction protocols may be in use. The authors argue that in order to put such a scenario to work, agents will need a method to automatically verify the properties of a previously unseen auction protocol. This, in turn poses the problem of automatically verifying desirable properties in order to trust a given auction mechanism. This challenge needs be addressed so that the business scenario of agent mediated e-commerce becomes a reality. In this chapter, the authors discuss salient opportunities for SMEs in addressing the issues of enabling software agents (e.g., PDAs, mobile phones) to connect to auction houses and verify desirable properties that need to hold before engaging any transactions. © 2011, IGI Global.

4.A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems

Author:Chen, WN;Zhang, J;Chung, HSH;Zhong, WL;Wu, WG;Shi, YH


Abstract:Particle swarm optimization (PSO) is predominately used to find solutions for continuous optimization problems. As the operators of PSO are originally designed in an n-dimensional continuous space, the advancement of using PSO to find solutions in a discrete space is at a slow pace. In this paper, a novel setbased PSO (S-PSO) method for the solutions of some combinatorial optimization problems (COPs) in discrete space is presented. The proposed S-PSO features the following characteristics. First, it is based on using a set-based representation scheme that enables S-PSO to characterize the discrete search space of COPs. Second, the candidate solution and velocity are defined as a crisp set, and a set with possibilities, respectively. All arithmetic operators in the velocity and position updating rules used in the original PSO are replaced by the operators and procedures defined on crisp sets, and sets with possibilities in S-PSO. The S-PSO method can thus follow a similar structure to the original PSO for searching in a discrete space. Based on the proposed S-PSO method, most of the existing PSO variants, such as the global version PSO, the local version PSO with different topologies, and the comprehensive learning PSO (CLPSO), can be extended to their corresponding discrete versions. These discrete PSO versions based on S-PSO are tested on two famous COPs: the traveling salesman problem and the multidimensional knapsack problem. Experimental results show that the discrete version of the CLPSO algorithm based on S-PSO is promising.

5.Equivalent Extensions to Caristi-Kirk's Fixed Point Theorem, Ekeland's Variational Principle, and Takahashi's Minimization Theorem

Author:Wu, ZL


Abstract:With a recent result of Suzuki (2001) we extend Caristi-Kirk's fixed point theorem, Ekeland's variational principle, and Takahashi's minimization theorem in a complete metric space by replacing the distance with a tau-distance. In addition, these extensions are shown to be equivalent. When the tau-distance is l.s.c. in its second variable, they are applicable to establish more equivalent results about the generalized weak sharp minima and error bounds, which are in turn useful for extending some existing results such as the petal theorem.

6.Statistical analysis and structure optimization of large photovoltaic module

Author:Thankalekshmi,Ratheesh R.;Qiu,Qinru;Man,K. L.

Source:2010 5th International Conference on Future Information Technology, FutureTech 2010 - Proceedings,2010,Vol.

Abstract:There has been an increasing interest in powering electronic systems using solar energy. Designers are seeking for techniques to manufacture solar panels using low cost material in a massive scale. This will likely lead to wide process variation and hence unreliable performance. This paper considers the impact of the process variations on the output power of large Photovoltaic (PV) module by modeling each PV cell as a current source whose short circuit current is a normal random variable. The probability distribution of the overall output power of an NxM PV module is analytically derived. The proposed statistical analysis technique will enable the designer to predict the maximum output power of abstract PV module for a given confidence level. This analysis also reveals that, when the size and the manufacturing technology are given, the efficiency of a PV module is determined by its topology. The proposed power prediction model can be applied to find the optimal structure of the PV module that maximizes the energy harvesting rate at the given confidence level. © 2010 IEEE.

7.Do Knowledge Characteristics Matter?A Test of the Relationship Between Knowledge Characteristics and Performance

Author:Ziye Li;Hao Shen;Youmin Xi

Source:SAM advanced management journal: AMJ,2010,Vol.

Abstract:Introduction Over the last few years, there has been an upsurge in interest among scholars on the importance of knowledge-based resources and their role in firms (e.g., see the special issue on Knowledge and the Firm of SMJ, 1996; Grant, 1996a). For instance, current interest in cross-functional capabilities like fast response (Stalk, 1988), new product development (Clark and Fujimoto, 1992), technical innovation, product innovation, all strategic or organizational innovation (Nonaka, 1994) reflects the strategic importance of knowledge in firms. As noted by Grant (1996b), "Knowledge has emerged as the most strategically-significant resource of the firm." "To put it somewhat more dramatically, there is evidence suggesting that the winners in tomorrow's market place will be the masters of knowledge management" (Bresman et al., 1999).

8.Structural signature and contact force distributions in the simulated three-dimensional sphere packs subjected to uniaxial compression

Author:Liu, LF;Zhang, L;Liao, SF


Abstract:Packing of spherical particles in a three-dimensional cylindrical container is simulated by using Discrete Element Method. The packed bed of spheres is also subjected to vertical compression which results in a dense compact. Microstructures of the packing during compaction are examined in detail in terms of the contact number, deviator fabric, and radial distribution function. Furthermore, contact force distributions are measured at different locations in the pack, i.e. the centre, the side wall, and the base (or bottom wall) of the container. The simulations show that random close packing (RCP) tends to exist in the centre of the pack, while ordered packing structures exist near the container's walls. The uniaxial compression doesn't seem to alter the packing structure in the pack centre remarkably, but to reduce the structural anisotropy of the packing close to the container's base. The simulated results have also helped to establish the correlations between packing structures and contact force distributions. Further, it is shown that small contact force distributions are sensitive to local packing structures. The simulated results are shown to be consistent with the recent experimental and simulation findings.

9.Multi-camera video surveillance for real-time analysis and reconstruction of soccer games

Author:Ren, JC;Xu, M;Orwell, J;Jones, GA


Abstract:Soccer analysis and reconstruction is one of the most interesting challenges for wide-area video surveillance applications. Techniques and system implementation for tracking the ball and players with multiple stationary cameras are discussed. With video data captured from a football stadium, the real-world, real-time positions of the ball and players can be generated. The whole system contains a two-stage workflow, i.e., single view and multi-view processing. The first stage includes categorizing of players and filtering of the ball after changing detection against an adaptive background and image-plane tracking. Occlusion reasoning and tracking-back is applied for robust ball filtering. In the multi-view stage, multiple observations from overlapped single views are fused to refine players' positions and to estimate 3-D ball positions using geometric constraints. Experimental results on real data from long sequences are demonstrated.

10.Building wireless sensor network applications with LooCI

Author:Hughes, Daniel ; Thoelen, Klaas ; Horré, Wouter ; Matthys, Nelson ; Del Cid, Javier ; Michiels, Sam ; Huygens, Christophe ; Joosen, Wouter ; Ueyama, Jó

Source:International Journal of Mobile Computing and Multimedia Communications,2010,Vol.2

Abstract:Considerable research has been performed in applying run-time reconfigurable component models to the domain of wireless sensor networks. The ability to dynamically deploy and reconfigure software components has clear advantages in sensor networks, which are typically large in scale and expected to operate for long periods in the face of node mobility, dynamic environmental conditions, and changing application requirements. LooCI is a component and binding model that is optimized for use in resource-constrained environments such as Wireless Sensor Networks. LooCI components use a novel event-based binding model that allows developers to model rich component interactions, while providing support for run-time reconfiguration, reflection, and policy-based management. This paper reports on the design of LooCI and describes a prototype implementation for the Sun SPOT. This platform is then evaluated in context of a real-world river monitoring and warning scenario in the city of Sa˜o Carlos, Brazil. Copyright © 2010, IGI Global.

11.Decentralized fault detection and management for Wireless Sensor Networks

Author:Man, Ka Lok ; Chen, Chen ; Hughes, Danny

Source:2010 5th International Conference on Future Information Technology, FutureTech 2010 - Proceedings,2010,Vol.

Abstract:Wireless Sensor Networks are increasingly being deployed in long-lived challenging application scenarios which demand a high level of availability and reliability. To achieve these characteristics in inherently unreliable and resource constrained sensor network environments fault tolerance is required. This paper presents a generic and efficient fault tolerance algorithm for Wireless Sensor Networks. In contrast to existing approaches the algorithm presented in this paper is entirely decentralized and can thus be used to support fully autonomic fault tolerance in sensor network environments. © 2010 IEEE.

12.Applying a multi-paradigm approach to implementing wireless sensor network based river monitoring

Author:Ueyama,Jo;Hughes,Danny;Man,Ka Lok;Guan,Sheng Uei;Matthys,Nelson;Horré,Wouter;Michiels,Sam;Huygens,Christophe;Joosen,Wouter

Source:Proceedings - 2010 1st ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems, CDEE 2010,2010,Vol.

Abstract:This paper describes the application of the DisSeNT middleware to implement Wireless Sensor Network based river monitoring. DisSeNT provides LooCI, an efficient run-time reconfigurable component model, PMA, a lightweight policy-based management framework and QARI, a declarative quality-aware deployment framework. Using a river monitoring case-study, this paper analyses how these distinct software development paradigms can be used in a complimentary fashion to develop efficient wireless sensor network applications. The resulting system has been deployed and evaluated in a real-world river monitoring scenario in the city of São Carlos, Brazil. © 2010 IEEE.


Author:Chong, WK;Tan, BL


Abstract:The growing interests of Business-To-Business (B2B) e-Commerce have lead to a rapid progress towards "e" transformation for Chinese SMEs. Literature is indicative of the growth of the B2B sectors in all industries, and B2B e-Marketplace is one of the sectors that have witnessed a rapid increase. Consequence, the importance of identifying the B2B Critical Success Factors (CSFs) for improved value chain in B2B exchanges is extremely important for business efficiency. Therefore, there are three research objectives in this study; first to identify B2B CSFs for SMEs operating in the China's B2B market; second to empirically test the factors by targeting sample population in China from various industries; and third to propose a B2B CSF model based on the empirical results.

14.Sliding-Window Raptor Codes for Efficient Scalable Wireless Video Broadcasting With Unequal Loss Protection

Author:Cataldi, P;Grangetto, M;Tillo, T;Magli, E;Olmo, G


Abstract:Digital fountain codes have emerged as a low-complexity alternative to Reed-Solomon codes for erasure correction. The applications of these codes are relevant especially in the field of wireless video, where low encoding and decoding complexity is crucial. In this paper, we introduce a new class of digital fountain codes based on a sliding-window approach applied to Raptor codes. These codes have several properties useful for video applications, and provide better performance than classical digital fountains. Then, we propose an application of sliding-window Raptor codes to wireless video broadcasting using scalable video coding. The rates of the base and enhancement layers, as well as the number of coded packets generated for each layer, are optimized so as to yield the best possible expected quality at the receiver side, and providing unequal loss protection to the different layers according to their importance. The proposed system has been validated in a UMTS broadcast scenario, showing that it improves the end-to-end quality, and is robust towards fluctuations in the packet loss rate.

15.We Needs a Significant Reform: Indigenous Research on Chinese Leadership as Example

Author:XI You-min;HAN Wei


Abstract:Drawing on the discussion on many troubles facing Chinese management community (CMC), the authors profile the evolutional process of CMC, authors declare that a significant reform through a tentative argument on indigenous research of Chinese leadership, the on management community is needed and reasonable.

16.Working towards efficient parallel computing of integral images on multi-core processors

Author:Zhang, Nan

Source:ICCET 2010 - 2010 International Conference on Computer Engineering and Technology, Proceedings,2010,Vol.2

Abstract:This paper presents a novel multi-threaded parallel algorithm for computing integral images on multi-core processors. At each stage of the design, we evaluated several approaches, well-established as well as newly proposed. According to the results of the evaluations and our analysis the best suitable solutions have been identified, from which the parallel algorithm was synthesised. Tests were made and showed that on systems with fast FSB, e.g., 1333MHz, when running with two threads bound on distinctive processors sharing the same L2 cache the implementation of the algorithm could run at a speed twice as fast as that of the best known sequential reference. Tests also revealed that L2 cache size, system bus speed, micro-architecture and topology of the processor all had their share in determining the performance of the implementation relative to the sequential reference. © 2010 IEEE.

17.Classification of Subcellular Phenotype Images by Decision Templates for Classifier Ensemble

Author:Zhang, BL


Abstract:Subcellular localization is a key functional characteristic of proteins. An automatic, reliable and efficient prediction system for protein subcellular localization is needed for large-scale genome analysis. The automated cell phenotype image classification problem is an interesting "bioimage informatics" application. It can be used for establishing knowledge of the spatial distribution of proteins within living cells and permits to screen systems for drug discovery or for early diagnosis of a disease. In this paper, three well-known texture feature extraction methods including local binary patterns (LBP), Gabor filtering and Gray Level Coocurrence Matrix (GLCM) have been applied to cell phenotype images and the multiple layer perceptron (MLP) method has been used to classify cell phenotype image. After classification of the extracted features, decision-templates ensemble algorithm (DT) is used to combine base classifiers built on the different feature sets. Different texture feature sets can provide sufficient diversity among base classifiers, which is known as a necessary condition for improvement in ensemble performance. For the He La cells, the human classification error rate on this task is of 17%% as reported in previous publications. We obtain with our method an error rate of 4.8%%.

18.Middleware for resource sharing in multi-purpose wireless sensor networks

Author:Del Cid, Pedro Javier ; Michiels, Sam ; Joosen, Wouter ; Hughes, Danny

Source:2010 IEEE International Conference on Networked Embedded Systems for Enterprise Applications, NESEA 2010,2010,Vol.

Abstract:In order to improve application reaction times and decrease overall transmission overhead, Wireless Sensor Network (WSN) applications are being developed to push intelligence into the network. In multi-purpose enterprise deployments of WSNs the infrastructure is considered a light-weight service platform that can provide services for multiple concurrent distributed applications. In this context our middleware focuses on efficiently managing shared resources while considering Quality of Data (QoD) and context aware operation. In this paper we address the issue of how concurrent use of WSN services may lead to consequential contention over a sensor node's resources. We contribute by introducing share-able components that minimize the consequential resources needed and a resource planner that effectively reserves these resources. A prototype implementation and evaluation are provided. ©2010 IEEE.

19.A probabilistic framework for automated mechanism design

Author:Tadjouddine, Emmanuel M.

Source:Proceedings of 2010 IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2010,2010,Vol.

Abstract:This paper presents a probabilistic framework that can be used to automatically generate verifiable mechanisms for multi-agent systems wherein agents need to trust the system. Such settings require designing mechanisms given agents' requirements, which are expressed as constraints and desirable properties such as incentive compatibility. Our framework is based on a game-playing scenario wherein a game is viewed as a set of computer codes and is run using a designer. The designer can be viewed as a probabilistic polytime Turing machine interacting with the game in order to achieve a given objective or simply win it. This results in a sequence of games where the probability for the designer winning the game is bounded from above by the probability of the game setting a Boolean variable to true. By analyzing the game-play as a Markov decision process, we identified cases where the interactions between the designer and the game yield a positive outcome. This methodology can be used to deploy for example agent mediated e-commerce systems. © 2010 IEEE.

20.Substructure preconditioners for a class of structured linear systems of equations

Author:Zhou, JT;Niu, QA


Abstract:We proposed a substructure preconditioner for a class of structured linear system of equations. We show that a preconditioner with half of the constraint terms is able to make the preconditioned matrix have only three distinct eigenvalues. For some practical applications, a regularized variant is formulated, and the influence of the regularization parameter is analyzed. Numerical results show that the regularized variant is as efficient and is able to produce nearly optimal convergence behavior with a wide range of parameters. (C) 2010 Elsevier Ltd. All rights reserved.
Total 89 results found
Copyright 2006-2020 © Xi'an Jiaotong-Liverpool University 苏ICP备07016150号-1 京公网安备 11010102002019号