XC9500系列CPLD遥控编程的实现

简单介绍了ＸＣ９５００系列ＣＰＬＤ器件及其系统内编程（ＩＳＰ）性能,接着讲述了ＸＣ９５００系列 ＣＰＬＤ器件遥控编程的实现方法,并重点介绍了在遥控编程系统中应用微控制器（ Ｉｎｔｅｌ ８０３１）实现嵌入式ＩＳＰ的软硬件设计。     

基于NRF9E5射频无线遥控系统的设计

介绍了一种基于8051内核的无线射频传输芯片nRF9E5，采用该芯片制作了扑翼微型飞行器的遥控系统，对遥控系统的收发装置进行了硬件设计，并对设计出的硬件系统进行了软件编程和系统的调试，实验表明，该系统具有成本少、功耗低、尺寸小的特点，能以较高质量在100-150米范围内进行信号的无线传输。     

基于单片机的红外遥控解码电路的设计

介绍红外遥控的发射与接收原理,给出遥控信号的识别与解码方法。本文设计基于单片机AT89C51单片机控制解码红外遥控器,对解码器硬件和相应的软件进行分析并给出流程图,实现对电视遥控器的解码及编码值显示。采用红外线遥控不仅完全可靠而且能有效地隔离电气干扰。所以采用单片机进行遥控系统的应用设计,遥控装置将同时具有编程灵活、控...     

基于LabVIEW的大功率电力电子装置监控系统设计

针对现有的电力监控系统开发周期长、专业性强的特点,设计了一种基于LabVIEW的大功率电力电子装置监控系统;系统实现了对电力电子装置的遥测、遥信、遥控及参数设置等功能;相对传统实现方法有编程简单、高效、程序移植方便等优点;设计了监控系统的硬件结构,论述了监控系统的软件实现方法,对通讯协议、软件模块进行了介绍;实验结果证明,该系统采集数据准确,实时性好,运行稳定、可靠,且程序扩展性强,具有一定的实用和推广价值。     

基于CPLD的红外遥控发射接收设计与仿真

该文在CPLD红外遥控原理的基础卜，详细介绍了在MAX＋PLUSⅡ的可编程逻辑设计环境下，用AHDL语言设计与仿真CPLD红外遥控发射接收硬件电路的方法。文中给出了利用AHDL语言分别实现红外遥控发射模块的信号调制以及接收模块的信号解码或识别的程序设计，并对结果进行了仿真。通过仿真结果，可以看出利用CPLD器件完全可以实现红外遥控电路的发射与接收功能。因此，CPLD器件在红外遥控系统中具有重要的实用价值。     

基于Java Servlet的WebMail系统

介绍了JavaServlet原理和电子邮件技术，讨论了一个基于JavaServlet的WebMail系统的原理，设计与实现，该系统采用Java编程，通过JDBC访问数据库，利用JavaMailAPI实现对邮件的操作，具有较好的可移植性和较高的安全性。     

基于微机打印口与PLC无线通信的监控系统

在集散控制系统中，如果控制节点分布广，敷设通信线路困难，通常采用成本较高的遥控遥测装置，文章介绍了一种利用微机打印并行口来实现PC和PLC间无线监控的系统，该系统具有低成本，适合远距离实时监控的特点，实际应用证明这种监控系统具有很强的灵活性和可扩展性，同时介绍了硬件接口设计及软件实现方法。     

基于SMS的无线远程监控中心系统设计与实现

为了经济简便的实现对无人值守设备的遥测、遥控，提出基于SMS的无线远程监控系统．首先给出了一个监控系统的组网结构，然后介绍了该监控系统监控中心的设计，最后重点阐述了监控中心软件的设计和实现．所设计和实现的基于SMS的无线远程监控中心系统可以作为一个基本模式，应用于多种领域．     

具有GPIB的多坐标定位测试系统

本文介绍了具有GPIB的多坐标定位测试系统的具体设计实现，并主要介绍了GPIB接口卡的通讯编程方法。     

基于DSP的无线通信系统在遥控插秧机中的应用

