ppxscal/embedding_network huggingface dataset:
Iterative inversion of structured matrices
Authors: Victor Y. Pan, Marc Van Barel, Xinmao Wang, Gianni Codevico
Venue: Theoretical Computer Science (2004)

Iterative processes for the inversion of structured matrices can be further improved by using a technique for compression and refinement via the least-squares computation. We review such processes and elaborate upon incorporation of this technique into the known frameworks.
A Search Engine for RDF Metadata
Authors: Torsten Priebe, Christian Schlager, Gunther Pernul
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper presents a search engine for RDF metadata. Existing search facilities in this environment only support exact queries. We argue that a fuzzy approach as known from classic (full-text) Information Retrieval, providing fuzzy result sets ranked by relevance, is also desirable for metadata-based searches. Consequently, we develop an Information Retrieval model based on the similarity of RDF descriptions. The role of an ontology and implicit information that can be inferred from it will be discussed and the implementation within a knowledge portal prototype will be presented.
Feature selection for text categorization on imbalanced data
Authors: Zhaohui Zheng, Xiaoyun Wu, Rohini Srihari
Venue: ACM SIGKDD Explorations Newsletter (2004)

A number of feature selection metrics have been explored in text categorization, among which information gain (IG), chi-square (CHI), correlation coefficient (CC) and odds ratios (OR) are considered most effective. CC and OR are one-sided metrics while IG and CHI are two-sided. Feature selection using one-sided metrics selects the features most indicative of membership only, while feature selection using two-sided metrics implicitly combines the features most indicative of membership (e.g. positive features) and non-membership (e.g. negative features) by ignoring the signs of features. The former never consider the negative features, which are quite valuable, while the latter cannot ensure the optimal combination of the two kinds of features especially on imbalanced data. In this work, we investigate the usefulness of explicit control of that combination within a proposed feature selection framework. Using multinomial na&iuml;ve Bayes and regularized logistic regression as classifiers, our experiments show both great potential and actual merits of explicitly combining positive and negative features in a nearly optimal fashion according to the imbalanced data.
Fault Detection and Isolation Techniques for Quasi Delay-Insensitive Circuits
Authors: Christopher LaFrieda, Rajit Manohar
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper presents a novel circuit fault detectionand isolation technique for quasi delay-insensitive asynchronouscircuits. We achieve fault isolation by a combinationof physical layout and circuit techniques. Theasynchronous nature of quasi delay-insensitive circuitscombined with layout techniques makes the design tolerantto delay faults. Circuit techniques are used to makesections of the design robust to non-delay faults. The combinationof these is an asynchronous defect-tolerant circuitwhere a large class of faults are tolerated, and the remainingfaults can be both detected easily and isolated to asmall region of the design.
A TeXQuery-based XML full-text search engine
Authors: Chavdar Botev, Sihem Amer-Yahia, Jayavel Shanmugasundaram
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

We demonstrate an XML full-text search engine that implements the TeXQuery language. TeXQuery is a powerful full-text search extension to XQuery that provides a rich set of fully composable full-text primitives, such as phrase matching, proximity distance, stemming and thesauri. TeXQuery enables users to seamlessly query over both structure data and text, by embedding full-text primitives in XQuery and vice versa. TeXQuery also supports a flexible scoring construct that scores query results based on full-text predicates and permits top-k queries. TeXQuery is the precursor of the full-text language extension to XPath 2.0 and XQuery 1.0 currently being developed by W3C.
Solvable Group Isomorphism is (almost) in NP " CoNP
Authors: V. Arvind, Jacobo Toran
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

The Group Isomorphism problem consists in decidingwhether two input groups G_1 and G_2 givenby their multiplication tables are isomorphic. Wefirst give a 2-round Arthur-Merlin protocol for theGroup Non-Isomorphism problem such that on inputgroups (G_1,G_2) of size n, Arthur uses O(log^6 n)random bits and Merlin uses O(log^2 n) nondeterministicbits. We derandomize this protocol for thecase of solvable groups showing the following tworesults:(a) We give a uniform NP machine for solvableGroup Non-Isomorphism, that works correctlyon all but 2^polylog(n) inputs of any length n.Furthermore, this NP machine is always correctwhen the input groups are nonisomorphic.The NP machine is obtained by an unconditionalderandomization of the AM protocol.(b) Under the assumption that EXP ¿ i.o.PSPACE we get a complete derandomization of the above AM protocol. Thus,EXP ¿ i.o.PSPACE implies that Group Isomorphismfor solvable groups is in NP ¿ coNP.
Generating G^1 Fonts Using Cubic Ball Functions with Weight
Authors: A. R. M. Piah, P. C. Chew
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

