ppxscal/embedding_network huggingface dataset:
Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design
Authors: Vijaya Ramachandran, Brian Grayson, Michael Dahlin
Venue: Journal of Parallel and Distributed Computing (2003)

We present work-preserving emulations with small slowdown between LogP and two other parallel models: BSP and QSM. In conjunction with earlier work-preserving emulations between QSM and BSP, these results establish a close correspondence between these three general-purpose parallel models. Our results also correct and improve on results reported earlier on emulations between BSP and LogP. In particular we shed new light on the relative power of stalling and non-stalling LogP models.The QSM is a shared-memory model with only two parameters--p, the number of processors, and g, a bandwidth parameter. The simplicity of the QSM parameters makes QSM a convenient model for parallel algorithm design, and simple work-preserving emulations of QSM on BSP and QSM on LogP show that algorithms designed for the QSM will also map quite well to these other models. The simplicity and generality of QSM present a strong case for the use of QSM as the model of choice for parallel algorithm design.We present QSM algorithms for three basic problems--prefix sums, sample sort and list ranking. We show that these algorithms are optimal in terms of both the total work performed and the number of 'phases' for input sizes of practical interest. For prefix sums, we present a matching lower bound that shows our algorithm to be optimal over the complete range of these parameters. We then examine the predicted and simulated performance of these algorithms. These results suggest that QSM analysis will predict algorithm performance quite accurately for problem sizes that arise in practice.
ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraints
Authors: Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, Dino Pedreschi
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The key point of this paper is that, in frequent patternmining, the most appropriate way of exploiting monotoneconstraints in conjunction with frequency is to use them inorder to reduce the problem input together with the searchspace. Following this intuition, we introduce ExAMiner, alevel-wise algorithm which exploits the real synergy of anti-monotoneand monotone constraints: the total benefit isgreater than the sum of the two individual benefits. ExAMinergeneralizes the basic idea of the preprocessing algorithmExAnte, embedding such ideas at all levels ofan Apriori-like computation. The resulting algorithm is thegeneralization of the Apriori algorithm when a conjunctionof monotone constraints is conjoined to the frequency anti-monotoneconstraint. Experimental results confirm that thisis, so far, the most efficient way of attacking the computationalproblem in analysis.
Per-pixel divisions
Authors: Sergey Parilov, Wolfgang Stuerzlinger
Venue: Journal of Graphics Tools (2002)

We describe a method to perform per-pixel divisions using graphics hardware, with a simple iterative algorithm. In the worst case, the number of rendering passes is 17 for approximate divisions, and 18 for accurate divisions. The algorithm can be used for 3D vector normalization, evaluating complex lighting models, and image reconstruction.
Geriatric applications of Bayesian networks and survival analysis
Authors: Adele Marshall
Venue: ACM SIGBIO Newsletter (1998)

The overall aim of this project is to combine the approach of Bayesian belief networks with that of survival analysis. The analysis can take advantage of the benefits of continuous data and censoring from survival analysis but still have the ability to represent causal relationships by using Bayesian belief networks. We wish to apply the methodology to data from the medical domain, in particular data for lengths and outcomes of spells in geriatric departments. This application of the model to include dynamic aspects of geriatric data is likely to lead to a greater understanding of how diseases are caused and what factors affect duration of an illness or length of spell in hospital. Such factors are clearly of interest to hospital administrators and health care managers.
A vocabulary development and visualization tool based on natural language processing and the mining of textural patient reports
Authors: Carol Friedman, Hongfang Liu, Lyudmila Shagina
Venue: Journal of Biomedical Informatics (2003)

