ppxscal/embedding_network huggingface dataset:
A Global Driver Sizing Tool for Functional Crosstalk Noise Avoidance
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

As coupling noise analysis and estimation is reaching a relative maturity with recent efforts, more effort is needed in correcting and/or avoiding failures that can be caused by coupling noise. In this paper, we present a global driver sizing tool which can be used in a complete noise avoidance tool along with other techniques such as wire spacing and wire sizing. The proposed approach is used along with ClariNet [1], which is a recent noise analysis tool, in a greater effort towards a total signal integrity solution. We first present the analytical, linear interconnect model used. We then show how this model is used to provide neccesary information for global driver sizing along with our novel algorithm. We finally present results on two industrial circuits including a large high performance control block.
Deformable Prototypes for Encoding Shape Categories in Image Databases
Authors: Stan Sclaroff
Venue:  (1995)

Abstract We describe a method for shape-based image database search that uses deformable prototypes to represent categories. Rather than directly comparing a candidate shape with all shape entries in the database, shapes are compared in terms of the types of nonrigid deformations (differences) that relate them to a small subset of representative prototypes. To solve the shape correspondence and alignment problem, we employ the technique of {\em modal matching}, an information-preserving shape decomposition for matching, describing, and comparing shapes despite sensor variations and nonrigid deformations. In modal matching, shape is decomposed into an ordered basis of orthogonal principal components. We demonstrate the utility of this approach for shape comparison in 2-D image databases.
Numerical discretization of energy-transport models for semiconductors with non-parabolic band structure
Authors: Pierre Degond, Ansgar Juengel, Paola Pietra
Venue:  (1999)

The energy-transport models describe the flow of electrons through a semiconductor crystal, influenced by diffusive, electrical and thermal effects. They consist of the continuity equations for the mass and the energy, coupled to Poisson''s equation for the electric potential. These models can be derived from the semiconductor Boltzmann equation. This paper consists of two parts. The first part concerns with the modelling of the energy-transport system. The diffusion coefficients and the energy relaxation term are computed in terms of the electron density and temperature, under the assumptions of non-degenerate statistics and non-parabolic band diagrams. The equations can be rewritten in a drift-diffusion formulation which is used for the numerical discretization. In the second part, the stationary energy-transport equations are discretized using the exponential fitting mixed finite element method in one space dimension. Numerical simulations of a ballistic diode are performed.
Using an Artificial Intelligence Approach to Build an Automated Program Understanding/Fault Localization Tool
Authors: Ilene Burnstein, Floyd Saner, Yachai Limpiyakorn
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Artificial intelligence techniques, and architectures have played a large role in the design of a blackboard-based program understanding/fault localization tool we have been developing. In this paper we focus on a system knowledge source called the Plan Processor which will have artificial intelligence support for two of its major tasks. One task is to retrieve a set of program plans from a plan library using indices called signatures. To make this retrieval task more effective we propose using a genetic algorithm. We also describe a fuzzy reasoning component which supports the Plan Processor with a second task; ranking the retrieved plans in order of similarity to the target code. The most similar plan is then used for the complex plan/code matching required for automated program understanding. Our approach may eliminate the need for exhaustive plan library searches, and could lead to automated program understanders that scale up for use on software systems from a variety of problem domains.
On feasible cases of checking multi-agent systems behavior
Authors: Michael Dekhtyar, Alexander Dikovsky, Mars Valiev
Venue: Theoretical Computer Science (2003)

The complexity of multi-agent systems behavior properties is studied. The behavior properties are formulated using classical temporal logic languages and are checked relative to the transition system induced by the multi-agent system definition. We show that there are deterministic or nondeterministic polynomial time check algorithms under some realistic structural and semantic restrictions on agent programs and actions.
A neural architecture for simultaneous MAP image restoration and MLestimation of edge-preserving Gibbs priors
Authors: Luigi Bedini, Anna Tonazzini, Salvatore Minutoli
Venue:  (1996)

