一种可测性调度分配方法

提出一种基于演化算法的可测性调度分配方法.应用演化算法,在调度和分配过程中研究电路的可测性设计.该方法的贡献是:给出了三个可测性准则;设计了可测性目标函数;提出了一种新颖的演化编码和演化操作,提高了搜索速度和解的质量.实验结果验证了该方法的可行性.     

基于PSA的高级测试综合

提出了一种基于PSA（多项式符号代数）的高级测试综合方法。首先得到基于多项式符号代数的电路描述，然后通过可测性插入技术，得到电路的可测结构表示；通过可测性分析，提出一种基于多项式符号代数的集成的调度和分配方法，直至获得最终的电路网表。该算法可以减少测试时间和硬件消耗，而且故障的覆盖率也得到提高。实验结果证实了该方法的有效性。     

高层次综合的算子调度与寄存器分配

高层次综合技术是CPU、DSP等复杂结构设计中的关键技术,对于超大规模集成电路设计有重要的指导意义。本文深入探讨了高层次综合技术,并对高层次综合的核心技术-算子调度算法和寄存器分配算法进行分析。常用的算子调度算法有表格调度算法和FDS算法等。寄存器分配主要根据寄存器资源的生命周期对寄存器进行复用设计。     

基于优先级贪婪算法的排课系统的研究与实现

目前有许多研究排课算法的专业书籍、论文,其涉及的解决方案有基于图的树遍历算法、基于概率的随机算法、基于基因理论的遗传算法等.运用计算机进行自动排课既是高校教务管理的迫切需要,同时也有重要的理论意义,但由于排课问题复杂多变,几十年来还没有定型的最优实现方案.运用优先级的贪婪算法,设计并实现了一种基于优先级的贪婪算法的排课系统.     

The effects of synchronization on topology-transparent scheduling

Topology-transparent scheduling is an attractive medium access control technique for mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). The transmission schedule for each node is fixed and guarantees a bounded delay independent of which nodes are its neighbours, as long as the active neighbourhood is not too dense. Most of the existing work on topology-transparent scheduling assumes that the nodes are synchronized on frame boundaries. Synchronization is a challenging problem in MANETs and in WSNs. Hence, we study the relationships among topology-transparent schedules, expected delay, and maximum delay, for successively weaker models of synchronization: frame-synchronized, slot-synchronized, and asynchronous transmission. For each synchronization model, we give constructive proofs of existence of topology-transparent schedules, and bound the least maximum delay. Perhaps surprisingly, the construction for the asynchronous model is a simple variant of the slot synchronized model. While it is foreseen that the maximum delay increases as the synchronization model is weakened, the bound is too pessimistic. The results on expected delay show that topology-transparent schedules are very robust to node density higher than the construction is designed to support, allowing the nodes to cope well with mobility, and irregularities of their deployment. Wensong Chu received his M.S. in Applied Mathematics from Shanghai Jiao Tong University, China, in 1993; received his M.S. in Computer Networks (Electrical Engineering) from the University of Southern California in 2000; received his Ph.D. in Mathematics from the University of Southern California in 2002. He was with the Department of Computer Science and Engineering at Arizona State University as a post-doctoral fellow from 2002 to 2003. Currently he is doing research at the CMS Bondedge in California. His research interests include sequence designs for communications, combinatorial coding methods, mobile ad hoc networks and sensor networks, financial engineering and combinatorial design theory. Charles J. Colbourn was born in Toronto, Canada in 1953. He completed his B.Sc. degree at the University of Toronto in 1976, M.Math. at the University of Waterloo in 1978, and Ph.D. at the University of Toronto in 1980, all in computer science. He has held faculty positions at the University of Saskatchewan, the University of Waterloo, and the University of Vermont, and is now Professor of Computer Science and Engineering at Arizona State University. He is co-editor of the CRC Handbook of Combinatorial Designs and author of Triple Systems and The Combinatorics of Network Reliability, both from Oxford University Press. He is editor-in-chief of the Journal of Combinatorial Designs. His research concerns applications of combinatorial designs in networking, computing, and communications. Violet R. Syrotiuk earned the Ph.D. degree in Computer Science from the University of Waterloo (Canada) in 1992. She joined Arizona State University in 2002 and is currently an Assistant Professor of Computer Science and Engineering. Dr. Syrotiuk’s research is currently supported by three grants from the National Science Foundation, and contracts from Los Alamos National Laboratory, and the Defence Science and Technology Organisation in Australia. She serves on the Editorial Board of Computer Networks, and on the Technical Program Committee of several major conferences including MobiCom and Infocom. Her research interests include mobile ad hoc and sensor networks, in particular MAC protocols with an emphasis on adaptation, topology-transparency, and energy efficiency, dynamic spectrum utilization, mobile network models, and protocol interaction and cross-layer design. She is a member of the ACM and the IEEE.     