Medical terminologies are critical for automated healthcare systems. Some terminologies, such as the UMLS and SNOMED are comprehensive, whereas others specialize in limited domains (i.e., BIRADS) or are developed for specific applications. An important feature of a terminology is comprehensive coverage of relevant clinical terms and ease of use by users, which include computerized applications. We have developed a method for facilitating vocabulary development and maintenance that is based on utilization of natural language processing to mine large collections of clinical reports in order to obtain information on terminology as expressed by physicians. Once the reports are processed and the terms structured and collected into an XML representational schema, it is possible to determine information about terms, such as frequency of occurrence, compositionality, relations to other terms (such as modifiers), and correspondence to a controlled vocabulary. This paper describes the method and discusses how it can be used as a tool to help vocabulary builders navigate through the terms physicians use, visualize their relations to other terms via a flexible viewer, and determine their correspondence to a controlled vocabulary.
Factors influencing users' adoption of mobile computing
Authors: Wenli Zhu, Fiona Fui-Hoon Nah, Fan Zhao
Venue: Managing e-commerce and mobile computing technologies (2003)

This chapter introduces a model that identifies factors influencing users' adoption of mobile computing. It extends the Technology Acceptance Model (TAM) by identifying system and user characteristics that affect the perceived usefulness and perceived ease of use of mobile computing, which are two key antecedents in TAM. Furthermore, it incorporates two additional constructs, trust and enjoyment, as determinants in the model, and proposes specific factors that influence these two constructs. The long-term goals of this work are to gain an increased understanding of adoption issues in mobile computing, and to explain how specific HCI design issues may affect adoption by users.
Memory cache and lisp: faster list processing via automatically rearranging memory
Authors: Richard Fateman
Venue: ACM SIGSAM Bulletin (2003)

The speed of modern computers can be increased by organizing computations so that memory access patterns correspond more closely to the memory cache-loading patterns implemented in the hardware. Rearranging code and data are each possible. Here we concentrate on automatic rearrangement of data, and examine the belief, common in some technical circles, that modern generational copying garbage collectors (GC) will improve data caching by relocating and compressing data, as a matter of normal processing. Since GC routines tend to be very well-tested and quite robust, if this belief can be confirmed by benchmarks, a GC could be a "free" way of reliably speeding up programs in practice.In fact, our tests show this speedup phenomenon can be measured in some but not all sample Lisp programs. A novelty in our tests (at least when this paper was written) was using a full Lisp system linked to free software (PAPI) to access hardware machine registers. PAPI allows us to count cache misses during full-speed computation. We conclude that after a GC cache misses may be significantly reduced in some examples. Reorganization by GC speeds up computation by as much by a factor of 4, but in some cases the effect is negligible (or may even slow computation slightly). In any case, no extra effort is required of the programmer or user to take advantage of the potential speedup.
Programs as information
Authors: Doug Janzen, Kris De Volder
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

In any programming system the environment in which a program is constructed is tightly bound to the format of the data used to represent that program. As software development environments are becoming more sophisticated, there is a growing need to get richer representations of programs that allow programs to be treated at a much higher level of abstraction than as sequences of characters in source files.In this paper we explore the use of a database representation as a medium for representing and manipulating programs. We report on the work we did on two different Eclipse plugins exemplifying the potential advantages of such a representation. The first plugin explores the use of a database representation to store programs written in a traditional programming language (Java). The second plugin is part of a research effort to try to define a programming language directly in terms of a database representation.
Influence of low-k dry etch chemistries on the properties of copper and a Ta-based diffusion barrier
Authors: D. Ernur, F. Iacopi, L. Carbonell, Herbert Struyf, K. Maex
Venue: Microelectronic Engineering (2003)

