ppxscal/embedding_network huggingface dataset:
An efficient implementation of Java's remote method invocation
Authors: Jason Maassen, Rob van Nieuwpoort, Ronald Veldema, Henri E. Bal, Aske Plaat
Venue: ACM SIGPLAN Notices (1999)

Java offers interesting opportunities for parallel computing. In particular, Java Remote Method Invocation provides an unusually flexible kind of Remote Procedure Call. Unlike RPC, RMI supports polymorphism, which requires the system to be able to download remote classes into a running application. Sun's RMI implementation achieves this kind of flexibility by passing around object type information and processing it at run time, which causes a major run time overhead. Using Sun's JDK 1.1.4 on a Pentium Pro/Myri.net cluster, for example, the latency for a null RMI (without parameters or a return value) is 1228 mu;sec, which is about a factor of 40 higher than that of a user-level RPC. In this paper, we study an alternative approach for implementing RMI, based on native compilation. This approach allows for better optimization, eliminates the need for processing of type information at run time, and makes a light weight communication protocol possible. We have built a Java system based on a native compiler, which supports both compile time and run time generation of marshallers. We find that almost all of the run time overhead of RMI can be pushed to compile time. With this approach, the latency of a null RMI is reduced to 34 mu;sec, while still supporting polymorphic RMIs (and allowing interoperability with other JVMs).
SRAM-Based FPGAs: Testing the Embedded RAM Modules
Authors: M. Renovell, J. M. Portal, J. Figueras, Y. Zorian
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper addresses the problem of testing the RAM mode of the LUT/RAM modules of configurable SRAM-based Field Programmable Gate Arrays (FPGAs) using a minimum number of test configurations. A model of architecture for the LUT/RAM module with N inputs and 2N memory cells is proposed taking into account the LUT and RAM modes. Targeting the RAM mode, we demonstrate that a unique test configuration is required for a single module. The problem is shown equivalent to the test of a classical SRAM circuit allowing to use existing algorithms such as the March tests. We also propose a unique test configuration called &lsquo;pseudo shift register&rsquo; for an m &times; m array of modules. In the proposed configuration, the circuit operates as a shift register and an adapted version of the MATS++ algorithm called &lsquo;shifted MATS++&rsquo; is described.
Robustness with Respect to Delays for Exponential Stability of Distributed Parameter Systems
Authors: Richard Rebarber, Stuart Townley
Venue: SIAM Journal on Control and Optimization (1999)

In this paper we address the question of whether the open-loop exponential growth rate of a linear system can be improved by a feedback in such a way that this improvement is robust with respect to small delays in the feedback loop. When the input operator is admissible, and the class of possible feedbacks consists of compact operators, we find that if a feedback can improve the exponential growth rate, then it can do so robustly. Furthermore, we find that if the control space is finite dimensional and a bounded feedback cannot be found to improve exponential stability, then a large class of unbounded feedbacks cannot improve the exponential growth rate robustly, even if such feedbacks can improve the exponential growth rate in the absence of delays.
The Medical Database as a Tool for Improving Maternal/Infant Continuity of Care
Authors: Linda P. Miller, Benn Greenspan, Jennifer S. Dowd
Venue: Journal of Medical Systems (1999)

Analysis of the Sinai Health System's integrated medical database revealed a serious discontinuity of care, frequently observed in underserved communities, for mothers who delivered at the hospital but failed to return on a timely basis for postpartum visits for themselves and newborn visits for their babies. Since the Sinai Health System (SHS) is a fully integrated health system including community-based primary care, a process improvement project to improve rates of return was initiated. Prior to hospital discharge, a staff member visited each new mother and baby to schedule clinic follow-up appointments. Appointment compliance was monitored using the SHS integrated medical database. Results after the first year showed marked improvement. Eighty percent of mothers returned for postpartum care within 4 months of delivery compared to 46 at baseline. Eighty eight percent of newborns were seen in the clinics within the four month timeframe compared to a baseline of 59%. The integrated medical database not only allowed for identification of this problem but was an essential tool at each point in the intervention.
Optimal allocation of carry-save-adders in arithmetic optimization
Authors: Junhyung Um, Taewhan Kim, C. L. Liu
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocation of CSAs. Specifically, we present a polynomial time algorithm which finds an optimal-timing CSA allocation for a given arithmetic expression. In addition, we extend our result for CSA allocation to the problem of optimizing arithmetic expressions across the boundary of design hierarchy by introducing a new concept, called auxiliary ports. Our algorithm can be used to carry out the CSA allocation step optimally and automatically, and this can be done within the context of a standard HDL synthesis environment.
On the Use of Spatial Time Frequency Distributions forSignal Extraction
Authors: Adel Belouchrani, Moeness G. Amin
Venue: Multidimensional Systems and Signal Processing (1998)

