OpenRaiser/Intern-Atlas huggingface dataset:
The Declaratron, semantic specification for scientific computation using MathML
Venue: arXiv cs.MS 2013
Year: 2013

We introduce the Declaratron, a system which takes a declarative approach to specifying mathematically based scientific computation. This uses displayable mathematical notation (Content MathML) and is both executable and semantically well defined. We combine domain specific representations of physical science (e.g. CML, Chemical Markup Language), MathML formulae and computational specifications (DeXML) to create executable documents which include scientific data and mathematical formulae. These documents preserve the provenance of the data used, and build tight semantic links between components of mathematical formulae and domain objects---in effect grounding the mathematical semantics in the scientific domain. The Declaratron takes these specifications and i) carries out entity resolution and decoration to prepare for computation ii) uses a MathML execution engine to run calculations over the revised tree iii) outputs domain objects and the complete document to give both results and an encapsulated history of the computation. A short description of a case study is given to illustrate how the system can be used. Many scientific problems require frequent change of the mathematical functional form and the Declaratron provides this without requiring changes to code. Additionally, it supports reproducible science, machine indexing and semantic search of computations, makes implicit assumptions visible, and separates domain knowledge from computational techniques. We believe that the Declaratron could replace much conventional procedural code in science.
Fundamental Limits of Energy-Efficient Resource Sharing, Power Control and Discontinuous Transmission
Venue: arXiv cs.IT 2013
Year: 2013

The achievable gains via power-optimal scheduling are investigated. Under the QoS constraint of a guaranteed link rate, the overall power consumed by a cellular BS is minimized. Available alternatives for the minimization of transmit power consumption are presented. The transmit power is derived for the two-user downlink situation. The analysis is extended to incorporate a BS power model (which maps transmit power to supply power consumption) and the use of DTX in a BS. Overall potential gains are evaluated by comparison of a conventional SOTA BS with one that employs DTX exclusively, a power control scheme and an optimal combined DTX and power control scheme. Fundamental limits of the achievable savings are found to be at 5.5 dB under low load and 2 dB under high load when comparing the SOTA consumption with optimal allocation under the chosen power model.
Minimal average consumption downlink base station power control strategy
Venue: arXiv cs.IT 2013
Year: 2013

We consider single cell multi-user OFDMA downlink resource allocation on a flat-fading channel such that average supply power is minimized while fulfilling a set of target rates. Available degrees of freedom are transmission power and duration. This paper extends our previous work on power optimal resource allocation in the mobile downlink by detailing the optimal power control strategy investigation and extracting fundamental characteristics of power optimal operation in cellular downlink. We find that only a system wide allocation of transmit powers is optimal rather than on link level. The allocation strategy that minimizes overall power consumption requires the transmission power on all links to be increased if only one link degrades. Furthermore, we show that for mobile stations with equal channels but different rate requirements, it is power optimal to assign equal transmit powers with proportional transmit durations. To relate the effectiveness of power control to live operation, we take the power model into consideration which maps transmit power to supply power. We show that due to the affine mapping, the solution is independent of the power model. However, the effectiveness of power control measures is completely dependent on the underlying hardware and the load dependence factor of a base station (instead of absolute consumption values). Finally, we conclude that power control measures in base stations are most relevant in macro stations which have load dependence factor of more than 50%.
Cooperative Short Range Routing for Energy Savings in Multi-Interface Wireless Networks
Venue: arXiv cs.NI 2013
Year: 2013

Energy efficiency in wireless networks has become an important field of research due to ever increasing energy expenditure in battery supplied mobile terminals. In this paper we present an energy efficient routing scheme for multi-standard infrastructure wireless networks based on multi-hop cooperative relaying. The aim of the proposed technique is to exploit short-range cooperation to take benefit from mobile terminals having superior links thus enable energy efficiency. Performance results show that higher data-rate yielded by cooperation can compensate the expense of higher energy due to multiple interfaces active on the same mobile terminal, making possible to observe energy efficiency gain of the system. A maximum achievable energy efficiency gain of up to 42 % was observed in our simulations when using the cooperative short range routing technique.
Airborne Base Stations for Emergency and Temporary Events
Venue: arXiv cs.NI 2013
Year: 2013

This paper introduces a rapidly deployable wireless network based on Low Altitude Platforms and portable land units to support disaster-relief activities, and to extend capacity during temporary mass events. The system integrates an amalgam of radio technologies such as LTE, WLAN and TETRA to provide heterogeneous communications in the deployment location. Cognitive radio is used for autonomous network configuration. Sensor networks monitor the environment in real-time during relief activities and provide distributed spectrum sensing capacities. Finally, remote communications are supported via S-band satellite links.
Replicating and Applying a Neuro-Cognitive Experimental Technique in HCI Research
Venue: arXiv cs.HC 2013
Year: 2013

