OpenRaiser/Intern-Atlas huggingface dataset:
Max-min Fair Wireless Energy Transfer for Secure Multiuser Communication Systems
Venue: arXiv cs.IT 2014
Year: 2014

This paper considers max-min fairness for wireless energy transfer in a downlink multiuser communication system. Our resource allocation design maximizes the minimum harvested energy among multiple multiple-antenna energy harvesting receivers (potential eavesdroppers) while providing quality of service (QoS) for secure communication to multiple single-antenna information receivers. In particular, the algorithm design is formulated as a non-convex optimization problem which takes into account a minimum required signal-to-interference-plus-noise ratio (SINR) constraint at the information receivers and a constraint on the maximum tolerable channel capacity achieved by the energy harvesting receivers for a given transmit power budget. The proposed problem formulation exploits the dual use of artificial noise generation for facilitating efficient wireless energy transfer and secure communication. A semidefinite programming (SDP) relaxation approach is exploited to obtain a global optimal solution of the considered problem. Simulation results demonstrate the significant performance gain in harvested energy that is achieved by the proposed optimal scheme compared to two simple baseline schemes.
Concurrency and Scalability versus Fragmentation and Compaction with Compact-fit
Venue: arXiv cs.PL 2014
Year: 2014

We study, formally and experimentally, the trade-off in temporal and spatial overhead when managing contiguous blocks of memory using the explicit, dynamic and real-time heap management system Compact-fit (CF). The key property of CF is that temporal and spatial overhead can be bounded, related, and predicted in constant time through the notion of partial and incremental compaction. Partial compaction determines the maximally tolerated degree of memory fragmentation. Incremental compaction of objects, introduced here, determines the maximal amount of memory involved in any, logically atomic, portion of a compaction operation. We explore CF's potential application space on (1) multiprocessor and multicore systems as well as on (2) memory-constrained uniprocessor systems. For (1), we argue that little or no compaction is likely to avoid the worst case in temporal as well as spatial overhead but also observe that scalability only improves by a constant factor. Scalability can be further improved significantly by reducing overall data sharing through separate instances of Compact-fit. For (2), we observe that incremental compaction can effectively trade-off throughput and memory fragmentation for lower latency.
Threats Management Throughout the Software Service Life-Cycle
Venue: arXiv cs.SE 2014
Year: 2014

Software services are inevitably exposed to a fluctuating threat picture. Unfortunately, not all threats can be handled only with preventive measures during design and development, but also require adaptive mitigations at runtime. In this paper we describe an approach where we model composite services and threats together, which allows us to create preventive measures at design-time. At runtime, our specification also allows the service runtime environment (SRE) to receive alerts about active threats that we have not handled, and react to these automatically through adaptation of the composite service. A goal-oriented security requirements modelling tool is used to model business-level threats and analyse how they may impact goals. A process flow modelling tool, utilising Business Process Model and Notation (BPMN) and standard error boundary events, allows us to define how threats should be responded to during service execution on a technical level. Throughout the software life-cycle, we maintain threats in a centralised threat repository. Re-use of these threats extends further into monitoring alerts being distributed through a cloud-based messaging service. To demonstrate our approach in practice, we have developed a proof-of-concept service for the Air Traffic Management (ATM) domain. In addition to the design-time activities, we show how this composite service duly adapts itself when a service component is exposed to a threat at runtime.
Actor Network Procedures as Psi-calculi for Security Ceremonies
Venue: arXiv cs.CR 2014
Year: 2014

The actor network procedures of Pavlovic and Meadows are a recent graphical formalism developed for describing security ceremonies and for reasoning about their security properties. The present work studies the relations of the actor network procedures (ANP) to the recent psi-calculi framework. Psi-calculi is a parametric formalism where calculi like spi- or applied-pi are found as instances. Psi-calculi are operational and largely non-graphical, but have strong foundation based on the theory of nominal sets and process algebras. One purpose of the present work is to give a semantics to ANP through psi-calculi. Another aim was to give a graphical language for a psi-calculus instance for security ceremonies. At the same time, this work provides more insight into the details of the ANPs formalization and the graphical representation.
A Graphical Adversarial Risk Analysis Model for Oil and Gas Drilling Cybersecurity
Venue: arXiv cs.CR 2014
Year: 2014

Oil and gas drilling is based, increasingly, on operational technology, whose cybersecurity is complicated by several challenges. We propose a graphical model for cybersecurity risk assessment based on Adversarial Risk Analysis to face those challenges. We also provide an example of the model in the context of an offshore drilling rig. The proposed model provides a more formal and comprehensive analysis of risks, still using the standard business language based on decisions, risks, and value.
Entropy Computation of Document Images in Run-Length Compressed Domain
Venue: arXiv cs.CV 2014
Year: 2014

