OpenRaiser/Intern-Atlas huggingface dataset:
Self-improving Algorithms for Coordinate-wise Maxima
Venue: arXiv cs.CG 2012
Year: 2012

Computing the coordinate-wise maxima of a planar point set is a classic and well-studied problem in computational geometry. We give an algorithm for this problem in the \emph{self-improving setting}. We have $n$ (unknown) independent distributions $\cD_1, \cD_2, ..., \cD_n$ of planar points. An input pointset $(p_1, p_2, ..., p_n)$ is generated by taking an independent sample $p_i$ from each $\cD_i$, so the input distribution $\cD$ is the product $\prod_i \cD_i$. A self-improving algorithm repeatedly gets input sets from the distribution $\cD$ (which is \emph{a priori} unknown) and tries to optimize its running time for $\cD$. Our algorithm uses the first few inputs to learn salient features of the distribution, and then becomes an optimal algorithm for distribution $\cD$. Let $\OPT_\cD$ denote the expected depth of an \emph{optimal} linear comparison tree computing the maxima for distribution $\cD$. Our algorithm eventually has an expected running time of $O(\text{OPT}_\cD + n)$, even though it did not know $\cD$ to begin with. Our result requires new tools to understand linear comparison trees for computing maxima. We show how to convert general linear comparison trees to very restricted versions, which can then be related to the running time of our algorithm. An interesting feature of our algorithm is an interleaved search, where the algorithm tries to determine the likeliest point to be maximal with minimal computation. This allows the running time to be truly optimal for the distribution $\cD$.
Mitigating Timing Errors in Time-Interleaved ADCs: a signal conditioning approach
Venue: arXiv cs.IT 2012
Year: 2012

Novel techniques based on signal-conditioning are presented to mitigate timing errors in time-interleaved ADCs. A theoretical bound on the achievable spurious signal content, on applying the techniques, is also derived. Behavioral simulations corroborating the same are presented.
Approximability of the Vertex Cover Problem in Power Law Graphs
Venue: arXiv cs.DS 2012
Year: 2012

In this paper we construct an approximation algorithm for the Minimum Vertex Cover Problem (Min-VC) with an expected approximation ratio of 2-f(beta) for random Power Law Graphs (PLG) in the (alpha,beta)-model of Aiello et. al., where f(beta) is a strictly positive function of the parameter beta. We obtain this result by combining the Nemhauser and Trotter approach for Min-VC with a new deterministic rounding procedure which achieves an approximation ratio of 3/2 on a subset of low degree vertices for which the expected contribution to the cost of the associated linear program is sufficiently large.
Memory Resilient Gain-scheduled State-Feedback Control of Uncertain LTI/LPV Systems with Time-Varying Delays
Venue: arXiv cs.SY 2012
Year: 2012

The stabilization of uncertain LTI/LPV time delay systems with time varying delays by state-feedback controllers is addressed. At the difference of other works in the literature, the proposed approach allows for the synthesis of resilient controllers with respect to uncertainties on the implemented delay. It is emphasized that such controllers unify memoryless and exact-memory controllers usually considered in the literature. The solutions to the stability and stabilization problems are expressed in terms of LMIs which allow to check the stability of the closed-loop system for a given bound on the knowledge error and even optimize the uncertainty radius under some performance constraints; in this paper, the $\mathcal{H}_\infty$ performance measure is considered. The interest of the approach is finally illustrated through several examples.
Cloud Computing Security in Business Information Systems
Venue: arXiv cs.CR 2012
Year: 2012

