OpenRaiser/Intern-Atlas huggingface dataset:
Simplified Coalgebraic Trace Equivalence
Venue: arXiv cs.LO 2014
Year: 2014

The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity to coarse-grained ones such as trace equivalence. The theory of concurrent systems at large has benefited from developments in coalgebra, which has enabled uniform definitions and results that provide a common umbrella for seemingly disparate system types including non-deterministic, weighted, probabilistic, and game-based systems. In particular, there has been some success in identifying a generic coalgebraic theory of bisimulation that matches known definitions in many concrete cases. The situation is currently somewhat less settled regarding trace equivalence. A number of coalgebraic approaches to trace equivalence have been proposed, none of which however cover all cases of interest; notably, all these approaches depend on explicit termination, which is not always imposed in standard systems, e.g. LTS. Here, we discuss a joint generalization of these approaches based on embedding functors modelling various aspects of the system, such as transition and braching, into a global monad; this approach appears to cover all cases considered previously and some additional ones, notably standard LTS and probabilistic labelled transition systems.
Genetic Stereo Matching Algorithm with Fuzzy Fitness
Venue: arXiv cs.CV 2014
Year: 2014

This paper presents a genetic stereo matching algorithm with fuzzy evaluation function. The proposed algorithm presents a new encoding scheme in which a chromosome is represented by a disparity matrix. Evolution is controlled by a fuzzy fitness function able to deal with noise and uncertain camera measurements, and uses classical evolutionary operators. The result of the algorithm is accurate dense disparity maps obtained in a reasonable computational time suitable for real-time applications as shown in experimental results.
Evaluation of a Conversation Management Toolkit for Multi Agent Programming
Venue: arXiv cs.MA 2014
Year: 2014

The Agent Conversation Reasoning Engine (ACRE) is intended to aid agent developers to improve the management and reliability of agent communication. To evaluate its effectiveness, a problem scenario was created that could be used to compare code written with and without the use of ACRE by groups of test subjects. This paper describes the requirements that the evaluation scenario was intended to meet and how these motivated the design of the problem. Two experiments were conducted with two separate sets of students and their solutions were analysed using a combination of simple objective metrics and subjective analysis. The analysis suggested that ACRE by default prevents some common problems arising that would limit the reliability and extensibility of conversation-handling code. As ACRE has to date been integrated only with the Agent Factory multi agent framework, it was necessary to verify that the problems identified are not unique to that platform. Thus a comparison was made with best practice communication code written for the Jason platform, in order to demonstrate the wider applicability of a system such as ACRE.
Generalized Hamming Weights of Irreducible Cyclic Codes
Venue: arXiv cs.IT 2014
Year: 2014

The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23] in 1991. In this paper two general formulas on $d_r(C)$ for irreducible cyclic codes are presented by using Gauss sums and the weight hierarchy $\{d_1(C), d_2(C), \ldots, d_k(C)\}$ $(k=\dim C)$ are completely determined for several cases.
A Study on Placement of Social Buttons in Web Pages
Venue: arXiv cs.HC 2014
Year: 2014

With the explosion of social media in the last few years, web pages nowadays include different social network buttons where users can express if they support or recommend content. Those social buttons are very visual and their presentations, along with the counters, mark the importance of the social network and the interest on the content. In this paper, we analyze the presence of four types of social buttons (Facebook, Twitter, Google+1, and LinkedIn) in a large collection of web pages that we tracked over a period of time. We report on the distribution and counts along with some characteristics per domain. Finally, we outline some research directions.
On Coupled Logical Bisimulation for the Lambda-Calculus
Venue: arXiv cs.LO 2014
Year: 2014

We study coupled logical bisimulation (CLB) to reason about contextual equivalence in the lambda-calculus. CLB originates in a work by Dal Lago, Sangiorgi and Alberti, as a tool to reason about a lambda-calculus with probabilistic constructs. We adapt the original definition to the pure lambda-calculus. We develop the metatheory of CLB in call-by-name and in call-by-value, and draw comparisons with applicative bisimulation (due to Abramsky) and logical bisimulation (due to Sangiorgi, Kobayashi and Sumii). We also study enhancements of the bisimulation method for CLB by developing a theory of up-to techniques for cases where the functional corresponding to bisimulation is not necessarily monotone.
Cyclic Delay Transmission for Vector OFDM Systems
Venue: arXiv cs.IT 2014
Year: 2014