Compression of documents, images, audios and videos have been traditionally practiced to increase the efficiency of data storage and transfer. However, in order to process or carry out any analytical computations, decompression has become an unavoidable pre-requisite. In this research work, we have attempted to compute the entropy, which is an important document analytic directly from the compressed documents. We use Conventional Entropy Quantifier (CEQ) and Spatial Entropy Quantifiers (SEQ) for entropy computations [1]. The entropies obtained are useful in applications like establishing equivalence, word spotting and document retrieval. Experiments have been performed with all the data sets of [1], at character, word and line levels taking compressed documents in run-length compressed domain. The algorithms developed are computational and space efficient, and results obtained match 100% with the results reported in [1].
Expression driven Trignometric based Procedural Animation of Quadrupeds
Venue: arXiv cs.GR 2014
Year: 2014

This research paper addresses the problem of generating involuntary and precise animation of quadrupeds with automatic rigging system of various character types. The technique proposed through this research is based on a two tier animation control curve with base simulation being driven through dynamic mathematical model using procedural algorithm and the top layer with a custom user controlled animation provided with intuitive Graphical User Interface (GUI). The character rig is based on forward and inverse kinematics driven through trigonometric based motion equations. The User is provided with various manipulators and attributes to control and handle the locomotion gaits of the characters and choose between various types of simulated motions from walking, running, trotting, ambling and galloping with complete custom controls to easily extend the base simulation as per requirements.
Multiple-Tree Push-based Overlay Streaming
Venue: arXiv cs.NI 2014
Year: 2014

Multiple-Tree Overlay Streaming has attracted a great amount of attention from researchers in the past years. Multiple-tree streaming is a promising alternative to single-tree streaming in terms of node dynamics and load balancing, among others, which in turn addresses the perceived video quality by the streaming user on node dynamics or when heterogeneous nodes join the network. This article presents a comprehensive survey of the different aproaches and techniques used in this research area. In this paper we identify node-disjointness as the property most approaches aim to achieve. We also present an alternative technique which does not try to achieve this but does local optimizations aiming global optimizations. Thus, we identify this property as not being absolute necessary for creating robust and heterogeneous multi-tree overlays. We identify two main design goals: robustness and support for heterogeneity, and classify existing approaches into these categories as their main focus.
Bond theory for pentapods and hexapods
Venue: arXiv cs.RO 2014
Year: 2014

This paper deals with the old and classical problem of determining necessary conditions for the overconstrained mobility of some mechanical device. In particular, we show that the mobility of pentapods/hexapods implies either a collinearity condition on the anchor points, or a geometric condition on the normal projections of base and platform points. The method is based on a specific compactification of the group of direct isometries of $\mathbb{R}^3$.
Two-sources Randomness Extractors for Elliptic Curves
Venue: arXiv cs.CR 2014
Year: 2014

This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields $K$, where $K$ can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which take in input two random points from two differents subgroups. In other words, for a ginven elliptic curve $E$ defined over a finite field $\mathbb{F}_q$ and two random points $P \in \mathcal{P}$ and $Q\in \mathcal{Q}$, where $\mathcal{P}$ and $\mathcal{Q}$ are two subgroups of $E(\mathbb{F}_q)$, our function extracts the least significant bits of the abscissa of the point $P\oplus Q$ when $q$ is a large prime, and the $k$-first $\mathbb{F}_p$ coefficients of the asbcissa of the point $P\oplus Q$ when $q = p^n$, where $p$ is a prime greater than $5$. We show that the extracted bits are close to uniform. Our construction extends some interesting randomness extractors for elliptic curves, namely those defined in \cite{op} and \cite{ciss1,ciss2}, when $\mathcal{P} = \mathcal{Q}$. The proposed constructions can be used in any cryptographic schemes which require extraction of random bits from two sources over elliptic curves, namely in key exchange protole, design of strong pseudo-random number generators, etc.
Distributed Joint Source and Channel Coding with Low-Density Parity-Check Codes
Venue: arXiv cs.IT 2014
Year: 2014

Low-density parity-check (LDPC) codes with the parity-based approach for distributed joint source channel coding (DJSCC) with decoder side information is described in this paper. The parity-based approach is theoretical limit achievable. Different edge degree distributions are used for source variable nodes and parity variable nodes. Particularly, the codeword-averaged density evolution (CADE) is presented for asymmetrically correlated nonuniform sources over the asymmetric memoryless transmission channel. Extensive simulations show that the splitting of variable nodes can improve the coding efficiency of suboptimal codes and lower the error floor.
Gesture Based Interaction NUI: An Overview
Venue: arXiv cs.HC 2014
Year: 2014

