ppxscal/embedding_network huggingface dataset:
Ant Colony Optimisation for Machine Layout Problems
Authors: Paul Corry, Erhan Kozan
Venue: Computational Optimization and Applications (2004)

Flexible machine layout problems describe the dynamic arrangement of machines to optimise the trade-off between material handling and rearrangement costs under changing and uncertain production environments. A previous study used integer-programming techniques to solve heuristically reduced versions of the problem. As an alternative, this paper introduces an ant colony optimisation (ACO) algorithm to generate good solutions. Experimental results are presented, with ACO obtaining better solutions than the reduction heuristic.
Hardware accelerated per-pixel displacement mapping
Authors: Johannes Hirche, Alexander Ehlert, Stefan Guthe, Michael Doggett
Venue: Proceedings of Graphics Interface 2004 (2004)

In this paper we present an algorithm capable of rendering a displacement mapped triangle mesh interactively on latest GPUs. The algorithm uses only pixel shaders and does not rely on adaptively adding geometry. All sampling of the displacement map takes place in the pixel shader and bi- or trilinear ltering can be applied to it, and at the same time as the calculations are done per pixel in the shader, the algorithm has automatic level of detail control. The triangles of the base mesh are extruded along the respective normal directions and then the resulting prisms are rendered by casting rays inside and intersecting them with the displaced surface. Two different implementations are discussed in detail.
Sharp thresholds For monotone properties in random geometric graphs
Authors: Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0,1]d, and connecting two points if their Euclidean distance is at most r, for some prescribed r. We show that monotone properties for this class of graphs have sharp thresholds by reducing the problem to bounding the bottleneck matching on two sets of $n$ points distributed uniformly in [0,1]d. We present upper bounds on the threshold width, and show that our bound is sharp for d = 1 and at most a sublogarithmic factor away for d ≥ 2. Interestingly, the threshold width is much sharper for random geometric graphs than for Bernoulli random graphs. Further, a random geometric graph is shown to be a subgraph, with high probability, of another independently drawn random geometric graph with a slightly larger radius; this property is shown to have no analogue for Bernoulli random graphs.
Coordinated Search and Track by Multiple Phased Array Radars
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

This paper addresses the search and track coordinationproblems of multiple shipboard radars. The proposed approachfirst exploits the physical characteristics of a singlephased array radar to improve its effective capacity. Its effectivecapacity is abstracted by a closed-form equation calleda schedulability envelope. Using the schedulability envelopefor each radar, we deal with search and track coordinationas a relative-load-balancing problem in a multi-resource environment.The simulation results show that the proposed approachsignificantly improves the overall capacity of a multi-shipmulti-radar system.
Finding paths and cycles of superpolylogarithmic length
Authors: Harold N. Gabow
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Let l be the number of edges in a longest cycle containing a given vertex v in an undirected graph. We show how to find a cycle through v of length (Ω(√ log l, log log l)) in polynomial time. This implies the same bound for the longest cycle, longest vw-path and longest path. The previous best bound for longest path is length Ω((log l )2/, log log l) due to Björklund and Husfeldt. Our approach, which builds on Björklund and Husfeldt's, uses cycles to enlarge cycles. This self-reducibility allows the approximation method to be iterated.
Prediction and indexing of moving objects with unknown motion patterns
Authors: Yufei Tao, Christos Faloutsos, Dimitris Papadias, Bin Liu
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Existing methods for peediction spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice movement is more complex, and individual objects may follow drastically diffferent motion patterns. In order to overcome these problems, we first introduce a general framework for monitoring and indexing moving objects, where (i) each boject computes individually the function that accurately captures its movement and (ii) a server indexes the object locations at a coarse level and processes queries using a filter-refinement mechanism. Our second contribution is a novel recursive motion function that supports a broad class of non-linear motion patterns. The function does not presume any a-priori movement but can postulate the particular motion of each object by examining its locations at recent timestamps. Finally. we propse an efficient indexing scheme that faciliates the processing of predicitive queries without false misses.
Barrier synchronisation: Axiomatisation and relaxation
Authors: A. Stewart, M. Clint, J. Gabarr&#x00f3;
Venue: Formal Aspects of Computing (2004)

The bulk synchronous parallel (BSP) model is underpinned by a global synchronisation operation. This operation both synchronises processes and updates local stores using asynchronous communications. In this paper a generalised, nondeterministic, substitution axiom (over functions) is identified with BSP barrier synchronisation. Correctness proofs of BSP programs based on the axiom are structurally similar to proofs of correctness of sequential programs. Global synchronisation is often considered to be relatively expensive to implement on distributed architectures for applications having low levels of communications. In an extreme situation a process having no external interactions may have to wait unnecessarily at a barrier. In this paper a form of barrier operation is introduced which is straightforward to reason about and, with a view to increasing the potential for efficient implementation, permits barrier operations to be relaxed through partial uncoupling thereby allowing processes which do not need to synchronise to proceed.
LITESET/A++: A New Agent-Assisted Secure Payment Protocol
Authors: Yan Wang, Tieyan Li
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

