ppxscal/embedding_network huggingface dataset:
A scalable dynamic load distribution scheme for multi-server distributed virtual environment systems with highly-skewed user distribution
Authors: Kyungmin Lee, Dongman Lee
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

This paper proposes and evaluates a scalable dynamic load distribution scheme for multi-server distributed virtual environment systems, where users are highly skewed rather than uniformly distributed over a virtual environment. In the proposed scheme, an overloaded server initiating load distribution selects a set of servers to be involved in load distribution by dynamically adapting to the workload status of other servers, unlike the existing approaches. Upon completion of server selection, the intiating server repartitions the regions dedicated to the involved servers using a graph partitioning algorithm so that all the involved servers have the roughly equal workload. The involved servers then migrate their workloads with each other in a peer-to-peer manner according to the result of repartitioning. We present and analyze the simulation results that compare the performance of the proposed scheme with that of the existing schemes.
On the divisor product sequences
Authors: Zhu Weiyi
Venue: Smarandache Notions Journal (2004)

The main purpose of this paper is to study the asymptotic property of the divisor product sequences, and obtain two interesting asymptotic formulas.
Specification transformers: a predicate transformer approach to composition
Authors: Michel Charpentier, Mani Chandy
Venue: Acta Informatica (2004)

This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and the composition operator, and (ii) deducing desirable properties of components from the system specification and properties of the composition operator. The paper studies compositional systems in general without making assumptions that components are computer programs. The results obtained from such abstract representations are general but also weaker than results that can be obtained from more restrictive assumptions such as assuming that systems are parallel compositions of concurrent programs. Explorations of general theories of composition can help identify fundamental issues common to many problem domains. The theory presented here is based on predicate transformers.
Energy-Efficient Policies for Request-Driven Soft Real-Time Systems
Authors: Cosmin Rusu, Ruibin Xu, Rami Melhem, Daniel Mosse
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Computing systems, ranging from small battery-operatedembedded systems to more complex general purpose systems,are designed to satisfy various computation demandsin some acceptable time. In doing so, the system is responsiblefor scheduling jobs/requests in a dynamic fashion. Inaddition, with power consumption recently becoming a criticalissue, most systems are also responsible for their ownpower management. In some rare cases, the exact arrivaltime and execution time of jobs/requests is known, leadingto precise scheduling algorithms and power managementschemes. However, more often than not, there is no a-prioriknowledge of the workload. This work evaluates dynamicvoltage scaling (DVS) policies for power management insystems with unpredictable workloads. A clear winner isidentified, a policy that reduces the energy consumption oneorder of magnitude compared to no power management andup to 40% (in real-life traces) and 50% (in synthetic workloads)compared to the second-best evaluated scheme.
Distributional Scaling: An Algorithm for Structure-Preserving Embedding of Metric and Nonmetric Spaces
Authors: Michael Quist, Golan Yona
Venue: The Journal of Machine Learning Research (2004)

We present a novel approach for embedding general metric and nonmetric spaces into low-dimensional Euclidean spaces. As opposed to traditional multidimensional scaling techniques, which minimize the distortion of pairwise distances, our embedding algorithm seeks a low-dimensional representation of the data that preserves the structure (geometry) of the original data. The algorithm uses a hybrid criterion function that combines the pairwise distortion with what we call the geometric distortion. To assess the geometric distortion, we explore functions that reflect geometric properties. Our approach is different from the Isomap and LLE algorithms in that the discrepancy in distributional information is used to guide the embedding. We use clustering algorithms in conjunction with our embedding algorithm to direct the embedding process and improve its convergence properties.We test our method on metric and nonmetric data sets, and in the presence of noise. We demonstrate that our method preserves the structural properties of embedded data better than traditional MDS, and that its performance is robust with respect to clustering errors in the original data. Other results of the paper include accelerated algorithms for optimizing the standard MDS objective functions, and two methods for finding the most appropriate dimension in which to embed a given set of data.
Improving Geocoding Practices: Evaluation of Geocoding Tools
Authors: Duck-Hye Yang, Lucy Mackey Bilaver, Oscar Hayes, Robert Goerge
Venue: Journal of Medical Systems (2004)

This study examined the sources of error involved in geocoding, by systematically evaluating the strengths and weaknesses of three widely used tools for geocoding. We tested them against a random sample of addresses from a state administrative address master file and found considerable variation in identification of census block geocodes of addresses. This high variation was mainly attributable to differences in preprocessing of addresses before geocoding and the reference street data used for geocoding. Preprocessing includes not only parsing and standardizing, but also correcting addresses against the US Postal Service Zip+4 Database, the master mailing address database maintained and updated regularly by USPS.
Sharing the cost of multicast transmissions in wireless networks
Authors: Vittorio Bilè, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

