ppxscal/embedding_network huggingface dataset:
Parallel Programming with Polaris
Authors: William Blume, Ramon Doallo, Rudolf Eigenmann, John Grout, Jay Hoeflinger, Thomas Lawrence, Jaejin Lee, David Padua, Yunheung Paek, Bill Pottenger, Lawrence Rauchwerger, Peng Tu
Venue: Computer (1996)

As we reach the technological limits of hardware improvement, we must rely on multiple processors to improve programming speed. Parallel programming tools are limited, making effective parallel programming difficult and cumbersome. Compilers that translate conventional sequential programs into parallel form would liberate programmers from the complexities of explicit, machine-oriented parallel programming. Polaris, an experimental translator of conventional Fortran programs that target machines such as the Cray T3D, is the first step toward this goal. The most important techniques implemented in Polaris resulted from a study of the effectiveness of commercial Fortran parallelizers. The authors compiled the Perfect Benchmarks, a collection of conventional Fortran programs representing the typical workload of high-performance computers, for the Alliant FX/80, an eight-processor multiprocessor popular in the late 1980s. For each program, they measured the quality of the parallelization by computing the speedup. With few exceptions, the Alliant Fortran compiler failed to deliver any significant speedup for the majority of the programs. The compiler failed to produce a speedup because it could not parallelize some of the most important loops in the Perfect Benchmarks. The study showed that extending the four most important analysis and transformation techniques traditionally used for vectorization leads to significant increases in speedup. Polaris detected much of the parallelism available in the set of benchmark codes. A careful analysis of the remaining loops that Polaris could parallelize highlights four areas for improvement.
The Synthetic BattleBridge: A Tool for Large-Scale VEs
Authors: Martin R. Stytz, Elizabeth G. Block, Brian B. Soltz, Kirk Wilson
Venue: IEEE Computer Graphics and Applications (1996)

Distributed interactive simulation enables the instantiation of large-scale distributed virtual environments populated by intelligent, autonomous forces and manned simulators. As a result, the user has a more accurate experience of the diversity, complexity, and uncertainty of the analogous real-world environment. However, to maximize understanding of the virtual environment, the user needs tools dedicated to visualizing, understanding, and analyzing the environment. As a result, instead of simply portraying the distributed virtual environment, we enhance the information content and the user's experience by providing tools to help with navigation, analysis, comprehension, visualization, and situation awareness tasks in the environment. This article describes an implementation of these tools and their use within a distributed virtual environment.
Perl: Not Just for Web Programming
Authors: Mark-Jason Dominus
Venue: IEEE Software (1998)

Perl was invented by Larry Wall about 10 years ago. Wall, a computer programmer and linguist, combined his dual interests in Perl's design: He used his programming skills to create a language that was good at telling the computer what to do and his knowledge of linguistics to make that language easy to learn and use. Perl is sometimes perceived as a language limited to Web programming. However, as the box "Perl at Work" on the following page shows, Perl is a general-purpose programming language with many strengths-the biggest being in the area of string and data processing. Since most programs process strings or data or both, Perl works well for most programming, including system programming. It gives you access to C library functions for fine-grained control of files, processes, and network sockets, while at the same time handling the onerous details of low-level memory management and offering powerful built-in data structures. Perl also has advantages over other languages. It is much faster to write in than C, which makes it good for rapid prototyping. Perl can replace Unix shell scripting languages on Unix systems when you need to write a program quickly to do a small task. And it's faster than most other scripting languages because it's compiled in-stead of interpreted.
Extracting a Valid Boundary Representation from a Segmented Range Image
Authors: Adam Hoover, Dmitry Goldgof, Kevin W. Bowyer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

A new approach is presented for extracting an explicit 3-D shape model from a single range image. One novel aspect is that the model represents both observed object surfaces, and surfaces which bound the volume of occluded space. Another novel aspect is that the approach does not require that the range image segmentation be perfect. The low-level segmentation may be such that the model-building process encounters topology versus geometry conflicts. The model-building process is designed to be ¿fail soft¿ in the face of such problems. The portion of the 3-D model where a problem presents itself is ¿glued¿ together in a manner meant to minimize the disturbance in the 3-D shape. The goal is to produce a valid boundary-representation which can be processed by higher-level routines. A third novel aspect of this work is that the implementation has been evaluated on over 200 real range images of polyhedral objects, with no operator intervention and all parameters held constant, and obtained a 97% success rate in creating valid b-reps.
A Review of Macsyma
Authors: R. J. Fateman
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The successes and failures of the Macsyma algebraic manipulation system are reviewed from the point of view of one of the original contributors. A retrospective examination is provided of some of the controversial ideas that worked, and some that did not. Input/output, language semantics, knowledge-adjunction, mathematical semantics, the model of the user, and other issues are considered. Possible future directions for algebraic manipulation system building are discussed.
On the Dependence of Handwritten Word Recognizers on Lexicons
Authors: Hanhong Xue, Venu Govindaraju
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

