ppxscal/embedding_network huggingface dataset:
Reductions between Disjoint NP-Pairs
Authors: Christian Glaser, Alan L. Selman, Samik Sengupta
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

Razborov [Raz94] proved that existence of an optimalproof system implies existence of a many-one complete disjointNP-pair. Köbler, Messner, and Torán [KMT03] de-fined a stronger form of many-one reduction and claimedto improve Razborov's result by showing under the sameassumption that there is a strongly many-one complete disjointNP-pair. Here we show that the two results are equivalent.More generally, we prove that all of the followingassertions are equivalent: There is a many-one completedisjoint NP-pair; there is a strongly many-one completedisjoint NP-pair; there is a Turing complete disjoint NPpairsuch that all reductions are smart reductions; there is acomplete disjoint NP-pair for one-to-one, invertible reductions;the class of all disjoint NP-pairs is uniformly enumerable.Let A, B, C, and D be nonempty sets belonging to NP.A smart reduction between the disjoint NP-pairs (A,B)and (C,D) is a Turing reduction with the additional propertythat if the input belongs to A ¿ B, then all queries belongto C ¿ D. We prove under the reasonable assumptionUP ¿ co-UP has a P-bi-immune set that there exist disjointNP-pairs (A,B) and (C,D) such that (A,B) is truth-tablereducible to (C,D), but there is no smart reduction betweenthem. This paper contains several additional separations ofreductions between disjoint NP-pairs.We exhibit an oracle relative to which DisjNP has atruth-table-complete disjoint NP-pair, but has no many-one-complete disjoint NP-pair.
On the cube free number sequences
Authors: Zhu Weiyi
Venue: Smarandache Notions Journal (2004)

The main purpose of this paper is to study the asymptotic property of the cube free numbers, and obtain some interesting asymptotic formulas.
Circular arrangements and cyclic broadcast scheduling
Authors: Vincenzo Liberatore
Venue: Journal of Algorithms (2004)

Motivated by a scheduling problem in multicast environments, we consider the problem of arranging a weighted graph around a circle so as to minimize the total weighted arc length. We describe the first polynomial-time approximation algorithms for this problem, and specifically an O(log n)- approximation algorithm for undirected circular arrangements and an O(√n)-approximation algorithm for directed circular arrangements. We will also conduct an experimental evaluation of our algorithms and show that a simple heuristic has the best performance in simulations based on busy Web server logs.
Information Extraction from the Web: System and Techniques
Authors: Luo Xiao, Dieter Wissmann, Michael Brown, Stephan Jablonski
Venue: Applied Intelligence (2004)

Information Extraction (IE) systems that can exploit the vast source of textual information that is the internet would provide a revolutionary step forward in terms of delivering large volumes of content cheaply and precisely, thus enabling a wide range of new knowledge driven applications and services. However, despite this enormous potential, few IE systems have successfully made the transition from laboratory to commercial application. The reason may be a purely practical one&mdash;to build useable, scaleable IE systems requires bringing together a range of different technologies as well as providing clear and reproducible guidelines as to how to collectively configure and deploy those technologies.This paper is an attempt to address these issues. The paper focuses on two primary goals. Firstly, we show that an information extraction system which is used for real world applications and different domains can be built using some autonomous, corporate components (agents). Such a system has some advanced properties: clear separation to different extraction tasks and steps, portability to multiple application domain, trainability, extensibility, etc. Secondly, we show that machine learning and, in particular, learning in different ways and at different levels, can be used to build practical IE systems. We show that carefully selecting the right machine learning technique for the right task and selective sampling can be used to reduce the human effort required to annotate examples for building such systems.
A finite volume method for transport of contaminants in porous media
Authors: Enrico Bertolazzi, Gianmarco Manzini
Venue: Applied Numerical Mathematics (2004)

A cell-centered finite-volume method is proposed to solve the unsteady reactive diffusive transport of a contaminant in porous media. Two theoretical properties of the analitical solution, namely non-negativity and maximum principle, are mentioned and their implication on the approximation method are discussed.
An Efficient Algorithm for the Transient Analysis of a Class of Deterministic Stochastic Petri Nets
Authors: M. Gribaudo, M. Sereno
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

