ppxscal/embedding_network huggingface dataset:
Clock even suppression algorithm of VELVET and its application to S-820 development
Authors: Yoshio Takamine, Shunsuke Miyamoto, Shigeo Nagashima, Masayuki Miyoshi, Shun Kawabe
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

An advanced clock event suppression algorithm for high-speed logic simulation is described. A new signal value &ldquo;Cn&rdquo; and a &ldquo;current clock (CC)&rdquo;, which indicates the current status of clock signals, has been introduced to realize this algorithm. This algorithm suppresses about 60% of the total events, and eliminates 40% of CPU time. No overhead is needed to incorporate this algorithm using hardware support of VELVET (vectorized processing system for logic verification). Hitachi's latest supercomputer S-820 has been developed using VELVET. The development period has been shortened to 3/4 that of the S-810.
Efficient data layout, scheduling and playout control in MARS
Authors: Milind M. Buddhikot, Gurudatta M. Parulkar
Venue: Multimedia Systems (1997)

Large-scale on-demand multimedia servers thatcan provide independent and interactive access to a vastamount of multimedia information to a large number ofconcurrent clients will be required for a widespread deployment of exciting multimedia applications. Our project, calledMassively-parallel And Real-time Storage (MARS) is aimedat prototype development of such a large-scale server. Thispaper primarily focuses on the distributed data layout andscheduling techniques developed as a part of this project.These techniques support a high degree of parallelism andconcurrency, and efficiently implement various playout control operations, such as fast forward, rewind, pause, resume,frame advance and random access.
Trace scheduling optimization in a retargetable microcode compiler
Authors: Michael A. Howland, Robert A. Mueller, Philip H. Sweany
Venue: Proceedings of the 20th annual workshop on Microprogramming (1987)

We discuss the integration of a trace scheduling optimizer into a retargetable optimizing microcode compiler that handles complex timing relations. The trace scheduler requires no special treatment when retargeting the compiler, being constructed from machine independent algorithms that extract target micro-architecture details from a machine description used by the other compiler processes. We focus on the machine independent basis of the trace scheduler and demonstrate it on a hypothetical micro-architecture.
A performance-driven IC/MCM placement algorithm featuring explicit design space exploration
Authors: Henrik Esbensen, Ernest S. Kuh
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1997)

A genetic algorithm for building-block placement of ICs and MCMs is presented that simultaneously minimizes layout area and an Elmore-based estimate of the maximum path delay while trying to meet a target aspect ratio. Explicit design space exploration is performed by using a vector-valued, 3-dimensional cost function and searching for a set of distinct solutions representing the best trade-offs of the cost dimensions. From the output solutions, the designer can choose the solution with the preferred trade-off. In contrast to existing approaches, the required properties of the output solutions are specified without using weights or bounds. Consequently, the practical problems of specifying these quantities are eliminated. Promising experimental results are obtained for various placement problems, including a real-world design. Solution sets representing good, balanced cost trade-offs are found using a reasonable amount of runtime. Furthermore, the performance is shown to be comparable to that of simulated annealing in the special case of 1-dimensional optimization, in which direct comparison is possible.
On Weaknesses of Non&ndash;surjective Round Functions
Authors: Vincent Rijmen, Bart Preneel, Erik De Win
Venue: Designs, Codes and Cryptography (1997)

We propose a new attack on Feistel ciphers with a non-surjective round function such as the CAST cipher family and LOKI91. We extend the attack towards block ciphers that use a non-uniformly distributed round function and apply the extended attack to the CAST family. This attack demonstrates that the round function of a Feistel cipher with six to eight rounds needs to be surjective and sufficiently uniform.
On the Amount of Nondeterminism and the Power of Verifying
Authors: Liming Cai, Jianer Chen
Venue: SIAM Journal on Computing (1997)

The relationship between nondeterminism and other computational resources is investigated based on the "guess-then-check" model GC. Systematic techniques are developed to construct natural complete languages for the classes defined by this model. This improves a number of previous results in the study of limited nondeterminism. Connections of the model GC to computational optimization problems are exhibited.
International initiative
Authors: Anita Jawary, Christiana Birchak, Susan Strack Vargo
Venue: Proceedings of the 2nd conference on Integrating technology into computer science education (1997)

In 1996, students from Monash University, Indiana University and the University of Houston-Downtown (UHD) participated in a joint communication project using e-mail. The groups were of diverse cultural backgrounds and ranged from freshmen to mature age students. The international initiative was a valuable lesson in intercultural and computer-mediated communication. While Monash students discovered the limits of technology, the US students were thrilled to use it and found technology to influence intercultural perceptions. This paper explains the nature of the assignment from the vantage point of each group of students and briefly sketches some learning outcomes.
A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
Authors: Houyuan Jiang, Liqun Qi
Venue: SIAM Journal on Control and Optimization (1997)

