OpenRaiser/Intern-Atlas huggingface dataset:
Hybrid Radio-map for Noise Tolerant Wireless Indoor Localization
Venue: arXiv cs.NI 2013
Year: 2013

In wireless networks, radio-map based locating techniques are commonly used to cope the complex fading feature of radio signal, in which a radio-map is built by calibrating received signal strength (RSS) signatures at training locations in the offline phase. However, in severe hostile environments, such as in ship cabins where severe shadowing, blocking and multi-path fading effects are posed by ubiquitous metallic architecture, even radio-map cannot capture the dynamics of RSS. In this paper, we introduced multiple feature radio-map location method for severely noisy environments. We proposed to add low variance signature into radio map. Since the low variance signatures are generally expensive to obtain, we focus on the scenario when the low variance signatures are sparse. We studied efficient construction of multi-feature radio-map in offline phase, and proposed feasible region narrowing down and particle based algorithm for online tracking. Simulation results show the remarkably performance improvement in terms of positioning accuracy and robustness against RSS noises than the traditional radio-map method.
Mind Your Language: Effects of Spoken Query Formulation on Retrieval Effectiveness
Venue: arXiv cs.IR 2013
Year: 2013

Voice search is becoming a popular mode for interacting with search engines. As a result, research has gone into building better voice transcription engines, interfaces, and search engines that better handle inherent verbosity of queries. However, when one considers its use by non- native speakers of English, another aspect that becomes important is the formulation of the query by users. In this paper, we present the results of a preliminary study that we conducted with non-native English speakers who formulate queries for given retrieval tasks. Our results show that the current search engines are sensitive in their rankings to the query formulation, and thus highlights the need for developing more robust ranking methods.
Toward an agent based distillation approach for protesting crowd simulation
Venue: arXiv cs.MA 2013
Year: 2013

This paper investigates the problem of protesting crowd simulation. It considers CROCADILE, an agent based distillation system, for this purpose. A model of protesting crowd was determined and then a CROCADILE model of protesting crowd was engineered and demonstrated. We validated the model by using two scenarios where protesters are varied with different personalities. The results indicated that CROCADILE served well as the platform for protesting crowd modeling simulation
A Trust Based Congestion Aware Hybrid Ant Colony Optimization Algorithm for Energy Efficient Routing in Wireless Sensor Networks (TC-ACO)
Venue: arXiv cs.NI 2013
Year: 2013

Congestion is a problem of paramount importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources. Sensor nodes are prone to failure and the misbehavior of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols. Unfortunately most of the researchers have tried to make the routing schemes energy efficient without considering congestion factor and the effect of the faulty nodes. In this paper we have proposed a congestion aware, energy efficient, routing approach that utilizes Ant Colony Optimization algorithm, in which faulty nodes are isolated by means of the concept of trust. The merits of the proposed scheme are verified through simulations where they are compared with other protocols.
A Hybrid Approach for Co-Channel Speech Segregation based on CASA, HMM Multipitch Tracking, and Medium Frame Harmonic Model
Venue: arXiv cs.SD 2013
Year: 2013

This paper proposes a hybrid approach for co-channel speech segregation. HMM (hidden Markov model) is used to track the pitches of 2 talkers. The resulting pitch tracks are then enriched with the prominent pitch. The enriched tracks are correctly grouped using pitch continuity. Medium frame harmonics are used to extract the second pitch for frames with only one pitch deduced using the previous steps. Finally, the pitch tracks are input to CASA (computational auditory scene analysis) to segregate the mixed speech. The center frequency range of the gamma tone filter banks is maximized to reduce the overlap between the channels filtered for better segregation. Experiments were conducted using this hybrid approach on the speech separation challenge database and compared to the single (non-hybrid) approaches, i.e. signal processing and CASA. Results show that using the hybrid approach outperforms the single approaches.
The Generation of Minimal Tests Sets and Some Minimal Tests
Venue: arXiv cs.DM 2013
Year: 2013

The method for a problem solution of expenditures reduction of computing resources and time is developed at a pattern recognition, with the way of construction of the minimum tests sets or separate minimum tests on Boolean matrixes is suggested
I'd Rather Stay Stupid: The Advantage of Having Low Utility
Venue: arXiv cs.GT 2013
Year: 2013

Motivated by cost of computation in game theory, we explore how changing the utilities of players (changing their complexity costs) affects the outcome of a game. We show that even if we improve a player's utility in every action profile, his payoff in equilibrium might be lower than in the equilibrium before the change. We provide some conditions on games that are sufficient to ensure this does not occur. We then show how this counter-intuitive phenomenon can explain real life phenomena such as free riding, and why this might cause people to give signals indicating that they are not as good as they really are.
On Load Shedding in Complex Event Processing
Venue: arXiv cs.DB 2013
Year: 2013

