ppxscal/embedding_network huggingface dataset:
Second Order Necessary Conditions for Optimal Impulsive Control Problems
Authors: A. Arutyunov, V. Jaćimović, F. Pereira
Venue: Journal of Dynamical and Control Systems (2003)

First and second order necessary conditions of optimality for an impulsive control problem are presented and derived. One of the main features of these results is that no a priori normality assumptions are required and they are informative for abnormal control processes as well. This feature follows from the fact that the conditions are derived from an extremal principle, which is proved for an abstract minimization problem with equality and inequality type constraints and constraints given by convex cone.Two simple examples illustrate the power of our result.
VELOS: A New Approach for Efficiently Achieving High Availability in Partitioned Distributed Systems
Authors: Peter Triantafillou, David J. Taylor
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

This work presents a new protocol, VELOS, for tolerating partitionings in distributed systems with replicated data. Our primary goals were influenced by efficiency and availability constraints. The proposed protocol achieves optimal availability, according to a well known metric, while ensuring one-copy serializability. In addition, however, VELOS is designed to reduce the cost involved in achieving high availability. We have developed mechanisms through which transactions, in the absence of failures, can access replicated data objects and observe shorter delays than related protocols, and impose smaller loads on the network and the servers. Furthermore, VELOS offers high availability without relying on system transactions that must execute to restore availability when failures and recoveries occur. Such system transactions typically access all (replicas of all) data objects and thus introduce significant delays to user transactions and consume large quantities of resources such as network bandwidth and CPU cycles. Thus, we offer our protocol as a proof that high availability can be achieved inexpensively.
The incidence coloring number of Halin graphs and outerplanar graphs
Authors: Shu-Dong Wang, Dong-Ling Chen, Shan-Chen Pang
Venue: Discrete Mathematics (2002)

In this paper, we shall prove that the incidence coloring number for Halin graphs of maximum degree greater than or equal to 5 and outerplanar graphs of maximum degree greater than or equal to 4 is equal to the maximum degree of the graph plus 1.
Zero copy I: user-mode perspective
Authors: Dragan Stancevic
Venue: Linux Journal (2003)

Apache and Samba use the sendfile system call to speed up file serving. Here's how you can use it too.
Modeling and Optimizing the Costs of Electronic Systems
Authors: Michael Scheffler, Daniel Ammann, Andreas Thiel, Claus Habiger, Gerhard Tröster
Venue: IEEE Design Test (1998)

In recent years, multi-chip modules (MCMs) and other high density packages (HDPs) have become more and more important for high performance electronics. They offer interesting new possibilities to overcome the size, weight, and power constraints for communication, consumer, and automotive markets. With this technology, test and manufacturing aspects have to be considered already during the design process to ensure also an economically optimized product. Therefore, concurrent design of functionality, test, manufacturing, and economic aspects is a must in order to guarantee the "first time right" approach thus improving today's design cycles. In this paper, we present a process-oriented scalable cost modeling tool, the Modular Optimization Environment (MOE), with a graphical user interface (GUI) that companions the design and manufacturing process in order to allow a continuous cost/quality/performance trade-off analysis.
Bigraphs and transitions
Authors: Ole Høgh Jensen, Robin Milner
Venue: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2003)

A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including λ-calculus and ambient calculus. A labelled transition system (LTS) for each BRS is here derived uniformly, adapting previous work of Leifer and Milner, so that under certain conditions the resulting bisimilarity is automatically a congruence. For an asynchronous λ-calculus, this LTS and its bisimilarity agree closely with the standard.
Double-Ended Estimates of a Minimum Robust H&infin;-Norm for Uncertain Controllable Systems
Authors: D. V. Balandin, M. M. Kogan
Venue: Automation and Remote Control (2003)