Based on Fischer's function, a new nonsmooth equations approach is presented for solving nonlinear complementarity problems. Under some suitable assumptions, a local and Q-quadratic convergence result is established for the generalized Newton method applied to the system of nonsmooth equations, which is a reformulation of nonlinear complementarity problems. To globalize the generalized Newton method, a hybrid method combining the generalized Newton method with the steepest descent method is proposed. Global and Q-quadratic convergence is established for this hybrid method. Some numerical results are also reported.
PLAYGROUND: minimization of PLAs with mixed ground true outputs
Authors: Chin-Long Wey, Tsin-Yuan Chang
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A PLA (Programmable Logic Array) usually uses inverters to complement its output logic. The design can be easily modified using non-inverting buffers if complementary (or, ground true) outputs are needed. In this paper, we explore the tradeoffs in implementing PLAs with/without mixed ground true outputs. An efficient minimization algorithm, namely, PLAYGROUND, is presented. The PLAYGROUND program has been implemented on VAX 8600 in C language. The results of this study indicate that the number of product terms can be further reduced by as much as 50% from the results obtained by the ESPRESSO program when the mixed ground true outputs are used.
Dynamic model abstraction
Authors: Kangsun Lee, Paul A. Fishwick
Venue: Proceedings of the 28th conference on Winter simulation (1996)

While complex behavior can be generated through simple systems, as in chaotic and nonlinear systems, complex systems axe found where a systems study contains multiple physical objects and interactions. Through the use of hierarchy, we are able to simplify and organize the complex system. Every level within the hierarchy may be refined into another level. System abstraction involves simplification through structural system representation as well as through behavioral approximations of executed model structure. There has been little work on creating a unified taxonomy for model abstraction. We present such a taxonomy and define two major sub-fields of model abstraction, while illustrating both sub-fields through detailed examples. The introduction of this taxonomy provides system and simulation researchers with a way in which to view and manage complex systems.
The IBM engineering verification engine
Authors: Daniel K. Beece, George Deibert, Georgina Papp, Frank Villante
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

In this review article, we describe IBM's Engineering Verification Engine, EVE, a special-purpose, highly-parallel programmable machine for the simulation of computer logic and currently being used at several locations within IBM. EVE, which is based on the architecture of the Yorktown Simulation Engine, can simulate two million gates at a speed of more than two billion gate evaluations per second, far beyond the capabilities of existing software simulators. In this paper, we give an overview of the EVE architecture, hardware and software, and describe some current applications.
The Restarted Arnoldi Method Applied to Iterative Linear System Solvers for the Computation of Rightmost Eigenvalues
Authors: Karl Meerbergen, Dirk Roose
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

For the computation of a few eigenvalues of $Ax=\mu Bx$, the restarted Arnoldi method is often applied to transformations, e.g., the shift-invert transformation. Such transformations typically require the solution of linear systems. This paper presents an analysis of the application of the transformation $(M_A-\alpha M_B)^{-1}(A-\lambda B)$ to Arnoldi's method where $\alpha$ and $\lambda$ are parameters and $M_A-\alpha M_B$ is some approximation to $A-\alpha B$. In fact, $(M_A-\alpha M_B)^{-1}$ corresponds to an iterative linear system solver for the system $(A-\alpha B)x=b$. The transformation is an alternative to the shift-invert transformation $(A-\alpha B)^{-1}B$ when direct system solvers are not available or not feasible. The restarted Arnoldi method is analyzed in the case of detection of the rightmost eigenvalues of real nonsymmetric matrices. The method is compared to Davidson's method by use of numerical examples.
Tutorial on ProSim: a knowledge-based simulation model design tool
Authors: Madhavi Lingineni, Bruce Caraway, Perakath C. Benjamin, Richard J. Mayer
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper introduces ProSim, a knowledge-based simulation design tool that automatically generates simulation models from process models. Domain experts who are familiar with the various aspects of the system may be interviewed and process models can be developed based on the evidence collected using ProSim. The built-in simulation design support environment of ProSim enables building simulation models automatically from process models. A purchase order processing system example is described to demonstrate the utility of ProSim.
Introduction to GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Summary information about key aspects of the simulation modeling language GPSS is provided. The Class of problems to which GPSS applies especially well is described; commentary on the semantics and syntax of the language is offered, and an example is provided; the learning-oriented literature for GPSS is summarized; various GPSS implementations are commented on; the time-sharing networks offering GPSS are cited; and public courses on the language are listed. The GPSS tutorial itself will delve into the fundamental details of GPSS and present examples of simple GPSS models. Copies of the transparencies used for the tutorial will be distributed to those in attendance.
Learning Qualitative Models of Dynamic Systems
Authors: David T. Hau, Enrico W. Coiera
Venue: Machine Learning (1997)

