OpenRaiser/Intern-Atlas huggingface dataset:
Effect of Mobility and Traffic Models on the Energy Consumption in MANET Routing Protocols
Venue: arXiv cs.NI 2013
Year: 2013

A Mobile Ad hoc Network (MANET) is a group of mobile nodes that can be set up randomly and formed without the need of any existing network infrastructure or centralized administration. In this network the mobile devices are dependent on battery power, it is important to minimize their energy consumption. Also storage capacity and power are severely limited. In situations such as emergency rescue, military actions, and scientific field missions, energy conservation plays an even more important role which is critical to the success of the tasks performed by the network. Therefore, energy conservation should be considered carefully when designing or evaluating ad hoc routing protocols. In this paper we concentrated on the energy consumption issues of existing routing protocols in MANET under various mobility models and whose connections communicate in a particular traffic model (CBR, Exponential, and Pareto). This paper describes a performance comparison of the AODV, DSR and DSDV routing protocols in term of energy consumed due to packet type (routing/MAC) during transmission and reception of control packets. The mobility models used in this work are Random Waypoint, Manhattan Grid and Reference Point Group. Simulations have been carried out using NS-2 and its associated tools for animation and analysis of results.
Web Services Discovery and Recommendation Based on Information Extraction and Symbolic Reputation
Venue: arXiv cs.IR 2013
Year: 2013

This paper shows that the problem of web services representation is crucial and analyzes the various factors that influence on it. It presents the traditional representation of web services considering traditional textual descriptions based on the information contained in WSDL files. Unfortunately, textual web services descriptions are dirty and need significant cleaning to keep only useful information. To deal with this problem, we introduce rules based text tagging method, which allows filtering web service description to keep only significant information. A new representation based on such filtered data is then introduced. Many web services have empty descriptions. Also, we consider web services representations based on the WSDL file structure (types, attributes, etc.). Alternatively, we introduce a new representation called symbolic reputation, which is computed from relationships between web services. The impact of the use of these representations on web service discovery and recommendation is studied and discussed in the experimentation using real world web services.
Quipper: A Scalable Quantum Programming Language
Venue: arXiv cs.PL 2013
Year: 2013

The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.
Probability Judgement in Artificial Intelligence
Venue: arXiv cs.AI 2013
Year: 2013

This paper is concerned with two theories of probability judgment: the Bayesian theory and the theory of belief functions. It illustrates these theories with some simple examples and discusses some of the issues that arise when we try to implement them in expert systems. The Bayesian theory is well known; its main ideas go back to the work of Thomas Bayes (1702-1761). The theory of belief functions, often called the Dempster-Shafer theory in the artificial intelligence community, is less well known, but it has even older antecedents; belief-function arguments appear in the work of George Hooper (16401723) and James Bernoulli (1654-1705). For elementary expositions of the theory of belief functions, see Shafer (1976, 1985).
Incidence Calculus: A Mechanism for Probabilistic Reasoning
Venue: arXiv cs.AI 2013
Year: 2013

Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. A purely numeric mechanism, like those proposed so far, cannot provide a probabilistic logic with truth functional connectives. We propose an alternative mechanism, Incidence Calculus, which is based on a representation of uncertainty using sets of points, which might represent situations, models or possible worlds. Incidence Calculus does provide a probabilistic logic with truth functional connectives.
Strong & Weak Methods: A Logical View of Uncertainty
Venue: arXiv cs.AI 2013
Year: 2013

The last few years has seen a growing debate about techniques for managing uncertainty in AI systems. Unfortunately this debate has been cast as a rivalry between AI methods and classical probability based ones. Three arguments for extending the probability framework of uncertainty are presented, none of which imply a challenge to classical methods. These are (1) explicit representation of several types of uncertainty, specifically possibility and plausibility, as well as probability, (2) the use of weak methods for uncertainty management in problems which are poorly defined, and (3) symbolic representation of different uncertainty calculi and methods for choosing between them.
Statistical Mechanics Algorithm for Response to Targets (SMART)
Venue: arXiv cs.CE 2013
Year: 2013

It is proposed to apply modern methods of nonlinear nonequilibrium statistical mechanics to develop software algorithms that will optimally respond to targets within short response times with minimal computer resources. This Statistical Mechanics Algorithm for Response to Targets (SMART) can be developed with a view towards its future implementation into a hardwired Statistical Algorithm Multiprocessor (SAM) to enhance the efficiency and speed of response to targets (SMART_SAM).
GreenDCN: a General Framework for Achieving Energy Efficiency in Data Center Networks
Venue: arXiv cs.NI 2013
Year: 2013

