OpenRaiser/Intern-Atlas huggingface dataset:
Image Encryption and Decryption in A Modification of ElGamal Cryptosystem in MATLAB
Venue: arXiv cs.CR 2014
Year: 2014

The need of exchanging messages and images secretly over unsecure networks promoted the creation of cryptosystems to enable receivers to interpret the exchanged information. In this paper, a particular public key cryptosystem called the ElGamal Cryptosystem is presented considered with the help MATLAB Program to be used over Images. Since the ElGamal cryptosystem over a primitive root of a large prime is used in messages encryption in the free GNU Privacy Guard software, recent versions of PGP, and other cryptosystems. This paper shows a modification of the this cryptosystem by applying it over gray and color images. That would be by transforming an image into its corresponding matrix using MATLAB Program, then applying the encryption and decryption algorithms over it. Actually, this modification gives one of the best image encryptions that have been used since the encryption procedure over any image goes smoothly and transfers the original image to completely undefined image which makes this cryptosystem is really secure and successful over image encryption. As well as, the decryption procedure of the encrypted image works very well since it transfers undefined image to its original. Therefore, this new modification can make the cryptosystem of images more immune against some future attacks since breaking this cryptosystem depends on solving the discrete logarithm problem which is really impossible with large prime numbers .
Formation Games of Reliable Networks
Venue: arXiv cs.GT 2014
Year: 2014

We establish a network formation game for the Internet's Autonomous System (AS) interconnection topology. The game includes different types of players, accounting for the heterogeneity of ASs in the Internet. We incorporate reliability considerations in the player's utility function, and analyze static properties of the game as well as its dynamic evolution. We provide dynamic analysis of its topological quantities, and explain the prevalence of some "network motifs" in the Internet graph. We assess our predictions with real-world data.
Probing the topological properties of complex networks modeling short written texts
Venue: arXiv cs.CL 2014
Year: 2014

In recent years, graph theory has been widely employed to probe several language properties. More specifically, the so-called word adjacency model has been proven useful for tackling several practical problems, especially those relying on textual stylistic analysis. The most common approach to treat texts as networks has simply considered either large pieces of texts or entire books. This approach has certainly worked well -- many informative discoveries have been made this way -- but it raises an uncomfortable question: could there be important topological patterns in small pieces of texts? To address this problem, the topological properties of subtexts sampled from entire books was probed. Statistical analyzes performed on a dataset comprising 50 novels revealed that most of the traditional topological measurements are stable for short subtexts. When the performance of the authorship recognition task was analyzed, it was found that a proper sampling yields a discriminability similar to the one found with full texts. Surprisingly, the support vector machine classification based on the characterization of short texts outperformed the one performed with entire books. These findings suggest that a local topological analysis of large documents might improve its global characterization. Most importantly, it was verified, as a proof of principle, that short texts can be analyzed with the methods and concepts of complex networks. As a consequence, the techniques described here can be extended in a straightforward fashion to analyze texts as time-varying complex networks.
Categorical characterizations of operator-valued measures
Venue: arXiv cs.LO 2014
Year: 2014

The most general type of measurement in quantum physics is modeled by a positive operator-valued measure (POVM). Mathematically, a POVM is a generalization of a measure, whose values are not real numbers, but positive operators on a Hilbert space. POVMs can equivalently be viewed as maps between effect algebras or as maps between algebras for the Giry monad. We will show that this equivalence is an instance of a duality between two categories. In the special case of continuous POVMs, we obtain two equivalent representations in terms of morphisms between von Neumann algebras.
On Gács' quantum algorithmic entropy
Venue: arXiv cs.IT 2014
Year: 2014

We define an infinite dimensional modification of lower-semicomputability of density operators by Gács with an attempt to fix some problem in the paper. Our attempt is partly achieved by showing the existence of universal operator under some additional assumption. It is left as a future task to eliminate this assumption. We also see some properties and examples which stimulate further research. In particular, we show that universal operator has certain nontrivial form if it exists.
Accurate and Conservative Estimates of MRF Log-likelihood using Reverse Annealing
Venue: arXiv cs.LG 2014
Year: 2014

Markov random fields (MRFs) are difficult to evaluate as generative models because computing the test log-probabilities requires the intractable partition function. Annealed importance sampling (AIS) is widely used to estimate MRF partition functions, and often yields quite accurate results. However, AIS is prone to overestimate the log-likelihood with little indication that anything is wrong. We present the Reverse AIS Estimator (RAISE), a stochastic lower bound on the log-likelihood of an approximation to the original MRF model. RAISE requires only the same MCMC transition operators as standard AIS. Experimental results indicate that RAISE agrees closely with AIS log-probability estimates for RBMs, DBMs, and DBNs, but typically errs on the side of underestimating, rather than overestimating, the log-likelihood.
STT-SNN: A Spin-Transfer-Torque Based Soft-Limiting Non-Linear Neuron for Low-Power Artificial Neural Networks
Venue: arXiv cs.ET 2014
Year: 2014

