OpenRaiser/Intern-Atlas huggingface dataset:
Information-Theoretic Security for the Masses
Venue: arXiv cs.CR 2013
Year: 2013

We combine interactive zero-knowledge protocols and weak physical layer randomness properties to construct a protocol which allows bootstrapping an IT-secure and PF-secure channel from a memorizable shared secret. The protocol also tolerates failures of its components, still preserving most of its security properties, which makes it accessible to regular users.
Query Centric CPS (QCPS) Approach for Multiple Heterogeneous Systems
Venue: arXiv cs.DC 2013
Year: 2013

In modern scenario we need to have mechanisms which can provide better interaction with physical world by an efficient and more effective communication and computation approach for multiple heterogeneous sensor networks. Previous work provides efficient communication approach between sensor nodes and a query centric approach for multiple collaborative heterogeneous sensor networks. Even there is energy issues involved in wireless sensor network operation. In this paper we have proposed Query centric Cyber Physical System (QCPS)model to implement query centric user request using Cyber Physical System (CPS). CPS takes both communication and computation in parallel to provide better interaction with physical world. This feature of CPS reduces system cost and makes it more energy efficient. This paper provides an efficient query processing approach for multiple heterogeneous sensor networks using cyber physical system.This approach results in reduction of communication and computation cost as sensor network communicates using centroid of respective grids which reduces cost of communication while involvement of CPS reduces the computation cost.
A Fuzzy Topsis Multiple-Attribute Decision Making for Scholarship Selection
Venue: arXiv cs.AI 2013
Year: 2013

As the education fees are becoming more expensive, more students apply for scholarships. Consequently, hundreds and even thousands of applications need to be handled by the sponsor. To solve the problems, some alternatives based on several attributes (criteria) need to be selected. In order to make a decision on such fuzzy problems, Fuzzy Multiple Attribute Decision Making (FMDAM) can be applied. In this study, Unified Modeling Language (UML) in FMADM with TOPSIS and Weighted Product (WP) methods is applied to select the candidates for academic and non-academic scholarships at Universitas Islam Negeri Sunan Kalijaga. Data used were a crisp and fuzzy data. The results show that TOPSIS and Weighted Product FMADM methods can be used to select the most suitable candidates to receive the scholarships since the preference values applied in this method can show applicants with the highest eligibility
Critical analysis of the Bennett-Riedel attack on secure cryptographic key distributions via the Kirchhoff-law-Johnson-noise scheme
Venue: arXiv cs.CR 2013
Year: 2013

