OpenRaiser/Intern-Atlas huggingface dataset:
The Geometry of Fusion Inspired Channel Design
Venue: arXiv cs.IT 2013
Year: 2013

This paper is motivated by the problem of integrating multiple sources of measurements. We consider two multiple-input-multiple-output (MIMO) channels, a primary channel and a secondary channel, with dependent input signals. The primary channel carries the signal of interest, and the secondary channel carries a signal that shares a joint distribution with the primary signal. The problem of particular interest is designing the secondary channel matrix, when the primary channel matrix is fixed. We formulate the problem as an optimization problem, in which the optimal secondary channel matrix maximizes an information-based criterion. An analytical solution is provided in a special case. Two fast-to-compute algorithms, one extrinsic and the other intrinsic, are proposed to approximate the optimal solutions in general cases. In particular, the intrinsic algorithm exploits the geometry of the unit sphere, a manifold embedded in Euclidean space. The performances of the proposed algorithms are examined through a simulation study. A discussion of the choice of dimension for the secondary channel is given.
Error Correction for NOR Memory Devices with Exponentially Distributed Read Noise
Venue: arXiv cs.IT 2013
Year: 2013

The scaling of high density NOR Flash memory devices with multi level cell (MLC) hits the reliability break wall because of relatively high intrinsic bit error rate (IBER). The chip maker companies offer two solutions to meet the output bit error rate (OBER) specification: either partial coverage with error correction code (ECC) or data storage in single level cell (SLC) with significant increase of the die cost. The NOR flash memory allows to write information in small portions, therefore the full error protection becomes costly due to high required redundancy, e.g. $\sim$50%. This is very different from the NAND flash memory writing at once large chunks of information; NAND ECC requires just $\sim$10% redundancy. This paper gives an analysis of a novel error protection scheme applicable to NOR storage of one byte. The method does not require any redundant cells, but assumes 5th program level. The information is mapped to states in the 4-dimensional space separated by the minimal Manhattan distance equal 2. This code preserves the information capacity: one byte occupies four memory cells. We demonstrate the OBER $\sim$ IBER$^{3/2}$ scaling law, where IBER is calculated for the 4-level MLC memory. As an example, the 4-level MLC with IBER $\sim10^{-9}$, which is unacceptable for high density products, can be converted to OBER $\sim10^{-12}$. We assume that the IBER is determined by the exponentially distributed read noise. This is the case for NOR Flash memory devices, since the exponential tails are typical for the random telegraph signal (RTS) noise and for most of the charge loss, charge gain, and charge sharing data losses.
Supervisor Localization of Discrete-Event Systems based on State Tree Structures
Venue: arXiv cs.SY 2013
Year: 2013

Recently we developed supervisor localization, a top-down approach to distributed control of discrete-event systems in the Ramadge-Wonham supervisory control framework. Its essence is the decomposition of monolithic (global) control action into local control strategies for the individual agents. In this paper, we establish a counterpart supervisor localization theory in the framework of State Tree Structures, known to be efficient for control design of very large systems. In the new framework, we introduce the new concepts of local state tracker, local control function, and state-based local-global control equivalence. As before, we prove that the collective localized control behavior is identical to the monolithic optimal (i.e. maximally permissive) and nonblocking controlled behavior. In addition, we propose a new and more efficient localization algorithm which exploits BDD computation. Finally we demonstrate our localization approach on a model for a complex semiconductor manufacturing system.
The Geospatial Characteristics of a Social Movement Communication Network
Venue: arXiv cs.CY 2013
Year: 2013

Social movements rely in large measure on networked communication technologies to organize and disseminate information relating to the movements' objectives. In this work we seek to understand how the goals and needs of a protest movement are reflected in the geographic patterns of its communication network, and how these patterns differ from those of stable political communication. To this end, we examine an online communication network reconstructed from over 600,000 tweets from a thirty-six week period covering the birth and maturation of the American anticapitalist movement, Occupy Wall Street. We find that, compared to a network of stable domestic political communication, the Occupy Wall Street network exhibits higher levels of locality and a hub and spoke structure, in which the majority of non-local attention is allocated to high-profile locations such as New York, California, and Washington D.C. Moreover, we observe that information flows across state boundaries are more likely to contain framing language and references to the media, while communication among individuals in the same state is more likely to reference protest action and specific places and and times. Tying these results to social movement theory, we propose that these features reflect the movement's efforts to mobilize resources at the local level and to develop narrative frames that reinforce collective purpose at the national level.
The Digital Evolution of Occupy Wall Street
Venue: arXiv cs.CY 2013
Year: 2013

