Autonomic computing - self-configuring, self-healing, self-optimizing applications, systems and networks - is widely believed to be a promising solution to ever-increasing system complexity and the spiraling costs of ...
详细信息
Autonomic computing - self-configuring, self-healing, self-optimizing applications, systems and networks - is widely believed to be a promising solution to ever-increasing system complexity and the spiraling costs of human system management as systems scale to global proportions. Most results to date, however, suggest ways to architect new software constructed from the ground up as autonomic systems, whereas in the real world organizations continue to use stovepipe legacy systems and/or build ''systems of systems'' that draw from a gamut of new and legacy components involving disparate technologies from numerous vendors. Our goal is to retrofit autonomic computing onto such systems, externally, without any need to understand or modify the code, and in many cases even when it is impossible to recompile. We present a meta-architecture implemented as active middleware infrastructure to explicitly add autonomic services via an attached feedback loop that provides continual monitoring and, as needed, reconfiguration and/or repair. Our lightweight design and separation of concerns enables easy adoption of individual components, as well as the full infrastructure, for use with a large variety of legacy, new systems, and systems of systems. We summarize several experiments spanning multiple domains.
作者：
Fiege, LudgerGärtner, Felix C.Kasten, OliverZeidler, Andreas
Department of Computer Science Databases Distributed System Group D-64283 Darmstadt Germany
School of Computer and Communication Sciences Distributed Programming Laboratory CH-1015 Lausanne Switzerland
Department of Computer Science Distributed Systems Group CH-8092 Zurich Switzerland
Publish/subscribe (pub/sub) is considered a valuable middleware architecture that proliferates loose coupling and leverages reconfigurability and evolution. Up to now, existing pub/sub middleware was optimized for sta...
详细信息
The purpose of Generic Evolutionary Algorithms programming Library (GEA1) system is to provide researchers with an easy-to-use, widely applicable and extendable programming library which solves real-world optimization...
The purpose of Generic Evolutionary Algorithms programming Library (GEA1) system is to provide researchers with an easy-to-use, widely applicable and extendable programming library which solves real-world optimization problems by means of evolutionary algorithms. It contains algorithms for various evolutionary methods, implemented genetic operators for the most common representation forms for individuals, various selection methods, and examples on how to use and expand the library. All these functions assure that GEA can be effectively applied on many problems. GraphGEA is a graphical user interface to GEA written with the GTK API. The numerous parameters of the evolutionary algorithm can be set in appropriate dialog boxes. The program also checks the correctness of the parameters and saving/restoring of parameter sets is also possible. The selected evolutionary algorithm can be executed interactively on the specified optimization problem through the graphical user interface of GraphGEA, and the results and behavior of the EA can be observed on several selected graphs and drawings. While the main purpose of GEA is solving optimization problems, that of GraphGEA is education and analysis. It can be of great help for students understanding the characteristics of evolutionary algorithms and researchers of the area can use it to analyze an EA's behavior on particular problems.
作者：
朱建华郑玉臣Information Optics Institute
Sichuan University Chengdu 610064 Department of Physics and Materials Science
City University of Hong Kong Hong Kongn automatic visible spectrometer based on a non-collinear acousto-optic tunable filter (AOTF) is constructed for high-speed spectrometry. Its spectral filtering characteristics such as relationships between the radio-frequency (RF) driving frequency and the output central wavelength the output bandwidth and the central wavelength its typical spectral point spread function (PSF) and so on are studied systematically. The preliminary measurement results of AOTF spectrometer show that it is a solid-state high-speed easily controllable by computer-programming rugged and compact spectroscopic device in comparison with a conventional grating spectrometer and has the potential for widespread spectrometric applications.
An automatic visible spectrometer based on a non-collinear acousto-optic tunable filter (AOTF) is constructed for high-speed spectrometry. Its spectral filtering characteristics, such as relationships between the radi...
详细信息
An automatic visible spectrometer based on a non-collinear acousto-optic tunable filter (AOTF) is constructed for high-speed spectrometry. Its spectral filtering characteristics, such as relationships between the radio-frequency (RF) driving frequency and the output central wavelength, the output bandwidth and the central wavelength, its typical spectral point spread function (PSF), and so on, are studied systematically. The preliminary measurement results of AOTF spectrometer show that it is a solid-state, high-speed, easily controllable by computer-programming, rugged and compact spectroscopic device in comparison with a conventional grating spectrometer, and has the potential for widespread spectrometric applications.
We describe the design, implementation, and performance of a new system for access control on the web. To achieve greater flexibility in forming access-control policies – in particular, to allow better interoperabili...
详细信息
The shortest-paths problem is an important problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in ...
详细信息
The shortest-paths problem is an important problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The Shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one node to another often gives the best way to route message between the nodes. This paper presents an O(n 2 ) time algorithm for solving all pairs shortest path problems on trapezoid graphs which are extensions of interval graphs and permutation graphs. The space complexity of this algorithm is of O(n 2 ). This problem has been solved by constructing n breadth-first search (BFS) trees with each of the n vertices as root. As the lower bound of time complexity for computing the all pairs shortest paths is known to be of O(n 2 ), this proposed algorithm is optimal.
作者：
Gupta, GopalPontelli, EnricoApplied Logic
Programming Languages and Systems Lab. Department of Computer Science University of Texas at Dallas Richardson TX 95083 United States Laboratory for Logic
Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM 88003 United States
Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. We present a (constraint) logi...
详细信息
Modelica is a general equation-based object-oriented language for continuous and discrete-event modeling of physical systems for the purpose of efficient simulation. The language unifies and generalizes previous objec...
详细信息
Modelica is a general equation-based object-oriented language for continuous and discrete-event modeling of physical systems for the purpose of efficient simulation. The language unifies and generalizes previous object-oriented modeling languages. It is bringing about a revolution in this area, based on its ease of use, visual design of models with combination of Lego-like predefined model building blocks, its ability to define model libraries with re-usable components and its support for modeling and simulation of complex applications involving parts from several application domains. In this paper we present the Modelica language with emphasis on its language features and one of the associated simulation environments. Simulation models can be developed in an integrated problem-solving environment by using a graphical editor for connection diagrams. Connections are established just by drawing lines between objects picked from a class library. The principles of object oriented physical systems modeling and the multi-domain capabilities of the language are presented in the paper by several examples.
暂无评论