In this paper a new algorithm for the transient solution ofa sub-class of Deterministic Stochastic Petri Nets (DSPN) isproposed. The technique can be applied to DSPNs comprisingonly deterministic and immediate transitions and suchthat in each tangible marking only one deterministic transitionis enabled. The algorithm does not require any additionalrestriction on the deterministic transition delays thatcan have any positive real value. Most of the optimized algorithmspresented in the literature are based on an efficientsolution of the equations governing the stochastic processassociated with the DSPN; the new algorithm we proposeis based on an efficient combinatorial analysis of thepaths within the state space underlying the DSPN, instead.
Reasoning about Molecular Similarity and Properties
Authors: Rahul Singh
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Ascertaining the similarity amongst molecules is a fundamental problem in biology and drug discovery. Since similar molecules tend to have similar biological properties, the notion of molecular similarity plays an important role in exploration of molecular structural space, query-retrieval in molecular databases, and in structure-activity modeling. This problem is related to the issue of molecular representation. Currently, approaches with high descriptive power like 3D surface-based representations are available. However, most techniques tend to focus on 2D graph-based molecular similarity due to the complexity that accompanies reasoning with more elaborate representations. This paper addresses the problem of determining similarity when molecules are described using complex surface-based representations. It proposes an intrinsic, spherical representation that systematically maps points on a molecular surface to points on a standard coordinate system (a sphere). Molecular geometry, molecular fields, and effects due to field super-positioning can then be captured as distributions on the surface of the sphere. Molecular similarity is obtained by computing the similarity of the corresponding property distributions using a novel formulation of histogram-intersection. This method is robust to noise, obviates molecular pose-optimization, can incorporate conformational variations, and facilitates highly efficient determination of similarity. Retrieval performance, applications in structure-activity modeling of complex biological properties, and comparisons with existing research and commercial methods demonstrate the validity and effectiveness of the approach.
A survey of life sciences applications on the grid
Authors: Arun Krishnan
Venue: New Generation Computing (2004)

The availability of powerful microprocessors and improvements in the performance of networks has enabled high performance computing on wide-area, distributed systems. Computational grids, by integrating diverse, geographically distributed and essentially heterogeneous resources provide the infrastructure for solving large-scale problems. However, heterogeneity, on the one hand allows for scalability, but on the other hand makes application development and deployment for such an environment extremely difficult.The field of life sciences has seen an explosion in data over the past decade. The data acquired needs to be processed, interpreted and analyzed to be useful. The large resource needs of bioinformatics allied to the large number of data-parallel applications in this field and the availability of a powerful, high performance, computing grid environment lead naturally to opportunities for developing grid-enabled applications. This survey, done as part of the Life Sciences Research Group (a research group belonging to the Global Grid Forum) attempts to collate information regarding grid-enabled applications in this field.
Multiprocessor Energy-Efficient Scheduling with Task Migration Considerations
Authors: Jian-Jia Chen, Heng-Ruey Hsu, Kai-Hsiang Chuang, Chia-Lin Yang, Ai-Chun Pang, Tei-Wei Kuo
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

This paper targets energy-efficient scheduling oftasks over multiple processors, where tasks share a commondeadline. Distinct from many research results onheuristics-based energy-efficient scheduling, we proposeapproximation algorithms with different approximationbounds for processors with/without constraintson the maximum processor speed, where no task migrationis allowed. When there is no constraint onprocessor speeds, we propose an approximation algorithmfor two-processor scheduling to provide trade-offsamong the specified error, the running time, the approximationratio, and the memory space complexity. Anapproximation algorithm with a 1.13-approximation ratiofor M-processor systems is also derived (M > 2).When there is an upper bound on processor speeds, anartificial-bound approach is taken to minimize the energyconsumption with a 1.13-approximation ratio. Anoptimal scheduling algorithm is then proposed in the minimizationof the energy consumption when task migrationis allowed.
Alternative reality: a new platform for virtual reality art
Authors: Marc Cavazza, Simon Hartley, Jean-Luc Lugrin, Mikael Le Bras
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

Virtual Reality Art involves the design of artificial worlds that offer new experiences to spectators. An important aspect for the development of VR Art installations is the principled definition of behaviour for the environment as a whole, which would facilitate experiments with alternative laws of physics, time, and causality. We describe the first results of an ongoing project dedicated to the development of software tools for the use of Intelligent Virtual Environments in VR Art. Using the architecture of a state-of-the-art game engine, we have developed Artificial Intelligence techniques that support the definition of alternative laws of physics. After discussing the principles behind alternative reality we describe two complementary modes of description for alternative behaviour: qualitative physics and causal simulation. This is illustrated by examples integrated into the virtual environment.
Requirements-document-based prototyping of CARA software
Authors: Luqi, Z. Guan, V. Berzins, L. Zhang, D. Floodeen, V. Coskun, J. Puett, M. Brown
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