The popularization of cloud computing has raised concerns over the energy consumption that takes place in data centers. In addition to the energy consumed by servers, the energy consumed by large numbers of network devices emerges as a significant problem. Existing work on energy-efficient data center networking primarily focuses on traffic engineering, which is usually adapted from traditional networks. We propose a new framework to embrace the new opportunities brought by combining some special features of data centers with traffic engineering. Based on this framework, we characterize the problem of achieving energy efficiency with a time-aware model, and we prove its NP-hardness with a solution that has two steps. First, we solve the problem of assigning virtual machines (VM) to servers to reduce the amount of traffic and to generate favorable conditions for traffic engineering. The solution reached for this problem is based on three essential principles that we propose. Second, we reduce the number of active switches and balance traffic flows, depending on the relation between power consumption and routing, to achieve energy conservation. Experimental results confirm that, by using this framework, we can achieve up to 50 percent energy savings. We also provide a comprehensive discussion on the scalability and practicability of the framework.
Algorithms for Cut Problems on Trees
Venue: arXiv cs.DS 2013
Year: 2013

We study the {\sc multicut on trees} and the {\sc generalized multiway Cut on trees} problems. For the {\sc multicut on trees} problem, we present a parameterized algorithm that runs in time $O^{*}(ρ^k)$, where $ρ= \sqrt{\sqrt{2} + 1} \approx 1.555$ is the positive root of the polynomial $x^4-2x^2-1$. This improves the current-best algorithm of Chen et al. that runs in time $O^{*}(1.619^k)$. For the {\sc generalized multiway cut on trees} problem, we show that this problem is solvable in polynomial time if the number of terminal sets is fixed; this answers an open question posed in a recent paper by Liu and Zhang. By reducing the {\sc generalized multiway cut on trees} problem to the {\sc multicut on trees} problem, our results give a parameterized algorithm that solves the {\sc generalized multiway cut on trees} problem in time $O^{*}(ρ^k)$, where $ρ= \sqrt{\sqrt{2} + 1} \approx 1.555$ time.
Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization
Venue: arXiv cs.IT 2013
Year: 2013

We introduce explicit schemes based on the polarization phenomenon for the tasks of one-way secret key agreement from common randomness and private channel coding. For the former task, we show how to use common randomness and insecure one-way communication to obtain a strongly secure key such that the key construction has a complexity essentially linear in the blocklength and the rate at which the key is produced is optimal, i.e., equal to the one-way secret-key rate. For the latter task, we present a private channel coding scheme that achieves the secrecy capacity using the condition of strong secrecy and whose encoding and decoding complexity are again essentially linear in the blocklength.
The Recomputation Manifesto
Venue: arXiv cs.GL 2013
Year: 2013

Replication of scientific experiments is critical to the advance of science. Unfortunately, the discipline of Computer Science has never treated replication seriously, even though computers are very good at doing the same thing over and over again. Not only are experiments rarely replicated, they are rarely even replicable in a meaningful way. Scientists are being encouraged to make their source code available, but this is only a small step. Even in the happy event that source code can be built and run successfully, running code is a long way away from being able to replicate the experiment that code was used for. I propose that the discipline of Computer Science must embrace replication of experiments as standard practice. I propose that the only credible technique to make experiments truly replicable is to provide copies of virtual machines in which the experiments are validated to run. I propose that tools and repositories should be made available to make this happen. I propose to be one of those who makes it happen.
Solving Linear Equations Using a Jacobi Based Time-Variant Adaptive Hybrid Evolutionary Algorithm
Venue: arXiv cs.NE 2013
Year: 2013