Recent years have witnessed growing interest in the use of Artificial Neural Networks (ANNs) for vision, classification, and inference problems. An artificial neuron sums N weighted inputs and passes the result through a non-linear transfer function. Large-scale ANNs impose very high computing requirements for training and classification, leading to great interest in the use of post-CMOS devices to realize them in an energy efficient manner. In this paper, we propose a spin-transfer-torque (STT) device based on Domain Wall Motion (DWM) magnetic strip that can efficiently implement a Soft-limiting Non-linear Neuron (SNN) operating at ultra-low supply voltage and current. In contrast to previous spin-based neurons that can only realize hard-limiting transfer functions, the proposed STT-SNN displays a continuous resistance change with varying input current, and can therefore be employed to implement a soft-limiting neuron transfer function. Soft-limiting neurons are greatly preferred to hard-limiting ones due to their much improved modeling capacity, which leads to higher network accuracy and lower network complexity. We also present an ANN hardware design employing the proposed STT-SNNs and Memristor Crossbar Arrays (MCA) as synapses. The ultra-low voltage operation of the magneto metallic STT-SNN enables the programmable MCA-synapses, computing analog-domain weighted summation of input voltages, to also operate at ultra-low voltage. We modeled the STT-SNN using micro-magnetic simulation and evaluated them using an ANN for character recognition. Comparisons with analog and digital CMOS neurons show that STT-SNNs can achieve more than two orders of magnitude lower energy consumption.
Optimal rounding under integer constraints
Venue: arXiv cs.DS 2014
Year: 2014

Given real numbers whose sum is an integer, we study the problem of finding integers which match these real numbers as closely as possible, in the sense of L^p norm, while preserving the sum. We describe the structure of solutions for this integer optimization problem and propose an algorithm with complexity O(N log N) for solving it. In contrast to fractional rounding and randomized rounding, which yield biased estimators of the solution when applied to this problem, our method yields an exact solution which minimizes the relative rounding error across the set of all solutions for any value of p greater than 1, while avoiding the complexity of exhaustive search. The proposed algorithm also solves a class of integer optimization problems with integer constraints and may be used as the rounding step of relaxed integer programming problems, for rounding real-valued solutions. We give several examples of applications for the proposed algorithm.
A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph
Venue: arXiv cs.SI 2014
Year: 2014

Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, lots of replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition framework for random walks implemented by parallel computing in big graph. The framework is based on two optimization functions to reduce the bandwidth, memory and storage cost in the condition that the load balance is guaranteed. In this framework, several greedy graph partition algorithms are proposed. We also propose five metrics from different perspectives to evaluate the performance of these algorithms. By running the algorithms on the big graph data set of real world, the experimental results show that these algorithms in the framework are capable of solving the problem of graph partition for random walks for different needs, e.g. the best result is improved more than 70 times in reducing the times of communication.
HSI based colour image equalization using iterative nth root and nth power
Venue: arXiv cs.CV 2014
Year: 2014

In this paper an equalization technique for colour images is introduced. The method is based on nth root and nth power equalization approach but with optimization of the mean of the image in different colour channels such as RGB and HSI. The performance of the proposed method has been measured by the means of peak signal to noise ratio. The proposed algorithm has been compared with conventional histogram equalization and the visual and quantitative experimental results are showing that the proposed method over perform the histogram equalization.
Small Cell Traffic Balancing Over Licensed and Unlicensed Bands
Venue: arXiv cs.NI 2014
Year: 2014

