ppxscal/embedding_network huggingface dataset:
An Upper Bound on the Number of Edges of a 2-Connected Graph
Authors: Pou-Lin Wu
Venue: Combinatorics, Probability and Computing (1997)

Let G be a loopless 2-connected graph whose largest cycle has c edges, and whose largest bond has c&#x002A; edges. We show that &#x007C;E(G)&#x007C; &le; &half;cc&#x002A;.
Synthesis of Reversible Logic
Authors: Abhinav Agrawal, Niraj K. Jha
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

A function is reversible if each input vector produces a unique output vector. Reversible functions find applications in low power design, quantum computing, and nanotechnology. Logic synthesis for reversible circuits differs substantially from traditional logic synthesis. In this paper, we present the .rst practical synthesis algorithm and tool for reversible functions with a large number of inputs. It uses positive-polarity Reed-Muller decomposition at each stage to synthesize the function as a network of Toffoli gates. The heuristic uses a priority queue based search tree and explores candidate factors at each stage in order of attractiveness. The algorithm produces near-optimal results for the examples discussed in the literature. The key contribution of the work is that the heuristic .nds very good solutions for reversible functions with a large number of inputs.
Mining viewpoint patterns in image databases
Authors: Wynne Hsu, Jing Dai, Mong Li Lee
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

The increasing number of image repositories has made image mining an important task because of its potential in discovering useful image patterns from a large set of images. In this paper, we introduce the notion of viewpoint patterns for image databases. Viewpoint patterns refer to patterns that capture the invariant relationships of one object from the point of view of another object. These patterns are unique and significant in images because the absolute positional information of objects for most images is not important, but rather, it is the relative distance and orientation of the objects from each other that is meaningful. We design a scalable and efficient algorithm to discover such viewpoint patterns. Experiments results on various image sets demonstrate that viewpoint patterns are meaningful and interesting to human users.
Fault Tolerant Multi-Layer Neural Networks with GA Training
Authors: Eiko Sugawara, Masaru Fukushi, Susumu Horiguchi
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper addresses fault tolerant architecture of multi-layer neural networks with a geneticalgorithm scheme. For large scale neural networks implemented in single chip or silicon wafer, it is necessary to develop self-recovery mechanisms that can automatically recover faults without a host computer. In this paper, we propose a fault tolerant multi-layer neural networks employing both hardware redundancy and weight retraining in order to realize self-recovering neural networks. The main advantages of our architecture are low hardware cost for adding redundant neurons and fast training by a genetic algorithm implemented in hardware. A prototype system is implemented on a field programmable gate array to show the possibility of self-recovering neural networks.
A prototype quantum computer using nuclear spins in liquid solution
Authors: James S. Harris, Isaac L. Chuang
Venue:  (2003)

Quantum computers can potentially solve real and relevant mathematical and physical problems that are intractable using classical machines. However, the experimental realization of quantum computers represents a significant challenge, because several opposing experimental requirements must be met. A set of coupled quantum bits must be manipulated and measured while coherently retaining entangled quantum states. Yet the manipulation and measurement processes almost inevitably lead to the decay of these fragile states. This thesis work takes significant steps towards building a practical quantum computer using nuclear spins and liquid state nuclear magnetic resonance (NMR) techniques. I present experimental results for proof of principle of quantum computing in a series of small implementations of quantum algorithms, culminating in the implementation of an adiabatic quantum optimization algorithm. The performance of adiabatic algorithms compared with classical optimization methods is unknown, but small quantum computers could provide crucial insight into answering this question. Furthermore, adiabatic algorithms also shed new light on the usefulness of quantum resources for computational tasks and hence they represent an important class of algorithms. The second part of this thesis presents several methods developed for improving the control over NMR quantum computing experiments. Even though liquid state NMR quantum computers have well known and accepted scaling limitations, the developed tools are of general use. I will show how several tools are directly transferable to two other implementations of quantum computers; one using optical methods and the other using loops of superconducting material. This work provides insight into what is needed to build a practical quantum computer, and delivers several tools and techniques that will be useful in future large-scale implementations of quantum computers.
Isoperimetric Inequalities for Cartesian Products of Graphs
Authors: F. R. K. Chung, Prasad Tetali
Venue: Combinatorics, Probability and Computing (1998)

We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the Cartesian products of graphs.
The Sourcing of eBusiness Projects: Research into Practice
Authors: Robert Plant, Leslie Willcocks
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

