I/O新技术──智能I/O

本文综述智能I／O技术的现状与趋势，同时简要介绍智能I／O技术。     

Research on fast implementation of Elliptic Curve Cryptosystem based on object-oriented method

With the fast development of cryptography research and computer technology, the cryptosystems of RSA and Diffe-Hellman are getting more and more unsafe, and Elliptic Curve Cryptosystem is becoming the trend of public cryptography in the future. Object-oriented technology is mainly used as tools, and Elliptic Curve Cryptosystem is divided into several layers, every of which corresponds a class. The properties and methods of these classes are discussed, and some methods are implemented. In the end, the advantages are analyzed, and the cryptosystem implemented with advanced programming language is easy to transplant.     

A survey on joint tracking using expectation–maximization based techniques

Many target tracking problems can actually be cast as joint tracking problems where the underlying target state may only be observed via the relationship with a latent variable. In the presence of uncertainties in both observations and latent variable, which encapsulates the target tracking into a variational problem, the expectation–maximization (EM) method provides an iterative procedure under Bayesian inference framework to estimate the state of target in the process which minimizes the latent variable uncertainty. In this paper, we treat the joint tracking problem using a united framework under the EM method and provide a comprehensive overview of various EM approaches in joint tracking context from their necessity, benefits, and challenging viewpoints. Some examples on the EM application idea are presented. In addition, future research directions and open issues for using EM method in the joint tracking are given.     

基于单片机I/O口实现A/D转换方法

引言 在某些特定的场合（主要是在数字电子应用方面）,需要一个模拟信号输入来进行一些基本模拟量的测量,或者是提供可控的方式使用外部电位器。像这样的需求,由一个内置A/D（模/数）转换器的单片机就能很好地实现;当然,也可以使用一些经济的外部器件,由一个标准的数字I／O口来实现简单的A／D转换功能。     

基于Rocket I/O模块的高速I/O设计

介绍了采用Virtex-ⅡPRO系列FPGA设计的应用于下一代无线通信系统中的高速I/O。由于充分利用芯片中集成的RocketI/O模块,并采用差分输入参考时钟、8B/10B编码、预加重处理、通道绑定技术等,实现了四个绑定通道的高速互连(2.5Gbaud)。设计结果表明,采用RocketI/O模块进行高速I/O设计,可极大简化片上逻辑电路和片外PCB版图设计。     

I/O的冲刺——I/O体系结构演变

I/O总线是计算机设备的门神,来来往往的数据都要在这里受到盘查、转运。随着网络及存储速度的提高、数据量的增大,其性能表现益发受到用户重视,而PCI-X、NGIO等I/O技术的出现使我们看到了——     

A novel speech content authentication algorithm based on Bessel–Fourier moments

For audio watermark schemes, the method robust against desynchronization attacks based on synchronization codes faces security challenges. In this paper, a content-based method robust against insertion and deletion attacks is given, which is aimed to solve the insecurity problem of synchronization codes embedding, and a speech content authentication algorithm based on Bessel–Fourier moments is proposed. The definition and fast computation of Bessel–Fourier moments of discrete signal are given, and the attack on synchronization codes embedding method is described. For the scheme proposed, the non-synchronized signals caused by desynchronization attack can be re-synchronized by finding the frame that the watermark generated and extracted are equal. Comparing with the synchronization codes embedding method, the scheme not only is robust against insertion and deletion attacks, but also improves the security of watermark system. Theoretical analysis and experimental evaluation results show that the scheme is effective.     

A new force-directed graph drawing method based on edge–edge repulsion

The conventional force-directed methods for drawing undirected graphs are based on either vertex–vertex repulsion or vertex–edge repulsion. In this paper, we propose a new force-directed method based on edge–edge repulsion to draw graphs. In our framework, edges are modelled as charged springs, and a final drawing can be generated by adjusting positions of vertices according to spring forces and the repulsive forces, derived from potential fields, among edges. Different from the previous methods, our new framework has the advantage of overcoming the problem of zero angular resolution, guaranteeing the absence of any overlapping of edges incident to the common vertex. Given graph layouts probably generated by previous algorithms as the inputs to our algorithm, experimental results reveal that our approach produces promising drawings not only preserving the original properties of a high degree of symmetry and uniform edge length, but also preventing zero angular resolution and usually having larger average angular resolution. However, it should be noted that exhibiting a higher degree of symmetry and larger average angular resolution does not come without a price, as the new approach might result in the increase in undesirable overlapping of vertices as some of our experimental results indicate. To ease the problem of node overlapping, we also consider a hybrid approach which takes into account both edge–edge and vertex–vertex repulsive forces in drawing a graph.     

A highly parallel Black–Scholes solver based on adaptive sparse grids

In this paper, we present a highly efficient approach for numerically solving the Black–Scholes equation in order to price European and American basket options. Therefore, hardware features of contemporary high performance computer architectures such as non-uniform memory access and hardware-threading are exploited by a hybrid parallelization using MPI and OpenMP which is able to drastically reduce the computing time. In this way, we achieve very good speed-ups and are able to price baskets with up to six underlyings. Our approach is based on a sparse grid discretization with finite elements and makes use of a sophisticated adaption. The resulting linear system is solved by a conjugate gradient method that uses a parallel operator for applying the system matrix implicitly. Since we exploit all levels of the operator's parallelism, we are able to benefit from the compute power of more than 100 cores. Several numerical examples as well as an analysis of the performance for different computer architectures are provided.     

