ppxscal/embedding_network huggingface dataset:
JRes: a resource accounting interface for Java
Authors: Grzegorz Czajkowski, Thorsten von Eicken
Venue: ACM SIGPLAN Notices (1998)

With the spread of the Internet the computing model on server systems is undergoing several important changes. Recent research ideas concerning dynamic operating system extensibility are finding their way into the commercial domain, resulting in designs of extensible databases and Web servers. In addition, both ordinary users and service providers must deal with untrusted downloadable executable code of unknown origin and intentions.Across the board, Java has emerged as the language of choice for Internet-oriented software. We argue that, in order to realize its full potential in applications dealing with untrusted code, Java needs a flexible resource accounting interface. The design and prototype implementation of such an interface --- JRes --- is presented in this paper. The interface allows to account for heap memory, CPU time, and network resources consumed by individual threads or groups of threads. JRes allows limits to be set on resources available to threads and it can invoke callbacks when these limits are exceeded. The JRes prototype described in this paper is implemented on top of standard Java virtual machines and requires only a small amount of native code.
Parametric Feature Detection
Authors: Simon Baker, Shree K. Nayar, Hiroshi Murase
Venue: International Journal of Computer Vision (1998)

Most visual features are parametric in nature, including, edges, lines, corners, and junctions. We propose an algorithm to automatically construct detectors for arbitrary parametric features. To maximize robustness we use realistic multi-parameter feature models and incorporate optical and sensing effects. Each feature is represented as a densely sampled parametric manifold in a low dimensional subspace of a Hilbert space. During detection, the vector of intensity values in a window about each pixel in the image is projected into the subspace. If the projection lies sufficiently close to the feature manifold, the feature is detected and the location of the closest manifold point yields the feature parameters. The concepts of parameter reduction by normalization, dimension reduction, pattern rejection, and heuristic search are all employed to achieve the required efficiency. Detectors have been constructed for five features, namely, step edge (five parameters), roof edge (five parameters), line (six parameters), corner (five parameters), and circular disc (six parameters). The results of detailed experiments are presented which demonstrate the robustness of feature detection and the accuracy of parameter estimation.
Simulating Lyme disease using parallel discrete event simulation
Authors: Ewa Deelman, Boleslaw K. Szymanski, Thomas Caraco
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Lyme Disease affects many people in the northeastern United States. One of the most important mech anisms that sustains the epidemic is the interaction between white-footed mice (Peromyscus leuco pus) and deer ticks (Ixodes scapularis). When mice move around in their territory they carry diseased ticks to new locations. Our system simulates the different developmental stages of the tick through its active spring/summer period. The system uses the optimistic protocol for Parallel Discrete Event Simulation. In this paper, we present the model of the spread of the disease. We describe how we parallelize the problem, and we sketch a new global virtual time algorithm used in our system. We present performance benefits resulting from a parallel platform.
Compiler techniques for data partitioning of sequentially iterated parallel loops
Authors: David E. Hudak, Santosh G. Abraham
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

This paper uses bottom-up, static program partitioning to minimize the execution time of parallel programs by reducing interprocessor communication. Program partitioning is applied to a parallel programming construct known as a sequentially iterated parallel loop. This paper develops and evaluates compiler techniques to automatically generate data partitions for sequentially iterated parallel loops that minimize interprocessor communication. These techniques could be included as a communication-reducing back end for existing parallelizing compilers. A multiprocessor model is defined to analyze program execution factors that lead to interprocessor communication. A model for the sequentially iterated parallel loop is defined to quantify communication patterns within a program. A vector notation is chosen to quantify communication across a global data set. Communication parameters used in generating data partitions are found and used within equations which are shown to generate rectangular and hexagonal partition shapes that minimize interprocessor communication. Experiments measuring the impact of communication on program performance and the improvements gained by using the automatically generated data partitions were conducted on a sixteen-processor Encore Multimax. The new method outperformed established data partitioning methods.
A diagnostic system based on a multi-decision approximate rules model
Authors: Ray R. Hashemi, Fred Choobineh, John Talburt, William Slikker, Merle G. Paule
Venue: ACM SIGBIO Newsletter (1997)

