OpenRaiser/Intern-Atlas huggingface dataset:
Towards Compact and Frequency-Tunable Antenna Solutions for MIMO Transmission with a Single RF Chain
Venue: arXiv cs.IT 2013
Year: 2013

Recently, a technique called beam-space MIMO has been demonstrated as an effective approach for transmitting multiple signals while using a single RF-chain. In this work, we present novel design considerations and a compact antenna solution to stimulate the deployment of beam-space MIMO in future wireless applications. Targeting integration in small wireless devices, the novel antenna is made of a single integrated radiator rather than an array of physically-separated dipoles. It also drastically simplifies the implementation of variable loads and DC bias circuits for BPSK modulated signals, and does not require any external reconfigurable matching circuit. Finally, we show that this antenna system could be reconfigured by dynamic adjustment of terminating loads to preserve its beam-space multiplexing capabilities over a 1:2 tuning range, thereby promoting the convergence of MIMO and dynamic spectrum allocation via reduced-complexity hardware. A prototype achieving single-RF-chain multiplexing at a fixed frequency is designed and measured, showing excellent agreement between simulations and measurements.
Exploiting Cellular Data for Disease Containment and Information Campaigns Strategies in Country-Wide Epidemics
Venue: arXiv cs.SI 2013
Year: 2013

Human mobility is one of the key factors at the basis of the spreading of diseases in a population. Containment strategies are usually devised on movement scenarios based on coarse-grained assumptions. Mobility phone data provide a unique opportunity for building models and defining strategies based on very precise information about the movement of people in a region or in a country. Another very important aspect is the underlying social structure of a population, which might play a fundamental role in devising information campaigns to promote vaccination and preventive measures, especially in countries with a strong family (or tribal) structure. In this paper we analyze a large-scale dataset describing the mobility and the call patterns of a large number of individuals in Ivory Coast. We present a model that describes how diseases spread across the country by exploiting mobility patterns of people extracted from the available data. Then, we simulate several epidemics scenarios and we evaluate mechanisms to contain the epidemic spreading of diseases, based on the information about people mobility and social ties, also gathered from the phone call data. More specifically, we find that restricting mobility does not delay the occurrence of an endemic state and that an information campaign based on one-to-one phone conversations among members of social groups might be an effective countermeasure.
English Character Recognition using Artificial Neural Network
Venue: arXiv cs.NE 2013
Year: 2013

This work focuses on development of a Offline Hand Written English Character Recognition algorithm based on Artificial Neural Network (ANN). The ANN implemented in this work has single output neuron which shows whether the tested character belongs to a particular cluster or not. The implementation is carried out completely in 'C' language. Ten sets of English alphabets (small-26, capital-26) were used to train the ANN and 5 sets of English alphabets were used to test the network. The characters were collected from different persons over duration of about 25 days. The algorithm was tested with 5 capital letters and 5 small letter sets. However, the result showed that the algorithm recognized English alphabet patterns with maximum accuracy of 92.59% and False Rejection Rate (FRR) of 0%.
Solution to Quadratic Equation Using Genetic Algorithm
Venue: arXiv cs.NE 2013
Year: 2013

Solving Quadratic equation is one of the intrinsic interests as it is the simplest nonlinear equations. A novel approach for solving Quadratic Equation based on Genetic Algorithms (GAs) is presented. Genetic Algorithms (GAs) are a technique to solve problems which need optimization. Generation of trial solutions have been formed by this method. Many examples have been worked out, and in most cases we find out the exact solution. We have discussed the effect of different parameters on the performance of the developed algorithm. The results are concluded after rigorous testing on different equations.
Towards Multistage Design of Modular Systems
Venue: arXiv cs.AI 2013
Year: 2013