This paper explores the construction method proposed by Said [9], using basis functions which are derived from basis functions of Bezier and Ball. This method reduces to Bezier and Ball respectively by choosing suitable parameters (weight) for the Said case. The properties of the generated curves will be given in order to construct fonts which satisfy tangent plane continuity. Constructed curves and fonts using suitable weight will be displayed.
Design and Verification of Parallel Multipliers Using Arithmetic Description Language: ARITH
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This paper proposes the basic concept of arithmetic description language called ARITH. The use of ARITH makes possible (i) formal description of arithmetic algorithms including those using unconventional number systems, (ii) formal verification of described arithmetic algorithms, and (iii) translation of arithmetic algorithms to equivalent HDL codes. In this paper, we demonstrate the potential of ARITH through an experimental design of parallel multipliers using binary signed-digit number system.
Semiregular Pentagonal Subdivisions
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Triangular and quadrilateralmeshes are commonly usedin computer graphics applications. In this paper, we analyzethe topological existence of meshes that consist of n-sidedfaces where n is greater than 4 such as pentagonaland hexagonal meshes. We show that it is possible to representany 2-manifold with a mesh that is made up of onlypentagons. We also show that the meshes that consist ofonly polygons with more than five sides cannot represent all2-manifolds.We present a pentagonalization (or pentagonal conversion)scheme that can create a pentagonal mesh from anyarbitrary mesh structure. We also introduce a pentagonalpreservation scheme that can create a pentagonal meshfrom any pentagonal mesh.
Convergence of Web Services, Grid Services and Business Processes
Authors: Donald F. Ferguson
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

The "Grid" and "Web services" are two of the fastest growing and most discussed areas in academic and commercial computing literature. Mergers, acquisition, partnerships and economic dynamics are driving commercial investment in business process (re)-engineering. This talk will discuss the recent and important convergence of many of these concepts into enterprise service architectures, which are forming the base for the next generation ofcommercial and academic distributed computing.
Energy-Aware Fault Tolerance in Fixed-Priority Real-Time Embedded Systems
Authors: Ying Zhang, Krishnendu Chakrabarty, Vishnu Swaminathan
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We investigate an integrated approach to fault tolerance anddynamic power management in real-time embedded systems. Faulttolerance is achieved via checkpointing and power management iscarried out using dynamic voltage scaling (DVS). We presentfeasibility-of-scheduling tests for checkpointing schemes for aconstant processor speed as well as for variable processor speeds.DVS is then carried out on the basis of these feasibility analyses.Experimental results show that compared to fault-obliviousmethods, the proposed approach significantly reduces powerconsumption and guarantees timely task completion in the presence of faults.
An empirical investigation of decision-making satisfaction in web-based decision support systems
Authors: Pratyush Bharati, Abhijit Chaudhury
Venue: Decision Support Systems (2004)

Web-based information systems are increasingly being used for decision support applications. However, few empirical studies have been conducted on web-based decision support systems (DSS). This experimental research endeavors to understand factors that impact decision-making satisfaction in web-based decision support systems. Using structural equation modeling (SEM) approach, the analysis reveals that information quality and system quality influence decision-making satisfaction, while information presentation does not have an effect on decision-making satisfaction.
Kinetic schemes for the relativistic gas dynamics
Authors: Matthias Kunik, Shamsul Qamar, Gerald Warnecke
Venue: Numerische Mathematik (2004)

A kinetic solution for the relativistic Euler equations is presented. This solution describes the flow of a perfect gas in terms of the particle density n, the spatial part of the four-velocity u and the inverse temperature &#x03b2;. In this paper we present a general framework for the kinetic scheme of relativistic Euler equations which covers the whole range from the non-relativistic limit to the ultra-relativistic limit. The main components of the kinetic scheme are described now. (i) There are periods of free flight of duration &#x03c4;M, where the gas particles move according to the free kinetic transport equation. (ii) At the maximization times tn=n&#x03c4;M, the beginning of each of these free-flight periods, the gas particles are in local equilibrium, which is described by J&#x00fc;ttners relativistic generalization of the classical Maxwellian phase density. (iii) At each new maximization time tn>0 we evaluate the so called continuity conditions, which guarantee that the kinetic scheme satisfies the conservation laws and the entropy inequality. These continuity conditions determine the new initial data at tn. iv If in addition adiabatic boundary conditions are prescribed, we can incorporate a natural reflection method into the kinetic scheme in order to solve the initial and boundary value problem. In the limit &#x03c4;M&#x2192;0 we obtain the weak solutions of Euler&#x2019;s equations including arbitrary shock interactions. We also present a numerical shock reflection test which confirms the validity of our kinetic approach.
A Method for Presenting High Resolution, Archaeological 3D Scan Data in a Narrative Context
Authors: Tim Redfern, Eoin Kilfeather
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper outlines a methodology and workflow used to produce interactive 3D components for web applications. The method is prototyped in the 'Explorer' content management tools, an ontological database of archaeological information developed as part of 'CIPHER', IST project. The method uses high resolution 3D laser scans produced in situ and photographic texture and reference information captured simultaneously. The method introduces techniques from the domain of 3D gaming to produce interactive walkthroughs of heritage sites optimised for web delivery. The 3D presentation method described in the paper allows users of the walkthrough tointeract with the underlying knowledge base of archaeological information. Nodes within the 3D scene are used to activate dynamic hyperlinked queries of the ontology database. This method allows features in the scene to act as queries against a thesaurus of archaeological terms and for associated descriptive narratives associated with those terms. A novel way of optimising 3D scanned data is used, involving 'baking' an image of the full 3D scanned model onto a lower detail 'decimated' version. This approach has the potential to make 3D scanned data more useful in applications like archaeology where it is desirable, but computationally difficult to depict monuments and objects at the full resolution of the original scan.
Numerical simulation of dendritic solidification with convection: three-dimensional flow
Authors: Nabeel Al-Rawahi, Gretar Tryggvason
Venue: Journal of Computational Physics (2004)

