ppxscal/embedding_network huggingface dataset:
On the Power of Local Orientations
Authors: Monika Steinová
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique labels --- port names.We define a pre-processing phase that enables a right-hand rule using agent (RH-agent) to traverse the entire graph. For this phase we design an algorithm for an agent that performs the precomputation. The agent will alter the network by modifying the local orientations using a simple operation of exchanging two local labels in each step. We show a polynomial-time algorithm for this precomputation that needs only one pebble and O(logN) memory in the agent.Furthermore we design a similar algorithm where the memory that the agent uses for the precomputation is decreased to O(1). In this case, the agent is not able to perform some operations by itself due to the lack of memory and needs support from the environment.
Topology in information theory in topology
Authors: Keye Martin
Venue: Theoretical Computer Science (2008)

We prove that timed capacity in information theory is a Euclidean continuous function of noise. This is a result based on topological methods that benefits work in information theory. Then we show that binary timing capacity is a measure of distance which yields the Euclidean topology on the unit interval, despite the fact that it does not satisfy the triangle inequality. This is a result based on information theoretic methods that benefits topology. These results have important applications in an area known as information hiding, in the study of quantum communication and in domain theory. They appear to raise fundamental questions about the nature of distance itself.
Delivering Environmental Health Information
Authors: Marti Szczur
Venue: IT Professional (2004)

A National Library of Medicine program used effective IT strategies in creating compelling presentations of complex scientific information.
On the Quasi-cyclicity of the Gray Map Image of a Class of Codes over Galois Rings
Authors: Carlos Alberto López-Andrade, Horacio Tapia-Recillas
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

Results on the quasi-cyclicity of the Gray map image of a class of codes defined over the Galois ring GR(p 2,m) are given. These results generalize some appearing in [8] for codes over the ring of integers modulo p 2 (p a prime). The ring of (truncated) Witt vectors is a useful tool in proving the main results.
Experimenting the Query Performance of a Grid-Based Sensor Network Data Warehouse
Authors: Alfredo Cuzzocrea, Abhas Kumar, Vincenzo Russo
Venue: Proceedings of the 1st international conference on Data Management in Grid and Peer-to-Peer Systems (2008)

This paper presents our experience in experimenting the query performance of a Grid-based sensor network data warehouse, which encompasses several metaphors of data compression/approximation and high performance and high reliability computing that are typical of Grid architectures. Our experimentation focuses on two main classes of aggregate range queries over sensor readings, namely (i) the window queries, which apply a SQL aggregation operator over a fixed window over the reading stream produced by the sensor network, and (ii) the continuous queries, which instead consider a "moving" window, and produce as output a stream of answers. Both classes of queries are extremely useful to extract summarized knowledge to be exploited by OLAP-like analysis tools over sensor network data. The experimental results, conducted on several synthetic data sets, clearly confirm the benefits deriving from embedding the data compression/approximation paradigm into Grid-based sensor network data warehouses.
ENFIN - An Integrative Structure for Systems Biology
Authors: Florian Reisinger, Manuel Corpas, John Hancock, Henning Hermjakob, Ewan Birney, Pascal Kahlem
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

Integration of biological data of various types and development of adapted bioinformatics tools represent critical objectives to enable research at the systems level. The European Network of Excellence ENFIN is engaged in developing an adapted infrastructure to connect databases, and platforms to enable both generation of new bioinformatics tools and experimental validation of computational predictions. With the aim of bridging the gap existing between standard wet laboratories and bioinformatics, the Network ENFIN runs integrative research projects, which require the development of adapted infrastructures that will be described in this paper: (i) a database infrastructure, EnCORE, appropriate for small laboratories, which can integrate public and local data, such as microarray data, protein-protein interaction data and pathway information; (ii) a registry of databases to serve as a reference of trusted databases; (iii) The database EnDICTION, to capture functional predictions generated by the computational analysis platform.
Unfolding-Based Diagnosis of Systems with an Evolving Topology
Authors: Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara König
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-based diagnosis is aimed at constructing explanations of observed faulty behaviours on the basis of a given model of the system. Since the number of possible explanations may be huge we exploit the unfolding as a compact data structure to store them, along the lines of previous work dealing with Petri net models. Given a model of a system and an observation, the explanations can be constructed by unfolding the model constrained by the observation, and then removing incomplete explanations in a pruning phase. The theory is formalised in a general categorical setting: constraining the system by the observation corresponds to taking a product in the chosen category of graph grammars, so that the correctness of the procedure can be proved by using the fact that the unfolding is a right adjoint and thus it preserves products. The theory thus should be easily applicable to a wide class of system models, including graph grammars and Petri nets.
Coevolving Cellular Automata with Memory for Chemical Computing: Boolean Logic Gates in the BZ Reaction
Authors: Christopher Stone, Rita Toth, Ben Lacy Costello, Larry Bull, Andrew Adamatzky
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively parallel non-linear computers, can be realised by such an approach. In this study a light-sensitive sub-excitable Belousov-Zhabotinsky reaction is controlled using various heterogeneous cellular automata. A checkerboard image comprising of varying light intensity cells is projected onto the surface of a catalyst-loaded gel resulting in rich spatio-temporal chemical wave behaviour. The coevolved cellular automata are shown to be able to control chemical activity through dynamic control of the light intensity. The approach is demonstrated through the creation of a number of simple Boolean logic gates.
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs
Authors: Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