Single antenna vector OFDM (V-OFDM) system has been proposed and investigated in the past. It contains the conventional OFDM and the single carrier frequency domain equalizer (SC-FDE) as two special cases and is flexible to choose any number of symbols in intersymbol interference (ISI) by choosing a proper vector size. In this paper, we develop cyclic delay diversity (CDD) transmission for V-OFDM when there are multiple transmit antennas (CDD-V-OFDM). Similar to CDD-OFDM systems, CDD-V-OFDM can also collect both spatial and multipath diversities. Since V-OFDM first converts a single input single output (SISO) ISI channel to a multi-input and multi-output (MIMO) ISI channel of order/length $K$ times less, where $K$ is the vector size, for a given bandwidth, the CDD-V-OFDM can accommodate $K$ times more transmit antennas than the CDD-OFDM does to collect all the spatial and multipath diversities. This property will specially benefit a massive MIMO system. We show that with the linear MMSE equalizer at each subcarrier, the CDD-V-OFDM achieves diversity order $d_{\text{CDD-V-OFDM}}^{\text{MMSE}} = \min \{ \lfloor 2^{-R}K \rfloor, N_t L \} +1$, where $R$ is the transmission rate, $N_t$ is the number of transmit antennas, and $L$ is the ISI channel length between each transmit and receive antenna pair. Simulations are presented to illustrate our theory.
Heterogeneous Cloud Radio Access Networks: A New Perspective for Enhancing Spectral and Energy Efficiencies
Venue: arXiv cs.NI 2014
Year: 2014

To mitigate the severe inter-tier interference and enhance limited cooperative gains resulting from the constrained and non-ideal transmissions between adjacent base stations in heterogeneous networks (HetNets), heterogeneous cloud radio access networks (H-CRANs) are proposed as cost-efficient potential solutions through incorporating the cloud computing into HetNets. In this article, state-of-the-art research achievements and challenges on H-CRANs are surveyed. In particular, we discuss issues of system architectures, spectral and energy efficiency performances, and promising key techniques. A great emphasis is given towards promising key techniques in H-CRANs to improve both spectral and energy efficiencies, including cloud computing based coordinated multi-point transmission and reception, large-scale cooperative multiple antenna, cloud computing based cooperative radio resource management, and cloud computing based self-organizing network in the cloud converging scenarios. The major challenges and open issues in terms of theoretical performance with stochastic geometry, fronthaul constrained resource allocation, and standard development that may block the promotion of H-CRANs are discussed as well.
Signaling in Quasipolynomial time
Venue: arXiv cs.GT 2014
Year: 2014

Strategic interactions often take place in an environment rife with uncertainty. As a result, the equilibrium of a game is intimately related to the information available to its players. The \emph{signaling problem} abstracts the task faced by an informed "market maker", who must choose how to reveal information in order to effect a desirable equilibrium. In this paper, we consider two fundamental signaling problems: one for abstract normal form games, and the other for single item auctions. For the former, we consider an abstract class of objective functions which includes the social welfare and weighted combinations of players' utilities, and for the latter we restrict our attention to the social welfare objective and to signaling schemes which are constrained in the number of signals used. For both problems, we design approximation algorithms for the signaling problem which run in quasi-polynomial time under various conditions, extending and complementing the results of various recent works on the topic. Underlying each of our results is a "meshing scheme" which effectively overcomes the "curse of dimensionality" and discretizes the space of "essentially different" posterior beliefs -- in the sense of inducing "essentially different" equilibria. This is combined with an algorithm for optimally assembling a signaling scheme as a convex combination of such beliefs. For the normal form game setting, the meshing scheme leads to a convex partition of the space of posterior beliefs and this assembly procedure is reduced to a linear program, and in the auction setting the assembly procedure is reduced to submodular function maximization.
Risk Assessment Algorithm in Wireless Sensor Networks using Beta Distribution
Venue: arXiv cs.CR 2014
Year: 2014

This paper introduces the Beta distribution as a novel technique to weight direct and indirect trust and assessing the risk in wireless sensor networks. This paper also reviews the trust factors, which play a major role in building trust in wireless sensor networks and explains the dynamic aspects of trust. This is an extension of a previous work done by the authors using a new approach to assess risk. Simulation results related to the previous work and to the new approach introduced in this paper are also presented for easy comparison.
Duality for Modules and Applications to Decoding Linear Codes over Finite Commutative Rings
Venue: arXiv cs.IT 2014
Year: 2014

Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by introducing the control matrix.
Epsilon-Nets for Halfspaces Revisited
Venue: arXiv cs.CG 2014
Year: 2014

Given a set $P$ of $n$ points in $\mathbb{R}^3$, we show that, for any $\varepsilon >0$, there exists an $\varepsilon$-net of $P$ for halfspace ranges, of size $O(1/\varepsilon)$. We give five proofs of this result, which are arguably simpler than previous proofs \cite{msw-hnlls-90, cv-iaags-07, pr-nepen-08}. We also consider several related variants of this result, including the case of points and pseudo-disks in the plane.
Quality-of-Data for Consistency Levels in Geo-replicated Cloud Data Stores
Venue: arXiv cs.DC 2014
Year: 2014