This paper deals with the extraction of signals from their instantaneous linear mixtures using time-frequency distributions. Fundamentally, this problem is a signal synthesis from the time-frequency (t-f) plane. However with the incorporation of the spatial information provided by a multisensor array, the problem can be posed as special case of blind source separation. So far, the blind source separation has been solved using only statistical information available on the source signals. Herein, we propose to solve the aforementioned problem using time-frequency signal representations and the spatial array aperture. The proposed approach relies on the difference in the t-f signatures of the sources to be separated. It is based on the diagonalization of a combined set of spatial time-frequency distribution matrices. A numerical example is provided to illustrate the effectiveness of our method.
Literate programming and the &ldquo;Spaniel&ldquo; method
Authors: Nick Hatzigeorgiu, Apostolos Syropoulos
Venue: ACM SIGPLAN Notices (1998)

Software has to be well structured and well documented in order to be reusable and maintainable. Literate programs have both properties. Unfortunately, even today many programmers write program without proper documentation. We propose a technique by which one can relatively easily transform a well structured program into a literate one. We exemplify the technique by means of an example and we conclude with the presentation of some related work and ideas.
Block solution of sparse linear systems over GF (q): the singular case
Authors: Gilles Villard
Venue: ACM SIGSAM Bulletin (1998)

Probabilistic algorithms based on the Krylov / Wiedemann or the Lanczos method to solve non homogeneous N x N systems Ax = b over a Galois field GF(q), usually require 2N matrix---vector products and O(n2+o(1)) additional arithmetic operations. Only the block Wiedemann algorithm, as given by Kaltofen in [6], has the least number (1+ epsilon;)N+O(1) of matrix---vector products of any known algorithm. We extend its analysis to the case of singular matrices A.
The Greedy Algorithm and Coxeter Matroids
Authors: A. Vince
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

The notion of matroid has been generalized to Coxeter matroid by Gelfand and Serganova. To each pair (W, P) consisting of a finite irreducible Coxeter group W and parabolic subgroup P is associated a collection of objects called Coxeter matroids. The (ordinary) matroids are a special case, the case W &equals; A (isomorphic to the symmetric group Sym_n+1) and P a maximal parabolic subgroup. The main result of this paper is that for Coxeter matroids, just as for ordinary matroids, the greedy algorithm provides a solution to a naturally associated combinatorial optimization problem. Indeed, in many important cases, Coxeter matroids are characterized by this property. This result generalizes the classical Rado-Edmonds and Gale theorems.A corollary of our theorem is that, for Coxeter matroids L, the greedy algorithm solves the L-assignment problem. Let W be a finite group acting as linear transformations on a Euclidean space {\bb E}, and let<?TeX=" f_{\xi,\eta}(w) = \langle w\xi,\eta\rangle\quad \hbox{for}\ \xi,\eta\in {\bb {E}}, w\in W."> The L-assignment problem is to minimize the function f_{\xi, \eta} on a given subset L &sube; W.An important tool in proving the greedy result is a bijection between the set W/P of left cosets and a &ldquo;concrete&rdquo; collection A of tuples of subsets of a certain partially ordered set. If a pair of elements of W are related in the Bruhat order, then the corresponding elements of A are related in the Gale (greedy) order. Indeed, in many important cases, the Bruhat order on W is isomorphic to the Gale order on A. This bijection has an important implication for Coxeter matroids. It provides bases and independent sets for a Coxeter matroid, these notions not being inherent in the definition.
Farming the Web for systematic business intelligence (Invited talk. Abstract only)
Authors: Richard Hackathorn
Venue: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (1999)