How in practice have organizations gone about moving to e-business, or at least placingthemselves usefully on the web? A study of 78 corporations in a three year period identifies avarieties of rationales and practices. A key issue is the e-sourcing policy adopted. The paperidentifies the internal and external development routes taken, determinants of success and also identifies when and why organizations bring ebusiness development work back in-house. The paper also looks at the total outsourcing/partnering route, the trade-offs involved, and draws conclusions from the findings.
Learning cross-document structural relationships using boosting
Authors: Zhu Zhang, Jahna Otterbacher, Dragomir Radev
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Multi-document discoure analysis has emerged with the potential of improving various information retrieval applications. Based on the newly proposed Cross-document Structure Theory (CST), this paper describes an empirical study that uses boosting to classify CST relationships between sentence pairs extracted from topically related documents. We show that the binary classifier for determining existence of structural relationships significantly outperforms the baseline. We also achieve promising results on the multi-class case in which the full taxonomy of relationships are considered.
Efficient isolation of polynomial's real roots
Authors: Fabrice Rouillier, Paul Zimmermann
Venue: Journal of Computational and Applied Mathematics (2004)

This paper revisits an algorithm isolating the real roots of a univariate polynomial using Descartes' rule of signs. It follows work of Vincent, Uspensky, Collins and Akritas, Johnson, Krandick.Our first contribution is a generic algorithm which enables one to describe all the known algorithms based on Descartes' rule of sign and the bisection strategy in a unified framework.Using that framework, a new algorithm is presented, which is optimal in terms of memory usage and as fast as both Collins and Akritas' algorithm and Krandick's variant, independently of the input polynomial. From this new algorithm, we derive an adaptive semi-numerical version, using multi-precision interval arithmetic.We finally show that these critical optimizations have important consequences since our new algorithm still works with huge polynomials, including orthogonal polynomials of degree 1000 and more, which were out of reach of previous methods.
Design patterns for pseudo-3D photo collage
Authors: Hiroya Tanaka, Masatoshi Arikawa, Ryosuke Shibasaki
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

"Pseudo-3D Photo Collage", one of new wed3D techniques, is based on multiple photographs and Spatial-Hyperlinks. A user can design various patterns of HyperPhoto-Networks, for example, linear, loop, tree, grid, rhizome and so on. It is similar to design a website based on HyperText-Networks. We propose several design patterns and those applications to create highly-designed virtual sequences.
Abstraction and composition in &Delta;-specifications of concurrent systems
Authors: Joseph P. Loyall, Simon M. Kaplan, Steven K. Goering
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

We have been investigating the application of the &Delta;-grammar graph rewriting model to the problem of specifying concurrent systems. In this paper, we present abstraction and composition techniques for the &Delta; model and illustrate their use through examples.
Accurate thermophysical properties of neat globular gases and their binary mixtures determined by means of an isotropic temperature-dependent potential
Authors: U. Hohm, L. Zarkova
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We present results on self-consistent calculations of second pVT- virial coefficients B(T), viscosity data η(T) and diffusion coefficients ρD for heavy globular gases (BF3, CF4, SiF4, CCl4, SiCl4, SF6, MoF6, WF6, UF6, C(CH3)4, and Si(CH3)4) and their binary mixtures with globular gases, and Ar, Kr, and Xe, respectively. The calculations are performed mainly in the temperature range between 200 and 900K by means of isotropic n-6 potentials with explicitly temperature-dependent separation rm(T) and potential well-depth ε(T). In the case of the pure gases the potential parameters at T = 0 K (ε, rm, n) and the enlargement of the first level radii δ are obtained solving an ill-posed problem of minimizing the squared deviations between experimental and calculated values normalized to their relative experimental error. The temperature dependence of the potential is a result of the influence of vibrational excitation on binary interactions. The interaction potential of the binary mixtures are obtained with simple combination rules from the potential parameters of the neat gases. In all cases we observe excellent reproduction of the experimental thermophysical properties of the neat gases and the binary mixtures.
Probabilistic argumentation systems a new way to combine logic with probability
Authors: Jürg Kohlas
Venue: Journal of Applied Logic (2003)