In this paper we consider the problem of sharing the costs of multicast transmissions in ad hoc wireless networks. Assuming that the receiving users are selfish, we provide strategy- proof mechanisms that are either optimally budget balanced or efficient for the case in which the distance-power gradient α =1 or the stations belong to a ne-dimensional Euclidean space.Then, by extending to multicasting previous results on wireless broadcasting,we show the existence of efficiently computable 2(3 d.1)-approximate budget balance mechanisms in any d -dimensional space for every α ≥ d.
The Number of Embeddings of Minimally Rigid Graphs
Authors: Ciprian Borcea, Ileana Streinu
Venue: Discrete Computational Geometry (2004)

Rigid frameworks in some Euclidean space are embedded graphs having a unique local realization (up to Euclidean motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings of minimally rigid graphs with $n$ vertices. We show that, modulo planar rigid motions, this number is at most ${{2n-4}\choose {n-2}} \approx 4^n$. We also exhibit several families which realize lower bounds of the order of $2^n$, $2.21^n$ and $2.28^n$.For the upper bound we use techniques from complex algebraic geometry, based on the (projective) Cayley--Menger variety ${\it CM}^{2,n}(C)\subset P_{{{n}\choose {2}}-1}(C)$ over the complex numbers $C$. In this context, point configurations are represented by coordinates given by squared distances between all pairs of points. Sectioning the variety with $2n-4$ hyperplanes yields at most $deg({\it CM}^{2,n})$ zero-dimensional components, and one finds this degree to be $D^{2,n}=\frac{1}{2}{{2n-4}\choose {n-2}}$. The lower bounds are related to inductive constructions of minimally rigid graphs via Henneberg sequences. The same approach works in higher dimensions. In particular, we show that it leads to an upper bound of $2 D^{3,n}= {({2^{n-3}}/({n-2}})){{2n-6}\choose{n-3}}$ for the number of spatial embeddings with generic edge lengths of the $1$-skeleton of a simplicial polyhedron, up to rigid motions. Our technique can also be adapted to the non-Euclidean case.
MAKO: Multi-Ontology Analytical Knowledge Organization based on Topic Maps
Authors: A. Riki Y. Morikawa, Larry Kerschberg
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper addresses how the XML Topic Map (XTM) 1.0 standard can be used to develop an analytical knowledge base comprised of multiple ontologies to support intelligence assessments. Termed the Multi-Ontology Analytical Knowledge Organizational (MAKO) framework, it incorporates a Multidimensional Ontology Model (MOM) that organizes subjects into separate conceptualizations based upon common-sense groupings. Topic, association and occurrence elements are temporally serialized, according to the Temporal Layer Model (TLM), to accommodate, and historically preserve, modifications to the knowledge base as world events change.
High-level debugging assistance via optimizing compiler technology
Authors: Karl J. Ottenstein, Linda M. Ottenstein
Venue: Proceedings of the symposium on High-level debugging (1983)

A primary benefit of most software tools is either the prevention or the detection of human error in the development process. Languages, such as Pascal and Ada, have been designed with features such as strong typing to increase the amount of error detection that can be done by the compiler. Syntax directed editors [11] also decrease the opportunity for the introduction of human error. Our paper describes some of the debugging assistance which can be provided to a user during the transformation of a program by an optimizing compiler. Our premise is that the additional information obtained during optimization could warrant the sole use of optimizing compilers during software development.
The Design and Implementation of a Fault-Tolerant RPC System: Ninf-C
Authors: Hidemoto Nakada, Satoshi Matsuoka, Yoshio Tanaka, Satoshi Sekiguchi
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

We describe the design and implementation of a fault tolerant GridRPC system, Ninf-C, designed for easy programming of large-scale master-worker programs that take from few days to few months for its execution in a Grid environment. Ninf-C employs Condor, developed at University of Wisconsin, as the underlying middleware supporting remote file transmission and checkpointing for system-wide robustness for application users on the Grid. Ninf-C layers all the GridRPC communication and task parallel programming features on top of Condor in a non-trivial fashion, assuming that the entire program is structured in a master-worker style-in fact, older Ninf master-worker programs can be run directly or trivially ported to Ninf-C. In contrast to the original Ninf, Ninf-C exploits and extends Condor features extensively for robustness and transparency, such as 1) checkpointing and stateful recovery of the master process, 2) the master and workers mutually communicating using (remote) files, not IP sockets, and 3) automated throttling of parallel GridRPC calls; and in contrast to using Condor directly, programmers can set up complex dynamic workflow as well as master-worker parallel structure with almost no learning curve involved. To prove the robustness of the system, we performed an experiment on a heterogeneous cluster that consists of x86 and SPARC CPUs, and ran a simple but long-running master-worker program with staged rebooting of multiple nodes to simulate some serious fault situations. The program execution finished normally avoiding all the fault scenarios, demonstrating the robustness of Ninf-C.
Supporting the Exploration and Use of Heritage Stories
Authors: Paul Mulholland, Zdenek Zdrahal, Trevor Collins
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Research and writing processes require the exploration, comprehension, synthesis and integration of information from multiple sources. Story Fountain provides intelligent support for the exploration of digital stories. The suite of functions provided in Story Fountain together support the investigation of questions and topics that require the accumulation, association or triangulation of information across the story archive. Story Fountain provides specific support toward this end such as for comparing and contrasting story concepts, the presentation of story paths between concepts, and mapping relationships across stories such as who met whom and who lived where.
An Algorithm for Web Service Discovery through Their Composition
Authors: Lerina Aversano, Gerardo Canfora, Anna Ciampi
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