The automated construction of dynamic system models is an important application area for ILP. We describe a method that learns qualitative models from time-varying physiological signals. The goal is to understand the complexity of the learning task when faced with numerical data, what signal processing techniques are required, and how this affects learning. The qualitative representation is based on Kuipers&lsquo; QSIM. The learning algorithm for model construction is based on Coiera&lsquo;s GENMODEL. We show that QSIM models are efficiently PAC learnable from positive examples only, and that GENMODEL is an ILP algorithm for efficiently constructing a QSIM model. We describe both GENMOEL which performs RLGG on qualitative states to learn a QSIM model, and the front-end processing and segmenting stages that transform a signal into a set of qualitative states. Next we describe results of experiments on data from six cardiac bypass patients. Useful models were obtained, representing both normal and abnormal physiological states. Model variation across time and across different levels of temporal abstraction and fault tolerance is explored. The assumption made by many previous workers that the abstraction of examples from data can be separated from the learning task is not supported by this study. Firstly, the effects of noise in the numerical data manifest themselves in the qualitative examples. Secondly, the models learned are directly dependent on the initial qualitative abstraction chosen.
A flow-based approach to datagram security
Authors: Suvo Mittra, Thomas Y. C. Woo
Venue: ACM SIGCOMM Computer Communication Review (1997)

Datagram services provide a simple, flexible, robust, and scalable communication abstraction; their usefulness has been well demonstrated by the success of IP, UDP, and RPC. Yet, the overwhelming majority of network security protocols that have been proposed are geared towards connection-oriented communications. The few that do cater to datagram communications tend to either rely on long term host-pair keying or impose a session-oriented (i.e., requiring connection setup) semantics.Separately, the concept of flows has received a great deal of attention recently, especially in the context of routing and QoS. A flow characterizes a sequence of datagrams sharing some pre-defined attributes. In this paper, we advocate the use of flows as a basis for structuring secure datagram communications. We support this by proposing a novel protocol for datagram security based on flows. Our protocol achieves zero-message keying, thus preserving the connectionless nature of datagram, and makes use of soft state, thus providing the per-packet processing efficiency of session-oriented schemes. We have implemented an instantiation for IP in the 4.4BSD kernel, and we provide a description of our implementation along with performance results.
A Stabilized QMR Version of Block BiCG
Authors: V. Simoncini
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

Block BICG (BBICG) is an appealing method for solving $AX=B$ with $A\in{\Bbb R}^{n\times n}$ and $X, B \in {\Bbb R}^{n\times s}$. Because of its short-term recurrence form, memory allocation and computational cost do not depend on additional parameters. Unfortunately, loss of orthogonality prevents convergence in many cases.We present a new version of the algorithm that generates blocks of vectors that are vector-wise $A$-biorthogonal; moreover, a near-breakdown safeguard strategy inside the block stabilizes the computation of the coefficients. In order to smooth the possibly erratic behavior of the residual norm curve, the approximate solution is determined using a block QMR procedure. The new method considerably improves the robustness of the original algorithm, showing very good performance on dense or preconditioned matrices over both BBICG and the single right-hand side solver coupled two-term QMR method applied on each system.
A Large 16*16 IF Analog Switch Matrix for Personal CommunicationsSatellites
Authors: Markku Åberg, Arto Rantala, Helena Pohjonen
Venue: Analog Integrated Circuits and Signal Processing (1998)

A 16 input and 16 output channels single chip intermediate frequency range (160 MHz) analog switch matrix for personal communication satellites has been designed and processed by using a commercial 1.2 &micro;m BiCMOS technology. The circuit has low power consumption (<2W) and low insertion loss with maximum output power of 0 dBm.
Averaging of Random Sets Based on Their Distance Functions
Authors: Adrian Baddeley, Ilya Molchanov
Venue: Journal of Mathematical Imaging and Vision (1998)

A new notion of expectation for random sets (or average of binary images) is introduced using the representation of sets by distance functions. The distance function may be the familiar Euclidean distance transform, or some generalisation. The expectation of a random set X is defined as the set whose distance function is closest to the expected distance function of X. This distance average can be applied to obtain the average of non-convex and non-connected random sets. We establish some basic properties, compute examples, and prove limit theorems for the empirical distance average of independent identically distributed random sets.
Spatiotemporal Segmentation Based on Region Merging
Authors: Fabrice Moscheni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

