OpenRaiser/Intern-Atlas huggingface dataset:
Push-and-Track: Saving Infrastructure Bandwidth Through Opportunistic Forwarding
Venue: arXiv cs.NI 2012
Year: 2012

Major wireless operators are nowadays facing network capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a content dissemina- tion framework that harnesses ad hoc communication opportunities to minimize the load on the wireless infrastructure while guaranteeing tight delivery delays. It achieves this through a control loop that collects user-sent acknowledgements to determine if new copies need to be reinjected into the network through the 3G interface. Push-and-Track is flexible and can be applied to a variety of scenarios, including periodic message flooding and floating data. For the former, this paper examines multiple strategies to determine how many copies of the content should be injected, when, and to whom; for the latter, it examines the achievable offload ratio depending on the freshness constraints. The short delay-tolerance of common content, such as news or road traffic updates, make them suitable for such a system. Use cases with a long delay-tolerance, such as software updates, are an even better fit. Based on a realistic large-scale vehicular dataset from the city of Bologna composed of more than 10,000 vehicles, we demonstrate that Push-and-Track consistently meets its delivery objectives while reducing the use of the 3G network by about 90%.
Application of Integral Value Transformation (IVT) in a Specialized Computer Network Design
Venue: arXiv cs.DM 2012
Year: 2012

Integral Value Transformation (IVT) is a family of transformations from N0kto N0. An algebraic result has been established in p-adic IVT systems and an application of the result is described in this paper. The result in this paper provides the rule to find the pth pre image of a natural number for the Collatz like bijective functions in p-adic IVT systems. Using this result a routing algorithm is proposed. This proposed routing algorithm reduces number of address calculation.
Dynamic behavior analysis for a six axis industrial machining robot
Venue: arXiv cs.RO 2012
Year: 2012

The six axis robots are widely used in automotive industry for their good repeatability (as defined in the ISO92983) (painting, welding, mastic deposition, handling etc.). In the aerospace industry, robot starts to be used for complex applications such as drilling, riveting, fiber placement, NDT, etc. Given the positioning performance of serial robots, precision applications require usually external measurement device with complexes calibration procedure in order to reach the precision needed. New applications in the machining field of composite material (aerospace, naval, or wind turbine for example) intend to use off line programming of serial robot without the use of calibration or external measurement device. For those applications, the position, orientation and path trajectory precision of the tool center point of the robot are needed to generate the machining operation. This article presents the different conditions that currently limit the development of robots in robotic machining applications. We analyze the dynamical behavior of a robot KUKA KR240-2 (located at the University of Bordeaux 1) equipped with a HSM Spindle (42000 rpm, 18kW). This analysis is done in three stages. The first step is determining the self-excited frequencies of the robot structure for three different configurations of work. The second phase aims to analyze the dynamical vibration of the structure as the spindle is activated without cutting. The third stage consists of vibration analysis during a milling operation.
New Approach of Envelope Dynamic Analysis for Milling Process
Venue: arXiv cs.OH 2012
Year: 2012

This paper proposes a method to vibration analysis in order to on-line monitoring of milling process quality. Adapting envelope analysis to characterize the milling tool materials is an important contribution to the qualitative and quantitative characterization of milling capacity and a step by modeling the three-dimensional cutting process. An experimental protocol was designed and developed for the acquisition, processing and analyzing three-dimensional signal. The vibration envelope analysis is proposed to detect the cutting capacity of the tool with the optimization application of cutting parameters. The research is focused on FFT Fourier transform optimization of vibration analysis and vibration envelope to evaluate the dynamic behavior of the machine/ tool/workpiece
Faster Algorithms for Alternating Refinement Relations
Venue: arXiv cs.LO 2012
Year: 2012

One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires $O(n^3 \cdot m)$ time as compared to the previous known $O(n^6)$-time algorithm, where $n$ is the number of states and $m$ is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires $O(m^2)$-time as compared to the previous known $O((n \cdot m)^2)$-time algorithm, where $n$ is the number of states and $m$ is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.
Requirements and the baseline plan
Venue: arXiv cs.SE 2012
Year: 2012

