OpenRaiser/Intern-Atlas huggingface dataset:
Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration
Venue: arXiv cs.DB 2013
Year: 2013

We present Lilac-TM, the first locality-aware Distributed Software Transactional Memory (DSTM) implementation. Lilac-TM is a fully decentralized lease-based replicated DSTM. It employs a novel self- optimizing lease circulation scheme based on the idea of dynamically determining whether to migrate transactions to the nodes that own the leases required for their validation, or to demand the acquisition of these leases by the node that originated the transaction. Our experimental evaluation establishes that Lilac-TM provides significant performance gains for distributed workloads exhibiting data locality, while typically incurring no overhead for non-data local workloads.
A New Mattress Development Based on Pressure Sensors for Body-contouring Uniform Support
Venue: arXiv cs.OH 2013
Year: 2013

For getting good sleep quality, an improved approach of new mattress development based on the pressure sensors for body-contouring uniform support is proposed in this paper. This method solved the problems of innerspring mattresses that cannot allow body-contouring uniform support, and foam mattresses that cannot provide everybody equal comfort from the same mattress. By the buried pressure sensor array and actuator array in foam layer of a mattress, both are connected to a controller to generate the pressure distribution mapping of a human body on the mattress, then from the data of this mapping, some of the actuators are driven up or down by the controller to generate a body-contouring uniform support. By the aid of mathematical morphology algorithms, user can also choose a different support mode by another wireless controller with touch-screen to accommodate personal favorite firmness of the mattress and to take his tensed mood and pressure off with good sleep until daylight. Moreover, some other homecare functions, such as temperature measurement, sleep on posture correction and fall down prevention, can approach by additional hardware and software as user requirement in the future.
Compressive Sampling for Networked Feedback Control
Venue: arXiv cs.SY 2013
Year: 2013

We investigate the use of compressive sampling for networked feedback control systems. The method proposed serves to compress the control vectors which are transmitted through rate-limited channels without much deterioration of control performance. The control vectors are obtained by an L1-L2 optimization, which can be solved very efficiently by FISTA (Fast Iterative Shrinkage-Thresholding Algorithm). Simulation results show that the proposed sparsity-promoting control scheme gives a better control performance than a conventional energy-limiting L2-optimal control.
Finite Element Model Updating Using Fish School Search Optimization Method
Venue: arXiv cs.CE 2013
Year: 2013

A recent nature inspired optimization algorithm, Fish School Search (FSS) is applied to the finite element model (FEM) updating problem. This method is tested on a GARTEUR SM-AG19 aeroplane structure. The results of this algorithm are compared with two other metaheuristic algorithms; Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). It is observed that on average, the FSS and PSO algorithms give more accurate results than the GA. A minor modification to the FSS is proposed. This modification improves the performance of FSS on the FEM updating problem which has a constrained search space.
Applying the Negative Selection Algorithm for Merger and Acquisition Target Identification
Venue: arXiv cs.AI 2013
Year: 2013

In this paper, we propose a new methodology based on the Negative Selection Algorithm that belongs to the field of Computational Intelligence, specifically, Artificial Immune Systems to identify takeover targets. Although considerable research based on customary statistical techniques and some contemporary Computational Intelligence techniques have been devoted to identify takeover targets, most of the existing studies are based upon multiple previous mergers and acquisitions. Contrary to previous research, the novelty of this proposal lies in its ability to suggest takeover targets for novice firms that are at the beginning of their merger and acquisition spree. We first discuss the theoretical perspective and then provide a case study with details for practical implementation, both capitalizing from unique generalization capabilities of artificial immune systems algorithms.
Path Conditions Help to Locate and Localize Faults from Programs
Venue: arXiv cs.SE 2013
Year: 2013

Precisely and automatically detection of faults in programs, is a software engineering dream. Every effort in this regard takes us one step closer to realizing it. Many efforts have been taken from the people of these areas on testing, verification and debugging. We are proposing such effort for the research community of this domain is using path conditions to generate a minimal set of PLOFC (possible lines of faulty code). It's a run time method that will effectively bring the minimal possible set of faulty lines of code through the help of path conditions and some heuristics involved. In this paper we are generating possible fault locations from programs using path conditions which can put positive impact on the static analysis of programs. Further we discuss the basic ideas regarding path conditions, the theory, and first analysis results. This work is based on a previous work that uses the variable dependences for fault detection. We showed some examples to the applicable of this idea and can be useful for software verification.
Super-Fast Distributed Algorithms for Metric Facility Location
Venue: arXiv cs.DC 2013
Year: 2013

