OpenRaiser/Intern-Atlas huggingface dataset:
Provenance and data differencing for workflow reproducibility analysis
Venue: arXiv cs.DB 2014
Year: 2014

One of the foundations of science is that researchers must publish the methodology used to achieve their results so that others can attempt to reproduce them. This has the added benefit of allowing methods to be adopted and adapted for other purposes. In the field of e-Science, services -- often choreographed through workflow, process data to generate results. The reproduction of results is often not straightforward as the computational objects may not be made available or may have been updated since the results were generated. For example, services are often updated to fix bugs or improve algorithms. This paper addresses these problems in three ways. Firstly, it introduces a new framework to clarify the range of meanings of "reproducibility". Secondly, it describes a new algorithm, \PDIFF, that uses a comparison of workflow provenance traces to determine whether an experiment has been reproduced; the main innovation is that if this is not the case then the specific point(s) of divergence are identified through graph analysis, assisting any researcher wishing to understand those differences. One key feature is support for user-defined, semantic data comparison operators. Finally, the paper describes an implementation of \PDIFF that leverages the power of the e-Science Central platform which enacts workflows in the cloud. As well as automatically generating a provenance trace for consumption by \PDIFF, the platform supports the storage and re-use of old versions of workflows, data and services; the paper shows how this can be powerfully exploited in order to achieve reproduction and re-use.
Improvement Tracking Dynamic Programming using Replication Function for Continuous Sign Language Recognition
Venue: arXiv cs.CV 2014
Year: 2014

In this paper we used a Replication Function (R. F.)for improvement tracking with dynamic programming. The R. F. transforms values of gray level [0 255] to [0 1]. The resulting images of R. F. are more striking and visible in skin regions. The R. F. improves Dynamic Programming (D. P.) in overlapping hand and face. Results show that Tracking Error Rate 11% and Average Tracked Distance 7% reduced
ACO Implementation for Sequence Alignment with Genetic Algorithms
Venue: arXiv cs.CE 2014
Year: 2014

In this paper, we implement Ant Colony Optimization (ACO) for sequence alignment. ACO is a meta-heuristic recently developed for nearest neighbor approximations in large, NP-hard search spaces. Here we use a genetic algorithm approach to evolve the best parameters for an ACO designed to align two sequences. We then used the best parameters found to interpolate approximate optimal parameters for a given string length within a range. The basis of our comparison is the alignment given by the Needleman-Wunsch algorithm. We found that ACO can indeed be applied to sequence alignment. While it is computationally expensive compared to other equivalent algorithms, it is a promising algorithm that can be readily applied to a variety of other biological problems.
Fading Two-Way Relay Channels: Physical-Layer Versus Digital Network Coding
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we consider three transmit strategies for the fading three-node, two-way relay network (TWRN) -- physical-layer network coding (PNC), digital network coding (DNC) and codeword superposition (CW-Sup). The aim is to minimize the total average energy needed to deliver a given pair of required average rates. Full channel state information is assumed to be available at all transmitters and receivers. The optimization problems corresponding to the various strategies in fading channels are formulated, solved and compared. For the DNC-based strategies, a simple time sharing of transmission of the network-coded message and the remaining bits of the larger message (DNC-TS) is considered first. We extend this approach to include a superposition strategy (DNC-Sup), in which the network-coded message and the remainder of the longer source message are superimposed before transmission. It is demonstrated theoretically that DNC-Sup outperforms DNC-TS and CW-Sup in terms of total average energy usage. More importantly, it is shown in simulation that DNC-Sup performs better than PNC if the required rate is low and worse otherwise. Finally, an algorithm to select the optimal strategy in terms of energy usage subject to different rate pair requirements is presented.
Decodability Attack against the Fuzzy Commitment Scheme with Public Feature Transforms
Venue: arXiv cs.CR 2014
Year: 2014

The fuzzy commitment scheme is a cryptographic primitive that can be used to store biometric templates being encoded as fixed-length feature vectors protected. If multiple related records generated from the same biometric instance can be intercepted, their correspondence can be determined using the decodability attack. In 2011, Kelkboom et al. proposed to pass the feature vectors through a record-specific but public permutation process in order to prevent this attack. In this paper, it is shown that this countermeasure enables another attack also analyzed by Simoens et al. in 2009 which can even ease an adversary to fully break two related records. The attack may only be feasible if the protected feature vectors have a reasonably small Hamming distance; yet, implementations and security analyses must account for this risk. This paper furthermore discusses that by means of a public transformation, the attack cannot be prevented in a binary fuzzy commitment scheme based on linear codes. Fortunately, such transformations can be generated for the non-binary case. In order to still be able to protect binary feature vectors, one may consider to use the improved fuzzy vault scheme by Dodis et al. which may be secured against linkability attacks using observations made by Merkle and Tams.
On The Impact of Time-Varying Interference-Channel on the Spatial Approach of Spectrum Sharing between S-band Radar and Communication System
Venue: arXiv cs.IT 2014
Year: 2014

