ppxscal/embedding_network huggingface dataset:
Synthesis of Native Mode Self-Test Programs
Authors: Jian Shen, Jacob A. Abraham
Venue: Journal of Electronic Testing: Theory and Applications (1998)

Recent studies show that at-speed functional tests are better for finding realistic defects than tests executed at lower speeds. This advantage has led to growing interest in design for at-speed tests. In addition, time-to-market requirements dictate development of tests early in the design process. In this paper, we present a new methodology for synthesis of at-speed self-test programs for microprocessors. Based on information about the instruction set, this high-level test generation methodology can generate instruction sequences that exercise all the functional capabilities of complex processors. Modern processors have large memory modules, register files and powerful ALUs with comprehensive operations, which can be used to generate and control built-in tests and to evaluate the response of the tests. Our method exploits the functional units to compress and check the test response at chip internal speeds. No hardware test pattern generators or signature analyzers are needed, and the method reduces area overhead and performance impact as compared to current BIST techniques. A novel test instruction insertion technique is introduced to activate the control/status inputs and internal modules related to them. The new methodology has been applied to an example processor much more complex than any benchmark circuit used in academia today. The results show that our approach is very effective in achieving high fault coverage and automation in at-speed self-test generation for microprocessor-like circuits.
Superconvergent Interpolants for the Collocation Solution of Boundary Value Ordinary Differential Equations
Authors: W. H. Enright, P. H. Muir
Venue: SIAM Journal on Scientific Computing (1999)

A long-standing open question associated with the use of collocation methods for boundary value ordinary differential equations is concerned with the development of a high order continuous solution approximation to augment the high order discrete solution approximation, obtained at the mesh points which subdivide the problem interval. It is well known that the use of collocation at Gauss points leads to solution approximations at the mesh points for which the global error is O(h2k), where k is the number of collocation points used per subinterval and h is the subinterval size. This discrete solution is said to be superconvergent. The collocation solution also yields a C0 continuous solution approximation that has a global error of O(hk+1). In this paper, we show how to efficiently augment the superconvergent discrete collocation solution to obtain C1 continuous "superconvergent" interpolants whose global errors are O(h2k). The key ideas are to use the theoretical framework of continuous Runge--Kutta schemes and to augment the collocation solution with inexpensive monoimplicit Runge--Kutta stages. Specific schemes are derived for k = 1, 2, 3, and 4. Numerical results are provided to support the theoretical analysis.
On a Newton-Like Method for Solving Algebraic Riccati Equations
Authors: Chun-Hua Guo, Alan J. Laub
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

An exact line search method has been introduced by Benner and Byers [IEEE Trans. Automat. Control, 43 (1998), pp. 101--107] for solving continuous algebraic Riccati equations. The method is a modification of Newton's method. A convergence theory is established in that paper for the Newton-like method under the strong hypothesis of controllability, while the original Newton's method needs only the weaker hypothesis of stabilizability for its convergence theory. It is conjectured there that the controllability condition can be weakened to the stabilizability condition. In this article we prove that conjecture.
An Intranet-based System for Quality Assurance in Surgery
Authors: M. Dugas, J. Scheichenzuber, H. Hornung
Venue: Journal of Medical Systems (1999)

Quality assurance in surgery relies on precise medical records about surgical procedures and outcomes. Data quality is crucial for statistical evaluation&semi; missing values cannot be avoided but must be minimized. The quality assurance system must be accessible from many locations within the clinic&semi; given the complex and heterogeneos computing infrastructure this is a technological challenge. Intranet-technology&mdash;the application of internet-tools in local networks&mdash;can help to solve the technical problems. We designed, implemented and evaluated a generic Intranet-based quality assurance system in surgery. The basic concept is multi-purpose data entry with predefined textblocks, i.e. the same data is used for clinical reports as well as scientific evaluations. Our first instance were reports on laparoscopic cholecystectomies consisting of 41 Items and 132 textelements. Because of the good clinical acceptance of the system it will be expanded to other surgical procedures.
Minimizing and Stationary Sequences of Constrained Optimization Problems
Authors: Chin-Cheng Chou, Kung-Fu Ng, Jong-Shi Pang
Venue: SIAM Journal on Control and Optimization (1998)