Recently, Bennett and Riedel (BR) (http://arxiv.org/abs/1303.7435v1) argued that thermodynamics is not essential in the Kirchhoff-law-Johnson-noise (KLJN) classical physical cryptographic exchange method in an effort to disprove the security of the KLJN scheme. They attempted to demonstrate this by introducing a dissipation-free deterministic key exchange method with two batteries and two switches. In the present paper, we first show that BR's scheme is unphysical and that some elements of its assumptions violate basic protocols of secure communication. All our analyses are based on a technically-unlimited Eve with infinitely accurate and fast measurements limited only by the laws of physics and statistics. For non-ideal situations and at active (invasive) attacks, the uncertainly principle between measurement duration and statistical errors makes it impossible for Eve to extract the key regardless of the accuracy or speed of her measurements. To show that thermodynamics and noise are essential for the security, we crack the BR system with 100% success via passive attacks, in ten different ways, and demonstrate that the same cracking methods do not function for the KLJN scheme that employs Johnson noise to provide security underpinned by the Second Law of Thermodynamics. We also present a critical analysis of some other claims by BR; for example, we prove that their equations for describing zero security do not apply to the KLJN scheme. Finally we give mathematical security proofs for each BR-attack against the KLJN scheme and conclude that the information theoretic (unconditional) security of the KLJN method has not been successfully challenged.
A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs
Venue: arXiv cs.CC 2013
Year: 2013

We consider the Densest-Subgraph problem, where a graph and an integer k is given and we search for a subgraph on exactly k vertices that induces the maximum number of edges. We prove that this problem is NP-hard even when the input graph has maximum degree three.
A Novel Active Contour Model for Texture Segmentation
Venue: arXiv cs.CV 2013
Year: 2013

Texture is intuitively defined as a repeated arrangement of a basic pattern or object in an image. There is no mathematical definition of a texture though. The human visual system is able to identify and segment different textures in a given image. Automating this task for a computer is far from trivial. There are three major components of any texture segmentation algorithm: (a) The features used to represent a texture, (b) the metric induced on this representation space and (c) the clustering algorithm that runs over these features in order to segment a given image into different textures. In this paper, we propose an active contour based novel unsupervised algorithm for texture segmentation. We use intensity covariance matrices of regions as the defining feature of textures and find regions that have the most inter-region dissimilar covariance matrices using active contours. Since covariance matrices are symmetric positive definite, we use geodesic distance defined on the manifold of symmetric positive definite matrices PD(n) as a measure of dissimlarity between such matrices. We demonstrate performance of our algorithm on both artificial and real texture images.
Min-Cost Flow Duality in Planar Networks
Venue: arXiv cs.DM 2013
Year: 2013

In this paper we study the min-cost flow problem in planar networks. We start with the min-cost flow problem and apply two transformations, one is based on geometric duality of planar graphs and the other on linear programming duality. The result is a min-cost flow problem in a related planar network whose balance constraints are defined by the costs of the original problem and whose costs are defined by the capacities of the original problem. We use this transformation to show an O(n log^2 n) time algorithm for the min-cost flow problem in an n-vertex outerplanar network.
A novel ER model to relational model transformation algorithm for semantically clear high quality database design
Venue: arXiv cs.DB 2013
Year: 2013

Conceptual modelling using the entity relationship (ER) model has been widely used for database design for a long period of time. However, studies indicate that creating a satisfactory relational model representation from an ER model is uncertain due to the insufficiencies both in the transformation methods used and in the relational model itself. In an effort to solve the issue the original ER notation has been modified, and accordingly, a new transformation algorithm has been developed. This paper presents the proposed transformation algorithm. Using a real world example it shows how the algorithm can be applied in practice. The paper also discusses how to validate the resulted database and reclaim the information that it represents.
Distributed Greedy Pursuit Algorithms
Venue: arXiv cs.IT 2013
Year: 2013

For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes. Based on this signal model along with a brief survey of existing greedy algorithms, we develop distributed greedy algorithms with low communication overhead. Incorporating appropriate modifications, we design two new distributed algorithms where the local algorithms are based on appropriately modified existing orthogonal matching pursuit and subspace pursuit. Further, by combining advantages of these two local algorithms, we design a new greedy algorithm that is well suited for a distributed scenario. By extensive simulations we demonstrate that the new algorithms in a sparsely connected network provide good performance, close to the performance of a centralized greedy solution.
Axiomatic properties of inconsistency indices for pairwise comparisons
Venue: arXiv cs.AI 2013
Year: 2013

Pairwise comparisons are a well-known method for the representation of the subjective preferences of a decision maker. Evaluating their inconsistency has been a widely studied and discussed topic and several indices have been proposed in the literature to perform this task. Since an acceptable level of consistency is closely related with the reliability of preferences, a suitable choice of an inconsistency index is a crucial phase in decision making processes. The use of different methods for measuring consistency must be carefully evaluated, as it can affect the decision outcome in practical applications. In this paper, we present five axioms aimed at characterizing inconsistency indices. In addition, we prove that some of the indices proposed in the literature satisfy these axioms, while others do not, and therefore, in our view, they may fail to correctly evaluate inconsistency.
Optimal Tx-BF for MIMO SC-FDE Systems
Venue: arXiv cs.IT 2013
Year: 2013

Transmit beamforming (Tx-BF) for multiple-input multiple-output (MIMO) channels is an effective means to improve system performance. In frequency-selective channels, Tx-BF can be implemented in combination with single-carrier frequency-domain equalization (SC-FDE) to combat inter-symbol interference. In this paper, we consider the optimal design of the Tx-BF matrix for a MIMO SC-FDE system employing a linear minimum mean square error (MSE) receiver. We formulate the Tx-BF optimization problem as the minimization of a general function of the stream MSEs, subject to a transmit power constraint. The optimal structure of the Tx-BF matrix is obtained in closed form and an efficient algorithm is proposed for computing the optimal power allocation. Our simulation results validate the excellent performance of the proposed scheme in terms of uncoded bit-error rate and achievable bit rate.
Catch a Breath: Non-invasive Respiration Rate Monitoring via Wireless Communication
Venue: arXiv cs.NI 2013
Year: 2013

Radio signals are sensitive to changes in the environment, which for example is reflected on the received signal strength (RSS) measurements of low-cost wireless devices. This information has been used effectively in the past years e.g. in device-free localization and tracking. Recent literature has also shown that the fading information of the wireless channel can be exploited to estimate the breathing rate of a person in a non-invasive manner; a research topic we address in this paper. To the best of our knowledge, we demonstrate for the first time that the respiration rate of a person can be accurately estimated using only a single IEEE 802.15.4 compliant TX-RX pair. We exploit channel diversity, low-jitter periodic communication, and oversampling to enhance the breathing estimates, and make use of a decimation filter to decrease the computational requirements of breathing estimation. In addition, we develop a hidden Markov model (HMM) to identify the time instances when breathing estimation is not possible, i.e., during times when other motion than breathing occurs. We experimentally validate the accuracy of the system and the results suggest that the respiration rate can be estimated with a mean error of 0.03 breaths per minute, the lowest breathing rate error reported to date using IEEE 802.15.4 compliant transceivers. We also demonstrate that the breathing of two people can be monitored simultaneously, a result not reported in earlier literature.
Coded Slotted ALOHA with Varying Packet Loss Rate across Users
Venue: arXiv cs.IT 2013
Year: 2013

The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by utilizing theory and tools of erasure-correcting codes. In this paper we present a generalization of the and-or tree evaluation, adapted for the asymptotic analysis of the slotted ALOHA-based random-access protocols, for the case when the contending users experience different channel conditions, resulting in packet loss probability that varies across users. We apply the analysis to the example of frameless ALOHA, where users contend on a slot basis. We present results regarding the optimal access probabilities and contention period lengths, such that the throughput and probability of user resolution are maximized.
On a compact encoding of the swap automaton
Venue: arXiv cs.FL 2013
Year: 2013

Given a string $P$ of length $m$ over an alphabet $Σ$ of size $σ$, a swapped version of $P$ is a string derived from $P$ by a series of local swaps, i.e., swaps of adjacent symbols, such that each symbol can participate in at most one swap. We present a theoretical analysis of the nondeterministic finite automaton for the language $\bigcup_{P'\inΠ_P}Σ^*P'$ (swap automaton for short), where $Π_P$ is the set of swapped versions of $P$. Our study is based on the bit-parallel simulation of the same automaton due to Fredriksson, and reveals an interesting combinatorial property that links the automaton to the one for the language $Σ^*P$. By exploiting this property and the method presented by Cantone et al. (2010), we obtain a bit-parallel encoding of the swap automaton which takes $O(σ^2\ceil{k/w})$ space and allows one to simulate the automaton on a string of length $n$ in time $O(n\ceil{k/w})$, where $\ceil{m/σ}\le k\le m$.
One generator $(1+u)$-quasi twisted codes over $F_2+uF_2$
Venue: arXiv cs.IT 2013
Year: 2013

This paper gives the minimum generating sets of three types of one generator $(1+u)$-quasi twisted (QT) codes over $F_2+uF_2$, $u^2=0$. Moreover, it discusses the generating sets and the lower bounds on the minimum Lee distance of a special class of $A_2$ type one generator $(1+u)$-QT codes. Some good (optimal or suboptimal) linear codes over $F_2$ are obtained by these types of one generator $(1+u)$-QT codes.
NoSQL Database: New Era of Databases for Big data Analytics - Classification, Characteristics and Comparison
Venue: arXiv cs.DB 2013
Year: 2013

Digital world is growing very fast and become more complex in the volume (terabyte to petabyte), variety (structured and un-structured and hybrid), velocity (high speed in growth) in nature. This refers to as Big Data that is a global phenomenon. This is typically considered to be a data collection that has grown so large it can not be effectively managed or exploited using conventional data management tools: e.g., classic relational database management systems (RDBMS) or conventional search engines. To handle this problem, traditional RDBMS are complemented by specifically designed a rich set of alternative DBMS; such as - NoSQL, NewSQL and Search-based systems. This paper motivation is to provide - classification, characteristics and evaluation of NoSQL databases in Big Data Analytics. This report is intended to help users, especially to the organizations to obtain an independent understanding of the strengths and weaknesses of various NoSQL database approaches to supporting applications that process huge volumes of data.
Simulating Ability: Representing Skills in Games
Venue: arXiv cs.GT 2013
Year: 2013

Throughout the history of games, representing the abilities of the various agents acting on behalf of the players has been a central concern. With increasingly sophisticated games emerging, these simulations have become more realistic, but the underlying mechanisms are still, to a large extent, of an ad hoc nature. This paper proposes using a logistic model from psychometrics as a unified mechanism for task resolution in simulation-oriented games.
Connector algebras for C/E and P/T nets' interactions
Venue: arXiv cs.FL 2013
Year: 2013

A quite flourishing research thread in the recent literature on component-based systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that consists of five kinds of basic connectors, namely symmetry, synchronization, mutual exclusion, hiding and inaction, plus their duals, and it was shown how they can be freely composed in series and in parallel to model sophisticated 'glues'. In this paper we explore the expressiveness of stateful connectors obtained by adding one-place buffers or unbounded buffers to the stateless connectors. The main results are: i) we show how different classes of connectors exactly correspond to suitable classes of Petri nets equipped with compositional interfaces, called nets with boundaries; ii) we show that the difference between strong and weak semantics in stateful connectors is reflected in the semantics of nets with boundaries by moving from the classic step semantics (strong case) to a novel banking semantics (weak case), where a step can be executed by taking some 'debit' tokens to be given back during the same step; iii) we show that the corresponding bisimilarities are congruences (w.r.t. composition of connectors in series and in parallel); iv) we show that suitable monoidality laws, like those arising when representing stateful connectors in the tile model, can nicely capture concurrency (in the sense of step semantics) aspects; and v) as a side result, we provide a basic algebra, with a finite set of symbols, out of which we can compose all P/T nets with boundaries, fulfilling a long standing quest.
Multilevel Threshold Based Gray Scale Image Segmentation using Cuckoo Search
Venue: arXiv cs.CV 2013
Year: 2013