We examine the temporal evolution of digital communication activity relating to the American anti-capitalist movement Occupy Wall Street. Using a high-volume sample from the microblogging site Twitter, we investigate changes in Occupy participant engagement, interests, and social connectivity over a fifteen month period starting three months prior to the movement's first protest action. The results of this analysis indicate that, on Twitter, the Occupy movement tended to elicit participation from a set of highly interconnected users with pre-existing interests in domestic politics and foreign social movements. These users, while highly vocal in the months immediately following the birth of the movement, appear to have lost interest in Occupy related communication over the remainder of the study period.
Characterizing Ambiguity in Light Source Invariant Shape from Shading
Venue: arXiv cs.CV 2013
Year: 2013

Shape from shading is a classical inverse problem in computer vision. This shape reconstruction problem is inherently ill-defined; it depends on the assumed light source direction. We introduce a novel mathematical formulation for calculating local surface shape based on covariant derivatives of the shading flow field, rather than the customary integral minimization or P.D.E approaches. On smooth surfaces, we show second derivatives of brightness are independent of the light sources and can be directly related to surface properties. We use these measurements to define the matching local family of surfaces that can result from any given shading patch, changing the emphasis to characterizing ambiguity in the problem. We give an example of how these local surface ambiguities collapse along certain image contours and how this can be used for the reconstruction problem.
Java Card for PayTv Application
Venue: arXiv cs.CR 2013
Year: 2013

Smart cards are widely used along with PayTV receivers to store secret user keys and to perform security functions to prevent any unauthorized viewing of PayTV channels. Java Card technology enables programs written in the Java programming language to run on smart cards. Smart cards represent one of the smallest computing platforms in use today. The memory configuration of a smart card are of the order of 4K of RAM, 72K of EEPROM, and 24K of ROM. Using Java card provides advantages to the industry in terms of ease of coding, faster time to market and faster upgrades as compared to plain smart cards . Also different applications like payTV, e-commerce, health-card can easily be implemented in a single java card as multiple applets corresponding to each application can coexists in a single java card. But there are security concerns in java cards and also the performance issues. In this paper, we analyse the suitability of using Java card for PayTV applications as part of conditional access system in place of plain smart cards.
A Survey on Formal Methods for Web Service Composition
Venue: arXiv cs.SE 2013
Year: 2013

Web Service Composition creates new composite Web Services from existing Web Services which embodies the added values of Web Service technology and is a key technology to solve cross-organizational business process integrations. We do a survey on formal methods for Web Service Composition in the following way. Through analyses of Web Service Composition, we establish a reference model called RM-WSComposition to capture elements of Web Service Composition. Based on the RM-WSComposition, issues on formalization for Web Service Composition are pointed out and state-of-the-art on formal methods for Web Service Composition is introduced. Finally, we point out the trends on this topic. For convenience, we use an example called BuyingBooks to illustrate the concepts and mechanisms in Web Service Composition.
Soundness and Completeness of the NRB Verification Logic
Venue: arXiv cs.LO 2013
Year: 2013

This short paper gives a model for and a proof of completeness of the NRB verification logic for deterministic imperative programs, the logic having been used in the past as the basis for automated semantic checks of large, fast-changing, open source C code archives, such as that of the Linux kernel source. The model is a colored state transitions model that approximates from above the set of transitions possible for a program. Correspondingly, the logic catches all traces that may trigger a particular defect at a given point in the program, but may also flag false positives.
Using Genetic Programming to Model Software
Venue: arXiv cs.NE 2013
Year: 2013

We study a generic program to investigate the scope for automatically customising it for a vital current task, which was not considered when it was first written. In detail, we show genetic programming (GP) can evolve models of aspects of BLAST's output when it is used to map Solexa Next-Gen DNA sequences to the human genome.
Equilibrium in Labor Markets with Few Firms
Venue: arXiv cs.GT 2013
Year: 2013

We study competition between firms in labor markets, following a combinatorial model suggested by Kelso and Crawford [1982]. In this model, each firm is trying to recruit workers by offering a higher salary than its competitors, and its production function defines the utility generated from any actual set of recruited workers. We define two natural classes of production functions for firms, where the first one is based on additive capacities (weights), and the second on the influence of workers in a social network. We then analyze the existence of pure subgame perfect equilibrium (PSPE) in the labor market and its properties. While neither class holds the gross substitutes condition, we show that in both classes the existence of PSPE is guaranteed under certain restrictions, and in particular when there are only two competing firms. As a corollary, there exists a Walrasian equilibrium in a corresponding combinatorial auction, where bidders' valuation functions belong to these classes. While a PSPE may not exist when there are more than two firms, we perform an empirical study of equilibrium outcomes for the case of weight-based games with three firms, which extend our analytical results. We then show that stability can in some cases be extended to coalitional stability, and study the distribution of profit between firms and their workers in weight-based games.
Activity Modeling in Smart Home using High Utility Pattern Mining over Data Streams
Venue: arXiv cs.AI 2013
Year: 2013