We study some fundamental asymptotic properties associated with the well-posedness of constrained optimization problems. Emphasis is placed on the relation between minimizing and stationary sequences and their characterizations in terms of a set of asymptotic Karush--Kuhn--Tucker (KKT) optimality conditions. Unlike the subdifferential approach used by Auslender, Cominetti, and Crouzeix, we use a residual function approach that is closely tied to the theory of error bounds; this approach handles constraints explicitly and allows the effective treatment of infeasible, stationary sequences. The asymptotic KKT conditions provide an asymptotic optimality certificate for inequality constrained programs. Specializations of the results to convex quadratically constrained convex quadratic spline minimization problems and convex programs with Hölderian minima are discussed. An application of the results to the convergence of a family of Newton-type iterative descent methods involving singular quasi-Newton matrices for solving a constrained minimization problem is also presented.
Scaling application performance on a cache-coherent multiprocessor
Authors: Dongming Jiang, Jaswinder Pal Singh
Venue: ACM SIGARCH Computer Architecture News (1999)

Hardware-coherent, distributed shared address space systems are increasingly successful at moderate scale. However, it is unclear whether, or with how much difficulty, the performance of a load-store shared address space programming model scales to large processor counts on real applications. We examine this question using an aggressive case-study machine, the SGI Origin2000, up to 128 processors. We show for the first time that scalable performance can indeed be achieved in this programming model on a wide range of applications, including challenging kernels like FFT. However, this does not come easily, even for applications considered to be already highly optimized, and is very often not simply a matter of increasing problem size. Rather, substantial further application restructuring is often needed, which is usually quite algorithmic in nature. We examine how the restructurings compare with those needed for performance portability to shared virtual memory on clusters, and we comment on common programming guidelines for performance portability and scalability as well as on how the programming difficulty compares with that of explicit message passing. We also examine where applications spend their time on this large machine, the impact of special hardware features that the machine provides, and the impact of mapping to the network topology.
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
Authors: Sanguthevar Rajasekaran, Sartaj Sahni
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In this paper we present efficient algorithms for packet routing, sorting, and selection on the OTIS-Mesh. The diameter of an N2-processor OTIS-Mesh is $4\sqrt N-3.$ We present an algorithm for routing any partial permutation in $4\sqrt N+o\left( {\sqrt N} \right)$ time. Our selection algorithm runs in time $6\sqrt N+o\left( {\sqrt N} \right)$ and our sorting algorithm runs in $8\sqrt N+o\left( {\sqrt N} \right)$ time. All these algorithms are randomized and the stated time bounds hold with high probability. Also, the queue size needed for these algorithms is O(1) with high probability.
Applying policy management to reduce support costs for remote and mobile computing
Authors: Russell J. Sharer
Venue: International Journal of Network Management (1998)