Spectrum sharing is a new approach to solve the congestion problem in the RF spectrum. A spatial approach for spectrum sharing between a radar and a communication system was proposed, which mitigates the radar interference to communication by projecting the radar waveform onto the null space of the interference channel, between radar and communication system [1]. In this work, we extend this approach to a maritime MIMO radar which experiences a time varying interference channel due to the oscillatory motion of a ship, because of the breaking of sea/ocean waves. We model this variation by using the matrix perturbation theory and the statistical distribution of the breaking waves. This model is then used to study the impact of perturbed interference channel on the spatial approach of spectrum sharing. We use the maximum likelihood (ML) estimate of a target's angle of arrival to study the radar's performance when its waveform is projected onto the null space of the perturbed interference channel. Through our analytical and simulation results, we study the loss in the radar's performance due to the null space projection (NSP) of its waveform on the perturbed interference channel.
XTQ: A Declarative Functional XML Query Language
Venue: arXiv cs.PL 2014
Year: 2014

Various query languages have been proposed to extract and restructure information in XML documents. These languages, usually claiming to be declarative, mainly consider the conjunctive relationships among data elements. In order to present the operations where the hierarchical and the disjunctive relationships need to be considered, such as restructuring hierarchy and handling heterogeneity, the programs in these languages often exhibit a procedural style and thus the declarativeness in them is not so prominent as in conventional query languages like SQL. In this paper, we propose a declarative pattern-based functional XML query language named XML Tree Query (XTQ). XTQ adopts expressive composite patterns to present data extraction, meanwhile establishing the conjunctive, the disjunctive and the hierarchical relationships among data elements. It uses the matching terms, a composite structure of the variables bound to the matched data elements, to present a global sketch of the extracted data, and develops a deductive restructuring mechanism of matching terms to indicate data transformation, especially for restructuring hierarchy and handling heterogeneity. Based on matching terms, XTQ employs a coherent approach to function declaration and invocation to consistently extract and construct composite data structure, which integrates features of conventional functional languages and pattern-based query languages. Additionally, XTQ also supports data filtering on composite data structure such as hierarchical data, which is seldom deliberately considered in other studies. We demonstrate with various examples that XTQ can declaratively present complex XML queries which are common in practice.
A Geometric Method to Obtain the Generation Probability of a Sentence
Venue: arXiv cs.CL 2014
Year: 2014

"How to generate a sentence" is the most critical and difficult problem in all the natural language processing technologies. In this paper, we present a new approach to explain the generation process of a sentence from the perspective of mathematics. Our method is based on the premise that in our brain a sentence is a part of a word network which is formed by many word nodes. Experiments show that the probability of the entire sentence can be obtained by the probabilities of single words and the probabilities of the co-occurrence of word pairs, which indicate that human use the synthesis method to generate a sentence.
The Price of Updating the Control Plane in Information-Centric Networks
Venue: arXiv cs.NI 2014
Year: 2014

We are studying some fundamental properties of the interface between control and data planes in Information-Centric Networks. We try to evaluate the traffic between these two planes based on allowing a minimum level of acceptable distortion in the network state representation in the control plane. We apply our framework to content distribution, and see how we can compute the overhead of maintaining the location of content in the control plane. This is of importance to evaluate content-oriented network architectures: we identify scenarios where the cost of updating the control plane for content routing overwhelms the benefit of fetching a nearby copy. We also show how to minimize the cost of this overhead when associating costs to peering traffic and to internal traffic for operator-driven CDNs.
An Implementation of Voice over the Cognitive Packet Network
Venue: arXiv cs.NI 2014
Year: 2014

Voice over IP (VOIP) has strict Quality of Service (QoS) constraints and requires real-time packet delivery, which poses a major challenge to IP networks. The Cognitive Packet Network (CPN) has been designed as a QoS-driven protocol that addresses user-oriented QoS demands by adaptively routing packets based on online sensing and measurement. This paper presents our design, implementation and evaluation of a "Voice over CPN" system where an extension of the CPN routing algorithm has been developed to support the needs of voice packet delivery in the presence of other background traffic flows with the same or different QoS requirements.
Modeling CSFs of B2C E-commerce Systems Using the Enterprise Architecture Approach
Venue: arXiv cs.CY 2014
Year: 2014