Smart home technology is a better choice for the people to care about security, comfort and power saving as well. It is required to develop technologies that recognize the Activities of Daily Living (ADLs) of the residents at home and detect the abnormal behavior in the individual's patterns. Data mining techniques such as Frequent pattern mining (FPM), High Utility Pattern (HUP) Mining were used to find those activity patterns from the collected sensor data. But applying the above technique for Activity Recognition from the temporal sensor data stream is highly complex and challenging task. So, a new approach is proposed for activity recognition from sensor data stream which is achieved by constructing Frequent Pattern Stream tree (FPS - tree). FPS is a sliding window based approach to discover the recent activity patterns over time from data streams. The proposed work aims at identifying the frequent pattern of the user from the sensor data streams which are later modeled for activity recognition. The proposed FPM algorithm uses a data structure called Linked Sensor Data Stream (LSDS) for storing the sensor data stream information which increases the efficiency of frequent pattern mining algorithm through both space and time. The experimental results show the efficiency of the proposed algorithm and this FPM is further extended for applying for power efficiency using HUP to detect the high usage of power consumption of residents at smart home.
Relaying Strategies for Uplink in Wireless Cellular Networks
Venue: arXiv cs.NI 2013
Year: 2013

In this paper, we analyze the impact of relays on the uplink performance of FDMA cellular networks. We focus our analysis on Decode and Forward techniques, with the aim of measuring the improvements which can be achieved in terms of throughput and energy saving. We apply a stochastic geometry based approach to a scenario with inter-cell interference and reuse factor equal to 1. The first goal of this work is to observe what is the impact of various relay features, such as transmission power, location and antenna pattern, when a half-duplex constraint is imposed. The second goal is to determine how much relaying can be beneficial also for users who are not at the cell edge, and who can therefore use a direct link towards the base station. We show that if more refined decoding techniques, such as Successive Interference Cancellation and Superposition Coding, are properly used, considerable gains can be obtained for these mobiles as well.
How fast can we make interpreted Python?
Venue: arXiv cs.PL 2013
Year: 2013

Python is a popular dynamic language with a large part of its appeal coming from powerful libraries and extension modules. These augment the language and make it a productive environment for a wide variety of tasks, ranging from web development (Django) to numerical analysis (NumPy). Unfortunately, Python's performance is quite poor when compared to modern implementations of languages such as Lua and JavaScript. Why does Python lag so far behind these other languages? As we show, the very same API and extension libraries that make Python a powerful language also make it very difficult to efficiently execute. Given that we want to retain access to the great extension libraries that already exist for Python, how fast can we make it? To evaluate this, we designed and implemented Falcon, a high-performance bytecode interpreter fully compatible with the standard CPython interpreter. Falcon applies a number of well known optimizations and introduces several new techniques to speed up execution of Python bytecode. In our evaluation, we found Falcon an average of 25% faster than the standard Python interpreter on most benchmarks and in some cases about 2.5X faster.
On Behavioral Types for OSGi: From Theory to Implementation
Venue: arXiv cs.SE 2013
Year: 2013

This report presents our work on behavioral types for OSGi component systems. It extends previously published work and presents features and details that have not yet been published. In particular, we cover a discussion on behavioral types in general, and Eclipse based implementation work on behavioral types . The implementation work covers: editors, means for comparing types at development and runtime, a tool connection to resolve incompatibilities, and an AspectJ based infrastructure to ensure behavioral type correctness at runtime of a system. Furthermore, the implementation comprises various auxiliary operations. We present some evaluation work based on examples.
Akceleracja obliczen algebry liniowej z wykorzystaniem masywnie rownoleglych, wielordzeniowych procesorow GPU
Venue: arXiv cs.DC 2013
Year: 2013

The paper presents the aspect of use of modern graphics accelerators supporting CUDA technology for high-performance computing in the field of linear algebra. Fully programmable graphic cards have been available for several years for both ordinary users and research units. They provide the capability of performing virtually any computing with high performance, which is often beyond the reach of conventional CPUs. GPU architecture, also in case of classical problems of linear algebra which is the basis for many calculations, can bring many benefits to the developer. Performance increase, observed during matrix multiplication on nVidia Tesla C2050, was more than thousandfold compared to ordinary CPU, resulting in drastic reduction of latency for some of the results, thus the cost of obtaining them.
An Optimal Heuristic for Sum of All Prime Numbers Logic for Large Inputs using RAPTOR
Venue: arXiv cs.DS 2013
Year: 2013