In this study, the film properties of Cu and a Ta-based diffusion barrier deposited on organic polymer and SSQ-based low-k materials with subtractive porosity were investigated. Emphasis was put on the effects of exposure of the low-k materials to the dry etch plasmas prior to metal deposition. The metal film properties were influenced by the type of the dry etch plasma chemistry used and by the porosity of the low-k material. Thermal desorption spectra (TDS) obtained during annealing of these metal films revealed an increased amount of species with m/e 44, attributed to CO2, and H2O desorbing from the Cu film at high temperatures. The TDS data for the Ta film did not contain such high temperature desorption peaks for these species mentioned. Surface morphology of the Cu and Ta films observed by scanning electron microscopy (SEM) and atomic force microscopy (AFM) also showed a poor wetting of the metal films on the porous low-k materials that have been dry etch plasma treated.
Topological and limit-space subcategories of countably-based equilogical spaces
Authors: Matías Menni, Alex Simpson
Venue: Mathematical Structures in Computer Science (2002)

There are two main approaches to obtaining &lsquo;topological&rsquo; cartesian-closed categories. Under one approach, one restricts to a full subcategory of topological spaces that happens to be cartesian closed &ndash; for example, the category of sequential spaces. Under the other, one generalises the notion of space &ndash; for example, to Scott's notion of equilogical space. In this paper, we show that the two approaches are equivalent for a large class of objects. We first observe that the category of countably based equilogical spaces has, in a precisely defined sense, a largest full subcategory that can be simultaneously viewed as a full subcategory of topological spaces. In fact, this category turns out to be equivalent to the category of all quotient spaces of countably based topological spaces. We show that the category is bicartesian closed with its structure inherited, on the one hand, from the category of sequential spaces, and, on the other, from the category of equilogical spaces. We also show that the category of countably based equilogical spaces has a larger full subcategory that can be simultaneously viewed as a full subcategory of limit spaces. This full subcategory is locally cartesian closed and the embeddings into limit spaces and countably based equilogical spaces preserve this structure. We observe that it seems essential to go beyond the realm of topological spaces to achieve this result.
Extended Subspace Identification of Improper Linear Systems
Authors: Gerd Vandersteen, Rik Pintelon, Dimitri Linten, Stéphane Donnay
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The modeling of linear transfer functions is often required prior to the simulation of electronic systems. An example is the modeling of on-chip inductors starting from 2-port measurements. The modeling is often done using state-space models that can only represent proper systems.This leads to modeling problems in the case of improper systems such as in the case of 2-port modeling of the admittance matrix of an on-chip inductor. This paper first describes an extended state-space model to represent improper systems. Afterwards, the paper introduces an extension to classical frequency-domain subspace identification methods. The usefulness of both the extended state-space model and the extended subspace modeling technique are illustrated by comparing them with commercially available solutions. This includes a comparison on measurements of an on-chip inductor and on simulations of a coplanar waveguide.
Testing metric properties
Authors: Michal Parnas, Dana Ron
Venue: Information and Computation (2003)

Finite metric spaces, and in particular tree metrics play an important role in various disciplines such as evolutionary biology and statistics. A natural family of problems concerning metrics is deciding, given a matrix M, whether or not it is a distance metric of a certain predetermined type. Here we consider the following relaxed version of such decision problems: For any given matrix M and parameter ε, we are interested in determining, by probing M, whether M has a particular metric property P, or whether it is ε-far from having the property. In ε-far we mean that at least an ε-fraction of the entries of M must be modified so that it obtains the property. The algorithm may query the matrix on entries M[i,j] of its choice, and is allowed a constant probability of error.We describe algorithms for testing Euclidean metrics, tree metrics and ultrametrics. Furthermore, we present an algorithm that tests whether a matrix M is an approximate ultrametric. In all cases the query complexity and running time are polynomial in 1/ε and independent of the size of the matrix. Finally, our algorithms can be used to solve relaxed versions of the corresponding search problems in time that is sub-linear in the size of the matrix.
Guest Editors' Introduction: Business Processes on the Web
Authors: Charles Petrie, Akhil Sahai
Venue: IEEE Internet Computing (2004)

With the advent of service-centric computing, the virtual enterprise is fast becoming a reality as businesses increasingly outsource various functions electronically. The complex interrelationships this creates among companies requires distributed information systems with standards-based descriptions of services, operations, and processes.
MODeLeR: multimedia object design learning resource
Authors: John W. Coffey, Robert Koonce
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