This paper presents a distributed O(1)-approximation algorithm, with expected-$O(\log \log n)$ running time, in the $\mathcal{CONGEST}$ model for the metric facility location problem on a size-$n$ clique network. Though metric facility location has been considered by a number of researchers in low-diameter settings, this is the first sub-logarithmic-round algorithm for the problem that yields an O(1)-approximation in the setting of non-uniform facility opening costs. In order to obtain this result, our paper makes three main technical contributions. First, we show a new lower bound for metric facility location, extending the lower bound of Bădoiu et al. (ICALP 2005) that applies only to the special case of uniform facility opening costs. Next, we demonstrate a reduction of the distributed metric facility location problem to the problem of computing an O(1)-ruling set of an appropriate spanning subgraph. Finally, we present a sub-logarithmic-round (in expectation) algorithm for computing a 2-ruling set in a spanning subgraph of a clique. Our algorithm accomplishes this by using a combination of randomized and deterministic sparsification.
A Simple Circle Discretization Algorithm With Applications
Venue: arXiv cs.DS 2013
Year: 2013

In CNC manufacturing,there often arises the need to create G-Code programs which require the calculation of discrete x-y coordinate pairs(2D).An example of this situation is when the programmer needs to create a program to machine a helix(or thread).The required toolpath will be a set of points on a helix curve.The problem now entails calculating the number of points along this curve.Too few points and the toolpath will not be smooth.Too many points and the program becomes too big.This article will serve to provide a simple way to divide a circle into discrete points,with a notion of "dimensional tolerance" built into the algorithm.
Work Breakdown Structure: A Tool for Software Project Scope Verification
Venue: arXiv cs.SE 2013
Year: 2013

Software project scope verification is a very important process in project scope management and it needs to be performed properly and thoroughly so as to avoid project rework and scope creep. Moreover, software scope verification is crucial in the process of delivering exactly what the customer requested and minimizing project scope changes. Well defined software scope eases the process of scope verification and contributes to project success. Furthermore, a deliverable-oriented WBS provides a road map to a well defined software scope of work. It is on the basis of this that this paper extends the use of deliverable-oriented WBS to that of scope verification process. This paper argues that a deliverable-oriented WBS is a tool for software scope verification.
As-puma ; anycast semantics in parking using metaheuristic approach
Venue: arXiv cs.NI 2013
Year: 2013

The number of vehicle used in the world are increasing day by day resulting in the obvious problem of parking of these vehicles in residential and vocational areas. We perceive the problem of vehicles parking in vocational establishments / malls. Today majority of parking systems are manual parking systems where in, on the spot, parking of the vehicle is done and a parking slip is generated and handed over to customer. This is cumbersome technique wherein various parking attendants in the parking areas manually keeps on informing the Parking inspector on how many free parking slots available so that only that many number of parking slips/tickets are generated as the number of free parking slots. We address the problem of parking in Delay Tolerant Network (DTN) by proposing metaheuristic driven approach of Ant Colony optimization (ACO) technique with anycast semantics models . Here we propose the parking architecture to solve the problem of parking especially in commercial areas with their design diagrams . In this architecture we apply the delivery model to deliver the packet correctly to the intended receiver. Using this we can book various parkings through remote areas so that the customer can get the information about availability of various parkings inside an area and the parking fare for each category of the automobile. Using this architecture the customer can get the prior knowledge about various vacant parking slots inside a parking area and he can book the corresponding parking from his location.
ERP projects Internal Stakeholder network and how it influences the projects outcome
Venue: arXiv cs.SI 2013
Year: 2013

So far little effort has been put into researching the importance of internal ERP project stakeholders mutual interactions,realizing the projects complexity,influence on the whole organization, and high risk for a useful final outcome. This research analyzes the stakeholders interactions and positions in the project network, their criticality, potential bottlenecks and conflicts. The main methods used are Social Network Analysis, and the elicitation of drivers for the individual players. Information was collected from several stakeholders from three large ERP projects all in global companies headquartered in Finland, together with representatives from two different ERP vendors, and with two experienced ERP consultants. The analysis gives quantitative as well as qualitative characterization of stakeholder criticality (mostly the Project Manager(s), the Business Owner(s) and the Process Owner(s)), degree of centrality, closeness, mediating or bottleneck roles, relational ties and conflicts (individual, besides those between business and project organizations), and clique formations. A generic internal stakeholder network model is established as well as the criticality of the project phases. The results are summarized in the form of a list of recommendations for future ERP projects to address the internal stakeholder impacts .Project management should utilize the latest technology to provide tools to increase the interaction between the stakeholders and to monitor the strength of these relations. Social network analysis tools could be used in the projects to visualize the stakeholder relations in order to better understand the possible risks related to the relations (or lack of them).
System and Methods for Converting Speech to SQL
Venue: arXiv cs.CL 2013
Year: 2013

