ppxscal/embedding_network huggingface dataset:
2-Local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
Authors: Petra Šparl, Janez Žerovnik
Venue: Information Processing Letters (2004)

An important optimization problem in the design of cellular networks is to assign sets of frequencies to transmitters to avoid unacceptable interference. A cellular network is generally modeled as a subgraph of the infinite triangular lattice. The distributed frequency assignment problem can be abstracted as a multicoloring problem on a weighted hexagonal graph, where the weight vector represents the number of calls to be assigned at vertices. In this paper we present a 2-local distributed algorithm for multicoloring triangle-free hexagonal graphs using only the local clique numbers ω1 (υ) and ω2(υ) at each vertex υ of the given hexagonal graph, which can be computed from local information available at the vertex. We prove that the algorithm uses no more than [5ω(G)/4] + 3 colors for any triangle-free hexagonal graph G, without explicitly computing the global clique number ω(G). Hence the competitive ratio of the algorithm is 5/4.
Melisa - A Distributed Multimedia System for Multi-Platform Interactive Sports Content Broadcasting
Authors: Emmanuel Papaioannou, Vasilis Karagianis, Kostantinos Karpouzis, Herve Guillemot, Athanasios Demiris, Philippe De Cuetos, Nikolaos Ioannidis
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The new generation of television viewers is currently being confronted and becoming acquainted with a series of technological developments in the realm of consumer electronics and gaming that raise their expectations for similar advances in TV broadcasts. The MELISA platform aims at the cross-media broadcasting of sports events featuring interactive advertising and sports-related games over digital television and next generation mobile network infrastructures. The platform provides services for optimal presentation of complex interactive real time video content, for advertisement and an advanced real-time gaming (betting) engine. The MELISA server receives information from geographically separated Betting, Advertisement and Video Capturing Servers that enforces the notion of a Distributed System design for information exchange. The resulted Business model offers great flexibility in system configuration both in scalability and physical layout configuration.
Using a Distributed Rectangle Bin-Packing Approach for Core-based SoC Test Scheduling with Power Constraints
Authors: Yu Xia, Malgorzata Chrzanowska-Jeske, Benyi Wang, Marcin Jeske
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We present a new algorithm to co-optimize test scheduling andwrapper design under power constraints for core-based SoCs(System on Chip). Core testing solutions are generated as a set ofwrapper designs, each represented by a rectangle with width equalto the test time and height equal to the number of TAM (TestAccess Mechanism) wires used. The test-scheduling problem withpower constraints is formulated as the distributed rectangle bin-packingproblem, which allows wrapper pins to be assigned to non-consecutiveSoC pins. The generalized problem for multiple-TAMsis solved by global optimization using evolutionary strategy and thesequence-pair representation. Experiments on ITCý02 benchmarksare very encouraging.
The dimensions of variation in the teaching of data structures
Authors: Raymond Lister, Ilona Box, Briana Morrison, Josh Tenenberg, D. Suzanne Westbrook
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

The current debate about the teaching of data structures is hampered because, as a community, we usually debate specifics about data structure implementations and libraries, when the real level of disagreement remains implicit -- the intent behind our teaching. This paper presents a phenomenographic study of the intent of CS educators for teaching data structures in CS2. Based on interviews with Computer Science educators and analysis of CS literature, we identified five categories of intent: developing transferable thinking, improving students' programming skills, knowing "what's under the hood", knowledge of software libraries, and component thinking. The CS community needs to first debate at the level of these categories before moving to more specific issues. This study also serves as an example of how phenomenographic analysis can be used to inform debate on syllabus design in general.
Model-based computer-aided design environment for operational design
Authors: Hossam A. Gabbar, Atsushi Aoyama, Yuji Naka
Venue: Computers and Industrial Engineering (2004)

To meet the increasing market challenges in chemical industry, it is imperative to improve process design and the supportive computer-aided engineering tools so that they can support lifecycle activities. This research work proposes detailed mechanism of operational design approach on the basis of operational design modeling methodology where lifecycle activities are considered during design stage. Computer-aided design environment called CAPE-CAD is proposed, which supports operational design approach. CAPE-CAD encompasses a friendly user interface to capture and maintain plant topology and to link process behaviors and plant operations with corresponding plant structure units. The proposed design environment can be used during design and operation stages, as well as for operator training. Case study of chemical process is used to explain the proposed solution.
Generation as method for explorative learning in computer science education
Authors: Andreas Kerren
Venue: ACM SIGCSE Bulletin (2004)