An optimal heuristic logic is an effective method for finding the sum of all prime numbers up to a given number. This paper presents different approaches, namely, general method and optimal method which facilitate to compare the results and draw the optimal solution. The method adopted is to know the number of symbols evaluated in each logic, construct better approaches based on heuristics, proposals and implementations of human sequential development using Rapid algorithmic prototyping tool for ordered reasoning (RAPTOR). In traditional approach, task is complex in point of time and space; however, this method reduces these prime factors by applying simple mathematical theorems and heuristics. This model effectively works with large numeric inputs. It has been tested on RAPTOR with flow charts, results indicates that algorithms are fast, effective and scalable.
A PSO Approach for Optimum Design of Multivariable PID Controller for nonlinear systems
Venue: arXiv cs.SY 2013
Year: 2013

The aim of this research is to design a PID Controller using particle swarm optimization (PSO) algorithm for multiple-input multiple output (MIMO) Takagi-Sugeno fuzzy model. The conventional gain tuning of PID controller (such as Ziegler-Nichols (ZN) method) usually produces a big overshoot, and therefore modern heuristics approach such as PSO are employed to enhance the capability of traditional techniques. However, due to the computational efficiency, only PSO will be used in this paper. The results show the advantage of the PID tuning using PSO-based optimization approach.
Investigating Immune System Aging: System Dynamics and Agent-Based Modeling
Venue: arXiv cs.CE 2013
Year: 2013

System dynamics and agent based simulation models can both be used to model and understand interactions of entities within a population. Our modeling work presented here is concerned with understanding the suitability of the different types of simulation for the immune system aging problems and comparing their results. We are trying to answer questions such as: How fit is the immune system given a certain age? Would an immune boost be of therapeutic value, e.g. to improve the effectiveness of a simultaneous vaccination? Understanding the processes of immune system aging and degradation may also help in development of therapies that reverse some of the damages caused thus improving life expectancy. Therefore as a first step our research focuses on T cells; major contributors to immune system functionality. One of the main factors influencing immune system aging is the output rate of naive T cells. Of further interest is the number and phenotypical variety of these cells in an individual, which will be the case study focused on in this paper.
Active Contour Models for Manifold Valued Image Segmentation
Venue: arXiv cs.CV 2013
Year: 2013

Image segmentation is the process of partitioning a image into different regions or groups based on some characteristics like color, texture, motion or shape etc. Active contours is a popular variational method for object segmentation in images, in which the user initializes a contour which evolves in order to optimize an objective function designed such that the desired object boundary is the optimal solution. Recently, imaging modalities that produce Manifold valued images have come up, for example, DT-MRI images, vector fields. The traditional active contour model does not work on such images. In this paper, we generalize the active contour model to work on Manifold valued images. As expected, our algorithm detects regions with similar Manifold values in the image. Our algorithm also produces expected results on usual gray-scale images, since these are nothing but trivial examples of Manifold valued images. As another application of our general active contour model, we perform texture segmentation on gray-scale images by first creating an appropriate Manifold valued image. We demonstrate segmentation results for manifold valued images and texture images.
Compressive Coded Aperture Keyed Exposure Imaging with Optical Flow Reconstruction
Venue: arXiv cs.IT 2013
Year: 2013

This paper describes a coded aperture and keyed exposure approach to compressive video measurement which admits a small physical platform, high photon efficiency, high temporal resolution, and fast reconstruction algorithms. The proposed projections satisfy the Restricted Isometry Property (RIP), and hence compressed sensing theory provides theoretical guarantees on the video reconstruction quality. Moreover, the projections can be easily implemented using existing optical elements such as spatial light modulators (SLMs). We extend these coded mask designs to novel dual-scale masks (DSMs) which enable the recovery of a coarse-resolution estimate of the scene with negligible computational cost. We develop fast numerical algorithms which utilize both temporal correlations and optical flow in the video sequence as well as the innovative structure of the projections. Our numerical experiments demonstrate the efficacy of the proposed approach on short-wave infrared data.
Tight Lower Bound for Linear Sketches of Moments
Venue: arXiv cs.DS 2013
Year: 2013

The problem of estimating frequency moments of a data stream has attracted a lot of attention since the onset of streaming algorithms [AMS99]. While the space complexity for approximately computing the $p^{\rm th}$ moment, for $p\in(0,2]$ has been settled [KNW10], for $p>2$ the exact complexity remains open. For $p>2$ the current best algorithm uses $O(n^{1-2/p}\log n)$ words of space [AKO11,BO10], whereas the lower bound is of $Ω(n^{1-2/p})$ [BJKS04]. In this paper, we show a tight lower bound of $Ω(n^{1-2/p}\log n)$ words for the class of algorithms based on linear sketches, which store only a sketch $Ax$ of input vector $x$ and some (possibly randomized) matrix $A$. We note that all known algorithms for this problem are linear sketches.