OpenRaiser/Intern-Atlas huggingface dataset:
Classical Hardness of Learning with Errors
Venue: arXiv cs.CC 2013
Year: 2013

We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems, even with polynomial modulus. Previously this was only known under quantum reductions. Our techniques capture the tradeoff between the dimension and the modulus of LWE instances, leading to a much better understanding of the landscape of the problem. The proof is inspired by techniques from several recent cryptographic constructions, most notably fully homomorphic encryption schemes.
An Analysis of issues against the adoption of Dynamic Carpooling
Venue: arXiv cs.CY 2013
Year: 2013

Using a private car is a transportation system very common in industrialized countries. However, it causes different problems such as overuse of oil, traffic jams causing earth pollution, health problems and an inefficient use of personal time. One possible solution to these problems is carpooling, i.e. sharing a trip on a private car of a driver with one or more passengers. Carpooling would reduce the number of cars on streets hence providing worldwide environmental, economical and social benefits. The matching of drivers and passengers can be facilitated by information and communication technologies. Typically, a driver inserts on a web-site the availability of empty seats on his/her car for a planned trip and potential passengers can search for trips and contact the drivers. This process is slow and can be appropriate for long trips planned days in advance. We call this static carpooling and we note it is not used frequently by people even if there are already many web-sites offering this service and in fact the only real open challenge is widespread adoption. Dynamic carpooling, on the other hand, takes advantage of the recent and increasing adoption of Internet-connected geo-aware mobile devices for enabling impromptu trip opportunities. Passengers request trips directly on the street and can find a suitable ride in just few minutes. Currently there are no dynamic carpooling systems widely used. Every attempt to create and organize such systems failed. This paper reviews the state of the art of dynamic carpooling. It identifies the most important issues against the adoption of dynamic carpooling systems and the proposed solutions for such issues. It proposes a first input on solving the problem of mass-adopting dynamic carpooling systems.
Analog Turbo Codes: Turning Chaos to Reliability
Venue: arXiv cs.IT 2013
Year: 2013

Analog error correction codes, by relaxing the source space and the codeword space from discrete fields to continuous fields, present a generalization of digital codes. While linear codes are sufficient for digital codes, they are not for analog codes, and hence nonlinear mappings must be employed to fully harness the power of analog codes. This paper demonstrates new ways of building effective (nonlinear) analog codes from a special class of nonlinear, fast-diverging functions known as the chaotic functions. It is shown that the "butterfly effect" of the chaotic functions matches elegantly with the distance expansion condition required for error correction, and that the useful idea in digital turbo codes can be exploited to construct efficient turbo-like chaotic analog codes. Simulations show that the new analog codes can perform on par with, or better than, their digital counter-parts when transmitting analog sources.
Provable Inductive Matrix Completion
Venue: arXiv cs.LG 2013
Year: 2013

Consider a movie recommendation system where apart from the ratings information, side information such as user's age or movie's genre is also available. Unlike standard matrix completion, in this setting one should be able to predict inductively on new users/movies. In this paper, we study the problem of inductive matrix completion in the exact recovery setting. That is, we assume that the ratings matrix is generated by applying feature vectors to a low-rank matrix and the goal is to recover back the underlying matrix. Furthermore, we generalize the problem to that of low-rank matrix estimation using rank-1 measurements. We study this generic problem and provide conditions that the set of measurements should satisfy so that the alternating minimization method (which otherwise is a non-convex method with no convergence guarantees) is able to recover back the {\em exact} underlying low-rank matrix. In addition to inductive matrix completion, we show that two other low-rank estimation problems can be studied in our framework: a) general low-rank matrix sensing using rank-1 measurements, and b) multi-label regression with missing labels. For both the problems, we provide novel and interesting bounds on the number of measurements required by alternating minimization to provably converges to the {\em exact} low-rank matrix. In particular, our analysis for the general low rank matrix sensing problem significantly improves the required storage and computational cost than that required by the RIP-based matrix sensing methods \cite{RechtFP2007}. Finally, we provide empirical validation of our approach and demonstrate that alternating minimization is able to recover the true matrix for the above mentioned problems using a small number of measurements.
Evaluating Wireless Proactive Routing Protocols under Mobility and Scalability Constraints
Venue: arXiv cs.NI 2013
Year: 2013

Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different routing techniques, we select three proactive routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.
Evaluating Wireless Reactive Routing Protocols with Linear Programming Model for Wireless Ad-hoc Networks
Venue: arXiv cs.NI 2013
Year: 2013