Complex Event Processing (CEP) is a stream processing model that focuses on detecting event patterns in continuous event streams. While the CEP model has gained popularity in the research communities and commercial technologies, the problem of gracefully degrading performance under heavy load in the presence of resource constraints, or load shedding, has been largely overlooked. CEP is similar to "classical" stream data management, but addresses a substantially different class of queries. This unfortunately renders the load shedding algorithms developed for stream data processing inapplicable. In this paper we study CEP load shedding under various resource constraints. We formalize broad classes of CEP load-shedding scenarios as different optimization problems. We demonstrate an array of complexity results that reveal the hardness of these problems and construct shedding algorithms with performance guarantees. Our results shed some light on the difficulty of developing load-shedding algorithms that maximize utility.
On the Security of Wang's Provably Secure Identity-based Key Agreement Protocol
Venue: arXiv cs.CR 2013
Year: 2013

In a 2005 IACR report, Wang published an efficient identity-based key agreement protocol (IDAK) suitable for resource constrained devices. The author shows that the IDAK key agreement protocol is secure in the Bellare-Rogaway model with random oracles and also provides separate ad-hoc security proofs claiming that the IDAK protocol is not vulnerable to Key Compromise Impersonation attacks and also enjoys Perfect Forward Secrecy (PFS). In this report, we review the security properties of the protocol and point out that it is vulnerable to Unknown Key Share attacks. Although such attacks are often difficult to setup in a real world environment they are nevertheless interesting from a theoretical point of view so we provide a version of the protocol that fixes the problem in a standard way. We also provide a security proof of the IDAK protocol based on the Gap Bilinear Diffie Hellman and random oracle assumptions in the stronger extended Canetti-Krawczyk security model of distributed computing.
Sampling-based Learning Control for Quantum Systems with Hamiltonian Uncertainties
Venue: arXiv cs.SY 2013
Year: 2013

Robust control design for quantum systems has been recognized as a key task in the development of practical quantum technology. In this paper, we present a systematic numerical methodology of sampling-based learning control (SLC) for control design of quantum systems with Hamiltonian uncertainties. The SLC method includes two steps of "training" and "testing and evaluation". In the training step, an augmented system is constructed by sampling uncertainties according to possible distributions of uncertainty parameters. A gradient flow based learning and optimization algorithm is adopted to find the control for the augmented system. In the process of testing and evaluation, a number of samples obtained through sampling the uncertainties are tested to evaluate the control performance. Numerical results demonstrate the success of the SLC approach. The SLC method has potential applications for robust control design of quantum systems.
Near-optimal labeling schemes for nearest common ancestors
Venue: arXiv cs.DS 2013
Year: 2013

We consider NCA labeling schemes: given a rooted tree $T$, label the nodes of $T$ with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the label of their nearest common ancestor. For trees with $n$ nodes we present upper and lower bounds establishing that labels of size $(2\pm ε)\log n$, $ε<1$ are both sufficient and necessary. (All logarithms in this paper are in base 2.) Alstrup, Bille, and Rauhe (SIDMA'05) showed that ancestor and NCA labeling schemes have labels of size $\log n +Ω(\log \log n)$. Our lower bound increases this to $\log n + Ω(\log n)$ for NCA labeling schemes. Since Fraigniaud and Korman (STOC'10) established that labels in ancestor labeling schemes have size $\log n +Θ(\log \log n)$, our new lower bound separates ancestor and NCA labeling schemes. Our upper bound improves the $10 \log n$ upper bound by Alstrup, Gavoille, Kaplan and Rauhe (TOCS'04), and our theoretical result even outperforms some recent experimental studies by Fischer (ESA'09) where variants of the same NCA labeling scheme are shown to all have labels of size approximately $8 \log n$.
An Ontology-based Model for Indexing and Retrieval
Venue: arXiv cs.IR 2013
Year: 2013

Starting from an unsolved problem of information retrieval this paper presents an ontology-based model for indexing and retrieval. The model combines the methods and experiences of cognitive-to-interpret indexing languages with the strengths and possibilities of formal knowledge representation. The core component of the model uses inferences along the paths of typed relations between the entities of a knowledge representation for enabling the determination of hit quantities in the context of retrieval processes. The entities are arranged in aspect-oriented facets to ensure a consistent hierarchical structure. The possible consequences for indexing and retrieval are discussed.
Cache-aware static scheduling for hard real-time multicore systems based on communication affinities
Venue: arXiv cs.OS 2013
Year: 2013