This paper proposes an iterative procedure that simultaneously computes the MAP restoration of an image and the ML estimation of the unknown model parameters, when piecewise smooth MRF models with an explicit, constrained line process are considered. The method consists of a mixed-annealing algorithm for the maximization of the posterior distribution with respect to the image field, periodically interrupted to compute a new set of parameters. Owing to the presence of an explicit line process, we define these new parameters as those that maximize the conditional prior distribution of the lines given the intensities, evaluated on the current estimate of the whole image field. The computation of the expectations involved in the ML estimation can thus be performed by summation over the binary line elements alone, with a strong reduction in computational complexity. Moreover, when a model with non-interacting discontinuities (e.g. the weak membrane) is considered, the expectations can be computed analytically, with a further reduction in the computational load. Finally, a neural architecture, based on a Hopfield net interconnected with a Boltzmann Machine, which also holds for the general case of self-interacting discontinuities, is proposed for a possible analogue implementation of the whole procedure. TEL:: +39-050-593435 EMAIL:: tonazzini@iei.pi.cnr.it
Supervision of real-time software systems using optimistic path prediction and rollbacks
Authors: D. A. Simser, R. E. Seviora
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Real time supervision is a technique for automatically detecting and reporting failures in the external behaviour of real time software systems. Failure detection is achieved by monitoring the target system's external inputs and outputs, in a 'black box' manner and comparing its behaviour with the formally specified behaviour of the system. The paper presents the Optimistic Path Prediction and Rollbacks (OPPR) approach to real time supervision. In this technique, the supervisor predicts a single likely behaviour of the target system and, if the observed behaviour does not match the prediction, rolls back and creates a new prediction of the legal behaviour. A failure is detected when the supervisor has explored all valid behaviours without matching the observed behaviour. The paper opens by introducing the field of real time supervision and examining existing techniques. The core of the paper presents the basic algorithm of the OPPR method, with an example to illustrate its operation. The paper closes by describing an evaluation system, summarizing the experimental results and examining the performance of the OPPR scheme.
Issues with Object Orientation in Verifying Safety-Critical Systems
Authors: Sathyanarayanan Subbiah, Srikanth Nagaraj
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Primus Epic¿ is an all-new integrated avionics system for business, regional and general aviation. Honeywell International Inc. follows the Object Oriented paradigm and the programming language C++ for certain software components on systems developed for the PRIMUS EPIC system. While C++ programming language offers several advantages, it also has several features that can make it undesirable for use in airborne systems. The ObjectOrientation concept has several features that, if not controlled properly, can lead to unknown configurations of object code and unverified code. This is highly undesirable for avionics software that needs certification involving statement and code coverage. This paper highlights the issues with C++ certification for avionics and provides solutions for some of the issues.
An Approach for a 4th Generation Messaging System
Authors: Sven Van der Meer, Stefan Arbanowski, Thomas Magedanz
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

A variety of concepts for service integration and corresponding service platforms emerged in the last two years. On the one hand, they aim for the interworking and integration of classical telecommunication and data communication services, such as telephony, voicemail, fax, e-mail, paging, etc. On the other hand they focus on universal service access from a variety of end user systems, including both fixed and mobile terminals. One form of these concepts are Unified Messaging Systems, which are proposed to enhance the control over reachability in telecommunications.This paper presents the evolution of messaging system and an outlook of future developments in the area of communication and information services. Based on this analysis it shows the drawbacks of the current understanding of Unified Messaging.The second part of the paper proposes a system architecture from the technical perspective to overcome the examined disadvantages.
Using computer algebra to find nash equilibria
Authors: Ruchira S. Datta
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

A central concern of game theory is the computation of Nash equilibria. These are characterized by systems of polynomial equations and inequalities. We survey the use of currently available software to solve these systems, and conclude that polyhedral homotopy continuation appears to scale best with increasing problem size.
Protocol Specification Using Parameterized Communicating Extended Finite Stte Machines - A Case Study of The ATM ABR Rate Control Scheme
Authors: David Lee, K. K. Ramakrishnan, W. Melody Moh, Udaya Shankar
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