Timing characterization and constraining tool

This paper presents Timing Characterization and constraining Tool (TCT) that facilitates designing of modular reconfigurable Integrated Circuits (ICs) by supporting early constraint-based design space exploration and timing constraining. These steps of the design methodology are crucial from the perspective of quality of results and are not directly addressed by the synthesis tools used nowadays.     

Design of multi-mode application-specific cores based on high-level synthesis

In a mobile society, more and more devices need to continuously adapt to changing environments. Such mode switches can be smoothly done in software using a general purpose processor or a digital signal processor. However hardware cores only can cope with both throughput and power consumption constraints. Reconfigurable hardware platforms provided by FPGA devices offer partial reconfiguration at runtime. However they require too long reconfiguration times and they cannot satisfy mobile device power consumption requirements. In this article we propose a methodology to map selected groups of DSP tasks to multi-mode cores using conventional hardware technologies.     

开方运算单元的高层次综合设计

开方运算在数据加密和数据压缩中有着重要应用.文章从速度和资源两方面的优化阐述了设计开方运算单元的细节.对一个n比特二进制数,本文采用合适的算法和高层次综合设计方法,仅用2n [log2n]-3比特寄存器和一个比较单元,即可在n/2个时钟内得到结果.     

Wireless sensor networks scheduling for full angle coverage

Many current studies in tracking and surveillance assume that a target can be monitored by a single sensor. However, there are situations where a sensor can only monitor a certain portion of the object. Examples include image capturing and coastline monitoring. In our previous work, we develop the Minimum Cost Cover algorithm to identify a set of sensors which preserve 360° coverage of a target with minimum cost, such that when different cost functions for the sensors are used, covers with different optimization objectives can be identified. In this work, we study the scheduling problem to monitor a target continuously with full angle coverage. To increase network lifetime, we develop several algorithms by adopting different cost functions in selecting the sensors. We evaluate the performance of our schemes through extensive simulations. The simulation results show that our proposed Conditional Scheduling metric can help to improve the network lifetime as well as the time to the first node failure.

Real-time CBR traffic scheduling in IEEE 802.16-based wireless mesh networks

This paper studies packet transmission scheduling for real-time constant-bit-rate (CBR) traffic in IEEE 802.16-based wireless mesh networks. We first formulate and solve the scheduling problem as a binary linear programming problem. The computational complexity of the optimum scheduling solution may prevent it from being implemented in practice. We then propose a heuristic scheme, namely bottleneck first scheduling scheme, where scheduling decisions at stations (base station or subscriber stations) with higher traffic loads are done before those at stations with lower traffic loads. At each station, scheduling decisions for CBR packets with more hops to their destinations are done first. Numerical results show that the proposed scheduling scheme achieves the same capacity as the optimal one while obtaining satisfactory delay performance. Dongmei Zhao received the Ph.D. degree in Electrical and Computer Engineering from the University of Waterloo, Waterloo, Ontario, Canada in June 2002. Since July 2002 she has been with the Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada where she is an assistant professor. Dr. Zhao’s research interests include modeling and performance analysis, quality-of-service provisioning, access control and admission control in wireless networks. Dr. Zhao is a member of the IEEE and a registered Professional Engineer of Ontario. Jun Zou received the B.S. and M. Eng. Degrees from Tianjin University, China in 1999 and 2002, respectively. He worked at Siemens Communication Networks Ltd., Beijing from 2002 to 2004. Currently, he is a Ph.D. student at McMaster University, Canada. His research interests include wireless networking, routing protocols, architecture of next generation networks, network security and their applications in telecommunication industry.     

