An iterative method for suboptimal control of linear time-delayed systems

This article presents a new approach for solving the Optimal Control Problem (OCP) of linear time-delay systems with a quadratic cost functional. The proposed method can also be used for designing optimal control time-delay systems with disturbance. In this study, the Variational Iteration Method (VIM) is employed to convert the original Time-Delay Optimal Control Problem (TDOCP) into a sequence of nonhomogeneous linear two-point boundary value problems (TPBVPs). The optimal control law obtained consists of an accurate linear feedback term and a nonlinear compensation term which is the limit of an adjoint vector sequence. The feedback term is determined by solving Riccati matrix differential equation. By using the finite-step iteration of a nonlinear compensation sequence, we can obtain a suboptimal control law. Finally, Illustrative examples are included to demonstrate the validity and applicability of the technique.     

Adaptive fuzzy control for nontriangular form systems with time-varying full-state constraints

This article investigates an adaptive fuzzy tracking control problem for a class of nontriangular form systems with asymmetric time-varying full state constraints. Unknown functions are approximated by the fuzzy logic systems. A domination approach is employed to tackle the nontriangular form structure. Time-varying asymmetric barrier Lyapunov functions (ABLFs) are adopted to ensure full-state constraints satisfaction. Based on the backstepping technique and time-varying ABLFs, an adaptive controller is proposed and guarantees that all the signals in the closed-loop system are ultimately bounded and the time-varying full state constraints are met. Simulation examples are presented to further demonstrate the effectiveness of the proposed approach.     

基于感知评价的Internet语音终端流量控制

分析了影响因特网语音通信质量的主要因素，根据实时传输控制协议计算延迟、丢包率等网络参数，并利用RBF神经网络将参数映射为语音质量评分，根据评分值的变化动态地调整语音终端的编码速率，在保证一定语音质量的同时，缓解网络拥塞。实验证明了该方法的有效性。     

现场总线在冶炼烟气制酸系统中的应用实践

分析了冶炼烟气制酸工艺的特点，介绍了由PROFIBUS-DP现场总线构建的冶炼厂烟气制酸监控系统，详细介绍了其硬件配置及相应的软件设计。     

数字化蓄热式钢包烘烤器及自动控制系统

蓄热式燃烧技术和脉冲燃烧技术是新型的节能环保燃烧技术。数字化蓄热式钢包烘烤器控制系统利用数字化脉冲控制把这两项技术结合在一起。这大大降低了能耗，减少环境污染。本文针对数字化蓄热式钢包烘烤器，提出升温阶段采用自寻优算法，不断调整换向时间，并能记忆最优参数，保证经过几次烘烤后系统整体最优；保温阶段即采用脉冲控制的方法。     

马钢二烧结配料计算机控制系统

阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理；根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨；提供了系统的主要硬件结构，软件功能和程序框图。     

Handover and Uplink Power Control Performance in the 3.84 Mcps TDD mode of UTRA Network

In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out.     

移动通信系统中功率控制研究

在阐述功率控制在移动通信系统中的发展过程的基础上，着重研究了WCDMA系统的功率控制，最后对功率控制未来的研究方向做了简要的分析。     

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.     

Pathogenicity of three species of entomopathogenic nematodes to some major stored-product insect pests

Entomopathogenic nematodes (Nematoda: Heterorhabditidae and Steinernematidae) are commonly used biological control agents of insects in cryptic habitats, but their potential for suppressing stored-product insects in these habitats has not been explored previously. Here, we provide data from the first step in a program to evaluate entomopathogenic nematodes in the genus Steinernema as biological control agents of stored-product pests by determining their pathogenicity to some of the major stored-product pest species. When evaluated against larvae, pupae and adults of six pest species (Plodia interpunctella, Ephestia kuehniella, Oryzaephilus surinamensis, Tenebrio molitor, Tribolium castaneum, and Trogoderma variabile), and the adults of two additional pest species (Sitophilus oryzae and Rhyzopertha dominica), Steinernema riobrave was either the most pathogenic or of similar pathogenicity compared to S. carpocapsae and S. feltiae. A dose of 10 infective juveniles of S. riobrave caused 80% or higher mortality against larvae of P. interpunctella, E. kuehniella, T. castaneum, and O. surinamensis, pupae of T. castaneum and T. molitor, and adults of T. molitor and the two moth species. All stages of Trogoderma variabile exhibited 70% or higher mortality. Adults of S. oryzae and R. dominica exhibited low susceptibility with 15% and 35% mortality, respectively. On the basis of these results, S. riobrave was selected for further evaluation under more field-like conditions.