Large set of linear equations, especially for sparse and structured coefficient (matrix) equations, solutions using classical methods become arduous. And evolutionary algorithms have mostly been used to solve various optimization and learning problems. Recently, hybridization of classical methods (Jacobi method and Gauss-Seidel method) with evolutionary computation techniques have successfully been applied in linear equation solving. In the both above hybrid evolutionary methods, uniform adaptation (UA) techniques are used to adapt relaxation factor. In this paper, a new Jacobi Based Time-Variant Adaptive (JBTVA) hybrid evolutionary algorithm is proposed. In this algorithm, a Time-Variant Adaptive (TVA) technique of relaxation factor is introduced aiming at both improving the fine local tuning and reducing the disadvantage of uniform adaptation of relaxation factors. This algorithm integrates the Jacobi based SR method with time variant adaptive evolutionary algorithm. The convergence theorems of the proposed algorithm are proved theoretically. And the performance of the proposed algorithm is compared with JBUA hybrid evolutionary algorithm and classical methods in the experimental domain. The proposed algorithm outperforms both the JBUA hybrid algorithm and classical methods in terms of convergence speed and effectiveness.
An Investigation of Wavelet Packet Transform for Spectrum Estimation
Venue: arXiv cs.IT 2013
Year: 2013

In this article, we investigate the application of wavelet packet transform as a novel spectrum sensing approach. The main attraction for wavelet packets is the tradeoffs they offer in terms of satisfying various performance metrics such as frequency resolution, variance of the estimated power spectral density (PSD) and complexity. The results of the experiments show that the wavelet based approach offers great flexibility, reconfigure ability and adaptability apart from its performances which are comparable and at times even better than Fourier based estimates.
Multithreaded Input-Sensitive Profiling
Venue: arXiv cs.PF 2013
Year: 2013

Input-sensitive profiling is a recent performance analysis technique that makes it possible to estimate the empirical cost function of individual routines of a program, helping developers understand how performance scales to larger inputs and pinpoint asymptotic bottlenecks in the code. A current limitation of input-sensitive profilers is that they specifically target sequential computations, ignoring any communication between threads. In this paper we show how to overcome this limitation, extending the range of applicability of the original approach to multithreaded applications and to applications that operate on I/O streams. We develop new metrics for automatically estimating the size of the input given to each routine activation, addressing input produced by non-deterministic memory stores performed by other threads as well as by the OS kernel (e.g., in response to I/O or network operations). We provide real case studies, showing that our extension allows it to characterize the behavior of complex applications more precisely than previous approaches. An extensive experimental investigation on a variety of benchmark suites (including the SPEC OMP2012 and the PARSEC benchmarks) shows that our Valgrind-based input-sensitive profiler incurs an overhead comparable to other prominent heavyweight analysis tools, while collecting significantly more performance points from each profiling session and correctly characterizing both thread-induced and external input.
Multi-Layer Transmission and Hybrid Relaying for Relay Channels with Multiple Out-of-Band Relays
Venue: arXiv cs.IT 2013
Year: 2013

In this work, a relay channel is studied in which a source encoder communicates with a destination decoder through a number of out-of-band relays that are connected to the decoder through capacity-constrained digital backhaul links. This model is motivated by the uplink of cloud radio access networks. In this scenario, a novel transmission and relaying strategies are proposed in which multi-layer transmission is used, on the one hand, to adaptively leverage the different decoding capabilities of the relays and, on the other hand, to enable hybrid decode-and-forward (DF) and compress-and-forward (CF) relaying. The hybrid relaying strategy allows each relay to forward part of the decoded messages and a compressed version of the received signal to the decoder. The problem of optimizing the power allocation across the layers and the compression test channels is formulated. Albeit non-convex, the derived problem is found to belong to the class of so called complementary geometric programs (CGPs). Using this observation, an iterative algorithm based on the homotopy method is proposed that achieves a stationary point of the original problem by solving a sequence of geometric programming (GP), and thus convex, problems. Numerical results are provided that show the effectiveness of the proposed multi-layer hybrid scheme in achieving performance close to a theoretical (cutset) upper bound.
Linear models based on noisy data and the Frisch scheme
Venue: arXiv cs.SY 2013
Year: 2013

We address the problem of identifying linear relations among variables based on noisy measurements. This is, of course, a central question in problems involving "Big Data." Often a key assumption is that measurement errors in each variable are independent. This precise formulation has its roots in the work of Charles Spearman in 1904 and of Ragnar Frisch in the 1930's. Various topics such as errors-in-variables, factor analysis, and instrumental variables, all refer to alternative formulations of the problem of how to account for the anticipated way that noise enters in the data. In the present paper we begin by describing the basic theory and provide alternative modern proofs to some key results. We then go on to consider certain generalizations of the theory as well applying certain novel numerical techniques to the problem. A central role is played by the Frisch-Kalman dictum which aims at a noise contribution that allows a maximal set of simultaneous linear relations among the noise-free variables --a rank minimization problem. In the years since Frisch's original formulation, there have been several insights including trace minimization as a convenient heuristic to replace rank minimization. We discuss convex relaxations and certificates guaranteeing global optimality. A complementary point of view to the Frisch-Kalman dictum is introduced in which models lead to a min-max quadratic estimation error for the error-free variables. Points of contact between the two formalisms are discussed and various alternative regularization schemes are indicated.
A survey on energy efficiency for wireless mesh network
Venue: arXiv cs.NI 2013
Year: 2013

