ppxscal/embedding_network huggingface dataset:
A Generalized Technique for Register Counting and its Application to Cost-Optimal DSP Architecture Synthesis
Authors: Kazuhito Ito, Keshab K. Parhi
Venue: Journal of VLSI Signal Processing Systems (1997)

In this paper we propose a generalized technique to count the required number of registers in a schedule which supports overlapped scheduling and can be applied to the case where a general digit-serial data format is used. This technique is integrated into an integer linear programming (ILP) model for time-constrained scheduling. In the ILP model, appropriate processors of certain data formats are chosen from a library of processors and data format converters are automatically inserted between processors of different data formats if necessary. Then the required number of registers for each data format is evaluated correctly by the proposed technique. Hence an optimal architecture for a given digital signal processing algorithm is synthesized where the cost of registers as well as the cost of processors and data format converters are minimized. It is shown that by including the cost of registers in the synthesis task as proposed in this paper leads to up to 12.8% savings in the total cost of the synthesized architecture when compared with synthesis performed without including the register cost in the total cost.
New Bounds and Heuristics for (Q, r) Policies
Authors: Guillermo Gallego
Venue: Management Science (1998)

To clarify the impact of demand variability on single item stochastic inventory systems with setup costs, we subsume the distributional information of the lead time demand into its mean and variance and solve the resulting problem against the worst possible distribution in this class. For (Q, r) policies we obtain in closed form a distribution-free solution for Q and r, and upper bounds on the optimal long run average cost and on the optimal batch size. As a byproduct we develop a robust, distribution-free, batch size heuristic that causes a relative cost increase of no more than 6.07%. In addition, when the newsvendor cost is known, we obtain sharper lower and upper bounds on the long run average cost. These bounds clarify, in an exceedingly simple way, the cost impact of fixed setup costs, demand variability, and constraints on the batch size. We illustrate our bounds and heuristics on problems with Poisson and Compound Poisson demands.
COSYN: hardware-software co-synthesis of embedded systems
Authors: Bharat P. Dave, Ganesh Lakshminarayana, Niraj K. Jha
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Hardware-software co-synthesis is the process ofpartitioning an embedded system specification into hardware andsoftware modules to meet performance, power and cost goals. Inthis paper, we present a co-synthesis algorithm which starts withperiodic task graphs with real-time constraints and produces a low-costheterogeneous distributed embedded system architecturemeeting the constraints. The algorithm has the following features:1) it allows the use of multiple types of processing elements (PEs)and inter-PE communication links, where the links can take variousforms (point-to-point, bus, local area network (LAN), etc.), 2) itsupports both concurrent and sequential modes of communicationand computation, 3) it allows both preemptive and non-preemptivescheduling, 4) it employs the concept of an association array totackle the problem of multi-rate systems (which are commonlyfound in multimedia applications), 5) it uses a scheduler based ondynamic deadline-based priority levels for accurate performanceestimation of a co-synthesis solution, 6) it uses a new taskclustering technique which takes the dynamic nature of the criticalpath, and the existence of multiple critical paths in the task graphinto account, and 7) if desired, it also optimizes the architecture forpower consumption (we are not aware of any other co-synthesisalgorithm that optimizes power). Application of the proposedalgorithm to examples from the literature and real-life telecomtransport systems shows its efficacy.
A Hybrid Smoothing Method for Mixed Nonlinear ComplementarityProblems
Authors: Steven A. Gabriel
Venue: Computational Optimization and Applications (1998)

In this paper, we describe a new, integral-based smoothing method for solving the mixed nonlinear complementarity problem (MNCP). This approach is based on recasting MNCP as finding the zero of a nonsmooth system and then generating iterates via two types of smooth approximations to this system. Under weak regularity conditions, we establish that the sequence of iterates converges to a solution if the limit point of this sequence is regular. In addition, we show that the rate is Q-linear, Q-superlinear, or Q-quadratic depending on the level of inexactness in the subproblem calculations and we make use of the inexact Newton theory of Dembo, Eisenstat, and Steihaug. Lastly, we demonstrate the viability of the proposed method by presenting the results of numerical tests on a variety of complementarity problems.
Decentralised approaches for network management
Authors: Mohsen Kahani, H. W. Peter Beadle
Venue: ACM SIGCOMM Computer Communication Review (1997)

Centralised network management has shown inadequacy for efficient management of large heterogenous networks. As a result, several distributed approaches have been adapted to overcome the problem. This paper is a review of decentralised network management techniques and technologies. We explain distributed architectures for network management, and discuss some of the most important implemented distributed network management systems. A comparison is made between these approaches to show the pitfalls and merits of each.
Proof linking: an architecture for modular verification of dynamically-linked mobile code
Authors: Philip W. L. Fong, Robert D. Cameron
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