This paper proposes a technique for spatiotemporal segmentation to identify the objects present in the scene represented in a video sequence. This technique processes two consecutive frames at a time. A region-merging approach is used to identify the objects in the scene. Starting from an oversegmentation of the current frame, the objects are formed by iteratively merging regions together. Regions are merged based on their mutual spatiotemporal similarity. The spatiotemporal similarity measure takes both temporal and spatial information into account, the emphasis being on the former. We propose a Modified Kolmogorov-Smirnov test for estimating the temporal similarity. This test efficiently uses temporal information in both the residual distribution and the motion parametric representation. The region-merging process is based on a weighted, directed graph. Two complementary graph-based clustering rules are proposed, namely, the strong rule and the weak rule. These rules take advantage of the natural structures present in the graph. Also, the rules take into account the possible errors and uncertainties reported in the graph. The weak rule is applied after the strong rule. Each rule is applied iteratively, and the graph is updated after each iteration. Experimental results on different types of scenes demonstrate the ability of the proposed technique to automatically partition the scene into its constituent objects.
Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL
Authors: Paul Finn, Stephen Muggleton, David Page, Ashwin Srinivasan
Venue: Machine Learning (1998)

This paper presents a case study of a machine-aided knowledge discovery process within the general area of drug design. Within drug design, the particular problem of pharmacophore discovery is isolated, and the Inductive Logic Programming (ILP) system progol is applied to the problem of identifying potential pharmacophores for ACE inhibition. The case study reported in this paper supports four general lessons for machine learning and knowledge discovery, as well as more specific lessons for pharmacophore discovery, for Inductive Logic Programming, and for ACE inhibition. The general lessons for machine learning and knowledge discovery are as follows. 1. An initial rediscovery step is a useful tool when approaching a new application domain.2. General machine learning heuristics may fail to match the details of an application domain, but it may be possible to successfully apply a heuristic-based algorithm in spite of the mismatch.3. A complete search for all plausible hypotheses can provide useful information to a user, although experimentation may be required to choose between competing hypotheses.4. A declarative knowledge representation facilitates the development and debugging of background knowledge in collaboration with a domain expert, as well as the communication of final results.
An APL database system for R D laboratories
Authors: H. A. Hartung
Venue: ACM SIGAPL APL Quote Quad (1985)

Descriptions are given for the main features of a data base system implemented with APL at the Philip Morris R D laboratories. It has been used widely to solve various scientific and engineering problems. It is based on a flexible system for organizing APL direct access files such that they store groups of objects very conveniently. Conventions which have been durable over many years because they are very useful in R D projects are explained.
Evaluating Alternative Software Production Functions
Authors: Qing Hu
Venue: IEEE Transactions on Software Engineering (1997)

Software development projects are notorious for cost overruns and schedule delays. While dozens of software cost models have been proposed, few of them seem to have any degree of consistent accuracy. One major factor contributing to this persistent and wide spread problem is an inadequate understanding of the real behavior of software development processes. We believe that software development could be studied as an economic production process and that established economic theories and methods could be used to develop and validate software production and cost models. Here, we present the results of evaluating four alternative software production models using the P-test, a statistical procedure developed specifically for testing the truth of a hypothesis in the presence of alternatives in econometric studies. We found that the truth of the widely used Cobb-Douglas type of software production and cost models (e.g., COCOMO) cannot be maintained in the presence of quadratic or translog models. Overall, the quadratic software production function is shown to be the most plausible model for representing software production processes. Limitations of this study and future directions are also discussed.
Quality of service based routing: a performance perspective
Authors: George Apostolopoulos, Roch Guérin, Sanjay Kamat, Satish K. Tripathi
Venue: ACM SIGCOMM Computer Communication Review (1998)

Recent studies provide evidence that Quality of Service (QoS) routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of traffic. However, there are still strong concerns about the increased cost of QoS routing, both in terms of more complex and frequent computations and increased routing protocol overhead. The main goals of this paper are to study these two cost components, and propose solutions that achieve good routing performance with reduced processing cost. First, we identify the parameters that determine the protocol traffic overhead, namely (a) policy for triggering updates, (b) sensitivity of this policy, and (c) clamp down timers that limit the rate of updates. Using simulation, we study the relative significance of these factors and investigate the relationship between routing performance and the amount of update traffic. In addition, we explore a range of design options to reduce the processing cost of QoS routing algorithms, and study their effect on routing performance. Based on the conclusions of these studies, we develop extensions to the basic QoS routing, that can achieve good routing performance with limited update generation rates. The paper also addresses the impact on the results of a number of secondary factors such as topology, high level admission control, and characteristics of network traffic.