Application of neural networks and machine learning in networkdesign

Communication network design is becoming increasingly complex, involving making networks more usable, affordable, and reliable. To help with this, we have proposed an expert network designer (END) for configuring, modeling, simulating, and evaluating large structured computer networks, employing artificial intelligence, knowledge representation, and network simulation tools. We present a neural network/knowledge acquisition machine-learning approach to improve the END's efficiency in solving the network design problem and to extend its scope to acquire new networking technologies, learn new network design techniques, and update the specifications of existing technologies     

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     

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.     

Transmission capacity of optical path overhead transfer schemeusing pilot tone for optical path network

Photonic networks based on the optical path concept and wavelength division multiplexing (WDM) technology require unique operation, administration, and maintenance (OAM) functions. In order to realize the required OAM functions, the optical path network must support an effective management information transfer method. The method that superimposes a pilot tone on the optical signal appears very interesting for optical path overhead transfer. The pilot tone transmission capacity is determined by the carrier to noise ratio which depends on the power spectral density of the optical signal. The pilot tone transmission capacity of an optical path network employing WDM technology is elucidated; 4.5 kb/s transmission can be realized when the pilot tone modulation index is set at 3%     

Cultural adaptation and information design: two contrasting views

Approaches to using visual language in a cultural context can be placed on a continuum, with global (universal) on one end and culture-focused on the other. Each approach reveals contrasting assumptions about three central design issues: perception, aesthetics and pragmatics. The global approach is characterized by attempts to invent an objective, universal visual language or to define such a language through perceptual principles and empirical research. The culture-focused perspective is founded on the principle that visual communication is intimately bound to experience and hence can function only within a given cultural context, to which designers must be sensitive. While the modernist, universal approach has been losing ground to the postmodern, culture-focused approach, the two complement each other in a variety of ways and, depending on the rhetorical situation, offer pragmatic benefits and drawbacks     

Handling multimedia information with VLSI

Identifies the basic technological components of multimedia communications. Among these technologies, multimedia processing and transmission already benefit heavily from VLSI advances. in fact, these two technologies could not have matured without special-purpose VLSI chips. We have examined basic processing required in these technologies and some VLSI architectures. The focus has been on standard-compliant VLSI chips, because the eventual goal of communications is to allow everyone to reach others without constraints. There are still a number of evolving standards, which means that we might witness yet another wave of VLSI chips for multimedia communications     

L－B膜修饰电极循环伏安行为模拟──（Ⅰ）电荷转移速度常数对循环伏安性能的影响

本文用计算机数字模拟方法研究了电活性分子多层Ｚ型Ｌ－Ｂ膜修饰电极的循环伏安行为。计算了电极与修饰Ｌ－Ｂ膜分子第一层之间的电荷转移速度常数Ｋ_ｏ，Ｌ－Ｂ膜分子层间的电荷转移速度常数ｋ_ｉ；对峰电位差△Ｅ_ｐ及阳极峰面积Ｑ的影响，以及在不同条件下各层分子的氧化态分数随扫描时间的变化。为研究和设计电活性分子修饰电极的实际体系提供了大量数据和信息。     

Function materialization in object bases: design, realization, andevaluation

View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM     

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     

Partial indexing for nonuniform data distributions in relationalDBMS's

It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B⁺trees. The effectiveness of the B ⁺tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B⁺tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described