OpenRaiser/Intern-Atlas huggingface dataset:
Development of Tool for Mapping Conventional Circuit to Reversible Logic
Venue: arXiv cs.ET 2014
Year: 2014

In the last decades, great achievements have been made in the development of computing machines. However, due to exponential growth of transistor density and in particular due to tremendously increasing power consumption, researchers expect that "Conventional Technologies" like Complementary Metal-Oxide Semiconductor will reach their limits in near future. To further satisfy the needs for more computational power, speed, less size etc. alternatives are needed. Reversible Computation is the emerging field and alternative of conventional technologies. Reversible Computation is emerging as a promising solution and likely to work on extremely low power technologies and offer high speed computations. The reversibility retains the capability to retrieve the input data from output and minimizes heat dissipation. As migration to new technology leave a lot of work done in current technology will make the acceptability difficult. One side familiarly with new technology and other side transformation of old circuit designs to new technology will pose a challenge to designers. A need for convertibility of irreversible circuit to reversible circuit was felt that can make a quick start and keep the development on track. In this dissertation a logic circuit design entry based on binary logic system has been taken up that can provide the ease of circuit design in binary logic system and output as reversible circuit. Entire environment is GUI based and easy to learn user friendly. This tool offers editing, storage and conversion into reversible facility.
How to Track Online SLA
Venue: arXiv cs.OH 2014
Year: 2014

SLA (Service level agreement) is defined by an organization to fulfil its client requirements, the time within which the deliverables should be turned over to the clients. Tracking of SLA can be done manually by checking the status, priority of any particular task. Manual SLA tracking takes time as one has to go over each and every task that needs to be completed. For instance, you ordered a product from a website and you are not happy with the quality of the product and want to replace the same on urgent basis, You send mail to the customer support department, the query/complaint will be submitted in a queue and will be processed basis of its priority and urgency (The SLA for responding back to customers concern are listed in the policy). This online SLA tracking system will ensure that no queries/complaints are missed and are processed in an organized manner as per their priority and the date by when it should be handled. The portal will provide the status of the complaints for that particular day and the ones which have been pending since last week. The information can be refreshed as per the client need (within what time frame the complaint should be addressed).
Structured Learning via Logistic Regression
Venue: arXiv cs.LG 2014
Year: 2014

A successful approach to structured learning is to write the learning objective as a joint function of linear parameters and inference messages, and iterate between updates to each. This paper observes that if the inference problem is "smoothed" through the addition of entropy terms, for fixed messages, the learning objective reduces to a traditional (non-structured) logistic regression problem with respect to parameters. In these logistic regression problems, each training example has a bias term determined by the current set of messages. Based on this insight, the structured energy function can be extended from linear factors to any function class where an "oracle" exists to minimize a logistic loss.
Multiple Moving Object Recognitions in video based on Log Gabor-PCA Approach
Venue: arXiv cs.CV 2014
Year: 2014

Object recognition in the video sequence or images is one of the sub-field of computer vision. Moving object recognition from a video sequence is an appealing topic with applications in various areas such as airport safety, intrusion surveillance, video monitoring, intelligent highway, etc. Moving object recognition is the most challenging task in intelligent video surveillance system. In this regard, many techniques have been proposed based on different methods. Despite of its importance, moving object recognition in complex environments is still far from being completely solved for low resolution videos, foggy videos, and also dim video sequences. All in all, these make it necessary to develop exceedingly robust techniques. This paper introduces multiple moving object recognition in the video sequence based on LoG Gabor-PCA approach and Angle based distance Similarity measures techniques used to recognize the object as a human, vehicle etc. Number of experiments are conducted for indoor and outdoor video sequences of standard datasets and also our own collection of video sequences comprising of partial night vision video sequences. Experimental results show that our proposed approach achieves an excellent recognition rate. Results obtained are satisfactory and competent.
Algebraic and relational models for a system based on a poset of two elements
Venue: arXiv cs.LO 2014
Year: 2014

The aim of this paper is to present a very simple set of conditions, necessary for the management of knowledge of a poset $T$ of two agents, which are partially ordered by the capabilities available in the system. We build up a formal system and we elaborate suitable semantic models in order to derive information from the poset. The system is related to three-valued Heyting algebras with Boolean operators.
The Shortest Path to Happiness: Recommending Beautiful, Quiet, and Happy Routes in the City
Venue: arXiv cs.SI 2014
Year: 2014