For the class of uncertain nonlinear controllable systems, the notion of a robust H&infin;-norm is introduced. An efficient procedure of obtaining double-ended estimates for a minimum robust H&infin;-norm in the class of nonlinear feedback loops is stated. An example is given of the system for which the obtained estimates coincide with one another and with a minimum robust norm.
Relational decomposition through partial functional dependencies
Authors: F. Berzal, J. C. Cubero, F. Cuenca, J. M. Medina
Venue: Data Knowledge Engineering (2002)

This paper introduces a new approach to database design theory. It presents the concept of partial functional dependency in the relational database framework. This new kind of dependency is an extension to the classical definition of functional dependency. The extension is carried out following two basic ideas. First, the new dependency works over relations (not over schemes). And, second, a relation can partially verify a classical dependency in the sense that only some tuples, called exceptions, break the dependency. Throughout this work, we use that dependency to decompose relations through a more flexible and general decomposition process, and by iterating this process, we find a mechanism to extract knowledge from the original relation. We also give algorithms to implement usual operations and relational system maintenance.
A First Course in Discrete Mathematics, 1st edition
Authors: John C. Molluzzo, Fred Buckley
Venue:  (1997)

:This highly regarded work fills the need for a treatment of elementary discrete mathematics that provides a core of mathematical terminology and concepts as well as emphasizes computer applications. Includes numerous elementary applications to computing and examples with solutions.
Cooperative Multiagent Systems: A Personal View of the State of the Art
Authors: Victor R. Lesser
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Scientific research and practice in multiagent systems focuses on constructing computational frameworks, principles, and models for how both small and large societies of intelligent, semiautonomous agents can interact effectively to achieve their goals. This article provides a personal view of the key application areas for cooperative multiagent systems, the major intellectual problems in building such systems, the underlying principles governing their design, and the major directions and challenges for future developments in this field.
Behavior and adaptability of a six-legged walking system with highly distributed control
Authors: Thomas Kindermann
Venue: Adaptive Behavior (2001)

A situated, moderately complex kinematic system--here an 18-degree-of-freedom six-legged walking system--can show a variety of behaviors, even when controlled by a relatively simple controller. Therefore, a detailed quantitative study of the behavior of such a system is necessary to achieve an understanding of its properties. This "artificial ethology" is applied to a controller with a decentralized structure that uses essential design characteristics of its biological model, the stick insect. The system takes advantage of recurrent connections that establish a loop through the environment. Despite its completely reactive nature, the system can adapt to unpredictable external conditions with no need for specific reprogramming. Leg trajectories are always adapted such that mechanical stress is reduced. This even holds true for special situations like, for example, walking over obstacles, stumbling, or walking with partially or totally amputated legs. Similarities and important discrepancies between the model's behavior and the walking behavior of stick insects are discussed.
Why Bad Things Happen to Good Projects
Authors: Karen Mackey
Venue: IEEE Software (1996)

When building a relatively complex system that involves multiple computers and multiple users, Murphy's law inevitably strikes: Something will go wrong. This article characterizes two common pitfalls, the Quality-Capacity Syndrome and the Missing-Tools Crisis, and shows how to overcome them. Since both pitfalls have occurred with some frequency in unrelated software-development projects, they appear to be independent of individual and management skills ¿ factors responsible for a large variance in project success. Likewise, since the affected projects followed reasonably good development practices, the appearance of these problems serves to underscore that serious problems can occur even in the best-intentioned multiuser, distributed-application development project.What makes the Quality-Capacity Syndrome and Missing-Tools Crisis. so deadly is that they tend to occur together just as the project is nearing completion, putting the schedule in jeopardy. To examine these two pitfalls, I pasted together a fictitious development project called GEMS, Greatest Electronic Mail Systems. GEMS is a composite of real projects that experienced the Quality-Capacity Syndrome and Missing-Tools Crisis.
Trends in Embedded-Microprocessor Design
Authors: Manfred Schlett
Venue: Computer (1998)

