用CH365实现PCI总线与DSP的通信

针对数控机床控制发展中的新要求,提出并设计一种新型的控制方案。运用PCI总线实现与DSP的通信,以提高控制效率和实时性;应用CPLD解决双口RAM的仲裁控制逻辑问题。在硬件设计完成之后,提出了双向通信的软件测试方法。     

基于PCl总线的DSP伺服控制卡的研究与设计

通过对DSP芯片（TMS320VC33）、PCI9052接口芯片和伺服控制卡的功能和结构特点进行深入分析，设计了一种基于PCI总线的DSP伺服控制卡。实践证明，本文所设计的伺服控制卡能够满足目前控制系统的性能要求。     

基于PCI总线的CAN卡的设计与实现

介绍了PCI桥接口芯片PCI9052和CAN接口芯片SJA1000,给出了基于PCI总线的CAN总线适配卡软硬件的设计思路、过程及实现方法。     

TMS320VC33 DSP与PCI总线的接口设计

为了适应托克马克极向场控制系统的需要，利用PCI9052与FPGA设计了TMS320VC33与PCI总线的接口，实现了DSP与主机间的高速数据传输。     

基于PCI总线的DSP伺服控制卡的研究与设计

通过对DSP芯片(TMS320VC33)、PCI9052接口芯片和伺服控制卡的功能和结构特点进行深入分析,设计了一种基于PCI总线的DSP伺服控制卡.实践证明,本文所设计的伺服控制卡能够满足目前控制系统的性能要求.     

基于PCI总线的高速数据采集接口的设计与实现

PCI总线接口控制器的设计是基于PCI总线的应用设计的关键所在.本文在介绍PCI9054接口控制器的基础上,给出了一种通用的高速数据采集接口的设计,并提出了一种新的包括PCI9054单周期读、写和DMA读操作的VHDL状态机设计.经测试证明,该接口的数据采集速率能稳定的达到200Mbit/s.     

基于PCI总线的高速数据采集接口的设计与实现

PCI总线接口控制器的设计是基于PCI总线的应用设计的关键所在。本文在介绍PCI9054接口控制器的基础上,给出了一种通用的高速数据采集接口的设计,并提出了一种新的包括PCI9054单周期读、写和DMA读操作的VHDL状态机设计。经测试证明,该接口的数据采集速率能稳定的达到200Mbit/s。     

泾渭分明的两极：串行总线与并行总线

时下，总线技术正在进行一场革命，高速串行总线纷纷取代传统的并行总线，例如串行ATA(串行)取代并行ATA，基于串行技术的PCI Express将取代目前的PCI总线，而现在流行的Hyper Tranport、USB2.0、IEEE1394a／b等高速总线也均为串行体系。相比之下，传统的并行总线日薄西山，其速度也未得到继续提升，为何会出现这样的状况呢？     

PCI总线卡设计与实现的几个关键问题

PCI是一种高性能的局部总线规范,可实现各种功能的标准PCI总线卡,取得了广泛应用,本文简要介绍与PCI总线卡设计及实现相关的几个关键技术问题,主要包括时钟与复位信号,总线分支长度的限制,电平转称换电路,PCI总线对负载的要求等。     

浅析总线技术

本文简要介绍了计算机发展中的几种总线技术及其简要协议定义、技术特点等，并对几种总线技术进行了比较，最后，展望了未来总线技术的发展方向。     

Vague集向Fuzzy集转化的一种新方法

提出Vague值向Fuzzy值转化的实用方法的定义。针对文献[6]中的一个Vague值向Fuzzy值转化的均值修正法,提出了加权均值修正法,并证明了这种方法同样是Vague值向Fuzzy转化的一种非常实用的方法。     

Virtual Triangulation Sensor Development, Behavior Simulation and CAR Integration Applied to Robotic Arc-Welding

Background: An increasing number of industrial robots are being programmed using CAR (Computer Aided Robotics). Sensor guidance offers a means of coping with frequent product changes in manufacturing systems. However, sensors increase the uncertainty and to preserve system robustness, a tool is needed that makes it possible to understand a sensor guided robot system before and during its actual operation in real life.Scope: A virtual sensor is developed and integrated in a CAR hosted environment. The real sensor is of a type commonly used in the arc-welding industry and uses a triangulation method for depth measurements. The sensor is validated both statically and dynamically by matching it with a real sensor through measurements in setups and by comparing a welding application performed in a real and a virtual work-cell created with a CAR application. The experimental results successfully validates its performance. In this context, a virtual sensor is a software model of a physical sensor with similar characteristics, using geometrical and/or process specific data from a computerized model of a real work-cell.     

The conversion of a dynamic B-spline curve into piecewise polynomials in power form

The evaluation of points and the computations of inflection points or cusps on a curve are often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed into a set of piecewise polynomial curves in power form. The usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in power form is done either by a knot refinement followed by basis conversions, or by applying a Taylor expansion on each knot span of a B-spline curve.Presented in this paper is a new algorithm to convert a B-spline curve into a set of piecewise polynomial curves in power form. Experiment shows that the proposed algorithm significantly outperforms the conventional approach when one or more control points of a B-spline curve are continuously moving.     