The growing need for continuous processing capabilities has led to the development of multicore systems with a complex cache hierarchy. Such multicore systems are generally designed for improving the performance in average case, while hard real-time systems must consider worst-case scenarios. An open challenge is therefore to efficiently schedule hard real-time tasks on a multicore architecture. In this work, we propose a mathematical formulation for computing a static scheduling that minimize L1 data cache misses between hard real-time tasks on a multicore architecture using communication affinities.
Strategic Control of Proximity Relationships in Heterogeneous Search and Rescue Teams
Venue: arXiv cs.RO 2013
Year: 2013

In the context of search and rescue, we consider the problem of mission planning for heterogeneous teams that can include human, robotic, and animal agents. The problem is tackled using a mixed integer mathematical programming formulation that jointly determines the path and the activity scheduling of each agent in the team. Based on the mathematical formulation, we propose the use of soft constraints and penalties that allow the flexible strategic control of spatio-temporal relations among the search trajectories of the agents. In this way, we can enable the mission planner to obtain solutions that maximize the area coverage and, at the same time, control the spatial proximity among the agents (e.g., to minimize mutual task interference, or to promote local cooperation and data sharing). Through simulation experiments, we show the application of the strategic framework considering a number of scenarios of interest for real-world search and rescue missions.
An error event sensitive trade-off between rate and coding gain in MIMO MAC
Venue: arXiv cs.IT 2013
Year: 2013

This work considers space-time block coding for the Rayleigh fading multiple-input multiple-output (MIMO) multiple access channel (MAC). If we suppose that the receiver is performing joint maximum-likelihood (ML) decoding, optimizing a MIMO MAC code against a fixed error event leads to a situation where the joint codewords of the users in error can be seen as a single user MIMO code. In such a case pair-wise error probability (PEP) based determinant criterion of Tarokh et al. can be used to upper bound the error probability. It was already proven by Lahtonen et al. that irrespective of the used codes the determinants of the differences of codewords of the overall codematrices will decay as a function of the rates of the users. This work will study this decay phenomenon further and derive upper bounds for the decay of determinants corresponding any error event. Lower bounds for the optimal decay are studied by constructions based on algebraic number theory and Diophantine approximation. For some error profiles the constructed codes will be proven to be optimal. While the perspective of the paper is that of PEP, the final part of the paper proves how the achieved decay results can be turned into statements about the diversity-multiplexing gain trade-off (DMT).
More Classes of Complete Permutation Polynomials over $\F_q$
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over $\F_{q^r}$. In addition, we present a class of complete permutation multinomials, which is a generalization of recent work.
BW - Eye Ophthalmologic decision support system based on clinical workflow and data mining techniques-image registration algorithm
Venue: arXiv cs.CV 2013
Year: 2013

Blueworks - Medical Expert Diagnosis is developing an application, BWEye, to be used as an ophthalmology consultation decision support system. The implementation of this application involves several different tasks and one of them is the implementation of an ophthalmology images registration algorithm. The work reported in this document is related with the implementation of an algorithm to register images of angiography, colour retinography and redfree retinography. The implementations described were developed in the software MATLAB. The implemented algorithm is based in the detection of the bifurcation points (y-features) of the vascular structures of the retina that usually are visible in the referred type of images. There are proposed two approaches to establish an initial set of features correspondences. The first approach is based in the maximization of the mutual information of the bifurcation regions of the features of images. The second approach is based in the characterization of each bifurcation point and in the minimization of the Euclidean distance between the descriptions of the features of the images in the descriptors space. The final set of the matching features for a pair of images is defined through the application of the RANSAC algorithm. Although, it was not achieved the implementation of a full functional algorithm, there were made several analysis that can be important to future improvement of the current implementation.
Cryptanalysis and Improvement of Jiang et al.'s Smart Card Based Remote User Authentication Scheme
Venue: arXiv cs.CR 2013
Year: 2013

The smart card based authentication protocols try to ensure secure and authorized communication between remote entities. In 2012, Wei et al. presented an improvement of Wu et al.'s two-factor authentication scheme for TMIS which is proven vulnerable to off-line password guessing attack by Zhu. Zhu also proposed a modified scheme to overcome with weakness of Wei et al.'s scheme, although Lee and Liu showed the failure of his scheme to resist parallel session attacks. Moreover, Lee and Liu introduced an improved scheme. We analyze Wei et al.'s, Zhu's and Lee and Liu's schemes and identify that none of the schemes resist on-line password guessing attack. Moreover, these schemes do not present efficient login and password chance phase. We also show that how inefficient password change phase causes denial of service attack. Further, we propose an improved password based remote user authentication scheme with the aim to eliminate all the drawbacks of previously presented schemes.
Mining Malware Specifications through Static Reachability Analysis
Venue: arXiv cs.CR 2013
Year: 2013