Analog circuits optimization based on evolutionary computation techniques

This paper presents a new design automation tool, based on a modified genetic algorithm kernel, in order to improve efficiency on the analog IC design cycle. The proposed approach combines a robust optimization with corner analysis, machine learning techniques and distributed processing capability able to deal with multi-objective and constrained optimization problems. The resulting optimization tool and the improvement in design productivity is demonstrated for the design of CMOS operational amplifiers.     

数字电路的高层测试技术及其发展

简要介绍了数字VLSI电路高层测试的概念,主要的高层测试方法,高层测试中所采用的故障模型及其与门级stuck-at故障的对应关系;并展望了高层测试技术的发展趋势。     

基于结构的PCB逻辑再综合

由中、小规模IC芯片构成的专用电路PCB微型化有重要实际意义。本文介绍基于结构的PCB逻辑再综合方法及我们开发的实验性逻辑再综合系统,系统将数字电路PCB再综合成某种工艺条件下基于标准单元实现的ASIC,其核心是利用PCB的逻辑结构并进行一系列的基于结构的冗余去除、逻辑优化及结构优化;利用标准单元匹配实现ASIC逻辑电路并进行时序调整和时间优化;经模拟正确的电路进行基于标准单元的布局布线。     

高校行政办公自动化系统的设计

随着信息技术的不断进步,办公自动化系统在机构的日常工作中发挥着越来越重要的作用.人们要求办公自动化系统能适应不断变化的办公需求,能够实现人们之间的信息交换与共享、协同工作乃至科学的管理与决策.办公自动化系统在技术和应用上都得到了更高层次的发展,成为现代社会的重要标志,同时也是高校信息化建设的重要组成部分,是实现高校教育管理现代化的重要手段.大力推进高校的办公自动化建设,己成为学校转变管理职能、转变工作方式和作风,进一步提高工作质量和效率,建立办事高效、运转协调、行为规范的高校教育管理体制的重要任务.     

V2V系统中半静态资源分配算法的研究

本文主要研究在城镇场景中,基于LTE的V2V通信系统在通信过程中的资源分配算法,搭建了系统级LTE-based V2V仿真平台,对V2V系统资源分配算法进行研究。同时对比动态调度算法,主要提出了基于单播、多播的半静态调度算法。仿真结果表明,在单播和多播下的半静态资源分配算法具有资源利用率高,系统吞吐量大等优点。     

An exploration of aggregation convergecast scheduling

We consider the problem of aggregation convergecast scheduling as it applies to wireless networks. The solution to aggregation convergecast satisfies the aggregation process, expressed as precedence constraints, combined with the impact of the shared wireless medium, expressed as resource constraints. Both sets of constraints influence the routing and scheduling. We propose an aggregation tree construction suitable for aggregation convergecast that is a synthesis of a tree tailored to precedence constraints and another tree tailored to resource constraints. Additionally, we show that the scheduling component can be modeled as a mixed graph coloring problem. Specifically, the extended conflict graph is introduced, and through it, a mapping from aggregation convergecast to mixed graphs is described. In the mixed graph, arcs represent the precedence constraints and edges represent the resource constraints. The mixed graph chromatic number corresponds to the optimal schedule length. Bounds for the graph coloring are provided and a branch-and-bound strategy is subsequently developed from which we derive numerical results that allow a comparison against the current state-of-the-art heuristic.