The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advantages of generic and generative techniques are, among other things, the high degree of reusability of systems parts and the reduction of development costs. Furthermore, generative methods can be used for the development or realization of novel learning models. In this paper, we discuss such a learning model that propagates a new way of explorative learning in computer science education with the help of generators. A realization of this model represents the educational software GANIFA on the theory of generating finite automata from regular expressions. In addition to the educational system's description, we present an evaluation of this system.
Corporate IT Knowledge Workbench: Case Study
Authors: Kemal A. Delic, Laurent Douillet
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Large corporations typically have a well established, enterprise-wide knowledge management program addressing some specific IT domain or burning enterprise business problem. While choices of the technology, method and organization are pretty straightforward; supplying the enterprise knowledge management system with cheap, reliable, relevant and fresh knowledge remains to be the key challenge for the enterprise KM program. This paper describes an internal, corporate system providing such services for the WiseWare IT KM suite. We outline the general context and follow with an architecture view of the KM Workbench in the second sections. Some rationales and design decisions are given in the third section. We follow with some numerical figures and usage lessons. We are concluding the fifth section with insights and useful advices.
Evaluation Paths to Express Scientific Queries
Authors: Zoe Lacroix, Kaushal Parekh, Maria-Esther Vidal
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Scientific data collection needed in various stages of scientific discovery is typically performed manually. For each scientific object of interest (e.g., a gene, a sequence), scientists query a succession of Web resources following links between retrieved entries, each of the steps providing part of the intended characterization of the scientific object. This process is often partially supported by hard-scripts implemented to collect data for a given data collection protocol, or by queries against a mediation systems, that express complex joins on integrated resources. These approaches fail in guiding the scientists in the collection process, informing the scientists on the alternative resources available, the data provenance, or the cost associated with the data collection. The BioNavigation system presented in this paper addresses the issue of exploring evaluation paths of scientific queries and offers a complement to a traditional mediation approach.
Partial Core Encryption for Performance-Efficient Test of SOCs
Authors: Ozgur Sinanoglu, Alex Orailoglu
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The isolation of a core through full I/O scan helps ease SOC test challenges;yet the performance of high-speed SOCs is significantly hampered.We propose a partial core encryption methodology wherein thecore vendor unveils only a small part of the core logic, successfully satisfyingcore IP protection requirements. Once the partially encryptedcores are merged into an SOC, the system integrator performs test generationon the visible SOC logic only, greatly reducing the test generationeffort expended. By utilizing the test data provided by the core vendoras well, the SOC integrator can test the SOC with no performancedegradation. We present an efficient fault analysis based core encryptionalgorithm which is guided by judiciously computed testability measures.The experimental results confirm the significantly high encryption levelsattained by the proposed encryption algorithm.
Exponential separation of quantum and classical one-way communication complexity
Authors: Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Problem HMn: Alice gets as input a string x ∈ (0, 1)n and Bob gets a perfect matching M on the n coordinates. Bob's goal is to output a tuple [i,j,b] such that the edge (i,j) belongs to the matching M and b = xi ⊕ xj. We prove that the quantum one-way communication complexity of HMn is O(log n), yet any randomized one-way protocol with bounded error must use Ω(√n) bits of communication. No asymptotic gap for one-way communication was previously known. Our bounds also hold in the model of Simultaneous Messages (SM) and hence we provide the first exponential separation between quantum SM and randomized SM with public coins.For a Boolean decision version of HMn, we show that the quantum one-way communication complexity remains O(log n) and that the 0-error randomized one-way communication complexity is Ω(n). We prove that any randomized linear one-way protocol with bounded error for this problem requires Ω(√[3] n log n) bits of communication.
Modeling Group Trust For Peer-to-Peer Access Control
Authors: Abhilash Gummadi, Jong P. Yoon
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The information on the web is growing at a very fast pace. In this ever-accumulating data, the volume of information being exchanged using peer-to-peer applications is on the rise in recent times. As peer-to-peer applications like file sharing, distributed computing and instant messaging are gaining popularity, security issues related to these applications are being taken up more seriously. In this paper, we focus mainly on two important security issues related to the aspect of peer-to-peer file sharing. First of these is the problem of "Peer Selection", where the notion of security deals with the identification and prevention of peers that display malicious tendencies in their behavior. The second issue is "Request Resolution" which comes into play when a peer needs to decide among the received requests for its resources. Request resolution is of vital importance since some of these requests may tend to exhaust the peer's serving capabilities (like processing capacity and bandwidth), so that it can't respond to any further requests normally. Consequences of such a maligned request may result in the peer loosing its trust among other peers as well as being branded malicious. In this paper, we show how to model group trust for peer-to-peer access control so as to make them secure and thus provide a redressal to the above-mentioned issues.
Breakdown mechanisms in ultra-thin Oxides: impact of carrier energy and current through substrate hot carrier stress study
Authors: G. Ribes, S. Bruyère, M. Denais, F. Monsieur, V. Huard, D. Roy, G. Ghibaudo
Venue: Microelectronic Engineering (2004)