Remote access to networks has become a standard part of corporate networks worldwide, and one that is growing rapidly. How are network managers to respond to this growth without a corresponding increase in resources? &copy; 1998 by John Wiley & Sons, Ltd.
Provably efficient scheduling for languages with fine-grained parallelism
Authors: Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
Venue: Journal of the ACM (JACM) (1999)

Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to processors. A common concern in executing such programs is to schedule tasks to processors dynamically so as to minimize not only the execution time, but also the amount of space (memory) needed. Without careful scheduling, the parallel execution on p processors can use a factor of p or larger more space than a sequential implementation of the same program.This paper first identifies a class of parallel schedules that are provably efficient in both time and space. For any computation with w units of work and critical path length d, and for any sequential schedule that takes space s1, we provide a parallel schedule that takes fewer than w/p + d steps on p processors and requires less than s1 + p&dot;d space. This matches the lower bound that we show, and significantly improves upon the best previous bound of s1&dot;p spaces for the common case where d<<s1. The paper then describes a scheduler for implementing high-level languages with nested parallelism, that generates schedules in this class. During program execution, as the structure of the computation is revealed, the scheduler keeps track of the active tasks, allocates the tasks to the processors, and performs the necessary task synchronization. The scheduler is itself a parallel algorithm, and incurs at most a constant factor overhead in time and space, even when the scheduling granularity is individual units of work. The algorithm is the first efficient solution to the scheduling problem discussed here, even if space considerations are ignored.
Integration of spatial join algorithms for processing multiple inputs
Authors: Nikos Mamoulis, Dimitris Papadias
Venue: ACM SIGMOD Record (1999)

Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined inputs, while others treat datasets with no index, providing solutions for the case where at least one input comes as an intermediate result of another database operator. In this paper we analyze previous work on spatial joins and propose a novel algorithm, called slot index spatial join (SISJ), that efficiently computes the spatial join between two inputs, only one of which is indexed by an R-tree. Going one step further, we show how SISJ and other spatial join algorithms can be implemented as operators in a database environment that joins more than two spatial datasets. We study the differences between relational and spatial multiway joins, and propose a dynamic programming algorithm that optimizes the execution of complex spatial queries.
$\Bbb L^2$ Sufficient Conditions for End-Constrained Optimal Control Problems With Inputs in a Polyhedron
Authors: J. C. Dunn
Venue: SIAM Journal on Control and Optimization (1998)

An $\hbox{{\bbb L}}^2$-local optimality sufficiency theorem is proved for a class of structured infinite-dimensional nonconvex programs with constraints of the form $u\in\Omega$ and h(u)=0, where $\Omega$ is a set of Lebesgue measurable essentially bounded vector-valued functions $u(\cdot ): [0,1]\rightarrow \hbox{{\bbb R}}^m$ with range in a polyhedron U, and h is a smooth map of the space of essentially bounded functions $u(\cdot )$ into ${\bbb R}^k$. The sufficiency theorem is based on formal counterparts of the finite-dimensional Karush--Kuhn--Tucker sufficient conditions in a Cartesian product of polyhedra, a strengthened variant of Pontryagin's necessary condition, and structure and continuity conditions on the first and second differentials of the objective function and equality constraint functions. The new sufficient conditions are directly applicable to nonconvex continuous-time Bolza optimal control problems with control-quadratic Hamiltonians, unqualified affine inequality constraints on vector-valued control inputs, and equality constraints on the terminal state vector or equivalent isoperimetric constraints on integrals of functions depending on the state and control variables.
New Facets of the Linear Ordering Polytope
Authors: G. Bolotashvili, M. Kovalev, E. Girlich
Venue: SIAM Journal on Discrete Mathematics (1999)