In cognitive neuroscience the sense of agency is defined as the as the experience of controlling ones own actions and, through this control, affecting the external world. At CHI 2012 I presented a paper entitled I did that! Measuring Users Experience of Agency in their own Actions [1]. This extended abstract draws heavily on that paper, which described an implicit measure called intentional binding. This measure, developed by researchers in cognitive neuroscience, has been shown to provide a robust implicit measure for the sense of agency. My interest in intentional binding stemmed from prior HCI literature, (e.g. the work of Shneiderman) which emphasises the importance of the sense of control in human-computer interactions. The key question behind the CHI 2012 paper was: can we apply intention binding to provide an implicit measure for the experience of control in human-computer interactions? In investigating this question, replication was a key element of the experimental process.
Randomness Conservation over Algorithms
Venue: arXiv cs.CC 2013
Year: 2013

Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation inequalities. We address this issue by proving tight bounds of randomness and information conservation with respect to recursively enumerable transformations, i.e. processing by algorithms. We also show conservation of randomness of finite strings with respect to enumerable distributions, i.e. semicomputable semi-measures.
Scalable Eventually Consistent Counters over Unreliable Networks
Venue: arXiv cs.DC 2013
Year: 2013

Counters are an important abstraction in distributed computing, and play a central role in large scale geo-replicated systems, counting events such as web page impressions or social network "likes". Classic distributed counters, strongly consistent, cannot be made both available and partition-tolerant, due to the CAP Theorem, being unsuitable to large scale scenarios. This paper defines Eventually Consistent Distributed Counters (ECDC) and presents an implementation of the concept, Handoff Counters, that is scalable and works over unreliable networks. By giving up the sequencer aspect of classic distributed counters, ECDC implementations can be made AP in the CAP design space, while retaining the essence of counting. Handoff Counters are the first CRDT (Conflict-free Replicated Data Type) based mechanism that overcomes the identity explosion problem in naive CRDTs, such as G-Counters (where state size is linear in the number of independent actors that ever incremented the counter), by managing identities towards avoiding global propagation and garbage collecting temporary entries. The approach used in Handoff Counters is not restricted to counters, being more generally applicable to other data types with associative and commutative operations.
Approximate Cech Complexes in Low and High Dimensions
Venue: arXiv cs.CG 2013
Year: 2013

Čech complexes reveal valuable topological information about point sets at a certain scale in arbitrary dimensions, but the sheer size of these complexes limits their practical impact. While recent work introduced approximation techniques for filtrations of (Vietoris-)Rips complexes, a coarser version of Čech complexes, we propose the approximation of Čech filtrations directly. For fixed dimensional point set $S$, we present an approximation of the Čech filtration of $S$ by a sequence of complexes of size linear in the number of points. We generalize well-separated pair decompositions (WSPD) to well-separated simplicial decomposition (WSSD) in which every simplex defined on $S$ is covered by some element of WSSD. We give an efficient algorithm to compute a linear-sized WSSD in fixed dimensional spaces. Using a WSSD, we then present a linear-sized approximation of the filtration of Čech complex of $S$. We also present a generalization of the known fact that the Rips complex approximates the Čech complex by a factor of $\sqrt{2}$. We define a class of complexes that interpolate between Čech and Rips complexes and that, given any parameter $\eps > 0$, approximate the Čech complex by a factor $(1+\eps)$. Our complex can be represented by roughly $O(n^{\lceil 1/2\eps\rceil})$ simplices without any hidden dependence on the ambient dimension of the point set. Our results are based on an interesting link between Čech complex and coresets for minimum enclosing ball of high-dimensional point sets. As a consequence of our analysis, we show improved bounds on coresets that approximate the radius of the minimum enclosing ball.
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels with Noisy Channel Output Feedback
Venue: arXiv cs.IT 2013
Year: 2013

Linear coding schemes have been the main choice of coding for the additive white Gaussian noise broadcast channel (AWGN-BC) with noiseless feedback in the literature. The achievable rate regions of these schemes go well beyond the capacity region of the AWGN-BC without feedback. In this paper, a concatenating coding design for the $K$-user AWGN-BC with noisy feedback is proposed that relies on linear feedback schemes to achieve rate tuples outside the no-feedback capacity region. Specifically, a linear feedback code for the AWGN-BC with noisy feedback is used as an inner code that creates an effective single-user channel from the transmitter to each of the receivers, and then open-loop coding is used for coding over these single-user channels. An achievable rate region of linear feedback schemes for noiseless feedback is shown to be achievable by the concatenated coding scheme for sufficiently small feedback noise level. Then, a linear feedback coding scheme for the $K$-user symmetric AWGN-BC with noisy feedback is presented and optimized for use in the concatenated coding scheme. Lastly, we apply the concatenated coding design to the two-user AWGN-BC with a single noisy feedback link from one of the receivers.
Improving the quality of Gujarati-Hindi Machine Translation through part-of-speech tagging and stemmer-assisted transliteration
Venue: arXiv cs.CL 2013
Year: 2013

