OpenRaiser/Intern-Atlas huggingface dataset:
NOVA: QoE-driven Optimization of DASH-based Video Delivery in Networks
Venue: arXiv cs.NI 2013
Year: 2013

We consider the problem of optimizing video delivery for a network supporting video clients streaming stored video. Specifically, we consider the problem of jointly optimizing network resource allocation and video quality adaptation. Our objective is to fairly maximize video clients' Quality of Experience (QoE) realizing tradeoffs among the mean quality, temporal variability in quality, and fairness, incorporating user preferences on rebuffering and cost of video delivery. We present a simple asymptotically optimal online algorithm, NOVA, to solve the problem. NOVA is asynchronous, and using minimal communication, distributes the tasks of resource allocation to network controller, and quality adaptation to respective video clients. Video quality adaptation in NOVA is also optimal for standalone video clients, and is well suited for use with DASH framework. Further, we extend NOVA for use with more general QoE models, networks shared with other traffic loads and networks using fixed/legacy resource allocation.
Through Wall People Localization Exploiting Radio Windows
Venue: arXiv cs.CR 2013
Year: 2013

We introduce and investigate the ability of an attacker to surreptitiously use an otherwise secure wireless network to detect moving people through walls, in an area in which people expect their location to be private. We call this attack on location privacy of people an "exploiting radio windows" (ERW) attack. We design and implement the ERW attack methodology for through wall people localization that relies on reliably detecting when people cross the link lines by using physical layer measurements between the legitimate transmitters and the attack receivers. We also develop a method to estimate the direction of movement of a person from the sequence of link lines crossed during a short time interval. Additionally, we describe how an attacker may estimate any artificial changes in transmit power (used as a countermeasure), compensate for these power changes using measurements from sufficient number of links, and still detect line crossings. We implement our methodology on WiFi and ZigBee nodes and experimentally evaluate the ERW attack by monitoring people movements through walls in two real-world settings. We find that our methods achieve very high accuracy in detecting line crossings and determining direction of motion.
The predecessor-existence problem for k-reversible processes
Venue: arXiv cs.DS 2013
Year: 2013

For k>=1, we consider the graph dynamical system known as a k-reversible process. In such process, each vertex in the graph has one of two possible states at each discrete time. Each vertex changes its state between the present time and the next if and only if it currently has at least k neighbors in a state different than its own. Given a k-reversible process and a configuration of states assigned to the vertices, the Predecessor Existence problem consists of determining whether this configuration can be generated by the process from another configuration within exactly one time step. We can also extend the problem by asking for the number of configurations from which a given configuration is reachable within one time step. Predecessor Existence can be solved in polynomial time for k=1, but for k>1 we show that it is NP-complete. When the graph in question is a tree we show how to solve it in O(n) time and how to count the number of predecessor configurations in O(n^2) time. We also solve Predecessor Existence efficiently for the specific case of 2-reversible processes when the maximum degree of a vertex in the graph is no greater than 3. For this case we present an algorithm that runs in O(n) time.
On the Catalyzing Effect of Randomness on the Per-Flow Throughput in Wireless Networks
Venue: arXiv cs.PF 2013
Year: 2013

This paper investigates the throughput capacity of a flow crossing a multi-hop wireless network, whose geometry is characterized by general randomness laws including Uniform, Poisson, Heavy-Tailed distributions for both the nodes' densities and the number of hops. The key contribution is to demonstrate \textit{how} the \textit{per-flow throughput} depends on the distribution of 1) the number of nodes $N_j$ inside hops' interference sets, 2) the number of hops $K$, and 3) the degree of spatial correlations. The randomness in both $N_j$'s and $K$ is advantageous, i.e., it can yield larger scalings (as large as $Θ(n)$) than in non-random settings. An interesting consequence is that the per-flow capacity can exhibit the opposite behavior to the network capacity, which was shown to suffer from a logarithmic decrease in the presence of randomness. In turn, spatial correlations along the end-to-end path are detrimental by a logarithmic term.
Learning to Understand by Evolving Theories
Venue: arXiv cs.LG 2013
Year: 2013

In this paper, we describe an approach that enables an autonomous system to infer the semantics of a command (i.e. a symbol sequence representing an action) in terms of the relations between changes in the observations and the action instances. We present a method of how to induce a theory (i.e. a semantic description) of the meaning of a command in terms of a minimal set of background knowledge. The only thing we have is a sequence of observations from which we extract what kinds of effects were caused by performing the command. This way, we yield a description of the semantics of the action and, hence, a definition.
Multicategory Crowdsourcing Accounting for Plurality in Worker Skill and Intention, Task Difficulty, and Task Heterogeneity
Venue: arXiv cs.IR 2013
Year: 2013

