ppxscal/embedding_network huggingface dataset:
Myths and realities: the performance impact of garbage collection
Authors: Stephen M. Blackburn, Perry Cheng, Kathryn S. McKinley
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

This paper explores and quantifies garbage collection behavior for three whole heap collectors and generational counterparts: copying semi-space, mark-sweep, and reference counting, the canonical algorithms from which essentially all other collection algorithms are derived. Efficient implementations in MMTk, a Java memory management toolkit, in IBM's Jikes RVM share all common mechanisms to provide a clean experimental platform. Instrumentation separates collector and program behavior, and performance counters measure timing and memory behavior on three architectures.Our experimental design reveals key algorithmic features and how they match program characteristics to explain the direct and indirect costs of garbage collection as a function of heap size on the SPEC JVM benchmarks. For example, we find that the contiguous allocation of copying collectors attains significant locality benefits over free-list allocators. The reduced collection costs of the generational algorithms together with the locality benefit of contiguous allocation motivates a copying nursery for newly allocated objects. These benefits dominate the overheads of generational collectors compared with non-generational and no collection, disputing the myth that "no garbage collection is good garbage collection." Performance is less sensitive to the mature space collection algorithm in our benchmarks. However the locality and pointer mutation characteristics for a given program occasionally prefer copying or mark-sweep. This study is unique in its breadth of garbage collection algorithms and its depth of analysis.
An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
Authors: Richard H. Byrd, Nicholas I. M. Gould, Jorge Nocedal, Richard A. Waltz
Venue: Mathematical Programming: Series A and B (2004)

This paper describes an active-set algorithm for large-scale nonlinear programming based on the successive linear programming method proposed by Fletcher and Sainz de la Maza [10]. The step computation is performed in two stages. In the first stage a linear program is solved to estimate the active set at the solution. The linear program is obtained by making a linear approximation to the &#x2113;1 penalty function inside a trust region. In the second stage, an equality constrained quadratic program (EQP) is solved involving only those constraints that are active at the solution of the linear program. The EQP incorporates a trust-region constraint and is solved (inexactly) by means of a projected conjugate gradient method. Numerical experiments are presented illustrating the performance of the algorithm on the CUTEr [1, 15] test set.
Real-time generation of primes by a 1-bit-communication cellular automaton
Authors: Hiroshi Umeo, Naoki Kamikawa
Venue: Fundamenta Informaticae (2003)

It is shown that an infinite prime sequence can be generated in real-time by a cellular automaton having 1-bit inter-cell communications (CA1-bit). The algorithm presented is based on the classical sieve of Eratosthenes, and its implementation will be made on a CA1-bit using 34 internal states and 71 transition rules.
A Self-Tuning Method for One-Chip SNP Identification
Authors: Michael Molla, Jude Shavlik, Thomas Albert, Todd Richmond, Steven Smith
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Current methods for interpreting oligonucleotide-based SNP-detection microarrays, SNP chips, are based on statistics and require extensive parameter tuning as well as extremely high-resolution images of the chip being processed. We present a method, based on a simple data-classification technique called nearest-neighbors that, on haploid organisms, produces results comparable to the published results of the leading statistical methods and requires very little in the way of parameter tuning. Furthermore, it can interpret SNP chips using lower-resolution scanners of the type more typically used in current microarray experiments. Along with our algorithm, we present the results of a SNP-detection experiment where, when independently applying this algorithm to six identical SARS SNP chips, we correctly identify all 24 SNPs in a particular strain of the SARS virus, with between 6 and 13 false positives across the six experiments.
SATORI - A Fast Sequential SAT Engine for Circuits
Authors: M. K. Iyer, G. Parthasarathy, K.-T. Cheng
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We describe the design and implementation of SATORI - a fast sequentialjustification engine based on state-of-the-art SAT and ATPG techniques.We present several novel techniques that propel SATORI to ademonstrable 10x improvement over a commercial engine. Traditionalsequential justification based on ATPG or, on a bounded model of thesequential circuit using SAT, has diverging strengths and weaknesses. Inthis paper, we contrast these techniques and describe how their strengthsare combined in SATORI. We use conflict-based learning in each time-frameand illegal state learning across time-frames. This enables bothcombinational and sequential back-jumping. We experimentally analyzethe main features of SATORI by comparing SATORI's performanceagainst a state-of-the-art SAT solver - ZCHAFF using a boundedmodel, and a commercial sequential ATPG engine performing justification.Additional results are presented for SATORI versus the commercialATPG engine and VIS on ISCAS ý89 and ITC'99 benchmark circuitsfor an application to assertion checking.
Proximity theorems of discrete convex functions
Authors: Kazuo Murota, Akihisa Tamura
Venue: Mathematical Programming: Series A and B (2004)