The performance of any word recognizer depends on the lexicon presented. Usually, large lexicons or lexicons containing similar entries pose difficulty for recognizers. However, the literature lacks any quantitative methodology of capturing the precise dependence between word recognizers and lexicons. This paper presents a performance model that views word recognition as a function of character recognition and statistically "discovers" the relation between a word recognizer and the lexicon. It uses model parameters that capture a recognizer's ability of distinguishing characters (of the alphabet) and its sensitivity to lexicon size. These parameters are determined by a multiple regression model which is derived from the performance model. Such a model is very useful in comparing word recognizers by predicting their performance based on the lexicon presented. We demonstrate the performance model with extensive experiments on five different word recognizers, thousands of images, and tens of lexicons. The results show that the model is a good fit not only on the training data but also in predicting the recognizers' performance on testing data.
Support Vector Machines for Texture Classification
Authors: Kwang In Kim, Keechul Jung, Se Hyun Park, Hang Joon Kim
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper investigates the application of support vector machines (SVMs) in texture classification. Instead of relying on an external feature extractor, the SVM receives the gray-level values of the raw pixels, as SVMs can generalize well even in high-dimensional spaces. Furthermore, it is shown that SVMs can incorporate conventional texture feature extraction methods within their own architecture, while also providing solutions to problems inherent in these methods. One-against-others decomposition is adopted to apply binary SVMs to multitexture classification, plus a neural network is used as an arbitrator to make final classifications from several one-against-others SVM outputs. Experimental results demonstrate the effectiveness of SVMs in texture classification.
On data transformations and evidence of nonlinearity
Authors: Philip Hans Franses, Paul de Bruin
Venue: Computational Statistics Data Analysis (2002)

In this paper, we examine the interaction between data transformation and the empirical evidence obtained when testing for (non-)linearity. For this purpose we examine nonlinear features in 64 monthly and 53 quarterly US macroeconomic variables for a range of Box-Cox data transformations. Our general finding is that evidence of nonlinearity is not independent of the data transformation. Results of simulation experiments substantiate this finding.
Displays for Electronic Imaging
Authors: Paul M. Alt
Venue: IEEE Micro (1998)

Is there anyone in modern societies who has not interacted with electronic displays? There may be a few, but the extent to which we live in a data driven world is extreme and having rapid access to that data is central to it being useful to us. Electronic displays provide that access for a wide variety of data types including entertainment media (television, movies, games...). Electronic display function ranges from elementary monochrome displays for clocks, gas pumps and radios to large, high-information-content displays showing full-color high definition television in electronic cinemas. The electronic display with the largest installed base today is probably the consumer television (TV) display. Its popularity extends even to third-world communities and derives primarily from the entertainment it delivers. Consider photographs as a paper analog of the television display. They are analogous in the sense that photographs and TVs present color images, each having emerged from monochrome beginnings, both are used primarily for entertainment, both have a long history and worldwide appeal, and both have significant markets. Of course, one cannot flip through photographs as quickly as does a TV display, but then photographs have the appeal that any one can be easily be viewed again for full enjoyment. There is another commonality in this strained analogy. Photography and television are both undergoing rapid changes in how they deliver their information to the masses and the technology for viewing these dynamic and static images is converging. This paper explores some of the recent developments in electronic displays pointing out their relationships to modern photography, i.e., digital photography and digital imaging. A full review of all electronic display types is not given here since some displays will see limited use in digital imaging and the full list of displays is long. Instead, electronic displays which have the capability of high information content, high spatial resolution and general suitability to digital photography are featured.
CoSi2 formation from Cox Ni1-x/Ti system
Authors: O. Chamirian, A. Lauwers, C. Demeurisse, H. Guérault, A. Vantomme, K. Maex
Venue: Microelectronic Engineering (2002)

The presence of Ni can significantly promote the CoSi-CoSi2 transformation process reducing the transformation temperature and, in consequence, the thermal budget of silicidation. In this work, silicidation of the Si/Co0.95Ni0.05/Ti system was investigated. Four point probe (4PP), Auger electron spectroscopy (AES), X-ray diffraction (XRD), Rutherford backscattering spectroscopy (RBS), and transmission electron microscopy (TEM) were used to characterise the silicide films. It was found that Co-Ni silicide can be formed at lower temperatures compared to the pure Co/Ti process, at the same time keeping important properties such as sheet resistance and roughness close to those of pure CoSi2.
Kleitman and combinatorics
Authors: Michael Saks
Venue: Discrete Mathematics (2002)