Modified Rough Sets (MRS)-based diagnostic systems eliminated many of the limitations of Rough Sets (RS)-based, statistical-based, and decision tree-based systems and because of that, they have a better performance. In contrast with the other systems, MRS-based diagnostic systems have potential to handle Multi-Decision Approximate (MDA) rules. In this paper, we (1) develop a diagnostic model based on MDA rules and (2) evaluate the classification power of the model.
Fitting Johnson distributions using least squares: simulation applications
Authors: James J. Swain, James R. Wilson
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A weighted least squares regression method is proposed for fitting cumulative probability distributions to data. This technique is illustrated for the Johnson translation system of distributions. The least squares procedure minimizes the distance between the vector of uniformized order statistics and its corresponding expected value to identify the Johnson distribution that provides the best fit. This least squares procedure is shown to be numerically robust and to provide a good fit of the data when compared to the empirical distribution. Two examples illustrate the use of the procedure.
Hardware Support for Flexible Distributed Shared Memory
Authors: Steven K. Reinhardt, Robert W. Pfile, David A. Wood
Venue: IEEE Transactions on Computers (1998)

Workstation-based parallel systems are attractive due to their low cost and competitive uniprocessor performance. However, supporting a cache-coherent global address space on these systems involves significant overheads. We examine two approaches to coping with these overheads. First, DSM-specific hardware can be added to the off-the-shelf component base to reduce overheads. Second, application-specific coherence protocols can avoid some overheads by exploiting programmer (or compiler) knowledge of an application's communication patterns. To explore the interaction between these approaches, we simulated four designs that add DSM acceleration hardware to a collection of off-the-shelf workstation nodes. Three of the designs support user-level software coherence protocols, enabling application-specific protocol optimizations. To verify the feasibility of our hardware approach, we constructed a prototype of the simplest design. Measured speedups from the prototype match simulation results closely. We find that, even with aggressive DSM hardware support, custom protocols can provide significant speedups for some applications. In addition, the custom protocols are generally effective at reducing the impact of other overheads, including those due to less aggressive hardware support and larger network latencies. However, for three of our benchmarks, the additional hardware acceleration provided by our most aggressive design avoids the need to develop more efficient custom protocols.
Modeling with event graphs
Authors: Arnold H. Buss
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Event Graphs are a way of graphically representing discrete-event simulation models. Also known as "Simulation Graphs," they have a minimalist design, with a single type of node and two types of edges with up to three options. Despite this simplicity, Event Graphs are extremely powerful. The Event Graph is the only graphical paradigm that directly models the event list logic. There are no limitations to the ability of Event Graphs to create a simulation model for any circumstance. Their simplicity, together with their extensibility, make them an ideal tool for rapid construction and prototyping of simulation models. In this paper we will demonstrate the ability of Event Graphs to leverage simple models into more complex ones with very few additional features.
Toward formalizing structured analysis
Authors: Luciano Baresi, Mauro Pezzè
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1998)

Real-time extensions to structured analysis (SA/RT) are popular in industrial practice. Despite the large industrial experience and the attempts to formalize the various &ldquo;dialects,&rdquo; SA/RT notations are still imprecise and ambiguous. This article tries to identify the semantic problems of the requirements definition notation defined by Hatley and Pirbhai, one of the popular SA/RT &ldquo;dialects,&rdquo; and discusses possible solutions. As opposed to other articles that give their own interpretation, this article does not propose a specific semantics for the notation. This article identifies imprecisions, i.e., missing or partial information about features of the notation; it discusses ambiguities, i.e., elements of the definition that allow at least two different (&ldquo;reasonable&rdquo;) interpretations of features of the notation; and it lists extensions, i.e., features not belonging to the notation, but required by many industrial users and often supported by CASE tools. This article contributes by clarifying whether specific interpretations can be given unique semantics or retain ambiguities of the original definition. The article allows for the evaluation of formal definitions by indicating alternatives and consequences of the specific choices.
A standardized parameter for the distribution of individual red blood cell deformability with the cell transit analyzer
Authors: K. M. Amoussou-Guénou, B. Squitiero, M. Voutay, B. Labat, Ph. Rusch
Venue: Technology and Health Care (1997)

The purpose of this study was to identify a parameter allowing the standardization of the Cell Transit Analyzer (CTA) in order to study the individual deformability of each explored Red Blood Cell (RBC). Using theoretical arguments based on the principle of the CTA, we calculated the thickness "x" of the crown of fluid surrounding each RBC during its entry phase into the micropore. A mathematical equation (x = 62.5/\vert U\vert) was established between the difference of potential (U, mV) that occurs during this phase and the corresponding thickness (x, \mum) of the crown. By exploring fresh control RBCs of healthy subjects and assuming that the rigid RBCs proportion in a fresh blood sample of healthy subject is less than 3.5%, we performed a thresholding of x to distinguish rigid RBC from deformable ones. That thresholding was necessary to stamp the variability of counts linked to polycarbonate filters (PF) used to carry out measures. According to the PF, the value of the threshold T_{x} provided by the thresholding ranged between 0.222 and 0.246 \mum. Using the values of T_{x}, we counted approximately 10-25% rigid RBCs in the pathological samples of four patients with sickle cells SS disease and of one diabetic patient with splenomegaly. We observed in addition that the percentages of rigid RBCs counted after thresholding are identical from a filter to another one with an absolute error less than 2% in fresh RBCs (normal or pathological) samples. We concluded that the method of standardization by thresholding presented here could be used in clinic routine to count the rigid RBCs percentage contained in a given sample.
Scalable S-To-P Broadcasting on Message-Passing MPPs
Authors: Susanne E. Hambrusch, Ashfaq A. Khokhar
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

