ppxscal/embedding_network huggingface dataset:
Pseudorandom numbers and entropy conditions
Authors: István Berkes, Walter Philipp, Robert F. Tichy
Venue: Journal of Complexity (2007)

We investigate measures of pseudorandomness of finite sequences (x"n) of real numbers. Mauduit and Sarkozy introduced the ''well-distribution measure'', depending on the behavior of the sequence (x"n) along arithmetic subsequences (x"a"k"+"b). We extend this definition by replacing the class of arithmetic progressions by an arbitrary class A of sequences of positive integers and show that the so obtained measure is closely related to the metric entropy of the class A. Using standard probabilistic techniques, this fact enables us to give precise bounds for the pseudorandomness measure of classical constructions. In particular, we will be interested in ''truly'' random sequences and sequences of the form {n"k@w}, where {.} denotes fractional part, (n"k) is a given sequence of integers and @w@?[0,1).
Introducing a Relative Priority for the Shared-Protection Schemes
Authors: Nizar Bouabdallah, Bruno Sericola
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

One of the major challenges of optical network operators is ensuring the stringent levels of availability required by their highest class clients. To achieve this, we introduce relative priorities among the different primary connections contending for access to the shared-protection paths. In this paper, we provide an analytical model for the proposed priority-enabled scheme. As a key distinguishing feature from existing literature, we derive explicit analytic expressions for the average availability and service disruption rate for the different priority classes.
An Empirical Evaluation of the MuJava Mutation Operators
Authors: Ben H. Smith, Laurie Williams
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Mutation testing is used to assess the fault-finding effectiveness of a test suite. Information provided by mutation testing can also be used to guide the creation of additional valuable tests and/or to reveal faults in the implementation code. However, concerns about the time efficiency of mutation testing may prohibit its widespread, practical use. We conducted an empirical study using the MuClipse automated mutation testing plug-in for Eclipse on the back end of a small web-based application. The first objective of our study was to categorize the behavior of the mutants generated by selected mutation operators during successive attempts to kill the mutants. The results of this categorization can be used to inform developers in their mutant operator selection to improve the efficiency and effectiveness of their mutation testing. The second outcome of our study identified patterns in the implementation code that remained untested after attempting to kill all mutants.
Enforcing Privacy by Means of an Ontology Driven XACML Framework
Authors: Dhiah el Diehn I. Abou-Tair, Stefan Berlik, Udo Kelter
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Nowadays enforcing privacy in enterprises is recognized as an issue of impact. Actually, it is a big challenge to adapt normative laws and regulations in a software system. It is a challenging task to include the formalized laws and rules in enterprises since e.g. more than one regulation may affect the terms of privacy concerning one situation. Traditional access control provides a general mechanism for assigning rights to individual users or roles. In the context of privacy this is insufficient; it offers no means to fulfil certain aspects such as limitations to the duration for which private data may be stored. To enforce privacy in enterprises we further need a fine granular access control mechanism on the data entities to ensure that every aspect of privacy can be reflected. This paper provides a novel solution for this by means of ontologies. The usage of ontologies in our approach differs from the conventional form in focusing on generating access control policies which are adapted from our software framework to provide fine granular access on the diverse data sources.
Note: Planar Eulerian triangulations are equivalent to spherical Latin bitrades
Authors: Nicholas Cavenagh, Petr Lisoněk
Venue: Journal of Combinatorial Theory Series A (2008)

Given a pair of Latin squares, we may remove from both squares those cells that contain the same symbol in corresponding positions. The resulting pair T={P"1,P"2} of partial Latin squares is called a Latin bitrade. The number of filled cells in P"1 is called the size of T. There are at least two natural ways to define the genus of a Latin bitrade; the bitrades of genus 0 are called spherical. We construct a simple bijection between the isomorphism classes of planar Eulerian triangulations on v vertices and the main classes of spherical Latin bitrades of size v-2. Since there exists a fast algorithm (due to Batagelj, Brinkmann and McKay) for generating planar Eulerian triangulations up to isomorphism, our result implies that also spherical Latin bitrades can be generated very efficiently.
Xml schemas in Oracle XML DB
Authors: Ravi Murthy, Sandeepan Banerjee
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