Security flaws are routinely discovered in commercial implementations of mobile code systems such as the Java Virtual Machine (JVM). Typical architectures for such systems exhibit complex interdependencies between the loader, the verifier, and the linker, making them difficult to craft, validate, and maintain. This reveals a software engineering challenge that is common to all mobile code systems in which a static verification phase is introduced before dynamic linking. In such systems, one has to articulate how loading, verification, and linking interact with each other, and how the three processes should be organized to address various security issues.We propose a standard architecture for crafting mobile code verifiers, based on the concept of proof linking. This architecture modularizes the verification process and isolates the dependencies among the loader, verifier, and linker. We also formalize the process of proof linking and establish properties to which correct implementations must conform. As an example, we instantiate our architecture for the problem of Java bytecode verification and assess the correctness of this instantiation. Finally, we briefly discuss alternative mobile code verification architectures enabled by our modularization.
On the Least Squares Approximation of Symmetric-Definite Pencils Subject to Generalized Spectral Constraints
Authors: Moody T. Chu, Quanlin Guo
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

A general framework for the least squares approximation of symmetric-definite pencils subject to generalized eigenvalues constraints is developed in this paper. This approach can be adapted to different applications, including the inverse eigenvalue problem. The idea is based on the observation that a natural parameterization for the set of symmetric-definite pencils with the same generalized eigenvalues is readily available. In terms of these parameters, descent flows on the isospectral surface aimed at reducing the distance to matrices of the desired structure can be derived. These flows can be designed to carry certain other interesting properties and may be integrated numerically.
Command center processing and display system replacement&mdash;CCPDS-R
Authors: Michael Springman, Jeffrey L. Richardson
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

TRW's Ada Process Model, software architecture approach and comprehensive management metrics have been key factors in the success of CCPDS-R, a highly reliable, real-time distributed system with a sophisticated user interface and stringent performance requirements.
Allocating Task Interaction Graphs to Processors in Heterogeneous Networks
Authors: Chi-Chung Hui, Samuel T. Chanson
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

The problem of allocating task interaction graphs (TIGs) to heterogeneous computing systems to minimize job completion time is investigated. The only restriction is that the interprocessor communication cost is the same for any pair of processors. This is suitable for local area network based systems, such as Ethernet, as well as fully interconnected multiprocessor systems. An optimal polynomial solution exists if sufficient homogeneous processors and communication capacity are available. This solution is generalized to obtain two faster heuristics, one for the case of homogeneous processors and the other for heterogeneous processors. The heuristics were tested extensively with 60,900 systematically generated random TIGs and shown to be stable independent of the size of the TIG. A performance model is also proposed to predict the performance of the heuristic algorithms, and it is successful in explaining the experimental results qualitatively.
Sensitivity Analysis of Efficiency Scores: How to Bootstrap in Nonparametric Frontier Models
Authors: Leopold Simar, Paul W. Wilson
Venue: Management Science (1998)

Efficiency scores of production units are generally measured relative to an estimated pro-duction frontier. Nonparametric estimators (DEA, FDH,Â·Â·Â·) are based on a finite sample of observed production units. The bootstrap is one easy way to analyze the sensitivity of efficiency scores relative to the sampling variations of the estimated frontier. The main point in order to validate the bootstrap is to define a reasonable data-generating process in this complex framework and to propose a reasonable estimator of it. This paper provides a general methodology of bootstrapping in nonparametric frontier models. Some adapted methods are illustrated in analyzing the bootstrap sampling variations of input efficiency measures of electricity plants.
Symbolic layout compaction review
Authors: David G. Boyer
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Symbolic layout and compaction is reaching a mature status. This is demonstrated, in part, by the recent or imminent introductions of a number of commercial symbolic layout and compaction systems. The two most frequently used symbolic layout compaction approaches, constraint graph compaction and virtual grid compaction, are reviewed in this paper. The current status of these two approaches is presented by looking at the results of the ICCD87 compaction benchmark session.
Compacting MIMOLA microcode
Authors: J. Bhasker, Tariq Samad
Venue: Proceedings of the 20th annual workshop on Microprogramming (1987)