For each software project a plan is developed, according to a documented procedure, that covers the software activities and commitments. The requirements allocated to software form the basis for the software development plan. Estimates for critical computer resources are documented, reviewed, and agreed to. All affected groups and individuals understand the estimates and plans and commit to support them. Senior management reviews the estimates and plans before external commitments are made. Software risks associated with the cost, resources, schedule, and technical aspects of the project are identified and evaluated, and contingencies are documented. Planning and estimation data are collected for use in planning subsequent projects and for input in management oversight review meetings.
The Knowledge-Based Economy and the Triple Helix Model
Venue: arXiv cs.OH 2012
Year: 2012

1. Introduction - the metaphor of a "knowledge-based economy"; 2. The Triple Helix as a model of the knowledge-based economy; 3. Knowledge as a social coordination mechanism; 4. Neo-evolutionary dynamics in a Triple Helix of coordination mechanism; 5. The operation of the knowledge base; 6. The restructuring of knowledge production in a KBE; 7. The KBE and the systems-of-innovation approach; 8. The KBE and neo-evolutionary theories of innovation; 8.1 The construction of the evolving unit; 8.2 User-producer relations in systems of innovation; 8.3 'Mode-2' and the production of scientific knowledge; 8.4 A Triple Helix model of innovations; 9. Empirical studies and simulations using the TH model; 10. The KBE and the measurement; 10.1 The communication of meaning and information; 10.2 The expectation of social structure; 10.3 Configurations in a knowledge-based economy
Technologie et pratiques bibliographiques associées à l'écriture scientifique en milieu universitaire
Venue: arXiv cs.DL 2012
Year: 2012

Observe and understand users of the Scientific and Technical Information, is preparing to offer them appropriate services. This exploratory study provides answers about the uses in the humanities, social sciences as well as technical sciences. We also observe those who assist teachers in their scientific research: librarians. Then we outline considerations and recommendations to specify functionalities of an efficient e-Linrary.
Alternatives to the Journal Impact Factor: I3 and the Top-10% (or Top-25%?) of the Most-Highly Cited Papers
Venue: arXiv cs.DL 2012
Year: 2012

Journal Impact Factors (IFs) can be considered historically as the first attempt to normalize citation distributions by using averages over two years. However, it has been recognized that citation distributions vary among fields of science and that one needs to normalize for this. Furthermore, the mean-or any central-tendency statistics-is not a good representation of the citation distribution because these distributions are skewed. Important steps have been taken to solve these two problems during the last few years. First, one can normalize at the article level using the citing audience as the reference set. Second, one can use non-parametric statistics for testing the significance of differences among ratings. A proportion of most-highly cited papers (the top-10% or top-quartile) on the basis of fractional counting of the citations may provide an alternative to the current IF. This indicator is intuitively simple, allows for statistical testing, and accords with the state of the art.
Estimation of the Covariance Matrix of Large Dimensional Data
Venue: arXiv cs.IT 2012
Year: 2012

This paper deals with the problem of estimating the covariance matrix of a series of independent multivariate observations, in the case where the dimension of each observation is of the same order as the number of observations. Although such a regime is of interest for many current statistical signal processing and wireless communication issues, traditional methods fail to produce consistent estimators and only recently results relying on large random matrix theory have been unveiled. In this paper, we develop the parametric framework proposed by Mestre, and consider a model where the covariance matrix to be estimated has a (known) finite number of eigenvalues, each of it with an unknown multiplicity. The main contributions of this work are essentially threefold with respect to existing results, and in particular to Mestre's work: To relax the (restrictive) separability assumption, to provide joint consistent estimates for the eigenvalues and their multiplicities, and to study the variance error by means of a Central Limit theorem.
On Synergy of Metal, Slicing, and Symbolic Execution
Venue: arXiv cs.PL 2012
Year: 2012

We introduce a novel technique for finding real errors in programs. The technique is based on a synergy of three well-known methods: metacompilation, slicing, and symbolic execution. More precisely, we instrument a given program with a code that tracks runs of state machines representing various kinds of errors. Next we slice the program to reduce its size without affecting runs of state machines. And then we symbolically execute the sliced program. Depending on the kind of symbolic execution, the technique can be applied as a stand-alone bug finding technique, or to weed out some false positives from an output of another bug-finding tool. We provide several examples demonstrating the practical applicability of our technique.
Solving the LPN problem in cube-root time
Venue: arXiv cs.CR 2012
Year: 2012

