公交车站牌报站屏的设计

介绍了新型太阳能公交车站牌报站显示系统。该系统利用太阳能、LED显示和微控制技术,采用W78E58单片机作为系统的中央控制单元,可实现同一站牌不同路数公交车站点的静态显示、动态显示和定时显示控制。利用VB软件编程可实现PC机通信,通过RS232接口可对整个系统升级,提高了系统的可操作性。整个系统采用太阳能供电,蓄电池作为后备电源,可有效节约电能。     

一种高性价比CAN总线适配卡的设计与实现

针对传统CAN总线设备存在的系统规模大、功耗高、成本高等问题,提出并实现了一种高性价比CAN适配卡系统。介绍了系统总体结构,阐述了软硬件组成及其功能,并给出硬件具体设计方案及驱动程序的实现方法。经实践证明,该适配卡系统完全可满足实际需要且结构简单、能耗低、稳定性能好。     

On the complexity of bandwidth allocation in radio networks

We define and study an optimization problem that is motivated by bandwidth allocation in radio networks. Because radio transmissions are subject to interference constraints in radio networks, physical space is a common resource that the nodes have to share in such a way, that concurrent transmissions do not interfere. The bandwidth allocation problem we study under these constraints is the following. Given bandwidth (traffic) demands between the nodes of the network, the objective is to schedule the radio transmissions in such a way that the traffic demands are satisfied. The problem is similar to a multicommodity flow problem, where the capacity constraints are replaced by the more complex notion of non-interfering transmissions. We provide a formal specification of the problem that we call round weighting  . By modeling non-interfering radio transmissions as independent sets, we relate the complexity of round weighting to the complexity of various independent set problems (e.g. maximum weight independent set, vertex coloring, fractional coloring). From this relation, we deduce that in general, round weighting is hard to approximate within n^1−ε$n^{1-\epsilon }$ (n$n$ being the size of the radio network). We also provide polynomial (exact or approximation) algorithms e.g. in the following two cases: (a) when the interference constraints are specific (for instance for a network whose vertices belong to the Euclidean space), or (b) when the traffic demands are directed towards a unique node in the network (also called gathering, analogous to single commodity flow).     

Optimizing counter-terror operations: Should one fight fire with “fire” or “water”?

This paper deals dynamically with the question of how recruitment to terror organizations is influenced by counter-terror operations. This is done within an optimal control model, where the key state is the (relative) number of terrorists and the key controls are two types of counter-terror tactics, one (“water”) that does not and one (“fire”) that does provoke recruitment of new terrorists. The model is nonlinear and does not admit analytical solutions, but an efficient numerical implementation of Pontryagin's minimum principle allows for solution with base case parameters and considerable sensitivity analysis. Generally, this model yields two different steady states, one where the terror organization is nearly eradicated and one with a high number of terrorists. Whereas water strategies are used at almost any time, it can be optimal not to use fire strategies if the number of terrorists is below a certain threshold.     

Segment-based adaptive hyper-Erlang model for long-tailed network traffic approximation

Modeling the long-tailedness property of network traffic with phase-type distributions is a powerful means to facilitate the consequent performance evaluation and queuing based analysis. This paper improves the recently proposed Fixed Hyper-Erlang model (FHE) by introducing an adaptive framework (Adaptive Hyper-Erlang model, AHE) to determine the crucially performance-sensitive model parameters. The adaptive model fits long-tailed traffic data set directly with a mixed Erlang distribution in a new divide-and-conquer manner. Compared with the well-known hyperexponential based models and the Fixed Hyper-Erlang model, the Adaptive Hyper-Erlang model is more flexible and practicable in addition to its accuracy in fitting the tail behavior.

Improvements of nonlinear dynamic modeling of hot-film MAF sensor

The operating procedure of engine requires that the mass air flow (MAF) sensor can measure the pulsation air flow accurately. Therefore the MAF sensor must possess fast response speed. It is necessary to study the dynamic characteristic of the MAF sensor. Both the experimental equipments and method used by authors previously are improved to obtain the sensor response data accurately in this paper. The static and dynamic separable modeling method is adopted to build the uniform nonlinear dynamic model of the hot-film MAF sensor in the Hammerstein and Wiener forms, which can describe the large/small flow-rate and positive/negative step responses. The performance indexes are calculated by the actual and model responses.     

Continuous State Dynamic Programming via Nonexpansive Approximation

This paper studies fitted value iteration for continuous state numerical dynamic programming using nonexpansive function approximators. A number of approximation schemes are discussed. The main contribution is to provide error bounds for approximate optimal policies generated by the value iteration algorithm.      

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem

In this paper we study the coordination of different activities in a supply chain issued from a real case. Multiple suppliers send raw materials (RMs) to a distribution center (DC) that delivers them to a unique plant where the storage of the RMs and the finished goods is not possible. Then, the finished goods are directly shipped to multiple customers having just‐in‐time (JIT) demands. Under these hypotheses, we show that the problem can be reduced to multiple suppliers and one DC. Afterwards, we analyze two cases; in the first, we consider an uncapacitated storage at DC, and in the second, we analyze the capacitated storage case. For the first case, we show that the problem is NP‐hard in the ordinary sense using the Knapsack decision problem. We then propose two exact methods: a mixed integer linear program (MILP) and a pseudopolynomial dynamic program. A classical dynamic program and an improved one using the idea of Shaw and Wagelmans are given. With numerical tests we show that the dynamic program gives the optimal solution in reasonable time for quite large instances compared with the MILP. For the second case, the capacity limitation in DC is assumed, which makes the problem solving more challenging. We propose an MILP and a dynamic programming‐based heuristic that provides solutions close to the optimal solution in very short times.     

低带宽全搜索VBSME结构的优化设计

为支持H.264/AVC可变块运动估计(VBSME)要求,提出一个高性能的二维脉动阵列结构,该结构具有数据重传次数少,存储器带宽要求低的特性.对结构中存在大量延迟寄存器开销的问题,用基于数据流的AON网络模型对阵列结构的计算依赖关系进行分析,并使用动态规划算法,得到了优化的结构设计.     

操作系统电源管理研究进展

系统级动态电源管理技术的关键问题是在系统性能与能耗之间进行权衡.在硬件提供支持的基础上,操作系统电源管理的优势在于操作系统作为系统资源管理者,根据工作负载和硬件资源电源状态的特征,在满足系统性能约束条件下作出电源管理决策和控制,降低系统能耗.从优化控制策略和操作系统资源管理的角度,综述操作系统电源管理研究现状及其关键技术.对两类动态电源管理策略进行详细分析,讨论了从资源管理角度进行操作系统电源管理的研究思路和问题,对当前面临的主要问题和发展趋势进行了总结和展望.