The linear ordering problem has many applications and was studied by many authors (for a survey, see [P. Fishburn, SIAM J. Discrete Math., 4 (1990), pp. 478--488; M. Grötschel, M. Jünger, and G. Reinelt, Math. Programming, 33 (1985), pp. 43--60; G. Reinelt, The Linear Ordering Problem: Algorithm and Applications, Heldermann Verlag, 1985]). One approach to solving this problem, the so-called cutting plane method [M. Grötschel, M. Jünger, and G. Reinelt, Oper. Res., 32 (1984), pp. 1195--1220; V. A. Yemelichev, M. M. Kovalev, and M. K. Kravtsov, Polytopes, Graphs, Optimization, Cambridge University Press, 1984], derives facet-defining inequalities which are violated by current nonfeasible solution and adds them to the system of inequalities of current linear programming problems.We present a method (rotation method) for generating new facets of polyhedra by using previously known ones. The rotation method for the linear ordering polytope generalizes facets induced by subgraphs called $m$-fences, Möbius ladders, and Zm-facets introduced by Reinelt, (m,k)-fences introduced by Bolotashvili [G. C. Bolotashvili, A Class of Facets of the Permutation Polytope and a Method for Constructing Facets of the Permutation Polytope, preprint VINITI N3403-B87, Moscow, 1987 (in Russian)]; and t-reinforced m-fences introduced by Leung and Lee [J. Leung and J. Lee, Discrete Appl. Math., 50 (1984), pp. 185--200]. We introduce 10 collections of inequalities representing facets of the linear ordering polytope. Among them are three that coincide with earlier known ones: m-wheel-facets introduced by Reinelt, augmented m-fences introduced by McLennan [A. McLennan, in Preferences, Uncertainty and Optimality, West View Press, 1990, pp. 187--202]; and augmented t-reinforced m-fences introduced by Leung and Lee.
The Use of Regularization Methods in Computing Radon--Nikodým Derivatives. Application to Grain-Size Distributions
Authors: Claude Manté
Venue: SIAM Journal on Scientific Computing (1999)

Let a probability law $\nu $ on [a,b] be absolutely continuous with respect to another probability law $\mu $ (specified), equivalent to the Lebesgue measure $\lambda $ on [$a,b$]. We seek to approximate the density $\frac{d\nu }{d\mu }$ (assumed to be in $L_{\mu }^{2}([a,b])$) in the least square sense, given the values of the distribution function $\nu ([a,t])$ at fixed points $\{t_{j}:1\leq j\leq p\}$. We obtain a convenient solution of this ill-posed problem via a Hilbert space embedding, and the associated discretized problem is solved by using regularization methods. This problem is connected with sedimentological topics such as sediment transport and changes of scale. As an example, a weight frequency cumulative curve is processed.
A CMOS Hearing Aid Device
Authors: José Silva-Martínez, Sergio Solís-Bustos, Jorge Salcedo-Suñer, Rogelio Rojas-Hernández, Martin Schellenberg
Venue: Analog Integrated Circuits and Signal Processing (1999)

In this paper a CMOS Hearing Aid Device is described. The system is composed of a low-distortion low-noise preamplifier, an automatic gain control (AGC), a fully programmable switched-capacitor filter (equalizer), and a control system. The device has been fabricated in a 1.2 &mu;m CMOS analog process. The dynamic range of the device is 55 dB while the harmonic distortion components are below &minus;50 dB. Experimental results show the feasibility of the proposed architecture.
The effects of animated characters on anxiety, task performance, and evaluations of user interfaces
Authors: Raoul Rickenberg, Byron Reeves
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Animated characters are common in user interfaces, but important questions remain about whether characters work in all situations and for all users. This experiment tested the effects of different character presentations on user anxiety, task performance, and subjective evaluations of two commerce websites. There were three character conditions (no character, a character that ignored the user, and a character that closely monitored work on the website). Users were separated into two groups that had different attitudes about accepting help from others: people with control orientations that were external (users thought that other people controlled their success) and those with internal orientations (users thought they were in control). Results showed that the effects of monitoring and individual differences in thoughts about control worked as they do in real life. Users felt more anxious when characters monitored their website work and this effect was strongest for users with an external control orientation. Monitoring characters also decreased task performance, but increased trust in website content. Results are discussed in terms of design considerations that maximize the positive influence of animated agents.
Statistical estimation of access frequencies in data broadcasting environments
Authors: Jeffrey Xu Yu, Toshio Sakata, Kian-Lee Tan
Venue: Wireless Networks (2000)