Crowdsourcing allows to instantly recruit workers on the web to annotate image, web page, or document databases. However, worker unreliability prevents taking a workers responses at face value. Thus, responses from multiple workers are typically aggregated to more reliably infer ground-truth answers. We study two approaches for crowd aggregation on multicategory answer spaces stochastic modeling based and deterministic objective function based. Our stochastic model for answer generation plausibly captures the interplay between worker skills, intentions, and task difficulties and allows us to model a broad range of worker types. Our deterministic objective based approach does not assume a model for worker response generation. Instead, it aims to maximize the average aggregate confidence of weighted plurality crowd decision making. In both approaches, we explicitly model the skill and intention of individual workers, which is exploited for improved crowd aggregation. Our methods are applicable in both unsupervised and semisupervised settings, and also when the batch of tasks is heterogeneous. As observed experimentally, the proposed methods can defeat tyranny of the masses, they are especially advantageous when there is a minority of skilled workers amongst a large crowd of unskilled and malicious workers.
Flow-level performance of random wireless networks
Venue: arXiv cs.IT 2013
Year: 2013

We study the flow-level performance of random wireless networks. The locations of base stations (BSs) follow a Poisson point process. The number and positions of active users are dynamic. We associate a queue to each BS. The performance and stability of a BS depend on its load. In some cases, the full distribution of the load can be derived. Otherwise we derive formulas for the first and second moments. Networks on the line and on the plane are considered. Our model is generic enough to include features of recent wireless networks such as 4G (LTE) networks. In dense networks, we show that the inter-cell interference power becomes normally distributed, simplifying many computations. Numerical experiments demonstrate that in cases of practical interest, the loads distribution can be well approximated by a gamma distribution with known mean and variance.
Participation anticipating in elections using data mining methods
Venue: arXiv cs.CY 2013
Year: 2013

Anticipating the political behavior of people will be considerable help for election candidates to assess the possibility of their success and to be acknowledged about the public motivations to select them. In this paper, we provide a general schematic of the architecture of participation anticipating system in presidential election by using KNN, Classification Tree and Naïve Bayes and tools orange based on crisp which had hopeful output. To test and assess the proposed model, we begin to use the case study by selecting 100 qualified persons who attend in 11th presidential election of Islamic republic of Iran and anticipate their participation in Kohkiloye & Boyerahmad. We indicate that KNN can perform anticipation and classification processes with high accuracy in compared with two other algorithms to anticipate participation.
PS-TRUST: Provably Secure Solution for Truthful Double Spectrum Auctions
Venue: arXiv cs.CR 2013
Year: 2013

Truthful spectrum auctions have been extensively studied in recent years. Truthfulness makes bidders bid their true valuations, simplifying greatly the analysis of auctions. However, revealing one's true valuation causes severe privacy disclosure to the auctioneer and other bidders. To make things worse, previous work on secure spectrum auctions does not provide adequate security. In this paper, based on TRUST, we propose PS-TRUST, a provably secure solution for truthful double spectrum auctions. Besides maintaining the properties of truthfulness and special spectrum reuse of TRUST, PS-TRUST achieves provable security against semi-honest adversaries in the sense of cryptography. Specifically, PS-TRUST reveals nothing about the bids to anyone in the auction, except the auction result. To the best of our knowledge, PS-TRUST is the first provably secure solution for spectrum auctions. Furthermore, experimental results show that the computation and communication overhead of PS-TRUST is modest, and its practical applications are feasible.
Adding Priority to Event Structures
Venue: arXiv cs.LO 2013
Year: 2013

Event Structures (ESs) are mainly concerned with the representation of causal relationships between events, usually accompanied by other event relations capturing conflicts and disabling. Among the most prominent variants of ESs are Prime ESs, Bundle ESs, Stable ESs, and Dual ESs, which differ in their causality models and event relations. Yet, some application domains require further kinds of relations between events. Here, we add the possibility to express priority relationships among events. We exemplify our approach on Prime, Bundle, Extended Bundle, and Dual ESs. Technically, we enhance these variants in the same way. For each variant, we then study the interference between priority and the other event relations. From this, we extract the redundant priority pairs-notably differing for the types of ESs-that enable us to provide a comparison between the extensions. We also exhibit that priority considerably complicates the definition of partial orders in ESs.
A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization
Venue: arXiv cs.FL 2013
Year: 2013