When providing directions to a place, web and mobile mapping services are all able to suggest the shortest route. The goal of this work is to automatically suggest routes that are not only short but also emotionally pleasant. To quantify the extent to which urban locations are pleasant, we use data from a crowd-sourcing platform that shows two street scenes in London (out of hundreds), and a user votes on which one looks more beautiful, quiet, and happy. We consider votes from more than 3.3K individuals and translate them into quantitative measures of location perceptions. We arrange those locations into a graph upon which we learn pleasant routes. Based on a quantitative validation, we find that, compared to the shortest routes, the recommended ones add just a few extra walking minutes and are indeed perceived to be more beautiful, quiet, and happy. To test the generality of our approach, we consider Flickr metadata of more than 3.7M pictures in London and 1.3M in Boston, compute proxies for the crowdsourced beauty dimension (the one for which we have collected the most votes), and evaluate those proxies with 30 participants in London and 54 in Boston. These participants have not only rated our recommendations but have also carefully motivated their choices, providing insights for future work.
Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates
Venue: arXiv cs.NA 2014
Year: 2014

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.
Performance Analysis of Two-Way AF MIMO Relaying of OSTBCs with Imperfect Channel Gains
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we consider the relaying of orthogonal space time block codes (OSTBCs) in a two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system with estimated channel state information (CSI). A simple four phase protocol is used for training and OSTBC data transmission. Decoding of OSTBC data at a user terminal is performed by replacing the exact CSI by the estimated CSI, in a maximum likelihood decoder. Tight approximations for the moment generating function (m.g.f.) of the received signal-to-noise ratio at a user is derived under Rayleigh fading by ignoring the higher order noise terms. Analytical average error performance of the considered cooperative scheme is derived by using the m.g.f. expression. Moreover, the analytical diversity order of the considered scheme is also obtained for certain system configurations. It is shown by simulations and analysis that the channel estimation does not affect the diversity order of the OSTBC based two-way AF MIMO relay system.
Throughput Optimal Distributed Traffic Signal Control
Venue: arXiv cs.SY 2014
Year: 2014

We propose a distributed algorithm for controlling traffic signals, allowing constraints such as periodic switching sequences of phases and minimum and maximum green time to be incorporated. Our algorithm is adapted from backpressure routing, which has been mainly applied to communication and power networks. We formally prove that our algorithm ensures global optimality as it leads to maximum network throughput even though the controller is constructed and implemented in a completely distributed manner.
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
Venue: arXiv cs.GT 2014
Year: 2014

Let be given a graph $G=(V,E)$ whose edge set is partitioned into a set $R$ of \emph{red} edges and a set $B$ of \emph{blue} edges, and assume that red edges are weighted and form a spanning tree of $G$. Then, the \emph{Stackelberg Minimum Spanning Tree} (\stack) problem is that of pricing (i.e., weighting) the blue edges in such a way that the total weight of the blue edges selected in a minimum spanning tree of the resulting graph is maximized. \stack \ is known to be \apx-hard already when the number of distinct red weights is 2. In this paper we analyze some meaningful specializations and generalizations of \stack, which shed some more light on the computational complexity of the problem. More precisely, we first show that if $G$ is restricted to be \emph{complete}, then the following holds: (i) if there are only 2 distinct red weights, then the problem can be solved optimally (this contrasts with the corresponding \apx-hardness of the general problem); (ii) otherwise, the problem can be approximated within $7/4 + ε$, for any $ε> 0$. Afterwards, we define a natural extension of \stack, namely that in which blue edges have a non-negative \emph{activation cost} associated, and it is given a global \emph{activation budget} that must not be exceeded when pricing blue edges. Here, after showing that the very same approximation ratio as that of the original problem can be achieved, we prove that if the spanning tree of red edges can be rooted so as that any root-leaf path contains at most $h$ edges, then the problem admits a $(2h+ε)$-approximation algorithm, for any $ε> 0$.
Compressed EEG Acquisition with Limited Channels using Estimated Signal Correlation
Venue: arXiv cs.ET 2014
Year: 2014