The paper describes multistage design of composite (modular) systems (i.e., design of a system trajectory). This design process consists of the following: (i) definition of a set of time/logical points; (ii) modular design of the system for each time/logical point (e.g., on the basis of combinatorial synthesis as hierarchical morphological design or multiple choice problem) to obtain several system solutions; (iii) selection of the system solution for each time/logical point while taking into account their quality and the quality of compatibility between neighbor selected system solutions (here, combinatorial synthesis is used as well). Mainly, the examined time/logical points are based on a time chain. In addition, two complicated cases are considered: (a) the examined logical points are based on a tree-like structure, (b) the examined logical points are based on a digraph. Numerical examples illustrate the approach.
A Novel Approach for Intelligent Robot Path Planning
Venue: arXiv cs.RO 2013
Year: 2013

Path planning of Robot is one of the challenging fields in the area of Robotics research. In this paper, we proposed a novel algorithm to find path between starting and ending position for an intelligent system. An intelligent system is considered to be a device/robot having an antenna connected with sensor-detector system. The proposed algorithm is based on Neural Network training concept. The considered neural network is Adapti ve to the knowledge bases. However, implementation of this algorithm is slightly expensive due to hardware it requires. From detailed analysis, it can be proved that the resulted path of this algorithm is efficient.
A secure and effective anonymous authentication scheme for roaming service in global mobility networks
Venue: arXiv cs.CR 2013
Year: 2013

Recently, Mun et al. analyzed Wu et al.'s authentication scheme and proposed a enhanced anonymous authentication scheme for roaming service in global mobility networks. However, through careful analysis, we find that Mun et al.'s scheme is vulnerable to impersonation attacks, off-line password guessing attacks and insider attacks, and cannot provide user friendliness, user's anonymity, proper mutual authentication and local verification. To remedy these weaknesses, in this paper we propose a novel anonymous authentication scheme for roaming service in global mobility networks. Security and performance analyses show the proposed scheme is more suitable for the low-power and resource-limited mobile devices, and is secure against various attacks and has many excellent features.
Repair Locality with Multiple Erasure Tolerance
Venue: arXiv cs.IT 2013
Year: 2013

In distributed storage systems, erasure codes with locality $r$ is preferred because a coordinate can be recovered by accessing at most $r$ other coordinates which in turn greatly reduces the disk I/O complexity for small $r$. However, the local repair may be ineffective when some of the $r$ coordinates accessed for recovery are also erased. To overcome this problem, we propose the $(r,δ)_c$-locality providing $δ-1$ local repair options for a coordinate. Consequently, the repair locality $r$ can tolerate $δ-1$ erasures in total. We derive an upper bound on the minimum distance $d$ for any linear $[n,k]$ code with information $(r,δ)_c$-locality. For general parameters, we prove existence of the codes that attain this bound when $n\geq k(r(δ-1)+1)$, implying tightness of this bound. Although the locality $(r,δ)$ defined by Prakash et al provides the same level of locality and local repair tolerance as our definition, codes with $(r,δ)_c$-locality are proved to have more advantage in the minimum distance. In particular, we construct a class of codes with all symbol $(r,δ)_c$-locality where the gain in minimum distance is $Ω(\sqrt{r})$ and the information rate is close to 1.
Evolving Boolean Regulatory Networks with Epigenetic Control
Venue: arXiv cs.NE 2013
Year: 2013

The significant role of epigenetic mechanisms within natural systems has become increasingly clear. This paper uses a recently presented abstract, tunable Boolean genetic regulatory network model to explore aspects of epigenetics. It is shown how dynamically controlling transcription via a DNA methylation-inspired mechanism can be selected for by simulated evolution under various single and multiple cell scenarios. Further, it is shown that the effects of such control can be inherited without detriment to fitness.
ESPOON: Enforcing Encrypted Security Policies in Outsourced Environments
Venue: arXiv cs.CR 2013
Year: 2013

The enforcement of security policies in outsourced environments is still an open challenge for policy-based systems. On the one hand, taking the appropriate security decision requires access to the policies. However, if such access is allowed in an untrusted environment then confidential information might be leaked by the policies. Current solutions are based on cryptographic operations that embed security policies with the security mechanism. Therefore, the enforcement of such policies is performed by allowing the authorised parties to access the appropriate keys. We believe that such solutions are far too rigid because they strictly intertwine authorisation policies with the enforcing mechanism. In this paper, we want to address the issue of enforcing security policies in an untrusted environment while protecting the policy confidentiality. Our solution ESPOON is aiming at providing a clear separation between security policies and the enforcement mechanism. However, the enforcement mechanism should learn as less as possible about both the policies and the requester attributes.
ACTIDS: An Active Strategy For Detecting And Localizing Network Attacks
Venue: arXiv cs.CR 2013
Year: 2013