We present Tartanian, a game theory-based player for heads-up no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinite strategy space of no-limit poker, we develop a discretized betting model designed to capture the most important strategic choices in the game. Second, we employ potential-aware automated abstraction algorithms for identifying strategically similar situations in order to decrease the size of the game tree. Third, we develop a new technique for automatically generating the source code of an equilibrium-finding algorithm from an XML-based description of a game. This automatically generated program is more efficient than what would be possible with a general-purpose equilibrium-finding program. Finally, we present results from the AAAI-07 Computer Poker Competition, in which Tartanian placed second out of ten entries.
An Efficient PIR Construction Using Trusted Hardware
Authors: Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao
Venue: Proceedings of the 11th international conference on Information Security (2008)

For a private information retrieval (PIR) scheme to be deployed in practice, low communication complexity and low computation complexity are two fundamental requirements it must meet. Most existing PIR schemes only focus on the communication complexity. The reduction on the computational complexity did not receive the due treatment mainly because of its O(n) lower bound. By using the trusted hardware based model, we design a novel scheme which breaks this barrier. With constant storage, the computation complexity of our scheme, including offline computation, is linear to the number of queries and is bounded by ${\mathrm{O}}(\sqrt{n})$ after optimization.
Syndication on the Web using a description logic approach
Authors: Christian Halaschek-Wiener, Vladimir Kolovski
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2008)

Syndication systems on the Web have attracted vast amounts of attention in recent years. As technologies have emerged and matured, there has been a transition to more expressive syndication approaches; that is, subscribers and publishers are provided with more expressive means of describing their interests and published content, enabling more accurate information filtering. In this paper, we formalize a syndication architecture that utilizes the Web Ontology Language (OWL) and description logic reasoning for selective content dissemination. This provides finer grained control for filtering and automated reasoning for discovering implicit subscription matches, both of which are not achievable in less expressive approaches. We then address one of the main limitations with such a syndication approach, namely matching newly published information with subscription requests in an efficient and practical manner. To this end, we investigate incremental query answering for a large subset of OWL and present an approach to reduce the portion of the ontology that must be considered for query answering in the event of updates. Lastly, an evaluation of the query approach is shown, demonstrating its effectiveness for syndication purposes.
Volume Reconstruction by Inverse Interpolation: Application to Interleaved MR Motion Correction
Authors: Torsten Rohlfing, Martin H. Rademacher, Adolf Pfefferbaum
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

We introduce in this work a novel algorithm for volume reconstruction from data acquired on an irregular grid, e.g., from multiple co-registered images. The algorithm, which is based on an inverse interpolation formalism, is superior to other methods in particular when the input images have lower spatial resolution than the reconstructed image. Local intensity bounds are enforced by an L-BFGS-B optimizer, regularize the reconstruction problem, and preserve the intensity distribution of the input images. We demonstrate the usefulness of our method by applying it to retrospective motion correction in interleaved MR images.
Histogram-Based Visual Object Recognition for the 2007 Four-Legged RoboCup League
Authors: Souzana Volioti, Michail G. Lagoudakis
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

