OpenRaiser/Intern-Atlas huggingface dataset:
A Cross-cultural Corpus of Annotated Verbal and Nonverbal Behaviors in Receptionist Encounters
Venue: arXiv cs.CL 2012
Year: 2012

We present the first annotated corpus of nonverbal behaviors in receptionist interactions, and the first nonverbal corpus (excluding the original video and audio data) of service encounters freely available online. Native speakers of American English and Arabic participated in a naturalistic role play at reception desks of university buildings in Doha, Qatar and Pittsburgh, USA. Their manually annotated nonverbal behaviors include gaze direction, hand and head gestures, torso positions, and facial expressions. We discuss possible uses of the corpus and envision it to become a useful tool for the human-robot interaction community.
Singular and Plural Functions for Functional Logic Programming
Venue: arXiv cs.PL 2012
Year: 2012

Functional logic programming (FLP) languages use non-terminating and non-confluent constructor systems (CS's) as programs in order to define non-strict non-determi-nistic functions. Two semantic alternatives have been usually considered for parameter passing with this kind of functions: call-time choice and run-time choice. While the former is the standard choice of modern FLP languages, the latter lacks some properties---mainly compositionality---that have prevented its use in practical FLP systems. Traditionally it has been considered that call-time choice induces a singular denotational semantics, while run-time choice induces a plural semantics. We have discovered that this latter identification is wrong when pattern matching is involved, and thus we propose two novel compositional plural semantics for CS's that are different from run-time choice. We study the basic properties of our plural semantics---compositionality, polarity, monotonicity for substitutions, and a restricted form of the bubbling property for constructor systems---and the relation between them and to previous proposals, concluding that these semantics form a hierarchy in the sense of set inclusion of the set of computed values. We have also identified a class of programs characterized by a syntactic criterion for which the proposed plural semantics behave the same, and a program transformation that can be used to simulate one of them by term rewriting. At the practical level, we study how to use the expressive capabilities of these semantics for improving the declarative flavour of programs. We also propose a language which combines call-time choice and our plural semantics, that we have implemented in Maude. The resulting interpreter is employed to test several significant examples showing the capabilities of the combined semantics. To appear in Theory and Practice of Logic Programming (TPLP)
Enhancement of Images using Morphological Transformation
Venue: arXiv cs.CV 2012
Year: 2012

This paper deals with enhancement of images with poor contrast and detection of background. Proposes a frame work which is used to detect the background in images characterized by poor contrast. Image enhancement has been carried out by the two methods based on the Weber's law notion. The first method employs information from image background analysis by blocks, while the second transformation method utilizes the opening operation, closing operation, which is employed to define the multi-background gray scale images. The complete image processing is done using MATLAB simulation model. Finally, this paper is organized as follows as Morphological transformation and Weber's law. Image background approximation to the background by means of block analysis in conjunction with transformations that enhance images with poor lighting. The multibackground notion is introduced by means of the opening by reconstruction shows a comparison among several techniques to improve contrast in images. Finally, conclusions are presented.
When Index Term Probability Violates the Classical Probability Axioms Quantum Probability can be a Necessary Theory for Information Retrieval
Venue: arXiv cs.IR 2012
Year: 2012

Probabilistic models require the notion of event space for defining a probability measure. An event space has a probability measure which ensues the Kolmogorov axioms. However, the probabilities observed from distinct sources, such as that of relevance of documents, may not admit a single event space thus causing some issues. In this article, some results are introduced for ensuring whether the observed prob- abilities of relevance of documents admit a single event space. More- over, an alternative framework of probability is introduced, thus chal- lenging the use of classical probability for ranking documents. Some reflections on the convenience of extending the classical probabilis- tic retrieval toward a more general framework which encompasses the issues are made.
Seven Means, Generalized Triangular Discrimination, and Generating Divergence Measures
Venue: arXiv cs.IT 2012
Year: 2012

From geometrical point of view, Eve (2003) studied seven means. These means are Harmonic, Geometric, Arithmetic, Heronian, Contra-harmonic, Root-mean square and Centroidal mean. We have considered for the first time a new measure calling generalized triangular discrimination. Inequalities among non-negative differences arising due to seven means and particular cases of generalized triangular discrimination are considered. Some new generating measures and their exponential representations are also presented.
A Fast-CSMA Algorithm for Deadline-Constrained Scheduling over Wireless Fading Channels
Venue: arXiv cs.NI 2012
Year: 2012

Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these algorithms are not well-suited for serving real-time traffic under time-varying channel conditions for two reasons: (1) the mixing time of the underlying CSMA Markov Chain grows with the size of the network, which, for large networks, generates unacceptable delay for deadline-constrained traffic; (2) since the dynamic CSMA parameters are influenced by the arrival and channel state processes, the underlying CSMA Markov Chain may not converge to a steady-state under strict deadline constraints and fading channel conditions. In this paper, we attack the problem of distributed scheduling for serving real-time traffic over time-varying channels. Specifically, we consider fully-connected topologies with independently fading channels (which can model cellular networks) in which flows with short-term deadline constraints and long-term drop rate requirements are served. To that end, we first characterize the maximal set of satisfiable arrival processes for this system and, then, propose a Fast-CSMA (FCSMA) policy that is shown to be optimal in supporting any real-time traffic that is within the maximal satisfiable set. These theoretical results are further validated through simulations to demonstrate the relative efficiency of the FCSMA policy compared to some of the existing CSMA-based algorithms.
Report on "Mathematical Aspects of P vs. NP and its Variants."
Venue: arXiv cs.CC 2012
Year: 2012

This is a report on a workshop held August 1 to August 5, 2011 at the Institute for Computational and Experimental Research in Mathematics (ICERM) at Brown University, Providence, Rhode Island, organized by Saugata Basu, Joseph M. Landsberg, and J. Maurice Rojas. We provide overviews of the more recent results presented at the workshop, including some works-in-progress as well as tentative and intriguing ideas for new directions. The main themes we discuss are representation theory and geometry in the Mulmuley-Sohoni Geometric Complexity Theory Program, and number theory and other ideas in the Blum-Shub-Smale model.
Combinatorial Selection and Least Absolute Shrinkage via the CLASH Algorithm
Venue: arXiv cs.IT 2012
Year: 2012

The least absolute shrinkage and selection operator (LASSO) for linear regression exploits the geometric interplay of the $\ell_2$-data error objective and the $\ell_1$-norm constraint to arbitrarily select sparse models. Guiding this uninformed selection process with sparsity models has been precisely the center of attention over the last decade in order to improve learning performance. To this end, we alter the selection process of LASSO to explicitly leverage combinatorial sparsity models (CSMs) via the combinatorial selection and least absolute shrinkage (CLASH) operator. We provide concrete guidelines how to leverage combinatorial constraints within CLASH, and characterize CLASH's guarantees as a function of the set restricted isometry constants of the sensing matrix. Finally, our experimental results show that CLASH can outperform both LASSO and model-based compressive sensing in sparse estimation.
High Speed, Low Power Current Comparators with Hysteresis
Venue: arXiv cs.OH 2012
Year: 2012

This paper, presents a novel idea for analog current comparison which compares input signal current and reference currents with high speed, low power and well controlled hysteresis. Proposed circuit is based on current mirror and voltage latching techniques which produces rail to rail output voltage as a result of current comparison. The same design can be extended to a simple current comparator without hysteresis (or very less hysteresis), where comparator gives high accuracy (less than 50nA) and speed at the cost of moderate power consumption. The comparators are designed optimally and studied at 180nm CMOS process technology for a supply voltage of 3V.
gcodeml: A Grid-enabled Tool for Detecting Positive Selection in Biological Evolution
Venue: arXiv cs.DC 2012
Year: 2012

One of the important questions in biological evolution is to know if certain changes along protein coding genes have contributed to the adaptation of species. This problem is known to be biologically complex and computationally very expensive. It, therefore, requires efficient Grid or cluster solutions to overcome the computational challenge. We have developed a Grid-enabled tool (gcodeml) that relies on the PAML (codeml) package to help analyse large phylogenetic datasets on both Grids and computational clusters. Although we report on results for gcodeml, our approach is applicable and customisable to related problems in biology or other scientific domains.
Generalized Asynchronous Systems
Venue: arXiv cs.DC 2012
Year: 2012

The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asynchronous automata are introduced here. It is proved that the Petri nets and transition systems with independence can be considered like the distributed asynchronous automata. Time distributed asynchronous automata are defined in standard way by the map which assigns time intervals to events. It is proved that the time distributed asynchronous automata are generalized the time Petri nets and asynchronous systems.
Comparison Based Analysis of Different Cryptographic and Encryption Techniques Using Message Authentication Code (MAC) in Wireless Sensor Networks (WSN)
Venue: arXiv cs.CR 2012
Year: 2012

Wireless Sensor Networks (WSN) are becoming popular day by day, however one of the main issue in WSN is its limited resources. We have to look to the resources to create Message Authentication Code (MAC) keeping in mind the feasibility of technique used for the sensor network at hand. This research work investigates different cryptographic techniques such as symmetric key cryptography and asymmetric key cryptography. Furthermore, it compares different encryption techniques such as stream cipher (RC4), block cipher (RC2, RC5, RC6 etc) and hashing techniques (MD2, MD4, MD5, SHA, SHA1 etc). The result of our work provides efficient techniques for communicating device, by selecting different comparison matrices i.e. energy consumption, processing time, memory and expenses that satisfies both the security and restricted resources in WSN environment to create MAC.
Generalisation of language and knowledge models for corpus analysis
Venue: arXiv cs.AI 2012
Year: 2012

This paper takes new look on language and knowledge modelling for corpus linguistics. Using ideas of Chaitin, a line of argument is made against language/knowledge separation in Natural Language Processing. A simplistic model, that generalises approaches to language and knowledge, is proposed. One of hypothetical consequences of this model is Strong AI.
Performance Evaluation of AODV & DSR with Varying Pause Time & Speed Time Over TCP & CBR Connections in VANET
Venue: arXiv cs.NI 2012
Year: 2012

VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Vehicular ad hoc network is formed by cars which are called nodes; allow them to communicate with one another without using any fixed road side unit. It has some unique characteristics which make it different from other ad hoc network as well as difficult to define any exact mobility model and routing protocols because of their high mobility and changing mobility pattern. Hence performance of routing protocols can vary with the various parameters such as speed, pause time, node density and traffic scenarios. In this research paper, the performance of two on-demand routing protocols AODV & DSR has been analyzed by means of packet delivery ratio, loss packet ratio & average end-to-end delay with varying pause time, speed time and node density under TCP & CBR connection.
The Parameters For Powerline Channel Modeling
Venue: arXiv cs.IT 2012
Year: 2012

This is a support document which describes the properties of the cable and parameters of the formulas for the statistical powerline channel modeling. The cable parameters help the reader build powerline channel according to the transmission line theory. The document also presents the parameters which describe the distribution of the number of path, path magnitude, path interval and the cable loss feature of the powerline channel. By using the parameters in this document, readers can model the powerline channel according to the statistical methodology proposed.
Conflict-free graph orientations with parity constraints
Venue: arXiv cs.CG 2012
Year: 2012

It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under additional constraints. We consider two types of constraints for a multigraph G=(V,E): (1) an exact conflict constraint is an edge set C in E and a vertex v in V such that C should not equal the set of incoming edges at v; (2) a subset conflict constraint is an edge set C in E and a vertex v in V such that C should not be a subset of incoming edges at v. We show that it is NP-complete to decide whether G has an even orientation with exact or subset conflicts, for all conflict sets of size two or higher. We present efficient algorithms for computing parity constrained orientations with disjoint exact or subset conflict pairs.
Originator usage control with business process slicing
Venue: arXiv cs.SE 2012
Year: 2012

Originator Control allows information providers to define the information re-dissemination condition. Combined with usage control policy, fine-grained 'downstream usage control' can be achieved, which specifies what attributes the downstream consumers should have and how data is used. This paper discusses originator usage control, paying particular attention to enterprise-level dynamic business federations. Rather than 'pre-defining' the information re-dissemination paths, our business process slicing method 'capture' the asset derivation pattern, allowing to maintain originators' policies during the full lifecycle of assets in a collaborative context. First, we propose Service Call Graph (SCG), based on extending the System Dependency Graph, to describe dependencies among partners. When SCG (and corresponding 'service call tuple' list) is built for a business process, it is analyzed to group partners into sub-contexts, according to their dependency relations. Originator usage control can be achieved focusing on each sub-context, by examining downstream consumers' security profiles with upstream asset providers' policies. Second, for analyzing SCG, we propose two 'slicing' strategies, namely 'asset-based' and 'request-based' slicing, to deal with the scenarios of both 'pre-processing' a business process scripts and 'on-the-fly' analyzing service compositions. Last, our implementation work involves a 'context manager' service for processing business processes defined in WS-BPEL. It can be composed with our former proposed policy negotiation and aggregation services to provide policy-based end-to-end security management. We also make experiments based on processing the sample processes that come with 'WS-BPEL2.0' specification.
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
Venue: arXiv cs.DS 2012
Year: 2012

We study a character-based phylogeny reconstruction problem when an incomplete set of data is given. More specifically, we consider the situation under the directed perfect phylogeny assumption with binary characters in which for some species the states of some characters are missing. Our main object is to give an efficient algorithm to enumerate (or list) all perfect phylogenies that can be obtained when the missing entries are completed. While a simple branch-and-bound algorithm (B&B) shows a theoretically good performance, we propose another approach based on a zero-suppressed binary decision diagram (ZDD). Experimental results on randomly generated data exhibit that the ZDD approach outperforms B&B. We also prove that counting the number of phylogenetic trees consistent with a given data is #P-complete, thus providing an evidence that an efficient random sampling seems hard.
On quantum information
Venue: arXiv cs.IT 2012
Year: 2012

We investigate the following generalisation of the entropy of quantum measurement. Let H be an infinite-dimensional separable Hilbert space with a 'density' operator ρ, tr ρ=1. Let I(P)\in R be defined for any partition P = (P_1,...,P_m), P_1+ ... +P_m=1_H, P_i \in proj H$ and let I(P_i Qj, i \leq m, j \leq n) = I(P) + I(Q) for Q =(Q_1,..., Q_n), \sum Q_j = 1_H and P_iQ_j = Q_j P_i, tr ρ P_iQ_j = tr ρ P_i tr ρ Q_j (P, Q are physically independent). Assuming some continuity properties we give a general form of generalised information I.
Peer to Peer Networks Management Survey
Venue: arXiv cs.NI 2012
Year: 2012

Peer-to-Peer systems are based on the concept of resources localization and mutualisation in dynamic context. In specific environment such as mobile networks, characterized by high variability and dynamicity of network conditions and performances, where nodes can join and leave the network dynamically, resources reliability and availability constitute a critical issue. The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network. Locating a resource or service efficiently is one of the most important issues related to peer-to-peer networks. The objective of a search mechanism is to successfully locate resources while incurring low overhead and low delay. This paper presents a survey on P2P networks management: classification, applications, platforms, simulators and security.
A Model for Remote Access and Protection of Smartphones using Short Message Service
Venue: arXiv cs.CR 2012
Year: 2012

The smartphone usage among people is increasing rapidly. With the phenomenal growth of smartphone use, smartphone theft is also increasing. This paper proposes a model to secure smartphones from theft as well as provides options to access a smartphone through other smartphone or a normal mobile via Short Message Service. This model provides option to track and secure the mobile by locking it. It also provides facilities to receive the incoming call and sms information to the remotely connected device and enables the remote user to control the mobile through SMS. The proposed model is validated by the prototype implementation in Android platform. Various tests are conducted in the implementation and the results are discussed.
Gaussian Process Topic Models
Venue: arXiv cs.LG 2012
Year: 2012

We introduce Gaussian Process Topic Models (GPTMs), a new family of topic models which can leverage a kernel among documents while extracting correlated topics. GPTMs can be considered a systematic generalization of the Correlated Topic Models (CTMs) using ideas from Gaussian Process (GP) based embedding. Since GPTMs work with both a topic covariance matrix and a document kernel matrix, learning GPTMs involves a novel component-solving a suitable Sylvester equation capturing both topic and document dependencies. The efficacy of GPTMs is demonstrated with experiments evaluating the quality of both topic modeling and embedding.
Timeline: A Dynamic Hierarchical Dirichlet Process Model for Recovering Birth/Death and Evolution of Topics in Text Stream
Venue: arXiv cs.IR 2012
Year: 2012

Topic models have proven to be a useful tool for discovering latent structures in document collections. However, most document collections often come as temporal streams and thus several aspects of the latent structure such as the number of topics, the topics' distribution and popularity are time-evolving. Several models exist that model the evolution of some but not all of the above aspects. In this paper we introduce infinite dynamic topic models, iDTM, that can accommodate the evolution of all the aforementioned aspects. Our model assumes that documents are organized into epochs, where the documents within each epoch are exchangeable but the order between the documents is maintained across epochs. iDTM allows for unbounded number of topics: topics can die or be born at any epoch, and the representation of each topic can evolve according to a Markovian dynamics. We use iDTM to analyze the birth and evolution of topics in the NIPS community and evaluated the efficacy of our model on both simulated and real datasets with favorable outcome.
An Online Learning-based Framework for Tracking
Venue: arXiv cs.LG 2012
Year: 2012

We study the tracking problem, namely, estimating the hidden state of an object over time, from unreliable and noisy measurements. The standard framework for the tracking problem is the generative framework, which is the basis of solutions such as the Bayesian algorithm and its approximation, the particle filters. However, these solutions can be very sensitive to model mismatches. In this paper, motivated by online learning, we introduce a new framework for tracking. We provide an efficient tracking algorithm for this framework. We provide experimental results comparing our algorithm to the Bayesian algorithm on simulated data. Our experiments show that when there are slight model mismatches, our algorithm outperforms the Bayesian algorithm.
Distribution over Beliefs for Memory Bounded Dec-POMDP Planning
Venue: arXiv cs.AI 2012
Year: 2012

We propose a new point-based method for approximate planning in Dec-POMDP which outperforms the state-of-the-art approaches in terms of solution quality. It uses a heuristic estimation of the prior probability of beliefs to choose a bounded number of policy trees: this choice is formulated as a combinatorial optimisation problem minimising the error induced by pruning.