The technologies of data warehousing, data mining, hypertext analysis, information visualization, and web information resources are rapidly converging. The challenge is to architect these technologies into a system for systematic business intelligence for a corporation. We need to move from an information refining process that is often haphazard and narrow to one that is reliable and continuous. Web farming is a new area that suggests a methodology and architecture for accomplishing this.
An Algorithm-Hardware-System Approach to VLIW Multimedia Processors
Authors: Mladen Berekovic, Peter Pirsch, Johannes Kneip
Venue: Journal of VLSI Signal Processing Systems (1998)

Very Long Instruction Word (VLIW) processor architectures for multimedia applications are discussed from an algorithm, hardware and system based point of view. VLIW processors show high flexibility and processing power, as well as a good utilization of resources by compiler-generated code, but their exclusive exploitation of instruction level parallelism (ILP) decreases in efficiency as the degree of parallelism increases. This is mainly caused by characteristics of multimedia algorithms, increasing wiring delays, compiler restrictions, and a widening gap between on-chip processing speed and available bandwidth to external memory. As new multimedia applications and standards continue to evolve (MPEG-4), the demand for higher processing power will continue. Therefore, parallel processing in all its available forms will have to be exploited to achieve significant performance improvements. We show that, due to the diminishing returns from a further increase in ILP, multimedia applications will benefit more from an additional exploitation of parallelism at thread-level. We examine how simultaneous multithreading (SMT), a novel architectural approach combining VLIW techniques with parallel processing of threads, can efficiently be used to further increase performance of typical multimedia workloads.
Extension of the Herglotz Algorithm to Nonautonomous Canonical Transformations
Authors: J. C. Orum, R. T. Hudspeth, W. Black, R. B. Guenther
Venue: SIAM Review (2000)

The Herglotz algorithm for constructing autonomous canonical transformations that was presented by Guenther, Gottsch, and Kramer in [SIAM Rev., 38 (1996), pp. 287--293] is extended to include nonautonomous canonical transformations and a remainder function ${\cal R}^*$ that is related to a generating function by ${\cal R}^* = \partial F/\partial t$.
On Redundant Path Delay Faults in Synchronous Sequential Circuits
Authors: Ramesh C. Tekumalla, Premachandran R. Menon
Venue: IEEE Transactions on Computers (2000)

A path delay fault in a sequential circuit will affect circuit timing only if it can be activated during normal operation of the circuit. Since vector pairs that can be applied to the next-state logic of a nonscan sequential circuit are restricted by the available state transitions, some faults may be impossible to activate. Such faults are redundant and need not be tested. In this paper, we present a method of identifying redundant path delay faults in the next-state logic implemented in a two-level sum of products form and extend it to multilevel realizations. Experimental results on MCNC '91 benchmarks show that large fractions of faults in most of the MCNC '91 benchmarks are redundant.
Professional chapters annual report
Authors: Scott Lang, Collen Cleary
Venue: ACM SIGGRAPH Computer Graphics (1998)

Every year, each Director on the SIGGRAPH Executive Committee compiles an annual report for the annual SIGGRAPH organization report. To keep the overall report from becoming a book, the SIGGRAPH Chair must pick highlights from each area. This issue's Computer Graphics column contains my full annual report as presented to the SIGGRAPH Executive Committee. I hope that it helps to give you a better understanding of the structure of the Professional Chapters Committee, the events we sponsor at the annual conference and what the chapters do over the course of a typical year. Please keep in mind that this report is for the 1997-98 year so some information dates back to SIGGRAPH 97. As always, if you have any questions or comments, you can email me at lang@siggraph.org.
Remark on Algorithm 702&mdash;the updated truncated Newton minimization package
Authors: Dexuan Xie, Tamar Schlick
Venue: ACM Transactions on Mathematical Software (TOMS) (1999)

