Algorithms for degree-constrained Euclidean Steiner minimal tree

A new problem of degree-constrained Euclidean Steiner minimal tree is discussed,which is quite useful in several fields.Although it is slightly different from the traditional degree-constrained minimal spanning tree,it is aho NP-hard.Two intelligent algorithms are proposed in an attempt to solve this difficult problem.Series of numerical examples are tested,which demonstrate that the algorithms also work well in practice.     

Deconvolution techniques for characterizing indoor UWB wireless channel

A deconvolution algorithm is proposed to account for the distortions of impulse shape introduced by propagation process. By finding the best correlation of the received waveform with the multiple templates, the number of multipath components is reduced as the result of eliminating the ＂phantom paths＂, and the captured energy increases. Moreover, it needs only a single reference measurement in real measurement environment （do not need the anechoic chamber）, which by far simplifies the templates acquiring procedure.     

Novel load balancing DHT scheme for the heterogeneous system

The capacities of the nodes in the peer-to-peer system are strongly heterogeneous, hence one can benefit from distributing the load, based on the capacity of the nodes. At first a model is discussed to evaluate the load balancing of the heterogeneous system, and then a novel load balancing scheme is proposed based on the concept of logical servers and the randomized binary tree, and theoretical guarantees are given. Finally, the feasibility of the scheme using extensive simulations is proven.     

Identity-based authentication protocol for grid

Current grid authentication frameworks are achieved by applying the standard SSL authentication protocol (SAP). The authentication process is very complicated, and therefore, the grid user is in a heavily loaded point both in computation and in communication. Based on identity-based architecture for grid (IBAG) and corresponding encryption and signature schemes, an identity-based authentication protocol for grid is proposed. Being certificate-free, the authentication protocol aligns well with the demands of grid computing. Through simulation testing, it is seen that the authentication protocol is more lightweight and efficient than SAP, especially the more lightweight user side. This contributes to the larger grid scalability.     

Application of rough graph in relationship mining

Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relationship mining shows effectiveness of it.     

Robust location algorithm for NLOS environments

One of the main problems facing accurate location in wireless communication systems is non-line-of- sight （NLOS） propagation. Traditional location algorithms are based on classical techniques under minimizing a least-squares objective function and it loses optimality when the NLOS error distribution deviates from Gaussian distribution. An effective location algorithm based on a robust objective function is proposed to mitigate NLOS errors. The proposed method does not require the prior knowledge of the NLOS error distribution and can give a closed-form solution. A comparison is performed in different NLOS environments between the proposed algorithm and two additional ones （LS method and Chan＇s method with an NLOS correction）. The proposed algorithm clearly outperforms the other two.     

Robust stability analysis for a cruise missile

A global controller design methodology for a flight stage of the cruise missile is proposed. This methodology is based on the method of least squares, To prove robust stability in the full airspace with parameter disturbances, the concepts of convex polytopic models and quadratic stability are introduced, The effect of aerodynamic parameters on system performance is analyzed. The designed controller is applied to track the overloading signal of the cruise segment of the cruise missile, avoiding system disturbance owing to controller switching, Simulation results demonstrate the validity of the proposed method.     

求解度约束最小生成树的快速近似算法

针对带有度约束的最小生成树问题,给出了一种快速近似算法.首先给出了快速近似算法的核心思想:在不违反度约束和不形成圈的前提下,每次加入权最小的边.其次给出了实现快速近似算法的具体步骤,并且证明了该算法的计算时间复杂度是图的顶点数的多项式函数,证明了算法的有效性定理.大量的数值试验表明该近似算法性能良好.最后在此算法的基础上,给出了求解TSP问题的一种快速近似算法.     

Delay-dependent state feedback robust stabilization for uncertain singular time-delay systems

The problem of robust stabilization for uncertain singular time-delay systems is studied. First, a new delay-dependent asymptotic stability criteria for normal singular time-delay systems is given, which is less conservative. Using this result, the problem of state feedback robust stabilization for uncertain singular time-delay systems is discussed, Finally, two examples are given to illustrate the effectiveness of the results.     

Linear generalized synchronization of chaotic systems with uncertain parameters

A more general form of projective synchronization, so called linear generalized synchronization （LGS） is proposed, which includes the generalized projective synchronization （GPS） and the hybrid projective synchronization （HPS） as its special cases, Based on the adaptive technique and Lyapunov stability theory, a general method for achieving the LGS between two chaotic or hyperehaotic systems with uncertain parameters in any scaling matrix is presented. Some numerical simulations are provided to show the effectiveness and feasibility of the proposed synchronization method.     

Design and simulation of a Torus topology for network on chip

Aiming at the applications of NOC （network on chip） technology in rising scale and complexity on chip systems, a Torus structure and corresponding route algorithm for NOC is proposed. This Torus structure improves traditional Torus topology and redefines the denotations of the routers. Through redefining the router denotations and changing the original router locations, the Torus structure for NOC application is reconstructed. On the basis of this structure, a dead-lock and live-lock free route algorithm is designed according to dimension increase. System C is used to implement this structure and the route algorithm is simulated. In the four different traffic patterns, average, hotspot 13%, hotspot 67% and transpose, the average delay and normalization throughput of this Torus structure are evaluated. Then, the performance of delay and throughput between this Torus and Mesh structure is compared. The results indicate that this Torus structure is more suitable for NOC applications.     

Recent progress on space-borne microwave sounder pre-launchcalibration technologies in China

The development processes and the application achievements of space-borne microwave sounder pre-launch calibration technologies in China are introduced briefly. Then, the general project plan for pre-launch calibration, the latest research achievements on the optimization and development of the microwave wide band calibration targets, emissivity measurement technologies and the system level uncertainty analysis of the laboratory, and the thermal/vacuum microwave sounder calibration system for ＂FY-3＂ meteorological satellite are reported, respectively. Finally, the key technological problems of the calibration technologies under researching are analyzed predictively.     