Image Segmentation is a technique of partitioning the original image into some distinct classes. Many possible solutions may be available for segmenting an image into a certain number of classes, each one having different quality of segmentation. In our proposed method, multilevel thresholding technique has been used for image segmentation. A new approach of Cuckoo Search (CS) is used for selection of optimal threshold value. In other words, the algorithm is used to achieve the best solution from the initial random threshold values or solutions and to evaluate the quality of a solution correlation function is used. Finally, MSE and PSNR are measured to understand the segmentation quality.
Aggregation and Ordering in Factorised Databases
Venue: arXiv cs.DB 2013
Year: 2013

A common approach to data analysis involves understanding and manipulating succinct representations of data. In earlier work, we put forward a succinct representation system for relational data called factorised databases and reported on the main-memory query engine FDB for select-project-join queries on such databases. In this paper, we extend FDB to support a larger class of practical queries with aggregates and ordering. This requires novel optimisation and evaluation techniques. We show how factorisation coupled with partial aggregation can effectively reduce the number of operations needed for query evaluation. We also show how factorisations of query results can support enumeration of tuples in desired orders as efficiently as listing them from the unfactorised, sorted results. We experimentally observe that FDB can outperform off-the-shelf relational engines by orders of magnitude.
A Random Matrix Approach to Differential Privacy and Structure Preserved Social Network Graph Publishing
Venue: arXiv cs.CR 2013
Year: 2013