The W3C XML Scheme language is becomimg increasingly popular for expressing the data model for XML documents. It is a powerful language that incorporates both strutural and datatype modeling features. There are many benefits to storing XML Schema compliant data in a database system, including better queryability, optimied updates and stronger validation. However, the fidelity of the XML document cannot be sacrificed. Thus, the fundamental problem facing database implementers is: how can XML Schemes be mapped to relational (and object-relational) database without losing schema semantics or data-fidelity? In this paper, we present the Oracle XML DB solution for a flexible mapping of XML Schemas to object-relational database. It preserves document fidelity, including ordering, namespaces, comments, processing instructions etc., and handles all the XML Schema semantics including cyclic definitions, dervations (extension and restriction), and wildcards. We also discuss various query and update optimiations that involve rewriting XPath operations to directly operate on the underlying relational data.
Learning Handwritten Digit Recognition by the Max-Min Posterior Pseudo-Probabilities Method
Authors: X. Chen, X. Liu, Y. Jia
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Learning is important for classifiers. This paper proposes a new approach to handwritten digit recognition based on the max-min posterior pseudo-probabilities framework for learning pattern classification. Each digit class is modeled as a posterior pseudo-probability function, the parameters in which are trained from positive and negative samples of this digit class using the max-min posterior pseudo-probabilities criterion. In the process of digit classification, an input pattern is classified as one of ten digit classes or refused as being unrecognized according to the posterior pseudo-probabilities. Experiments on NIST database show the effectiveness of the proposed approach in reducing the error rate and making rejection decisions to those input pattern which can not be reliably by even human.
Research on SOA-based Manufacturing Grid and Service Modes
Authors: Liu Lilan, He Yu'an, Yu Tao, Xiong Zonghui
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

With the rapid development of information technology and networked manufacturing technology, there is a need for resource owners to utilize and manage manufacturing resources effectively within the Manufacturing Grid (MG). Grid technologies can be aligned with Web service technologies in order to capitalize on desirable Web service properties and develop self describing, discoverable grid services. In this paper, we propose a Service-Oriented Architecture (SOA)-based MG framework which constructs MG services layer, MG toolkit layer and MG applications layer under the MG infrastructure layer. According to the SOA-based MG, we propose that the MG service modes follow the sequence which firstly constructs the single function service with fine granularity (basic services), secondly combines single function services to combination services with coarse granularity (application services), and finally constructs the manufacturing business process model.
Fault Tolerance via Diversity for Off-the-Shelf Products: A Study with SQL Database Servers
Authors: Ilir Gashi Peter Popov Lorenzo Strigini
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

If an off-the-shelf software product exhibits poor dependability due to design faults, software fault tolerance is often the only way available to users and system integrators to alleviate the problem. Thanks to low acquisition costs, even using multiple versions of software in a parallel architecture, a scheme formerly reserved for few and highly critical applications, may become viable for many applications. We have studied the potential dependability gains from these solutions for off-the-shelf database servers. We based the study on the bug reports available for four off-the-shelf SQL servers, plus later releases of two of them. We found that many of these faults cause systematic, non-crash failures, a category ignored by most studies and standard implementations of fault tolerance for databases. Our observations suggest that diverse redundancy would be effective for tolerating design faults in this category of products. Only in very few cases would demands that triggered a bug in one server cause failures in another one, and there were no coincident failures in more than two of the servers. Use of different releases of the same product would also tolerate a significant fraction of the faults. We report our results and discuss their implications, the architectural options available for exploiting them and the difficulties that they may present.
Template-Based Adaptive Video Coding Algorithm for High Resolution Laptop Video Conference Systems
Authors: Chundong Wang, Dejian Ye
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

There is a great demand to support high resolution local video conference in today's PCs. However,although PC is convenient and local access network bandwidth is sufficient, the computational capacity is a big bottleneck in high resolution laptop video conference system.
Content-based object movie retrieval and relevance feedbacks
Authors: Cheng-Chieh Chiang, Li-Wei Chan, Yi-Ping Hung, Greg C. Lee
Venue: EURASIP Journal on Advances in Signal Processing (2007)