Machine Translation for Indian languages is an emerging research area. Transliteration is one such module that we design while designing a translation system. Transliteration means mapping of source language text into the target language. Simple mapping decreases the efficiency of overall translation system. We propose the use of stemming and part-of-speech tagging for transliteration. The effectiveness of translation can be improved if we use part-of-speech tagging and stemming assisted transliteration.We have shown that much of the content in Gujarati gets transliterated while being processed for translation to Hindi language.
The Flow Fingerprinting Game
Venue: arXiv cs.CR 2013
Year: 2013

Linking two network flows that have the same source is essential in intrusion detection or in tracing anonymous connections. To improve the performance of this process, the flow can be modified (fingerprinted) to make it more distinguishable. However, an adversary located in the middle can modify the flow to impair the correlation by delaying the packets or introducing dummy traffic. We introduce a game-theoretic framework for this problem, that is used to derive the Nash Equilibrium. As obtaining the optimal adversary delays distribution is intractable, some approximations are done. We study the concrete example where these delays follow a truncated Gaussian distribution. We also compare the optimal strategies with other fingerprinting schemes. The results are useful for understanding the limits of flow correlation based on packet timings under an active attacker.
A Review of Energy Efficient Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
Venue: arXiv cs.NI 2013
Year: 2013

This paper presents a comprehensive summery of different energy efficient protocols that are based on the basic Mechanism of DSR and enlightens the effort and commitment that has been made since last 10 year to turn the traditional DSR as energy efficient routing protocol.
A Data Management Approach for Dataset Selection Using Human Computation
Venue: arXiv cs.LG 2013
Year: 2013

As the number of applications that use machine learning algorithms increases, the need for labeled data useful for training such algorithms intensifies. Getting labels typically involves employing humans to do the annotation, which directly translates to training and working costs. Crowdsourcing platforms have made labeling cheaper and faster, but they still involve significant costs, especially for the cases where the potential set of candidate data to be labeled is large. In this paper we describe a methodology and a prototype system aiming at addressing this challenge for Web-scale problems in an industrial setting. We discuss ideas on how to efficiently select the data to use for training of machine learning algorithms in an attempt to reduce cost. We show results achieving good performance with reduced cost by carefully selecting which instances to label. Our proposed algorithm is presented as part of a framework for managing and generating training datasets, which includes, among other components, a human computation element.
Design of Parity Preserving Logic Based Fault Tolerant Reversible Arithmetic Logic Unit
Venue: arXiv cs.AR 2013
Year: 2013

Reversible Logic is gaining significant consideration as the potential logic design style for implementation in modern nanotechnology and quantum computing with minimal impact on physical entropy .Fault Tolerant reversible logic is one class of reversible logic that maintain the parity of the input and the outputs. Significant contributions have been made in the literature towards the design of fault tolerant reversible logic gate structures and arithmetic units, however, there are not many efforts directed towards the design of fault tolerant reversible ALUs. Arithmetic Logic Unit (ALU) is the prime performing unit in any computing device and it has to be made fault tolerant. In this paper we aim to design one such fault tolerant reversible ALU that is constructed using parity preserving reversible logic gates. The designed ALU can generate up to seven Arithmetic operations and four logical operations.
A Minimal Six-Point Auto-Calibration Algorithm
Venue: arXiv cs.CV 2013
Year: 2013

A non-iterative auto-calibration algorithm is presented. It deals with a minimal set of six scene points in three views taken by a camera with fixed but unknown intrinsic parameters. Calibration is based on the image correspondences only. The algorithm is implemented and validated on synthetic image data.
Multiview Hessian Discriminative Sparse Coding for Image Annotation
Venue: arXiv cs.MM 2013
Year: 2013

Sparse coding represents a signal sparsely by using an overcomplete dictionary, and obtains promising performance in practical computer vision applications, especially for signal restoration tasks such as image denoising and image inpainting. In recent years, many discriminative sparse coding algorithms have been developed for classification problems, but they cannot naturally handle visual data represented by multiview features. In addition, existing sparse coding algorithms use graph Laplacian to model the local geometry of the data distribution. It has been identified that Laplacian regularization biases the solution towards a constant function which possibly leads to poor extrapolating power. In this paper, we present multiview Hessian discriminative sparse coding (mHDSC) which seamlessly integrates Hessian regularization with discriminative sparse coding for multiview learning problems. In particular, mHDSC exploits Hessian regularization to steer the solution which varies smoothly along geodesics in the manifold, and treats the label information as an additional view of feature for incorporating the discriminative power for image annotation. We conduct extensive experiments on PASCAL VOC'07 dataset and demonstrate the effectiveness of mHDSC for image annotation.
GAPfm: Optimal Top-N Recommendations for Graded Relevance Domains
Venue: arXiv cs.IR 2013
Year: 2013

