OpenRaiser/Intern-Atlas huggingface dataset:
Gliders2012: Development and Competition Results
Venue: arXiv cs.AI 2012
Year: 2012

The RoboCup 2D Simulation League incorporates several challenging features, setting a benchmark for Artificial Intelligence (AI). In this paper we describe some of the ideas and tools around the development of our team, Gliders2012. In our description, we focus on the evaluation function as one of our central mechanisms for action selection. We also point to a new framework for watching log files in a web browser that we release for use and further development by the RoboCup community. Finally, we also summarize results of the group and final matches we played during RoboCup 2012, with Gliders2012 finishing 4th out of 19 teams.
Stochastic receding horizon control of nonlinear stochastic systems with probabilistic state constraints
Venue: arXiv cs.SY 2012
Year: 2012

The paper describes a receding horizon control design framework for continuous-time stochastic nonlinear systems subject to probabilistic state constraints. The intention is to derive solutions that are implementable in real-time on currently available mobile processors. The approach consists of decomposing the problem into designing receding horizon reference paths based on the drift component of the system dynamics, and then implementing a stochastic optimal controller to allow the system to stay close and follow the reference path. In some cases, the stochastic optimal controller can be obtained in closed form; in more general cases, pre-computed numerical solutions can be implemented in real-time without the need for on-line computation. The convergence of the closed loop system is established assuming no constraints on control inputs, and simulation results are provided to corroborate the theoretical predictions.
A Process Calculus for Spatially-explicit Ecological Models
Venue: arXiv cs.LO 2012
Year: 2012

We propose PALPS, a Process Algebra with Locations for Population Systems. PALPS allows us to produce spatially-explicit, individual-based models and to reason about their behavior. Our calculus has two levels: at the first level we may define the behavior of an individual of a population while, at the second level, we may specify a system as the collection of individuals of various species located in space, moving through their life cycle while changing their location, if they so wish, and interacting with each other in various ways such as preying on each other. Furthermore, we propose a probabilistic temporal logic for reasoning about the behavior of PALPS processes. We illustrate our framework via models of dispersal in metapopulations.
Combining Insertion and Deletion in RNA-editing Preserves Regularity
Venue: arXiv cs.FL 2012
Year: 2012

Inspired by RNA-editing as occurs in transcriptional processes in the living cell, we introduce an abstract notion of string adjustment, called guided rewriting. This formalism allows simultaneously inserting and deleting elements. We prove that guided rewriting preserves regularity: for every regular language its closure under guided rewriting is regular too. This contrasts an earlier abstraction of RNA-editing separating insertion and deletion for which it was proved that regularity is not preserved. The particular automaton construction here relies on an auxiliary notion of slice sequence which enables to sweep from left to right through a completed rewrite sequence.
Towards modular verification of pathways: fairness and assumptions
Venue: arXiv cs.LO 2012
Year: 2012

Modular verification is a technique used to face the state explosion problem often encountered in the verification of properties of complex systems such as concurrent interactive systems. The modular approach is based on the observation that properties of interest often concern a rather small portion of the system. As a consequence, reduced models can be constructed which approximate the overall system behaviour thus allowing more efficient verification. Biochemical pathways can be seen as complex concurrent interactive systems. Consequently, verification of their properties is often computationally very expensive and could take advantage of the modular approach. In this paper we report preliminary results on the development of a modular verification framework for biochemical pathways. We view biochemical pathways as concurrent systems of reactions competing for molecular resources. A modular verification technique could be based on reduced models containing only reactions involving molecular resources of interest. For a proper description of the system behaviour we argue that it is essential to consider a suitable notion of fairness, which is a well-established notion in concurrency theory but novel in the field of pathway modelling. We propose a modelling approach that includes fairness and we identify the assumptions under which verification of properties can be done in a modular way. We prove the correctness of the approach and demonstrate it on the model of the EGF receptor-induced MAP kinase cascade by Schoeberl et al.
Unilaterally Competitive Multi-Player Stopping Games
Venue: arXiv cs.GT 2012
Year: 2012

A multi-player competitive Dynkin stopping game is constructed. Each player can either exit the game for a fixed payoff, determined a priori, or stay and receive an adjusted payoff depending on the decision of other players. The single period case is shown to be "weakly unilaterally competitive". We present an explicit construction of the unique value at which Nash and optimal equilibria are attained. Multiple period generalisations are explored. The game has interpretations in economic and financial contexts, for example, as a consumption model with bounded resources. It also serves as a starting point to the construction of multi-person financial game options. In particular, the concept of optimal equilibria becomes pivotal in the pricing of the game options via super-replication.
Secondary Constructions of Bent Functions and Highly Nonlinear Resilient Functions
Venue: arXiv cs.CR 2012
Year: 2012