Daniel Kleitman's many research contributions are surveyed, with emphasis on extremal hypergraph theory, asymptotic enumeration, and discrete geometry.
Exploiting Macrodiversity with Distributed Antennas in Micro-Cellular CDMA Systems
Authors: Elyes B. Bdira, Paul Mermelstein
Venue: Wireless Personal Communications: An International Journal (1999)

We consider the use of distributed antennas to increase the capacity and peak data rate achievable in a microcellular CDMA system with limited bandwidth. In additon to the diversity against Rayleigh fading achievable by use of microdiversity among nearly co-located transmit or receive antennas, we exploit macrodiversity against shadow fading that more widely separated antennas permit. We report on antenna configurations for both directional and omni-directional antennas that provide the most uniform signal-to-interference ratio coverage, averaged over a large number of position vectors drawn from a spatially uniform distribution of mobiles. Call capacities and peak transmission rates are determined for an integrated system carrying traffic at different constant rates, where processing gain and the transmission rate are selected to satisfy a common chip rate. For the downlink a 5.5 dB capacity gain can be achieved for 64 kb/s calls using four antennas located on the diagonals of each square cell. A bandwidth of 5 MHz allows two or more calls to be simultaneously supported at data rates up to 512 kb/s, as opposed to only 128 kb/s for three co-located antennas. On the uplink we distinguish between the computationally simpler equal-gain combining of the antenna signals and the possibly more complex maximum-ratio combining. With equal gain combining we achieve a peak data rate of 128 kb/s and a capacity gain of 2.5 dB relative to equal gain combining of three nearly co-located antenna signals. With maximum ratio combining the peak uplink rate can be as high as 512 kb/s and the capacity is increased by 2.0 dB relative to the maximum-ratio combining of three co-located antennas.
Provably good global buffering using an available buffer block plan
Authors: Feodor F. Dragan, Andrew B. Kahng, Ion Măndoiu, Sudhakar Muddu, Alexander Zelikovsky
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and block-based ASIC/SOC methodologies. Recent works by Cong et al. [6] and Tang and Wong [25] give algorithms to solve the buffer block planning problem. In this paper we address the problem of how to perform buffering of global nets given an existing buffer block plan. Assuming as in [6, 25] that global nets have been already decomposed into two-pin connections, we give a provably good algorithm based on a recent approach of Garg and K&ouml;nemann [8] and Fleischer [7]. Our method routes connections using available buffer blocks, such that required upper and lower bounds on buffer intervals -- as well as wirelength upper bounds per connection -- are satisfied. Unlike [6, 25], our model allows more than one buffer to be inserted into any given connection. In addition, our algorithm observes buffer parity constraints, i.e., it will choose to use an inverter or a buffer (= co-located pair of inverters) according to source and destination signal parity. The algorithm outperforms previous approaches [6] and has been validated on top-level layouts extracted from a recent high-end microprocessor design.
The shared frailty model and the power for heterogeneity tests in multicenter trials
Authors: Luc Duchateau, Paul Janssen, Patrick Lindsey, Catherine Legrand, Rosemary Nguti, Richard Sylvester
Venue: Computational Statistics Data Analysis (2002)