This paper concerns with the conversion of a Spoken English Language Query into SQL for retrieving data from RDBMS. A User submits a query as speech signal through the user interface and gets the result of the query in the text format. We have developed the acoustic and language models using which a speech utterance can be converted into English text query and thus natural language processing techniques can be applied on this English text query to generate an equivalent SQL query. For conversion of speech into English text HTK and Julius tools have been used and for conversion of English text query into SQL query we have implemented a System which uses rule based translation to translate English Language Query into SQL Query. The translation uses lexical analyzer, parser and syntax directed translation techniques like in compilers. JFLex and BYACC tools have been used to build lexical analyzer and parser respectively. System is domain independent i.e. system can run on different database as it generates lex files from the underlying database.
Performance Analysis of Connection Admission Control Scheme in IEEE 802.16 OFDMA Networks
Venue: arXiv cs.PF 2013
Year: 2013

IEEE 802.16 OFDMA (Orthogonal Frequency Division Multiple Access) technology has emerged as a promising technology for broadband access in a Wireless Metropolitan Area Network (WMAN) environment. In this paper, we address the problem of queueing theoretic performance modeling and analysis of OFDMA under broad-band wireless networks. We consider a single-cell IEEE 802.16 environment in which the base station allocates subchannels to the subscriber stations in its coverage area. The subchannels allocated to a subscriber station are shared by multiple connections at that subscriber station. To ensure the Quality of Service (QoS) performances, a Connection Admission Control (CAC) scheme is considered at a subscriber station. A queueing analytical framework for these admission control schemes is presented considering OFDMA-based transmission at the physical layer. Then, based on the queueing model, both the connection-level and the packet-level performances are studied and compared with their analogues in the case without CAC. The connection arrival is modeled by a Poisson process and the packet arrival for a connection by a two-state Markov Modulated Poisson Process (MMPP). We determine analytically and numerically different performance parameters, such as connection blocking probability, average number of ongoing connections, average queue length, packet dropping probability, queue throughput and average packet delay.
Can Visible Light Communications Provide Gb/s Service?
Venue: arXiv cs.IT 2013
Year: 2013

Visible light communications (VLC) that use the infrastructure of the indoor illumination system have been envisioned as a compact, safe, and green alternative to WiFi for the downlink of an indoor wireless mobile communication system. Although the optical spectrum is typically well-suited to high throughput applications, combining communications with indoor lighting in a commercially viable system imposes severe limitations both in bandwidth and received power. Clever techniques are needed to achieve Gb/s transmission, and to do it in a cost effective manner so as to successfully compete with other high-capacity alternatives for indoor access, such as millimeter-wave radio-frequency (RF). This article presents modulation schemes that have the potential to overcome the many challenges faced by VLC in providing multi Gb/s indoor wireless connectivity.
On the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation
Venue: arXiv cs.IT 2013
Year: 2013

This paper gives the approximate capacity region of a two-user MIMO interference channel with limited receiver cooperation, where the gap between the inner and outer bounds is in terms of the total number of receive antennas at the two receivers and is independent of the actual channel values. The approximate capacity region is then used to find the degrees of freedom region. For the special case of symmetric interference channels, we also find the amount of receiver cooperation in terms of the backhaul capacity beyond which the degrees of freedom do not improve. Further, the generalized degrees of freedom are found for MIMO interference channels with equal number of antennas at all nodes. It is shown that the generalized degrees of freedom improve gradually from a "W" curve to a "V" curve with increase in cooperation in terms of the backhaul capacity.
On Linear Congestion Games with Altruistic Social Context
Venue: arXiv cs.GT 2013
Year: 2013

We study the issues of existence and inefficiency of pure Nash equilibria in linear congestion games with altruistic social context, in the spirit of the model recently proposed by de Keijzer {\em et al.} \cite{DSAB13}. In such a framework, given a real matrix $Γ=(γ_{ij})$ specifying a particular social context, each player $i$ aims at optimizing a linear combination of the payoffs of all the players in the game, where, for each player $j$, the multiplicative coefficient is given by the value $γ_{ij}$. We give a broad characterization of the social contexts for which pure Nash equilibria are always guaranteed to exist and provide tight or almost tight bounds on their prices of anarchy and stability. In some of the considered cases, our achievements either improve or extend results previously known in the literature.
ESPOON$_{ERBAC}$: Enforcing Security Policies In Outsourced Environments
Venue: arXiv cs.CR 2013
Year: 2013