In a data publishing environment, the server periodically broadcasts data to users based on a broadcast program. The program is constructed using knowledge of access frequencies, which is assumed to be available and accurate, on the broadcast data. For example, the program may broadcast frequently accessed data more often in a broadcast cycle. However, it remains an open question as to how to obtain such access frequencies. The difficulty of obtaining such access frequencies is that in such an environment, mobile users are only listening to the channel they are interested in and do not request for the data items from the server. A promising approach in the literature is to make use of broadcast misses to understand the access patterns in a data publishing environment. In this case, mobile users may decide whether to wait for the required item to arrive or to make an explicit request for it even though it will be published. However, estimation of access frequencies based on broadcast misses may not be accurate because the number of broadcast misses to the data depends on how frequently the data is broadcast&colon; if a piece of data is more frequently broadcast than the others, then the broadcast misses to that piece of data will be low because the average waiting time is low. In this paper, we propose a statistical estimation model that is based on maximum likelihood estimation to estimate the access frequencies. Our approach is novel in that it exploits knowledge that is available &ndash; broadcast misses and broadcast frequencies &ndash; to refine the program to better meet the needs of the user population. We report our simulation study that demonstrates the effectiveness of our approach.
Reverse execution of programs
Authors: Bitan Biswas, R. Mall
Venue: ACM SIGPLAN Notices (1999)

Conventional debuggers do not allow users to go back and examine the program states at statements which have already been executed. In case the user wants to examine the program state at a statement which was executed sometime back, he is forced to restart the entire debugging process. To overcome this problem, we examine the issue of reverse execution of programs. To this end, we introduce the concept of inverse of a statement. We describe our implementation of a debugger which can execute C programs in either forward or backward direction depending upon an option set by the user. Our approach is easily extendible to other programming languages.
Estimation of software reliability by stratified sampling
Authors: Andy Podgurski, Wassim Masri, Yolanda McCleese, Francis G. Wolff, Charles Yang
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1999)

A new approach to software reliability estimation is presented that combines operational testing with stratified sampling in order to reduce the number of program executions that must be checked manually for conformance to requirements. Automatic cluster analysis is applied to execution profiles in order to stratify captured operational executions. Experimental results are reported that suggest this approach can significantly reduce the cost of estimating reliability.
Optimal Bounds for Matching Routing on Trees
Authors: Louxin Zhang
Venue: SIAM Journal on Discrete Mathematics (1999)

The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutation on an n-node tree (and thus graph) can be routed in $\frac{3}{2}n + O(\log n)$ steps. This answers an open problem of Alon, Chung, and Graham [ SIAM J. Discrete Math., 7 (1994), pp. 516--530].
Optimal Portfolio Hedging with Nonlinear Derivatives and Transaction Costs
Authors: Jussi Keppo, Samu Peura
Venue: Computational Economics (1999)

We consider the problem of dynamically hedging a fixed portfolio of assets in the presence of non-linear instruments and transaction costs, as well as constraints on feasible hedging positions. We assume an investor maximizing the expected utility of his terminal wealth over a finite holding period, and analyse the dynamic portfolio optimization problem when the trading interval is fixed. An approximate solution is obtained from a two-stage numerical procedure. The problem is first transformed into a nonlinear programming problem which utilizes simulated coefficient matrices. The nonlinear programming problem is then solved numerically using standard constrained optimization techniques.
Replica management in real-time Ada 95 applications
Authors: Luís Miguel Pinho, Francisco Vasques
Venue: Proceedings of the ninth international workshop on Real-time Ada (1999)

In this paper, we present some of the fault tolerance management mechanisms being implemented in the Multi- mu;- architecture, namely its support for replica non-determinism. In this architecture, fault tolerance is achieved by node active replication, with software based replica management and fault tolerance transparent algorithms. A software layer implemented between the application and the real-time kernel, the Fault Tolerance Manager (FTManager), is the responsible for the transparent incorporation of the fault tolerance mechanismsThe active replication model can be implemented either imposing replica determinism or keeping replica consistency at critical points, by means of interactive agreement mechanisms. One of the Multi- mu; architecture goals is to identify such critical points, relieving the underlying system from performing the interactive agreement in every Ada dispatching point.