关于一种网格运行时结构的若干注记

进程是传统计算机系统的一个核心概念，自1960年出现以来一直沿用至今，进程的一个主要目的是为主体提供一种运行时结构，在操作系统和处理器硬件支持下，代表主体访问和使用各种资源，与传统的单机和并行机计算平台相比，网格计算机中进程所对应的概念面临新的挑战，包括网格资源繁杂、自主控制的条件下的单一系统映像和资源的共享与协同、与特定操作系统的松耦合、时间和空间的流动性、更高级的交互性，提出一种称为网程(grip)的运行时结构，试图解决上述问题，网程运行在网格操作系统之上，代表网格主体，访问和使用网格资源。     

On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion

We show how Ohori and Sasano's recent lightweight fusion by fixed-point promotion provides a simple way to prove the equivalence of the two standard styles of specification of abstract machines: (1) in small-step form, as a state-transition function together with a ‘driver loop’, i.e., a function implementing the iteration of this transition function; and (2) in big-step form, as a tail-recursive function that directly maps a given configuration to a final state, if any. The equivalence hinges on our observation that for abstract machines, fusing a small-step specification yields a big-step specification. We illustrate this observation here with a recognizer for Dyck words, the CEK machine, and Krivine's machine with call/cc.The need for such a simple proof is motivated by our current work on small-step abstract machines as obtained by refocusing a function implementing a reduction semantics (a syntactic correspondence), and big-step abstract machines as obtained by CPS-transforming and then defunctionalizing a function implementing a big-step semantics (a functional correspondence).     

An Interactive Designing System with Virtual Sculpting and Virtual Woodcut Printing

In this paper, we propose an interactive designing method and a system based on it to create 3D objects and 2D images. This system consists of two subsystems for virtual sculpting to create a 3D shape and virtual printing to produce a picture with a printing block. In the virtual sculpting subsystem, a user can form solid objects with curved surfaces as if sculpting them. The user operates virtual chisels, and can remove or attach arbitrary shapes of ellipsoids or cubes from or to the workpiece. A 3D object generated by virtual sculpting looks like a real wooden sculpture. If using a board as a workpiece, a user can generate a virtual printing block. In the virtual printing subsystem, a user can synthesize a woodcut printing image from the virtual printing block mentioned above, a virtual paper sheet, and a printing brush. The user can synthesize a realistic woodcut print with a procedure similar to the actual woodcut printing.     

Error estimate for quasistatic history-dependent contact model

In this paper we consider a mathematical model which describes a quasistatic process for a viscoelastic body in contact with an obstacle or a foundation. The variational formulation of the problem is in the form of a system coupling a nonlinear integral equation with a history-dependent hemivariational inequality. We establish a fully discrete scheme of the abstract problem and derive a result on error estimate.     

Identification and data-driven model reduction of state-space representations of lossless and dissipative systems from noise-free data

We illustrate procedures to identify a state-space representation of a lossless or dissipative system from a given noise-free trajectory; important special cases are passive systems and bounded-real systems. Computing a rank-revealing factorization of a Gramian-like matrix constructed from the data, a state sequence can be obtained; the state-space equations are then computed by solving a system of linear equations. This idea is also applied to perform model reduction by obtaining a balanced realization directly from data and truncating it to obtain a reduced-order model.     

The importance of introducing a waiting time for Lattice Monte Carlo simulations of a polymer translocation process

For a standard Lattice Monte Carlo (LMC) simulation of a random walker subject to a bias, it is impossible to obtain both a correct mean velocity and diffusion coefficient. To correct this, a modified LMC algorithm has been developed where the introduction of a probability of remaining in the current state allows for a distribution of intervals between jumps. In this paper, we demonstrate the impact of this modification for a first-passage problem: the translocation of a polymer through a nanopore. We find that while either approach yields the correct mean first-passage time, the incorporation of a waiting time is necessary to obtain the correct spread of times.     

A disruption recovery plan in a three-stage production-inventory system

This paper proposes a recovery plan for managing disruptions in a three-stage production-inventory system under a mixed production environment. First, a mathematical model is developed to deal with a disruption at any stage while maximizing total profit during the recovery-time window. The model is solved after the occurrence of a disruption event, with changed data used to generate a revised plan. We also propose a new and efficient heuristic for solving the developed mathematical model. Second, multiple disruptions are considered, where a new disruption may or may not affect the recovery plans of earlier disruptions. The heuristic, developed for a single disruption, is extended to deal with a series of disruptions so that it can be implemented for disruption recovery on a real-time basis. We compare the heuristic solutions with those obtained by a standard search algorithm for a set of randomly generated disruption test problems, and that show the consistent performance of our developed heuristic with lower computational times. Finally, some numerical examples and a real-world case study are presented to demonstrate the benefits and usefulness of our proposed approach.