In this paper it is shown that given a sufficient number of (noisy) random binary linear equations, the Learning from Parity with Noise (LPN) problem can be solved in essentially cube root time in the number of unknowns. The techniques used to recover the solution are known from fast correlation attacks on stream ciphers. As in fast correlation attacks, the performance of the algorithm depends on the number of equations given. It is shown that if this number exceeds a certain bound, and the bias of the noisy equations is polynomial in number of unknowns, the running time of the algorithm is reduced to almost cube root time compared to the brute force checking of all possible solutions. The mentioned bound is explicitly given and it is further shown that when this bound is exceeded, the complexity of the approach can even be further reduced.
Production System Rules as Protein Complexes from Genetic Regulatory Networks
Venue: arXiv cs.NE 2012
Year: 2012

This short paper introduces a new way by which to design production system rules. An indirect encoding scheme is presented which views such rules as protein complexes produced by the temporal behaviour of an artificial genetic regulatory network. This initial study begins by using a simple Boolean regulatory network to produce traditional ternary-encoded rules before moving to a fuzzy variant to produce real-valued rules. Competitive performance is shown with related genetic regulatory networks and rule-based systems on benchmark problems.
Transporting Functions across Ornaments
Venue: arXiv cs.PL 2012
Year: 2012

Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of data-types: we can finally write correct-by-construction software. However, this extreme accuracy is also a curse: a data-type is the combination of a structuring medium together with a special purpose logic. These domain-specific logics hamper any effort of code reuse among similarly structured data. In this paper, we exorcise our data-types by adapting the notion of ornament to our universe of inductive families. We then show how code reuse can be achieved by ornamenting functions. Using these functional ornament, we capture the relationship between functions such as the addition of natural numbers and the concatenation of lists. With this knowledge, we demonstrate how the implementation of the former informs the implementation of the latter: the user can ask the definition of addition to be lifted to lists and she will only be asked the details necessary to carry on adding lists rather than numbers. Our presentation is formalised in a type theory with a universe of data-types and all our constructions have been implemented as generic programs, requiring no extension to the type theory.
Self-Organisation of Evolving Agent Populations in Digital Ecosystems
Venue: arXiv cs.NE 2012
Year: 2012

We investigate the self-organising behaviour of Digital Ecosystems, because a primary motivation for our research is to exploit the self-organising properties of biological ecosystems. We extended a definition for the complexity, grounded in the biological sciences, providing a measure of the information in an organism's genome. Next, we extended a definition for the stability, originating from the computer sciences, based upon convergence to an equilibrium distribution. Finally, we investigated a definition for the diversity, relative to the selection pressures provided by the user requests. We conclude with a summary and discussion of the achievements, including the experimental results.
Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks
Venue: arXiv cs.NI 2012
Year: 2012

A wireless sensor network has a wide application domain which is expanding everyday and they have been deployed pertaining to their application area. An application independent approach is yet to come to terms with the ongoing exploitation of the WSNs. In this paper we propose a decentralized lifetime maximizing tree for application independent data aggregation scheme using the clustering for data delivery in WSNs. The proposed tree will minimize the energy consumption which has been a resisting factor in the smooth working of WSNs as well as minimize the distance between the communicating nodes under the control of a sub-sink which further communicate and transfer data to the sink node.
A Knowledge Engineering Method for New Product Development
Venue: arXiv cs.OH 2012
Year: 2012

Engineering activities involve large groups of people from different domains and disciplines. They often generate important information flows that are difficult to manage. To face these difficulties, a knowledge engineering process is necessary to structure the information and its use. This paper presents a deployment of a knowledge capitalization process based on the enrichment of MOKA methodology to support the integration of Process Planning knowledge in a CAD System. Our goal is to help different actors to work collaboratively by proposing one referential view of the domain, the context and the objectives assuming that it will help them in better decision-making.
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
Venue: arXiv cs.LO 2012
Year: 2012

A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific simple trees and a structure is word automatic if it is encodable using only these trees. The question naturally arises whether a given tree automatic structure is already word automatic. We prove that this problem is decidable for tree automatic scattered linear orderings. Moreover, we show that in case of a positive answer a word automatic presentation is computable from the tree automatic presentation.
Finding short vectors in a lattice of Voronoi's first kind
Venue: arXiv cs.IT 2012
Year: 2012