RoboCup is an annual international robotic soccer competition. One of its most popular divisions is the Four-Legged League, whereby each team consists of four fully autonomous Sony AIBO robots and researchers focus solely on software development over a standard robotic platform. To compete successfully each robot needs to address a variety of problems: visual object recognition, legged locomotion, localization, and team coordination. This paper focuses on the problem of visual object recognition and suggests a uniform approach for recognizing the key objects in the RoboCup 2007 field: the two goals, the two beacons (colored landmarks), and the ball. The proposed method processes the color-segmented camera image and delivers the type, as well as an estimate of the distance and the angle with respect to the robot, of each recognized object in the current field of view. Our approach is based on a number of procedures which are used uniformly for all three types of objects: horizontal and vertical scanning of the image, identification of large colored areas through a finite state machine, clustering of colored areas through histograms, formation of a bounding box indicating possible presence of an object, and customized filtering for removing implausible indications. Our approach is compared against the approaches of two RoboCup teams (German Team 2004 and SPQR-Legged 2006) and is shown to be equally good or better in many cases. The proposed approach has been used successfully by Team Kouretes of the Technical University of Crete, Greece during various RoboCup events.
Bots Behaviors vs. Human Behaviors on Large-Scale Communication Networks (Extended Abstract)
Authors: Wei Lu, Ali A. Ghorbani
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

In this paper we propose a hierarchical framework for detecting and characterizing any types of botnets on a large-scale WiFi ISP network. In particular, we first analyze and classify the network traffic into different applications by using payload signatures and the cross-associations for IP addresses and ports. Then based on specific application community (e.g. IRC, HTTP, or Peer-to-Peer), we present a novel temporal-frequent characteristic of flows that leads the differentiation of malicious behaviors created by bots from normal network traffic generated by human beings. We evaluate our approach with over 160 million flows collected over five consecutive days on a large-scale network and preliminary results show the proposed approach successfully detects the IRC botnet flows from over 160 million flows with a high detection rate and an acceptable low false alarm rate.
Constrained Monocular Obstacle Perception with Just One Frame
Authors: Lluís Pacheco, Xavier Cufí, Javi Cobos
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

This paper presents a monocular perception system tested on wheeled mobile robots. Its significant contribution is the use of a single image to obtain depth information (one bit) when robots detect obstacles. The constraints refer to the environment. Flat and homogeneous floor radiance is assumed. Results emerge from using a set of multi-resolution focus measurement thresholds to avoid obstacle collision. The algorithm's simplicity and the robustness achieved can be considered the key points of this work. On-robot experimental results are reported and a broad range of indoor applications is possible. However, false obstacle detection occurs when the constraints fail. Thus, proposals to overcome it are explained.
Computational modeling of peristaltic pumping using the method of regularized stokeslets
Authors: Lisa Fauci
Venue:  (2008)

In this thesis, we provide a starting point for the development of computational models of both uterine and oviductal fluid mechanics. The method of regularized Stokeslets provides a framework that is easily implemented and may be adapted to include the full fluid-structure interactions that are observed physiologically. We compare our computational results to analytic results in settings where the geometry of the channel (in 213) or tube (in 3D) undergoes small amplitude, symmetric contractions. These comparisons allow us to validate our numerics, and give us insight into the choice of our numerical parameters. We demonstrate that our results for tapered channels and non-symmetric channels in two dimensions match the lubrication theory of Elad et al. [6]. We extend these simulations to three dimensions. In addition, we include an inserted catheter in our two-dimensional model, as in the finite element calculations presented by [25]. Finally, we present preliminary results of a full, three-dimensional model of a peristaltic tube with an inserted catheter.
A POS-Based Word Prediction System for the Persian Language
Authors: Masood Ghayoomi, Ehsan Daroodi
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

Word prediction is the problem of guessing the words which are likely to follow in a given text segment by displaying a list of the most probable words that could appear in that position. In this research, we designed and implemented three word predictors for Persian. Our baseline is a statistical-based system which uses language models. The first system uses word statistics; in the second one we use the main syntactic categories of a Persian POS tagged corpus; and the last one uses the main syntactic categories along with their morphological, syntactic and semantic subcategories. Using KeyStroke Saving (KSS) as the most important metrics to evaluate systems' performance, the primary word-based statistical system achieved 37% KSS, and the second system that used only the main syntactic categories with word-statistics achieved 38.95% KSS. Our last system which used all of the available information to the words get the best result by 42.45% KSS.
The Cape Cod System
Authors: C. Robert Wieser
Venue: IEEE Annals of the History of Computing (1983)

