Fabrication of metallic micromirror using electroplating technology

A nickel micromirror array was designed and successfully fabricated using a thick photoresist as a sacrificial layer and as a mold for nickel electroplating. It was composed of two address electrodes, two support posts and a nickel mirror plate. The mirror plate, which is supported by two nickel posts, is overhung about 10 μm from the silicon substrate. The nickel mirror plate is actuated by an electrostatic force generated by electrostatic potential difference applied between the mirror plate and the address electrode. Optimized fabrication processes have been developed to reduce residual stress in mirror plate and prevent contact between the mirror plate and the substrate, which ensure a reasonable flat and smooth micromirror for operation at low actuation voltage.

     

A belief-rule-based inventory control method under nonstationary and uncertain demand

This paper is devoted to investigating inventory control problems under nonstationary and uncertain demand. A belief-rule-based inventory control (BRB-IC) method is developed, which can be applied in situations where demand and demand-forecast-error (DFE) do not follow certain stochastic distribution and forecasting demand is given in single-point or interval styles. The method can assist decision-making through a belief-rule structure that can be constructed, initialized and adjusted using both manager’s knowledge and operational data. An extended optimal base stock (EOBS) policy is proved for initializing the belief-rule-base (BRB), and a BRB-IC inference approach with interval inputs is proposed. A numerical example and a case study are examined to demonstrate potential applications of the BRB-IC method. These studies show that the belief-rule-based expert system is flexible and valid for inventory control. The case study also shows that the BRB-IC method can compensate DFE by training BRB using historical demand data for generating reliable ordering policy.     

A rough set approach to feature selection based on power set tree

Feature selection is viewed as an important preprocessing step for pattern recognition, machine learning and data mining. Traditional hill-climbing search approaches to feature selection have difficulties to find optimal reducts. And the current stochastic search strategies, such as GA, ACO and PSO, provide a more robust solution but at the expense of increased computational effort. It is necessary to investigate fast and effective search algorithms. Rough set theory provides a mathematical tool to discover data dependencies and reduce the number of features contained in a dataset by purely structural methods. In this paper, we define a structure called power set tree (PS-tree), which is an order tree representing the power set, and each possible reduct is mapped to a node of the tree. Then, we present a rough set approach to feature selection based on PS-tree. Two kinds of pruning rules for PS-tree are given. And two novel feature selection algorithms based on PS-tree are also given. Experiment results demonstrate that our algorithms are effective and efficient.     

H.264帧内预测模式选择快速算法的研究

提出一种适用于H.264帧内预测的快速算法,利用相邻像素间的梯度筛选预测模式来避免不必要的预测模式计算。实验结果表明:用全I帧编码,该算法在图像质量和输出码率基本不变的情况下,编码时间大约节省了60%。     

Construction of 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Good Nonlinearity

This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in associative classes. For some n, a part of 1-resilient functions with maximum algebraic immunity constructed in the paper can achieve almost optimal nonlinearity. Apart from their high nonlinearity, the functions reach Siegenthaler's upper bound of algebraic degree. Also a class of 1-resilient functions on any number n > 2 of variables with at least sub-optimal algebraic immunity is provided.     

一体化承载网络体系架构研究

传统信息网络因面向业务支撑设计而造成体系架构的刚性,无法满足业务发展多样性和网络异构的需求,因此无法适应下一代网络融合、可扩展等特点.面向服务提供的技术体系可以解决这一问题.文中以网络承载服务为核心,以可重构路由交换平台为关键支撑技术,设计出一种面向服务提供的网络体系架构--一体化承载网络(UCN)模型,以及基于UCN模型设计出的逻辑承载网的资源均衡构建算法(RBCA)并进行了网络仿真及结果分析,为下一代网络的研究和设计提供了新的思路.     

A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

Utility function of TCP

Understanding the TCP congestion control mechanism from a global optimization point of view is not only important in its own right, but also crucial to the design of other transport layer traffic control protocols with provable properties. In this paper, we derive a global utility function and the corresponding optimal control law, known as TCP control law, which maximizes the global utility. The TCP control law captures the essential behaviors of TCP, including slow start, congestion avoidance, and the binary nature of congestion feedback in TCP. We find that the utility function of TCP is linear in the slow start phase and is proportional to the additive increase rate and approaches the well-known logarithm function as the data rate becomes large in the congestion avoidance phase. We also find that understanding the slow start phase with a fixed threshold is critical to the design of new transport layer control protocols to enable quality of service features. Finally, as an application, we design a Minimum Rate Guaranteed (MRG) traffic control law that shares the same utility function as the TCP control law. Our simulation study of the MRG control law indicates that it is indeed TCP friendly and can provide minimum rate guarantee as long as the percentage of network resource consumed by the MRG flows is moderately small.     

A passive tree-based backbone construction scheme for MANETs

Backbone-based broadcast schemes are effective in alleviating the broadcast storm problem in mobile ad hoc networks (MANETs). However, periodically hello packets used to maintain a backbone usually lead to extra control overhead. In this paper, passive tree-based backbone construction scheme (PTBCS) is proposed as a backbone construction scheme for MANETs. Different from other schemes, each node in PTBCS determines its role by intercepting packet transmissions in the air during a special waiting period. Hence, its most remarkable advantage is that there are no periodical packet transmissions specially for backbone construction. The property that the nodes selected by PTBCS make up a connected dominating set (CDS) of the network is proven with several ideal assumptions. Simulation results show that PTBCS is effective when compared with some other typical backbone construction schemes.