We address the problem of reducing the word length of microprograms. Two techniques are described: overlaying of fields and encoding of the microprogram. Formal analyses are presented of different encoding methods, assuming a VLSI implementation. A maximal encoding strategy appears to be the most area-efficient. Field overlaying is formulated as a clique-partitioning problem, and an efficient and practical clique-partitioning algorithm is presented. Based on these results, a microword compaction strategy that consists of field overlaying followed by maximal encoding has been implemented for the MIMOLA synthesis system (a design tool that generates excessively long microinstructions). Some considerations that are relevant to MIMOLA, and probably general to other similar tools, are discussed.
Mean-Square Numerical Methods for Stochastic Differential Equations with Small Noises
Authors: G. N. Milstein, M. V. Tret'yakov
Venue: SIAM Journal on Scientific Computing (1997)

A new approach to the construction of mean-square numerical methods for the solution of stochastic differential equations with small noises is proposed. The approach is based on expanding the exact solution of the system with small noises in powers of time increment and small parameter. The theorem on the mean-square estimate of method errors is proved. Various efficient numerical schemes are derived for a general system with small noises and for systems with small additive and small colored noises. The proposed methods are tested by calculation of Lyapunov exponents and simulation of a laser Langevin equation with multiplicative noises.
Simulation of communications networks
Authors: Averill M. Law, Michael G. McComas
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper discusses how simulation is used to design and analyze communications networks. Topics discussed include: network issues addressed by simulation, simulation software for network modeling, techniques for building valid and credible models, and statistical considerations. A comprehensive example will also be given in the conference presentation.
A proposal for calling conventions for APL defined functions
Authors: Vincent Lin
Venue: ACM SIGAPL APL Quote Quad (1996)

This paper will touch on the lack of mechanisms to pass arguments back from defined functions other than return values, if return values are already used as error codes. An extreme case is the use of call-back functions, or event procedures, to the events of GUI objects. In Dyalog APL/W, functionality of arguments and return values of call-back functions are already well-defined. The way you can pass information back from a call-back function, or event procedure, is by storing it as a global variable or by storing it into the Data property of an GUI object, which is also a global variable. This paper proposes a solution - utilize a Call-by-Reference mechanism of function arguments passing, in addition to return values of defined function, to pass results of defined functions back to calling functions. The programming environment is in Dyalog APL/W Version 7.1.3. This interpreter is robust itself and is feature-rich in terms of the integration of APL and MS Windows GUI environment. This paper starts with a description of problems encountered when programming in a GUI environment with call-back functions as well as the difference in design logic of programming styles among procedural programming and event-driven programming. Secondly, this paper presents a brief description of two different mechanisms to pass arguments into and out of defined functions. Thirdly, this paper presents a design solution to the problems mentioned above based on the Call-by-Reference mechanism described in second part. Lastly, a conclusion is made and potential pitfalls are explored.All code segments demonstrated here are implemented and tested in Dyalog APL/W Version 7.1.3.
The next-generation HDL (panel)
Authors: Richard Goering, Nanette Collins, Steven E. Shulz, Kurt Keutzer, James A. Rowson Larry Saunders, Alberto Sangiovanni-Vincentelli, Maq Mannan, Gérard Berry
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

The recent market battle between VHDL and Verilog HDL has obscured the larger issueof whether either of these languages is adequate for next-generation design. Can they beextended, or do we need an entirely new language that's constructed to handle system-leveldesign descriptions, behavioral and logic synthesis, simulation, and formalverification? If so, how should that language be created?
Implementation of Jacobi Rotations for Accurate Singular Value Computation in Floating Point Arithmetic
Authors: Zlatko Drmac
Venue: SIAM Journal on Scientific Computing (1997)

In this paper we con if \begin{displaymath} 1 - m\r value decomposition (SVD) $A=U\Sigma V^{\tau}$ of $A=[a_1,a_2]\in\R^{m\times 2}$ accurately in floating point arithmetic. It is shown how the rotation angacobi rotation $V$ (the right singular vector matrix) and how to compute $AV=U\Sigma$ even if the floating point representation of $V$ is the identity matrix. In the case $\ns{a_1}\gg\ns{a_2}$, underflow can produce the identity matrix as the floating point value of $V$, even for $a_1$, $a_2$ that are far from being mutually orthogonal. This can cause loss of accuracy and failure of convergence of the floating point implementation of the Jacobi method for computing the SVD. The modified Jacobi method recommended in this paper can be implemented as a reliable and highly accurate procedure for computing the SVD of general real matrices whenever the exact singular values do not exceed the underflow or overflow limits.
Compiler support to customize the mark and sweep algorithm
Authors: Dominique Colnet, Philippe Coucaud
Venue: Proceedings of the 1st international symposium on Memory management (1998)