Probability is usually closely related to Boolean structures, i.e., Boolean algebras or propositional logic. Here we show, how probability can be combined with non-Boolean structures, and in particular non-Boolean logics. The basic idea is to describe uncertainty by (Boolean) assumptions, which may or may not be valid. The uncertain information depends then on these uncertain assumptions, scenarios or interpretations. We propose to describe information in information systems, as introduced by Scott into domain theory. This captures a wide range of systems of practical importance such as many propositional logics, first order logic, systems of linear equations, inequalities, etc. It covers thus both symbolic as well as numerical systems. Assumption-based reasoning allows then to deduce supporting arguments for hypotheses. A probability structure imposed on the assumptions permits to quantify the reliability of these supporting arguments and thus to introduce degrees of support for hypotheses. Information systems and related information algebras are formally introduced and studied in this paper as the basic structures for assumption-based reasoning. The probability structure is then formally represented by random variables with values in information algebras. Since these are in general non-Boolean structures some care must be exercised in order to introduce these random variables. It is shown that this theory leads to an extension of Dempster-Shafer theory of evidence and that information algebras provide in fact a natural frame for this theory.
A novel scatternet scheme with IPv6 compatibility
Authors: Wei Kuang Lai, Der Hwa Tan
Venue: Mobile Networks and Applications (2003)

Some market analysts predict that there will be some 1.4 billion Bluetooth devices in operation by the year 2005 [8]. However, the current specification 1.1 does not describe the algorithms or mechanisms to create a scatternet due to a variety of unsolved issues [3,12]. Since the upper layers are not defined in Bluetooth, it is not possible to implement the scatternet in current specification. Hence in this research, we need make some modifications to Bluetooth protocol in order to support the transmissions of packets in the scatternet. In this paper we describe a novel scatternet architecture, and present link performance of the proposed architecture. The issues of the routing algorithm, handoffs, and communications with other networks are also discussed.
Verifying, validating and monitoring the open Ravenscar real time kernel
Authors: R. Maia, F. Moreira, R. Barbosa, D. Costa, Kjeld Hjortaes, Patricia Rodriguez, Luis Miguel Pinho
Venue: Proceedings of the 12th international workshop on Real-time Ada (2003)

Business and mission critical real-time systems need to be fully predictable, in order that their behavior is known before deployment, even in the presence of faults. The Open Ravenscar Real Time Kernel (ORK) is a small size with reduced complexity kernel designed to be used in this type of applications. This kernel was implemented to be fully compliant with the Ravenscar profile, which defines a subset of the tasking features of Ada which can be used to implement a small and reliable kernel. Critical Software has recently conducted an evaluation on this kernel as well as started a new project to provide a monitoring tool for ORK, thus further enhancing the already existing range of hard real-time verification and validation tools. This paper summarizes the objectives and results of the ORK evaluation and presents the main goals and functionalities of the monitoring tool.
Breaking into the universe: computer science is interactive entertainment
Authors: Leslie Wilson
Venue: Computers in Entertainment (CIE) (2003)

High quality interactive entertainment is educational and beneficial for children. It transports our children through fantasy to understanding, inspires them and helps them survive in a world of growing complexity.Creativity is one of the most important skills a child can learn. Just like math, language arts, and science, creativity is teachable and essential to a well-rounded personality and tolerant view of the world. More creative thinking in every sphere will go a long way towards improving our lives. So let's design games that teach creativity and computer science bound together in that unique new art form called "interactive entertainment."
Recovering Set Systems and Graph Entropy
Authors: Attila Sali, Gábor Simonyi
Venue: Combinatorics, Probability and Computing (1997)

A relationship between a new and an old graph invariant is established. The first invariant is connected to the &lsquo;sandglass conjecture&rsquo; of [1]. The second one is graph entropy, an information theoretic functional, which is already known to be relevant in several combinatorial contexts.
The Mortar Finite Element Method for the Cardiac &ldquo;Bidomain&rdquo; Model of Extracellular Potential
Authors: Micol Pennacchio
Venue: Journal of Scientific Computing (2004)

This paper deals with the efficient and accurate computation of extracellular potentials in a simplified model of myocardial tissue. The electrical activity of the heart is characterized by a narrow wavefront spreading through the myocardium. To increase the accuracy of the computation, a non-conforming non-overlapping domain decomposition based on the mortar method is used, allowing adaptivity in the regions closed to the wavefront. The benefits of the adaptive grid refinement process are illustrated by numerical results that show how the method works and its efficiency if compared to the classical conforming Finite Element Method.
Generative constraint-based configuration of large technical systems
Authors: Markus Stumptner, Gerhard E. Friedrich, Alois Haselböck
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