In this paper we present a unifying approach for deciding various bisimulations, simulation equivalences and preorders between two timed automata states. We propose a zone based method for deciding these relations in which we eliminate an explicit product construction of the region graphs or the zone graphs as in the classical methods. Our method is also generic and can be used to decide several timed relations. We also present a game characterization for these timed relations and show that the game hierarchy reflects the hierarchy of the timed relations. One can obtain an infinite game hierarchy and thus the game characterization further indicates the possibility of defining new timed relations which have not been studied yet. The game characterization also helps us to come up with a formula which encodes the separation between two states that are not timed bisimilar. Such distinguishing formulae can also be generated for many relations other than timed bisimilarity.
The categorical limit of a sequence of dynamical systems
Venue: arXiv cs.LO 2013
Year: 2013

Modeling a sequence of design steps, or a sequence of parameter settings, yields a sequence of dynamical systems. In many cases, such a sequence is intended to approximate a certain limit case. However, formally defining that limit turns out to be subject to ambiguity. Depending on the interpretation of the sequence, i.e. depending on how the behaviors of the systems in the sequence are related, it may vary what the limit should be. Topologies, and in particular metrics, define limits uniquely, if they exist. Thus they select one interpretation implicitly and leave no room for other interpretations. In this paper, we define limits using category theory, and use the mentioned relations between system behaviors explicitly. This resolves the problem of ambiguity in a more controlled way. We introduce a category of prefix orders on executions and partial history preserving maps between them to describe both discrete and continuous branching time dynamics. We prove that in this category all projective limits exist, and illustrate how ambiguity in the definition of limits is resolved using an example. Moreover, we show how various problems with known topological approaches are now resolved, and how the construction of projective limits enables us to approximate continuous time dynamics as a sequence of discrete time systems.
Wireless Information and Power Transfer in Two-Way Amplify-and-Forward Relaying Channels
Venue: arXiv cs.IT 2013
Year: 2013

The various wireless networks have made the ambient radio frequency signals around the world. Wireless information and power transfer enables the devices to recycle energy from these ambient radio frequency signals and process information simultaneously. In this paper, we develop a wireless information and power transfer protocol in two-way amplify-and-forward relaying channels, where two sources exchange information via an energy harvesting relay node. The relay node collects energy from the received signals and uses it to provide the transmission power to forward the received signals. We analytically derive the exact expressions of the outage probability, the ergodic capacity and the finite-SNR diversity-multiplexing trade-off (DMT). Furthermore, the tight closed-form upper and lower bounds of the outage probability and the ergodic capacity are then developed. Moreover, the impact of the power splitting ratio is also evaluated and analyzed. Finally, we show that compared to the non-cooperative relaying scheme, the proposed protocol is a green solution to offer higher transmission rate and more reliable communication without consuming additional resource.
Integration of 3D Object Recognition and Planning for Robotic Manipulation: A Preliminary Report
Venue: arXiv cs.AI 2013
Year: 2013

We investigate different approaches to integrating object recognition and planning in a tabletop manipulation domain with the set of objects used in the 2012 RoboCup@Work competition. Results of our preliminary experiments show that, with some approaches, close integration of perception and planning improves the quality of plans, as well as the computation times of feasible plans.
PotLLL: A Polynomial Time Version of LLL With Deep Insertions
Venue: arXiv cs.CR 2013
Year: 2013

Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm. In polynomial time it computes a reduced basis with provable output quality. One early improvement of the LLL algorithm was LLL with deep insertions (DeepLLL). The output of this version of LLL has higher quality in practice but the running time seems to explode. Weaker variants of DeepLLL, where the insertions are restricted to blocks, behave nicely in practice concerning the running time. However no proof of polynomial running time is known. In this paper PotLLL, a new variant of DeepLLL with provably polynomial running time, is presented. We compare the practical behavior of the new algorithm to classical LLL, BKZ as well as blockwise variants of DeepLLL regarding both the output quality and running time.
An Integrated Geographic Information System and Marketing Information System Model
Venue: arXiv cs.OH 2013
Year: 2013

Maintaining competitive advantage is significant in this present day of globalization, knowledge management and enormous economic activities. An organization's future developments are influenced by its managements' decisions. Businesses today are facing a lot of challenges in terms of competition and they have to be in the lead by strengthening their research and development strategies with the aid of cutting edge technologies. Hence marketing intelligence is now a key to the success of any business in today's rapidly changing business environment. With all the technologies available in marketing research, businesses still struggle with how to gather information and make decisions in a short time and real-time about their customers' needs and purchasing patterns in various geographical areas. This paper is set out to contribute to the body of knowledge in the area of the application of Geographic Information Systems technology solutions to businesses by developing a model for integrating Geographic Information Systems into existing Marketing Information Systems for effective marketing research. This model will interconnect organizations at the highest levels, providing reassurance to enable broad scope of checks and balances as well as benefiting many business activities including operational, tactical and strategic decision making due to its analytical and solution driven functions.
The Role of Rural Banks in Providing Mobile Money Services to Rural Poor Communities: An effective integration approach of Rural Banks and existing mobile communications infrastructure
Venue: arXiv cs.CY 2013
Year: 2013