Mark and sweep garbage collectors (GC) are classical but still very efficient automatic memory management systems. Although challenged by other kinds of systems, such as copying collectors, mark and sweep collectors remain among the best in terms of performance.This paper describes our implementation of an efficient mark and sweep garbage collector tailored to each program. Compiler support provides the type information required to statically and automatically generate this customized garbage collector. The segregation of objects by type allows the production of a more efficient GC code. This technique, implemented in Small Eiffel, our compiler for the object-oriented language Eiffel, is applicable to other languages and other garbage collection algorithms, be they distributed or not.We present the results obtained on programs featuring a variety of programming styles and compare our results to a well-know and high quality garbage collector.
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp
Authors: Matt Kaufmann, J. S. Moore
Venue: IEEE Transactions on Software Engineering (1997)

ACL2 is a reimplemented extended version of Boyer and Moore's Nqthm and Kaufmann's Pc-Nqthm, intended for large scale verification projects. This paper deals primarily with how we scaled up Nqthm's logic to an "industrial strength" programming language¿namely, a large applicative subset of Common Lisp¿while preserving the use of total functions within the logic. This makes it possible to run formal models efficiently while keeping the logic simple. We enumerate many other important features of ACL2 and we briefly summarize two industrial applications: a model of the Motorola CAP digital signal processing chip and the proof of the correctness of the kernel of the floating point division algorithm on the AMD5K86 microprocessor by Advanced Micro Devices, Inc.
Functional simulation using binary decision diagrams
Authors: Christoph Scholl, Rolf Drechsler, Bernd Becker
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

In many verification techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams (BDDs) for functional simulation. The area-time trade-off that results from different minimization techniques of the BDD is discussed. We propose new minimization methods based on dynamic reordering that allow smaller representations with (nearly) no runtime penalty.
Experiencing the introduction of software reused in Hitec
Authors: Cardino Guido, Matina Skourti
Venue: ACM SIGAPP Applied Computing Review (1996)

This article presents the lessons learnt during the introduction of software reuse in Hitec, in the Tarsal Esprit Project 20555. At the beginning of the project the development process in Hitec is characterized by a common situation for several small and medium companies: no high-level domain modeling, poor design specification, no company-wide software reuse strategy. This article shows that preliminary reuse experiments can help to face the first technical and cultural problems towards the adoption of reuse program. From a technical point of view, we show how a design recovery approach done on the existing systems can solve the problem of the absence of design and architectural information, which poses great limitation on the planned introduction of reuse. Moreover, the article shows that the application of this new methodology to a strategic in the company can raise and, effectively, has raised) the awareness of the developers about the necessity of formalized process.
Software project survival guide
Authors: Steve McConnell
Venue:  (1997)

This is the field guide for everyone involved in software development--especially those without formal management training. Acclaimed expert Steve McConnell maps out a proven approach to project management
Parameter identification methods for metamodeling simulations
Authors: Don Caughlin
Venue: Proceedings of the 28th conference on Winter simulation (1996)

A metamodel is a mathematical approximation of the system relationships defined by a high fidelity model or simulation. This paper presents methods that support new procedures that expanded the set of available metamodel representations be yond the traditional least squares formulation and added the capability to use dynamical metamodels. These methods compliment a new taxonomy of metamodel structures and procedures that separated the metamodeling process into a set of sequential decisions based on a priori information. This work was supported in part by The USAF Rome Laboratory Contract F30602-94-C-0110.
Scalable reliable multicast using multiple multicast groups
Authors: Sneha K. Kasera, Jim Kurose, Don Towsley
Venue: ACM SIGMETRICS Performance Evaluation Review (1997)

We examine an approach for providing reliable, scalable multicast communication, using multiple multicast groups for reducing receiver processing costs in a multicast session. In this approach a single multicast group is used for the original transmission of packets. Retransmissions of packets are done to separate multicast groups, which receivers dynamically join or leave. We first show that by using an infinite number of multicast groups, processing overhead at the receivers are substantially reduced. Next, we show that, for a specific negative acknowledgment (NAK)-based protocol, most of this reduction can be obtained by using only a small number of multicast groups for a wide range of system parameters. Finally, we present a local filtering scheme for minimizing join/leave signaling when multiple multicast groups are used.
Sudden infant death syndrome detector
Authors: H. Al-Nashash, B. Lvov
Venue: Technology and Health Care (1997)

A safe and simple system for the detection of sudden infant death syndrome (SIDS) is proposed. The system consists of an optoelectronic transceiver and electronic circuits capable of detecting infant breath, heart beating and any other infant movement. The system also includes an active alarm circuit. In case of absence of body activity or breathing, the active alarm will give the infant a mild push in order to awaken him or her. If there is no reaction, an audiovisual alarm is activated. Results obtained from six university students and three new born infants show that the system is capable of detecting apnea and SIDS.