OpenRaiser/Intern-Atlas huggingface dataset:
Supervised Descent Method for Solving Nonlinear Least Squares Problems in Computer Vision
Venue: arXiv cs.CV 2014
Year: 2014

Many computer vision problems (e.g., camera calibration, image alignment, structure from motion) are solved with nonlinear optimization methods. It is generally accepted that second order descent methods are the most robust, fast, and reliable approaches for nonlinear optimization of a general smooth function. However, in the context of computer vision, second order descent methods have two main drawbacks: (1) the function might not be analytically differentiable and numerical approximations are impractical, and (2) the Hessian may be large and not positive definite. To address these issues, this paper proposes generic descent maps, which are average "descent directions" and rescaling factors learned in a supervised fashion. Using generic descent maps, we derive a practical algorithm - Supervised Descent Method (SDM) - for minimizing Nonlinear Least Squares (NLS) problems. During training, SDM learns a sequence of decent maps that minimize the NLS. In testing, SDM minimizes the NLS objective using the learned descent maps without computing the Jacobian or the Hessian. We prove the conditions under which the SDM is guaranteed to converge. We illustrate the effectiveness and accuracy of SDM in three computer vision problems: rigid image alignment, non-rigid image alignment, and 3D pose estimation. In particular, we show how SDM achieves state-of-the-art performance in the problem of facial feature detection. The code has been made available at www.humansensing.cs.cmu.edu/intraface.
Extracting Family Relationship Networks from Novels
Venue: arXiv cs.CL 2014
Year: 2014

We present an approach to the extraction of family relations from literary narrative, which incorporates a technique for utterance attribution proposed recently by Elson and McKeown (2010). In our work this technique is used in combination with the detection of vocatives - the explicit forms of address used by the characters in a novel. We take advantage of the fact that certain vocatives indicate family relations between speakers. The extracted relations are then propagated using a set of rules. We report the results of the application of our method to Jane Austen's Pride and Prejudice.
Infinite-State Energy Games
Venue: arXiv cs.GT 2014
Year: 2014

Energy games are a well-studied class of 2-player turn-based games on a finite graph where transitions are labeled with integer vectors which represent changes in a multidimensional resource (the energy). One player tries to keep the cumulative changes non-negative in every component while the other tries to frustrate this. We consider generalized energy games played on infinite game graphs induced by pushdown automata (modelling recursion) or their subclass of one-counter automata. Our main result is that energy games are decidable in the case where the game graph is induced by a one-counter automaton and the energy is one-dimensional. On the other hand, every further generalization is undecidable: Energy games on one-counter automata with a 2-dimensional energy are undecidable, and energy games on pushdown automata are undecidable even if the energy is one-dimensional. Furthermore, we show that energy games and simulation games are inter-reducible, and thus we additionally obtain several new (un)decidability results for the problem of checking simulation preorder between pushdown automata and vector addition systems.
Rule of Three for Superresolution of Still Images with Applications to Compression and Denoising
Venue: arXiv cs.CV 2014
Year: 2014

We describe a new method for superresolution of still images (in the wavelet domain) based on the reconstruction of missing details subbands pixels at a given ith level via Rule of Three (Ro3) between pixels of approximation subband of such level, and pixels of approximation and detail subbands of (i+1)th level. The histogramic profiles demonstrate that Ro3 is the appropriate mechanism to recover missing detail subband pixels in these cases. Besides, with the elimination of the details subbands pixels (in an eventual compression scheme), we obtain a bigger compression rate. Experimental results demonstrate that our approach compares favorably to more typical methods of denoising and compression in wavelet domain. Our method does not compress, but facilitates the action of the real compressor, in our case, Joint Photographic Experts Group (JPEG) and JPEg2000, that is, Ro3 acts as a catalyst compression
Rank Matching for Multihop Multiflow
Venue: arXiv cs.IT 2014
Year: 2014

We study the degrees of freedom (DoF) of the layered 2 X 2 X 2 MIMO interference channel where each node is equipped with arbitrary number of antennas, the channels between the nodes have arbitrary rank constraints, and subject to the rank-constraints the channel coefficients can take arbitrary values. The DoF outer bounds reveal a fundamental rank-matching phenomenon, reminiscent of impedance matching in circuit theory. It is well known that the maximum power transfer in a circuit is achieved not for the maximum or minimum load impedance but for the load impedance that matches the source impedance. Similarly, the maximum DoF in the rank- constrained 2 X 2 X 2 MIMO interference network is achieved not for the maximum or minimum ranks of the destination hop, but when the ranks of the destination hop match the ranks of the source hop. In fact, for mismatched settings of interest, the outer bounds identify a DoF loss penalty that is precisely equal to the rank-mismatch between the two hops. For symmetric settings, we also provide achievability results to show that along with the min-cut max-flow bounds, the rank-mismatch bounds are the best possible, i.e., they hold for all channels that satisfy the rank-constraints and are tight for almost all channels that satisfy the rank-constraints. Limited extensions - from sum-DoF to DoF region, from 2 unicasts to X message sets, from 2 hops to more than 2 hops and from 2 nodes per layer to more than 2 nodes per layer - are considered to illustrate how the insights generalize beyond the elemental 2 X 2 X 2 channel model.
Attributes Coupling based Item Enhanced Matrix Factorization Technique for Recommender Systems
Venue: arXiv cs.IR 2014
Year: 2014