We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph.
A dependent nominal type theory
Venue: arXiv cs.LO 2012
Year: 2012

Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and ML-like polymorphic languages have been studied, but decidability and normalization results have only been established for simple nominal type theories. We present a LF-style dependent type theory extended with name-abstraction types, prove soundness and decidability of beta-eta-equivalence checking, discuss adequacy and canonical forms via an example, and discuss extensions such as dependently-typed recursion and induction principles.
Entropy functions and determinant inequalities
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, we show that the characterisation of all determinant inequalities for $n \times n$ positive definite matrices is equivalent to determining the smallest closed and convex cone containing all entropy functions induced by $n$ scalar Gaussian random variables. We have obtained inner and outer bounds on the cone by using representable functions and entropic functions. In particular, these bounds are tight and explicit for $n \le 3$, implying that determinant inequalities for $3 \times 3$ positive definite matrices are completely characterized by Shannon-type information inequalities.
Tableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge
Venue: arXiv cs.LO 2012
Year: 2012

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi-agent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for CMAEL(CD) and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using that result, we design an incremental tableau-building procedure that eventually constructs a satisfying Hintikka structure for every satisfiable input set of formulae of CMAEL(CD) and closes for every unsatisfiable input set of formulae.
A Transformation-based Implementation for CLP with Qualification and Proximity
Venue: arXiv cs.LO 2012
Year: 2012

Uncertainty in logic programming has been widely investigated in the last decades, leading to multiple extensions of the classical LP paradigm. However, few of these are designed as extensions of the well-established and powerful CLP scheme for Constraint Logic Programming. In a previous work we have proposed the SQCLP ({\em proximity-based qualified constraint logic programming}) scheme as a quite expressive extension of CLP with support for qualification values and proximity relations as generalizations of uncertainty values and similarity relations, respectively. In this paper we provide a transformation technique for transforming SQCLP programs and goals into semantically equivalent CLP programs and goals, and a practical Prolog-based implementation of some particularly useful instances of the SQCLP scheme. We also illustrate, by showing some simple---and working---examples, how the prototype can be effectively used as a tool for solving problems where qualification values and proximity relations play a key role. Intended use of SQCLP includes flexible information retrieval applications.
Separating the Effect of Independent Interference Sources with Rayleigh Faded Signal Link: Outage Analysis and Applications
Venue: arXiv cs.NI 2012
Year: 2012

We show that, for independent interfering sources and a signal link with exponentially distributed received power, the total probability of outage can be decomposed as a simple expression of the outages from the individual interfering sources. We give a mathematical proof of this result, and discuss some immediate implications, showing how it results in important simplifications to statistical outage analysis. We also discuss its application to two active topics of study: spectrum sharing, and sum of interference powers (e.g., lognormal) analysis.
Dynamic Session Key Exchange Method using Two S-Boxes
Venue: arXiv cs.CR 2012
Year: 2012

This paper presents modifications of the Diffie-Hellman (DH) key exchange method. The presented modifications provide better security than other key exchange methods. We are going to present a dynamic security that simultaneously realizes all the three functions with a high efficiency and then give a security analysis. It also presents secure and dynamic key exchange method. Signature, encryption and key exchange are some of the most important and foundational Crypto-graphical tools. In most cases, they are all needed to provide different secure functions. On the other hand, there are also some proposals on the efficient combination of key exchange. In this paper, we present a dynamic, reliable and secure method for the exchange of session key. Moreover, the proposed modification method could achieve better performance efficiency.
Mobile Ad Hoc Networks: A Comparative Study of QoS Routing Protocols
Venue: arXiv cs.NI 2012
Year: 2012

This Article presents a thorough overview of QoS routing metrics, resources and factors affecting performance of QoS routing protocols. The relative strength, weakness, and applicability of existing QoS routing protocols are also studied and compared. QoS routing protocols are classified according to the QoS metrics used type of QoS guarantee assured.
Deciding Entailment of Implications with Support and Confidence in Polynomial Space
Venue: arXiv cs.LO 2012
Year: 2012

Association Rules are a basic concept of data mining. They are, however, not understood as logical objects which can be used for reasoning. The purpose of this paper is to investigate a model based semantic for implications with certain constraints on their support and confidence in relational data, which then resemble association rules, and to present a possibility to decide entailment for them.