In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users with facility of quick communication. In Wireless Multi-hop Networks, routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models to assess and enhance reactive routing protocols. To practically examine constraints of respective Linear Programming models over reactive protocols, we select AODV, DSR and DYMO. It is deduced from analytical simulations of Linear Programming models in MATLAB that quick route repair reduces routing latency and optimizations of retransmission attempts results efficient energy utilization. To provide quick repair, we enhance AODV and DSR. To practically examine the efficiency of enhanced protocols in different scenarios of Wireless Multi-hop Networks, we conduct simulations using NS-2. From simulation results, enhanced DSR and AODV achieve efficient output by optimizing routing latencies and routing load in terms of retransmission attempts.
Modeling and Simulating Network Connectivity in Routing Protocols for MANETs and VANETs
Venue: arXiv cs.NI 2013
Year: 2013

This paper presents a framework for node distribution with respect to density, network connectivity and communication time. Using NS2, we evaluate and compare performance of three routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Fisheye State Routing (FSR) both in MANETs (IEEE 802.11) and VANETs (IEEE 802.11p). We further enhanced these protocols by changing their routing information exchange intervals; MOD AODV, MOD DSR and MOD FSR. A comprehensive simulation work is performed for the comparison of these routing protocols for varying motilities and scalabilities of nodes. As a result, we can say that AODV outperforms DSR and FSR both in MANETs and VANETs.
Evaluating and Comparing Probability of Path Loss in DSDV, OLSR and DYMO at 802.11 and 802.11p
Venue: arXiv cs.NI 2013
Year: 2013

In this paper, we present path loss model for VANETs and simulate three routing protocols; Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR) and Dynamic MANET On-demand (DYMO) to evaluate and compare their performance using NS-2. The main contribution of this work is enhancement of existing techniques to achieve high efficiency of the underlying networks. After extensive simulations in NS-2, we conclude that DSDV best performs with 802.11p while DYMO gives outstanding performance with 802.11.
Closed-Form Path-Loss Predictor for Gaussianly Distributed Nodes
Venue: arXiv cs.IT 2013
Year: 2013

The emulation of wireless nodes spatial position is a practice used by deployment engineers and network planners to analyze the characteristics of a network. In particular, nodes geolocation will directly impact factors such as connectivity, signals fidelity, and service quality. In literature, in addition to typical homogenous scattering, normal distribution is frequently used to model mobiles concentration in a cellular system. Moreover, Gaussian dropping is often considered as an effective placement method for airborne sensor deployment. Despite the practicality of this model, getting the network channel loss distribution still relies on exhaustive Monte Carlo simulation. In this paper, we argue the need for this inefficient approach and hence derived a generic and exact closed-form expression for the path-loss distribution density between a base-station and a network of nodes. Simulation was used to reaffirm the validity of the theoretical analysis using values from the new IEEE 802.20 standard.
Dual codes of product semi-linear codes
Venue: arXiv cs.IT 2013
Year: 2013

Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $θ: \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with linear codes of $\mathbb{F}_q^n$ invariant under a semi-linear map $T:\mathbb{F}_q^n\to\mathbb{F}_q^n$ for some $n\geq 2$. In particular, we study three kind of their dual codes, some relations between them and we focus on codes which are products of module skew codes in the non-commutative polynomial ring $\mathbb{F}_q[X,θ]$ as a subcase of linear codes invariant by a semi-linear map $T$. In this setting we give also an algorithm for encoding, decoding and detecting errors and we show a method to construct codes invariant under a fixed $T$.
Software Process Models and Analysis on Failure of Software Development Projects
Venue: arXiv cs.SE 2013
Year: 2013

The software process model consists of a set of activities undertaken to design, develop and maintain software systems. A variety of software process models have been designed to structure, describe and prescribe the software development process. The software process models play a very important role in software development, so it forms the core of the software product. Software project failure is often devastating to an organization. Schedule slips, buggy releases and missing features can mean the end of the project or even financial ruin for a company. Oddly, there is disagreement over what it means for a project to fail. In this paper, discussion is done on current process models and analysis on failure of software development, which shows the need of new research.
A Survey of Different Residential Energy Consumption Controlling Techniques for Autonomous DSM in Future Smart Grid Communications
Venue: arXiv cs.NI 2013
Year: 2013