Recommender system has attracted lots of attentions since it helps users alleviate the information overload problem. Matrix factorization technique is one of the most widely employed collaborative filtering techniques in the research of recommender systems due to its effectiveness and efficiency in dealing with very large user-item rating matrices. Recently, based on the intuition that additional information provides useful insights for matrix factorization techniques, several recommendation algorithms have utilized additional information to improve the performance of matrix factorization methods. However, the majority focus on dealing with the cold start user problem and ignore the cold start item problem. In addition, there are few suitable similarity measures for these content enhanced matrix factorization approaches to compute the similarity between categorical items. In this paper, we propose attributes coupling based item enhanced matrix factorization method by incorporating item attribute information into matrix factorization technique as well as adapting the coupled object similarity to capture the relationship between items. Item attribute information is formed as an item relationship regularization term to regularize the process of matrix factorization. Specifically, the similarity between items is measured by the Coupled Object Similarity considering coupling between items. Experimental results on two real data sets show that our proposed method outperforms state-of-the-art recommendation algorithms and can effectively cope with the cold start item problem when more item attribute information is available.
Simplification of Training Data for Cross-Project Defect Prediction
Venue: arXiv cs.SE 2014
Year: 2014

Cross-project defect prediction (CPDP) plays an important role in estimating the most likely defect-prone software components, especially for new or inactive projects. To the best of our knowledge, few prior studies provide explicit guidelines on how to select suitable training data of quality from a large number of public software repositories. In this paper, we have proposed a training data simplification method for practical CPDP in consideration of multiple levels of granularity and filtering strategies for data sets. In addition, we have also provided quantitative evidence on the selection of a suitable filter in terms of defect-proneness ratio. Based on an empirical study on 34 releases of 10 open-source projects, we have elaborately compared the prediction performance of different defect predictors built with five well-known classifiers using training data simplified at different levels of granularity and with two popular filters. The results indicate that when using the multi-granularity simplification method with an appropriate filter, the prediction models based on Naive Bayes can achieve fairly good performance and outperform the benchmark method.
On the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical Frameworks
Venue: arXiv cs.AI 2014
Year: 2014

We analyse the expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued interpretations over a given propositional signature using only atoms from that signature. While the computational complexity of the two-valued model existence problem for all these languages is (almost) the same, we show that the languages form a neat hierarchy with respect to their expressiveness.
Gabor Filter and Rough Clustering Based Edge Detection
Venue: arXiv cs.CV 2014
Year: 2014

This paper introduces an efficient edge detection method based on Gabor filter and rough clustering. The input image is smoothed by Gabor function, and the concept of rough clustering is used to focus on edge detection with soft computational approach. Hysteresis thresholding is used to get the actual output, i.e. edges of the input image. To show the effectiveness, the proposed technique is compared with some other edge detection methods.
Wireless Fidelity Real Time Security System
Venue: arXiv cs.NI 2014
Year: 2014

This paper describes about how you can secure your Wireless Network from hackers about various threats to wireless networks, How hackers makes most use of it and what are the security steps one should take to avoid becoming victim of such attacks. There are plenty of opportunities to connect to public Wi-Fi hotspots when you're on the go these days. Coffee shops, hotels, restaurants and airports are just some of the places where you can jump online, but often these networks are open and not secure. Whether you're using a laptop, tablet or smartphone, you'll want to connect your device securely to protect your data as much as possible. Otherwise an unsecured Wi-Fi connection makes it easier for hackers to access your private files and information, and it allows strangers to use your internet connection. Here are some simple steps you can take to help make sure your data is safe on open public Wi-Fi.
Multipair Full-Duplex Relaying with Massive Arrays and Linear Processing
Venue: arXiv cs.IT 2014
Year: 2014