Nearby scalp channels in multi-channel EEG data exhibit high correlation. A question that naturally arises is whether it is required to record signals from all the electrodes in a group of closely spaced electrodes in a typical measurement setup. One could save on the number of channels that are recorded, if it were possible to reconstruct the omitted channels to the accuracy needed for identifying the relevant information (say, spectral content in the signal), required to carry out a preliminary diagnosis. We address this problem from a compressed sensing perspective and propose a measurement and reconstruction scheme. Working with publicly available EEG database, we put our scheme to experiment and illustrate that if it is only a matter of estimating the frequency content of the signal in various EEG bands, then all the channels need not be recorded. We have achieved an average error below 15% between the original and reconstructed signals with respect to estimation of the spectral content in the delta, theta and alpha bands. We have demonstrated that channels in the 10-10 system of electrode placement can be estimated, with an error less than 10% using recordings on the sparser 10-20 system.
Business types classification via e-commerce stage model in oil industry in Iran
Venue: arXiv cs.OH 2014
Year: 2014

Since the strategies and plans for e-commerce development are different for different industries and since the oil industry is one of the most important industries in Iran, the scope of this research is thus confined to that of the oil industry in Iran. The main aim of this study is to identify and classify the different features of e-commerce development stages and features based on the different business types present in companies in the oil industry in Iran. In order to achieve both of these objectives a questionnaire was developed and administered online. The questionnaire was distributed to forty representatives working in different companies. The collected data was classified and sorted and the priority e-commerce features was classified and displayed as triangles for each business type. Furthermore, the experts were asked to indicate the features which they implemented in their companies in order to know the most used features in each stage. The results of this study give an insight to the practice of e-commerce for Iranian oil companies and can be used to strategize future directions for the industry in terms of e- commerce.
Performance Analysis of Network-Assisted Two-Hop D2D Communications
Venue: arXiv cs.NI 2014
Year: 2014

Network-assisted single-hop device-to-device (D2D) communication can increase the spectral and energy efficiency of cellular networks by taking advantage of the proximity, reuse, and hop gains when radio resources are properly managed between the cellular and D2D layers. In this paper we argue that D2D technology can be used to further increase the spectral and energy efficiency if the key D2D radio resource management algorithms are suitably extended to support network assisted multi-hop D2D communications. Specifically, we propose a novel, distributed utility maximizing D2D power control (PC) scheme that is able to balance spectral and energy efficiency while taking into account mode selection and resource allocation constraints that are important in the integrated cellular-D2D environment. Our analysis and numerical results indicate that multi-hop D2D communications combined with the proposed PC scheme can be useful not only for harvesting the potential gains previously identified in the literature, but also for extending the coverage of cellular networks.
A Lambda Prolog Based Animation of Twelf Specifications
Venue: arXiv cs.PL 2014
Year: 2014

Specifications in the Twelf system are based on a logic programming interpretation of the Edinburgh Logical Framework or LF. We consider an approach to animating such specifications using a Lambda Prolog implementation. This approach is based on a lossy translation of the dependently typed LF expressions into the simply typed lambda calculus (STLC) terms of Lambda Prolog and a subsequent encoding of lost dependency information in predicates that are defined by suitable clauses. To use this idea in an implementation of logic programming a la Twelf, it is also necessary to translate the results found for Lambda Prolog queries back into LF expressions. We describe such an inverse translation and show that it has the necessary properties to facilitate an emulation of Twelf behavior through our translation of LF specifications into Lambda Prolog programs. A characteristic of Twelf is that it permits queries to consist of types which have unspecified parts represented by meta-variables for which values are to be found through computation. We show that this capability can be supported within our translation based approach to animating Twelf specifications.
Optimal Caching and Routing in Hybrid Networks
Venue: arXiv cs.NI 2014
Year: 2014