In this paper, we proposed a new agent-assisted secure payment protocol LITESET/A++, which aims at enabling the dispatched consumer-agent to choose the "best" one after negotiating with merchants to close a deal, autonomously sign contracts and make the payment on behalf of the cardholder without the possibility of disclosing any secret to any participant. This is realized by adopting the Signature-Share and Signcryption-Share schemes, and employing a Trusted Third Party (TTP). In LITESET/A++, the principle that each participant knows what is strictly necessary for his/her role is followed as in SET payment protocol while the non-repudiation property is improved.
Recurrence Time Statistics: Versatile Tools for Genomic DNA Sequence Analysis
Authors: Yinhe Cao, Wen-wen Tung, J. B. Gao
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

With the completion of the human and a few model organismsý genomes, and the genomes of many other organisms waiting to be sequenced, it has become increasingly important to develop faster computational tools which are capable of easily identifying the structures and extracting features from DNA sequences. One of the more important structures in a DNA sequence is repeat-related. Often they have to be masked before protein coding regions along a DNA sequence are to be identified or redundant expressed sequence tags (ESTs) are to be sequenced. Here we report a novel recurrence time based method for sequence analysis. The method can conveniently study all kinds of periodicity and exhaustively find all repeat-related features from a genomic DNA sequence. An efficient codon index is also derived from the recurrence time statistics, which has the salient features of being largely species-independent and working well on very short sequences. Efficient codon indices are key elements of successful gene finding algorithms, and are particularly useful for determining whether a suspected EST belongs to a coding or non-coding region. We illustrate the power of the method by studying the genomes of E. coli, the yeast S. cervisivae, the nematode worm C. elegans, and the human, Homo sapiens. Computationally, our method is very efficient. It allows us to carry out analysis of genomes on the whole genomic scale by a PC.
Web services for the people
Authors: Win Treese
Venue: netWorker (2002)

I don't know about you, but sometimes I have trouble remembering when my library books are due. Of course, it can get complicated with several people in the family checking out books and more than one library account. A long time ago, when all you checked out of a library were books, they usually had the same due date. Books were due every two weeks like clockwork. But libraries have changed. Besides books, you can get CDs, DVDs, rental books, audio tapes, and more, each with its own lending period. How to keep track?
Reasoning with infinite stable models
Authors: Piero A. Bonatti
Venue: Artificial Intelligence (2004)

This paper illustrates extensively the theoretical properties, the implementation issues, and the programming style underlying finitary programs. They are a class of normal logic programs whose consequences under the stable model semantics can be effectively computed, despite the fact that finitary programs admit function symbols (hence infinite domains) and recursion. From a theoretical point of view, finitary programs are interesting because they enjoy properties that are extremely unusual for a nonmonotonic formalism, such as compactness. From the application point of view, the theory of finitary programs shows how the existing technology for answer set programming can be extended from problem solving below the second level of the polynomial hierarchy to all semidecidable problems. Moreover, finitary programs allow a more natural encoding of recursive data structures and may increase the performance of credulous reasoners.
Clinical Decision Support with IM-Agents and ERMA Multi-agents
Authors: Susan L. Mabry, Caleb R. Hug, Russell C. Roundy
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

IM-Agents (Intelligent Monitoring Agents) provides a system infrastructure andproof of concept applications demonstrating meaningful diagnosis and interventionadvice for healthcare personnel. The problem domain is extremely complex, withuncertainties and interdependencies. The monitored environment for a patient iscomprised of a number of influences from numerous sources involving asynchronous,dynamic changes. Agents act as a collaborative team of specialists. Data isdynamically collected, filtered and integrated. Dynamic inference is accomplishedwithin agents through a hybrid approach of Fuzzy Logic, Causal Bayesian networks,trend analysis and qualitative logic. Emergency Medical Assistant (ERMA) componentsdemonstrate the system for the trauma environment with particular emphasis on typesof shock and stabilization of arterial blood gases. This approach for clinical decisionsupport systems shows promise for a number of critical care scenarios.
Consumer acceptance of virtual stores: a theoretical model and critical success factors for virtual stores
Authors: Lei-da Chen, Mark L. Gillenson, Daniel L. Sherrell
Venue: ACM SIGMIS Database (2004)