A numerical method for the simulation of the effect of melt flow on the three-dimensional growth of a dendrite is described. The method is an extension of the technique for two-dimensional flow described in Al-Rawahi and Tryggvason [J. Comput. Phys. 180 (2002) 471] and is based on the explicit tracking of connected marker points that describe the liquidsolid interface. An explicit projection method is used to solve the energy and the Navier-Stokes equations on a regular stationary grid and the solidified region is represented by setting the velocities in the solid phase to zero. The latent heat released during solidification is calculated using the normal temperature gradient near the interface. The method is validated by a comparison with an exact solution for a Stefan problem and a grid refinement study. The simulations show that the speed of a dendrite arm growing into the flow is increased due to an increase in the temperature gradient on the upstream side and the formation of side branches is promoted, as in two-dimensions. The effect of the flow on the growth of dendrite arms growing in the downstream direction is smaller than in two-dimensions, due to a smaller wake.
Specification prototyping
Authors: Glenn H. MacEwen
Venue: ACM SIGSOFT Software Engineering Notes (1982)

The use of an explicit life cycle model for prototyping is argued for three major benefits: First, the discipline promotes correctness via the constructive approach as with production systems. Second, the levels of specification at which prototyping is to be carried out are made explicit. Third, the methods and tools to be used for the production system can be exercised and evaluated.
Dynamic Generation of Database Tables for Genetic Data
Authors: Csaba J. Egyhazy
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

In this paper, we report on the development of a software tool that will accept an XMLfile containing genetic data and dynamically generate database tables in which to load thedata. Two recent developments lead us to develop such a tool. First, an increasingnumber of traditional clinical researchers want access to genetic data. Secondly,researchers want the ability to load the genetic data into a relational database for queryingpurposes. In addition, genetic data stored in relational databases can easily be joined withother related data stored in table form.
Locating the tightest link of a network path
Authors: Dalu Zhang, Weili Huang, Chen Lin
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

The tightest link of a network path is the link where the end-to-end available bandwidth is limited. We propose a new probe technique, called Dual Rate Periodic Streams (DRPS), for finding the location of the tightest link. A DRPS probe is a periodic stream with two rates. Initially, it goes through the path at a comparatively high rate. When arrived at a particular link, the probe shifts its rate to a lower level and keeps the rate. If proper rates are set to the probe, we can control whether the probe is congested or not by adjusting the shift time. When the point of rate shift is in front of the tightest link, the probe can go through the path without congestion, otherwise congestion occurs. Thus, we can find the location of the tightest link by congestion detection at the receiver.
A Comparative Study of Spatial Indexing Techniques for Multidimensional Scientific Datasets
Authors: Beomseok Nam, Alan Sussman
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Scientific applications that query into very large multi-dimensionaldatasets are becoming more common. Thesedatasets are growing in size every day, and are becomingtruly enormous, making it infeasible to index individualdata elements. We have instead been experimenting withchunking the datasets to index them, grouping data elementsinto small chunks of a fixed, but dataset-specific, sizeto take advantage of spatial locality. While spatial indexingstructures based on R-trees perform reasonably well forthe rectangular bounding boxes of such chunked datasets,other indexing structures based on KDB-trees, such as Hybridtrees, have been shown to perform very well for pointdata. In this paper, we investigate how all these indexingstructures perform for multidimensional scientific datasets,and compare their features and performance with that ofSH-trees, an extension of Hybrid trees, for indexing multi-dimensionalrectangles. Our experimental results show thatthe algorithms for building and searching SH-trees outperformthose for R-trees, R*-trees, and X-trees for both realapplication and synthetic datasets and queries. We showthat the SH-tree algorithms perform well for both low andhigh dimensional data, and that they scale well to high dimensionsboth for building and searching the trees.
Statistical Clock Skew Analysis Considering Intra-Die Process Variations
Authors: Aseem Agarwal, David Blaauw, Vladimir Zolotov
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