This paper contains a description of MODeLeR, a Multimedia Object Design Learning Resource. The impetus for the creation of MODeLeR was to provide an authentic learning environment for the study of object-oriented design to augment intermediate level programming classes. The Resource affords active, collaborative learning experiences in object modeling with the goal of helping students to gain design capabilities in UML and to appreciate the need for design that they often do not perceive since the programs they write are relatively small. Students typically create several different UML diagrams. This paper describes the MODeLeR environment and a pilot study in its use. This paper contains results of both a quantitative study and a qualitative evaluation of the Resource.
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
Authors: Stephen A. Cook, Jan K. Pachl, Irwin S. Pressman
Venue: Distributed Computing (2002)

We consider the problem of locating replicas in a network to minimize communications costs. Under the assumption that the READ-ONE-WRITE-ALL policy is used to ensure data consistency, an optimization problem is formulated in which the cost function estimates the total communications costs. The paper concentrates on the study of the optimal communications cost as a function of the ratio between the frequency of the read and write operations. The problem is reformulated as a zero-one linear programming problem, and its connection to the p-median problem is explained. The general problem is proved to be NP-complete. For path graphs a dynamic programming algorithm for the problem is presented.
Parallel frontal solvers for large sparse linear systems
Authors: Jennifer A. Scott
Venue: ACM Transactions on Mathematical Software (TOMS) (2003)

Many applications in science and engineering give rise to large sparse linear systems of equations that need to be solved as efficiently as possible. As the size of the problems of interest increases, it can become necessary to consider exploiting multiprocessors to solve these systems. We report on the design and development of parallel frontal solvers for the numerical solution of large sparse linear systems. Three codes have been developed for the mathematical software library HSL (www.cse.clrc.ac.uk/Activity/HSL). The first is for unsymmetric finite-element problems; the second is for symmetric positive definite finite-element problems; and the third is for highly unsymmetric linear systems such as those that arise in chemical process engineering. In each case, the problem is subdivided into a small number of loosely connected subproblems and a frontal method is then applied to each of the subproblems in parallel. We discuss how our software is designed to achieve the goals of portability, ease of use, efficiency, and flexibility, and illustrate the performance using problems arising from real applications.
On the Automorphism Groups of Dowling Geometries
Authors: Gary K. Schwartz
Venue: Combinatorics, Probability and Computing (2002)

In &lsquo;Automorphisms of Dowling lattices and related geometries&rsquo;, J. Bonin constructed the automorphism group A of a Dowling lattice as the image of a certain semidirect product, A = &thgr;(K &rtimes; H). In this work we find necessary and sufficient conditions for this quotient to be the semidirect product A = &thgr;(K) &rtimes; &thgr;(H). In addition, we include a construction of A that lends itself to computation more readily than that found in Bonin's work.
Law and Regulation in cyberspace
Authors: Yee Fen Lim
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

This paper analyses the issue of Internet regulationand the role of law as a regulatory medium. It will firstlyargue that it is necessary for the Internet to be regulatedas without regulation, the rights of users in the real worldand in the cyberworld will be compromised andsuppressed and the laws of the physical world will beundermined. An unregulated cyberspace has the potentialto compromise legal systems, stifle activity in cyberspaceand erode community values. Two key models ofregulation will be discussed, namely the judicial modeland the socio-normative model. It will be argued thatneither offers satisfactory solutions. The paper will arguethat a workable model of regulation in cyberspace is onethat encompasses elements of law, social norms andInternet architecture.
Parallelizing functional programs by generalization
Authors: Alfons Geser, Sergei Gorlatch
Venue: Journal of Functional Programming (1999)

