A digital secure image communication scheme based on the chaotic Chebyshev map

In this paper, a simple image secure communication scheme based on the chaotic Chebyshev map and chaos synchronization is proposed. The scheme relies on the excellent correlation property of chaotic sequences, which is very desirable for secure image communication. The results obtained by computer simulation indicate that the transmitted source image can be correctly and reliably recovered using the proposed scheme, even through a noisy channel. Notably, the scheme possesses relatively high security and can be easily implemented. Moreover, the quality of the recovered image is satisfactory, quantified by such common criteria as the bit‐error rate performance. Copyright © 2004 John Wiley & Sons, Ltd.     

实时数字引导中的数据处理

阐述了航天统一测控站在卫星和飞船发射过程中，实时数字引导中的数据处理。其中包括数据变换、数据的时间比对、外推估值等方法，提高了数字引导精度和设备的角度捕获能力。     

Kripke Semantics for Modal Substructural Logics

We introduce Kripke semantics for modal substructural logics, and provethe completeness theorems with respect to the semantics. Thecompleteness theorems are proved using an extended Ishihara's method ofcanonical model construction (Ishihara, 2000). The framework presentedcan deal with a broad range of modal substructural logics, including afragment of modal intuitionistic linear logic, and modal versions ofCorsi's logics, Visser's logic, Méndez's logics and relevant logics.     

可编程光学二值双轨逻辑门

基于双轨逻辑,本文提出一种可级联的并行二值逻辑门。所有十六种二值逻辑运算可以采用偏振半波相延编程来实现。也提出了用电光晶体实现实时编程的方法。本文中给出了实验结果。     

Resolution calculus for the first order linear logic

This paper presents a formulation and completeness proof of the resolution-type calculi for the first order fragment of Girard's linear logic by a general method which provides the general scheme of transforming a cutfree Gentzen-type system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov for classical predicate logic. Ideas of the author and Zamov are used to avoid skolomization. Completeness of strategies is first established for the Gentzen-type system, and then transferred to resolution. The propositional resolution system was implemented by T. Tammet.     

IS—95CDMA系统的容量分析

容量的需求是推动ＣＤＭＡ数字蜂窝移动通信开发的主要动力。系统的容量受许多因素的影响，本文针对ＩＳ－９５ＣＤＭＡ系统在采用了功率控制、话音激活和扇区划分技术的情况下，对系统的容量进行了分析，同时也分析了功率控制精度对容量的影响。     

Safety,liveness and fairness in temporal logic

In this paper we present syntactic characterization of temporal formulas that express various properties of interest in the verification of concurrent programs. Such a characterization helps us in choosing the right techniques for proving correctness with respect to these properties. The properties that we consider include safety properties, liveness properties and fairness properties. We also present algorithms for checking if a given temporal formula expresses any of these properties.This work is partly supported by NSF grant CCR-9212183. A preliminary version of this paper appeared in the Fourth ACM Symposium on Principles of Distributed Computing.     

A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol

We present a formal model of asynchronous communication between two digital hardware devices. The model takes the form of a function in the Boyer-Moore logic. The function transforms the signal stream generated by one processor into that consumed by an independently clocked processor, given the phases and rates of the two clocks and the communications delay. The model can be used quantitatively to derive concrete performance bounds on communications at ISO protocol level 1 (physical level). We use the model to show that an 18-bit/cell biphase mark protocol reliably sends messages of arbitrary length between two processors provided the ratio of the clock rates is within 5% of unity.     

与国际综合业务数字网连接的京,沪,穗国际交换机工程

本文介绍了在新建的北京、上海、广州、国际交换机工程中采用新一代程控交换技术接通国际综合业务数字网，以及本工程采用的中继方式。     

New and used temporal models: An issue of time

TheSpecial Issue on Applications of Temporal Models raises many issues of time: What are the important properties of time? How can time be best represented? How can one reason about time-dependent properties? What are the important directions of temporal research? This introductory piece very briefly surveys the current wide variety of temporal models, temporal reasoning methods, and applications to time-varying phenomena. Promising areas of investigation such as the verification of concurrent systems, knowledge-base representation methods, and dealing with theFrame Problem pass in fleeting review. Brief introductions to each of the works in the volume close the section.