用组态王实现PC机与多台单片机的远程通信

介绍了用组态王6.51实现PC机与多单片机远程串行通信的一种方法，给出了PC机与80C51单片机的硬件连接电路和通信协议，较方便的实现了PC机与多台单片机的远程串行通信。     

用组态王实现PC机与多台单片机的远程通信

介绍了用组态王6.51实现PC机与多单片机远程串行通信的一种方法,给出了PC机与80C51单片机的硬件连接电路和通信协议,较方便的实现了PC机与多台单片机的远程串行通信.     

单片机与PC机互连系统设计

介绍一种实现PC机与多单片机远程串行通信的一种方案,给出了PC机与80C51单片机的硬件连接电路和通信协议,较方便的实现了PC机与多台单片机的远程串行通信。该方案克服传统开发中编程难度大,开发周期长的缺点,同时可以独立于操作系统的TCP/IP协议。     

运用VB实现微机与80C31单片机的串行通信

运用VB的串行通信控件mscomm,实现PC机与多台80C31单片机系统间的通信。在PC机与单片机的连接中采用了RS－232与RS－485转换器，实现较可靠的长距离通信。     

基于RS485总线的PC与单片机多机通信系统设计

介绍了一种基于PC机和多单片机组成的主从式控制系统的设计方案。以PC机作为上位机,多台80C51单片机作为下位机,实现上位机与下位机以及下位机与下位机的通信。硬件方面,介绍了系统中各电路的原理,设计了实现该电路的原理图;软件方面,分析了上位机和下位机之间的串行通信,并完成了多机通信的设计。实验证明,该系统具有一定的先进性和良好的实用性,可靠性。     

分布式仓库监控系统通信接口设计与实现

介绍了在由ＰＣ机及单片机组组成的分布式仓库监控系统中,主控单片机与ＰＣ机及多台从机实现实时通信的方法,给出了其硬件结构,并详细讨论了通信原理及设计思想。     

基于PC机和AVR单片机的RS485通信系统的设计与实现

介绍了利用VB6.0和ICCAVR编程实现PC机与多个ATmega16 AVR单片机通信的方法,重点介绍了PC机采用VB6.0控件操作串口实现串行通信、采用SN75176实现RS485信号转换以及实现AVR单片机串口中断发送、接收程序等的方法。     

基于MCS-51单片机的串行通信实现

串行通信是目前应用比较广泛的一种通信模式,根据单片机的串行通信原理,介绍了单片机串行通信模式和单片机的波特率设置方法,分析了单片机双机通信、单片机多机通信以及单片机与个人计算机（PC）机之间的通信协议,利用PC良好的人机界面和强大的数据处理能力,实现整个系统的集中管理和最优控制。并以MCS-51单片机为基础,针对串行通信的实行提出了相应的实现方法。     

一种单片机多机通信系统的设计

融合单片机技术和计算机网络技术,优化数据包的格式和控制方式以及引入帧检测序列,设计基于AT89S52的单片机网络的单片机多机通信协议;系统网络拓扑结构采用总线型;网络接口电路采用端口转发的形式等进行单片机多机通信系统的设计,系统易于扩展且提高了稳定性.结果表明,此系统设计解决了8位单片机多机通信的问题,实现了客户机与客户机间的通信,以及客户机与客户机间的通信.     

MCS—51系列单片机不同模式多机通信的实现

在实际应用中,有些场合单片机需要控制许多智能设备,这些设备均由串口实现控制。而一些智能设备的通信模式不能改变,单片机要与这些设备实现通信,就不能采用通常的多机通信方式。本文对单片机多机通信的实际应用中出现的新问题进行了剖析,提出了解决问题的方法,并给出了程序示例。     

Assessing Ideational and Evaluative Skills and Creative Styles and Attitudes

This article describes the rationale for the multiphase creative problem solving process, and reports the findings from an empirical investigation conducted to facilitate the problem solving of managers. The ideational skills of the managers were assessed before and after training in a complete process of creative problem solving, along with their ideational attitudes, creative problem solving style (i.e., generator, conceptualizer, optimizer, or implementor), and evaluative skill (i.e., ability to recognize original ideas). The most important findings indicated that the training had a significant impact on the evaluative accuracy of the managers. They were significantly more accurate in their judgments about original ideas after training, both in their identification of original ideas and their recognition of unoriginal ideas. After training, the managers also gave more solutions and more original solutions to problems. Finally, several variables (e.g., the “preference for active divergence” attitude, and the conceptualizer process style) seemed to moderate the impact of training. Training was therefore effective, with specific effects that can be predicted from pre-training individual differences in attitudes and process style.     

Rank and select revisited and extended

The deep connection between the Burrows–Wheeler transform (BWT) and the so-called rank and select data structures for symbol sequences is the basis of most successful approaches to compressed text indexing. Rank of a symbol at a given position equals the number of times the symbol appears in the corresponding prefix of the sequence. Select is the inverse, retrieving the positions of the symbol occurrences. It has been shown that improvements to rank/select algorithms, in combination with the BWT, turn into improved compressed text indexes.     

高等院校行政分析与决策系统的设计与实现

为提高高等院校的管理水平和决策水平,充分利用校园网资 源,开发了高等院校行政财政分析与决策系统。解决了诸如数据的动态查询、自动生成报表 、网络环境下数据共享等技术问题,具有网上数据共享、图形界面友好和安全的保密措施等 特点。     

Stochastic balancing and approximation-stability and minimality

A new method of stochastic model reduction has recently been introduced by Desai et al. [1], [2]. The stability of the reduced order model has not previously, been considered. In this paper, we show that the stability of the reduced order model follows directly from the results of Pernebo and Silverman [3]. It is also shown that the reduced order model is minimal, in the controllability/observability sense. The relevance of this notion of minimality to stochastic minimality is made clear.