Cloud computing has recently emerged as a key technology to provide individuals and companies with access to remote computing and storage infrastructures. In order to achieve highly-available yet high-performing services, cloud data stores rely on data replication. However, providing replication brings with it the issue of consistency. Given that data are replicated in multiple geographically distributed data centers, and to meet the increasing requirements of distributed applications, many cloud data stores adopt eventual consistency and therefore allow to run data intensive operations under low latency. This comes at the cost of data staleness. In this paper, we prioritize data replication based on a set of flexible data semantics that can best suit all types of Big Data applications, avoiding overloading both network and systems during large periods of disconnection or partitions in the network. Therefore we integrated these data semantics into the core architecture of a well-known NoSQL data store (e.g., HBase), which leverages a three-dimensional vector-field model (regarding timeliness, number of pending updates and divergence bounds) to provision data selectively in an on-demand fashion to applications. This enhances the former consistency model by providing a number of required levels of consistency to different applications such as, social networks or e-commerce sites, where priority of updates also differ. In addition, our implementation of the model into HBase allows updates to be tagged and grouped atomically in logical batches, akin to transactions, ensuring atomic changes and correctness of updates as they are propagated.
Applied Neural Cross-Correlation into the Curved Trajectory Detection Process for Braitenberg Vehicles
Venue: arXiv cs.RO 2014
Year: 2014

Curved Trajectory Detection (CTD) process could be considered among high-level planned capabilities for cognitive agents, has which been acquired under aegis of embedded artificial spiking neuronal circuits. In this paper, hard-wired implementation of the cross-correlation, as the most common comparison-driven scheme for both natural and artificial bionic constructions named Depth Detection Module(DDM), has been taken into account. It is manifestation of efficient handling upon epileptic seizures due to application of both excitatory and inhibitory connections within the circuit structure. Presented traditional analytic approach of the cross-correlation computation with regard to our neural mapping technique and the acquired traced precision have been turned into account for coherent accomplishments of the aforementioned design in perspective of the desired accuracy upon high-level cognitive reactions. Furthermore, the proposed circuit could be fitted into the scalable neuronal network of the CTD, properly. Simulated denouements have been captured based on the computational model of PIONEER mobile robot to verify characteristics of the module, in detail.
The Impact of e-Politician on the Adoption of e-Service: Perceptions from a sample of South African Municipal IT Heads
Venue: arXiv cs.CY 2014
Year: 2014

The purpose of this study is to establish whether the use of information technology (IT) by elected municipal representatives, for constituency work, emboldens the adoption of e-service in municipals of a developing country. The research data was obtained through the completion of a questionnaire by a sample of respondents who serve as authorities of IT in South African municipals. The findings from both descriptive and inferential data analysis of collected data confirm that the use of IT by elected municipal representatives for constituency work impacts the adoption of e-service in municipals. Furthermore, the use of IT by elected municipal representatives for constituency work correlated with both e-service laws and e-service security. This study contributes to a better understanding of choices needed when planning for the adoption of e-service initiatives in municipals of developing countries. Given that 87.2% of respondents are aware of a high access to telephone mobile, a further research is needed to clarify why most elected municipal representatives of a developing country choose not to exploit IT for their constituency work, and similarly why municipals of a developing country do not exploit IT to provide services.
Translucent Players: Explaining Cooperative Behavior in Social Dilemmas
Venue: arXiv cs.GT 2014
Year: 2014

In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is particularly puzzling. Here we propose a novel approach to explain cooperation, assuming what Halpern and Pass (2013) call "translucent players". Typically, players are assumed to be "opaque", in the sense that a deviation by one player does not affect the strategies used by other players. But a player may believe that if he switches from one strategy to another, the fact that he chooses to switch may be visible to the other players. For example, if he chooses to defect in Prisoner's Dilemma, the other player may sense his guilt. We show that by assuming translucent players, we can recover many of the regularities observed in human behavior in well-studied games such as Prisoner's Dilemma, Traveler's Dilemma, Bertrand Competition, and the Public Goods game.
Guiding Ebola Patients to Suitable Health Facilities: An SMS-based Approach
Venue: arXiv cs.CY 2014
Year: 2014

We propose to utilize mobile phone technology as a vehicle for people to report their symptoms and to receive immediate feedback about the health services readily available, and for predicting spatial disease outbreak risk. Once symptoms are extracted from the patients text message, they undergo complex classification, pattern matching and prediction to recommend the nearest suitable health service. The added benefit of this approach is that it enables health care facilities to anticipate arrival of new potential Ebola cases.
A Game Theoretic Model for Network Virus Protection
Venue: arXiv cs.GT 2014
Year: 2014