Cloud computing providers' and customers' services are not only exposed to existing security risks, but, due to multi-tenancy, outsourcing the application and data, and virtualization, they are exposed to the emergent, as well. Therefore, both the cloud providers and customers must establish information security system and trustworthiness each other, as well as end users. In this paper we analyze main international and industrial standards targeting information security and their conformity with cloud computing security challenges. We evaluate that almost all main cloud service providers (CSPs) are ISO 27001:2005 certified, at minimum. As a result, we propose an extension to the ISO 27001:2005 standard with new control objective about virtualization, to retain generic, regardless of company's type, size and nature, that is, to be applicable for cloud systems, as well, where virtualization is its baseline. We also define a quantitative metric and evaluate the importance factor of ISO 27001:2005 control objectives if customer services are hosted on-premise or in cloud. The conclusion is that obtaining the ISO 27001:2005 certificate (or if already obtained) will further improve CSP and CC information security systems, and introduce mutual trust in cloud services but will not cover all relevant issues. In this paper we also continue our efforts in business continuity detriments cloud computing produces, and propose some solutions that mitigate the risks.
An initial peer configuration algorithm for multi-streaming peer-to-peer networks
Venue: arXiv cs.NI 2012
Year: 2012

The growth of the Internet technology enables us to use network applications for streaming audio and video. Especially, real-time streaming services using peer-to-peer (P2P) technology are currently emerging. An important issue on P2P streaming is how to construct a logical network (overlay network) on a physical network (IP network). In this paper, we propose an initial peer configuration algorithm for a multi-streaming peer-to-peer network. The proposed algorithm is based on a mesh-pull approach where any node has multiple parent and child nodes as neighboring nodes, and content transmitted between these neighboring nodes depends on their parent-child relationships. Our simulation experiments show that the proposed algorithm improves the number of joining node and traffic load.
C-slow Technique vs Multiprocessor in designing Low Area Customized Instruction set Processor for Embedded Applications
Venue: arXiv cs.AR 2012
Year: 2012

The demand for high performance embedded processors, for consumer electronics, is rapidly increasing for the past few years. Many of these embedded processors depend upon custom built Instruction Ser Architecture (ISA) such as game processor (GPU), multimedia processors, DSP processors etc. Primary requirement for consumer electronic industry is low cost with high performance and low power consumption. A lot of research has been evolved to enhance the performance of embedded processors through parallel computing. But some of them focus superscalar processors i.e. single processors with more resources like Instruction Level Parallelism (ILP) which includes Very Long Instruction Word (VLIW) architecture, custom instruction set extensible processor architecture and others require more number of processing units on a single chip like Thread Level Parallelism (TLP) that includes Simultaneous Multithreading (SMT), Chip Multithreading (CMT) and Chip Multiprocessing (CMP). In this paper, we present a new technique, named C-slow, to enhance performance for embedded processors for consumer electronics by exploiting multithreading technique in single core processors. Without resulting into the complexity of micro controlling with Real Time Operating system (RTOS), C-slowed processor can execute multiple threads in parallel using single datapath of Instruction Set processing element. This technique takes low area & approach complexity of general purpose processor running RTOS.
How Many Vote Operations Are Needed to Manipulate A Voting System?
Venue: arXiv cs.AI 2012
Year: 2012

In this paper, we propose a framework to study a general class of strategic behavior in voting, which we call vote operations. We prove the following theorem: if we fix the number of alternatives, generate $n$ votes i.i.d. according to a distribution $π$, and let $n$ go to infinity, then for any $ε>0$, with probability at least $1-ε$, the minimum number of operations that are needed for the strategic individual to achieve her goal falls into one of the following four categories: (1) 0, (2) $Θ(\sqrt n)$, (3) $Θ(n)$, and (4) $\infty$. This theorem holds for any set of vote operations, any individual vote distribution $π$, and any integer generalized scoring rule, which includes (but is not limited to) almost all commonly studied voting rules, e.g., approval voting, all positional scoring rules (including Borda, plurality, and veto), plurality with runoff, Bucklin, Copeland, maximin, STV, and ranked pairs. We also show that many well-studied types of strategic behavior fall under our framework, including (but not limited to) constructive/destructive manipulation, bribery, and control by adding/deleting votes, margin of victory, and minimum manipulation coalition size. Therefore, our main theorem naturally applies to these problems.
Experimenting with Component-Based Middleware for Adaptive Fault Tolerant Computing
Venue: arXiv cs.SE 2012
Year: 2012