Touch,face,voice recognition and movement sensors all are part of an emerging field of computing often called natural user interface, or NUI. Interacting with technology in these humanistic ways is no longer limited to high tech secret agents. Gesture Touch, face, voice recognition and movement sensors all are part of an emerging field of computing often called natural user interface, or NUI. Interacting with technology in these humanistic ways is no longer limited to high tech secret agents. Gesture recognition is the process by which gestures formed by a user are made known to the system. In completely immersive VR environments, the keyboard is generally not included, Technology incorporates face, voice, gesture, and object recognition to give users a variety of ways to interact with the console, all without needing a controller. This paper focuses on the emerging way of human computer interaction, Gesture recognition concept and gesture types.
A Geometrical-Based Throughput Bound Analysis for Device-to-Device Communications in Cellular Networks
Venue: arXiv cs.NI 2014
Year: 2014

Device-to-device (D2D) communications in cellular networks are promising technologies for improving network throughput, spectrum efficiency, and transmission delay. In this paper, we first introduce the concept of guard distance to explore a proper system model for enabling multiple concurrent D2D pairs in the same cell. Considering the Signal to Interference Ratio (SIR) requirements for both macro-cell and D2D communications, a geometrical method is proposed to obtain the guard distances from a D2D user equipment (DUE) to the base station (BS), to the transmitting cellular user equipment (CUE), and to other communicating D2D pairs, respectively, when the uplink resource is reused. By utilizing the guard distances, we then derive the bounds of the maximum throughput improvement provided by D2D communications in a cell. Extensive simulations are conducted to demonstrate the impact of different parameters on the optimal maximum throughput. We believe that the obtained results can provide useful guidelines for the deployment of future cellular networks with underlaying D2D communications.
A New Dynamic Bandwidth Allocation Protocol with Quality of Service in Ethernet-based Passive Optical Networks
Venue: arXiv cs.NI 2014
Year: 2014

Ethernet-based Passive optical network (E-PON) is the key for next generation access networks. It must have the property of high efficiency, low cost, and support quality of service (QoS). We present a novel media access control (MAC) protocol that maximizes network efficiency by using dynamic bandwidth allocation (DBA) algorithm suitable for E-PON. This protocol minimizes packet delay and delay variation for high priority traffic to ensure QoS. Simulation results show excellent network throughput. Simulation results also show low packet delay and packet delay variation for high priority traffic compare with traditional MAC protocol of E-PON. When the network performs ranging, this protocol ensures zero interruption of high priority traffic, such as audio or video applications.
Yet another algorithm to compute the nonlinearity of a Boolean function
Venue: arXiv cs.IT 2014
Year: 2014

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and computing its evaluation vector requires a worst-case complexity of $O(n2^n)$ integer operations. This way, with a different approach, we reach the same complexity of established algorithms, such as those based on the fast Walsh transform.
Energy and Latency Aware Application Mapping Algorithm & Optimization for Homogeneous 3D Network on Chip
Venue: arXiv cs.OH 2014
Year: 2014

Energy efficiency is one of the most critical issue in design of System on Chip. In Network On Chip (NoC) based system, energy consumption is influenced dramatically by mapping of Intellectual Property (IP) which affect the performance of the system. In this paper we test the antecedently extant proposed algorithms and introduced a new energy proficient algorithm stand for 3D NoC architecture. In addition a hybrid method has also been implemented using bioinspired optimization (particle swarm optimization) technique. The proposed algorithm has been implemented and evaluated on randomly generated benchmark and real life application such as MMS, Telecom and VOPD. The algorithm has also been tested with the E3S benchmark and has been compared with the existing algorithm (spiral and crinkle) and has shown better reduction in the communication energy consumption and shows improvement in the performance of the system. Comparing our work with spiral and crinkle, experimental result shows that the average reduction in communication energy consumption is 19% with spiral and 17% with crinkle mapping algorithms, while reduction in communication cost is 24% and 21% whereas reduction in latency is of 24% and 22% with spiral and crinkle. Optimizing our work and the existing methods using bio-inspired technique and having the comparison among them an average energy reduction is found to be of 18% and 24%.
Modelling View-count Dynamics in YouTube
Venue: arXiv cs.SI 2014
Year: 2014

The goal of this paper is to study the behaviour of view-count in YouTube. We first propose several bio-inspired models for the evolution of the view-count of YouTube videos. We show, using a large set of empirical data, that the view-count for 90% of videos in YouTube can indeed be associated to at least one of these models, with a Mean Error which does not exceed 5%. We derive automatic ways of classifying the view-count curve into one of these models and of extracting the most suitable parameters of the model. We study empirically the impact of videos' popularity and category on the evolution of its view-count. We finally use the above classification along with the automatic parameters extraction in order to predict the evolution of videos' view-count.
RANCOR: Non-Linear Image Registration with Total Variation Regularization
Venue: arXiv cs.CV 2014
Year: 2014