An experimental investigation of breakdown phenomenon using substrate hot hole and electron stresses of silicon dioxide ranging in thickness from 2 to 5 nm is reported. First, we demonstrate that the scattering effect is responsible of the low activation energy already observed by other authors [J. Appl. Phys. 90(5) (2001)]. Based on a method of carrier energy measurement we characterize the scattering effect. Second, we demonstrate the decorrelation between carrier energy and carrier density showing that the carriers carriers scattering is negligible. Finally being capable to confirm the real decorrelation between energy and density we observed a current dependence of the charge to breakdown. Besides, we give a theory using the multiple vibrational excitation of the Si H bound [Surf. Sci. 368-377 (1996): Science 268 (1995) 1590]. Hence, we demonstrate once again that the hydrogen species behavior is strongly linked to breakdown phenomenon.
Mixing Deformable and Rigid-Body Mechanics Simulation
Authors: Julien Lenoir, Sylvere Fonteneau
Venue: Proceedings of the Computer Graphics International (2004)

This article presents a new method to achieve heterogeneousphysical simulation, within the same global system,of both deformable and rigid-bodies objects, whatevertheir intrinsic nature. The proposed approach combinesseveral mechanical formalisms in the same system and offersa common constraint management via Lagrange multipliers.This allows the simulation of a wide variety ofmodels, including deformable and rigid parts linked by constraints.Some applications of this approach are presentedto show its effectiveness.
On the Risk of Extinction for a Population Subject to a Random Markov Evolution with Jumps
Authors: Mario Abundo
Venue: Open Systems Information Dynamics (2004)

We consider a one-dimensional population whose evolution is described by a jump-diffusion equation and we study the effects of changing the coefficients of the equation on the extinction time, that is the instant at which the population becomes arbitrarily small. It is shown that, under the same diffusion coefficient, if one reduces the drift and the size of jumps, the speed of extinction increases; moreover, the probability of reaching a higher population state than the present one before reaching a lower population size decreases. If the diffusion coefficient is state-independent, the speed of extinction increases with it. Furthermore, if no jumps are allowed (i.e. for a simple-diffusion equation), then under certain conditions on the coefficients of the equation both large and small values of the diffusion coefficient result in a higher extinction risk.
Composing 6 DOF Tracking Systems for VR/AR
Authors: Bernd Schwald, Helmut Seibert, Michael Schnaider
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a concept for the composition oftracking systems in the context of Virtual and AugmentedReality (VR/AR) applications. Several independent 6 DOFtracking systems can be used simultaneously to accomplishthe interaction requirements for a given application. Thecontrol unit for tracking systems, processing measurementswith optional properties as time stamps and quality valuesis described as well as procedures for the coordinate systemalignment of different tracking systems and the con-figuration of such a hybrid system. Considerations on theway accuracy errors might increase or decrease by combiningtracking systems are included. The concept is motivatedconsidering a medical AR system combining opticaland electromagnetic tracking technology as example.
Locating All Tandem Repeat Families in a Sequence
Authors: Donald Adjeroh, Jianan Feng
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We present a new data structure called the BSCP (block sorted common prefix), and its tree representation, called the BSCP tree. We also introduce the notion of PTR family ¿ a biologically motivated description and representation of the tandem repetitions in a sequence. The PTR family implicitly encodes each distinct primitive tandem repeat in the sequence as its part. Based on the BSCP tree, we describe a method to locate all the primitive tandem repeat families in an input sequence T. The proposed method requires average space and time complexity in O(u), where u = |T|.
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
Authors: Peter Bürgisser, Felipe Cucker
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We define counting classes #PR and #PC in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of systems of polynomial equalities over C, respectively, turn out to be natural complete problems in these classes. We investigate to what extent the new counting classes capture the complexity of computing basic topological invariants of semialgebraic sets (over R) and algebraic sets (over C). We prove that the problem to compute the (modified) Euler characteristic of semialgebraic sets is FPR#P RR-complete, and that the problem to compute the geometric degree of complex algebraic sets is FPR#PCC-complete. We also define new counting complexity classes GCR and GCC in the classical Turing model via taking Boolean parts of the classes above, and show that the problems to compute the Euler characteristic and the geometric degree of (semi)algebraic sets given by integer polynomials are complete in these classes. We complement the results in the Turing model by proving, for all k ∈ N, the FPSPACE-hardness of the problem of computing the kth Betti number of the set of real zeros of a given integer polynomial. This holds with respect to the singular homology as well as for the Borel-Moore homology.
Verb class disambiguation using informative priors
Authors: Mirella Lapata, Chris Brew
Venue: Computational Linguistics (2004)