The Cape Cod System was an advanced-development prototype for the SAGE system. The paper discusses the evolution of the Cape Cod System, which used the Whirlwind computer, from its inception in 1951 through first operation in September 1953. 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
Tweaking TBE/IBE to PKE Transforms with Chameleon Hash Functions
Authors: Rui Zhang
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

We present two transforms to acquire chosen ciphertext security from tag based techniques. The first one requires the separability of underlying primitives. By separability, informally, we mean the encryption algorithm has special structures and can process the identity and the message independently. Compared with generic transforms [8],it significantly reduces the ciphertext size overhead with only marginal computation cost. Compared with [11], the only known technique which directly achieves chosen ciphertext secure public key encryption from separable identity based primitives, it only requires selective-Tag/ID security of underlying primitives. Our second transform is less efficient but performs generically. Both transforms preserve the public verifiability of underlying primitives, and can be extended to hierarchical identity based encryption (HIBE) and threshold settings. As an independent interest, we also investigate the security requirements of chameleon hash functions to build strongly unforgeable one-time signatures.
Performance Evaluation of a Multi-zone Application in Different OpenMP Approaches
Authors: Haoqiang Jin, Barbara Chapman, Lei Huang
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

We describe a performance study of a multi-zone application benchmark implemented in several OpenMP approaches that exploit multi-level parallelism and deal with unbalanced workload. The multi-zone application was derived from the well-known NAS Parallel Benchmarks (NPB) suite that involves flow solvers on collections of loosely coupled discretization meshes. Parallel versions of this application have been developed using the Subteam concept and Workqueuing model as extensions to the current OpenMP. We examine the performance impact of these extensions to OpenMP on a large shared memory machine and compare with hybrid and nested OpenMP programming models.
Robust Handwritten Character Recognition with Features Inspired by Visual Ventral Stream
Authors: Ali Borji, Mandana Hamidi, Fariborz Mahmoudi
Venue: Neural Processing Letters (2008)

This paper focuses on the applicability of the features inspired by the visual ventral stream for handwritten character recognition. A set of scale and translation invariant C2 features are first extracted from all images in the dataset. Three standard classifiers kNN, ANN and SVM are then trained over a training set and then compared over a separate test set. In order to achieve higher recognition rate, a two stage classifier was designed with different preprocessing in the second stage. Experiments performed to validate the method on the well-known MNIST database, standard Farsi digits and characters, exhibit high recognition rates and compete with some of the best existing approaches. Moreover an analysis is conducted to evaluate the robustness of this approach to orientation, scale and translation distortions.
Approximating Directed Weighted-Degree Constrained Networks
Authors: Zeev Nutov
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

Given a graph H = (V,F) with edge weights {w(e):e ¿ F}, the weighted degree of a node v in H is ¿ {w(vu):vu ¿ F}. We give bicriteria approximation algorithms for problems that seek to find a minimum cost directed graph that satisfies both intersecting supermodular connectivity requirements and weighted degree constraints. The input to such problems is a directed graph G = (V,E), edge-costs {c(e):e ¿ E}, edge-weights {w(e):e ¿ E}, an intersecting supermodular set-function f on V, and degree bounds {b(v):v ¿ V}. The goal is to find a minimum cost f-connected subgraph H = (V,F) (namely, at least f(S) edges in F enter every S ¿ V) of G with weighted degrees ≤ b(v). Our algorithm computes a solution of cost , so that the weighted degree of every v ¿ V is at most: 7 b(v) for arbitrary f and 5 b(v) for a 0,1-valued f; 2b(v) + 4 for arbitrary f and 2b(v) + 2 for a 0,1-valued f in the case of unit weights. Another algorithm computes a solution of cost and weighted degrees ≤ 6 b(v). We obtain similar results when there are both indegree and outdegree constraints, and better results when there are indegree constraints only: a (1,4)-approximation algorithm for arbitrary weights and a polynomial time algorithm for unit weights. Finally, we consider the problem of packing maximum number k of edge-disjoint arborescences so that their union satisfies weighted degree constraints, and give an algorithm that computes a solution of value at least $\lfloor k/36 \rfloor$.
From Separation Logic to Hyperedge Replacement and Back
Authors: Mike Dodds
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Hyperedge replacement grammars and separation-logic formulas both define classes of graph-like structures. In this paper, we describe two effective translations between restricted hyperedge replacement grammars and formulas in a fragment of separation logic. These translations preserve the semantics of formulas and grammars.