Formal specification is indispensable for computer-aided verification and testing of communication protocols. However, a large number of the practical protocols, including ATM, only has informal specifications, mostly in English, from which there are no general procedures to derive formal specifications.As a case study, we consider an important ATM protocol - the Available Bit Rate (ABR). The ABR source/destination policies have been specified using an English description in the main body of the ATM Forum's draft Traffic Management specification, from which it is hard to conduct a formal analysis. Furthermore, while considerable energy has been spent in providing a reasonably precise specification, while allowing for appropriate implementation latitude, an English description still has the potential for different interpretations.We model the protocol by parameterized communicating extended finite state machines with timers, which is often called a transitions system, and present a formal specification by transitions of the system. We also provide insight to the derivation of the formal specification. Furthermore, we introduce a scheduler to meet the minimal requirements from the source and destination protocols, that is involved in transmitting queued cells at the allowed cell rate for the source. We present the transitions for the source/destination/scheduler machines, primarily for transmitting cells in-rate.
Strong asymptotics in Lagrange interpolation with equidistant nodes
Authors: Michael I. Ganzburg
Venue: Journal of Approximation Theory (2003)

In this paper we prove three conjectures of Revers on Lagrange interpolation for fλ(t)= |t|λ, λ > 0, at equidistant nodes. In particular, we describe the rate of divergence of the Lagrange interpolants LN(fλ, t) for 0<|t| < 1, and discuss their convergence at t=0. We also establish an asymptotic relation for max|t|≤1||t|λ -LN(fλ, t)|. The proofs are based on strong asymptotics for |t|λ -- LN(fλ, t), 0 ≤ |t| < 1.
Hybrid I/O automata
Authors: Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager
Venue:  (1995)

We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I/O automaton model of Lynch et al and the phase transition system models of Manna et al, allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of hybrid I/O automata and of an implementation relation based on hybrid traces, (2) the definition of a simulation between hybrid I/O automata and a proof that existence of a simulation implies the implementation relation, (3) a definition of composition of hybrid I/O automata and a proof that it respects the implementation relation, and (4) a definition of receptiveness for hybrid I/O automata and a proof that, assuming certain compatibility conditions, receptiveness is preserved by composition.
Functions that have read-once branching programs of quadratic size are not necessarily testable
Authors: Beate Bollig, Ingo Wegener
Venue: Information Processing Letters (2003)

A property of binary strings is constructed that has a representation by a collection of read-once branching programs of quadratic size but which is not ε-testable for some fixed ε > 0. This shows that Newman's result [Proc. 41st FOCS, 2000, pp. 251-258]. cannot be generalized to functions representable by read-once branching programs of polynomial size.
Performance analysis of an ATM switch with multiple paths
Authors: Byungho Kim, Boseob Kwon, Jinchun Kim, H. Yoon, Jungwan Cho
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

An ATM switch based on multistage interconnection networks with multiple paths can support higher bandwidth than that of buffered networks with single path by passing multiple packets to the same destination simultaneously. These multiple packets are buffered in the output buffer of the destination. The performance of output buffer in the switch with multiple paths is closely dependent on the output traffic distribution, which is the packet arrival rate at each output link destined to a given output port. As the nonuniformity of the output traffic distribution becomes higher, the performance of the output buffer as like delay and packet loss probability gets better. In this paper, we propose a new self-routing switch architecture with multiple paths called Fly network and analyze the performance of the switching network and the output buffer focusing on the output traffic distribution. It is shown that the Fly network supports best throughput and latency of the output buffer by producing a high degree of the nonuniform output traffic distribution
Progress Report to the Advanced Research Projects Agency on the Scalable Concurrent Programming Project
Authors: Stephen Taylor
Venue:  (1993)

No abstract available. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Fuzzy Hybrid Control and its Applications in Complex Combustion Processes
Authors: Yong Qin, Li-Min Jia
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Fuzzy hybrid control for the complex combustion processes is presented in this paper. The complex combustion processes is a class of hybrid systems which contain both continuous and discrete dynamics. Based on hybrid automata theory and fuzzy control method, a fuzzyhybrid controller with a hierarchical structure is built up. The high level acts the supervisory control, which can be modeled by the finite state automata as a DES. The middle level is a switching interface, which designs the switch strategies and the transfer of the continuous and discrete states. The low level includes some continuous sub-controllers utilizing the fuzzy control, which guarantee the direct control ability. A kind of complex combustion processes ¿the heating process of the ceramic shuttle kiln is used to be the controlled object, which is modeled by the hybrid automata. The practical results demonstrate the effectiveness of the proposed fuzzy hybrid control method.
Fragmented Retrenchment, Concurrency and Fairness
Authors: R. Banach, M. Poppleton
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early pre-formal stages of development, and briefly justified. Fragmented retrenchment permits the granularity of actions to decrease across a development step, many concrete steps retrenching a single abstract one. This generates the usual proliferation of inter-leavings of events at the concrete level. Event structures, particularly flow event structures, help to control these within the retrenchments of a single abstract step, while the concurrent reading of the fragmented retrenchment proof obligation permits acceptable inter-leavings of retrenchments of different steps. It is observed that retrenchment allows the convenient description of unfair behaviours when fairness is not guaranteed.
Hacked, Attacked and Abused: Digital Crime Exposed
Authors: Peter Lilley
Venue:  (2003)