We consider a multipair decode-and-forward relay channel, where multiple sources transmit simultaneously their signals to multiple destinations with the help of a full-duplex relay station. We assume that the relay station is equipped with massive arrays, while all sources and destinations have a single antenna. The relay station uses channel estimates obtained from received pilots and zero-forcing (ZF) or maximum-ratio combining/maximum-ratio transmission (MRC/MRT) to process the signals. To reduce significantly the loop interference effect, we propose two techniques: i) using a massive receive antenna array; or ii) using a massive transmit antenna array together with very low transmit power at the relay station. We derive an exact achievable rate in closed-form for MRC/MRT processing and an analytical approximation of the achievable rate for ZF processing. This approximation is very tight, especially for large number of relay station antennas. These closed-form expressions enable us to determine the regions where the full-duplex mode outperforms the half-duplex mode, as well as, to design an optimal power allocation scheme. This optimal power allocation scheme aims to maximize the energy efficiency for a given sum spectral efficiency and under peak power constraints at the relay station and sources. Numerical results verify the effectiveness of the optimal power allocation scheme. Furthermore, we show that, by doubling the number of transmit/receive antennas at the relay station, the transmit power of each source and of the relay station can be reduced by 1.5dB if the pilot power is equal to the signal power, and by 3dB if the pilot power is kept fixed, while maintaining a given quality-of-service.
Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation
Venue: arXiv cs.AI 2014
Year: 2014

Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access. Entailment with existential rules is undecidable. We focus in this paper on conditions that ensure the termination of a breadth-first forward chaining algorithm known as the chase. Several variants of the chase have been proposed. In the first part of this paper, we propose a new tool that allows to extend existing acyclicity conditions ensuring chase termination, while keeping good complexity properties. In the second part, we study the extension to existential rules with nonmonotonic negation under stable model semantics, discuss the relevancy of the chase variants for these rules and further extend acyclicity results obtained in the positive case.
Translating UML State Machines to Coloured Petri Nets Using Acceleo: A Report
Venue: arXiv cs.SE 2014
Year: 2014

UML state machines are widely used to specify dynamic systems behaviours. However its semantics is described informally, thus preventing the application of model checking techniques that could guarantee the system safety. In a former work, we proposed a formalisation of non-concurrent UML state machines using coloured Petri nets, so as to allow for formal verification. In this paper, we report our experience to implement this translation in an automated manner using the model-to-text transformation tool Acceleo. Whereas Acceleo provides interesting features that facilitated our translation process, it also suffers from limitations uneasy to overcome.
In my Wish List, an Automated Tool for Fail-Secure Design Analysis: an Alloy-Based Feasibility Draft
Venue: arXiv cs.CR 2014
Year: 2014

A system is said to be fail-secure, sometimes confused with fail-safe, if it maintains its security requirements even in the event of some faults. Fail-secure analyses are required by some validation schemes, such as some Common Criteria or NATO certifications. However, it is an aspect of security which as been overlooked by the community. This paper attempts to shed some light on the fail-secure field of study by: giving a definition of fail-secure as used in those certification schemes, and emphasizing the differences with fail-safe; and exhibiting a first feasibility draft of a fail-secure design analysis tool based on the Alloy model checker.
Persuasive Technology Contributions Toward Enhance Information Security Awareness in an Organization
Venue: arXiv cs.CY 2014
Year: 2014

Persuasion is part and parcel of human interaction. The human persuaders in society have been always exit, masters of rhetoric skilled of changing our minds, or at least our behaviors. Leaders, mothers, salesmen, and teachers are clear examples of persuaders. Persuaders often turn to technology and digital media to amplify their persuasive ends. Besides, our lives and how we lead them influenced by technologies and digital media,but for the most part, their effects on our attitudes and behaviors have been incidental, even accidental. Although, nowadays, the use of computers to sell products and services considered as the most frequent application of persuasive technology. In this short paper, based on an extensive review of literatures, we aim to give a brief introduction to persuasive technology, and how it can play a role and contribute to enhance and deliver the best practice of IT. Some challenges of persuasive technology have been discussed. At the end, some recommendations and steps should be taken place to empower IT professional practices have been listed.
What kind of noise guarantees security for the Kirchhoff-Loop-Johnson-Noise key exchange?
Venue: arXiv cs.CR 2014
Year: 2014

This article is a supplement to our recent one about the analysis of the noise properties in the Kirchhoff-Law-Johnson-Noise (KLJN) secure key exchange system [Gingl and Mingesz, PLOS ONE 9 (2014) e96109, doi:10.1371/journal.pone.0096109]. Here we use purely mathematical statistical derivations to prove that only normal distribution with special scaling can guarantee security. Our results are in agreement with earlier physical assumptions [Kish, Phys. Lett. A 352 (2006) 178-182, doi: 10.1016/j.physleta.2005.11.062]. Furthermore, we have carried out numerical simulations to show that the communication is clearly unsecure for improper selection of the noise properties. Protection against attacks using time and correlation analysis is not considered in this paper.
Time-Inconsistent Planning: A Computational Problem in Behavioral Economics
Venue: arXiv cs.GT 2014
Year: 2014