Object movie refers to a set of images captured from different perspectives around a 3D object. Object movie provides a good representation of a physical object because it can provide 3D interactive viewing effect, but does not require 3D model reconstruction. In this paper, we propose an efficient approach for content-based object movie retrieval. In order to retrieve the desired object movie from the database, we first map an object movie into the sampling of a manifold in the feature space. Two different layers of feature descriptors, dense and condensed, are designed to sample the manifold for representing object movies. Based on these descriptors, we define the dissimilarity measure between the query and the target in the object movie database. The query we considered can be either an entire object movie or simply a subset of views. We further design a relevance feedback approach to improving retrieved results. Finally, some experimental results are presented to show the efficacy of our approach.
Speech Enhancement Employing Modified a Priori SNR Estimation
Authors: Shifeng Ou, Xiaohui Zhao, Ying Gao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In order to improve the performance of a speech enhancement system, Plapous introduced a novel method called two-step noise reduction (TSNR) technique to refine the a priori SNR estimation of the decision-directed (DD) approach. However, the performance of this method depends on the choice of gain function. In this paper, we propose a modified approach for the a priori SNR estimation in DCT domain with two steps like the TSNR method. While in the second step, the proposed approach computes directly the square of clean speech component using the estimated a priori SNR of the DD approach, its result is not restricted on the gain function, and thus the drawback of the TSNR method is removed while the advantages are kept. A number of objective tests under various conditions are provided, and the results show the improved performance of our approach.
A Grid-Based Energy Aware Node-Disjoint Multipath Routing Algorithm for MANETs
Authors: Zhengyu Wu, Xiangjun Dong, Lin Cui
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Now most of the on-demand routing protocols for current mobile ad hoc networks (MANETs) build and rely on single route for each data session. However, the single path is easily broken and needs to perform a route discovery process again due to the dynamic topology of ad hoc networks. In ad hoc networks, multipath routing is better suited than single path in stability and load balance. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANETs efficiently. In this paper, we propose a new routing algorithm called Grid-based Energy Aware Node-Disjoint Multipath Routing Algorithm (GEANDMRA). In GEANDMRA, grid partitioning is the same as in the GRID routing protocol. The main difference between these two protocols is that GEANDMRA considers energy- aware and node-disjoint multipath but the GRID does not. Simulation results indicate that GEANDMRA outperforms AODV and DSR.
Extending dependencies with conditions
Authors: Loreto Bravo, Wenfei Fan, Shuai Ma
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related data values. We show that CINDs are useful not only in data cleaning, but are also in contextual schema matching [7]. To make effective use of CINDs in practice, it is often necessary to reason about them. The most important static analysis issue concerns consistency, to determine whether or not a given set of CINDs has conflicts. Another issue concerns implication, i.e., deciding whether a set of CINDs entails another CIND. We give a full treatment of the static analyses of CINDs, and show that CINDs retain most nice properties of traditional INDs: (a) CINDs are always consistent; (b) CINDs are finitely axiomatizable, i.e., there exists a sound and complete inference system for implication of CINDs; and (c) the implication problem for CINDs has the same complexity as its traditional counterpart, namely, PSPACE-complete, in the absence of attributes with a finite domain; but it is EXPTIME-complete in the general setting. In addition, we investigate the interaction between CINDs and conditional functional dependencies (CFDs), an extension of functional dependencies proposed in [9]. We show that the consistency problem for the combination of CINDs and CFDs becomes undecidable. In light of the undecidability, we provide heuristic algorithms for the consistency analysis of CFDs and CINDs, and experimentally verify the effectiveness and efficiency of our algorithms.
The Need for Open Source Software in Machine Learning
Authors: Sören Sonnenburg, Mikio L. Braun, Cheng Soon Ong, Samy Bengio, Leon Bottou, Geoffrey Holmes, Yann LeCun, Klaus-Robert Müller, Fernando Pereira, Carl Edward Rasmussen, Gunnar Rätsch, Bernhard Schölkopf, Alexander Smola, Pascal Vincent, Jason Weston, Robert Williamson
Venue: The Journal of Machine Learning Research (2007)

Open source tools have recently reached a level of maturity which makes them suitable for building large-scale real-world systems. At the same time, the field of machine learning has developed a large body of powerful learning algorithms for diverse applications. However, the true potential of these methods is not used, since existing implementations are not openly shared, resulting in software with low usability, and weak interoperability. We argue that this situation can be significantly improved by increasing incentives for researchers to publish their software under an open source model. Additionally, we outline the problems authors are faced with when trying to publish algorithmic implementations of machine learning methods. We believe that a resource of peer reviewed software accompanied by short articles would be highly valuable to both the machine learning and the general scientific community.
Note: Unicyclic and bicyclic graphs having minimum degree distance
Authors: Alexandru Ioan Tomescu
Venue: Discrete Applied Mathematics (2008)

In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degree distance are given.
Selecting theories and nonce generation for recursive protocols
Authors: Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke
Venue: Proceedings of the 2007 ACM workshop on Formal methods in security engineering (2007)