度约束最小生成树(DCMST)的竞争决策算法

度约束最小生成树是网络设计和优化中的一个NP难题，介绍了一种基于竞争造就优化和决策左右结果的新型算法——竞争决策算法，利用竞争决策算法的通用模型，给出了一种基于竞争决策思想求解度约束最小生成树的快速求解方法，经过数据测试和验证，并与其它算法的结果进行了比较，得到了较好的结果．     

Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times

A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.     

Distributed intrusion detection for mobile ad hoc networks

Mobile ad hoc networking （MANET） has become an exciting and important technology in recent years, because of the rapid proliferation of wireless devices. Mobile ad hoc networks is highly vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective for those features. A distributed intrusion detection approach based on timed automata is given. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing （DSR）. The monitor nodes can verify the behaviour of every nodes by timed automata, and validly detect real-time attacks without signatures of intrusion or trained data. Compared with the architecture where each node is its own IDS agent, the approach is much more efficient while maintaining the same level of effectiveness. Finally, the intrusion detection method is evaluated through simulation experiments.     

Grey systems for intelligent sensors and information processing

In a measurement system, new representation methods are necessary to maintain the uncertainty and to supply more powerful ability for reasoning and transformation between numerical system and symbolic system. A grey measurement system is discussed from the point of view of intelligent sensors and incomplete information processing compared with a numerical and symbolized measurement system. The methods of grey representation and information processing are proposed for data collection and reasoning. As a case study, multi-ultrasonic sensor systems are demonstrated to verify the effectiveness of the proposed methods.     

Research on the self-defence electronic jamming decision-makingbased on the discrete dynamic Bayesian network

The manner and conditions of running the decision-making system with self-defense electronic jamming are given. After proposing the scenario of applying discrete dynamic Bayesian network to the decision making with self-defense electronic jamming, a decision-making model with self-defense electronic jamming based on the discrete dynamic Bayesian network is established. Then jamming decision inferences by the aid of the algorithm of discrete dynamic Bayesian network are carried on. The simulating result shows that this method is able to synthesize different targets which are not predominant. In this way, various features at the same time, as well as the same feature appearing at different time complement mutually; in addition, the accuracy and reliability of electronic jamming decision making are enhanced significantly.     

Super-resolution processing of passive millimeter-wave images based on adaptive projected Landweber algorithm

Passive millimeter wave （PMMW） images inherently have the problem of poor resolution owing to limited aperture dimension. Thus, efficient post-processing is necessary to achieve resolution improvement. An adaptive projected Landweber （APL） super-resolution algorithm using a spectral correction procedure, which attempts to combine the strong points of all of the projected Landweber （PL） iteration and the adaptive relaxation parameter adjustment and the spectral correction method, is proposed. In the algorithm, the PL iterations are implemented as the main image restoration scheme and a spectral correction method is included in which the calculated spectrum within the passband is replaced by the known low frequency component. Then, the algorithm updates the relaxation parameter adaptively at each iteration. A qualitative evaluation of this algorithm is performed with simulated data as well as actual radiometer image captured by 91.5 GHz mechanically scanned radiometer. From experiments, it is found that the super-resolution algorithm obtains better results and enhances the resolution and has lower mean square error （MSE）. These constraints and adaptive character and spectral correction procedures speed up the convergence of the Landweber algorithm and reduce the ringing effects that are caused by regularizing the image restoration problem.     

Energy-efficient and security-optimized AES hardware design for ubiquitous computing

Ubiquitous computing must incorporate a certain level of security. For the severely resource constrained applications, the energy-efficient and small size cryptography algorithm implementation is a critical problem. Hardware implementations of the advanced encryption standard （AES） for authentication and encryption are presented. An energy consumption variable is derived to evaluate low-power design strategies for battery-powered devices. It proves that compact AES architectures fail to optimize the AES hardware energy, whereas reducing invalid switching activities and implementing power-optimized sub-modules are the reasonable methods. Implementations of different substitution box （S-Boxes） structures are presented with 0.25μm 1.8 V CMOS （complementary metal oxide semiconductor） standard cell library. The comparisons and trade-offs among area, security, and power are explored. The experimental results show that Galois field composite S-Boxes have smaller size and highest security but consume considerably more power, whereas decoder-switch-encoder S-Boxes have the best power characteristics with disadvantages in terms of size and security. The combination of these two type S-Boxes instead of homogeneous S-Boxes in AES circuit will lead to optimal schemes. The technique of latch-dividing data path is analyzed, and the quantitative simulation results demonstrate that this approach diminishes the glitches effectively at a very low hardware cost.     

New coordination scheme for multi-robot systems based onstate space models

A new coordination scheme for multi-robot systems is proposed. A state space model of the multi- robot system is defined and constructed in which the system＇s initial and goal states are included along with the task definition and the system＇s internal and external constraints. Task accomplishment is considered a transition of the system state in its state space （SS） under the system＇s constraints. Therefore, if there exists a connectable path within reachable area of the SS from the initial state to the goal state, the task is realizable. The optimal strategy for the task realization under constraints is investigated and reached by searching for the optimal state transition trajectory of the robot system in the SS. Moreover, if there is no connectable path, which means the task cannot be performed Successfully, the task could be transformed to be realizable by making the initial state and the goal state connectable and finding a path connecting them in the system＇s SS. This might be done via adjusting the system＇s configuration and/or task constraints. Experiments of multi-robot formation control with obstacles in the environment are conducted and simulation results show the validity of the proposed method.