Optimization techniques have been widely used in deformable registration, allowing for the incorporation of similarity metrics with regularization mechanisms. These regularization mechanisms are designed to mitigate the effects of trivial solutions to ill-posed registration problems and to otherwise ensure the resulting deformation fields are well-behaved. This paper introduces a novel deformable registration algorithm, RANCOR, which uses iterative convexification to address deformable registration problems under total-variation regularization. Initial comparative results against four state-of-the-art registration algorithms are presented using the Internet Brain Segmentation Repository (IBSR) database.
Bypassing Cloud Providers' Data Validation to Store Arbitrary Data
Venue: arXiv cs.NI 2014
Year: 2014

A fundamental Software-as-a-Service (SaaS) characteristic in Cloud Computing is to be application-specific; depending on the application, Cloud Providers (CPs) restrict data formats and attributes allowed into their servers via a data validation process. An ill-defined data validation process may directly impact both security (e.g. application failure, legal issues) and accounting and charging (e.g. trusting metadata in file headers). Therefore, this paper investigates, evaluates (by means of tests), and discusses data validation processes of popular CPs. A proof of concept system was thus built, implementing encoders carefully crafted to circumvent data validation processes, ultimately demonstrating how large amounts of unaccounted, arbitrary data can be stored into CPs.
Nonlinearity of Boolean functions: an algorithmic approach based on multivariate polynomials
Venue: arXiv cs.IT 2014
Year: 2014

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our rational algorithm, arriving at a worst-case complexity of $O(n2^n)$ operations over the integers, that is, sums and doublings. This way, with a different approach, we reach the same complexity of established algorithms, such as those based on the fast Walsh transform.
Tangle Machines II: Invariants
Venue: arXiv cs.IT 2014
Year: 2014

The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence classes of tangle machines, which are called invariants. This paper constructs invariants of tangle machines. Chief among these are the prime factorizations of a machine, which are essentially unique. This is proven using low dimensional topology, through representing a colour-suppressed machine as a diagram for a network of jointly embedded spheres and intervals in 4-space. The complexity of a tangle machine is defined as its number of prime factors.
LDPC coded transmissions over the Gaussian broadcast channel with confidential messages
Venue: arXiv cs.IT 2014
Year: 2014

We design and assess some practical low-density parity-check (LDPC) coded transmission schemes for the Gaussian broadcast channel with confidential messages (BCC). This channel model is different from the classical wiretap channel model as the unauthorized receiver (Eve) must be able to decode some part of the information. Hence, the reliability and security targets are different from those of the wiretap channel. In order to design and assess practical coding schemes, we use the error rate as a metric of the performance achieved by the authorized receiver (Bob) and the unauthorized receiver (Eve). We study the system feasibility, and show that two different levels of protection against noise are required on the public and the secret messages. This can be achieved in two ways: i) by using LDPC codes with unequal error protection (UEP) of the transmitted information bits or ii) by using two classical non-UEP LDPC codes with different rates. We compare these two approaches and show that, for the considered examples, the solution exploiting UEP LDPC codes is more efficient than that using non-UEP LDPC codes.
A Novel Real-Time Video and Data Capture of Vehicular Accident in Intelligent Transportation Systems
Venue: arXiv cs.NI 2014
Year: 2014

In this paper, a novel real-time video and data capture of vehicle accident is proposed in Intelligent Transportation System (ITS). The proposed scheme solves the problem of huge storage needed for recording vehicle accident in the smart vehicle and in the remote ITS server. It works efficiently with small amount of storage size and guarantee saving accident video in secondary storage. It enables user to capture real-time video and data of running vehicle. It enables user to get vehicle accident video and data anytime anywhere. The scheme is implemented using testbed and its performance is evaluated. The results show that the proposed scheme guarantees record the vehicle accident in the ITS server. The proposed scheme has better results in comparison with full time video recording scheme.
A Measure of Synergy in Coalitions
Venue: arXiv cs.GT 2014
Year: 2014

When the performance of a team of agents exceeds our expectations or fall short of them, we often explain this by saying that there was some synergy in the team---either positive (the team exceeded our expectations) or negative (they fell short). Our aim in this article is to develop a formal and principled way of measuring synergies, both positive and negative. Using characteristic function cooperative games as our underlying model, we present a formal measure of synergy, based on the idea that a synergy is exhibited when the performance of a team deviates from the norm. We then show that our synergy value is the only possible such measure that satisfies certain intuitive properties. We then investigate some alternative characterisations of this measure.