Truderung's selecting theory model is one of the few models of cryptographic protocols which allows to model iterative (recursive) computations of principals and, at the same time, an automatic analysis in the following sense: there exists a procedure that checks whether in all runs of a given protocol a certain message is not revealed to an intruder. A major drawback of Truderung's model is that it allows only a finite number of constants, that is, there is no mechanism by which a principal can generate an unbounded number of fresh tokens such as nonces or session keys. We extend Truderung's model by such a mechanism and show that the extended model still allows an automatic analysis. We also demonstrate that the extended model is more appropriate to model the Recursive Authentication Protocol. It is important to know that after publication of Truderung's result it became clear that his proof only works in a restricted setting. We show that there is no hope to find a remedy to this by proving that the secrecy problem in the unrestricted setting is undecidable. In light of this, the aforementioned result about extending Truderung's model is to be read as follows. Adding anonymous constants in the restricted setting leads to a model of cryptographic protocols where insecurity is decidable.
Events And Interrupts in Tightly Coupled Multiprocessors
Authors: Hubert Kirrmann
Venue: IEEE Micro (1985)

In a decentralized multiprocessor, events must be stored, queued, and acknowledged. This can be accomplished by implementing a special event receiver called a synapse and by utilizing several forms of acknowledge.
A tool for creating speaking web pages: text-to-speech integrated development environment (TTS-IDE)
Authors: David C. Gibbs
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This paper describes an integrated development environment (IDE) which web authors may use to add synthesized speech to their browser-based presentations. Web authors use the IDE to input the text to be spoken. The IDE embeds that text within the HTML file for playback by a speech-enabled browser. Browsers currently supporting text-to-speech (TTS) are Microsoft Internet Explorer and Opera. The IDE works with either HTML files or Powerpoint Web Presentation files. Playback is controlled by a set of controls that "float" innocuously in the upper right hand corner of each page. Speaking pages can be used by online courses, training programs, or certification processes.
Singularity-theoretic methods in robot kinematics
Authors: P. S. Donelan
Venue: Robotica (2007)

The significance of singularities in the design and control of robot manipulators is well known, and there is an extensive literature on the determination and analysis of singularities for a wide variety of serial and parallel manipulators—indeed such an analysis is an essential part of manipulator design. Singularity theory provides methodologies for a deeper analysis with the aim of classifying singularities, providing local models and local and global invariants. This paper surveys applications of singularity-theoretic methods in robot kinematics and presents some new results.
A spatially distributed flash flood forecasting model
Authors: Günter Blöschl, Christian Reszler, Jürgen Komma
Venue: Environmental Modelling Software (2008)

This paper presents a distributed model that is in operational use for forecasting flash floods in northern Austria. The main challenge in developing the model was parameter identification which was addressed by a modelling strategy that involved a model structure defined at the model element scale and multi-source model identification. The model represents runoff generation on a grid basis and lumped routing in the river reaches. Ensemble Kalman Filtering is used to update the model states (grid soil moisture) based on observed runoff. The forecast errors as a function of forecast lead time are evaluated for a number of major events in the 622km^2 Kamp catchment and range from 10% to 30% for 4-24h lead times, respectively.
A class of SIR epidemic model with saturation incidence and age of infection
Authors: Junyuan Yang, Fengqin Zhang, Xiaoyan Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Saturating contact rate of individual contacts is very important in an epidemiology model. A class of SIR model with saturation incidence and age of infection is formulated in this paper. The dynamical behavior of the model is studied and the basic reproductive number R_0 is defined. It is proved that the diseased-free equilibrium is globally asymptotically stable if R_0 \le 1. The endemic equilibrium is locally asymptotically stable if K_1 \ge \alpha and R_0 \ge 1.
Gossiping in distributed systems
Authors: Anne-Marie Kermarrec, Maarten van Steen
Venue: ACM SIGOPS Operating Systems Review (2007)

Gossip-based algorithms were first introduced for reliably disseminating data in large-scale distributed systems. However, their simplicity, robustness, and flexibility make them attractive for more than just pure data dissemination alone. In particular, gossiping has been applied to data aggregation, overlay maintenance, and resource allocation. Gossiping applications more or less fit the same framework, with often subtle differences in algorithmic details determining divergent emergent behavior. This divergence is often difficult to understand, as formal models have yet to be developed that can capture the full design space of gossiping solutions. In this paper, we present a brief introduction to the field of gossiping in distributed systems, by providing a simple framework and using that framework to describe solutions for various application domains.