基于串口的AVR串行下载线系统设计

介绍了AVR单片机串行下载线硬件组成、工作原理和AVR编程特性，讨论了下载线监控程序和PC上位机程序设计，给出了系统设计时应注意的问题。     

基于RS—485总线的变频控制系统通讯协议及其实现

设计了一种带有RS-485接口的交流变频控制器 ,它硬件接口简单 ,通讯可靠性高。经过工业现场运行 ,达到设计要求     

Striping and Scheduling for Large Scale Multimedia Servers

When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. Several problems in the designing of large-scale multimedia servers are addressed, with the following contributions: (1) a striping scheme is proposed that minimizes the number of seeks and hence maximizes the performance; (2) a simple and efficient mechanism is presented to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system; and (3) the characteristics and resource requirements of several scheduling schemes are investigated in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes. It is believed that the results ar     

Coordinated scheduling of production and delivery from multiple plants

This paper deals with the scheduling of orders and vehicle assignment for production and distribution planning in a scenario of no-wait, immediate delivery to the customer site. We first describe the problem and then present an integer programming model that maximizes the weighted value of the orders served. We consider a special case of the problem which can be solved in polinomial time by a minimum cost flow algorithm. Based on this approach we develop a heuristic procedure for the general case. Comparisons with an exact graph-based method attest that our heuristic produces good-quality solutions in short running times.     

An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

As a typical manufacturing and scheduling problem with strong industrial background, flow shop scheduling with limited buffers has gained wide attention both in academic and engineering fields. With the objective to minimize the total completion time (or makespan), such an issue is very hard to solve effectively due to the NP-hardness and the constraint on the intermediate buffer. In this paper, an effective hybrid genetic algorithm (HGA) is proposed for permutation flow shop scheduling with limited buffers. In the HGA, not only multiple genetic operators based on evolutionary mechanism are used simultaneously in hybrid sense, but also a neighborhood structure based on graph model is employed to enhance the local search, so that the exploration and exploitation abilities can be well balanced. Moreover, a decision probability is used to control the utilization of genetic mutation operation and local search based on problem-specific information so as to prevent the premature convergence and concentrate computing effort on promising neighbor solutions. Simulation results and comparisons based on benchmarks demonstrate the effectiveness of the HGA. Meanwhile, the effects of buffer size and decision probability on optimization performances are discussed.     

基于可编程逻辑器件的串行外设接口设计及实现

论述了串行外设接口(SPI)的原理,扩展了多从/多主模式、线与等新功能.用VHDL语言设计了全部源代码,在Max plusⅡ集成开发环境下对VHDL源代码进行编译、综合,并由可编程逻辑器件(CPLD)实现.使SPI接口应用的灵活性得到提高.     

基于多EBP网的案例匹配技术研究

为快速有效地实现案例推理，提出了基于多EBP神经网的案例匹配技术，设计了改进的德尔菲法来确定输出样本集．与传统的最邻近法的结果相比，对于复杂系统，该技术能够提高案例匹配的精确性，更适于解决案例属性权重难以确定或存在着耦合与非线性关系的问题．     

Capturing Attention When Attention "Blinks".

Four experiments addressed the question of whether attention may be captured when the visual system is in the midst of an attentional blink (AB). Participants identified 2 target letters embedded among distractor letters in a rapid serial visual presentation sequence. In some trials, a square frame was inserted between the targets; as the only geometric object in the sequence, it constituted a singleton. Capture effects obtained when the AB was most severe and when it was over were compared. There were 3 main results. First, capture occurred even when the AB was crippling, suggesting that a singleton exogenously engaged attention even when processing of a previous target was continuing apace. Second, when the singleton contained the key target feature, capture effects were clearly manifest. Third, even when the singleton did not possess the key target feature, it still succeeded in capturing attention, although the effects were both feeble and fleeting. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models

Minimizing total tardiness in the model of an identical parallel-machine with nonpreemptive jobs of the worker assignment scheduling problem is further studied in this paper. More complicated simulation processes are established for this purpose. The specific worker assignment scheduling problem is solved in two parts of job scheduling and worker assignment. The S_PT, E_DD, S_lack (SES) heuristic is used for the job scheduling part while the largest marginal contribution (LMC) procedure is used to for the worker assignment part and then minimizes the total tardiness. From the new simulations conducted, the heuristics developed have again shown very convincing results quite efficiently.     

基于MSP430单片机的便携式智能设备的设计

以商务大楼为应用背景，介绍了一种通用性很强的便携式智能设备的设计方法，该系统可对机电设备运行，保安签到(巡更)，环境(卫生，绿化，设施)管理实施适时监控等，实现商务大楼的职能化管理，文中详细阐述了系统的硬件结构，软件流程等相关技术，并着重说明了该设备的巡更功能和串口通信。