A proximity theorem is a statement that, given an optimization problem and its relaxation, an optimal solution to the original problem exists in a certain neighborhood of a solution to the relaxation. Proximity theorems have been used successfully, for example, in designing efficient algorithms for discrete resource allocation problems. After reviewing the recent results for L-convex and M-convex functions, this paper establishes proximity theorems for larger classes of discrete convex functions, L2-convex functions and M2-convex functions, that are relevant to the polymatroid intersection problem and the submodular flow problem.
Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
Authors: Navaratnasothie Selvakkumaran, George Karypis
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper we present a family of multi-objective hypergraphpartitioning algorithms based on the multilevel paradigm, whichare capable of producing solutions in which both the cut and themaximum subdomain degree are simultaneously minimized. Thistype of partitionings are critical for existing and emerging applications in VLSI CAD as they allow to both minimize and evenly distribute the interconnects across the physical devices. Our experimental evaluation on the ISPD98 benchmark show that ouralgorithms produce solutions that when compared against thoseproduced by hMETIS have a maximum subdomain degree that isreduced by up to 35% while achieving comparable quality in terms of cut.
I'm glad the future doesn't need us: a critique of Joy's pessimistic futurism
Authors: John G. Messerly
Venue: ACM SIGCAS Computers and Society (2003)

In his well-known piece, Why the future doesnt need us, Bill Joy argues that 21st century technologiesgenetic engineering, robotics, and nanotechnology (GNR)will extinguish human beings as we now know them, a prospect he finds deeply disturbing. I find his arguments deeply flawed and critique each of them in turn. 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
Component-Based Real-Time Design: Mapping HRT-HOOD to UML
Authors: T. Vardanega, M. Di Natale, S. Mazzini, M. D'Alessandro
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

This paper reports from a project that transposed the HRT-HOOD design method and development process onto a tailored profile of the UML meta-model. HRT-HOOD has methodological strengths which make it apt for component-based design of hard real-time systems. The UML meta-model is so flexible and comprehensive that it can express and support specific design methods and processes, without leaning towards any in particular. This paper discusses technical and methodological choices made in the mapping and reviews them in the light of a pair of case studies.
Mixed Signal DFT: A Concise Overview
Authors: Bozena Kaminska, Karim Arabi
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Practical mixed-signal DFT solutions are presentedwith an emphasis on performance, cost, and testcoverage.Special consideration is given to thepossible DFT techniques for Phase-Locked Loops(PLLs) with associated implications on testcoverage, performance, cost, and time to market.An introduction to practical DFT techniques fordata converters (A/D and D/A) follow.Anoverview of IEEE P1149.4 analog test bus standardconcludes the embedded tutorial.
A general method for solving divide-and-conquer recurrences
Authors: Jon Louis Bentley, Dorothea Haken, James B. Saxe
Venue: ACM SIGACT News (1980)

The approximate complexity of divide-and-conquer algorithms is often described by recurrence relations of the formT(n) = kT(n/c) + f(n).The only well-defined method currently used for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note we describe a unifying method for solving these recurrences that is both general in applicability and easy to apply. This method is appropriate both as a classroom technique and as a tool for practicing algorithm designers.
Semidiscretization and error estimates for distributed control of the instationary Navier-Stokes equations
Authors: Klaus Deckelnick, Michael Hinze
Venue: Numerische Mathematik (2004)

