The blackout of August 14, 2003 affected 8 states and fifty million people and could cost up to $5 billion2. Yet another press release claims it may have cost Ohio manufacturers $1.1 billion, based on a poll of 275 co...
详细信息
ISBN:
(纸本)0889864004
The blackout of August 14, 2003 affected 8 states and fifty million people and could cost up to $5 billion2. Yet another press release claims it may have cost Ohio manufacturers $1.1 billion, based on a poll of 275 companies. Preliminary reports3 indicate the outage progressed as a chain of relatively minor events, rather than a single catastrophic failure. This is consistent with previous cascading outages, which were caused by a domino reaction4. The increasingly ubiquitous use of embedded systems to manage and control our technologically complex society makes our homeland security even more vulnerable. Therefore, knowing how vulnerable such systems are is essential to improving their intrinsic reliability/survivability (in a deregulated environment knowing these important properties is equally essential to the providers).
In this paper we address the problem of processing a computationally intensive divisible load with high memory requirements on a bus network. Each network node is assumed to have a limited memory capacity (buffer spac...
In this paper we address the problem of processing a computationally intensive divisible load with high memory requirements on a bus network. Each network node is assumed to have a limited memory capacity (buffer space), while at the same time being available for processing after a specific time (release time). The combined influence of the release times, as well as the limited buffer capacity available, is considered in the problem formulation, with the objective to minimize the overall processing time of the divisible load. In the existing literature, these two issues have been considered independently, although in practice, they are commonly found to coexist. The Multi-Installment Balancing Strategy (MIBS) presented in this paper, manages to address both of these constraints by building on-top of the analytical solutions derived by a buffer capacity-unaware approach. MIBS monitors the available resources and adapts the processing and communication phases according to their availability. Towards this goal both single and/or multi-installment scheduling is utilized. The description of the algorithms accompany simulation experiments that highlight the behavior of MIBS. It should be stressed that the use of MIBS allows the processing of loads that exceed by far the total memory capacity of the available machines, while at the same time exhibiting processing times that match the ones predicted by strategies that ignore the memory constraints.
We report an entanglement extraction scheme in which polarization-entangled photons are generated in ultrafast type-II SPDC without the need for spectral filters. High-quality polarization entanglement is possible, re...
详细信息
We apply optimal control theory to substantially reduce transient times for transitions between in-phase and out-of-phase states in coupled solid-state lasers. The control is a time-varying optical field that is injec...
详细信息
We apply optimal control theory to substantially reduce transient times for transitions between in-phase and out-of-phase states in coupled solid-state lasers. The control is a time-varying optical field that is injected into the cavities of each laser. We have analytically derived the optimal control and numerically solved the optimality system. Numerical simulations indicate that transient times can be significantly reduced upon increasing the injection strength very briefly.
The real-time process algebra (RTFA) is a set of new mathematical notations for formally describing software system architectures, and static and dynamic behaviors. To bring RTPA into industrial software development p...
详细信息
ISBN:
(纸本)0780377818
The real-time process algebra (RTFA) is a set of new mathematical notations for formally describing software system architectures, and static and dynamic behaviors. To bring RTPA into industrial software development practice, tools are needed for analyzing and visualizing RTPA specifications. The first step to develop the supporting tools is to build a grammar parser for recognizing the RTPA notation system. In this paper, a parser of RTPA is described. The parser takes a textual RTPA specification as input, and generates an abstract syntax tree (AST) as its output. The generated AST represents RTPA tokens and lexical information in a structured format, which provides a foundation for further semantic analysis, code generation, visualization, and validation.
This paper presents two algorithms to aid the supervised learning of feedforward neural networks. Specifically, an initialization and a learning algorithm are presented. The proposed methods are based on the independe...
详细信息
The IP packets from a source are suitably forwarded by the routers along the path(s) to the destination. The packets destined to the routers themselves are called non-forwarding packets, and their processing is crucia...
详细信息
Maintenance and evolution of complex software systems (such as mobile telephones) involves activities such as reverse engineering (RE) and software visualization. Although several RE tools exist, we found their archit...
A method and a corresponding tool is described which assist design recovery and program understanding by recognising instances of design patterns semi-automatically. The approach taken is specifically designed to over...
详细信息
A method and a corresponding tool is described which assist design recovery and program understanding by recognising instances of design patterns semi-automatically. The approach taken is specifically designed to overcome the existing scalability problems caused by many design and implementation variants of design pattern instances. Our approach is based on a new recognition algorithm which works incrementally rather than trying to analyse a possibly large software system in one pass without any human intervention. The new algorithm exploits domain and context knowledge given by a reverse engineer and by a special underlying data structure, namely a special form of an annotated abstract syntax graph. A comparative and quantitative evaluation of applying the approach to the Java AWT and JGL libraries is also given.
暂无评论