Frequency Insertion Strategy for Channel Assignment Problem

This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem (CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time. Hence, the method requires computational time that increases only linear to the number of calls. However, what distinguishes the method from others is that it starts with a narrow enough frequency band so as to provoke violations of constraints that we need to comply with in order to avoid radio interference. Each violation is then resolved by inserting frequencies at the most appropriate positions so that the band of frequencies expands minimally. An extensive computational experiment using a set of randomly generated problems as well as the Philadelphia benchmark instances shows that the proposed method perform statistically better than existing methods of its kind and even yields optimum solutions to most of Philadelphia benchmark instances among which two cases are reported for the first time ever, in this paper. Won-Young Shin was born in Busan, Korea in 1978. He received B.S. in industrial engineering from Pohang University of Science and Technology (POSTECH) in 2001 and M.S in operation research and applied statistics from POSTECH in 2003. Since 2003 he has been a researcher of Agency for Defense Development (ADD) in Korea. He is interested in optimization of communication system and applied statistics. Soo Y. Chang is an associate professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH), Pohang, Korea. He teaches linear programming, discrete optimization, network flows and operations research courses. His research interests include mathematical programming and scheduling. He has published in several journals including Discrete Applied Mathematics, Computers and Mathematics with Application, IIE Transactions, International Journal of Production Research, and so on. He is a member of Korean IIE, and ORMSS. Jaewook Lee is an assistant professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH), Pohang, Korea. He received the B.S. degree in mathematics with honors from Seoul National University, and the Ph.D. degree from Cornell University in applied mathematics in 1993 and 1999, respectively. He is currently an assistant professor in the department of industrial engineering at the Pohang University of Science and Technology (POSTECH). His research interests include nonlinear systems, neural networks, nonlinear optimization, and their applications to data mining and financial engineering. Chi-Hyuck Jun was born in Seoul, Korea in 1954. He received B.S. in mineral and petroleum engineering from Seoul National University in 1977, M.S. in industrial engineering from Korea Advanced Institute of Science and Technology in 1979 and Ph.D. in operations research from University of California, Berkeley, in 1986. Since 1987 he has been with the department of industrial engineering, Pohang University of Science and Technology (POSTECH) and he is now a professor and the department head. He is interested in performance analysis of communication and production systems. He has published in several journals including IIE Transactions, IEEE Transactions, Queueing Systems and Chemometrics and Intelligent Laboratory Systems. He is a member of IEEE, INFORMS and ASQ.     

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.     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

大系统分散鲁棒容错控制的进展及主要成果

综述了近２０年来关联大系统分散鲁棒容错控制的研究动态及取得的主要成果。说明了统一地研究分散鲁棒容错控制的必要性。在分散控制、鲁棒控制和容错控制研究领域内，分析了各种设计方法的主导思想及实质；指出了这些研究成果的意义与存在的问题。文中着重论述了分散、鲁棒、容错控制研究方法的发展途径。     

Adaptive control of siso plants with unmodelled dynamics

In this paper we pursue a twofold aim. First we want to simplify the complexity of the classical Monopoli's scheme, the so-called ‘Augmented error signal control scheme’. Then we also wish to cope with the realistic situation in which the presence of unmodelled dynamics has to be taken into account. This latter problem has been faced in the literature by suitably modifying the adaptation mechanism in order to avoid undesired phenomena as well as to obtain an attractive stability region for the state trajectories starting from any point in a predefined initial condition set. In our case the necessity of introducing any sort of modification in the adaptation mechanism is completely avoided, but we still obtain asymptotic stability of the output error signal.     

Stabilization of inter-area and/or oscillatory modes in large-scale power system by voltage impedance power system (VIPS) apparatus based on decentralized control scheme

New technologies such as power electronics have made it possible to change continuously the impedance of a power system not only to control power flow but also to enhance stability. A power system incorporating a variable impedance apparatus such as a variable series capacitor (VSrC) and high-speed phase shifter (HSPS) is called VIPS (Variable Impedance Power System) by the authors. This paper proposes a novel control method of VIPS apparatus such as VSrC and HSPS installed at an interconnecting point for stabilizing inter-area unstable and/or oscillatory modes. The proposed design method of the control system is a kind of hierarchical decentralized control method of a large-scale power system based on a Lyapunov function. Under the proposed control scheme, each subsystem can be stabilized independently by local controllers such as AVR, speed governor and PSS, and then the whole interconnected system can be stabilized by VIPS apparatus taking into account interactions between subsystems. The effectiveness and robustness of the VIPS apparatus control are shown by numerical examples with model systems including a large-scale power system.     

浅谈21世纪新建电厂热控系统的规划设计

为了适应电力工业发展和国家新兴产业政策的需要,本文扼要介绍了21世纪新建电厂在热控系统的规划设计方面应做的改进和注意的问题.并在此基础上阐述了一些个人的观点和看法供管理、设计和技术人员参考.     

Design of pole-assignment controller for systems with algebraic-equation constraint

In this paper we have studied the control of linear systems with algebraic-equation constraint. A pole-assignment controller with two-layer structure for such constrained systems has been presented. The objective of the controller is to assign the desired poles to constrained system and simultaneously force the corresponding closed-loop system to satisfy the constraint. The conditions for the existence of pole-assignment controller are discussed in different cases. The implementation algorithm of pole-assignment controller is also presented. An example is given to illustrate the validity of the method in this paper.     

Software for dynamic reconfigurable order picking systems

This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families.     

多部件设备维修问题研究及遗传算法求解

合理组织设备维修，缩短设备维修时间是生产运营管理的一个重要环节。本文探讨了多部件设备维修的有效组织问题。考虑到维修工人对拆分后设备的不同部分具有不同的维修效率，提出了一种基于维修时间优化的决策方法，将其与经典指派方法进行了比较；进一步地，对这一NP-hard问题设计了遗传算法，通过数值例子讨论了其求解有效性。