Optimal control problems governed by the two-dimensional instationary Navier&#x2013;Stokes equations and their spatial discretizations with finite elements are investigated. A concept of semi&#x2013;discrete solutions to the control problem is introduced which is utilized to prove existence and uniqueness of discrete controls in neighborhoods of regular continuous solutions. Furthermore, an optimal error estimate in terms of the spatial discretization parameter is given.
Stochastic traffic engineering for demand uncertainty and risk-aware network revenue management
Authors: Debasis Mitra
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Stochastic traffic engineering for demand uncertainty and risk-aware network revenue management We present a stochastic traffic engineering framework for optimizing bandwidth provisioning and route selection in networks. Traffic demands are uncertain and specified by probability distributions, and the objective is to maximize a risk-adjusted measure of network revenue that is generated by serving demands. Considerable attention is given to the appropriate measure of risk in the network model. We also advance risk-mitigation strategies. The optimization model, which is based on mean-risk analysis, enables a service provider to maximize a combined measure of mean revenue and revenue risk. The framework is intended for off-line traffic engineering, which takes a centralized view of network topology, link capacity and demand. We obtain conditions under which the optimization problem is an instance of convex programming. We study the properties of the solution and show that it asymptotically meets the stochastic efficiency criterion.In our numerical investigations we illustrate the impact of demand uncertainty on various aspects of the optimally traffic engineered solutions. The service provider's tolerance to risk is shown to have a strong influence on the traffic engineering and revenue management decisions. We develop the efficient frontier, which is the set of Pareto optimal pairs of mean revenue and revenue risk, to aid the service provider in selecting its operating point.
Polynomial filtering in latent semantic indexing for information retrieval
Authors: E. Kokiopoulou, Y. Saad
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Latent Semantic Indexing (LSI) is a well established and effective framework for conceptual information retrieval. In traditional implementations of LSI the semantic structure of the collection is projected into the k-dimensional space derived from a rank-k approximation of the original term-by-document matrix. This paper discusses a new way to implement the LSI methodology, based on polynomial filtering. The new framework does not rely on any matrix decomposition and therefore its computational cost and storage requirements are low relative to traditional implementations of LSI. Additionally, it can be used as an effective information filtering technique when updating LSI models based on user feedback.
A Testbed System for Mobile Point-of-Care Information Delivery
Authors: Susan E. Hauser, Dina Demner-Fushman, Glenn Ford, George R. Thoma
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

PubMed on Tap is a testbed system that supports search of and retrieval from the NationalLibrary of Medicine's MEDLINE® database from a PDA. The goal of the PubMed on Tapproject is to discover and implement design principles for point-of-care delivery of clinicalsupport information. The project explores user interface issues, information content andorganization, and system performance. Here we present our progress in these areas.
When one sample is not enough: improving text database selection using shrinkage
Authors: Panagiotis G. Ipeirotis, Luis Gravano
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the database contents, which are not typically exported by databases. Previous research has developed algorithms for constructing an approximate content summary of a text database from a small document sample extracted via querying. Unfortunately, Zipf's law practically guarantees that content summaries built this way for any relatively large database will fail to cover many low-frequency words. Incomplete content summaries might negatively affect the database selection process, especially for short queries with infrequent words. To improve the coverage of approximate content summaries, we build on the observation that topically similar databases tend to have related vocabularies. Therefore, the approximate content summaries of topically related databases can complement each other and increase their coverage. Specifically, we exploit a (given or derived) hierarchical categorization of the databases and adapt the notion of "shrinkage" -a form of smoothing that has been used successfully for document classification-to the content summary construction task. A thorough evaluation over 315 real web databases as well as over TREC data suggests that the shrinkage-based content summaries are substantially more complete than their "unshrunk" counterparts. We also describe how to modify existing database selection algorithms to adaptively decide -at run-time-whether to apply shrinkage for a query. Our experiments, which rely on TREC data sets, queries, and the associated "relevance judgments," show that our shrinkage-based approach significantly improves state-of-the-art database selection algorithms, and also outperforms a recently proposed hierarchical strategy that exploits database classification as well.
Minimal Partial Hyperclones on a Two-Element Set
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

Let A be a two-element set. It has been proven byMachida that the lattice of hyperclones has continuum cardinality.The current paper first determines all the minimalpartial hyperclones. Following this, the authors giveall three-element subsets of minimal hyperoperations whoseunion generates the clone of all hyperoperations as well asall four minimal subsets of minimal partial hyperoperationswhose union generates the clone of all partial hyperoperations.
Quantifying rollback propagation in distributed checkpointing
Authors: Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg
Venue: Journal of Parallel and Distributed Computing (2004)

This paper proposes a new classification of executions with checkpoints based on the amount of rollback during recovery. Specifically, an execution is k-rollback, if k indicates the maximal number of checkpoints that have to be rolled back. It is shown that coordinated checkpointing, SZPF, and ZPF are 1-rollback, while ZCF is (n - 1)-rollback, where n is the number of participants in an execution.A new class of executions, called d-bounded cycles (in short, d-BC), is introduced, and is shown to be ((n - 1)ċ d)-rollback (ZCF is a special case of d-BC for d = 1).Finally, a protocol is presented whose executions are d-bounded cycles. A nice property of this protocol is that it does not impose any control information overhead on application messages, yet sends only a few control messages of its own. Moreover, the protocol maintains information that enables very efficient discovery of a recent recovery line that existed shortly before the failure.
Comparing CAVE, Wall, and Desktop Displays for Navigation and Wayfinding in Complex 3D Models
Authors: Colin Swindells, Barry A. Po, Ima Hajshirmohammadi, Brian Corrie, John C. Dill, Brian D. Fisher, Kellogg S. Booth
Venue: Proceedings of the Computer Graphics International (2004)