List homomorphisms are functions that are parallelizable using the divide-and-conquer paradigm. We study the problem of finding homomorphic representations of functions in the Bird&ndash;Meertens constructive theory of lists, by means of term rewriting and theorem proving techniques. A previous work proved that to each pair of leftward and rightward sequential representations of a function, based on cons- and snoc-lists, respectively, there is also a representation as a homomorphism. Our contribution is a mechanizable method to extract the homomorphism representation from a pair of sequential representations. The method is decomposed to a generalization problem and an inductive claim, both solvable by term rewriting techniques. To solve the former we present a sound generalization procedure which yields the required representation, and terminates under reasonable assumptions. The inductive claim is provable automatically. We illustrate the method and the procedure by the systematic parallelization of the scan-function (parallel prefix) and of the maximum segment sum problem.
Compatibility of Silicon gates with hafnium-based gate dielectrics
Authors: D. C. Gilmer, R. Hegde, R. Cotton, J. Smith, L. Dip, R. Garcia, V. Dhandapani, D. Triyoso, D. Roan, A. Franke, R. Rai, L. Prabhu, C. Hobbs, J. M. Grant, L. La, S. Samavedam, B. Taylor, H. Tseng, P. Tobin
Venue: Microelectronic Engineering (2003)

Silicon gate compatibility problems with hafnium-basd gate dielectrics are reported. It generally can be stated that chemical vapor deposition (CVD) silicon gates using silane deposited directly onto polycrystalline HfO2 at conventional temperatures (near 620°C) results in (1) a low density ot large inhomogeneous polycrystalline-silicon (poly-Si) grains, (2) electrical properties much worse compared to similar HfO2 films using metal gates or silicon gates with low temperature deposition. However, depositing conventional CVD poly-Si gates directly onto Al2O3-capped, hafnium-silicate-capped, or physical vapor deposition (PVD) silicon-capped HfO2 resulted in the absence of large inhomogeneous poly-Si grains and well behaved capacitors with leakage reduction greater than 103 times compared to the poly-Si/HfO2 and poly-Si/SiO2 controls of similar electrical thickness. The two observed adverse phenomena for conventional poly-Si deposited directly on HfO2 are attributed to a partial reduction of the HfO2 by the poly-Si deposition ambient. In the first case (1) the partial reduction occurs locally on the HfO2 surface, forming Hf-Six bond(s) which act as nucleation points for crystalline silicon growth while in the second case (2) the partial reduction occurs along grain boundaries resulting in electrical traps that increase film leakage. In addition, it is postulated that similar adverse interactions with conventionally deposited CVD poly-Si may occur with any transition metal oxide whose metal can form stable silicides.
LLVA: A Low-level Virtual Instruction Set Architecture
Authors: Vikram Adve, Chris Lattner, Michael Brukman, Anand Shukla, Brian Gaeke
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

A virtual instruction set architecture (V-ISA) implementedvia a processor-specific software translation layercan provide great flexibility to processor designers. Recentexamples such as Crusoe and DAISY, however, haveused existing hardware instruction sets as virtual ISAs,which complicates translation and optimization. In fact,there has been little research on specific designs for a virtualISA for processors. This paper proposes a novel virtualISA (LLVA) and a translation strategy for implementingit on arbitrary hardware. The instruction set is typed,uses an infinite virtual register set in Static Single Assignmentform, and provides explicit control-flow and dataflowinformation, and yet uses low-level operations closelymatched to traditional hardware. It includes novel mechanismsto allow more flexible optimization of native code,including a flexible exception model and minor constraintson self-modifying code. We propose a translationstrategy that enables offline translation and transparent offlinecaching of native code and profile information, whileremaining completely OS-independent. It also supports optimizationsdirectly on the representation at install-time,runtime, and offline between executions. We show experimentallythat despite its rich information content,virtual object code is comparable in size to native machinecode, virtual instructions expand to only 2-4 ordinaryhardware instructions on average, and simple translationcosts under 1% of total execution time except for veryshort runs.