In this paper, a new embedded OTP bit-cell (Neobit) is presented for one-/multiple-time programming (OTP/MTP) application, which is fabricated by using a generic logic process. Without additional processing or extra f...
详细信息
In this paper, a new embedded OTP bit-cell (Neobit) is presented for one-/multiple-time programming (OTP/MTP) application, which is fabricated by using a generic logic process. Without additional processing or extra fabrication cost, this single-poly NVM can be implemented in various CMOS technologies such as logic, mixed-mode, analog, RF, HV and etc. Due to its easy incorporation with any IC design, this single-poly NVM can be comprehensively used for program storage in micro controllers, device identification in IC cards and network IC, code storage in RFID tag, fuse device in memory redundancy, and RC trimming in analog/RF circuits.
A complete fault tolerant control solution calls for a nonlinear adaptive controller with universal approximation capability and guaranteed stability. To fulfill this requirement, we propose the use of neural networks...
详细信息
A complete fault tolerant control solution calls for a nonlinear adaptive controller with universal approximation capability and guaranteed stability. To fulfill this requirement, we propose the use of neural networks trained online under a globalized dual heuristic programming architecture supervised by a decision logic capable of identifying controller malfunctions in the early stages and providing new avenues with greater probability of convergence using information from a dynamic model bank. The classification and distinction of controller malfunctions and of the faults in the system are achieved through three independent quality indexes. Proof-of-the-concept simulations of nonlinear plants demonstrate the approach legitimacy.
A fundamental tension exists in systems research and practice between (1) hiding extraneous details to simplify the system programming model, and (2) revealing crucial details to allow better customization to particul...
详细信息
A fundamental tension exists in systems research and practice between (1) hiding extraneous details to simplify the system programming model, and (2) revealing crucial details to allow better customization to particular application requirements, data characteristics, or other constraints. For many modern systems, such as distributed real-time and embedded (DRE) systems and multimedia applications, this tension is even stronger: the correctness of the system depends not only on functional behavior (e.g., correctness of interfaces and the algorithms behind them) but also on quality of service (QoS) properties such as CPU speeds, frame rates, and end-to-end timeliness requirements. Satisfying both the functional and QoS requirements of modern applications running in various run-time environments requires programming models that can allow selective visibility and reconfigurability of key details in both the application and the services it uses. Although prior research and practice has focused on decoupling system properties from the application logic to facilitate modification at different points in the system life-cycle, some system properties cross-cut both (1) multiple layers (application and supporting infrastructure) and (2) multiple configuration phases in the system lifecycle. To date, there has been little support for configuring such cross-cutting concerns in a systematic and standardized way across different kinds of applications. This has resulted historically in laborious and ad hoc hand-customization of systems to meet real-world constraints, especially for DRE systems. However, the convergence of model-integrated computing with component-oriented middleware in the DRE middleware research community offers a new opportunity for automated coordination of system modifications at different layers and at different points in the system lifecycle, to meet application requirements end-to-end. We are extending the component-integrated ACE ORB (CIAO), to provide a un
ReAgents are remotely executing agents derived from behavior templates that support wireless clients in Internet applications. A reAgent is essentially a "one-shot" mobile agent that acts as an extension of ...
详细信息
ReAgents are remotely executing agents derived from behavior templates that support wireless clients in Internet applications. A reAgent is essentially a "one-shot" mobile agent that acts as an extension of a client, dynamically launched by the client to run on its behalf at a remote, more advantageous, location. Templates simplify the programming of reAgents by transparently handling data migration for remote execution, supporting custom communication protocols between the client and agent, and providing a general interface for programmers to implement their application-specific customizing logic. This simplification is made possible by the identification of characteristic behaviors, i.e., common patterns of actions that exploit the ability to process and communicate remotely. Examples of such behaviors are filtering, encoding/decoding, monitoring, caching, and distribution/collation. In this paper, we identify and analyze a set of core characteristic behaviors, describe how to program reAgents using behavior templates, and show that the overhead of using reAgents is low and outweighed by its benefits.
"Lockout" and "tagout" procedures to ensure safety is universally accepted. In order to perform operations of electrical maintenance on a zone, portion or components of the system, it is necessary ...
详细信息
"Lockout" and "tagout" procedures to ensure safety is universally accepted. In order to perform operations of electrical maintenance on a zone, portion or components of the system, it is necessary to use more elaborate clearing procedures and written switching instructions for systems, together with a single-line diagram. Past practice has been largely empirical. This paper offers an analytical approach to the problem. Complex power distribution systems may have several operating bonds (interconnections), such as multiple sources and switching devices in each area or zone. They require several operating steps to isolate the safe working zone SWZ. Details of developing and applying lockout/tagout procedures can vary. This paper presents an analytical approach to the planning and control of lockout/tagout procedures. It reviews and enhances previous papers and investigates the basic concepts and definitions to give prominence to operating bonds and to provide alternative, independent lockout/tagout analysis. It proposes some simple rules and bond definitions to facilitate programming. It introduces a "new language", that is a graphical representation, a color convention and a logic code to write and show symbolically the instruction list of electrical status. Together, intuitive and mathematical approaches can heighten understanding. The Parise program allows memorizing visually the logic procedures, counting the necessary locks and executing an auto-check of the clearing procedure. Software programs using a PC, based on the model in this paper, have been developed for aided or interactive training on network samples and for planning new networks. They can facilitate a faster evaluation and an accurate analysis, reducing the risk of error.
It has been agreed that the acceptance of parallel computing mainly depends on the quality of a high-level programming model, which should provide powerful abstractions in order to free the programmer from the burden ...
详细信息
It has been agreed that the acceptance of parallel computing mainly depends on the quality of a high-level programming model, which should provide powerful abstractions in order to free the programmer from the burden of dealing with low-level issues. In this paper, we describe a high-level, graph-oriented programming model, called GOP, and a programming environment, called ClusterGOP, for building and developing message-passing parallel programs. GOP support high-level design and programming of parallel and distributed systems by providing built-in support for a language-level construct and various operations on a high-level abstraction called the logical graph. With GOP, the configuration of the interacting processes of a parallel/distributed program can be represented as a user-specified logical graph that is mapped onto the physical network topology. The programming of inter-process communication and synchronization between local processors is supported by built-in primitives for graph-based operations. ClusterGOP is a programming environment built on top of the GOP model, providing a high-level programming abstraction through the ClusterGOP library for building parallel applications in clusters, It contains tools for development of GOP-based parallel programs with intelligent, visual support and a run-time system for deployment, execution, and management of the programs. ClusterGOP supports both SPMD and MPMD parallel computing paradigms. Also, with ClusterGOP, developing large parallel programs can be simplified with the predefined graph types and scalability support. The ClusterGOP system is portable as its implementation is based almost exclusively on calls to MPI, a portable messagepassing standard.
Proof-carrying code (PCC) is a general methodology for certifying that the execution of a untrusted mobile code is safe. The basic idea is that the code supplier attaches a certificate to the mobile code which the con...
详细信息
Proof-carrying code (PCC) is a general methodology for certifying that the execution of a untrusted mobile code is safe. The basic idea is that the code supplier attaches a certificate to the mobile code which the consumer checks in order to ensure that the code is indeed safe. The potential benefit is that the consumer's task is reduced from the level of proving to the level of checking. Recently, the abstract interpretation techniques developed in logic programming have been proposed as a basis for PCC. This extended abstract reports on experiments which illustrate several issues involved in abstract interpretation-based certification. First, we describe the implementation of our system in the context of CiaoPP: the preprocessor of the Ciao multi-paradigm programming system. Then, by means of some experiments, we show how code certification is aided in the implementation of the framework. Finally, we discuss the application of our method within the area of pervasive systems.
We present a foundational language for spatially distributed programming, called Lambda 5, that addresses both mobility of code and locality of resources. In order to construct our system, we appeal to the powerful pr...
详细信息
We present a foundational language for spatially distributed programming, called Lambda 5, that addresses both mobility of code and locality of resources. In order to construct our system, we appeal to the powerful propositions-as-types interpretation of logic. Specifically, we take the possible worlds of the intuitionistic modal logic IS5 to be nodes on a network, and the connectives /spl square/ and /spl diams/ to reflect mobility and locality, respectively. We formulate a novel system of natural deduction for IS5, decomposing the introduction and elimination rules for /spl square/ and /spl diams/, thereby allowing the corresponding programs to be more direct. We then give an operational semantics to our calculus that is type-safe, logically faithful, and computationally realistic.
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is a...
详细信息
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is a binary relation over program states that contains the transitive closure of the transition relation of the program. A relation is disjunctively well-founded if it is a finite union of well-founded relations. We characterize the validity of termination or another liveness property by the existence of a disjunctively well-founded transition invariant. The main contribution of our proof rule lies in its potential for automation via abstract interpretation.
This paper advanced mixed integer nonlinear programming (MINLP) algorithms mixed with constraint programming (CP) to solve industrial process hybrid model mixed with logical rule. CP methods have proved to be successf...
详细信息
ISBN:
(纸本)0780382730
This paper advanced mixed integer nonlinear programming (MINLP) algorithms mixed with constraint programming (CP) to solve industrial process hybrid model mixed with logical rule. CP methods have proved to be successful in solving highly constrained discrete optimization and feasibility problems. It can effectively solve hybrid model mixed with logical rule by integrating CP, nonlinear programming and mixed integer linear programming. Computational results demonstrated this algorithm.
暂无评论