Heterogeneity between centers in multicenter trials with time to event outcome can be modeled by the frailty proportional hazards model. The majority of the different approaches that have been used to fit frailty models assume either the gamma or the lognormal frailty density and are based on similar log likelihood expressions. These approaches are briefly reviewed and their specific features described; simulations further demonstrate that the different techniques lead to virtually the same estimates for the heterogeneity parameter. An important issue is the relationship between the size of a multicenter trial, in terms of number of centers and number of patients per center, and the bias and the spread of estimates of the heterogeneity parameter around its true value. Based on simulation results (restricted to constant hazard rate and the gamma frailty density), it becomes clear how the number of centers and the number of patients per center influence the quality of the estimates in the particular setting of breast cancer clinical trials. This insight is important in treatment outcome research, where one tries to relate differences with respect to clinical practice to differences in outcome in the various centers.
Modeling and analysis of communication circuit performance using Markov chains and efficient graph representations
Authors: Alper Demir, Peter Feldmann
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In high-speed data networks, the bit-error-rate specification on the system can be very stringent, i.e., 10-14. At such error rates, it is not feasible to evaluate the performance of a design using straightforward, simulation based, approaches. Nevertheless performance prediction before actual hardware is built is essential for the design process.This work introduces a stochastic model and an analysis-based, non-Monte-Carlo method for performance evaluation of digital data communication circuits. The analyzed circuit is modeled by a number of interacting finite state machines with inputs described as functions on a Markov chain state-space. The composition of these elements results in a typically very large Markov chain. System performance measures, such as probability of bit errors and rate of synchronization loss, can be evaluated by solving linear problems involving the large Markov chain's transition probability matrix. This paper first describes a dedicated multi-grid method used to solve these very large linear problems. The principal bottleneck in such an approach is the size of the Markov chain state-space, which grows exponentially with system complexity. The second part of this paper introduces a novel, graph based, data structure capable of efficiently storing and manipulating transition probability matrices for several million state Markov chains. The methods are illustrated on a real industrial clock-recovery circuit design.
The Design of the 88000 RISC Family
Authors: Charles Melear
Venue: IEEE Micro (1989)

The design and implementation of the RISC (reduced-instruction-set computer) 88000 system in high-speed, complementary metal-oxide semiconductor (HCMOS) technology is described. The total system consists of the 88100 processor and two 88200 cache memory management units (CMMUs). The various features and components of the 88000 are discussed.
Evaluating the Mflops Measure
Authors: Ran Giladi
Venue: IEEE Micro (1996)

The capability of the MIPS measure as an indicator of computer performance is highly questionable and is often rejected by most researchers. On the other hand, the MFLOPS measure is commonly used, mainly in mainframes and workstations for scientific and engineering tasks. The MFLOPS measure, as described by Dongarra, is widely employed because of its efficiency and effectiveness in terms of simplicity and its indicative abilities. The question of the value of the MFLOPS measure and the ways it should be applied is treated in this article. We suggest evaluation models, based on architectural and configurational parameters of the computer, and examine their validity. The analysis shows a correlation between the MFLOPS measure and the MIPS measure for various specific time periods and various specific manufacturers.
Availability analysis and improvement of active/standby cluster systems using software rejuvenation
Authors: Kiejin Park, Sungsoo Kim
Venue: Journal of Systems and Software (2002)

Cluster systems, using commercially available personal computers connected in a loosely coupled fashion can provide high levels of availability. To improve the availability of personal computer-based Active/Standby cluster systems, we have conducted a study of software rejuvenation that follows a proactive fault-tolerant approach to handle software-origin system failure. In this paper, we map software rejuvenation and switchover states with a semi-Markov process and get mathematical steady-state solutions of the chain. We calculate the availability and the downtime of Active/Standby cluster systems using the solutions and find that software rejuvenation can be used to improve the availability of Active/Standby cluster systems.
Constant Geometry Fast Fourier Transforms on Array Processors
Authors: G. Miel
Venue: IEEE Transactions on Computers (1993)

Matrix algebra is used to design and validate parallel algorithms for large constant-geometry fast Fourier transforms (FFTs) on fixed-size array processors. The N-point radix 2 case for a linear array processor with N/2 cells is identical to the usual procedure corresponding to the matrix factorization of M.C. Pease, (1968). The algorithms are engendered by matrix factorizations, which themselves depend on a basic factorization of the perfect shuffle. The resulting data movement is realized in parallel as relatively small perfect shuffles inside each local memory and along each row and column of the array processor, without requiring that the complete array itself have the shuffle-exchange network.
New Ways to Get Accurate Reliability Measures
Authors: Sarah Brocklehurst, Bev Littlewood
Venue: IEEE Software (1992)

Two techniques that analyze prediction accuracy and enhance predictive power of a software reliability model are presented. The u-plot technique detects systematic differences between predicted and observed failure behavior, allowing the recalibration of a software reliability model to obtain more accurate predictions. The perpetual likelihood ratio (PLR) technique compares two models' abilities to predict a particular data source so that the one that has been most accurate over a sequence of predictions can be selected. The application of these techniques is illustrated using three sets of real failure data.
Remediation of Application-Specific Security Vulnerabilities at Runtime
Authors: Thomas F. Bowen, Mark E. Segal
Venue: IEEE Software (2000)

Researchers at Telcordia Technologies and the State University of New York, Stony Brook, are working on an approach that gives computer users new capabilities for defending against exploitation of application security vulnerabilities by allowing rapid development and deployment of real-time defenses. Their solution involves monitoring and changing an application's behavior by intercepting the system calls it requests.