In s-to-p broadcasting, s processors in a p-processor machine contain a message to be broadcast to all the processors, 1 ¿s¿p. We present a number of different broadcasting algorithms that handle all ranges of s. We show how the performance of each algorithm is influenced by the distribution of the s source processors and by the relationships between the distribution and the characteristics of the interconnection network. For the Intel Paragon we show that for each algorithm and machine dimension there exist ideal distributions and distributions on which the performance degrades. For the Cray T3D we also demonstrate dependencies between distributions and machine sizes. To reduce the dependence of the performance on the distribution of sources, we propose a repositioning approach. In this approach, the initial distribution is turned into an ideal distribution of the target broadcasting algorithm. We report experimental results for the Intel Paragon and Cray T3D and discuss scalability and performance.
Parallel programming using public domain software
Authors: Helmar Burkhart
Venue: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education (1997)

This paper reports on experiences of using public domain software for teaching parallel programming. We describe the three packages used, namely superpascal, pvm, and alwan and assess their specific strengths and weaknesses. We describe our course activities to teach parallel programming and summarize our experiences made.
The Accumulation of Rounding Errors and Port Validation for Global Atmospheric Models
Authors: James M. Rosinski, David L. Williamson
Venue: SIAM Journal on Scientific Computing (1997)

The growth of machine rounding-sized initial errors in the NCAR Community Climate Model (CCM2) is studied. Growth is faster than predictability error growth that results from turbulent flow. Rounding accumulation dominates the growth when temperature differences are below the order of 10-3 K. Discontinuous code branches are not a source of growth when the differences are less than 10-3 K. Arguments are presented to explain this observation. The fast growth of differences is caused by the physical parameterizations, as they respond to the evolving states produced by the dynamical flow. Based on a careful examination of this growth of small differences, a validation strategy for codes ported to new computing environments is offered and illustrated.
A FPGA-based implementation of a fault-tolerant neural architecture for photon identification
Authors: M. Alderighi, E. L. Gummati, V. Piuri, G. R. Sechi
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

Event identification in photon counting ICCD detectors requires a high level image analysis which cannot be easily described algorithmically: neural networks are promising to approach this application. A system capable of identifying these events on board of satellites needs fault tolerant capabilities to certify result correctness. The rapid evolution of the problem specification, due to the increasing knowledge about the physics, makes attractive the availability and modifiability of prototypes: FPGA-based design is effective to realize these systems. The paper presents therefore an FPGA-based implementation of a fault tolerant neural architecture for event identification.
MODSIM III&mdash;a tutorial
Authors: Alasdar Mullarney
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This tutorial introduces the MODSIM III language, showing how its simulation "world view" together with its object-oriented architecture and built in graphics contribute to successful simulation model building. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Interaction of Capacitive and Resistive Nonlinearitiesin Chua&lsquo;s Circuit
Authors: Ali Oksasoglu, Lawrence P. Huelsman
Venue: Analog Integrated Circuits and Signal Processing (1997)

The interaction of capacitive and resistive nonlinearities in the Chua&lsquo;s circuit is studied. The original Chua&lsquo;s circuit is modified by replacing one of the linear capacitors with a nonlinear one to investigate the effects of such an interaction on the chaotic behavior of the circuit. It is found that such an interaction can be effective in limiting and controlling chaos. The Pspice simulation results are also given and compared with our numerical solutions.
Verifying parameterized networks
Authors: E. M. Clarke, O. Grumberg, S. Jha
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1997)

This article describes a technique based on network grammars and abstraction to verify families of state-transition systems. The family of state-transition systems is represented by a context-free network grammar. Using the structure of the network grammar our technique constructs a process invariant that simulates all the state-transition systems in the family. A novel idea introduced in this article is the use of regular languages to express state properties. We have implemented our techniques and verified two nontrivial examples.
Using a lookahead window in a compaction-based parallelizing compiler
Authors: Toshio Nakatani, Kemal Ebcioğlu
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