The web services stack of standards is designed to supportthe reuse and the interoperation of software componentson the web. A critical step in the process of developingapplications based on the service oriented architecture isthe service discovery. This paper shows how servicecomposition can be used as a technique to support servicediscovery. The paper discusses the current state ofresearch in this area and introduces a semantic matchingalgorithm that exploits the possibility to compose multipleservices in order to satisfy a service request.
Multilingual and Multimedia Information Retrieval from Web Documents
Authors: Marta Gatius, Manuel Bertran, Horacio Rodriguez
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Web documents present new challenges to conventional Information Retrieval (IR) technologies. This paper describes how these challenges are faced in FameIR, a multilingual multimedia IR shell. In this shell Cross-Language IR (CLIR) and query expansion are performed using EuroWordNet (EWN), the best developed and most widely used lexical resource for several languages. Techniques to extract information from Web documents, Wrapper Generation (WG) techniques, are used to access a finer information granularity than the whole Web page. By combining IR and WG techniques with the use of EWN, FameIR provides a powerful facility to perform CLIR from multimedia Web documents.
Boundary Correct Real-Time Soft Shadows
Authors: Bjarke Jakobsen, Niels J. Christensen, Bent D. Larsen, Kim S. Petersen
Venue: Proceedings of the Computer Graphics International (2004)

This paper describes a method to determine correctshadow boundaries from an area light source using umbraand penumbra volumes. The light source is approximatedby a circular disk as this gives a fast way to extrudethe volumes. The method also gives a crude estimateof the visibility of the area light source as seenfrom a point in the shadow region. Instead of renderingthe volumes to the stencil buffer, we use an extendedshadow map - a so-called D-buffer, which among otherthings stores distances from the center of the light sourceto the umbra and penumbra volumes. The method issuited for implementation on most programmable hardware.Though some crude approximations are used inthe visibility function, the method can be used to producesoft shadows with correct boundaries in real time.
Optimization of Soft Real-Time Systems with Deadline Miss Ratio Constraints
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Both analysis and design optimization of real-timesystems has predominantly concentrated on consideringhard real-time constraints. For a large class ofapplications, however, this is both unrealistic and leads tounnecessarily expensive implementations. This paperaddresses the problem of task priority assignment and taskmapping in the context of multiprocessor applications withstochastic execution times and in the presence ofconstraints on the percentage of missed deadlines. Wepropose a design space exploration strategy based on TabuSearch together with a fast method for system performanceanalysis. Experiments emphasize the efficiency of theproposed analysis method and optimization heuristic ingenerating high quality implementations of soft real-timesystems with stochastic task execution times andconstraints on deadline miss ratios.
Design of MCQ test
Authors: William Fone
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This paper is concerned with the use of semiotics to improve the design of multiple choice question (MCQ) tests. Improving the feedback to candidates of MCQ tests by using a speech circuit that introduces autopoietic redundant information to filter noise is discussed.
Benchmarking The Dependability of Windows NT4, 2000 and XP
Authors: Ali Kalakech, Karama Kanoun, Yves Crouzet, Jean Arlat
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The aim of this paper is to compare the dependabilityof three operating systems (Windows NT4, Windows2000 and Windows XP) with respect to erroneousbehavior of the application layer. The results show asimilar behavior of the three OSs with respect torobustness and a noticeable difference in OS reactionand restart times. They also show that the applicationstate (mainly the hang and abort states) significantlyimpacts the restart time for the three OSs.
Counting polytopes via the Radon complex
Authors: Juan José Montellano-Ballesteros, Ricardo Strausz
Venue: Journal of Combinatorial Theory Series A (2004)