The 3rd Generation Partnership Project (3GPP) recently started standardizing the "Licensed-Assisted Access using LTE" for small cells, referred to as Dual Band Femtocell (DBF) in this paper, which uses LTE air interface in both licensed and unlicensed bands based on the Long Term Evolution (LTE) carrier aggregation feature. Alternatively, the Small Cell Forum introduced the Integrated Femto-WiFi (IFW) small cell which simultaneously accesses both the licensed band (via cellular interface) and the unlicensed band (via WiFi interface). In this paper, a practical algorithm for IFW and DBF to automatically balance their traffic in licensed and unlicensed bands, based on the real-time channel, interference and traffic conditions of both bands is described. The algorithm considers the fact that some "smart" devices (sDevices) have both cellular and WiFi radios while some WiFi-only devices (wDevices) may only have WiFi radio. In addition, the algorithm considers a realistic scenario where a single small cell user may simultaneously use multiple sDevices and wDevices via either the IFW, or the DBF in conjunction with a Wireless Local Area Network (WLAN). The goal is to maximize the total user satisfaction/utility of the small cell user, while keeping the interference from small cell to macrocell below predefined thresholds. The algorithm can be implemented at the Radio Link Control (RLC) or the network layer of the IFW and DBF small cell base stations. Results demonstrate that the proposed traffic-balancing algorithm applied to either IFW or DBF significantly increases sum utility of all macrocell and small cell users, compared with the current practices. Finally, various implementation issues of IFW and DBF are addressed.
Set-merging for the Matching Algorithm of Micali and Vazirani
Venue: arXiv cs.DS 2014
Year: 2014

The algorithm of Micali and Vazirani \cite{MV} finds a maximum cardinality matching in time $O(\sqrt n m)$ if an efficient set-merging algorithm is used. The latter is provided by the incremental-tree set-merging algorithm of \cite{GabTar}. Details of this application to matching were omitted from \cite{GabTar} and are presented in this note.
The Computational Theory of Intelligence: Data Aggregation
Venue: arXiv cs.AI 2014
Year: 2014

In this paper, we will expound upon the concepts proffered in [1], where we proposed an information theoretic approach to intelligence in the computational sense. We will examine data and meme aggregation, and study the effect of limited resources on the resulting meme amplitudes.
A Novel Approach to Develop a New Hybrid Technique for Trademark Image Retrieval
Venue: arXiv cs.CV 2014
Year: 2014

Trademark Image Retrieval is playing a vital role as a part of CBIR System. Trademark is of great significance because it carries the status value of any company. To retrieve such a fake or copied trademark we design a retrieval system which is based on hybrid techniques. It contains a mixture of two different feature vector which combined together to give a suitable retrieval system. In the proposed system we extract the corner feature which is applied on an edge pixel image. This feature is used to extract the relevant image and to more purify the result we apply other feature which is the invariant moment feature. From the experimental result we conclude that the system is 85 percent efficient.
Facial Expressions recognition Based on Principal Component Analysis (PCA)
Venue: arXiv cs.CV 2014
Year: 2014

The facial expression recognition is an ocular task that can be performed without human discomfort, is really a speedily growing on the computer research field. There are many applications and programs uses facial expression to evaluate human character, judgment, feelings, and viewpoint. The process of recognizing facial expression is a hard task due to the several circumstances such as facial occlusions, face shape, illumination, face colors, and etc. This paper present a PCA methodology to distinguish expressions of faces under different circumstances and identifying it. Relies on Eigen faces technique using standard Data base images. So as to overcome the problem of difficulty to computers to identify the features and expressions of persons.
Formalizing common sense for scalable inconsistency-robust information integration using Direct Logic(TM) reasoning and the Actor Model
Venue: arXiv cs.LO 2015
Year: 2015

Because contemporary large software systems are pervasively inconsistent, it is not safe to reason about them using classical logic. The goal of Direct Logic is to be a minimal fix to classical mathematical logic that meets the requirements of large-scale Internet applications (including sense making for natural language) by addressing the following issues: inconsistency robustness, contrapositive inference bug, and direct argumentation. Direct Logic makes the following contributions over previous work: * Direct Inference (no contrapositive bug for inference) * Direct Argumentation (inference directly expressed) * Inconsistency-robust deduction without artifices such as indices (labels) on propositions or restrictions on reiteration * Intuitive inferences hold including the following: * Boolean Equivalences * Reasoning by splitting for disjunctive cases * Soundness * Inconsistency-robust Proof by Contradiction Since the global state model of computation (first formalized by Turing) is inadequate to the needs of modern large-scale Internet applications the Actor Model was developed to meet this need. Using, the Actor Model, this paper proves that Logic Programming is not computationally universal in that there are computations that cannot be implemented using logical inference. Consequently the Logic Programming paradigm is strictly less general than the Procedural Embedding of Knowledge paradigm.
The hardness of the independence and matching clutter of a graph
Venue: arXiv cs.DM 2015
Year: 2015