With shrinking cycle times, clock skew has become an increasinglydifficult and important problem for high performance designs.Traditionally, clock skew has been analyzed using case-files whichcannot model intra-die process variations and hence result in a veryoptimistic skew analysis. In this paper, we present a statistical skewanalysis method to model intra-die process variations. We firstpresent a formal model of the statistical clock skew problem and thenpropose an algorithm which is based on propagation of joint probabilitydistribution functions in a bottom up fashion in a clock tree.The analysis accounts for topological correlations between pathdelays and has linear run time with the size of the clock tree. Theproposed method was tested on several large clock tree circuits,including a clock tree from a large industrial high-performancemicroprocessor. The results are compared with Monte Carlo simulationfor accuracy comparison and demonstrate the need for statisticalanalysis of clock skew.
Hopf bifurcation in bidirectional associative memory neural networks with delays: analysis and computation
Authors: Lin Wang, Xingfu Zou
Venue: Journal of Computational and Applied Mathematics (2004)

In addition to giving some delay-independent conditions for global stability of the bidirectional associative memory neural networks with delays, we perform analysis of local stability and Hopf bifurcation. We also work out an algorithm for determining the direction and stability of the bifurcated periodic solutions.
A Single-Electron-Transistor Logic Gate Family and Its Application " Part II: Design and Simulation of a 7-3 Parallel Counter with Linear Summation and Multiple-Valued Latch Functions
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

Guidelines for designing multi-input multi-outputcounters based on single-electron transistor (SET) logicgate family are presented. A counter consisting of aninverting adder, latched multiple-valued (MV) quantizer,and periodic literals can be made extremely compactowing to the high functionality of SETs and a specificdesign that utilizes limited kinds of transistors and doesnot require SETs with control gates or devices for levelshifting. Circuit simulation using a physics-based SETmodel reveals that the counter operates at a moderatelyhigh speed and with ultra-low power consumption.
Using nondeterminism to amplify hardness
Authors: Alexander Healy, Salil Vadhan, Emanuele Viola
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC '02). We prove that if NP has a balanced function f such that any circuit of size s(n) fails to compute f on a 1/poly(n) fraction of inputs, then NP has a function f′ such that any circuit of size s′(n)=s(√n)Ω(1) fails to compute f′ on a 1/2 - 1/s′(n) fraction of inputs. In particular, 1. If s(n)=nω(1), we amplify to hardness 1/2-1/nω(1). 2. If s(n)=2nω(1), we amplify to hardness 1/2-1/2nΩ(1). 3. If s(n)=2(n), we amplify to hardness 1/2-1/2 Ω(sqrtn).These improve the results of O'Donnell, which only amplified to 1/2-1/√n. O'Donnell also proved that no construction of a certain general form could amplify beyond 1/2-1/n. We bypass this barrier by using both derandomization and nondeterminism in the construction of f′.We also prove impossibility results demonstrating that both our use of nondeterminism and the hypothesis that f is balanced are necessary for "black-box" hardness amplification procedures (such as ours).
Approximating extent measures of points
Authors: Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
Venue: Journal of the ACM (JACM) (2004)

We present a general technique for approximating various descriptors of the extent of a set P of n points in Rd when the dimension d is an arbitrary fixed constant. For a given extent measure &mu; and a parameter &epsiv; > 0, it computes in time O(n + 1/&epsiv;O(1)) a subset Q &sube; P of size 1/&epsiv;O(1), with the property that (1 &minus; &epsiv;)&mu;(P) &le; &mu;(Q) &le; &mu;(P). The specific applications of our technique include &epsiv;-approximation algorithms for (i) computing diameter, width, and smallest bounding box, ball, and cylinder of P, (ii) maintaining all the previous measures for a set of moving points, and (iii) fitting spheres and cylinders through a point set P. Our algorithms are considerably simpler, and faster in many cases, than previously known algorithms.
Bi-criteria algorithm for scheduling jobs on cluster platforms
Authors: Pierre-François Dutot, Lionel Eyraud, Grégory Mounié, Denis Trystram
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of processors. The main feature is to consider two criteria that are optimized together. These criteria are the makespan and the weighted minimal average completion time (minsum). They are chosen for their complementarity, to be able to represent both user-oriented objectives and system administrator objectives.We propose an algorithm based on a batch policy with increasing batch sizes, with a smart selection of jobs in each batch. This algorithm is assessed by intensive simulation results, compared to a new lower bound (obtained by a relaxation of ILP) of the optimal schedules for both criteria separately. It is currently implemented in an actual real-size cluster platform.