Team formation in social networks based on collective intelligence – an evolutionary approach

The tremendous growth of the social web has inspired research communities to discover social intelligence, which encompasses a wide spectrum of knowledge characterized by human interaction, communication and collaboration, thereby exploiting collective intelligence (CI) to support the successful existence of social communities on the Web. In this work, we address the team formation problem for generalized tasks where a set of experts is to be discovered from an expertise social network that can collaborate effectively to accomplish a given task. The concept of CI that emerges from these collaborations attempts to maximize the potential of the team of experts, rather than only aggregating individual potentials. Because the team formation problem is NP-hard, a genetic algorithm-based approach is applied to optimize computational collective intelligence in web-based social networks. To capture the essence of CI, a novel quantitative measure Collective Intelligence Index (CII) is proposed that takes two factors into account –the “enhanced expertise score” and the “trust-based collaboration score”. This measure relates to the social interactions among experts, reflecting various affiliations that form a network of experts that help to drive creativity by deepening engagements through collaboration and the exchange of ideas and expertise, thereby enriching and enhancing the knowledge base of experts. The presented model also captures the teams’ dynamics by considering trust, which is essential to effective interactions between the experts. The computational experiments are performed on a synthetic dataset that bears close resemblance to real-world expertise networks, and the results clearly establish the effectiveness of our proposed model.     

A simple deniable authentication protocol based on the Diffie–Hellman algorithm

Deniable authentication protocol is a new authentication mechanism in secure computer communication, that not only enables an intended receiver to identify the source of a received message but also prevents a third party from identifying the source of the message. In this paper, based on the Diffie–Hellman algorithm, we propose a new simple deniable authentication protocol from a provably secure simple user authentication scheme. Compared with other deniable authentication protocols, our proposed protocol not only achieves the property of deniable authenticity, but also provides the mutual authentication between the sender and the intended receiver and the confidentiality.     

无线I/O解决方案

菲尼克斯电气无线I／O产品采用跳频扩频系统实现的2,4GHz宽带传输模式。79个“跳频”通道可实现每秒1600次的频率变换。无线I／O模块和基站实现自动通信控制,并确保系统信号的传输在10ms以内完成,该模块还配置了一个ID-PLUG,用于通讯配置连接参数在基站和无线I／O模块之间传输,并可以集成到常见的现场总线网络当中,例如INTERBUS和PROFIBUS总线。     

利用FactorySuite 2000I/O Server Toolkit开发I/O Server

本文介绍了利用美国WONDERWARE公司的Wonder-ware FactorySuiteTM 2000 I/O Server Toolkit如何开发用户自己的I/O Server。     

利用FactorySuite 2000 I/O Server Toolkt开发I/O Server

本文介绍了利用美国WONDERWARE公司的Wonder-wareR FactorySuiteTM 2000 I/O Server Toolkit如何开发用户自己的I/O Server.     

微机I/O模块在PLC I/O扩展中的应用

本文在简要介绍PLC常用的I／O扩展技术基础上，重点介绍在I／O控制点较多的PLC控制系统中，如何使用价格相对较低的微机I／O模块来扩展PLC的I／O点，以降低系统的成本，提高经济效益。并以数字电子种LED显示控制为例，详细介绍了PLC控制系统中，采用微机I／O模块来扩展PLC的I／O点时，其硬件连接和梯形图编程方法。     

逐鹿服务器I/O

5月底,未来 I/O(FutureI/O)联盟在加入一个新成员Cisco 后,就服务器 I/O 标准取得进展。现在,未来 I/O 联盟的成员已经达到6个,3个创始成员是惠普、IBM 和康柏,另外3个是 Adaptec、3Com 和 Cisco 公司。大约有70家公司为未来 I/O技术添砖加瓦,尽管包括 Cisco公司在内的许多公司同时还支持由英特尔公司牵头的 NGIO(Next Generation I/O)论坛。Cisco 公司将进一步推动并在未来的产品中支持基于交换矩阵的服务器互联技术,该技术可以减少 I/O 阻塞,这也是阻碍当前高端服务器性能的主要问题。     

I/O的实施

在设备自动化升级过程中．置换I／O连接通常被看作是一种最基本的设备升级。设备内部I／O系统能够减少制造过程与控制系统之间因置换I／O连接而带来的不便。而且．在某些情况下．I／O系统甚至能够成为控制系统。     

8089 I/O处理机

<正> 3.1 8089I/O处理机概述 8089I/O处理机是一种单片式的通用I/O处理机,它把微处理机的处理功能和直接存贮器存取(DMA)控制器结合在一起。因此,它除了具有通常的DMA数据传送功能之外,还能够在传送数据过程中对数据进行翻译和比较,并可以设置多种结束数据传送的条件,例如:字节数传送完毕,数据比较符合或不符合,