Lookahead is a common technique for high performance uniprocessor design. In general, however, hardware lookahead window is too small to exploit instruction-level parallelism at run time, while compaction-based parallelizing compilers must suffer from worst-case exponential code explosion at compile time. In this paper, we propose a software lookahead method, which allows inter-basic block code motions within the prespecified number of operations, called software lookahead window, on any path emanating from the currently processed instruction at compile time. By software lookahead, instruction-level parallelism can be exploited in a much greater code area than the hardware approach, but the lookahead region is still limited to a constant depth with a user-specifiable window, and thus code explosion is restricted. The proposed scheme has been implemented in our prototype parallelizing compiler, which can generate code for uniprocessors with multiple functional units and multiway conditional branches, such as VLIW machines, and potentially for superscalars as well. To study code explosion problem and instruction-level parallelism for branch intensive code, we compiled five AIX utilities: sort, fgrep, sed, yacc, and compress. It is demonstrated that, with software lookahead, code explosion problem is effectively alleviated, yet a substantial amount of inter-basic block parallelism is successfully extracted.
Exact required time analysis via false path detection
Authors: Yuji Kukimoto, Robert K. Brayton
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

This paper addresses how to compute required times at intermediatenodes in a combinational network given required times atprimary outputs. The simplest approach is to compute them basedon topological delay analysis without any consideration of falsepaths. In this paper, however, we take into account false pathsbetween the intermediate nodes and the primary outputs explicitlyto characterize the timing constraints at the nodes more accurately.We show that this approach leads to a technique for computing amore refined and relaxed timing constraint than that obtained bytopological analysis. We generalize the notion of required timesfrom a single constant to a relation where a signal is required atdifferent times depending on the values of the other signals.
Specification and Implementation of the Universal TimeCoordinated Synchronization Unit (UTCSU)
Authors: Klaus Schossmaier, Ulrich Schmid, Martin Horauer, Dietmar Loy
Venue: Real-Time Systems (1997)

High-accuracy external clock synchronization can only be achieved with adequate hardware support. We analyze the requirements and present the specification and implementation of an ASIC running under the acronym UTCSU dedicated to that purpose. It is built around an elaborated local clock, which is based on an adder driven by a fixed-frequency oscillator. This novel clock design allows a fine grained rate adjustability apt for maintaining both local time with linear continuous amortization and accuracy information as needed in interval-based clock synchronization. Additional features incorporated in our UTCSU are facilities to timestamp clock synchronization data packets, interfaces to couple GPS receivers, some application support as well as sophisticated self-test machinery. Apart from addressing design and engineering issues of the chip, we also provide a basic programming model.
Cubature Rules of Prescribed Merit
Authors: J. N. Lyness, I. H. Sloan
Venue: SIAM Journal on Numerical Analysis (1997)

We introduce a criterion for the evaluation of multidimensional quadrature, or cubature, rules for the hypercube: this is the $merit$ of a rule which is closely related to its trigonometric degree and which reduces to the Zaremba figure of merit in the case of a lattice rule. We derive a family of rules $Q_k^s$ having dimension $s$ and merit $2^k$. These rules seem to be competitive with lattice rules with respect to the merit that can be achieved with a given number of abscissas.
Modeling and simulating time series input processes with ARTAFACTS and ARTAGEN
Authors: Marne C. Cario
Venue: Proceedings of the 28th conference on Winter simulation (1996)

We develop an efficient numerical method for fitting ARTA processes for use as simulation input. ARTA processes are stationary time series with arbitrary marginal distributions and autocorrelations specified through finite lag p. We discuss the software package ARTAFACTS, which implements the numerical method, and the package ARTAGEN, which generates observations from ARTA processes. To demonstrate the use of the software, we present a real-world example.
Static header as sentinel
Authors: Massimo Ancona, Walter Cazzola
Venue: ACM SIGPLAN Notices (1998)

Writing code to handle dynamic data structures might seem to be an easy task, but write an efficient, readable and maintainable code is not such a simple task.In this short note we investigate some problems in developing code for handling dynamic data structures, and we propose techniques to overcome them. We take into account the interesting method proposed by Qiu in SIGPLAN Notices [3].Many authors have addressed the problem of handling dynamic data structures by suggesting several clever tricks to simplify dynamic data structures management [4, 2] and to avoid the non-uniform behavior of empty data structures, and access to the first and the last element. In particular, the use of data sentinels and dummy headers makes the implementation more orthogonal and easy to maintain. The cost is a slightly increased size in space which is negligible when compared with the benefits produced.