Computer-aided prototyping evaluates and refines software requirements by defining requirements specifications, designing underlying compositional architecture, doing restricted real-time scheduling, and constructing a prototype by using reusable executable software components. This paper presents a case study of the Computer Assisted Resuscitation Algorithm (CARA) software for a casualty intravenous fluid infusion pump and explores the effectiveness of performing rapid prototyping with parallel conceptualization to expose requirements issues. Using a suite of prototyping tools, five different design model alternatives are generated based on the analysis of customer requirements documents. Further comparison is conducted with specific focus on a sample of comparative criteria: simplicity of design, safety aspects, requirements coverage, and enabling architecture. The case study demonstrates the usefulness of comparative rapid prototyping for revealing the omissions and discrepancies in the requirements document. The study also illustrates the efficiency of creating/modifying parallel models and reason for their complexity by using the tool suite. Additional enhancements for the prototyping suite are highlighted.
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM
Authors: Conrado Daws, Marta Kwiatkowska, Gethin Norman
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time model checker Kronos and the probabilistic model checker Prism. The system is modelled as a probabilistic timed automaton. We first use Kronos to perform a symbolic forwards reachability analysis to generate the set of states that are reachable with non-zero probability from the initial state and before the deadline expires. We then encode this information as a Markov decision process to be analyzed with Prism. We apply this technique to compute the minimal probability of a leader being elected before a deadline, for different deadlines, and study how this minimal probability is influenced by using a biased coin and considering different wire lengths.
Process Information Factory: A Data Management Approach for Enhancing Business Process Intelligence
Authors: Josef Schiefer, Jun-jang Jeng, Shubir Kapoor, Pawan Chowdhary
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

With access to critical performance indicators of business processes, executives, business managers and staff members can play a crucial role in improving the speed and effectiveness of an organization's business operations. The monitoring and analysis of business processes are complicated by the variety of organizational units and information systems involved in the execution of these processes. In this paper, we present a Process Information Factory as a solution for managing performance data of business processes. The purpose of the Process Information Factory is to provide a data foundation for a process-driven decision support system to monitor and improve business processes continuously.
Gross Computed Surface Anthropometry from 3D Datasets
Authors: Ian R. Greenshields
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The paper describes the initial steps in the construction of a computer-assisted anthropometric system designed to enable the determination of gross anthropometric metrics from polyhedral 3D datasets (such as the Ceasar dataset).
COMPASS: a CS program assessment project
Authors: Adel Abunawass, Will Lloyd, Edwin Rudolph
Venue: ACM SIGCSE Bulletin (2004)

In this paper, we describe our Computer Science Program Assessment (COMPASS) project. COMPASS uses open-source software tools to support the development and analysis of course portfolios. We use the portfolios internally to improve the quality of our undergraduate computer science curriculum, and externally to satisfy the requirements of program and university accrediting agencies. COMPASS makes it easy for instructors to build good portfolios and for the department to review and analyze them.
Liquid data for WebLogic: integrating enterprise data and services
Authors: Vinayak Borkar
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Information in today's enterprises commonly resides in a variety of heterogeneous data sources, including relational databases, web services, files, packaged applications, and custom data repositories. BEA's enterprise information integration product, Liquid Data for WebLogic, takes an XML-based approach to providing integrated access to such heterogeneous information. This demonstration highlights the XML technologies involved - including web services, XQuery, and XML Schema - and shows how they can be brought to bear on the enterprise information integration problem. The demonstration uses a simple end-to-end example, one that involves integrating data from relational databases and web services, to walk the audience through the overall architecture, XML-based data modeling approach, programming model, declarative query and view facilities, and distributed processing features of Liquid Data.
The decomposition of a blocking model for connection-oriented networks
Authors: C. Y. Li, P. K. A. Wai, Victor O. K. Li
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