In this paper, we first present a new secondary construction of bent functions (building new bent functions from two already defined ones). Furthermore, we apply the construction using as initial functions some specific bent functions and then provide several concrete constructions of bent functions. The second part of the paper is devoted to the constructions of resilient functions. We give a generalization of the indirect sum construction for constructing resilient functions with high nonlinearity. In addition, we modify the generalized construction to ensure a high nonlinearity of the constructed function.
Dissemination of Health Information within Social Networks
Venue: arXiv cs.SI 2012
Year: 2012

In this paper, we investigate, how information about a common food born health hazard, known as Campylobacter, spreads once it was delivered to a random sample of individuals in France. The central question addressed here is how individual characteristics and the various aspects of social network influence the spread of information. A key claim of our paper is that information diffusion processes occur in a patterned network of social ties of heterogeneous actors. Our percolation models show that the characteristics of the recipients of the information matter as much if not more than the characteristics of the sender of the information in deciding whether the information will be transmitted through a particular tie. We also found that at least for this particular advisory, it is not the perceived need of the recipients for the information that matters but their general interest in the topic.
Effect of AWGN & Fading (Raleigh & Rician) channels on BER performance of a WiMAX communication System
Venue: arXiv cs.NI 2012
Year: 2012

The emergence of WIMAX has attracted significant interests from all fields of wireless communications including students, researchers, system engineers and operators. The WIMAX can also be considered to be the main technology in the implementation of other networks like wireless sensor networks. Developing an understanding of the WIMAX system can be achieved by looking at the model of the WIMAX system. This paper discusses the model building of the WIMAX physical layer using computer MATLAB 7.5 versions. This model is a useful tool for BER (Bit error rate) performance evaluation for the real data communication by the WIMAX physical layer under different communication channels AWGN and fading channel (Rayleigh and Rician), different channel encoding rates and digital modulation schemes which is described in this paper. This paper investigates the effect of communication channels of IEEE 802.16 OFDM based WIMAX Physical Layer. The performance measures we presented in this paper are: the bit error rate (BER) versus the ratio of bit energy to noise power spectral density (Eb/No). The system parameters used in this paper are based on IEEE 802.16 standards. The simulation model built for this research work, demonstrates that AWGN channel has better performance than Rayleigh and Rician fading channels. Synthetic data is used to simulate this research work.
Real root refinements for univariate polynomial equations
Venue: arXiv cs.NA 2012
Year: 2012

Real root finding of polynomial equations is a basic problem in computer algebra. This task is usually divided into two parts: isolation and refinement. In this paper, we propose two algorithms LZ1 and LZ2 to refine real roots of univariate polynomial equations. Our algorithms combine Newton's method and the secant method to bound the unique solution in an interval of a monotonic convex isolation (MCI) of a polynomial, and have quadratic and cubic convergence rates, respectively. To avoid the swell of coefficients and speed up the computation, we implement the two algorithms by using the floating-point interval method in Maple15 with the package intpakX. Experiments show that our methods are effective and much faster than the function RefineBox in the software Maple15 on benchmark polynomials.
Building a health care data warehouse for cancer diseases
Venue: arXiv cs.DB 2012
Year: 2012

This paper presents architecture for health care data warehouse specific to cancer diseases which could be used by executive managers, doctors, physicians and other health professionals to support the healthcare process. The data today existing in multi-sources with different formats makes it necessary to have some techniques for data integration. Executive managers need access to Information so that decision makers can react in real time to changing needs. Information is one of the most factors to an organization success that executive managers or physicians would need to base their decisions on, during decision making. A health care data warehouse is therefore necessary to integrate the different data sources into a central data repository and analysis this data.
Discrete-Time Poles and Dynamics of Discontinuous Mode Boost and Buck Converters Under Various Control Schemes
Venue: arXiv cs.SY 2012
Year: 2012

Nonlinear systems, such as switching DC-DC boost or buck converters, have rich dynamics. A simple one-dimensional discrete-time model is used to analyze the boost or buck converter in discontinuous conduction mode. Seven different control schemes (open-loop power stage, voltage mode control, current mode control, constant power load, constant current load, constant-on-time control, and boundary conduction mode) are analyzed systematically. The linearized dynamics is obtained simply by taking partial derivatives with respect to dynamic variables. In the discrete-time model, there is only a single pole and no zero. The single closed-loop pole is a linear combination of three terms: the open-loop pole, a term due to the control scheme, and a term due to the non-resistive load. Even with a single pole, the phase response of the discrete-time model can go beyond -90 degrees as in the two-pole average models. In the boost converter with a resistive load under current mode control, adding the compensating ramp has no effect on the pole location. Increasing the ramp slope decreases the DC gain of control-to-output transfer function and increases the audio-susceptibility. Similar analysis is applied to the buck converter with a non-resistive load or variable switching frequency. The derived dynamics agrees closely with the exact switching model and the past research results.
Continuous Models of Epidemic Spreading in Heterogeneous Dynamically Changing Random Networks
Venue: arXiv cs.SI 2012
Year: 2012