In this work, we present a survey of residential load controlling techniques to implement demand side management in future smart grid. Power generation sector facing important challenges both in quality and quantity to meet the increasing requirements of consumers. Energy efficiency, reliability, economics and integration of new energy resources are important issues to enhance the stability of power system infrastructure. Optimal energy consumption scheduling minimizes the energy consumption cost and reduce the peak-to-average ratio (PAR) as well as peak load demand in peak hours. In this work, we discuss different energy consumption scheduling schemes that schedule the household appliances in real-time to achieve minimum energy consumption cost and reduce peak load curve in peak hours to shape the peak load demand.
Personalized Email Community Detection using Collaborative Similarity Measure
Venue: arXiv cs.SI 2013
Year: 2013

Email service providers have employed many email classification and prioritization systems over the last decade to improve their services. In order to assist email services, we propose a personalized email community detection method to discover the groupings of email users based on their structural and semantic intimacy. We extract the personalized social graph from a set of emails by uniquely leveraging each node with communication behavior. Subsequently, collaborative similarity measure (CSM) based intra-graph clustering approach detects personalized communities. The empirical analysis shows effectiveness of the resultant communities in terms of evaluation measures, i.e. density, entropy and f-measure. Moreover, email strainer, dynamic group prediction, and fraudulent account detection are suggested as the potential applications from both the service provider and user's point of view.
Towards a Simple Relationship to Estimate the Capacity of Static and Mobile Wireless Networks
Venue: arXiv cs.NI 2013
Year: 2013

Extensive research has been done on studying the capacity of wireless multi-hop networks. These efforts have led to many sophisticated and customized analytical studies on the capacity of particular networks. While most of the analyses are intellectually challenging, they lack universal properties that can be extended to study the capacity of a different network. In this paper, we sift through various capacity-impacting parameters and present a simple relationship that can be used to estimate the capacity of both static and mobile networks. Specifically, we show that the network capacity is determined by the average number of simultaneous transmissions, the link capacity and the average number of transmissions required to deliver a packet to its destination. Our result is valid for both finite networks and asymptotically infinite networks. We then use this result to explain and better understand the insights of some existing results on the capacity of static networks, mobile networks and hybrid networks and the multicast capacity. The capacity analysis using the aforementioned relationship often becomes simpler. The relationship can be used as a powerful tool to estimate the capacity of different networks. Our work makes important contributions towards developing a generic methodology for network capacity analysis that is applicable to a variety of different scenarios.
Performance analysis of unsupervised feature selection methods
Venue: arXiv cs.LG 2013
Year: 2013

Feature selection (FS) is a process which attempts to select more informative features. In some cases, too many redundant or irrelevant features may overpower main features for classification. Feature selection can remedy this problem and therefore improve the prediction accuracy and reduce the computational overhead of classification algorithms. The main aim of feature selection is to determine a minimal feature subset from a problem domain while retaining a suitably high accuracy in representing the original features. In this paper, Principal Component Analysis (PCA), Rough PCA, Unsupervised Quick Reduct (USQR) algorithm and Empirical Distribution Ranking (EDR) approaches are applied to discover discriminative features that will be the most adequate ones for classification. Efficiency of the approaches is evaluated using standard classification metrics.
The User Feedback on SentiWordNet
Venue: arXiv cs.CL 2013
Year: 2013

With the release of SentiWordNet 3.0 the related Web interface has been restyled and improved in order to allow users to submit feedback on the SentiWordNet entries, in the form of the suggestion of alternative triplets of values for an entry. This paper reports on the release of the user feedback collected so far and on the plans for the future.
Rethinking the Secrecy Outage Formulation: A Secure Transmission Design Perspective
Venue: arXiv cs.IT 2013
Year: 2013

This letter studies information-theoretic security without knowing the eavesdropper's channel fading state. We present an alternative secrecy outage formulation to measure the probability that message transmissions fail to achieve perfect secrecy. Using this formulation, we design two transmission schemes that satisfy the given security requirement while achieving good throughput performance.
Diffusion map for clustering fMRI spatial maps extracted by independent component analysis
Venue: arXiv cs.CE 2013
Year: 2013