This short paper describes early experiments to validate the capabilities of a component-based platform to observe and control a software architecture in the small. This is part of a whole process for resilient computing, i.e. targeting the adaptation of fault-tolerance mechanisms at runtime.
The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal
Venue: arXiv cs.GT 2012
Year: 2012

In this paper we show that for any mechanism design problem with the objective of maximizing social welfare, the exponential mechanism can be implemented as a truthful mechanism while still preserving differential privacy. Our instantiation of the exponential mechanism can be interpreted as a generalization of the VCG mechanism in the sense that the VCG mechanism is the extreme case when the privacy parameter goes to infinity. To our knowledge, this is the first general tool for designing mechanisms that are both truthful and differentially private.
An Implementation of Intrusion Detection System Using Genetic Algorithm
Venue: arXiv cs.CR 2012
Year: 2012

Nowadays it is very important to maintain a high level security to ensure safe and trusted communication of information between various organizations. But secured data communication over internet and any other network is always under threat of intrusions and misuses. So Intrusion Detection Systems have become a needful component in terms of computer and network security. There are various approaches being utilized in intrusion detections, but unfortunately any of the systems so far is not completely flawless. So, the quest of betterment continues. In this progression, here we present an Intrusion Detection System (IDS), by applying genetic algorithm (GA) to efficiently detect various types of network intrusions. Parameters and evolution processes for GA are discussed in details and implemented. This approach uses evolution theory to information evolution in order to filter the traffic data and thus reduce the complexity. To implement and measure the performance of our system we used the KDD99 benchmark dataset and obtained reasonable detection rate.
Characteristics of Minimal Effective Programming Systems
Venue: arXiv cs.LO 2012
Year: 2012

The Rogers semilattice of effective programming systems (epses) is the collection of all effective numberings of the partial computable functions ordered such that θ is less than or equal to ψ whenever θ-programs can be algorithmically translated into ψ-programs. Herein, it is shown that an eps ψ is minimal in this ordering if and only if, for each translation function t into ψ, there exists a computably enumerable equivalence relation (ceer) R such that (i) R is a subrelation of ψ's program equivalence relation, and (ii) R equates each ψ-program to some program in the range of t. It is also shown that there exists a minimal eps for which no single such R does the work for all such t. In fact, there exists a minimal eps ψ such that, for each ceer R, either R contradicts ψ's program equivalence relation, or there exists a translation function t into ψ such that the range of t fails to intersect infinitely many of R's equivalence classes.
An Intelligent Network Selection Strategy Based on MADM Methods in Heterogeneous Networks
Venue: arXiv cs.NI 2012
Year: 2012