Virtual stores provide great efficiency in the retail value chain, and their existence has tremendously paved the way for the diffusion of electronic commerce. Understanding the determinants of consumer acceptance of virtual stores will provide important theoretical contributions to the area of business-to-consumer (B-to-C) electronic commerce and lead to the development of more effective and meaningful strategies for virtual stores. By expanding the Technology Acceptance Model and the Innovation Diffusion Theory, this study aims to provide an integral theoretical paradigm that can successfully support a wide array of technical, business, and consumer issues involved in online retailing. The results from a Web-based survey of 253 online consumers indicate that the proposed theoretical model is able to explain and predict consumer acceptance of virtual stores substantially well. The resulting theoretical model explains a large portion of the factors that lead to a user's behavioral intention to use and actual use of a virtual store. In addition to providing new theoretical grounds for studying the virtual store phenomenon, this article also supplies virtual stores with a number of operative critical success factors to remain competitive in the volatile electronic marketplace.
Modelling and Animating Cartoon Hair with NURBS Surfaces
Authors: Paul Noble, Wen Tang
Venue: Proceedings of the Computer Graphics International (2004)

In this paper we present a technique for themodelling and animation of cartoon hair. In ourapproach the primary shape and motion of the hair isdefined by an animated NURBS volume, along whosesurface are generated clumps of hair geometry. Thebasis of these hair clumps is formed by key hair curvesthat are grown along the isocurves of the originatingsurface and which follow its motion. Particle dynamicsare applied to each key hair and blended with initialanimation using springs. Profile curves are thenextruded along the length of the key hairs to create thegeometry details of the hairdo. The finished animatedhairdo is rendered non-photorealistically in cartoonstyle shading.
The Business Model and Risk Control of Warehouse Financing in China
Authors: Feng Gengzhong, Yu Yang, Zhao Wenyan, Wang Simiao
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

In recent years, the warehouse financing business sets the example of various industries integration and becomes a new prospective bud in the financial supply chain management in China. The origin and importance of the warehouse financing business are firstly analyzed in the paper. Two models of such business are described. One is the warehouse financing based on authorities/claims mortgage, and the other is the warehouse financing based on flowing stocks mortgage. The risks and their control of the business are finally studied.
XML in the middle: XQuery in the WebLogic Platform
Authors: Michael J. Carey
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

The BEA WebLogic Platform product suite consists of WebLogic Server, WebLogic Workshop, WebLogic Integration, WebLogic Portal, and Liquid Data for WebLogic. W3C standards including XML, XML Schema, and the emerging XML query language XQuery play important roles in several of these products. This industrial presentation will discuss the increasingly central role of XML in the middle tier of enterprise IT architectures and cover some of the key XML technologies that the BEA WebLogic Platform provides for creating enterprise applications in today's IT world. We focus in particular on how XQuery fits into this picture, both for today's WebLogic Platform 8.1 and going forward in terms of the Platform roadmap.
Contraction Graphs for Representation and Analysis of RNA Secondary Structure
Authors: Chris H. Q. Ding, Richard F. Meraz, Xiaofeng He, Stephen R. Holbrook
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We introduce the contraction graph as a novel graphical representation of RNA secondary structure. A contraction operation ¿ defined along base pars, single stranded regions, and tertiary interactions ¿ allows for representing RNA secondary structure at different levels of detail. Directionality of the graph and flow conservation of the contraction operation allow for explicit representation of the 5' and 3' ends of the molecule. Furthermore, existing representations such as tree and dual graphs are specific instances in this framework. We anticipate that this unified representation will facilitate automated motif finding and functional classification based on direct searches and comparisons of RNA secondary structure topology.
Coarse projective kMC integration: forward/reverse initial and boundary value problems
Authors: R. Rico-Martínez, C. W. Gear, Ioannis G. Kevrekidis
Venue: Journal of Computational Physics (2004)

In "equation-free" multiscale computation a dynamic model is given at a fine, microscopic level; yet we believe that its coarse-grained, macroscopic dynamics can be described by closed equations involving only coarse variables. These variables are typically various low-order moments of the distributions evolved through the microscopic model. We consider the problem of integrating these unavailable equations by acting directly on kinetic Monte Carlo microscopic simulators, thus circumventing their derivation in closed form. In particular, we use projective multi-step integration to solve the coarse initial value problem forward in time as well as backward in time (under certain conditions). Macroscopic trajectories are thus traced back to unstable, source-type, and even sometimes saddle-like stationary points, even though the microscopic simulator only evolves forward in time. We also demonstrate the use of such projective integrators in a shooting boundary value problem formulation for the computation of "coarse limit cycles" of the macroscopic behavior, and the approximation of their stability through estimates of the leading "coarse Floquet multipliers".
Issues in High-Speed Internet Security
Authors: Peder Jungck, Simon S. Y. Shim
Venue: Computer (2004)