This paper describes the technical principles and representation behind the constraint-based, automated configurator COCOS. Traditionally, representation methods for technical configuration have focused either on reasoning about structure of systems or quantity of components, which is not satisfactory in many target areas that need both. Starting from general requirements on configuration systems, we have developed an extension of the standard CSP model. The constraint-based approach allows a simple system architecture, and a declarative description of the different types of configuration knowledge. Knowledge bases are described in terms of a component-centered knowledge base written in an object-oriented representation language with semantics directly based on the underlying constraint model. The approach combines a simple, declarative representation with the ability to configure large-scale systems and is in use for actual production applications.
Specification matching of state-based modular components
Authors: David Hemer
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Retrieval of software components from a library relies on techniquesfor matching user requirements against library componentinterfaces. In this paper we introduce a number of techniquesfor matching formally specified, state-based modules. These techniqueswill form the basis for retrieval tool support. The techniquesdescribed in this paper build on existing specificationmatching methods, based on individual functions, specified usingpre- and post-conditions. We begin by defining a basic modulematching technique, based on matching the individual units withina module. We consider variations of this technique that take intoaccount two important features of modules: the visibility of moduleentities; and the use of state invariants. An advanced technique,based on data refinement and the use of coupling invariants,is also described.
On the Guaranteed Throughput of Multizone Disks
Authors: Wil Michiels, Jan Korst, Joep Aerts
Venue: IEEE Transactions on Computers (2003)

We derive the guaranteed throughput of a multizone disk that repeatedly handles batches of n requests of constant size. Using this guaranteed throughput in the design of multimedia systems, one can admit more streams or get smaller buffer requirements and guaranteed response times than when an existing lower bound is used. We consider the case that nothing can be assumed about the location of the requests on the disk. Furthermore, we assume that successive batches are handled one after the other, where the n requests in a batch are retrieved using a SCAN-based sweep strategy. We show that we only have to consider two successive batches to determine the guaranteed throughput. Using this, we can compute the guaranteed throughput by determining a maximum-weighted path in a directed acyclic graph in {\cal{O}}(z_{\max}^3 n^2) time, where z_{\max} is the number of zones of the disk.
CPUs with 2,000 MIPS per Watt, Anyone?
Authors: Mike MacFaden
Venue: Queue (2003)

Making a living as an IT professional, I always get a terrible sinking feeling right in the midsection when that background hum of automation suddenly becomes quiet. The recent events with the Eastern power grid provide an ominous reminder of our huge dependence on electrical power.
Using SOM for tool integration
Authors: Christina Lau
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

IBM's System Object Model (SOM) is an object-oriented programming interface for building binary class libraries. When changes are made to a SOM class, client programs that use the SOM class will not need to be recompiled. The SOM Toolkit provides a set of frameworks for building object-oriented applications. These include Distributed SOM, the Persistence Framework, the Replication Framework, and the Emitter Framework. In this paper, we discuss our experience using SOM to handle the control aspects of tool integration.
Collaboration strategies for developing it products
Authors: Robert Demichiell
Venue:  (2003)

Advances in information technology have clearly changed the way business reaches its customers. This study will add to the limited research where products and services are developed in high tech companies, the criteria for project team selection, and how these project team members collaborate in the development process, and how information is disseminated throughout the organization. Samples from Fortune 1000 and designated information technology companies show that technology and the Internet have increased the speed to market for products and services from inception to delivery and those firms are more adept in collecting and processing this information than before. The study supports the research dependency theory in technology-based firms and how the Internet has changed the way marketing and research and development bring goods and services to the customer. It is evident that digital communications technology has reshaped the product development practices and communication streams of successful companies. This study should add to the field of research regarding information technology and its impact on product development in these firms with product development team data on how they collaborate effectively, how companies select project teams, and how they bring new ideas to fruition.
Panoptes: scalable low-power video sensor networking technologies
Authors: Wu-chi Feng, Brian Code, Ed Kaiser, Mike Shea, Wu-chang Feng, Louis Bavoil
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Video-based sensor networks can provide important visual information in a number of applications including: environmental monitoring, health care, emergency response, and video security. This paper describes the Panoptes video-based sensor networking architecture, including its design, implementation, and performance. We describe a video sensor platform that can deliver high-quality video over 802.11 networks with a power requirement of approximately 5 watts. In addition, we describe the streaming and prioritization mechanisms that we have designed to allow it to survive long-periods of disconnected operation. Finally, we describe a sample application and bitmapping algorithm that we have implemented to show the usefulness of our platform. Our experiments include an in-depth analysis of the bottlenecks within the system as well as power measurements for the various components of the system.
The role of personality in Web-based distance education courses
Authors: Eyong B. Kim, Marc J. Schniederjans
Venue: Communications of the ACM (2004)

Before investing in a Web-based education program, managers should consider how effective it will be when paired with employee personality traits.