This paper introduces potentially-infinite list comprehensions into evolutionary computation. List comprehensions are programming constructs based on Zermelo-Fraenkel (ZF) set theory and are used in modern functional ...
详细信息
This paper introduces potentially-infinite list comprehensions into evolutionary computation. List comprehensions are programming constructs based on Zermelo-Fraenkel (ZF) set theory and are used in modern functional languages to define sets concisely. We present n new, higher-order, polymorphic and strongly-typed Genetic programming (GP) system. ZF-GP, that evolves potentially-infinite list comprehensions. The resulting language has a highly-focussed search space that is smaller than is typical in evolutionary computation. Experiments demonstrate that the ZF-GP system can evolve list comprehension solutions to formula-fitting problems more efficiently than random search.
Given a transfer function H(s) of order n, the celebrated bounded real lemma characterises the untractable semi-infinite programming (SIP) condition |H(jomega)| 2 gesgamma 2 forallomegaisinR of function bounded real...
详细信息
ISBN:
(纸本)1424401704;9781424401703
Given a transfer function H(s) of order n, the celebrated bounded real lemma characterises the untractable semi-infinite programming (SIP) condition |H(jomega)| 2 gesgamma 2 forallomegaisinR of function bounded realness (BR) by a tractable semi-definite programming (SDP). Some recent results generalise this result for the SIP condition |H(jomega)| 2 gesgamma 2 forall|omega|gesomega of frequency-selective bounded realness (FSBR). The SDP characterisations are given at the expense of an introduced Lyapunov matrix variable of dimension n x n. As a result, the dimension of the resultant SDPs grows so quickly in respect to the function order, making them much less computationally tractable and practicable. Moreover, they do not allow to formulate synthesis problems as SDPs. In this paper, a completely new SDP characterizations for general FSBR for all-pole transfer functions is proposed. Our motivation is the design of infinite-impulse-response (IIR) filters involving a few of simutaneous FS-BRs. Our SDP characterizations are of moderate size and free from Lyapunov variables and thus allow to address problems involving transfer functions of arbitrary order. Examples are also provided to validate the effectiveness of the resulting SDP design formulation. Finally we also raise some issues arising with practicability of SDP for multi-dimensional filter design problems. In particular, any bilinear matrix inequality (BMI) optimization is shown to be solved by a SDP with any prescribed tolerance but the issue is dimensionality of this SDP
A general impedance synthesizer using a minimum number of switching converters is studied in this paper. We begin with showing that any impedance can be synthesized by a circuit consisting of only two simple power con...
详细信息
A general impedance synthesizer using a minimum number of switching converters is studied in this paper. We begin with showing that any impedance can be synthesized by a circuit consisting of only two simple power converters, one storage element (e.g., capacitor), and one dissipative element (e.g., resistor) or power source. The implementation of such a circuit for synthesizing any desired impedance can be performed by: (i) programming the input current given the input voltage such that the desired impedance function is achieved; and (ii) controlling the amount of power dissipation (generation) in the dissipative element (source) so as to match the required active power of the impedance to be synthesized. Then, the instantaneous power will automatically be balanced by the storage element. Such impedance synthesizers find a lot of applications in power electronics. For instance, a resistance synthesizer can be used for power factor correction (PFC), a programmable capacitor or inductor synthesizer (comprising of small high-frequency converters) can be used for control applications.
Software processes can be treated as cooperative works among several engineers. In order to enact a software process in a distributed environment, the engineers must communicate with each other for exchanging data val...
详细信息
Software processes can be treated as cooperative works among several engineers. In order to enact a software process in a distributed environment, the engineers must communicate with each other for exchanging data values and synchronization messages. Such communications should be described in a process description for enacting the process automatically and clarifying the engineers' work. Since these communications are numerous, it is troublesome for the process designers to describe them minutely in the process description. They also make the description unreadable. We propose a formal software process model where we describe only a whole description of a process in which we describe only the contents and temporal orders of primitive activities, and do not specify the communications. From the whole description, we derive each engineer's individual description, automatically where the contents and orders of his activities and communications to others are described. A whole process is enacted by executing all individual descriptions in parallel. Both whole and individual descriptions are described in LOTOS/SPD, an extension of the formal specification language LOTOS. We have also developed a support system for deriving the individual descriptions and executing them on UNIX machines.< >
Model driven engineering (MDE) is a software development approach family based on the use of models in the software construction. It allows the exploitation of models to simulate, estimate, understand, communicate and...
详细信息
Model driven engineering (MDE) is a software development approach family based on the use of models in the software construction. It allows the exploitation of models to simulate, estimate, understand, communicate and produce *** paper tries to introduce MDE and presents its actual state. It starts by explaining the industrial world need for such approaches, sheds light on MDEpsilas principles, examines these principles in practice through a relevant alternative named model driven architecture (MDA) of the object management group (OMG), discusses Microsoftpsilas Software factories and IBMpsilas Manifesto MDA versus OMGpsilas MDA and presents some challenges facing the success of MDE.
Broadband networks have been well developed and increasedly applied in Chinese industries' and organizationspsila networks. The security problems in broadband networks are discussed widely and frequently. There ex...
详细信息
Broadband networks have been well developed and increasedly applied in Chinese industries' and organizationspsila networks. The security problems in broadband networks are discussed widely and frequently. There exit various network security protection tools, such as firewall, IDS (intrusion detection system), leak scanning and so on. All these tools deal with packet heads, not with detailed packet content. But some attacks, for example, guessing password, can only be examined in packet content. This paper presents a broadband network monitoring system (BBNMS) based on Libnids, which is an implementation of an e-component of network intrusion detection system. In the system not only packet heads but packet contents can be analyzed. The paper has explored three main topics: packet content analysis, packet real-time analyzing with optimized programming technologies and enhancing Libnidspsila function to detect PPPoE protocol packets of broadband network. Empirical results illustrate that the intrusion detection model can detect intrusion more accurately.
The Microsoft Transaction Server represents a new category of product that makes it makes it easier to develop and deploy high performance, scaleable, and reliable distributed applications. This is achieved by combini...
详细信息
The Microsoft Transaction Server represents a new category of product that makes it makes it easier to develop and deploy high performance, scaleable, and reliable distributed applications. This is achieved by combining the technology of component based development and deployment environments with the reliability and scaleability of transaction processing monitors.
EcoCast is an execution framework for macroprogramming of wireless sensor networks. Users access sensor nodes as dynamic objects in Python without being concerned with network protocols or data types. EcoCast extends ...
详细信息
EcoCast is an execution framework for macroprogramming of wireless sensor networks. Users access sensor nodes as dynamic objects in Python without being concerned with network protocols or data types. EcoCast extends Python's functional programming primitives map(), reduce(), and filter() to macroprogramming at native speed by patching the firmware transparently without rebooting, and without requiring most users to write code in C or assembly. This demo shows the use of EcoCast batch commands on wireless light controllers, which are composed of EcoSpire nodes connected to relay switches. Starting from only EcoCast firmware, we show incremental code generation and firmware patching, by loading necessary sensor drivers on demand. The composition of sensing value checking and light-switch actions shows how the firmware can be customized and programmed as a result of such an interactive session without writing a single line of C code.
At the 1995 Computer Assurance (COMPASS) conference, Voas and Miller (1995) presented a technique for assessing the failure tolerance of a program when the program was executing in unlikely modes (with respect to the ...
详细信息
At the 1995 Computer Assurance (COMPASS) conference, Voas and Miller (1995) presented a technique for assessing the failure tolerance of a program when the program was executing in unlikely modes (with respect to the expected operational profile). In that paper, several preliminary algorithms were presented for inverting operational profiles to more easily distinguish the unlikely modes of operation from the likely modes. This paper refines the original algorithms. It then demonstrates the new algorithms being used in conjunction with a failure tolerance assessment technique on two small programs.
We consider the following quasiconvex optimization problem: minimize the largest eigenvalue of a symmetric definite matrix pencil depending on parameters. A new form of optimality conditions is given, emphasizing a co...
详细信息
We consider the following quasiconvex optimization problem: minimize the largest eigenvalue of a symmetric definite matrix pencil depending on parameters. A new form of optimality conditions is given, emphasizing a complementarity condition on primal and dual matrices. Newton's method is then applied to these conditions to give a new quadratically convergent interior-point method which works well in practice. The algorithm is closely related to primal-dual interior-point methods for semidefinite programming.
暂无评论