In many settings, people exhibit behavior that is inconsistent across time --- we allocate a block of time to get work done and then procrastinate, or put effort into a project and then later fail to complete it. An active line of research in behavioral economics and related fields has developed and analyzed models for this type of time-inconsistent behavior. Here we propose a graph-theoretic model of tasks and goals, in which dependencies among actions are represented by a directed graph, and a time-inconsistent agent constructs a path through this graph. We first show how instances of this path-finding problem on different input graphs can reconstruct a wide range of qualitative phenomena observed in the literature on time-inconsistency, including procrastination, abandonment of long-range tasks, and the benefits of reduced sets of choices. We then explore a set of analyses that quantify over the set of all graphs; among other results, we find that in any graph, there can be only polynomially many distinct forms of time-inconsistent behavior; and any graph in which a time-inconsistent agent incurs significantly more cost than an optimal agent must contain a large "procrastination" structure as a minor. Finally, we use this graph-theoretic model to explore ways in which tasks can be designed to help motivate agents to reach designated goals.
Semantics and Compilation of Answer Set Programming with Generalized Atoms
Venue: arXiv cs.AI 2014
Year: 2014

Answer Set Programming (ASP) is logic programming under the stable model or answer set semantics. During the last decade, this paradigm has seen several extensions by generalizing the notion of atom used in these programs. Among these, there are aggregate atoms, HEX atoms, generalized quantifiers, and abstract constraints. In this paper we refer to these constructs collectively as generalized atoms. The idea common to all of these constructs is that their satisfaction depends on the truth values of a set of (non-generalized) atoms, rather than the truth value of a single (non-generalized) atom. Motivated by several examples, we argue that for some of the more intricate generalized atoms, the previously suggested semantics provide unintuitive results and provide an alternative semantics, which we call supportedly stable or SFLP answer sets. We show that it is equivalent to the major previously proposed semantics for programs with convex generalized atoms, and that it in general admits more intended models than other semantics in the presence of non-convex generalized atoms. We show that the complexity of supportedly stable models is on the second level of the polynomial hierarchy, similar to previous proposals and to stable models of disjunctive logic programs. Given these complexity results, we provide a compilation method that compactly transforms programs with generalized atoms in disjunctive normal form to programs without generalized atoms. Variants are given for the new supportedly stable and the existing FLP semantics, for which a similar compilation technique has not been known so far.
Global Numerical Constraints on Trees
Venue: arXiv cs.LO 2014
Year: 2014

We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of a given node. By contrast, the logic introduced in the present work can concisely express numerical bounds on any region, descendants or ancestors for instance. We prove that the logic is decidable in single exponential time even if the numerical constraints are in binary form. We also illustrate the usage of the logic in the description of numerical constraints on multi-directional path queries on XML documents. Furthermore, numerical restrictions on regular languages (XML schemas) can also be concisely described by the logic. This implies a characterization of decidable counting extensions of XPath queries and XML schemas. Moreover, as the logic is closed under negation, it can thus be used as an optimal reasoning framework for testing emptiness, containment and equivalence.
Latent semantics of action verbs reflect phonetic parameters of intensity and emotional content
Venue: arXiv cs.CL 2014
Year: 2014

Conjuring up our thoughts, language reflects statistical patterns of word co-occurrences which in turn come to describe how we perceive the world. Whether counting how frequently nouns and verbs combine in Google search queries, or extracting eigenvectors from term document matrices made up of Wikipedia lines and Shakespeare plots, the resulting latent semantics capture not only the associative links which form concepts, but also spatial dimensions embedded within the surface structure of language. As both the shape and movements of objects have been found to be associated with phonetic contrasts already in toddlers, this study explores whether articulatory and acoustic parameters may likewise differentiate the latent semantics of action verbs. Selecting 3 x 20 emotion, face, and hand related verbs known to activate premotor areas in the brain, their mutual cosine similarities were computed using latent semantic analysis LSA, and the resulting adjacency matrices were compared based on two different large scale text corpora; HAWIK and TASA. Applying hierarchical clustering to identify common structures across the two text corpora, the verbs largely divide into combined mouth and hand movements versus emotional expressions. Transforming the verbs into their constituent phonemes, the clustered small and large size movements appear differentiated by front versus back vowels corresponding to increasing levels of arousal. Whereas the clustered emotional verbs seem characterized by sequences of close versus open jaw produced phonemes, generating up- or downwards shifts in formant frequencies that may influence their perceived valence. Suggesting, that the latent semantics of action verbs reflect parameters of intensity and emotional polarity that appear correlated with the articulatory contrasts and acoustic characteristics of phonemes