Modeling spreading processes in complex random networks plays an essential role in understanding and prediction of many real phenomena like epidemics or rumor spreading. The dynamics of such systems may be represented algorithmically by Monte-Carlo simulations on graphs or by ordinary differential equations (ODEs). Despite many results in the area of network modeling the selection of the best computational representation of the model dynamics remains a challenge. While a closed form description is often straightforward to derive, it generally cannot be solved analytically; as a consequence the network dynamics requires a numerical solution of the ODEs or a direct Monte-Carlo simulation on the networks. Moreover, Monte-Carlo simulations and ODE solutions are not equivalent since ODEs produce a deterministic solution while Monte-Carlo simulations are stochastic by nature. Despite some recent advantages in Monte-Carlo simulations, particularly in the flexibility of implementation, the computational cost of an ODE solution is much lower and supports accurate and detailed output analysis such as uncertainty or sensitivity analyses, parameter identification etc. In this paper we propose a novel approach to model spreading processes in complex random heterogeneous networks using systems of nonlinear ordinary differential equations. We successfully apply this approach to predict the dynamics of HIV-AIDS spreading in sexual networks, and compare it to historical data.
Efficient Spectrum Sharing in the Presence of Multiple Narrowband Interference
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, we study the spectrum usage efficiency by applying wideband methods and systems to the existing analog systems and applications. The essential motivation of this work is to define the prospective coexistence between analog FM and digital Spread Spectrum systems in an efficient way sharing the same frequency band. The potential overlaid Spread Spectrum (SS) system can spectrally coincide within the existing narrowband Frequency Modulated (FM) broadcasting system upon several limitations, originating a key motivation for the use of the FM radio frequency band in many applications, encompassing wireless personal and sensors networks. The performance of the SS system due to the overlaying analog FM system, consisting of multiple narrowband FM stations, is investigated in order to derive the relevant bit error probability and maximum achievable data rates. The SS system uses direct sequence (DS) spreading, through maximal length pseudorandom sequences with long spreading codes. The SS signal is evaluated throughout theoretical and simulation-based performance analysis, for various types of spreading scenarios, for different carrier frequency offset (Δf) and signal-to-interference ratios, in order to derive valuable results for future developing and planning of an overlay scenario.
A Dataset for StarCraft AI \& an Example of Armies Clustering
Venue: arXiv cs.AI 2012
Year: 2012

This paper advocates the exploration of the full state of recorded real-time strategy (RTS) games, by human or robotic players, to discover how to reason about tactics and strategy. We present a dataset of StarCraft games encompassing the most of the games' state (not only player's orders). We explain one of the possible usages of this dataset by clustering armies on their compositions. This reduction of armies compositions to mixtures of Gaussian allow for strategic reasoning at the level of the components. We evaluated this clustering method by predicting the outcomes of battles based on armies compositions' mixtures components
Visiting All Sites with Your Dog
Venue: arXiv cs.CG 2012
Year: 2012

Given a polygonal curve P, a pointset S, and an ε> 0, we study the problem of finding a polygonal curve Q whose vertices are from S and has a Frechet distance less or equal to εto curve P. In this problem, Q must visit every point in S and we are allowed to reuse points of pointset in building Q. First, we show that this problem in NP-Complete. Then, we present a polynomial time algorithm for a special cases of this problem, when P is a convex polygon.
Artificial-Noise Alignment for Secure Multicast using Multiple Antennas
Venue: arXiv cs.IT 2012
Year: 2012

We propose an artificial-noise alignment scheme for multicasting a common-confidential message to a group of receivers. Our scheme transmits a superposition of information and noise symbols. The noise symbols are aligned at each legitimate receiver and hence the information symbols can be decoded. In contrast, the noise symbols completely mask the information symbols at the eavesdroppers. Our proposed scheme does not require the knowledge of the eavesdropper's channel gains at the transmitter for alignment, yet it achieves the best-known lower bound on the secure degrees of freedom. Our scheme is also a natural generalization of the approach of transmitting artificial noise in the null-space of the legitimate receiver's channel, previously proposed in the literature.
Minimal Evacuation Times and Stability
Venue: arXiv cs.NI 2012
Year: 2012