A truncated Newton minimization package, TNPACK, was described in ACM Transactions on Mathematical Software 14, 1 (Mar. 1992), pp.46&ndash;111. Modifications to enhance performance, especially for large-scale minimization of molecular potential functions, are described here. They involve three program segments of TNPACK: negative curvature test, modified Cholesky factorization, and line-search stopping rule.
Stability of Moving Mesh Systems of Partial Differential Equations
Authors: Shengtai Li, Linda Petzold, Yuhe Ren
Venue: SIAM Journal on Scientific Computing (1998)

Moving mesh methods based on the equidistribution principle (EP) are studied from the viewpoint of stability of the moving mesh system of differential equations. For fine spatial grids, the moving mesh system inherits the stability of the original discretized partial differential equation (PDE). Unfortunately, for some PDEs the moving mesh methods require so many spatial grid points that they no longer appear to be practical. Failures and successes of the moving mesh method applied to three reaction-diffusion problems are explained via an analysis of the stability and accuracy of the moving mesh PDE.
Nonoscillatory Central Schemes for Multidimensional Hyperbolic Conservation Laws
Authors: Guang-Shan Jiang, Eitan Tadmor
Venue: SIAM Journal on Scientific Computing (1998)

We construct, analyze, and implement a new nonoscillatory high-resolution scheme for two-dimensional hyperbolic conservation laws. The scheme is a predictor-corrector method which consists of two steps: starting with given cell averages, we first predict pointvalues which are based on nonoscillatory piecewise-linear reconstructions from the given cell averages; at the second corrector step, we use staggered averaging, together with the predicted midvalues, to realize the evolution of these averages. This results in a second-order, nonoscillatory central scheme, a natural extension of the one-dimensional second-order central scheme of Nessyahu and Tadmor [J. Comput. Phys., 87 (1990), pp. 408--448].As in the one-dimensional case, the main feature of our two-dimensional scheme is simplicity. In particular, this central scheme does not require the intricate and time-consuming (approximate) Riemann solvers which are essential for the high-resolution upwind schemes; in fact, even the computation of the exact Jacobians can be avoided. Moreover, the central scheme is "genuinely multidimensional" in the sense that it does not necessitate dimensional splitting.We prove that the scheme satisfies the scalar maximum principle, and in the more general context of systems, our proof indicates that the scheme is positive (in the sense of Lax and Liu [CFD Journal, 5 (1996), pp. 1--24]). We demonstrate the application of our central scheme to several prototype two-dimensional Euler problems. Our numerical experiments include the resolution of shocks oblique to the computational grid; they show how our central scheme solves with high resolution the intricate wave interactions in the so-called double Mach reflection problem [J. Comput. Phys., 54 (1988), pp. 115--173] without following the characteristics; and finally we report on the accurate ray solutions of a weakly hyperbolic system [J. Comput. Appl. Math., 74 (1996), pp. 175--192], rays which otherwise are missed by the dimensional splitting approach. Thus, a considerable amount of simplicity and robustness is gained while achieving stability and high resolution.
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
Authors: Xin He, Ming-Yang Kao, Hsueh-I Lu
Venue: SIAM Journal on Discrete Mathematics (1999)

Let G be an embedded planar undirected graph that has n vertices, m edges, and f faces but has no self-loop or multiple edge. If G is triangulated, we can encode it using 4/3m-1 bits, improving on the best previous bound of about 1.53m bits. In case exponential time is acceptable, roughly 1.08m bits have been known to suffice. If G is triconnected, we use at most $(2.5+2\log{3})\min\{n,f\}-7$ bits, which is at most 2.835m bits and smaller than the best previous bound of 3m bits. Both of our schemes take O(n) time for encoding and decoding.
Use WWW resources for translation classes in Taiwan
Authors: Li-yi Huang
Venue: ACM SIGCUE Outlook (1998)