In this work we investigate a new approach for detecting attacks which aim to degrade the network's Quality of Service (QoS). To this end, a new network-based intrusion detection system (NIDS) is proposed. Most contemporary NIDSs take a passive approach by solely monitoring the network's production traffic. This paper explores a complementary approach in which distributed agents actively send out periodic probes. The probes are continuously monitored to detect anomalous behavior of the network. The proposed approach takes away much of the variability of the network's production traffic that makes it so difficult to classify. This enables the NIDS to detect more subtle attacks which would not be detected using the passive approach alone. Furthermore, the active probing approach allows the NIDS to be effectively trained using only examples of the network's normal states, hence enabling an effective detection of zero-day attacks. Using realistic experiments, we show that an NIDS which also leverages the active approach is considerably more effective in detecting attacks which aim to degrade the network's QoS when compared to an NIDS which relies solely on the passive approach. Lastly, we show that the false positives rate remains very low even in the face of Byzantine faults.
Recognition of Named-Event Passages in News Articles
Venue: arXiv cs.CL 2013
Year: 2013

We extend the concept of Named Entities to Named Events - commonly occurring events such as battles and earthquakes. We propose a method for finding specific passages in news articles that contain information about such events and report our preliminary evaluation results. Collecting "Gold Standard" data presents many problems, both practical and conceptual. We present a method for obtaining such data using the Amazon Mechanical Turk service.
Safeguarding E-Commerce against Advisor Cheating Behaviors: Towards More Robust Trust Models for Handling Unfair Ratings
Venue: arXiv cs.SI 2013
Year: 2013

In electronic marketplaces, after each transaction buyers will rate the products provided by the sellers. To decide the most trustworthy sellers to transact with, buyers rely on trust models to leverage these ratings to evaluate the reputation of sellers. Although the high effectiveness of different trust models for handling unfair ratings have been claimed by their designers, recently it is argued that these models are vulnerable to more intelligent attacks, and there is an urgent demand that the robustness of the existing trust models has to be evaluated in a more comprehensive way. In this work, we classify the existing trust models into two broad categories and propose an extendable e-marketplace testbed to evaluate their robustness against different unfair rating attacks comprehensively. On top of highlighting the robustness of the existing trust models for handling unfair ratings is far from what they were claimed to be, we further propose and validate a novel combination mechanism for the existing trust models, Discount-then-Filter, to notably enhance their robustness against the investigated attacks.
(Total) Vector Domination for Graphs with Bounded Branchwidth
Venue: arXiv cs.DS 2013
Year: 2013

Given a graph $G=(V,E)$ of order $n$ and an $n$-dimensional non-negative vector $d=(d(1),d(2),\ldots,d(n))$, called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum $S\subseteq V$ such that every vertex $v$ in $V\setminus S$ (resp., in $V$) has at least $d(v)$ neighbors in $S$. The (total) vector domination is a generalization of many dominating set type problems, e.g., the dominating set problem, the $k$-tuple dominating set problem (this $k$ is different from the solution size), and so on, and its approximability and inapproximability have been studied under this general framework. In this paper, we show that a (total) vector domination of graphs with bounded branchwidth can be solved in polynomial time. This implies that the problem is polynomially solvable also for graphs with bounded treewidth. Consequently, the (total) vector domination problem for a planar graph is subexponential fixed-parameter tractable with respectto $k$, where $k$ is the size of solution.
Empty triangles in good drawings of the complete graph
Venue: arXiv cs.CG 2013
Year: 2013