We consider a system where packets (jobs) arrive for processing using one of the policies in a given class. We study the connection between the minimal evacuation times and the stability region of the system under the given class of policies. The result is used to establish the equality of information theoretic capacity region and system stability region for the multiuser broadcast erasure channel with feedback.
Energy Aware Path Search for Sensor with parameters as used in agricultural field
Venue: arXiv cs.NI 2012
Year: 2012

Sensors placed in agricultural field should have long network life. Failure of node or link allows rerouting and establishing a new path from the source to the sink. In this paper, a new path is established such that it is energy aware during path discovery and is active for longer interval of time once it is established. The parameters used for simulation are as those used in agricultural application.
Key Generation and Certification using Multilayer Perceptron in Wireless communication(KGCMLP)
Venue: arXiv cs.CR 2012
Year: 2012

In this paper, a key generation and certification technique using multilayer perceptron (KGCMLP) has been proposed in wireless communication of data/information. In this proposed KGCMLP technique both sender and receiver uses an identical multilayer perceptrons. Both perceptrons are start synchronization by exchanging some control frames. During synchronization process message integrity test and synchronization test has been carried out. Only the synchronization test does not guarantee the security for this reason key certification phase also been introduced in KGCMLP technique. After Key generation and certification procedure synchronized identical weight vector forms the key for encryption/decryption. Parametric tests have been done and results are compared with some existing classical techniques, which show comparable results for the proposed technique.
Parallel BioScape: A Stochastic and Parallel Language for Mobile and Spatial Interactions
Venue: arXiv cs.LO 2012
Year: 2012

BioScape is a concurrent language motivated by the biological landscapes found at the interface of biology and biomaterials. It has been motivated by the need to model antibacterial surfaces, biofilm formation, and the effect of DNAse in treating and preventing biofilm infections. As its predecessor, SPiM, BioScape has a sequential semantics based on Gillespie's algorithm, and its implementation does not scale beyond 1000 agents. However, in order to model larger and more realistic systems, a semantics that may take advantage of the new multi-core and GPU architectures is needed. This motivates the introduction of parallel semantics, which is the contribution of this paper: Parallel BioScape, an extension with fully parallel semantics.
Adaptation of Web services to the context based on workflow: Approach for self-adaptation of service-oriented architectures to the context
Venue: arXiv cs.SE 2012
Year: 2012

The emergence of Web services in the information space, as well as the advanced technology of SOA, give tremendous opportunities for users in an ambient space or distant, empowerment and organizations in various fields application, such as geolocation, E-learning, healthcare, digital government, etc.. In fact, Web services are a solution for the integration of distributed information systems, autonomous, heterogeneous and self-adaptable to the context. However, as Web services can evolve in a dynamic environment in a well-defined context and according to events automatically, such as time, temperature, location, authentication, etc.. We are interested in improving their SOA to empower the Web services to be self adaptive contexts. In this paper, we propose a new trend of self adaptability of Web services context. Then applying these requirements in the architecture of the platform of adaptability to context WComp, by integrating the workflow. Our work is illustrated by a case study of authentication.
A Wireless Channel Sounding System for Rapid Propagation Measurements
Venue: arXiv cs.IT 2012
Year: 2012

Wireless systems are getting deployed in many new environments with different antenna heights, frequency bands and multipath conditions. This has led to an increasing demand for more channel measurements to understand wireless propagation in specific environments and assist deployment engineering. We design and implement a rapid wireless channel sounding system, using the Universal Software Radio Peripheral (USRP) and GNU Radio software, to address these demands. Our design measures channel propagation characteristics simultaneously from multiple transmitter locations. The system consists of multiple battery-powered transmitters and receivers. Therefore, we can set-up the channel sounder rapidly at a field location and measure expeditiously by analyzing different transmitters signals during a single walk or drive through the environment. Our design can be used for both indoor and outdoor channel measurements in the frequency range of 1 MHz to 6 GHz. We expect that the proposed approach, with a few further refinements, can transform the task of propagation measurement as a routine part of day-to-day wireless network engineering.
An Experiment on the Connection between the DLs' Family DL<ForAllPiZero> and the Real World
Venue: arXiv cs.AI 2012
Year: 2012

This paper describes the analysis of a selected testbed of Semantic Web ontologies, by a SPARQL query, which determines those ontologies that can be related to the description logic DL<ForAllPiZero>, introduced in [4] and studied in [9]. We will see that a reasonable number of them is expressible within such computationally efficient language. We expect that, in a long-term view, a temporalization of description logics, and consequently, of OWL(2), can open new perspectives for the inclusion in this language of a greater number of ontologies of the testbed and, hopefully, of the "real world".