Digitally tunable optical filters using arrayed-waveguide grating(AWG) multiplexers and optical switches

Two novel configurations for digitally tunable optical filters based on arrayed-waveguide grating (AWG) multiplexers are described in detail with emphasis on the connection of the AWG multiplexer and optical switches. Performance comparisons show that conventional configurations are disadvantaged by the switch size required and loss imbalance among the optical frequency-division-multiplexed (FDM) channels; the proposed configurations require only O(√(N)) switch elements to select one of N FDM channels, and the loss imbalance is lower by up to 75% in decibel     

A new lateral MOS-gated thyristor with controlling base-current

A new lateral MOS-gated thyristor, called the Base-Current-Controlled Thyristor, is described. This device is designed so that most holes at the on-stage reach the P base through the floating P⁺ region adjacent to the P base and the on-state MOSFET. At the turn-off stage, the interruption of the hole current to the P base due to switching off the above MOSFET occurs simultaneously with the conventional turn-off operation. The concept of this device is verified experimentally by using the fabricated lateral device with the external MOSFET. This device exhibits a better trade-off relation between the on-state voltage and the turn-off time compared uith the conventional MOS-gated thyristor     

Automatic tuning of decentralized PID controllers for MIMO processes

An automatic tuning algorithm for decentralized PID control in multiple-input multiple-output (MIMO) plants is presented. This algorithm generalizes the authors' recent auto-tuner for two-input two-output systems to any number of inputs and outputs. The algorithm consists of two stages. In the first, the desired critical point, which consists of the critical gains of all the loops and a critical frequency, is identified. The auto-tuner identifies the desired critical point with almost no a priori information about the process. During the identification phase all controllers are replaced by relays, thus generating limit cycles with the same period in all loops. It is shown that each limit cycle corresponds to a single critical point of the process. By varying the relays parameters different points can be determined. The auto-tuner contains a procedure which converges rapidly to the desired critical point while maintaining the amplitudes of the process variables as well as of the manipulated variables within prespecified ranges. In the second stage, the data of the desired critical point is used to tune the PID controllers by the Ziegler-Nichols rules or their modifications. This paper focuses on the first stage. The steady-state process gains, which are required for the appropriate choice of the desired critical point, are determined by the auto-tuner in closed-loop fashion simultaneously with the identification of the critical point. The identification of the process gains is achieved at no extra plant time. Based upon a large number of simulated cases, the proposed auto-tuner seems to be efficient and robust. The paper discusses the underlying principles of the auto-tuner and its properties and capabilities are demonstrated via examples.     

Evaluating the impact of CASE: an empirical comparison of retrospective and cross-sectional survey approaches

The purpose of this paper is to evaluate two methods of assessing the productivity and quality impact of Computer Aided Software Engineering (CASE) and Fourth Generation Language (4GL) technologies: (1) by the retrospective method; and (2) the cross-sectional method. Both methods involve the use of questionnaire surveys. Developers' perceptions depend on the context in which they are expressed and this includes expectations about the effectiveness of a given software product. Consequently, it is generally not reliable to base inferences about the relative merits of CASE and 4GLs on a cross-sectional comparison of two separate samples of users. The retrospective method that requires each respondent to directly compare different products is shown to be more reliable. However, there may be scope to employ cross-sectional comparisons of the findings from different samples where both sets of respondents use the same reference point for their judgements, and where numerical rather than verbal rating scales are used to measure perceptions.     

Site and query scheduling policies in multicomputer databasesystems

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations     

An algebraic theory of object-oriented systems

The paper presents an algebraic specification of net objects. By net objects we mean those that are defined in object-oriented paradigms and those defined with nested relations in complex database models. An algebraic specification is set up that involves structures of net objects, accesses of net objects, and some features of object-oriented programming, such as multiple inheritance and polymorphism. Objects and their relationships are then characterized formally in the modeling, which utilizes the hierarchical approach in the algebraic theory of abstract data types, and is further developed by adding mechanisms from existing object systems. Categories of net objects are presented with the properties of accesses among them     

On loop transformations for generalized cycle shrinking

This paper describes several loop transformation techniques for extracting parallelism from nested loop structures. Nested loops can then be scheduled to run in parallel so that execution time is minimized. One technique is called selective cycle shrinking, and the other is called true dependence cycle shrinking. It is shown how selective shrinking is related to linear scheduling of nested loops and how true dependence shrinking is related to conflict-free mappings of higher dimensional algorithms into lower dimensional processor arrays. Methods are proposed in this paper to find the selective and true dependence shrinkings with minimum total execution time by applying the techniques of finding optimal linear schedules and optimal and conflict-free mappings proposed by W. Shang and A.B. Fortes     

On the design of dynamic associative neural memories

We consider the design problem for a class of discrete-time and continuous-time neural networks. We obtain a characterization of all connection weights that store a given set of vectors into the network, that is, each given vector becomes an equilibrium point of the network. We also give sufficient conditions that guarantee the asymptotic stability of these equilibrium points.     

Neural network control of communications systems

Neural networks appear well suited to applications in the control of communications systems for two reasons: adaptivity and high speed. This paper describes application of neural networks to two problems, admission control and switch control, which exploit the adaptivity and speed property, respectively. The admission control problem is the selective admission of a set of calls from a number of inhomogeneous call classes, which may have widely differing characteristics as to their rate and variability of traffic, onto a network. It is usually unknown in advance which combinations of calls can be simultaneously accepted so as to ensure satisfactory performance. The approach adopted is that key network performance parameters are observed while carrying various combinations of calls, and their relationship is learned by a neural network structure. The network model chosen has the ability to interpolate or extrapolate from the past results and the ability to adapt to new and changing conditions. The switch control problem is the service policy used by a switch controller in transmitting packets. In a crossbar switch with input queueing, significant loss of throughput can occur when head-of-line service order is employed. A solution can be based on an algorithm which maximizes throughput. However since this solution is typically required in less than one microsecond, software implementation policy is infeasible. We will carry out an analysis of the benefits of such a policy, describe some existing proposed schemes for its implementation, and propose a further scheme that provides this submicrosecond optimization.     

A semantic modeling approach for image retrieval by content

We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.