Two-time scale (TTS) distributions are introduced. For a class of stable systems, it is shown that every TTS distribution has a two-frequency-scale (TFS) Laplace transform. Conversely, it is shown that the impulse res...
详细信息
Two-time scale (TTS) distributions are introduced. For a class of stable systems, it is shown that every TTS distribution has a two-frequency-scale (TFS) Laplace transform. Conversely, it is shown that the impulse response of any stable TFS transfer function, and hence any stable (standard) singularly perturbed system, can be characterized in terms of a stable TTS distribution. A time domain decomposition for TTS distributions is obtained which parallels the slow and fast decompositions of singularly perturbed systems and also the frequency domain decompositions of TFS transfer functions. It is shown that every stable TTS distribution can be decomposed in terms of two simpler distributions represented in two different time scales. A composite distribution is constructed from these two which approximates the TTS distribution arbitrarily closely in the L/sub 1/ norm.< >
Chains of Recurrences (CR's) are introduced as an effective method to evaluate functions at regular intervals. Algebraic properties of CR's are examined and an algorithm that constructs a CR for a given functi...
详细信息
ISBN:
(纸本)9780897916387
Chains of Recurrences (CR's) are introduced as an effective method to evaluate functions at regular intervals. Algebraic properties of CR's are examined and an algorithm that constructs a CR for a given function is explained. Finally, an implementation of the method in MAXIMA/Common Lisp is discussed.
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of process algebras, we develop some combina...
详细信息
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of process algebras, we develop some combinators expressible in this model, and reconcile their operational, logical and denotational character. We show how programs may be compiled into finite-state machines with loop-free computations at each state, thus guaranteeing bounded response time.< >
We present simple methods to enhance a recently proposed class of fully adaptive algorithms for fault tolerant wormhole routing. These algorithms are based on J. Duato's (1993) theory and are being used in several...
详细信息
We present simple methods to enhance a recently proposed class of fully adaptive algorithms for fault tolerant wormhole routing. These algorithms are based on J. Duato's (1993) theory and are being used in several research projects. We show that with three virtual channels per physical channel, multiple rectangular shaped fault blocks can be tolerated in two dimensional meshes. There is no restriction on the number of faults, and maintaining fault information locally is sufficient. The logic for fault tolerant routing is used only in the presence of faults, and there is no performance degradation in the absence of faults. The proposed technique incorporates fault tolerance into wormhole algorithms with simple logic and low virtual channel requirements.< >
We present simple techniques to enhance the e-cube algorithm for fault-tolerant routing in mesh networks. These techniques are based on the concept of fault rings, which are formed using fault free nodes and links aro...
详细信息
ISBN:
(纸本)9780818666056
We present simple techniques to enhance the e-cube algorithm for fault-tolerant routing in mesh networks. These techniques are based on the concept of fault rings, which are formed using fault free nodes and links around each fault region. We use fault rings to enhance the e-cube to route messages in the presence of rectangular block faults. We show that if fault rings do not overlap with one another-the sets of links in fault rings are pairwise disjoint, then two virtual channels per physical channel are sufficient to make the e-cube tolerant to any number of faulty blocks. For more complex cases such as overlapping fault rings and faults on network boundaries, three or four virtual channels are used. In all cases, the routing guarantees livelock and deadlock free delivery of each and every message injected into the network. Our simulation results for isolated faults indicate that the proposed method provides acceptable performance with as many as 10 percent faulty links.< >
The problems faced by people whose physical impairments include the inability to communicate through speech are demonstrated by the fact that, even with current technology, speech rates achievable using speech output ...
详细信息
The problems faced by people whose physical impairments include the inability to communicate through speech are demonstrated by the fact that, even with current technology, speech rates achievable using speech output devices typically vary between 2-10 words per minute. We have been investigating ways in which the communication system itself could take on many of the cognitive and manipulative tasks required to locate and produce suitable prestored texts for the user. The storage and retrieval methods we have investigated include a text database with items indexed semantically and pragmatically, logging conversational paths for reuse, hypertext, and fuzzy information retrieval. The ultimate goal of this work is a communication system which will allow a severely impaired nonvocal person to make a significantly better conversational impact than is possible with present systems.< >
This paper discusses some classification and enumeration problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subsets over r values. Boolean functions are convenient choice ...
详细信息
This paper discusses some classification and enumeration problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subsets over r values. Boolean functions are convenient choice as building blocks in the design of set logic functions. Weak maximal sets are these containing all Boolean functions. The authors give the number of n-ary functions in each weak maximal set and and some properties of intersections of weak maximal sets in r-valued set logic. These properties are used to classify all three-valued set logic functions according to the weak maximal sets they belong to. They prove that there are 29 such classes of functions and give a unary function representative for each of them. Finally, they find the number of n-ary weak Sheffer functions of three-valued set logic, i.e. functions which are complete under compositions with Boolean functions.< >
We present a cognitive approach to generalisation, Bidirectional Convergence. This is the implementation of a cognitive process we call concept crystallisation, whereby a concept is formed gradually from initially man...
详细信息
We present a cognitive approach to generalisation, Bidirectional Convergence. This is the implementation of a cognitive process we call concept crystallisation, whereby a concept is formed gradually from initially many possibilities which converge to a single possibility under the weight of a series of learning instances shown over a period of time. Bidirectional Convergence (BDC) is a form of concept crystallisation that represents the alternative possible concepts through. Boundary versions of the concept during learning. BDC is an abstraction of Mitchell's symbolic concept learning technique (1982). We describe how BDC is evolved from Mitchell's technique into a form suitable for incorporation into neural networks, BDC is shown to provide a best-fit to given problems.< >
Multimedia application integrates a variety of media, namely, audio, video, images, graphics, text and data. The ATM (Asynchronous Transfer Mode) technique has been recommended by the CCITT as the transport vehicle fo...
详细信息
Multimedia application integrates a variety of media, namely, audio, video, images, graphics, text and data. The ATM (Asynchronous Transfer Mode) technique has been recommended by the CCITT as the transport vehicle for BISDN (Broadband Integrated Service Digital networks) which is designed to provide multimedia traffic services. In this work we study some of the ATM-compatible multiple access MAN (Metropolitan Area Network) protocols, including DQDB (Distributed Queue Dual Bus, also known as IEEE 802.6), CRMA (Cyclic Reservation Multiple Access), DQMA (Distributed Queue Multiple Access), and FDQ (Fair Distributed Queue), and their performance for different kinds of multimedia application, including interactive education, on-line medical information system, and video conferences. We found that all four protocols achieve maximum throughput even at extremely high data rate, which make them suitable for carrying multimedia traffic in high speed networks.
A scheme for recognizing 3D objects from single 2D images is introduced. The scheme proceeds in two stages. In the categorization stage, the image is matched against prototype objects, and in the identification stage,...
详细信息
A scheme for recognizing 3D objects from single 2D images is introduced. The scheme proceeds in two stages. In the categorization stage, the image is matched against prototype objects, and in the identification stage, the observed object is matched against the individual models of its class, where classes are expected to contain objects with relatively similar shapes. The advantage of categorizing the object before it is identified is twofold. First, the image is compared to a smaller number of models, since only models that belong to the object's class need to be considered. Second, the cost of comparing the image to each model in a class is very low, because correspondence is computed once for the whole class. The correspondence and object pose computed in the categorization stage to align the prototype with the image are reused in the identification stage to align the individual models with the image. As a result, identification is reduced to a series of simple template comparisons.< >
暂无评论