The network virus propagation is influenced by various factors, and some of them are neglected in most of the existed models in the literature. In this paper, we study the network virus propagation based on the the epidemiological viewpoint. We assume that nodes can be equipped with protection against virus and the security of a node depends not only on his protection strategy but also by those chosen by other nodes in the network. A crucial aspect is whether owners of device, e.g., either smartphones, machines or tablets, are willing to be equipped to protect themselves or to take the risk to be contaminated in order to avoid the payment for a new antivirus. We model the interaction between nodes as a non-cooperative games where the node has two strategies: either to update the antivirus or not. To this aim, we provide a full characterization of the equilibria of the game and we investigate the impact of the price of protection on the equilibrium as well as the efficiency of the protection at equilibrium. Further we consider more realistic scenarios in which the dynamic of sources that disseminate the virus, evolves as function of the popularity of virus. In this work, the interest in the virus by sources evolves under the Influence Linear Threshold (HILT) model.
A Time-Triggered Constraint-Based Calculus for Avionic Systems
Venue: arXiv cs.SE 2014
Year: 2014

The Integrated Modular Avionics (IMA) architec- ture and the Time-Triggered Ethernet (TTEthernet) network have emerged as the key components of a typical architecture model for recent civil aircrafts. We propose a real-time constraint-based calculus targeted at the analysis of such concepts of avionic embedded systems. We show our framework at work on the modelisation of both the (IMA) architecture and the TTEthernet network, illustrating their behavior by the well-known Flight Management System (FMS).
A graph Laplacian regularization for hyperspectral data unmixing
Venue: arXiv cs.CV 2014
Year: 2014

This paper introduces a graph Laplacian regularization in the hyperspectral unmixing formulation. The proposed regularization relies upon the construction of a graph representation of the hyperspectral image. Each node in the graph represents a pixel's spectrum, and edges connect spectrally and spatially similar pixels. The proposed graph framework promotes smoothness in the estimated abundance maps and collaborative estimation between homogeneous areas of the image. The resulting convex optimization problem is solved using the Alternating Direction Method of Multipliers (ADMM). A special attention is given to the computational complexity of the algorithm, and Graph-cut methods are proposed in order to reduce the computational burden. Finally, simulations conducted on synthetic data illustrate the effectiveness of the graph Laplacian regularization with respect to other classical regularizations for hyperspectral unmixing.
The Foundational Cryptography Framework
Venue: arXiv cs.PL 2014
Year: 2014

We present the Foundational Cryptography Framework (FCF) for developing and checking complete proofs of security for cryptographic schemes within a proof assistant. This is a general-purpose framework that is capable of modeling and reasoning about a wide range of cryptographic schemes, security definitions, and assumptions. Security is proven in the computational model, and the proof provides concrete bounds as well as asymptotic conclusions. FCF provides a language for probabilistic programs, a theory that is used to reason about programs, and a library of tactics and definitions that are useful in proofs about cryptography. The framework is designed to leverage fully the existing theory and capabilities of the Coq proof assistant in order to reduce the effort required to develop proofs.
Refined Particle Swarm Intelligence Method for Abrupt Motion Tracking
Venue: arXiv cs.CV 2014
Year: 2014

Conventional tracking solutions are not feasible in handling abrupt motion as they are based on smooth motion assumption or an accurate motion model. Abrupt motion is not subject to motion continuity and smoothness. To assuage this, we deem tracking as an optimisation problem and propose a novel abrupt motion tracker that based on swarm intelligence - the SwaTrack. Unlike existing swarm-based filtering methods, we first of all introduce an optimised swarm-based sampling strategy to tradeoff between the exploration and exploitation of the search space in search for the optimal proposal distribution. Secondly, we propose Dynamic Acceleration Parameters (DAP) allow on the fly tuning of the best mean and variance of the distribution for sampling. Such innovating idea of combining these strategies in an ingenious way in the PSO framework to handle the abrupt motion, which so far no existing works are found. Experimental results in both quantitative and qualitative had shown the effectiveness of the proposed method in tracking abrupt motions.
Zero-Shot Object Recognition System based on Topic Model
Venue: arXiv cs.CV 2014
Year: 2014

Object recognition systems usually require fully complete manually labeled training data to train the classifier. In this paper, we study the problem of object recognition where the training samples are missing during the classifier learning stage, a task also known as zero-shot learning. We propose a novel zero-shot learning strategy that utilizes the topic model and hierarchical class concept. Our proposed method advanced where cumbersome human annotation stage (i.e. attribute-based classification) is eliminated. We achieve comparable performance with state-of-the-art algorithms in four public datasets: PubFig (67.09%), Cifar-100 (54.85%), Caltech-256 (52.14%), and Animals with Attributes (49.65%) when unseen classes exist in the classification task.