Hybrid networks consisting of MANET nodes and cellular infrastructure have been recently proposed to improve the performance of military networks. Prior work has demonstrated the benefits of in-network content caching in a wired, Internet context. We investigate the problem of developing optimal routing and caching policies in a hybrid network supporting in-network caching with the goal of minimizing overall content-access delay. Here, needed content may always be accessed at a back-end server via the cellular infrastructure; alternatively, content may also be accessed via cache-equipped "cluster" nodes within the MANET. To access content, MANET nodes must thus decide whether to route to in-MANET cluster nodes or to back-end servers via the cellular infrastructure; the in-MANET cluster nodes must additionally decide which content to cache. We model the cellular path as either i) a congestion-insensitive fixed-delay path or ii) a congestion-sensitive path modeled as an M/M/1 queue. We demonstrate that under the assumption of stationary, independent requests, it is optimal to adopt static caching (i.e., to keep a cache's content fixed over time) based on content popularity. We also show that it is optimal to route to in-MANET caches for content cached there, but to route requests for remaining content via the cellular infrastructure for the congestion-insensitive case and to split traffic between the in-MANET caches and cellular infrastructure for the congestion-sensitive case. We develop a simple distributed algorithm for the joint routing/caching problem and demonstrate its efficacy via simulation.
The Role of Computational Outage in Dense Cloud-Based Centralized Radio Access Networks
Venue: arXiv cs.NI 2014
Year: 2014

Centralized radio access network architectures consolidate the baseband operation towards a cloud-based platform, thereby allowing for efficient utilization of computing assets, effective inter-cell coordination, and exploitation of global channel state information. This paper considers the interplay between computational efficiency and data throughput that is fundamental to centralized RAN. It introduces the concept of computational outage in mobile networks, and applies it to the analysis of complexity constrained dense centralized RAN networks. The framework is applied to single-cell and multi-cell scenarios using parameters drawn from the LTE standard. It is found that in computationally limited networks, the effective throughput can be improved by using a computationally aware policy for selecting the modulation and coding scheme, which sacrifices spectral efficiency in order to reduce the computational outage probability. When signals of multiple base stations are processed centrally, a computational diversity benefit emerges, and the benefit grows with increasing user density.
Stable marriage with general preferences
Venue: arXiv cs.GT 2014
Year: 2014

We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, which need not be transitive nor acyclic. This generalization is practically well-motivated, and as we show, encompasses the well studied hard variant of stable marriage where preferences are allowed to have ties and to be incomplete. As a result, we prove that deciding the existence of a stable matching in our model is NP-complete. Complementing this negative result we present a polynomial-time algorithm for the above decision problem in a significant class of instances where the preferences are asymmetric. We also present a linear programming formulation whose feasibility fully characterizes the existence of stable matchings in this special case. Finally, we use our model to study a long standing open problem regarding the existence of cyclic 3D stable matchings. In particular, we prove that the problem of deciding whether a fixed 2D perfect matching can be extended to a 3D stable matching is NP-complete, showing this way that a natural attempt to resolve the existence (or not) of 3D stable matchings is bound to fail.
A Novel Spectrally-Efficient Scheme for Physical Layer Network Coding
Venue: arXiv cs.NI 2014
Year: 2014

In this paper, we propose a novel three-time-slot transmission scheme combined with an efficient embedded linear channel equalization (ELCE) technique for the Physical layer Network Coding (PNC). Our transmission scheme, we achieve about 33% increase in the spectral efficiency over the conventional two-time-slot scheme while maintaining the same end-toend BER performance.We derive an exact expression for the endto- end BER of the proposed three-time-slot transmission scheme combined with the proposed ELCE technique for BPSK transmission. Numerical results demonstrate that the exact expression for the end-to-end BER is consistent with the BER simulation results.
The Polyhedron-Hitting Problem
Venue: arXiv cs.CC 2014
Year: 2014

We consider polyhedral versions of Kannan and Lipton's Orbit Problem (STOC '80 and JACM '86)---determining whether a target polyhedron V may be reached from a starting point x under repeated applications of a linear transformation A in an ambient vector space Q^m. In the context of program verification, very similar reachability questions were also considered and left open by Lee and Yannakakis in (STOC '92). We present what amounts to a complete characterisation of the decidability landscape for the Polyhedron-Hitting Problem, expressed as a function of the dimension m of the ambient space, together with the dimension of the polyhedral target V: more precisely, for each pair of dimensions, we either establish decidability, or show hardness for longstanding number-theoretic open problems.
Polyadic Constacyclic Codes
Venue: arXiv cs.IT 2014
Year: 2014

For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier of a Type I polyadic constacyclic code is given. As an application, some optimal codes from Type I polyadic constacyclic codes, including generalized Reed-Solomon codes and alternant MDS codes, are constructed.