Fast handoff with reducing waste rate approach for wireless resources management in UMTS mobile networks

3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.     

Effective Location Based Services with Dynamic Data Management in Mobile Environments

With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.     

Face verification across age progression.

Human faces undergo considerable amounts of varialions with aging. While face recognition systems have been proven to be sensitive to factors such as illumination and pose, their sensitivity to facial aging effects is yet to be studied. How does age progression affect the similarity between a pair of face images of an individual? What is the confidence associated with establishing the identity between a pair of age separated face images? In this paper, we develop a Bayesian age difference classifier that classifies face images of individuals based on age differences and performs face verification across age progression. Further, we study the similarity of faces across age progression. Since age separated face images invariably differ in illumination and pose, we propose preprocessing methods for minimizing such variations. Experimental results using a database comprising of pairs of face images that were retrieved from the passports of 465 individuals are presented. The verification system for faces separated by as many as nine years, attains an equal error rate of 8.5%.     

Knowledge-based control and case-based diagnosis based upon empirical knowledge and fuzzy logic for the SBR plant.

Because biological wastewater treatment plants (WWTPs) involve a long time-delay and various disturbances, in general, skilled operators manually control the plant based on empirical knowledge. And operators usually diagnose the plant using similar cases experienced in the past. For the effective management of the plant, system automation has to be accomplished based upon operating recipes. This paper introduces automatic control and diagnosis based upon the operator's knowledge. Fuzzy logic was employed to design this knowledge-based controller because fuzzy logic can convert the linguistic information to rules. The controller can manage the influent and external carbon in considering the loading rate. The input of the controller is not the loading rate but the dissolved oxygen (DO) lag-time, which has a strong relation to the loading rate. This approach can replace an expensive sensor, which measures the loading rate and ammonia concentration in the reactor, with a cheaper DO sensor. The proposed controller can assure optimal operation and prevent the over-feeding problem. Case-based diagnosis was achieved by the analysis of profile patterns collected from the past. A new test profile was diagnosed by comparing it with template patterns containing normal and abnormal cases. The proposed control and diagnostic system will guarantee the effective and stable operation of WWTPs.     

Controlled elements for designing ciphers suitable to efficient VLSI implementation

This work considers the problem of increasing the performance of the ciphers based on Data-Dependent (DD) operations (DDO) for VLSI implementations. New minimum size primitives are proposed to design DDOs. Using advanced DDOs instead of DD permutations (DDP) in the DDP-based iterative ciphers Cobra-H64 and Cobra-H128 the number of rounds has been significantly reduced yielding enhancement of the “performance per cost” value and retaining security at the level of indistinguishability from a random transformation. To obtain further enhancement of this parameter a new crypto-scheme based on the advanced DDOs is proposed. The FPGA implementation of the proposed crypto-scheme achieves higher throughput value and minimizes the allocated resources than the conventional designs. Design of the DDO boxes of different orders is considered and their ASIC implementation is estimated.     

异构数据集成方法研究与实现

为解决异构数据集成的复杂性问题，文章提出了一种异构数据同步的新方法——半集成式中间件法。该方法成功地应用在重庆市社会保障综合信息系统中，具有易于实现、可扩展性、跨平台性和效率高等特点。     

A method for conflict detection based on team intention inference

One of the typical causes of errors in team cooperative activities, such as in central control rooms of power plants and cockpits in aircrafts, is conflicts among team members' intentions. If mutual awareness and communication were perfectly established and maintained, conflicts could be detected and recovered by team members; however, this does not happen in practice. In this paper, we provide a framework for detecting conflicts among team members' intentions based on team intention inference, aiming to make machines function as a coordinator for cooperative activities. In previous work, we developed a method for team intention inference based on a definition of ‘we-intention’. We-intention is other-regarding intentions relating to situations in which some agents act together, and is represented as a set of individual intentions and mutual beliefs. In this framework, a conflict can be defined as a set of individual intentions and false beliefs (undesired procedures), and detected by searching for such combinations. We applied the proposed method to the operation of a plant simulator operated by a two-person team, and it was confirmed through an experiment that this method could list candidates for conflicts by type and set the actual conflict high in priority in the tested context.     

Simulation of humidity control and greenhouse temperature tracking in a growth chamber using a passive air conditioning unit

In this paper, we define a dynamic discrete model of a passive air conditioning unit, without the more typical compression or absorption-refrigeration cycle. The unit is composed of heat exchangers, a positioning system and humid corrugated pads. The aim of the study was to follow the temperature in a greenhouse and to replicate it with a desired and stable relative humidity in a ventilated growth chamber. A control law, based on a quadratic criterion and dynamic programming, taking output error and energy consumption minimisation into account, was used to control the behaviour of the unit in spite of air intake disturbances. The results of the simulation indicate that the air conditioning unit can produce a variable climate in the growth chamber, with a wide range of relative humidity setpoints.     

Testing web applications

Traditional testing techniques are not adequate for web-based applications, since they miss their additional features such as their multi-tier nature, hyperlink-based structure, and event-driven feature. Limited work has been done on testing web applications. In this paper, we propose new techniques for white box testing of web applications developed in the .NET environment with emphasis on their event-driven feature. We extend recent work on modeling of web applications by enhancing previous dependence graphs and proposing an event-based dependence graph model. We apply data flow testing techniques to these dependence graphs and propose an event flow testing technique. Also, we present a few coverage testing approaches for web applications. Further, we propose mutation testing operators for evaluating the adequacy of web application tests.