Functional magnetic resonance imaging (fMRI) produces data about activity inside the brain, from which spatial maps can be extracted by independent component analysis (ICA). In datasets, there are n spatial maps that contain p voxels. The number of voxels is very high compared to the number of analyzed spatial maps. Clustering of the spatial maps is usually based on correlation matrices. This usually works well, although such a similarity matrix inherently can explain only a certain amount of the total variance contained in the high-dimensional data where n is relatively small but p is large. For high-dimensional space, it is reasonable to perform dimensionality reduction before clustering. In this research, we used the recently developed diffusion map for dimensionality reduction in conjunction with spectral clustering. This research revealed that the diffusion map based clustering worked as well as the more traditional methods, and produced more compact clusters when needed.
Threshold Load Balancing in Networks
Venue: arXiv cs.DS 2013
Year: 2013

We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n users that try to find an acceptable resource by moving along the edges of the graph. Users accept a resource if the load is below a threshold. Such thresholds have an intuitive meaning, e.g., as deadlines in a machine scheduling scenario, and they allow the design of protocols under strong locality constraints. When migration is partly controlled by resources and partly by users, our protocols obtain rapid convergence to a balanced state, in which all users are satisfied. We show that convergence is achieved in a number of rounds that is only logarithmic in m and polynomial in structural properties of the graph. Even when migration is fully controlled by users, we obtain similar results for convergence to approximately balanced states. If we slightly adjust the migration probabilities in our protocol, we can also obtain fast convergence to balanced states.
Dynamic Clustering Protocol for Data Forwarding in Wireless Sensor Networks
Venue: arXiv cs.NI 2013
Year: 2013

Energy being the very key concern area with sensor networks, so the main focus lies in developing a mechanism to increase the lifetime of a sensor network by energy balancing. To achieve energy balancing and maximizing network lifetime we use an idea of clustering and dividing the whole network into different clusters. In this paper we propose a dynamic cluster formation method where clusters are refreshed periodically based on residual energy, distance and cost. Refreshing clustering minimizes workload of any single node and in turn enhances the energy conservation. Sleep and wait methodology is applied to the proposed protocol to enhance the network lifetime by turning the nodes on and off according to their duties. The node that has some data to be transmitted is in on state and after forwarding its data to the cluster head it changes its state to off which saves the energy of entire network. Simulations have been done using MAT lab. Simulation results prove the betterment of our proposed method over the existing Leach protocol.
Agents and owl-s based semantic web service discovery with user preference support
Venue: arXiv cs.IR 2013
Year: 2013

Service-oriented computing (SOC) is an interdisciplinary paradigm that revolutionizes the very fabric of distributed software development applications that adopt service-oriented architectures (SOA) can evolve during their lifespan and adapt to changing or unpredictable environments more easily. SOA is built around the concept of Web Services. Although the Web services constitute a revolution in Word Wide Web, they are always regarded as non-autonomous entities and can be exploited only after their discovery. With the help of software agents, Web services are becoming more efficient and more dynamic. The topic of this paper is the development of an agent based approach for Web services discovery and selection in witch, OWL-S is used to describe Web services, QoS and service customer request. We develop an efficient semantic service matching which takes into account concepts properties to match concepts in Web service and service customer request descriptions. Our approach is based on an architecture composed of four layers: Web service and Request description layer, Functional match layer, QoS computing layer and Reputation computing layer.
Autonomous search for a diffusive source in an unknown environment
Venue: arXiv cs.AI 2013
Year: 2013

The paper presents an approach to olfactory search for a diffusive emitting source of tracer (e.g. aerosol, gas) in an environment with unknown map of randomly placed and shaped obstacles. The measurements of tracer concentration are sporadic, noisy and without directional information. The search domain is discretised and modelled by a finite two-dimensional lattice. The links is the lattice represent the traversable paths for emitted particles and for the searcher. A missing link in the lattice indicates a blocked paths, due to the walls or obstacles. The searcher must simultaneously estimate the source parameters, the map of the search domain and its own location within the map. The solution is formulated in the sequential Bayesian framework and implemented as a Rao-Blackwellised particle filter with information-driven motion control. The numerical results demonstrate the concept and its performance.