A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at most once. In any good drawing, the edges of three pairwise connected vertices form a Jordan curve which we call a triangle. We say that a triangle is empty if one of the two connected components it induces does not contain any of the remaining vertices of the drawing of the graph. We show that the number of empty triangles in any good drawing of the complete graph $K_n$ with $n$ vertices is at least $n$.
Wisdom of Crowds Algorithm for Stock Market Predictions
Venue: arXiv cs.SI 2013
Year: 2013

In this paper we present a mathematical model for collaborative filtering implementation in stock market predictions. In popular literature collaborative filtering, also known as Wisdom of Crowds, assumes that group has a greater knowledge than the individual while each individual can improve group's performance by its specific information input. There are commercially available tools for collaborative stock market predictions and patent protected web-based software solutions. Mathematics that lies behind those algorithms is not disclosed in the literature, so the presented model and algorithmic implementation are the main contributions of this work.
Review Study For Inter-Operability Of Manet Protocols In Wireless Sensor Networks
Venue: arXiv cs.NI 2013
Year: 2013

Wireless Networks are most appealing in terms of deployment over a wide range of applications. The key areas are disaster management, industrial unit automation and battlefield surveillance. The paper presents a study over inter-operability of MANET (Mobile Ad-Hoc Network) protocols i.e DSDV, OLSR, ZRP, AODV over WSN (Wireless Sensor Network) [10]. The review here covers all the prevailing protocol solutions for WSN and deployment of MANET protocols over them. The need of moving to MANET protocols lie in situation when we talk about mobile sensory nodes which are a compulsion when we talk about the above mentioned three areas. However, the deployment may not be limited to these only.
Higher-order Program Verification as Satisfiability Modulo Theories with Algebraic Data-types
Venue: arXiv cs.LO 2013
Year: 2013

We report on work in progress on automatic procedures for proving properties of programs written in higher-order functional languages. Our approach encodes higher-order programs directly as first-order SMT problems over Horn clauses. It is straight-forward to reduce Hoare-style verification of first-order programs into satisfiability of Horn clauses. The presence of closures offers several challenges: relatively complete proof systems have to account for closures; and in practice, the effectiveness of search procedures depend on encoding strategies and capabilities of underlying solvers. We here use algebraic data-types to encode closures and rely on solvers that support algebraic data-types. The viability of the approach is examined using examples from the literature on higher-order program verification.
RFID Technology Based Attendance Management System
Venue: arXiv cs.ET 2013
Year: 2013

RFID is a nascent technology, deeply rooted by its early developments in using radar1 as a harbinger of adversary planes during World War II. A plethora of industries have leveraged the benefits of RFID technology for enhancements in sectors like military, sports, security, airline, animal farms, healthcare and other areas. Industry specific key applications of this technology include vehicle tracking, automated inventory management, animal monitoring, secure store checkouts, supply chain management, automatic payment, sport timing technologies, etc. This paper introduces the distinctive components of RFID technology and focuses on its core competencies: scalability and security. It will be then supplemented by a detailed synopsis of an investigation conducted to test the feasibility and practicality of RFID technology.
A Scalable Approximate Model Counter
Venue: arXiv cs.LO 2013
Year: 2013