Recommender systems are frequently used in domains in which users express their preferences in the form of graded judgments, such as ratings. If accurate top-N recommendation lists are to be produced for such graded relevance domains, it is critical to generate a ranked list of recommended items directly rather than predicting ratings. Current techniques choose one of two sub-optimal approaches: either they optimize for a binary metric such as Average Precision, which discards information on relevance grades, or they optimize for Normalized Discounted Cumulative Gain (NDCG), which ignores the dependence of an item's contribution on the relevance of more highly ranked items. In this paper, we address the shortcomings of existing approaches by proposing the Graded Average Precision factor model (GAPfm), a latent factor model that is particularly suited to the problem of top-N recommendation in domains with graded relevance data. The model optimizes for Graded Average Precision, a metric that has been proposed recently for assessing the quality of ranked results list for graded relevance. GAPfm learns a latent factor model by directly optimizing a smoothed approximation of GAP. GAPfm's advantages are twofold: it maintains full information about graded relevance and also addresses the limitations of models that optimize NDCG. Experimental results show that GAPfm achieves substantial improvements on the top-N recommendation task, compared to several state-of-the-art approaches. In order to ensure that GAPfm is able to scale to very large data sets, we propose a fast learning algorithm that uses an adaptive item selection strategy. A final experiment shows that GAPfm is useful not only for generating recommendation lists, but also for ranking a given list of rated items.
PeerShare: A System Secure Distribution of Sensitive Data Among Social Contacts
Venue: arXiv cs.CR 2013
Year: 2013

We present the design and implementation of the PeerShare, a system that can be used by applications to securely distribute sensitive data to social contacts of a user. PeerShare incorporates a generic framework that allows different applications to distribute data with different security requirements. By using interfaces available from existing popular social networks. PeerShare is designed to be easy to use for both end users as well as developers of applications. PeerShare can be used to distribute shared keys, public keys and any other data that need to be distributed with authenticity and confidentiality guarantees to an authorized set of recipients, specified in terms of social relationships. We have used \peershare already in three different applications and plan to make it available for developers.
Shuffling: Improving Data Security in Ad Hoc Networks based on Unipath Routing
Venue: arXiv cs.CR 2013
Year: 2013

An ad hoc network is a self-organizing network with help of Access Point (AP) of wireless links connecting nodes to another. The nodes can communicate without infrastructure network. They form an random topology (BSS/ESS), where the nodes play the role of routers and are free to move arbitrarily. Ad hoc networks confirmed their efficiency being used in different fields but they are highly vulnerable to security attacks and dealing with this is one of the main challenges of these networks today. In recent times, a few solutions are proposed to provide authentication, confidentiality, availability, secure routing and intrusion prevention in ad hoc networks. Employ security in such dynamically changing networks is a hard task. Ad hoc network uniqueness must be taken into contemplation to be clever to design efficient clarification. Here we spotlight on improving the flow transmission confidentiality in ad hoc networks based on unipath routing. Definitely, we take advantage of the being of multiple paths between nodes in an ad hoc network to increase the confidentiality robustness of transmitted data with the help of Access Point. In our approach the original message to secure is split into shares through access point that are encrypted and combined then transmitted along different disjointed existing paths between sender and receiver. Still if an attacker succeeds to attain one or more transmitted contribute to the probability that the unique message will be reconstituted is very low.
Ontology Based Feature Driven Development Life Cycle
Venue: arXiv cs.SE 2013
Year: 2013

The upcoming technology support for semantic web promises fresh directions for Software Engineering community. Also semantic web has its roots in knowledge engineering that provoke software engineers to look for application of ontology applications throughout the Software Engineering life cycle. The internal components of a semantic web are light weight and may be of less quality standards than the externally visible modules. In fact the internal components are generated from external (ontological) component. That is the reason agile development approaches such as feature driven development are suitable for applications internal component development. As yet there is no particular procedure that describes the role of ontology in the processes. Therefore we propose an ontology based feature driven development for semantic web application that can be used form application model development to feature design and implementation. Features are precisely defined in the OWL-based domain model. Transition from OWL based domain model to feature list is directly defined in transformation rules. On the other hand the ontology based overall model can be easily validated through automated tools. Advantages of ontology-based feature Driven development are also discussed.