This study is to investigate the Critical Success Factors (CSFs) of the Business to Customer (B2C) e-commerce system. These factors should be considered comprehensively and expanded to all parties concerned to create and provide the electronic service and ensure that the CSFs are satisfied. In order to give an organized and inclusive view of the CSFs, an enterprise architecture framework will be adopted to systemize this investigation.
IRCI Free Colocated MIMO Radar Based on Sufficient Cyclic Prefix OFDM Waveforms
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we propose a cyclic prefix (CP) based MIMO-OFDM range reconstruction method and its corresponding MIMO-OFDM waveform design for co-located MIMO radar systems. Our proposed MIMO-OFDM waveform design achieves the maximum signal-to-noise ratio (SNR) gain after the range reconstruction and its peak-to-average power ratio (PAPR) in the discrete time domain is also optimal, i.e., 0dB, when Zadoff-Chu sequences are used in the discrete frequency domain as the weighting coefficients for the subcarriers. We also investigate the performance when there are transmit and receive digital beamforming (DBF) pointing errors. It is shown that our proposed CP based MIMO-OFDM range reconstruction is inter-range-cell interference (IRCI) free no matter whether there are transmit and receive DBF pointing errors or not. Simulation results are presented to verify the theory and compare it with the conventional OFDM and LFM co-located MIMO radars.
Systematic N-tuple Networks for Position Evaluation: Exceeding 90% in the Othello League
Venue: arXiv cs.NE 2014
Year: 2014

N-tuple networks have been successfully used as position evaluation functions for board games such as Othello or Connect Four. The effectiveness of such networks depends on their architecture, which is determined by the placement of constituent n-tuples, sequences of board locations, providing input to the network. The most popular method of placing n-tuples consists in randomly generating a small number of long, snake-shaped board location sequences. In comparison, we show that learning n-tuple networks is significantly more effective if they involve a large number of systematically placed, short, straight n-tuples. Moreover, we demonstrate that in order to obtain the best performance and the steepest learning curve for Othello it is enough to use n-tuples of size just 2, yielding a network consisting of only 288 weights. The best such network evolved in this study has been evaluated in the online Othello League, obtaining the performance of nearly 96% --- more than any other player to date.
Inherent limits on optimization and discovery in physical systems
Venue: arXiv cs.SI 2014
Year: 2014

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by motifs, and the ability to reconstruct the full system given approximate representations. The approximate representation of the system most suited for optimization may be different from that which most accurately describes the full system.
Optimal Auctions for Correlated Buyers with Sampling
Venue: arXiv cs.GT 2014
Year: 2014

Crémer and McLean [1985] showed that, when buyers' valuations are drawn from a correlated distribution, an auction with full knowledge on the distribution can extract the full social surplus. We study whether this phenomenon persists when the auctioneer has only incomplete knowledge of the distribution, represented by a finite family of candidate distributions, and has sample access to the real distribution. We show that the naive approach which uses samples to distinguish candidate distributions may fail, whereas an extended version of the Crémer-McLean auction simultaneously extracts full social surplus under each candidate distribution. With an algebraic argument, we give a tight bound on the number of samples needed by this auction, which is the difference between the number of candidate distributions and the dimension of the linear space they span.
Energy Efficient and Reliable Wireless Sensor Networks - An Extension to IEEE 802.15.4e
Venue: arXiv cs.NI 2014
Year: 2014

Collecting sensor data in industrial environments from up to some tenth of battery powered sensor nodes with sampling rates up to 100Hz requires energy aware protocols, which avoid collisions and long listening phases. The IEEE 802.15.4 standard focuses on energy aware wireless sensor networks (WSNs) and the Task Group 4e has published an amendment to fulfill up to 100 sensor value transmissions per second per sensor node (Low Latency Deterministic Network (LLDN) mode) to satisfy demands of factory automation. To improve the reliability of the data collection in the star topology of the LLDN mode, we propose a relay strategy, which can be performed within the LLDN schedule. Furthermore we propose an extension of the star topology to collect data from two-hop sensor nodes. The proposed Retransmission Mode enables power savings in the sensor node of more than 33%, while reducing the packet loss by up to 50%. To reach this performance, an optimum spatial distribution is necessary, which is discussed in detail.
An Invariant Linear Quadratic Gaussian controller for a simplified car
Venue: arXiv cs.RO 2014
Year: 2014

In this paper, we consider the problem of tracking a reference trajectory for a simplified car model based on unicycle kinematics, whose position only is measured, and where the control input and the measurements are corrupted by independent Gaussian noises. To tackle this problem we devise a novel observer-controller: the invariant Linear Quadratic Gaussian controller (ILQG). It is based on the Linear Quadratic Gaussian controller, but the equations are slightly modified to account for, and to exploit, the symmetries of the problem. The gain tuning exhibits a reduced dependency on the estimated trajectory, and is thus less sensitive to misestimates. Beyond the fact the invariant approach is sensible (there is no reason why the controller performance should depend on whether the reference trajectory is heading west or south), we show through simulations that the ILQG outperforms the conventional LQG controller in case of large noises or large initial uncertainties. We show that those robustness properties may also prove useful for motion planning applications.
Automated Generation of Geometric Theorems from Images of Diagrams
Venue: arXiv cs.AI 2014
Year: 2014