Reducing CO2 emissions is an important global environmental issue. Over the recent years, wireless and mobile communications have increasingly become popular with consumers. An increasingly popular type of wireless access is the so-called Wireless Mesh Networks (WMNs) that provide wireless connectivity through much cheaper and more flexible backhaul infrastructure compared with wired solutions. Wireless Mesh Network (WMN) is an emerging new technology which is being adopted as the wireless internetworking solution for the near future. Due to increased energy consumption in the information and communication technology (ICT) industries, and its consequent environmental effects, energy efficiency has become a key factor to evaluate the performance of a communication network. This paper mainly focuses on classification layer of the largest existing approaches dedicated to energy conservation. It is also discussing the most interesting works on energy saving in WMNs networks.
Smart Microgrids: Overview and Outlook
Venue: arXiv cs.ET 2013
Year: 2013

The idea of changing our energy system from a hierarchical design into a set of nearly independent microgrids becomes feasible with the availability of small renewable energy generators. The smart microgrid concept comes with several challenges in research and engineering targeting load balancing, pricing, consumer integration and home automation. In this paper we first provide an overview on these challenges and present approaches that target the problems identified. While there exist promising algorithms for the particular field, we see a missing integration which specifically targets smart microgrids. Therefore, we propose an architecture that integrates the presented approaches and defines interfaces between the identified components such as generators, storage, smart and \dq{dumb} devices.
Cyber-Physical Security: A Game Theory Model of Humans Interacting over Control Systems
Venue: arXiv cs.GT 2013
Year: 2013

Recent years have seen increased interest in the design and deployment of smart grid devices and control algorithms. Each of these smart communicating devices represents a potential access point for an intruder spurring research into intruder prevention and detection. However, no security measures are complete, and intruding attackers will compromise smart grid devices leading to the attacker and the system operator interacting via the grid and its control systems. The outcome of these machine-mediated human-human interactions will depend on the design of the physical and control systems mediating the interactions. If these outcomes can be predicted via simulation, they can be used as a tool for designing attack-resilient grids and control systems. However, accurate predictions require good models of not just the physical and control systems, but also of the human decision making. In this manuscript, we present an approach to develop such tools, i.e. models of the decisions of the cyber-physical intruder who is attacking the systems and the system operator who is defending it, and demonstrate its usefulness for design.
A Paradigm for the Application of Cloud Computing in Mobile Intelligent Tutoring Systems
Venue: arXiv cs.CY 2013
Year: 2013

Nowadays, with the rapid growth of cloud computing, many industries are going to move their computing activities to clouds. Researchers of virtual learning are also looking for the ways to use clouds through mobile platforms. This paper offers a model to accompany the benefits of "Mobile Intelligent Learning" technology and "Cloud Computing". The architecture of purposed system is based on multi-layer architecture of Mobile Cloud Computing. Despite the existing challenges, the system has increased the life of mobile device battery. It will raise working memory capacity and processing capacity of the educational system in addition to the greater advantage of the educational system. The proposed system allows the users to enjoy an intelligent learning every-time and every-where, reduces training costs and hardware dependency, and increases consistency, efficiency, and data reliability.
Coordinating metaheuristic agents with swarm intelligence
Venue: arXiv cs.MA 2013
Year: 2013

Coordination of multi agent systems remains as a problem since there is no prominent method to completely solve this problem. Metaheuristic agents are specific implementations of multi-agent systems, which imposes working together to solve optimisation problems with metaheuristic algorithms. The idea borrowed from swarm intelligence seems working much better than those implementations suggested before. This paper reports the performance of swarms of simulated annealing agents collaborating with particle swarm optimization algorithm. The proposed approach is implemented for multidimensional knapsack problem and has resulted much better than some other works published before.