When discussing microprocessors, we tend to think of the Intel x86 architecture and its competitors. Doing so, however, ignores the growing market for embedded microprocessors and controllers, in particular the growing 32-bit embedded-processor market. This movement toward longer instruction length may seem strange to developers of brake control systems or washing machines--and, indeed, forecasters predict that eight times more 8- bit than 32-bit embedded processors will ship in 1999. But as demand for more complex handheld and portable applications rises, this trend becomes more understandable. Today's 32-bit embedded- processor market includes more than 100 vendors and two dozen instruction set architectures. This article describes what these embedded CPUs are and how the requirements of embedded systems make them different from general-purpose CPUs.
Cyclic BSEC of block size 3
Authors: R. Wei
Venue: Discrete Mathematics (2002)

Balanced sampling plans excluding contiguous units (or BSEC) were first introduced by Hedayat, Rao and Stufken in 1988. In this note, we discuss constructions of these designs having cyclic automorphisms. We use Langford sequences to construct all possible cyclic BSEC (or CBSEC) with block size 3 and λ = 1,2, which establishes the necessary and sufficient conditions for such designs. Some constructions of the balanced sampling plan avoiding adjacent units, a generalization of BSEC, are also given for fixed λ.
Using Simplicity to Control Complexity
Authors: Lui Sha
Venue: IEEE Software (2001)

Improving the reliability and availability of increasingly complex software is a serious challenge, especially in efforts to protect society's critical functions. Is it true that building diverse, redundant systems provides robustness? This article investigates the relationship between software complexity, reliability, and development resources. It also presents a forward-recovery approach based on the idea of using simplicity to control complexity as a way to improve the robustness of complex software systems.
Comparing Control Constructs by Double-Barrelled CPS
Authors: Hayo Thielecke
Venue: Higher-Order and Symbolic Computation (2002)

We investigate call-by-value continuation-passing style transforms that pass two continuations. Altering a single variable in the translation of &lambda;-abstraction gives rise to different control operators: first-class continuations&semi; dynamic control&semi; and (depending on a further choice of a variable) either the \tt return statement of C&semi; or Landin's J-operator. In each case there is an associated simple typing. For those constructs that allow upward continuations, the typing is classical, for the others it remains intuitionistic, giving a clean distinction independent of syntactic details. Moreover, those constructs that make the typing classical in the source of the CPS transform break the linearity of continuation use in the target.
Entropy Splitting for High Order Numerical Simulation of Vortex Sound at Low Mach Numbers
Authors: Bernhard Müller, H. C. Yee
Venue: Journal of Scientific Computing (2002)

Several recent developments in efficient, stable, highly parallelizable high order non-dissipative spatial schemes with characteristic based filters that exhibit low dissipation for long time linear and nonlinear wave propagations are utilized for computational aeroacoustics (CAA). For stability consideration, the Euler equations are split into a conservative and a symmetric non-conservative portion. Due to the large disparity of acoustic and stagnation quantities in low Mach number aeroacoustics, the split Euler equations are formulated in perturbation form to minimize numerical cancellation errors. Spurious oscillations are suppressed by a characteristic-based filter. The method has been applied to accurately simulate the sound emitted by an almost circular Kirchhoff vortex at low Mach numbers.
Finite element analysis of residual-stress-induced flatness deviation in banded carbon seals
Authors: Rahul N. Samant, Patrick E. Phelan, M. Rifat Ullah
Venue: Finite Elements in Analysis and Design (2002)

Carbon face seals, used in the aircraft engines manufactured by AlliedSignal Engines, are assembled via a shrink-fit procedure which generates residual stresses in both components, resulting in 30-50% of the seals not meeting the required flatness tolerance of three helium light bands (3 HeLB, equal to 0.762 µm). A two-dimensional, axisymmetric finite element analysis is carried out here to provide a means for better understanding the geometric and processing parameters of the face seals in order to improve their flatness. Results indicate that to obtain a lower value of fd, the flatness deviation, the seal should have a larger inner radius (Ri), a smaller initial radial interference (δ), a larger thickness of the steel ring (ts), a smaller thickness of the carbon ring (tc), and a smaller height (ht). Also, it is preferable to have a slower cooling rate during the assembly process. It is observed that the coefficient of friction at the interface, µ, does not have any effect on fd. Finally, the process of an "expansion" fit does not contribute towards a reduction in fd, and hence is not worth the effort and cost.
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
Authors: M. Singhal
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