We propose an approach to generate geometric theorems from electronic images of diagrams automatically. The approach makes use of techniques of Hough transform to recognize geometric objects and their labels and of numeric verification to mine basic geometric relations. Candidate propositions are generated from the retrieved information by using six strategies and geometric theorems are obtained from the candidates via algebraic computation. Experiments with a preliminary implementation illustrate the effectiveness and efficiency of the proposed approach for generating nontrivial theorems from images of diagrams. This work demonstrates the feasibility of automated discovery of profound geometric knowledge from simple image data and has potential applications in geometric knowledge management and education.
Modified Binary Search Algorithm
Venue: arXiv cs.DS 2014
Year: 2014

This paper proposes a modification to the traditional binary search algorithm in which it checks the presence of the input element with the middle element of the given set of elements at each iteration. Modified binary search algorithm optimizes the worst case of the binary search algorithm by comparing the input element with the first & last element of the data set along with the middle element and also checks the input number belongs to the range of numbers present in the given data set at each iteration there by reducing the time taken by the worst cases of binary search algorithm.
Multiscale probability transformation of basic probability assignment
Venue: arXiv cs.AI 2014
Year: 2014

Decision making is still an open issue in the application of Dempster-Shafer evidence theory. A lot of works have been presented for it. In the transferable belief model (TBM), pignistic probabilities based on the basic probability as- signments are used for decision making. In this paper, multiscale probability transformation of basic probability assignment based on the belief function and the plausibility function is proposed, which is a generalization of the pignistic probability transformation. In the multiscale probability function, a factor q based on the Tsallis entropy is used to make the multiscale prob- abilities diversified. An example is shown that the multiscale probability transformation is more reasonable in the decision making.
Computational role of eccentricity dependent cortical magnification
Venue: arXiv cs.LG 2014
Year: 2014

We develop a sampling extension of M-theory focused on invariance to scale and translation. Quite surprisingly, the theory predicts an architecture of early vision with increasing receptive field sizes and a high resolution fovea -- in agreement with data about the cortical magnification factor, V1 and the retina. From the slope of the inverse of the magnification factor, M-theory predicts a cortical "fovea" in V1 in the order of $40$ by $40$ basic units at each receptive field size -- corresponding to a foveola of size around $26$ minutes of arc at the highest resolution, $\approx 6$ degrees at the lowest resolution. It also predicts uniform scale invariance over a fixed range of scales independently of eccentricity, while translation invariance should depend linearly on spatial frequency. Bouma's law of crowding follows in the theory as an effect of cortical area-by-cortical area pooling; the Bouma constant is the value expected if the signature responsible for recognition in the crowding experiments originates in V2. From a broader perspective, the emerging picture suggests that visual recognition under natural conditions takes place by composing information from a set of fixations, with each fixation providing recognition from a space-scale image fragment -- that is an image patch represented at a set of increasing sizes and decreasing resolutions.
Advanced vehicle safety and content distribution system
Venue: arXiv cs.NI 2014
Year: 2014

Advanced vehicle content distribution system (ACDS)is complemented by improved network connectivity with Mobile Network 3G, 4G network. Advanced content distribution system uses Access Points deployed along roadside. APs co-ordinate and collaborate to distribute content to vehicles in mobility. The infrastructure of deployed APs solves real time issues like predicting errors in movement, limited information shared to vehicles on movement due to limited resources. The advances vehicle content distribution system structures APs in to form a map which is considering the vehicle contact pattern which is analyzed by APs. The system is more effective by optimizing the network consumption by sharing prefectched data between APs. The process depends on APs storage, bandwidth and load on the origin APs which is connected to internet. With the features Advanced System to distribute the content the system takes care of improving road safety, delivery accuracy and important content distribution.
Text Mining System for Non-Expert Miners
Venue: arXiv cs.IR 2014
Year: 2014

Service oriented architecture integrated with text mining allows services to extract information in a well defined manner. In this paper, it is proposed to design a knowledge extracting system for the Ocean Information Data System. Deployed ARGO floating sensors of INCOIS (Indian National Council for Ocean Information Systems) organization reflects the characteristics of ocean. This is forwarded to the OIDS (Ocean Information Data System). For the data received from OIDS, pre-processing techniques are applied. Pre-processing involves the header retrieval and data separation. Header information is used to identify the region of sensor, whereas data is used in the analysis process of Ocean Information System. Analyzed data is segmented based on the region, by the header value. Mining technique and composition principle is applied on the segments for further analysis. Index Terms-- Service oriented architecture; Text Mining; ARGO floating sensor; INCOIS; OIDS; Pre-processing.