In the past, dictionaries, encyclopedia and other reference books were indispensable tools for people doing translation. And it has been very common for students in translation classes to be handed a long list of text books, all sorts of dictionaries, encyclopedia and other reference books. It is almost impossible for the students to spend a lot of money to buy them all. Besides, the heavy weight of those reference books, the shortage of space for them and the huge amount of time that the students have used to look up for new words in dictionaries or in other reference books have also been big problems for the students. And every now and then they might not be able to find the words in any dictionaries on the market. Problems like these make our students grumble when they do translation. Consequently, translation becomes less interesting.To make translation class full of fun and to make translation more feasible, we think that teachers should introduce the World Wide Web resources for translation to their students. In this paper, we will first introduce different kinds of translation resources on the Web which are very useful for teachers as well as students in Taiwan. We will compile a list of' these resources based on different subjects, such as on-line multi-lingual dictionaries, encyclopedia, jargons of legal, computer, medical, and business terms, rhetorics, corpora, machine translation, translation schools, conferences, workshops, references, and on-line translation services. We will evaluate some of them briefly.
Postural activity of constrained subject in response to disturbance in sagittal plane
Authors: M. Mihelj, Z. Matjačić, T. Bajd
Venue: Technology and Health Care (1999)

The study examines postural activity of a constrained subject in response to various disturbances in the sagittal plane. Three different initial standing postures were examined. Each response to a perturbation was divided into three consecutive phases according to the intensity of the muscular activity. The relation of the ankle joint torque versus the ankle joint angle was studied. A linear relationship, resulting in constant ankle stiffness, was observed in each phase of the response. Only negligible differences in the stiffness values were observed among different phases. The results indicate an ankle stiffness value of 10 N m/{}^\circ for the majority of initial stance postures and perturbation intensities.
A Nonrecursive Solution Method for the Linear-Quadratic Optimal ControlProblem with a Singular Transition Matrix
Authors: Jürgen Ehlgen
Venue: Computational Economics (1999)

In the optimal linear regulator problem the control vector is usually determined by solving the algebraic matrix Riccati equation using successive substitutions. This, however, can be rather inefficient from a computational point of view. A nonrecursive method which requires that the transition matrix is nonsingular has been proposed by Vaughan (1970). In the present paper we present a nonrecursive solution to the matrix Riccati equation for the case that the transition matrix may be singular. We show that this procedure leads to the same numerical results as the standard iteration of the matrix Riccati equation.
A low-voltage CMOS multiplier for RF applications (poster session)
Authors: Carl James Debono, Franco Maloberti, Joseph Micallef
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

A low-voltage analog multiplier operating at 1.2V is presented. The multiplier core consists of four MOS transistors operating in the saturation region. The circuit exploits the quadratic relation between current and voltage of the MOS transistor in saturation. The circuit was designed using standard 0.6&mgr;m CMOS technology. Simulation results indicate an IP3 of 4.9dBm and a spur free dynamic range of 45dB.
Efficient Wordlength Reduction Techniques for DSP Applications
Authors: Paul D. Fiore
Venue: Journal of VLSI Signal Processing Systems (2000)

Intermediate results in digital signal processing (DSP) hardware frequently must be truncated or rounded to maintain reasonable wordlengths. Noise and bias are introduced into the signal due to these operations. For the addition operation, we investigate two methods which have reduced variance and bias and yet maintain the computational simplicity of truncation. Essentially, each method drives the least significant carry input of the adder string with a very simple boolean function. We demonstrate the utility of these approaches by calculating bias and variance reductions, and by using the methods in several simple but important DSP examples.
A Locally Adaptive Multimode Photodetector Circuit
Authors: Amjad Khan, Anant Deval, L. A. Akers
Venue: Analog Integrated Circuits and Signal Processing (1999)

Photodetection circuits form the first stage of the artificial image acquisition process. The image acquisition circuits discussed in this paper pertain to circuits fabricated in a standard CMOS process. Such circuits offers advantages such as random access to a pixel, faster readout, integration of processing circuitry on the same die, low voltage and low power dissipation, and lower cost over the conventional Charge Coupled Device (CCD) process. We describe a new locally adaptive multimode photodetector circuit. The advantages of the circuit are local adaptation, wide dynamic range, excellent sensitivity, and large output voltage swing. The circuit was fabricated in the 2&mu; CMOS process through MOSIS. Simulation and experimental results of the circuit are given.