ppxscal/embedding_network huggingface dataset:
List-coloring the square of a subcubic graph
Authors: Daniel W. Cranston, Seog-Jin Kim
Venue: Journal of Graph Theory (2008)

The square G2 of a graph G is the graph with the same vertex set G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that every planar graph G with maximum degree &Delta;(G)&thinsp;=&thinsp;3 satisfies &chi;(G2)&thinsp;&le;&thinsp;7. Kostochka and Woodall conjectured that for every graph, the list-chromatic number of G2 equals the chromatic number of G2, that is, &chi;l(G2)&thinsp;=&thinsp;&chi;(G2) for all G. If true, this conjecture (together with Thomassen's result) implies that every planar graph G with &Delta;(G)&thinsp;=&thinsp;3 satisfies &chi;l(G2)&thinsp;&le;&thinsp;7. We prove that every connected graph (not necessarily planar) with &Delta;(G)&thinsp;=&thinsp;3 other than the Petersen graph satisfies &chi;l(G2)&thinsp;&le;8 (and this is best possible). In addition, we show that if G is a planar graph with &Delta;(G)&thinsp;=&thinsp;3 and girth g(G)&thinsp;&ge;&thinsp;7, then &chi;l(G2)&thinsp;&le;&thinsp;7. Dvo&rcaron;&aacute;k, &Scaron;krekovski, and Tancer showed that if G is a planar graph with &Delta;(G)&thinsp;=&thinsp;3 and girth g(G)&thinsp;&ge;&thinsp;10, then &chi;l(G2)&thinsp;&le;6. We improve the girth bound to show that if G is a planar graph with &Delta;(G)&thinsp;=&thinsp;3 and g(G)&thinsp;&ge;&thinsp;9, then &chi;l(G2)&thinsp;&le;&thinsp;6. All of our proofs can be easily translated into linear-time coloring algorithms. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 57: 65&ndash;87, 2008
Evaluation of the Impact of Multipath Data Dispersion for Anonymous TCP Connections
Authors: Marga Nacher, Carlos T. Calafate, Juan Carlos Cano, Pietro Manzoni
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Despite recent research efforts, wireless ad hoc networking technology remains especially prone to security attacks. In this work our contribution focuses on determining the optimal trade-off between traffic dispersion and TCP performance to reduce the chances of successful eavesdropping, while maintaining acceptable levels of throughput. For our experiments we propose a multipath-enhanced version of DSR, and we compare Tahoe, Reno and Sack TCP variants. Results show that multipath traffic dispersion impact on TCP throughput is bounded to a maximum of 25-35%, and that there is only a minimal dependence on the number of routes used, the number of consecutive packets sent on each route, the route selection algorithm or the TCP variant used.
Impact of Vertical Handovers on Cooperative Content Distribution Systems
Authors: Michael Duelli, Tobias Hobfeld, Dirk Staehle
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

In this paper, we evaluate the performance of a P2Pbased content distribution system in heterogeneous, wireless networks. The mobile users coordinate each other with cooperation strategies enabled by the multi-source download mechanism, as in eDonkey or BitTorrent. Due to the mobility, vertical handovers between different wireless access technologies are required which may result in transmission delays and IP address changes of the switching peer. Hence, connections among users have to be reestablished and downloading users are requeued at a providing peer's waiting queue. In detail, we investigate the impact of requeueing with each VHO as well as the use of mechanisms that preserve the IP address and connections beyond VHOs, like MobileIP. Another important phenomenon occurring with VHOs is the abrupt change of the available bandwidth, e.g., from a fast WLAN connection to a rather slow UMTS connection. We evaluate the download times for files by means of simulation while considering different load scenarios in today's and future network layouts of the B3G network. As a result of the performance evaluation, we derive a new time-based cooperation strategy that counters the impact of mobility. Instead of downloading individual blocks of a file, a user gets a time slot at a providing peer. We show that this leads to a significant performance gain.
Rigid Image Registration based on Pixel Grouping
Authors: Demetrios Gerogiannis, Christophoros Nikou, Aristidis Likas
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We propose a pixel similarity-based algorithm enabling accurate rigid registration between single and multimodal images. The method relies on the partitioning of a reference image by a Gaussian mixture model (GMM). This partition is then projected onto the image to be registered. The main idea is that a Gaussian component in the reference image corresponds to a Gaussian component in the image to be registered. If the images are correctly registered the total distance between the corresponding components is minimum. An advantage of the proposed method is that it may handle multidimensional (vector valued) images where histogram-based methods such as the widely used mutual information is not tractable due to the high dimension of the data. Also, experimental results indicate that, even in the case of images presenting low SNR, the proposed algorithm compares favorably to the histogram-based mutual information method that is widely used in a variety of applications.
Optimality and condensing of information flow through linear refinement
Authors: Fausto Spoto
Venue: Theoretical Computer Science (2007)

Detecting information flows inside a program is useful to check non-interference or independence of program variables, an important aspect of software security. In this paper we present a new abstract domain C expressing constancy of program variables. We then apply Giacobazzi and Scozzari's linear refinement to build a domain C->C which contains all input/output dependences between the constancy of program variables. We show that C->C is optimal, in the sense that it cannot be further linearly refined, and condensing, in the sense that a compositional, input-independent static analysis over C->C has the same precision as a non-compositional, input-driven analysis. Moreover, we show that C->C has a natural representation in terms of Boolean formulas, which is important since it allows one to use the efficient binary decision diagrams in its implementation. We then prove that C->C coincides with Genaim, Giacobazzi and Mastroeni's IF domain for information flows and with Amtoft and Banerjee's Independ domain for independence. This lets us extend to IF and Independ the properties that we proved for C->C: optimality, condensing and representation in terms of Boolean formulas. As a secondary result, it lets us conclude that IF and Independ are actually the same abstract domain, although completely different static analyses have been based on them.
Ontology-Based Semantic Integration Method for Domain-Specific Scientific Data
Authors: Changjun Hu, Xiaoming Zhang, Qian Zhao, Chongchong Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Sharing the huge amount of data existed and being produced in specific domain is of great significance for researches. The semantic heterogeneity has been identified as the most important and toughest problem when integrating various sources. This paper proposes a semantic data integration method to manipulate information scattered over many data sources in specific area of science. The method uses OWL ontology to represent the global semantics of domain model and the local semantics of heterogeneous sources respectively. Semantic mappings between global and local ontology are built in a mapping ontology. Semantic heterogeneity among the data sources is resolved by TBox reasoning, and there is no need to migrate data from data sources to ontology instances. Domain-specific Markup Language is used as the uniform format for query results to facilitate data exchange in the domain. The architecture and key components for implementing the method are presented. To further illustrate the method, the paper gives a case study to show how to integrate data semantically in material sciences.
Modelling nonlinearities and heavy tails via threshold normal mixture GARCH models
Authors: D. Giannikis, I. D. Vrontos, P. Dellaportas
Venue: Computational Statistics Data Analysis (2008)

A new class of flexible threshold normal mixture GARCH models is proposed for the analysis and modelling of the stylized facts appeared in many financial time series. A Bayesian stochastic method is developed and presented for the analysis of the proposed model allowing for automatic model determination and estimation of the thresholds and their unknown number. A computationally feasible algorithm that explores the posterior distribution of the threshold models is designed using Markov chain Monte Carlo stochastic search methods. A simulation study is conducted to assess the performance of the proposed method, and an empirical application of the proposed model is illustrated using real data.
Experiments with the n-tuple Method of Pattern Recognition
Authors: J. R. Ullmann
Venue: IEEE Transactions on Computers (1969)

The n-tuple method of pattern recognition has been simulated on a somewhat larger and more comprehensive scale than previously reported. The nonweighted version has been found to work better than the maximum likelihood weighted version, and to achieve about 93 percent successful recognition of unconstrained hand-printed numerals, but at the cost of about 42 million bits of storage.
BIMS: an information management system for biobanking in the 21st century
Authors: George Ölund, Pontus Lindqvist, Jan-Eric Litton
Venue: IBM Systems Journal (2007)

Although the mapping of the human genome has allowed researchers to integrate genomic data with demographic and life-style data for use in epidemiologic studies, the problem of merging and accessing data that originate in heterogeneous sources is yet to be overcome. In this paper we describe Biobank Information Management System (BIMS), a system designed to integrate data from various research studies in which data formats and data collection methods vary widely. In addition, BIMS handles data that are continually updated, provides a user interface that is easy to use and does not require programming skills, and controls access to data according to well-defined policy rules. We outline the current information management challenges in biobanking, describe the BIMS architecture and its main components, and discuss the extent to which it addresses the stated challenges.
Calibration and Image Generation of Mobile Projector-Camera Systems
Authors: Koji Hamada, Jun Sato
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The projector-camera system has recently been studied extensively as one of new information presenting systems. For generating screen images properly, it is important to calibrate projector-camera systems accurately. The existing methods for calibrating projector-camera systems are based on 4 markers on the screen and 4 light projections from projectors, and thus require at least 8 basis points totally in images. However, it is not easy to track 8 or more basis points reliably in images, if the projector camera system moves arbitrarily. Thus, we in this paper propose a method for generating screen images properly from less basis points in camera images.
Adaptive modelling of student diagnosis and material selection for on-line language learning
Authors: Timothy Read, Elena Bárcena Beatriz Barros, Felisa Verdejo
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

The use of interactive on-line environments in distance learning appears to be promising because they solve some of the difficulties teachers have maintaining control of individual student progress due to the large number of students present in such courses. However, in the case of language learning, work is still required to design a system that is as flexible and effective as an experienced teacher. In this paper I-PETER (Intelligent Personalised English Tutoring EnviRonment) is presented as an advance in this area. It has four domain models that represent linguistic and didactic knowledge. Its student linguistic knowledge model is richer than that typically used in language teaching: a student's command of English is evaluated by interpreting his/her performance on specific linguistic units in terms of three related criteria, rather than by a general linguistic competence ranking. This model enables error diagnosis to be undertaken using a Bayesian network, to reflect how teachers actually undertake the process in the classroom. The results of this diagnosis process enable a finer-grained control of material selection than is normally possible, giving rise to a course structure that is continuously adapted to individual student needs.
Parallel Binary Adders with a Minimum Number of Connections
Authors: A. Sakura
Venue: IEEE Transactions on Computers (1983)

An n-bit parallel binary adder consisting of NOR gates only in single-rail input logic is proved to require at least 17n + 1 connections for any value of n. Such an adder is proved to require at least 7n + 2 gates. An adder that attains these minimal values is shown. Also, it is concluded that some of the parallel adders with the minimum number of NOR gates derived by Lai and Muroga have the minimum number of connections as well as the minimum number of gates, except for the two modules for the two least significant bit positions.
Benchmarks on Japanese and American Supercomputers Preliminary Results
Authors: R. H. Mendez
Venue: IEEE Transactions on Computers (1984)

A partial summary of preliminary benchmark results on Japanese and American supercomputers is given. While the results indicate similar scalar capabilities between the Fujitsu VP-200 supercomputer and the one-CPU XMP, they give the Fujitsu VP-200 a clear edge over the one-CPU XMP in vector performance.
A Platform for Mobile Text Entry Methods Evaluation
Authors: Franck Poirier, Hamed H. Sad
Venue: Proceedings of the First International Conference on Advances in Computer-Human Interaction (2008)

We present a platform for mobile text entry evaluation. The platform comprises two parts: the experimentation part and the analysis and design support part. The experimentation part is available in two environments: it can run, on top of the .NET framework, on a mobile device or on the desktop computer. This part is designed to save time and effort in the empirical evaluation process and to enhance the comparison of results from different experiments. The analysis and design support part is a collection of tools designed to support the evaluation. Our goal is to help in carrying out evaluation and to make a step on the way to the standardization of the evaluation process.
Information Usage System by Static Portal Page
Authors: Kazuya Odagiri, Rihito Yaegashi, Masaharu Tadauchi, Naohiro Ishii
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

As a communication mean, Personal Portal which is an entrance where each user can acquire his/her interested information on the network, is often used. We have problems on the existing Personal Portal described as follows. First, the program to realize the Personal Portal which is located on a specific Web Server, becomes large-scaled and complicated. Because Web pages as Personal Portal depend on that program, those Web pages can't always be useful for each user equally. Therefore, to solve these problems, we developed two kinds of new Web Service which are realized on the network with DACS(Destination Addressing Control System) Scheme, which is the network management scheme by communication control of client computers. By use of these Web Services, each user can create the customized Personal Portal, which displays the information by a user unit, for using in actual network easily and freely for oneself. That is, a free information usage system is realized.
Motor Control Techniques for Figure Animation
Authors: D. Zeltzer
Venue: IEEE Computer Graphics and Applications (1982)

Computer models of skeletons may not show muscle tissue or clothing, but they are an excellent means of displaying the fundamental properties of human motion.
Dynamic Syntax Specification Using Grammar Forms
Authors: S. Ginsburg
Venue: IEEE Transactions on Software Engineering (1978)

A conceptually simple scheme is exhibited for specifying syntactically correct programs of declarative, block-structured programming languages. The method is then demonstrated on a selected subset of PL/1. The scheme itself is based on grammar forms, a concept recently introduced to provide a unified treatment of structurally related grammars. The form grammar provides the BNF equivalent for the syntax. The interpretations of the grammar form are constructed dynamically during the scanning of the input program and map the form grammar into a context-free grammar satisfying the constraints of the given programming language.
Quantum information retrieval and gene networks
Authors: Dimitri Petritis, Thomas Sierocinski
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

We report on the use of quantum information retrieval methods to enhance, by automatic contextualisation, the relevance of retrieved documents. This methods mimics brain ability of contextualisation and association and proves useful in organising information from DNA micro-arrays.
Expression Reduction Systems with Patterns
Authors: Julien Forest, Delia Kesner
Venue: Journal of Automated Reasoning (2007)

We introduce a new higher-order rewriting formalism, called expression reduction systems with patterns (ERSP), where abstraction is allowed not only on variables but also on nested patterns with metavariables. These patterns are built by combining standard algebraic patterns with choice constructors denoting cases. In other words, the nondeterministic choice between different rewrite rules which is inherent to classical rewriting formalisms can be lifted here to the level of patterns. We show that confluence holds for a reasonable class of systems and terms.
Energy-Efficient Multi-Path Routing with Short Latency and Low Overhead for Wireless Sensor Networks
Authors: Liming He
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In wireless sensor networks (WSNs), multi-path routing can find multiple paths from source node to sink node for achieving high reliability and high energy-efficiency. However, the existing multi-path routing protocols in the literature construct multiple paths with long latency and high overhead [9] [10] [11]. In this paper, a novel multi-path routing protocol for WSNs is proposed, which can discover multiple paths with short latency and low overhead. Additionally, its energy efficiency is higher than that of the existing ones. Performance analyses and simulation results show that our proposed protocol has much better performance than the existing ones in terms of latency, overhead and network lifetime.
General pattern of global system conflicts and global threats of the 21st century
Authors: M. Z. Zgurovsky
Venue: Cybernetics and Systems Analysis (2007)

Data on global conflicts took place from 750 B.C. up to now are analyzed and their general pattern is revealed. An attempt is made to foresee the next global conflict called the conflict of the 21st century. Its nature and main characteristics are analyzed. Main global threats are listed, and their impact on five groups of countries is determined using cluster analysis.
Regulatory-compliant data management
Authors: Radu Sion, Marianne Winslett
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Digital societies and markets increasingly mandate consistent procedures for the access, processing and storage of information. In the United States alone, over 10,000 such regulations can be found in financial, life sciences, health - care and government sectors, including the Gramm - Leach - Bliley Act, Health Insurance Portability and Accountability Act, and Sarbanes - Oxley Act. A recurrent theme in these regulations is the need for regulatory - compliant data management as an underpinning to ensure data confidentiality, access integrity and authentication; provide audit trails, guaranteed deletion, and data migration; and deliver Write Once Read Many (WORM) assurances, essential for enforcing long - term data retention and life - cycle policies.
An extension of the Burrows–Wheeler Transform
Authors: S. Mantaci, A. Restivo, G. Rosone, M. Sciortino
Venue: Theoretical Computer Science (2007)

We describe and highlight a generalization of the Burrows-Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A^*. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt.
Progressive Deformation Based Approximation for Deforming Meshes
Authors: Shixue Zhang, Enhua Wu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In computer graphics, investigation has been made in many years in mesh simplification to alleviate the workload of visualization processing. However, most of the algorithms proposed focus on static meshes, only few works have been proposed for simplifying deforming surfaces. In this paper, we propose a novel method for generating progressive multiresolution models of deforming meshes. By the method we use an improved QEM cost as our basic metric to generate a base hierarchy. The sequence of the simplified models is generated progressively. Based on the edge collapse sequence in the previous frame, edge contraction order is adjusted according to the deformation degree in the current frame. Thus our algorithm is deformation oriented, and is aimed at preserving features in large deforming areas. We demonstrate that our method works efficiently and can generate better approximations with well-preserved features than previous methods.