A dynamic information-structure mutual exclusion algorithm is presented for distributed systems whose information-structure evolves with time as sites learn about the state of the system through messages. An interesting feature of the algorithm is that it adapts itself to heterogeneous or fluctuating traffic conditions to optimize the performance (the number of messages exchanged). The performance of the algorithm is studied by simulation technique and compared to the performance of a well-known mutual exclusion algorithm. The impact message loss and site failures on the algorithm is discussed and methods to tolerate these failures are proposed.
Analog-Digital Technologies for Mixed-Signal Processing: The Driving Force to Success for the European Industry
Authors: Edgard Laes, Herman J. Casier, Eric Schutz
Venue: IEEE Micro (1992)

Mixed analog-digital products complement digital processors in a wide range of systems. The development activities at European semiconductor companies and research institutes, both on A/D processes and design tools, are described. The processes include mixed A/D CMOS, high-voltage interface BiCMOS, and low-voltage A/D BiCMOS. Tools include analog circuit synthesis and library cells.
EWA volume splatting
Authors: Matthias Zwicker, Hanspeter Pfister, Jeroen van Baar, Markus Gross
Venue: Proceedings of the conference on Visualization '01 (2001)

In this paper we present a novel framework for direct volume rendering using a splatting approach based on elliptical Gaussian kernels. To avoid aliasing artifacts, we introduce the concept of a resampling filter combining a reconstruction with a low-pass kernel. Because of the similarity to Heckbert's EWA (elliptical weighted average) filter for texture mapping we call our technique EWA volume splatting. It provides high image quality without aliasing artifacts or excessive blurring even with non-spherical kernels. Hence it is suitable for regular, rectilinear, and irregular volume data sets. Moreover, our framework introduces a novel approach to compute the footprint function. It facilitates efficient perspective projection of arbitrary elliptical kernels at very little additional cost. Finally, we show that EWA volume reconstruction kernels can be reduced to surface reconstruction kernels. This makes our splat primitive universal in reconstructing surface and volume data.
Synthesizing Nested Loop Algorithms Using Nonlinear Transformation Method
Authors: J. P. Sheu, C. Y. Chang
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

FOR-loops are the main source of parallelism in programs. A nonlinear transformation algorithm for parallelizing the execution of FOR-loop models is proposed. It is shown that by the mapping of nonlinear transformation, iterations of FOR-loops can be executed in a parallel form. The algorithm is useful in exploiting the parallelism of FOR-loops with one or more partitions on the innermost loop. Algorithms to partition and map the nested FOR-loops onto fixed size systolic arrays are discussed. Based on the time and space mapping schemes, all the iterations of FOR-loops can be correctly executed on the array processors in a parallel form.
Asynchronous Problems on SIMD Parallel Computers
Authors: Wei Shu, Min-You Wu
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

One of the essential problems in parallel computing is: Can SIMD machines handle asynchronous problems? This is a difficult, unsolved problem because of the mismatch between asynchronous problems and SIMD architectures. We propose a solution to let SIMD machines handle general asynchronous problems. Our approach is to implement a runtime support system which can run MIMD-like software on SIMD hardware. The runtime support system, named P kernel, is thread-based. There are two major advantages of the thread-based model. First, for application problems with irregular and/or unpredictable features, automatic scheduling can move some threads from overloaded processors to underloaded processors. Second, and more importantly, the granularity of threads can be controlled to reduce system overhead. The P kernel is also able to handle bookkeeping and message management, as well as to make these low-level tasks transparent to users. Substantial performance has been obtained on Maspar MP-1.
The FTT-CAN Protocol for Flexibility in Safety-Critical Systems
Authors: Joaquim Ferreira, Paulo Pedreiras, Luís Almeida, José Alberto Fonseca
Venue: IEEE Micro (2002)