A {\it clutter} (or {\it antichain} or {\it Sperner family}) $L$ is a pair $(V,E)$, where $V$ is a finite set and $E$ is a family of subsets of $V$ none of which is a subset of another. Usually, the elements of $V$ are called {\it vertices} of $L$, and the elements of $E$ are called {\it edges} of $L$. A subset $s_e$ of an edge $e$ of a clutter is called {\it recognizing} for $e$, if $s_e$ is not a subset of another edge. The {\it hardness} of an edge $e$ of a clutter is the ratio of the size of $e\textrm{'s}$ smallest recognizing subset to the size of $e$. The hardness of a clutter is the maximum hardness of its edges. We study the hardness of clutters arising from independent sets and matchings of graphs.
Development of an automated Red Light Violation Detection System (RLVDS) for Indian vehicles
Venue: arXiv cs.CV 2015
Year: 2015

Integrated Traffic Management Systems (ITMS) are now implemented in different cities in India to primarily address the concerns of road-safety and security. An automated Red Light Violation Detection System (RLVDS) is an integral part of the ITMS. In our present work we have designed and developed a complete system for generating the list of all stop-line violating vehicle images automatically from video snapshots of road-side surveillance cameras. The system first generates adaptive background images for each camera view, subtracts captured images from the corresponding background images and analyses potential occlusions over the stop-line in a traffic signal. Considering round-the-clock operations in a real-life test environment, the developed system could successfully track 92% images of vehicles with violations on the stop-line in a "Red" traffic signal.
Schaefer's theorem for graphs
Venue: arXiv cs.CC 2015
Year: 2015

Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in polynomial time, or is NP-complete. We present an analog of this dichotomy result for the propositional logic of graphs instead of Boolean logic. In this generalization of Schaefer's result, the input consists of a set W of variables and a conjunction Φ of statements ("constraints") about these variables in the language of graphs, where each statement is taken from a fixed finite set Ψ of allowed quantifier-free first-order formulas; the question is whether Φ is satisfiable in a graph. We prove that either Ψ is contained in one out of 17 classes of graph formulas and the corresponding problem can be solved in polynomial time, or the problem is NP-complete. This is achieved by a universal-algebraic approach, which in turn allows us to use structural Ramsey theory. To apply the universal-algebraic approach, we formulate the computational problems under consideration as constraint satisfaction problems (CSPs) whose templates are first-order definable in the countably infinite random graph. Our method to classify the computational complexity of those CSPs is based on a Ramsey-theoretic analysis of functions acting on the random graph, and we develop general tools suitable for such an analysis which are of independent mathematical interest.
Warping Peirce Quincuncial Panoramas
Venue: arXiv cs.CV 2015
Year: 2015

The Peirce quincuncial projection is a mapping of the surface of a sphere to the interior of a square. It is a conformal map except for four points on the equator. These points of non-conformality cause significant artifacts in photographic applications. In this paper, we propose an algorithm and user-interface to mitigate these artifacts. Moreover, in order to facilitate an interactive user-interface, we present a fast algorithm for calculating the Peirce quincuncial projection of spherical imagery. We then promote the Peirce quincuncial projection as a viable alternative to the more popular stereographic projection in some scenarios.
Connection errors in networks of linear features and the application of geometrical reduction in spatial data algorithms
Venue: arXiv cs.DS 2015
Year: 2015

We present a study on connection errors in networks of linear features and methods of error detection. We model networks with special connection specifications as networks with hierarchically connected features and define errors considering the spatial relationships and the functionality of the network elements. A general definition of the problem of the detection of connection errors which takes into account the functionality of the network elements is discussed. Then a series of spatial algorithms that solve different aspects of the problem is presented. We also define and analyze the notion of geometrical reduction as a method of achieving efficient performance. In the last section the undecidability of algorithmic error correction is discussed.
Another approach to the equivalence of measure-many one-way quantum finite automata and its application
Venue: arXiv cs.CC 2015
Year: 2015

In this paper, we present a much simpler, direct and elegant approach to the equivalence problem of {\it measure many one-way quantum finite automata} (MM-1QFAs). The approach is essentially generalized from the work of Carlyle [J. Math. Anal. Appl. 7 (1963) 167-175]. Namely, we reduce the equivalence problem of MM-1QFAs to that of two (initial) vectors. As an application of the approach, we utilize it to address the equivalence problem of {\it Enhanced one-way quantum finite automata} (E-1QFAs) introduced by Nayak [Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp.~369-376]. We prove that two E-1QFAs $\mathcal{A}_1$ and $\mathcal{A}_2$ over $Σ$ are equivalence if and only if they are $n_1^2+n_2^2-1$-equivalent where $n_1$ and $n_2$ are the numbers of states in $\mathcal{A}_1$ and $\mathcal{A}_2$, respectively.