Online social networks are being increasingly used for analyzing various societal phenomena such as epidemiology, information dissemination, marketing and sentiment flow. Popular analysis techniques such as clustering and influential node analysis, require the computation of eigenvectors of the real graph's adjacency matrix. Recent de-anonymization attacks on Netflix and AOL datasets show that an open access to such graphs pose privacy threats. Among the various privacy preserving models, Differential privacy provides the strongest privacy guarantees. In this paper we propose a privacy preserving mechanism for publishing social network graph data, which satisfies differential privacy guarantees by utilizing a combination of theory of random matrix and that of differential privacy. The key idea is to project each row of an adjacency matrix to a low dimensional space using the random projection approach and then perturb the projected matrix with random noise. We show that as compared to existing approaches for differential private approximation of eigenvectors, our approach is computationally efficient, preserves the utility and satisfies differential privacy. We evaluate our approach on social network graphs of Facebook, Live Journal and Pokec. The results show that even for high values of noise variance sigma=1 the clustering quality given by normalized mutual information gain is as low as 0.74. For influential node discovery, the propose approach is able to correctly recover 80 of the most influential nodes. We also compare our results with an approach presented in [43], which directly perturbs the eigenvector of the original data by a Laplacian noise. The results show that this approach requires a large random perturbation in order to preserve the differential privacy, which leads to a poor estimation of eigenvectors for large social networks.
Scalability using effects
Venue: arXiv cs.LO 2013
Year: 2013

This note is about using computational effects for scalability. With this method, the specification gets more and more complex while its semantics gets more and more correct. We show, from two fundamental examples, that it is possible to design a deduction system for a specification involving an effect without expliciting this effect.
Efficient Sequential and Parallel Algorithms for Planted Motif Search
Venue: arXiv cs.DS 2013
Year: 2013

Motif searching is an important step in the detection of rare events occurring in a set of DNA or protein sequences. One formulation of the problem is known as (l,d)-motif search or Planted Motif Search (PMS). In PMS we are given two integers l and d and n biological sequences. We want to find all sequences of length l that appear in each of the input sequences with at most d mismatches. The PMS problem is NP-complete. PMS algorithms are typically evaluated on certain instances considered challenging. This paper presents an exact parallel PMS algorithm called PMS8. PMS8 is the first algorithm to solve the challenging (l,d) instances (25,10) and (26,11). PMS8 is also efficient on instances with larger l and d such as (50,21). This paper also introduces necessary and sufficient conditions for 3 l-mers to have a common d-neighbor.