Dynamic Characteristics of Inter-Satellite Links in LEO Networks

To establish an efficient inter-satellite link (ISL) in an LEO network, the effect of geometric characteristics of ISL on the ISLs and the devices on the LEO satellite should be examined. Because of the continuous movement of the LEO satellite, the time-varying behaviours of the ISL's geometric charactersistics continuously change with the changes of the satellite's position on the orbit. These dynamic geometric characteristics of the ISLs are important for ISL's performance analyzing and the design of the devices on the LEO satellite. This paper describes dynamic geometric characteristics of ISL, analyzes the impact of these regulations on the tracking system of the satellite's antenna and the power adjusting system of the satellite's transmitter, with the Iridium system as an example.     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

基于强跟踪滤波器估计的最优融合方法

在分布式雷达数据处理模式中 ,数据融合是获得较精确的目标轨迹的主要环节。为克服卡尔曼滤波器对初始值敏感、鲁棒性差和对机动目标跟踪性能差的缺陷 ,通过利用各传感器的观测数据 ,采用强跟踪滤波器对目标进行跟踪 ,以改善目标状态估计的精度。对判定源于同一目标的状态估计值 ,给出了一种估计状态线进行性组合的最优融合准则。得出了实际数据的实验结果。     

Radar Imaging Based on Iterative Algorithms

It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.     

系统可靠性优化的离散多目标决策方法

工程实际中 ,人们往往在追求系统的可靠性达到最大的基础上 ,又追求系统的造价到达最小。另外 ,系统中单元的可靠性有时需从给定的离散集中选取。针对上述现象 ,提出了离散多目标决策方法 ,用于选取大型复杂系统中单元可靠性的最优值。算例表明所提出文方法有效     

Face Recognition Based on Support Vector Machine and Nearest Neighbor Classifier

Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with the nearest neighbor classifier (NNC) is proposed. The principal component analysis (PCA) is used to reduce the dimension and extract features. Then one-against-all stratedy is used to train the SVM classifiers. At the testing stage, we propose an al-     

谈职业院校教学质量与招生就业的互动关系

招生就业工作关系到职业院校的生存和发展,而招生就业与教学质量之间具有相互影响、相互制约的互动关系.本文在分析二者相互之间关系的基础上,提出了实现良性互动的对策.     

基于改进等分节点法的启发式布局算法

针对集成电路标准单元模式的布局问题，提出了一个全新的基于改进等分节点法的启发式标准单元布局算法(TETP)，该算法在优化布局过程中采用改进的等分节点法寻找单元目标位置，同时结合局部寻优的启发式算法，对MCNC(Microelectronics Centre of North-Carolina)标准单元测试电路进行实验。结果表明，与布局工具Timber Wolf7．0和FengShui相比，电路布局的总线长度分别平均减少了16％和17％。     

Subset threshold autoregression

We develop in this paper an efficient way to select the best subset threshold autoregressive model. The proposed method uses a stochastic search idea. Differing from most conventional approaches, our method does not require us to fix the delay or the threshold parameters in advance. By adopting the Markov chain Monte Carlo techniques, we can identify the best subset model from a very large of number of possible models, and at the same time estimate the unknown parameters. A simulation experiment shows that the method is very effective. In its application to the US unemployment rate, the stochastic search method successfully selects lag one as the time delay and five best models from more than 4000 choices. Copyright © 2003 John Wiley & Sons, Ltd.     

基于坐标变换的具有可操舵轮的移动机器人运动学建模

为了提高移动机器人的灵活性和机动性,人们提出了最大限度地利用普通常规轮的运动自由度来实现移动机器人的平面自由运动。当移动机器人具有n(n≥2)个可操舵驱动轮时,它可以实现平面上的自由运动,即它具有3个自由度。针对轮式移动机器人的运动学建模问题,基于坐标变换法,提出了一种解决具有可操舵轮的移动机器人运动学建模的通用方法,建立了在满足理想运动约束条件下的运动学模型,并以具有2个可操舵驱动轮的3自由度移动机器人为例,给出了运动学仿真结果。