Over the past decade, the threat of computer worms and viruses has grown from a nuisance to perhaps the greatest obstacle to the Internet's growth and reliability. Trends in worm and virus delivery mechanisms and infection speed have also changed. Today, too often the first sign of a virus is that a part of the network goes down. Flash worms such as SQL Slammer have paved the way for future worms to carry payloads that directly target their victims and wreak havoc on government, business, and societal structures.To address both the threats facing networks today and future scalability demands, we need newsecurity methodologies, deployment strategies, systems, and architectures. New breeds of systems based on innovative processing components will help achieve flexible line rate high-speed security over time.
Issues and strategies for the physical design of system-on-a-chip ASICs
Authors: T. R. Bednar, P. H. Buffet, R. J. Darden, S. W. Gould, P. S. Zuchowski
Venue: IBM Journal of Research and Development (2002)

The density and performance of advanced silicon technologies have made system-on-a-chip ASICs possible. SoCs bring together a diverse set of functions and technology features on a single die of enormous complexity. The physical design of these complex ASICs requires a rich set of functional elements that integrate efficiently with a set of design flows and tools productive enough to meet product requirements successfully, without consuming more time or design resources than a simpler design. The architecture described, including functional libraries and physical design conventions, enables the creation of multiple SoC ASIC designs from a common infrastructure that addresses silicon integration, electrical robustness, and packaging challenges. An implementation strategy follows from this design infrastructure that includes hierarchical design concepts, placement, routing, and verification processes.
On Infinite Cycles II
Authors: Reinhard Diestel, Daniela K&#x00fc;hn
Venue: Combinatorica (2004)

We adapt the cycle space of a finite or locally finite graph to graphs with vertices of infinite degree, using as cycles the homeomorphic images of the unit circle S1 in the graph together with its ends. We characterize the spanning trees whose fundamental cycles generate this cycle space, and prove infinite analogues to the standard characterizations of finite cycle spaces in terms of edge-decomposition into single cycles and orthogonality to cuts.
Query sampling in DB2 Universal Database
Authors: Jarek Gryz, Junjie Guo, Linqi Liu, Calisto Zuzarte
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Executing ad hoc queries against large databases can be prohibitively expensive. Exploratory analysis of data may not require exact answers to queries, however: results based on sampling the data are often satisfactory. Supporting sampling as a primitive SQL operator turns out to be difficult because sampling does not commute with many SQL operators.In this paper, we describe an implementation in IBM&reg; DB2&reg; Universal Database (UDB) of a sampling operator that commutes with some SQL operators. As a result, the query with the sampling operator always returns a random sample of the answers and in many cases runs faster than it would have without such an operator.
Hardware-Assisted Simulation and Evaluation of IP Cores Using FPGA-Based Rapid Prototyping Boards
Authors: Rawat Siripokarpirom, Friedrich Mayer-Lindenberg
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

This paper presents a methodology for incorporating intellectualproperty (IP) cores that are implemented withSRAM-based FPGA logic into an existing hardware simulationenvironment for functional simulation and evaluationpurposes, using a simple serial communication interfacebased on the IEEE 1149.1 standard (also known asJTAG) with minimal hardware requirements. We also describea prototype software/hardware implementation of theproposed approach and present a case study to demonstratethe feasibility of our approach.
Reducing the Number of Preemptions in Fixed Priority Scheduling
Authors: Radu Dobrin, Gerhard Fohler
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Fixed priority scheduling (FPS) has been widely studiedand used in a number of applications, mostly due to itsflexibility, simple run-time mechanism and small overhead.However, preemption related overhead in FPS may causeundesired high processor utilization, high energy consumption,or, in some cases, even infeasibility.In this paper, we propose a method to reduce the numberof preemptions in legacy FPS systems consisting oftasks with priorities, periods and offsets. Unlike other approaches,our algorithm does not require modification of thebasic FPS mechanism. Our method analyzes off-line a setof periodic tasks scheduled by FPS, detects the maximumnumber of preemptions that can occur at run-time, and reassignstask attributes such that the tasks are schedulableby the same scheduling mechanism, while achieving a significantlylower number of preemptions.In some cases, there is a cost to pay for a lower numberof preemptions in terms of increased amount of tasks and/orreduced task execution flexibility. Our method provides forthe ability to choose a user-defined number of preemptionswith respect to the cost to pay.