A new communication protocol for distributed embedded systems attempts to find a compromise between the often-opposing goals of system flexibility and safety.
Characterisation and integration feasibility of JSR's low-k dielectric LKD-5109
Authors: A. Das, T. Kokubo, Y. Furukawa, H. Struyf, I. Vos, B. Sijmus, F. Iacopi, J. Van Aelst, Q. T. Le, L. Carbonell, S. Brongersma, M. Maenhoudt, Z. Tokei, I. Vervoort, E. Sleeckx
Venue: Microelectronic Engineering (2002)

Increasing the circuit density is driving the need for lower permittivity interlayer dielectrics (ILD) to reduce the capacitance between long parallel lines. JSR's LKD-5109, an MSQ-based material, is one of such low-k materials for the 65-nm node. The feasibility of integrating LKD-5109 in a single inlaid structure has been investigated. Thermal stability, chemical compatibility to stripping agents and CMP slurries are verified. A single damascene structure incorporating a dual CVD hard mask has been attempted and electrical results have been evaluated.
Software Engineering Education: A Modest Proposal
Authors: Thomas B. Hilburn
Venue: IEEE Software (1997)

For our profession to advance, software engineering education must improve. The author proposes a conceptual model for achieving this that is founded on the triad of people, process, and technology. He then outlines a sample curriculum based on his model.
Explanation and Argumentation Capabilities: Towards the Creation of More Persuasive Agents
Authors: B. Moulin, H. Irandoust, M. Bélanger, G. Desbordes
Venue: Artificial Intelligence Review (2002)

During the past two decades many research teams have worked on the enhancement of the explanation capabilities of knowledge-based systems and decision support systems. During the same period, other researchers have worked on the development of argumentative techniques for software systems. We think that it would be interesting for the researchers belonging to these different communities to share their experiences and to develop systems that take advantage of the advances gained in each domain.We start by reviewing the evolution of explanation systems from the simple reasoning traces associated with early expert systems to recent research on interactive and collaborative explanations. We then discuss the characteristics of critiquing systems that test the credibility of the user's solution. The rest of the paper deals with the different application domains that use argumentative techniques. First, we discuss how argumentative reasoning can be captured by a general structure in which a given claim or conclusion is inferred from a set of data and how this argument structure relates to pragmatic knowledge, explanation production and practical reasoning. We discuss the role of argument in defeasible reasoning and present some works in the new field of computer-mediated defeasible argumentation. We review different application domains such as computer-mediated communication, design rationale, crisis management and knowledge management, in which argumentation support tools are used. We describe models in which arguments are associated to mental attitudes such as goals, plans and beliefs. We present recent advances in the application of argumentative techniques to multi-agent systems. Finally, we propose research perspectives for the integration of explanation and argumentation capabilities in knowledge-based systems and make suggestions for enhancing the argumentation and persuasion capabilities of software agents.
Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays
Authors: P. Z. Lee, Z. M. Kedem
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

Consideration is given to transforming depth p-nested for loop algorithms into q-dimensional systolic VLSI arrays where 1>or=q>or=p-1. Previously, there existed complete characterizations of correct transformation only for the cases where q=p-1 orq=1. This gap is filled by giving formal necessary and sufficient conditions for correct transformation of a p-nested loop algorithm into a q-dimensional systolic array for any q,1>or=q>or=p-1. Practical methods are presented. The techniques developed are applied to the automatic design of special purpose and programmable systolic arrays. The results also contribute toward automatic compilation onto more general purpose programmable arrays. Synthesis of linear and planar systolic array implementations for a three-dimensional cube-graph algorithm and a reindexed Warshall-Floyd path-finding algorithm are used to illustrate the method.