用CPLD实现SRAM工艺FPGA的安全应用

提出了一种利用CPLD产生的伪随机码来加密SRAM工艺FPGA的方法,并详细介绍了具体的电路和VHDL代码。     

插补法CAI研究

数字程序控制计算机辅助教学是将计算机技术用于数字程序控制的教学过程，它帮助学生学习并模拟教学实验．本文介绍了数字程序控制中直线插补和圆孤插补的ＣＡＩ实现方法．     

VB中实现打印功能的方法

介绍了在VB开发的应用程序中,实现打印功能的几种方法.这些方法包括:①打印窗口;②通过PRINTER打印;③利用数据报表进行打印;④将打印内容传送于Office组件的Word或Excel,通过Word、Excel打印.同时列出了相关的程序格式.     

数字电视传输流的实时码率变换系统

数字视频压缩后通常是打包成传输流的形式进行传送，年个传输流有其固定的发送码率，在某些应用场合，比如信道调制前端，需要对输入传输流码率进行改变以适应该信道要求，描述了一种全硬件实现，双路输出，实时，节目可选择的码率变换系统的原理及具体实现。     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

Running programs backwards: The logical inversion of imperative computation

Imperative programs can be inverted directly from their forward-directed program code with the use of logical inference. The relational semantics of imperative computations treats programs as logical relations over the observable state of the environment, which is taken to be the state of the variables in memory. Program relations denote both forward and backward computations, and the direction of the computation depends upon the instantiation pattern of arguments in the relation. This view of inversion has practical applications when the relational semantics is treated as a logic program. Depending on the logic programming inference scheme used, execution of this relational program can compute the inverse of the imperative program. A number of nontrivial imperative computations can be inverted with minimal logic programming tools.     

二阶A型Cooper变换的增强型

对二阶Ａ型Ｃｏｏｐｅｒ变换进行增强，放宽可用性条件，并证明了其正确性，最后举例说明其应用。     

高校电视台节目漫谈

结合高校校园电视台的职能和特点 ,深刻剖析了高校电视台几种类型节目的特点以及对高校校园文化的作用。     

Rank order filters and priority queues

Summary A derivation of a parallel algorithm for rank order filtering is presented. Both derivation and result differ from earlier designs: the derivations are less complicated and the result allows a number of different implementations. The same derivation is used to design a collection of priority queues. Both filters and priority queues are highly efficient: they have constant response time and small latency. Anne Kaldewaij received an M.Sc. degree in Mathematics from the University of Utrecht (The Netherlands) and a Ph.D. degree in Computing Science from the Eindhoven University of Technology. Currently, he is associate professor in Computing Science at Eindhoven University. His research includes parallel programming and the design of algorithms and data structures. He enjoys teaching and he has written a number of textbooks on mathematics and programming. Jan Tijmen Udding received an M.Sc. degree in Mathematics in 1980 and a Ph.D. degree in Computing Science in 1984 from Eindhoven University of Technology. Currently, he is associate professor at Groningen University. His main research interests are mathematical aspects of VLSI, program derivation and correctness, and functional programming.     

多任务调度算法在单片机控制系统中的应用

为了满足单片机控制系统的复杂要求 ,提出了多任务调度算法 ,通过与单任务程序结构的对比和分析 ,详细说明了多任务调度算法的实现 ,指出了应用该算法的必要性 ,并且以科研生产的实例说明其具体应用。