The number of malicious software (malware) is growing out of control. Syntactic signature based detection cannot cope with such growth and manual construction of malware signature databases needs to be replaced by computer learning based approaches. Currently, a single modern signature capturing the semantics of a malicious behavior can be used to replace an arbitrarily large number of old-fashioned syntactical signatures. However teaching computers to learn such behaviors is a challenge. Existing work relies on dynamic analysis to extract malicious behaviors, but such technique does not guarantee the coverage of all behaviors. To sidestep this limitation we show how to learn malware signatures using static reachability analysis. The idea is to model binary programs using pushdown systems (that can be used to model the stack operations occurring during the binary code execution), use reachability analysis to extract behaviors in the form of trees, and use subtrees that are common among the trees extracted from a training set of malware files as signatures. To detect malware we propose to use a tree automaton to compactly store malicious behavior trees and check if any of the subtrees extracted from the file under analysis is malicious. Experimental data shows that our approach can be used to learn signatures from a training set of malware files and use them to detect a test set of malware that is 5 times the size of the training set.
Representing, Simulating and Analysing Ho Chi Minh City Tsunami Plan by Means of Process Models
Venue: arXiv cs.CY 2013
Year: 2013

This paper considers the textual plan (guidelines) proposed by People's Committee of Ho Chi Minh City (Vietnam) to manage earthquake and tsunami, and try to represent it in a more formal way, in order to provide means to simulate, analyse and adapt it. We first present a state of the art about coordination models for disaster management with a focus on process oriented approaches. We give an overview of the different dimensions of the textual tsunami plan of Ho Chi Minh City and then the graphical representation of its process with BPMN (Business Process Model and Notation). We finally show how to exploit this process with workflow tools to simulate (YAWL tool) and analyse it (ProM tool).
Teaching Software Process Modeling
Venue: arXiv cs.SE 2013
Year: 2013

Most university curricula consider software processes to be on the fringes of software engineering (SE). Students are told there exists a plethora of software processes ranging from RUP over V-shaped processes to agile methods. Furthermore, the usual students' programming tasks are of a size that either one student or a small group of students can manage the work. Comprehensive processes being essential for large companies in terms of reflecting the organization structure, coordinating teams, or interfaces to business processes such as contracting or sales, are complex and hard to teach in a lecture, and, therefore, often out of scope. We experienced tutorials on using Java or C#, or on developing applications for the iPhone to gather more attention by students, simply speaking, as these are more fun for them. So, why should students spend their time in software processes? From our experiences and the discussions with a variety of industrial partners, we learned that students often face trouble when taking their first "real" jobs, even if the company is organized in a lean or agile shape. Therefore, we propose to include software processes more explicitly into the SE curricula. We designed and implemented a course at Master's level in which students learn why software processes are necessary, and how they can be analyzed, designed, implemented, and continuously improved. In this paper, we present our course's structure, its goals, and corresponding teaching methods. We evaluate the course and further discuss our experiences so that lecturers and researchers can directly use our lessons learned in their own curricula.
Research Directions in Network Service Chaining
Venue: arXiv cs.NI 2013
Year: 2013

Network Service Chaining (NSC) is a service deployment concept that promises increased flexibility and cost efficiency for future carrier networks. NSC has received considerable attention in the standardization and research communities lately. However, NSC is largely undefined in the peer-reviewed literature. In fact, a literature review reveals that the role of NSC enabling technologies is up for discussion, and so are the key research challenges lying ahead. This paper addresses these topics by motivating our research interest towards advanced dynamic NSC and detailing the main aspects to be considered in the context of carrier-grade telecommunication networks. We present design considerations and system requirements alongside use cases that illustrate the advantages of adopting NSC. We detail prominent research challenges during the typical lifecycle of a network service chain in an operational telecommunications network, including service chain description, programming, deployment, and debugging, and summarize our security considerations. We conclude this paper with an outlook on future work in this area.
Decomposition and Gluing for Adiabatic Quantum Optimization
Venue: arXiv cs.ET 2013
Year: 2013

Farhi and others have introduced the notion of solving NP problems using adiabatic quantum com- puters. We discuss an application of this idea to the problem of integer factorization, together with a technique we call gluing which can be used to build adiabatic models of interesting problems. Although adiabatic quantum computers already exist, they are likely to be too small to directly tackle problems of interesting practical sizes for the foreseeable future. Therefore, we discuss techniques for decomposition of large problems, which permits us to fully exploit such hardware as may be available. Numerical re- sults suggest that even simple decomposition techniques may yield acceptable results with subexponential overhead, independent of the performance of the underlying device.