The rapid spread of mobile phones means that the number of mobile users may already exceed the number of banked people in many low income countries. Mobile phones can also offer a communications channel for initiating and executing on-line financial transactions. This channel may not only reduce the cost of financial transactions for provider and customer, but also allow new entrants to the financial sector, and new relationships to be formed for distributing services. These changes hold the prospect of accelerating access to financial services on the back of the mobile infrastructure. Mobile telephony offers tremendous promise to facilitate the flow of money among rural and poor families at much lower transaction costs, bringing the bank to those currently unbanked. Realizing this promise will require close collaboration among all stakeholders. But most rural banks do not have mobile banking services for their customers. This made it difficult for the full potential and benefits of mobile money financial services to be realized. Most telecommunication service providers run mobile money service solely for their subscribers without an integrated approach of incorporating and integrating rural banking systems into their existing services this makes it difficult for a full fledge exploitation of the mobile financial market. This paper looks at the existing mobile money services and takes critical look at the positive advantages of effective integration approach of Rural Banks and existing mobile communications infrastructure as well as proposing a model for such integration.
PPS: Privacy-Preserving Strategyproof Social-Efficient Spectrum Auction Mechanisms
Venue: arXiv cs.NI 2013
Year: 2013

Many spectrum auction mechanisms have been proposed for spectrum allocation problem, and unfortunately, few of them protect the bid privacy of bidders and achieve good social efficiency. In this paper, we propose PPS, a Privacy Preserving Strategyproof spectrum auction framework. Then, we design two schemes based on PPS separately for 1) the Single-Unit Auction model (SUA), where only single channel to be sold in the spectrum market; and 2) the Multi-Unit Auction model (MUA), where the primary user subleases multi-unit channels to the secondary users and each of the secondary users wants to access multi-unit channels either. Since the social efficiency maximization problem is NP-hard in both auction models, we present allocation mechanisms with approximation factors of $(1+ε)$ and 32 separately for SUA and MUA, and further judiciously design strategyproof auction mechanisms with privacy preserving based on them. Our extensive evaluations show that our mechanisms achieve good social efficiency and with low computation and communication overhead.
On NP-Hardness of the Paired de Bruijn Sound Cycle Problem
Venue: arXiv cs.DS 2013
Year: 2013

The paired de Bruijn graph is an extension of de Bruijn graph incorporating mate pair information for genome assembly proposed by Mevdedev et al. However, unlike in an ordinary de Bruijn graph, not every path or cycle in a paired de Bruijn graph will spell a string, because there is an additional soundness constraint on the path. In this paper we show that the problem of checking if there is a sound cycle in a paired de Bruijn graph is NP-hard in general case. We also explore some of its special cases, as well as a modified version where the cycle must also pass through every edge.
Les POMDP font de meilleurs hackers: Tenir compte de l'incertitude dans les tests de penetration
Venue: arXiv cs.AI 2013
Year: 2013

Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic testing. A key question is how to generate the attacks. This is naturally formulated as planning under uncertainty, i.e., under incomplete knowledge about the network configuration. Previous work uses classical planning, and requires costly pre-processes reducing this uncertainty by extensive application of scanning methods. By contrast, we herein model the attack planning problem in terms of partially observable Markov decision processes (POMDP). This allows to reason about the knowledge available, and to intelligently employ scanning actions as part of the attack. As one would expect, this accurate solution does not scale. We devise a method that relies on POMDPs to find good attacks on individual machines, which are then composed into an attack on the network as a whole. This decomposition exploits network structure to the extent possible, making targeted approximations (only) where needed. Evaluating this method on a suitably adapted industrial test suite, we demonstrate its effectiveness in both runtime and solution quality.
Wireless Message Dissemination via Selective Relay over Bluetooth (MDSRoB)
Venue: arXiv cs.NI 2013
Year: 2013

This paper presents a wireless message dissemination method designed with no need to trust other users. This method utilizes modern wireless adaptors ability to broadcast device name and identification information. Using the scanning features built into Bluetooth and Wifi, messages can be exchanged via their device names. This paper outlines a method of interchanging multiple messages to discoverable and nondiscoverable devices using a user defined scanning interval method along with a response based system. By selectively relaying messages each user is in control of their involvement in the ad-hoc network.