Computer-aided design (CAD) and 3D visualizationtechniques are at the heart of many engineering processessuch as aircraft, ship, and automobile design. Thesevisualization tasks require users to navigate or wayfindthrough complex 3D geometric models consisting ofmillions of parts. Despite numerous studies, it remainsunclear whether large-screen displays improve userperformance for such activities. We present a user studycomparing standard desktop, immersive room (i.e.,CAVE), and wall displays with 3D stereo / head-tracking,and mono / no head-tracking. We observed individualdifferences between users and found that the presence ofcontextual structure greatly impacted performance,suggesting that providing structure and developinginteraction techniques accommodating a wide range ofusers yields better performance than focusing on displaycharacteristics alone.
Energy-Aware, Load Balanced Routing Schemes for Sensor Networks
Authors: Shih-Chang Huang, Rong-Hong Jan
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

This paper presents two energy-aware, load balancedrouting schemes, called as maximum capacity path (MCP)scheme and MCP with path switching (MCP-PS) scheme,for sensor networks. In the MCP scheme, the sensornetwork is constructed into a layered network at first.Based on the layered network, every sensor node selects ashortest path with maximum capacity to sink. In MCP-PS,the node may switch its routing path to its sibling neighborsin order to share the traffic. The simulation results showthat our MCP and MCP-PS schemes can achieve a betterload-sharing and better endurance on network lifetime.
Performance evaluation of programmable graphics hardware for image filtering and stereo matching
Authors: Kaoru Sugita, Takeshi Naemura, Hiroshi Harashima
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

It is obvious that faster processors are essential for virtual reality applications. Recently, we have a new generation of graphics hardware which can enhance the reality of interactive graphics. Although it is designed for rendering purpose, its programmability is expected to be effective for other general applications. This paper evaluates its performance as an image processing unit especially for image filtering and stereo matching. First, we focus on image filtering, and compare GPU (ATI RADEON 9700 Pro) implementations to optimized CPU (Intel Pentium 4 3.06GHz) ones. Experimental results show that, for linear filtering, GPUs are from three to six times faster than CPUs. Then, we implement a block-based stereo matching algorithm using filters and depth-test-based optimization on the GPU. This implementation is shown to be twice faster than a CPU implementation. Finally, a system based on this algorithm is constructed to estimate depth from two video sequences in real time.
An Adaptive Sampling Method for Layered Depth Image
Authors: Ravinder Namboori, Hung Chuan Teh, Zhiyong Huang
Venue: Proceedings of the Computer Graphics International (2004)

Sampling issue is an important problem in image basedrendering. In this paper, we propose an adaptivesampling method to improve the Layered Depth Imageframework. Different from the existing methods ofinterpolating or splatting neighboring pixels, our methodselects a set of sampling views based on the sceneanalysis that can guarantee the final rendering quality.Furthermore, the rendering speed is accelerated by thepre-computed patch lookup table, which simplifies thereference view selection process to a simple lookup of ahash table. We have implemented our method. Theexperiment study shows the advantage of the method.
Analysis of Population Dynamics in Beta-Cell Destruction Lead to Identification of Novel Candidate Genes for Type 1 Diabetes
Authors: Yizhou Xie, Xujing Wang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

A major difficulty in the genetic study of type 1 diabetes (T1D) is the lack of means to identify candidate disease genes, as the exact disease etiology is still unclear. We have developed a minimal model for T1D where we mathematically formulate the population dynamics for the most critical components in β-cell destruction: macrophages, T lymphocytes, β cells and β-cell autoantigens. System dynamic stability analysis revealed that the disease process for adult individuals is critically regulated by several major gene regulation pathways. Together they provide a comprehensive picture of where the candidate genes most likely lie. We will present our model, our bioinformatics platform to retrieve and update the gene information involved in the pathways, and our candidate gene database. In addition we will present our plan of candidate gene genotyping. Our approach represents the first time understanding the disease dynamics is integrated with the genetic study of a complex disease.
VERking in constructive set theory
Authors: Robert L. Constable
Venue: ACM SIGSOFT Software Engineering Notes (1981)

The constructive set theory of PL/CV3 is used to illustrate conditions that a formal system must satisfy if it is to feasibly represent the reasoning needed to solve sequential programming problems.
On the cubic residues numbers and k-power complement numbers
Authors: Zhang Tianping
Venue: Smarandache Notions Journal (2004)

The main purpose of this paper is to study the asymptotic property of the the cubic residues and k-power complement numbers (where k ≥ 2 is a fixed integer), and obtain some interesting asymptotic formulas.