Propositional model counting} (#SAT), i.e., counting the number of satisfying assignments of a propositional formula, is a problem of significant theoretical and practical interest. Due to the inherent complexity of the problem, approximate model counting, which counts the number of satisfying assignments to within given tolerance and confidence level, was proposed as a practical alternative to exact model counting. Yet, approximate model counting has been studied essentially only theoretically. The only reported implementation of approximate model counting, due to Karp and Luby, worked only for DNF formulas. A few existing tools for CNF formulas are bounding model counters; they can handle realistic problem sizes, but fall short of providing counts within given tolerance and confidence, and, thus, are not approximate model counters. We present here a novel algorithm, as well as a reference implementation, that is the first scalable approximate model counter for CNF formulas. The algorithm works by issuing a polynomial number of calls to a SAT solver. Our tool, ApproxMC, scales to formulas with tens of thousands of variables. Careful experimental comparisons show that ApproxMC reports, with high confidence, bounds that are close to the exact count, and also succeeds in reporting bounds with small tolerance and high confidence in cases that are too large for computing exact model counts.
A Tool for Programming Embarrassingly Task Parallel Applications on CoW and NoW
Venue: arXiv cs.DC 2013
Year: 2013

Embarrassingly parallel problems can be split in parts that are characterized by a really low (or sometime absent) exchange of information during their computation in parallel. As a consequence they can be effectively computed in parallel exploiting commodity hardware, hence without particularly sophisticated interconnection networks. Basically, this means Clusters, Networks of Workstations and Desktops as well as Computational Clouds. Despite the simplicity of this computational model, it can be exploited to compute a quite large range of problems. This paper describes JJPF, a tool for developing task parallel applications based on Java and Jini that showed to be an effective and efficient solution in environment like Clusters and Networks of Workstations and Desktops.
Optimized Parallel Transmission in Elastic Optical Networks to Support High-Speed Ethernet
Venue: arXiv cs.NI 2013
Year: 2013

The need for optical parallelization is driven by the imminent optical capacity crunch, where the spectral efficiency required in the coming decades will be beyond the Shannon limit. To this end, the emerging high-speed Ethernet services at 100 Gbps, have already standardized options to utilize parallel optics to parallelize interfaces referred to as Multi-lane Distribution (MLD). OFDM-based optical network is a promising transmission option towards the goal of Ethernet parallelization. It can allocate optical resource tailored for a variety of bandwidth requirements and that in a fundamentally parallel fashion with each sub-carrier utilizing a frequency slot at a lower rate than if serial transmission was used. In this paper, we propose a novel parallel transmission framework designed for elastic (OFDM-based) optical networks to support high-speed Ethernet services, in-line with IEEE and ITU-T standards. We formulate an ILP optimization model based on integer linear programming, with consideration of various constraints, including spectrum fragmentation, differential delay and guard-band constraints. We also propose a heuristic algorithm which can be applied when the optimization model becomes intractable. The numerical results show the effectiveness and high suitability of elastic optical networks to support parallel transmission in high-speed Ethernet. To the best of our knowledge, this is the first attempt to investigate the parallel transmission in elastic optical networks to support standardized high-speed Ethernet.
Weight distributions of cyclic codes with respect to pairwise coprime order elements
Venue: arXiv cs.IT 2013
Year: 2013

Let $\Bbb F_r$ be an extension of a finite field $\Bbb F_q$ with $r=q^m$. Let each $g_i$ be of order $n_i$ in $\Bbb F_r^*$ and $\gcd(n_i, n_j)=1$ for $1\leq i \neq j \leq u$. We define a cyclic code over $\Bbb F_q$ by $$\mathcal C_{(q, m, n_1,n_2, ..., n_u)}=\{c(a_1, a_2, ..., a_u) : a_1, a_2, ..., a_u \in \Bbb F_r\},$$ where $$c(a_1, a_2, ..., a_u)=({Tr}_{r/q}(\sum_{i=1}^ua_ig_i^0), ..., {Tr}_{r/q}(\sum_{i=1}^ua_ig_i^{n-1}))$$ and $n=n_1n_2... n_u$. In this paper, we present a method to compute the weights of $\mathcal C_{(q, m, n_1,n_2, ..., n_u)}$. Further, we determine the weight distributions of the cyclic codes $\mathcal C_{(q, m, n_1,n_2)}$ and $\mathcal C_{(q, m, n_1,n_2,1)}$.
A Cubic Algorithm for Computing Gaussian Volume
Venue: arXiv cs.DS 2013
Year: 2013

We present randomized algorithms for sampling the standard Gaussian distribution restricted to a convex set and for estimating the Gaussian measure of a convex set, in the general membership oracle model. The complexity of integration is $O^*(n^3)$ while the complexity of sampling is $O^*(n^3)$ for the first sample and $O^*(n^2)$ for every subsequent sample. These bounds improve on the corresponding state-of-the-art by a factor of $n$. Our improvement comes from several aspects: better isoperimetry, smoother annealing, avoiding transformation to isotropic position and the use of the "speedy walk" in the analysis.