A convex polytope is the convex hull of a finite set of points. We introduce the Radon complex of a polytope--a subcomplex of an appropriate hypercube which encodes all Radon partitions of the polytope's vertex set. By proving that such a complex, when the vertices of the polytope are in general position, is homeomorphic to a sphere, we find an explicit formula to count the number of d-dimensional polytope types with d + 3 vertices in general position.
Incremental Placement for Timing Optimization
Authors: Wonjoon Choi, Kia Bazargan
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

An incremental timing driven placement algorithm is presented.We introduce a fast path-based analytical approach for timingimprovement. Our method achieves timing optimization byreducing the enclosing bounding boxes of selected nets oncritical paths. Furthermore, this technique tries to minimizemodifications to the initial placement while improving the delayof the circuit incrementally. Two contributions of this work are1) efficient conversion of a path-based timing minimizationproblem to a geometric net-constraint problem and 2) minimalmodification of a placement to improve timing. Our techniquecan take an initial placement from any algorithm and improvetiming iteratively. The experiments show that the proposedapproach is very efficient.
Boosted PRIM with Application to Searching for Oncogenic Pathway of Lung Cancer
Authors: Pei Wang, Young Kim, Jonathan Pollack, Robert Tibshirani
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Boosted PRIM (Patient Rule Induction Method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those Tree-Based methods ( [4] Ch9.3), seeking box-shaped regions in the feature space to separate different classes. Boosted PRIM is to implement PRIM-styled weak learners in Adaboost, one of the most popular boosting algorithms. In addition, we improve the performance of the algorithm by introducing a regularization to the boosting process, which supports the perspective of viewing boosting as a steepest-descent numerical optimization by Jerry Friedman [3]. The motivation for Boosted PRIM is to solve the problem of "searching for oncogenic pathways" based on array-CGH (Comparative Genomic Hybridization) data, though the algorithm itself is suitable for general classification problems. We illustrate the performance of the method through some simulation studies as well as an application on a lung cancer array-CGH data set.
Topological BDP Fault Simulation Method
Authors: Vladimir Hahanov, Irina Hahanova, Stanley Hyduke
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The topological backtracking deductive-parallel fault simulation method(TBDP) is offered. It lies in backtracking of defects on topology of the circuit. It is oriented on gate-level description of the circuits. According to it the set of reconvergent fan-outs and tree-like structures is being defined on the description of the device.
A Micro-payment Scheme for Multiple-Vendor in M-Commerce
Authors: Jianming Zhu, Ninghong Wang, Jianfeng Ma
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The micro-payment is an important technique in m-commerce (mobile commerce). Micro-payment refers to low-value financial transactions ranging from several cents to a few dollars. The cost of micro-payments should be kept as low as possible in order for the service provider to profit from the low-value transactions. In recent years, many micro-payment schemes have been proposed. But many of them don't apt to multiple-vendor. In this paper, we propose a micro-payment scheme that is able to apply to multiple-vendor for m-commerce. Our scheme satisfies the requirements of a payment system and is "cheap" in terms of computation costs, communication costs, and key management costs.
The Impact of Failure Management on the Stability of Communication Networks
Authors: C. Alvarez, M. Blesa, M. Serna
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this work we deal with communication networks inwhich links may fail. We propose an adversarial model fordescribing the traffic pattern occurring in this type of faultysystems and study properties concerning their stability, speciallyunder (non-trivial) underloaded worse-case scenarios.We show that, depending on how the system is organizedand prepared to deal with failures, the dynamics of thesystem change and thus the conditions for stability. We proposethree different ways of failure management and studyhow they influence on the stability of faulty communicationnetworks under the adversarial model proposed. We showthat some failure managements can provoke the instabilityof even very simple networks.
Intra-Chip Address-Presetting Data-Transfer Scheme Using Four-Valued Encoding
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This paper presents a new common-bus architecture forhigh-speed data transfer with transferring vast quantitiesof data between modules inside a VLSI chip. In the intrachipdata transfer, start addresses of the source and destinationmodules and the number of data are sent to thetarget modules at the .rst step, which is called "addresspresetting". After that, only the data are transferred withthe maximum width of the bus, which results in achievinghigh throughput of bus communication. Moreover, the useof multiple-valued data encoding together with a multiple-valuedcurrent-mode circuit technique for multi-level signaldetectors makes it possible to perform higher throughputof data transfer under the bus-width constraint. In case ofa 64-line bus, it is demonstrated that the peak throughputusing the proposed architecture is 8 times higher than thatusing a binary bus architecture based on direct memory accesscontrol. Its power dissipation is reduced to about 20percent in comparison with that of the direct memory accessone under the normalized throughput in a 0.18µm CMOS process.