:Did you know that... * In 2001 a gambling Web site was hacked so that in a few hours 140 gamblers won a total of $1.9 million? * The Love Bug virus cost $8.7 billion globally in lost productivity and clean-up costs? * Numerous corporations have suffered severe reputational and financial consequences due to false information about them being e-mailed to thousands of recipients? * Major websites are being rendered inaccessible by denial of service attacks? * In 1986 there was only one recorded computer virus; now there are over 50,000 and that number is still growing? * A Texas professor began to receive death threats because someone had "stolen" his e-mail address and sent 20,000 racist messages from it? * Innumerable corporate and national networks have been hacked into, including Microsoft, NASA, and the Korean Atomic Research Institute? * Thousands of innocent individuals have had their identities "stolen" online and used fraudulently? Digital crime has grown quickly as business has become more reliant on digital media. "Hacker attacks" and Internet viruses proliferate. Yet many businesses remain unaware of just what the risks are. Here is an investigation into all these risk areas accompanied by a non-technical evaluation of the overall problem. Lilley illustrates his account with real life examples of electronic crime and also delivers specific, practical advice on how to identify and prevent it. Risks discussed include: organized digital crime; cyber laundering; fraudulent Internet Web sites; hacking and cracking; viruses; website defacement; unauthorized disclosure of confidential information; the fraudulent aspects of electronic cash; identity theft; information warfare; denial of service attacks where systems are inaccessible to legitimate users; invasion of digital privacy. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Fault exposure ratio estimation and applications
Authors: Li Naixin, Y. K. Malaiya
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

One of the most important parameters that control reliability growth is the fault exposure ratio (FER) identified by J.D. Musa et al. (1991). It represents the average detectability of the faults in software. Other parameters that control reliability growth are software size and execution speed of the processor which are both easily evaluated. The fault exposure ratio thus presents a key challenge in our quest towards understanding the software testing process and characterizing it analytically. It has been suggested that the fault exposure ratio may depend on the program structure, however the structuredness as measured by decision density may average out and may not vary with program size. In addition FER should be independent of program size. The available data sets suggest that FER varies as testing progresses. This has been attributed partly to the non-randomness of testing. We relate defect density to FER and present a model that can be used to estimate FER. Implications of the model are discussed. This model has three applications. First, it offers the possibility of estimating parameters of reliability growth models even before testing begins. Secondly, it can assist in stabilizing projections during the early phases of testing when the failure intensity may have large short term swings. Finally, since it allows analytical characterization of the testing process, it can be used in expressions describing processes like software test coverage growth.
Fully Source-Coupled Logic Based Multiple-Valued VLSI
Authors: Tsukasa Ike, Takahiro Hanyu, Michitaka Kameyama
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

A novel source-coupled logic (SCL) style using multiple-valuedsignals, called multiple-valued source-coupled logic (MVSCL),which operates with an input voltage swing of about 0.3V, isproposed for high-speed and low-power VLSI systems.A multiple-valued comparator, which is a key component, isrealized by using differential-pair circuits (DPCs), so thatits power dissipation can be greatly reduced while maintaininghigh-speed switching. Moreover, the current-source controlallows steady current flow to cut off when the circuit is notactive, thereby saving power dissipation. A 54×54-bitsigned-digit multiplier based on MVSCL is designed in a 0.35-umCMOS technology, and its performance is superior to bothcorresponding binary static CMOS and multiple-valuedcurrent-mode (MVCM) implementation.
The MADE help system
Authors: Michal Haindl, M. M. Ruiter
Venue:  (1995)

MADE is the acronym for the ESPRIT project 6307, whose aim is to develop an object oriented multimedia application development environment. As part of this project the MADE help system is designed to be a distributed hypermedia system with additional support for run-time object monitoring and contextual help.