Providing service continuity to the end users with best quality is a very important issue in the next generation wireless communications. With the evolution of the mobile devices towards a multimode architecture and the coexistence of multitude of radio access technologies (RAT's), the users are able to benefit simultaneously from these RAT's. However, the major issue in heterogeneous wireless communications is how to choose the most suitable access network for mobile's user which can be used as long as possible for communication. To achieve this issue, this paper proposes an intelligent network selection strategy which combines two multi attribute decision making (MADM) methods such as analytic network process (ANP) and the technique for order preference by similarity to an ideal solution (TOPSIS) method. The ANP method is used to find the differentiate weights of available networks by considering each criterion and the TOPSIS method is applied to rank the alternatives. Our new strategy for network selection can dealing with the limitations of MADM methods which are the ranking abnormality and the ping-ponf effect.
An Effective Information Retrieval for Ambiguous Query
Venue: arXiv cs.IR 2012
Year: 2012

Search engine returns thousands of web pages for a single user query, in which most of them are not relevant. In this context, effective information retrieval from the expanding web is a challenging task, in particular, if the query is ambiguous. The major question arises here is that how to get the relevant pages for an ambiguous query. We propose an approach for the effective result of an ambiguous query by forming community vector based on association concept of data minning using vector space model and the freedictionary. We develop clusters by computing the similarity between community vectors and document vectors formed from the extracted web pages by the search engine. We use Gensim package to implement the algorithm because of its simplicity and robust nature. Analysis shows that our approach is an effective way to form clusters for an ambiguous query.
An integrated ranking algorithm for efficient information computing in social networks
Venue: arXiv cs.SI 2012
Year: 2012

Social networks have ensured the expanding disproportion between the face of WWW stored traditionally in search engine repositories and the actual ever changing face of Web. Exponential growth of web users and the ease with which they can upload contents on web highlights the need of content controls on material published on the web. As definition of search is changing, socially-enhanced interactive search methodologies are the need of the hour. Ranking is pivotal for efficient web search as the search performance mainly depends upon the ranking results. In this paper new integrated ranking model based on fused rank of web object based on popularity factor earned over only valid interlinks from multiple social forums is proposed. This model identifies relationships between web objects in separate social networks based on the object inheritance graph. Experimental study indicates the effectiveness of proposed Fusion based ranking algorithm in terms of better search results.
Online multipath convolutional coding for real-time transmission
Venue: arXiv cs.NI 2012
Year: 2012

Most of multipath multimedia streaming proposals use Forward Error Correction (FEC) approach to protect from packet losses. However, FEC does not sustain well burst of losses even when packets from a given FEC block are spread over multiple paths. In this article, we propose an online multipath convolutional coding for real-time multipath streaming based on an on-the-fly coding scheme called Tetrys. We evaluate the benefits brought out by this coding scheme inside an existing FEC multipath load splitting proposal known as Encoded Multipath Streaming (EMS). We demonstrate that Tetrys consistently outperforms FEC in both uniform and burst losses with EMS scheme. We also propose a modification of the standard EMS algorithm that greatly improves the performance in terms of packet recovery. Finally, we analyze different spreading policies of the Tetrys redundancy traffic between available paths and observe that the longer propagation delay path should be preferably used to carry repair packets.
Efficient computational noise in GLSL
Venue: arXiv cs.GR 2012
Year: 2012

We present GLSL implementations of Perlin noise and Perlin simplex noise that run fast enough for practical consideration on current generation GPU hardware. The key benefits are that the functions are purely computational, i.e. they use neither textures nor lookup tables, and that they are implemented in GLSL version 1.20, which means they are compatible with all current GLSL-capable platforms, including OpenGL ES 2.0 and WebGL 1.0. Their performance is on par with previously presented GPU implementations of noise, they are very convenient to use, and they scale well with increasing parallelism in present and upcoming GPU architectures.
Ensuring QOS Guarantees in a Hybrid OCS/OBS Network
Venue: arXiv cs.NI 2012
Year: 2012

The bursting aggregation assembly in edge nodes is one of the key technologies in OBS (Optical Burst Switching) network, which has a direct impact on flow characteristics and packet loss rate. An optical burst assembly technique supporting QoS is presented through this paper, which can automatically adjust the threshold along with the increasing and decreasing volume of business, reduce the operational burst, and generate corresponding BDP (Burst Data Packet) and BCP (Burst Control Packet). In addition to the burst aggregation technique a packet recovery technique by restoration method is also described. The data packet loss due to the physical optical link failure is not currently included in the QoS descriptions. This link failure is also a severe problem which reduces the data throughput of the transmitter node. A mechanism for data recovery from this link failure is vital for guaranteeing the QoS demanded by each user. So this paper will also discusses a specific protocol for reducing the packet loss by utilizing the features of both optical circuit switching (OCS) and Optical Burst switching (OBS) techniques.
On Cascade Source Coding with A Side Information "Vending Machine"
Venue: arXiv cs.IT 2012
Year: 2012

The model of a side information "vending machine" accounts for scenarios in which acquiring side information is costly and thus should be done efficiently. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information vending machine is available either at the intermediate or at the end node. In both cases, a single-letter characterization of the available trade-offs among the rate, the distortions in the reconstructions at the intermediate and at the end node, and the cost in acquiring the side information are derived under given conditions.
An Intelligent Location Management approaches in GSM Mobile Network
Venue: arXiv cs.NI 2012
Year: 2012

Location management refers to the problem of updating and searching the current location of mobile nodes in a wireless network. To make it efficient, the sum of update costs of location database must be minimized. Previous work relying on fixed location databases is unable to fully exploit the knowledge of user mobility patterns in the system so as to achieve this minimization. The study presents an intelligent location management approach which has interacts between intelligent information system and knowledge-base technologies, so we can dynamically change the user patterns and reduce the transition between the VLR and HLR. The study provides algorithms are ability to handle location registration and call delivery
Handsets Malware Threats and Facing Techniques
Venue: arXiv cs.CR 2012
Year: 2012

Nowadays, mobile handsets combine the functionality of mobile phones and PDAs. Unfortunately, mobile handsets development process has been driven by market demand, focusing on new features and neglecting security. So, it is imperative to study the existing challenges that facing the mobile handsets threat containment process, and the different techniques and methodologies that used to face those challenges and contain the mobile handsets malwares. This paper also presents a new approach to group the different malware containment systems according to their typologies.
Cross Layer QoS Support Architecture with Integrated CAC and Scheduling Algorithms for WiMAX BWA Networks
Venue: arXiv cs.NI 2012
Year: 2012

In this paper, a new technique for cross layer design, based on present Eb/N0 (bit energy per noise density) ratio of the connections and target values of the Quality of Service (QoS) information parameters from MAC layer, is proposed to dynamically select the Modulation and Coding Scheme (MCS) at the PHY layer for WiMAX Broadband Wireless Access (BWA) networks. The QoS information parameter includes New Connection Blocking Probability (NCBP), Hand off Connection Dropping Probability (HCDP) and Connection Outage Probability (COP). In addition, a Signal to Interference plus Noise Ratio (SINR) based Call Admission Control (CAC) algorithm and Queue based Scheduling algorithm are integrated for the cross layer design. An analytical model using the Continuous Time Markov Chain (CTMC) is developed for performance evaluation of the algorithms under various MCS. The effect of Eb/No is observed for QoS information parameters in order to determine its optimum range. Simulation results show that the integrated CAC and packet Scheduling model maximizes the bandwidth utilization and fair allocation of the system resources for all types of MCS and guarantees the QoS to the connections.
Image segmentation by adaptive distance based on EM algorithm
Venue: arXiv cs.CV 2012
Year: 2012

This paper introduces a Bayesian image segmentation algorithm based on finite mixtures. An EM algorithm is developed to estimate parameters of the Gaussian mixtures. The finite mixture is a flexible and powerful probabilistic modeling tool. It can be used to provide a model-based clustering in the field of pattern recognition. However, the application of finite mixtures to image segmentation presents some difficulties; especially it's sensible to noise. In this paper we propose a variant of this method which aims to resolve this problem. Our approach proceeds by the characterization of pixels by two features: the first one describes the intrinsic properties of the pixel and the second characterizes the neighborhood of pixel. Then the classification is made on the base on adaptive distance which privileges the one or the other features according to the spatial position of the pixel in the image. The obtained results have shown a significant improvement of our approach compared to the standard version of EM algorithm.
The Lego Mindstorms Robotics Invention Systems 2.0 Toolkit: A Study Case
Venue: arXiv cs.RO 2012
Year: 2012

This paper reviews the aspects of the LEGO\textregistered Mindstorms\trademark robotics invention system 2.0 \trademark (RIS), by presenting the different elements of the kit, and relating them to actual robot components and norms. Furthermore a comparison between the LCS and Java is made, as well as comparing the RCX board to other technologies, specifically LEGO \textregistered NXT and MIT's "Handy Board". Also, concrete examples of application using the RIS are presented.