Two general-purpose decomposition methods to calculate the blocking probabilities of connection-oriented networks are presented. The methods are based on either the call status or the link status of the networks, and can significantly reduce the required computational times. A heuristic is presented to simplify the application of the proposed decomposition methods on networks with irregular topologies. Numerical examples are given to demonstrate the applications of the proposed methods.
A Web-Based Protocol Tracking Management System For Clinical Research
Authors: Huey Cheung, Yang Fann, Shaohua A. Wang, Barg Upender, Adam Frazin, Raj Lingam, Sarada Chintala, Frank Pecjak, Gladys Wang, Marc Kellogg, Robert L. Martino, Calvin Johnson
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Clinical research approval processes are complex since they involve human subjectwelfare as well as regulatory and ethical concerns. Typically, clinical research institutionshave an elaborate established review process; the labor-intensive and time-consuming natureof this process can result in approval delays thus significantly impacting the biomedicalresearch. This paper describes the development of a web-based information system designedto make the process of protocol approval more efficient, organized, and accurate. The systemenables the principal investigators (PIs) to initiate, track and manage clinical studies,monitor review processes, view status changes, and quickly respond to requests foradditional information. In addition, it allows the protocol coordinators (PCs) to manage theentire Institutional Review Board (IRB) approval process.
Locally divergence-free discontinuous Galerkin methods for the Maxwell equations
Authors: Bernardo Cockburn, Fengyan Li, Chi-Wang Shu
Venue: Journal of Computational Physics (2004)

In this paper, we develop the locally divergence-free discontinuous Galerkin method for numerically solving the Maxwell equations. The distinctive feature of the method is the use of approximate solutions that are exactly divergence-free inside each element. As a consequence, this method has a smaller computational cost than that of the discontinuous Galerkin method with standard piecewise polynomial spaces. We show that, in spite of this fact, it produces approximations of the same accuracy. We also show that this method is more efficient than the discontinuous Galerkin method using globally divergence-free piecewise polynomial bases. Finally, a post-processing technique is used to recover (2k + 1)th order of accuracy when piecewise polynomials of degree k are used.
Query processing for SQL updates
Authors: César A. Galindo-Legaria, Stefano Stefani, Florian Waas
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused on issues related to data-retrieval queries, with a strong backing on relational algebra. However, update operations can also exhibit a number of query processing issues, depending on the complexity of the operations and the volume of data to process. Such issues include lookup and matching of values, navigational vs. set-oriented algorithms and trade-offs between plans that do serial or random I/Os.In this paper we present an overview of the basic techniques used to support SQL DML (Data Manipulation Language) in Microsoft SQL Server. Our focus is on the integration of update operations into the query processor, the query execution primitives required to support updates, and the update-specific considerations to analyze and execute update plans. Full integration of update processing in the query processor provides a robust and flexible framework and leverages existing query processing techniques.
Poor Bogo
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Inside the wonderful world of a young girl's imagination, Bogo has the best time in ones life. Constantly laughing, playing and eating candy, life couldn't get any sweeter. It is only until this beautiful world is confronted by a boring and cruel reality that all the joy quickly fades away. Copyright held by creator.
A Versatile and Robust Model for Geometrically Complex Deformable Solids
Authors: Matthias Teschner, Bruno Heidelberger, Matthias Muller, Markus Gross
Venue: Proceedings of the Computer Graphics International (2004)

In this paper, we present a versatile and robust model for geometricallycomplex deformable solids. Our approach can beapplied to deformable tetrahedral meshes and to deformabletriangle meshes. The model considers elastic and plastic deformation.It handles a large variety of material propertiesranging from stiff to fluid-like behavior. Due to the computationalefficiency of our approach, complex environments consistingof up to several thousand primitives can be simulatedat interactive speed.The presented approach to deformable modeling is part of asimulation environment with integrated collision handling fortetrahedral meshes. For visualization purposes, tetrahedralmeshes can be coupled with high-resolution surface meshes.Results are presented for deformable tetrahedral meshes andfor deformable triangle meshes which are used to representcloth and discrete shells.
Kolmogorov complexity estimates for detection of viruses in biologically inspired security systems: a comparison with traditional approaches
Authors: Sanjay Goel, Stephen F. Bush
Venue: Complexity (2003)

This article presents results in two mutually complementary areas: distributed immunological information assurance and a new signature-matching technique based on Kolmogorov Complexity. This article introduces a distributed model for security based on biological paradigms of epidemiology and immunology. In this model each node in the network has an immune system that identifies and destroys pathogens in the incoming network traffic as well as files resident on the node. The network nodes present a collective defense to the pathogens by working symbiotically and sharing pathogen information with each other. Each node compiles a list of pathogens that are perceived as threats by using information provided from all the nodes in the network. The signatures for these pathogens are incorporated into the detector population of the immune systems to increase the probability of detection. Critical to the success of this system is the detection scheme, which should not only be accurate but also efficient. Three separate schemes for detecting pathogens are examined, namely, contiguous string matching, Hamming distance, and Kolmogorov Complexity. This work provides a model of the system and examines the efficiency of different detection schemes. A simulation model is built to study the sensitivity of model parameters, such as signature length, sampling rate, and network topology, to detection of pathogens.