A Bluetooth Routing Protocol Using Evolving Fuzzy Neural Networks

In this paper, a routing protocol which utilizes the characteristics of Bluetooth technology is proposed for Bluetooth-based mobile ad hoc networks. The routing tables are maintained in the master devices and the routing zone radius for each table is adjusted dynamically by using evolving fuzzy neural networks. Observing there exists some useless routing packets which are helpless to build the routing path and increase the network loads in the existing ad hoc routing protocols, we selectively use multiple unicasts or one broadcast when the destination device is out of the routing zone radius coverage of the routing table. The simulation results show that the dynamic adjustment of the routing table size in each master device results in much less reply time of routing request, fewer request packets and useless packets compared with two representative protocols, Zone Routing Protocol and Dynamic Source Routing.     

Reasoning, Integration, Inference Alteration, and Text Comprehension.

This paper reports how the study of formal logical reasoning provides insight into more everyday types of reasoning, such as that involved in language comprehension. Both of these types of cognition are thought to involve the use of mental models, and so it is reasonable to think that the cognitive operations needed for formal logical reasoning would be involved in everyday reasoning as well. We focused on three aspects of formal reasoning: (a) the integration of information into a common mental model, (b) the drawing of inferences, and (c) the coordination of alternative possibilities. We were able to show that the integration and inference components were related to narrative comprehension processes, but the coordination of alternative models was not. Thus, there is evidence for some overlap in the mental processes used in formal and everyday reasoning. This further justifies the study of formal logical reasoning as a window into certain types of everyday reasoning. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

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.     

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.     

A fuzzy diagnosis approach using dynamic fault trees

By incorporating digraph models, fault trees and fuzzy inference mechanisms in a unified framework, a novel approach for fault diagnosis is developed in this work. To relieve the on-line computation load, the fault origins considered in diagnosis are limited to the basic events in the cut sets of a given fault tree. The symptom occurrence order associated with each root cause is derived from system digraph with the qualitative simulation techniques. The implied candidate patterns are enumerated according to two proposed theorems and then encoded in the inference system with IF-THEN rules. The simulation results show that the proposed approach is not only feasible but also capable of identifying the most likely cause(s) of a hazardous event at the earliest possible time.     

异步时序型PAL解析方法的研究及解析结果分析

本文就异步时序现ＰＡＬ的解析，提出了一种状态图遍历算法。