Levin's (1993) study of verb classes is a widely used resource for lexical semantics. In her framework, some verbs, such as give, exhibit no class ambiguity. But other verbs, such as write, have several alternative classes. We extend Levin's inventory to a simple statistical model of verb class ambiguity. Using this model we are able to generate preferences for ambiguous verbs without the use of a disambiguated corpus. We additionally show that these preferences are useful as priors for a verb sense disambiguator.
Impact of ECCs on Simultaneously Switching Output Noise for On-Chip Busses of High Reliability Systems
Authors: D. Rossi, A. Muccio, A. K. Nieuwland, A. Katoch, C. Metra
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

In this paper we analyze the impact of error correctingcodes (ECCs) on simultaneously switching outputs(SSO) noise, for the case of a realistic bus of ahigh reliability system. First we analyze the effect ofdifferent bus transitions on SSO noise. Then we showhow different ECCs, requiring a different number ofcheck bits, impact the SSO noise. We prove that Hammingcodes cause less noise than the ECCs that havebeen proposed so far to reduce power consumption andcrosstalk-induced delay. In particular, we show that thecode requirements for crosstalk and power minimizationin terms of switching activity of adjacent wires areopposite to those for SSO noise reduction. Our analysishas been performed considering realistic bus andpower supply network models, both implemented usinga standard 0.25&mu;m CMOS technology.
Precomputed Radiance Transfer with Spatially-Varying Lighting Effects
Authors: Masahiro Fujita, Takashi Kanai
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

We propose a new method to render physically-based globally illuminated scenes at interactive speed. Our method is based on Precomputed Radiance Transfer (PRT) [10]. Although the shape of model does not change and its position is fixed, we can move any light source with arbitrary shape dynamically during rendering process. This enables a spatially-varying lighting effect which has not been considered in the previous approach [10]. We also describe the details of rendering the scene with dynamic lights using cube mapping. Our implementation demonstrates that our method is suited for interactive applications such as 3D games and lighting simulations.
Gram Matrix Analysis of Finite Distance Spaces in Constant Curvature
Authors: S. L. Kokkendorff
Venue: Discrete Computational Geometry (2004)

We develop the utility of Gram matrix machinery as a tool to treat the geometry of simplices in space forms. A formula relating the determinant of a normalized Gram matrix to the geometry of the simplex it represents is presented. We then apply the tools to leaf spaces, i.e. the set of degree 1 vertices of a metric tree. One main result is that for a given metric space X there exists a constant &#x03ba;0 < 0, such that X embeds into all hyperbolic spaces of curvature less than &#x03ba;0, if and only if X is a leaf space. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Lower bounds for graph embeddings and combinatorial preconditioners
Authors: Gary L. Miller, Peter C. Richter
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and dilation of an embedding of G into H. One example is the routing time p(G, H) ≤ O (congestion + dilation), the number of steps necessary to route pairwise demands G on network links H in the store-and-forward packet routing model. Another is the condition number kf(G, H) ≤ O (congestion · dilation), the square root of which bounds the number of iterations necessary to solve a linear system with coefficient matrix G preconditioned by H using the classical conjugate gradient method. The algorithmic applications of being able to find (efficiently) a good tree approximation H for a graph G are numerous; but what if no good tree exists.In this paper, we seek to identify the class of graphs G which are intrinsically difficult to approximate by a particular measure. It is easily seen that with respect to routing time, G is hardest to approximate by a tree H precisely when it contains either long cycles (which yield high dilation)or large separators (which yield high congestion). We show that with respect to condition number, the existence of long cycles or large separators in G is sufficient but not necessary or it to be hardest to approximate, by demonstrating a nearly-linear lower bound or the case in which G is a square mesh. The proof uses concepts from circuit theory, linear algebra, and geometry, and it generalizes to the case in which H is a spanning subgraph of G of Euler characteristic k. The result has consequences or the design of preconditioners or symmetric M-matrices and perhaps also of communication networks.