介绍了一种基于DSP的无线通信系统在遥控插秧机中的应用。讨论了该系统的构成和工作原理、系统的硬件设计和软件设计。系统实验结果表明,该系统稳定可靠,能够进行有效通信。为遥控插秧机的实现提供了可行依据,并且具有广阔的应用前景。     

Combining a monad and a comonad

We give a systematic treatment of distributivity for a monad and a comonad as arises in giving category theoretic accounts of operational and denotational semantics, and in giving an intensional denotational semantics. We do this axiomatically, in terms of a monad and a comonad in a 2-category, giving accounts of the Eilenberg–Moore and Kleisli constructions. We analyse the eight possible relationships, deducing that two pairs are isomorphic, but that the other pairs are all distinct. We develop those 2-categorical definitions necessary to support this analysis.     

Splitting a configuration in a simplex

This paper presents a new method of partition, named-splitting, of a point set ind-dimensional space. Given a pointG in ad-dimensional simplexT, T(G;i) is the subsimplex spanned by G and the ith facet ofT. LetS be a set ofn points inT, and let be a sequence of nonnegative integers ₁, ..., n_d+1 satisfying _i=1 ^d+1 ₁=n The-splitter of (T, S) is a pointG inT such thatT(G;i) contains at least _i points ofS in its closure for everyi=1, 2, ...,d + 1. The associated dissection is the re-splitting.The existence of a-splitting is shown for any (T, S) and, and two efficient algorithms for finding such a splitting are given. One runs inO(d²n logn + d³n) time, and the other runs inO(n) time if the dimensiond can be considered as a constant. Applications of re-splitting to mesh generation, polygonal-tour generation, and a combinatorial assignment problem are given.     

On a nonlinear problem of a sequential control with a parameter

The problem of evasion of a group of moving points from a nonlinear controlled object, whose goal is consecutively approach these points in a prescribed order, is analyzed. The movement of each point is defined uniquely by a scalar parameter chosen at the initial time instant. The controlled object minimizes a certain cost function, and the group of the points, acting cooperatively, maximize this cost function by choosing the parameters. Necessary optimality conditions for parameters are obtained. A model problem of an evasion of moving points from a vehicle is solved.     

Three-Link Mechanism as a Model of a Person on a Swing

Journal of Computer and Systems Sciences International - We model movements of a person swinging on a swing. We consider a flat three-link hinged mechanism as the main mechanical model of the...     

Not a castaway but a stowaway

A portable keyboard that's no larger than my phone, that's theiGo Stowaway.     

Locating a tree in a phylogenetic network

Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster Containment problem asks whether the given cluster is a cluster of some phylogenetic tree embedded in the network. Both problems are known to be NP-complete in general. In this article, we consider the restriction of these problems to several well-studied classes of phylogenetic networks. We show that Tree Containment is polynomial-time solvable for normal networks, for binary tree-child networks, and for level-k networks. On the other hand, we show that, even for tree-sibling, time-consistent, regular networks, both Tree Containment and Cluster Containment remain NP-complete.     

Linking a CYBER76 to a 3600

In mid-1973, the Division of Computing Research, CSIKO, took delivery of a Control Data CVBER76 computer, which acts as the primary processing power of the CSIRO computer network (CSIRONET), replacing the Control Data 3600. The 3600, running under the DAD operating system, has been retained as a ‘front-end’ to the CYBER76 and continues to support the following functions:

• 1 An interactive system allowing both editing and CYBER76 job submission
• 2 Input of job files centrally from 3600 input devices, remotely from CSIRONET devices, or from interactive console users, and output of results similarly
• 3 A permanent file (document) system, with tape archiving

This paper describes the linking of the CYBER76 to the 3600. Software for a CYBER76 PPU has been written and some changes to the 3600 and CYBER76 operating systems have been required.     

Transposing a matrix on a vector computer

There are many published algorithms for transposing a rectangular matrix in place, however none of these are suited to a vector processor. In this work we describe four methods and compare their speed and memory requirements to copying the matrix into workspace then back again in transposed order.