Data outsourcing is a growing business model offering services to individuals and enterprises for processing and storing a huge amount of data. It is not only economical but also promises higher availability, scalability, and more effective quality of service than in-house solutions. Despite all its benefits, data outsourcing raises serious security concerns for preserving data confidentiality. There are solutions for preserving confidentiality of data while supporting search on the data stored in outsourced environments. However, such solutions do not support access policies to regulate access to a particular subset of the stored data. For complex user management, large enterprises employ Role-Based Access Controls (RBAC) models for making access decisions based on the role in which a user is active in. However, RBAC models cannot be deployed in outsourced environments as they rely on trusted infrastructure in order to regulate access to the data. The deployment of RBAC models may reveal private information about sensitive data they aim to protect. In this paper, we aim at filling this gap by proposing \textbf{$\mathit{ESPOON_{ERBAC}}$} for enforcing RBAC policies in outsourced environments. $\mathit{ESPOON_{ERBAC}}$ enforces RBAC policies in an encrypted manner where a curious service provider may learn a very limited information about RBAC policies. We have implemented $\mathit{ESPOON_{ERBAC}}$ and provided its performance evaluation showing a limited overhead, thus confirming viability of our approach.
Computational Rationalization: The Inverse Equilibrium Problem
Venue: arXiv cs.GT 2013
Year: 2013

Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior is an approximately optimal solution to an unknown decision problem. These techniques learn a utility function that explains the example behavior and can then be used to accurately predict or imitate future behavior in similar observed or unobserved situations. In this work, we consider similar tasks in competitive and cooperative multi-agent domains. Here, unlike single-agent settings, a player cannot myopically maximize its reward; it must speculate on how the other agents may act to influence the game's outcome. Employing the game-theoretic notion of regret and the principle of maximum entropy, we introduce a technique for predicting and generalizing behavior.
Fast Stochastic Alternating Direction Method of Multipliers
Venue: arXiv cs.LG 2013
Year: 2013

In this paper, we propose a new stochastic alternating direction method of multipliers (ADMM) algorithm, which incrementally approximates the full gradient in the linearized ADMM formulation. Besides having a low per-iteration complexity as existing stochastic ADMM algorithms, the proposed algorithm improves the convergence rate on convex problems from $O(\frac 1 {\sqrt{T}})$ to $O(\frac 1 T)$, where $T$ is the number of iterations. This matches the convergence rate of the batch ADMM algorithm, but without the need to visit all the samples in each iteration. Experiments on the graph-guided fused lasso demonstrate that the new algorithm is significantly faster than state-of-the-art stochastic and batch ADMM algorithms.
Hoodsquare: Modeling and Recommending Neighborhoods in Location-based Social Networks
Venue: arXiv cs.CY 2013
Year: 2013

Information garnered from activity on location-based social networks can be harnessed to characterize urban spaces and organize them into neighborhoods. In this work, we adopt a data-driven approach to the identification and modeling of urban neighborhoods using location-based social networks. We represent geographic points in the city using spatio-temporal information about Foursquare user check-ins and semantic information about places, with the goal of developing features to input into a novel neighborhood detection algorithm. The algorithm first employs a similarity metric that assesses the homogeneity of a geographic area, and then with a simple mechanism of geographic navigation, it detects the boundaries of a city's neighborhoods. The models and algorithms devised are subsequently integrated into a publicly available, map-based tool named Hoodsquare that allows users to explore activities and neighborhoods in cities around the world. Finally, we evaluate Hoodsquare in the context of a recommendation application where user profiles are matched to urban neighborhoods. By comparing with a number of baselines, we demonstrate how Hoodsquare can be used to accurately predict the home neighborhood of Twitter users. We also show that we are able to suggest neighborhoods geographically constrained in size, a desirable property in mobile recommendation scenarios for which geographical precision is key.
Just In Time Indexing
Venue: arXiv cs.DB 2013
Year: 2013

One of the major challenges being faced by Database managers today is to manage the performance of complex SQL queries which are dynamic in nature. Since it is not possible to tune each and every query because of its dynamic nature, there is a definite possibility that these queries may cause serious database performance issues if left alone. Conventional indexes are useful only for those queries which are frequently executed or those columns which are frequently joined in SQL queries. This proposal is regarding a method, a query optimizer for optimizing database queries in a database management system. Just In Time(JIT) indexes are On Demand, temporary indexes created on the fly based on current needs so that they would be able to satisfy any kind of queries. JIT indexes are created only when the configured threshold values for resource consumption are exceeded for a query. JIT indexes will be stored in a temporary basis and will get replaced by new JIT indexes in course of time. The proposal is substantiated with the help of experimental programs and with various test cases. The idea of parallel programming is also brought into picture as it can be effectively used in a multiprocessor system. Multiple threads are employed while one set of threads proceed in the conventional way and the other set of threads proceed with the proposed way. A live switch over is made when a suitable stage is reached and from then onwards the proposed method will only come into picture.