Topic overview

Other Computer Science

157 works540 researchers

Map preview

Start with the graph, then narrow the list

157works
540researchers

Next steps

Use the topic as a working map

Open the full map for clusters, then return here to scan ranked papers and people.

Topic graph

See the topic as a live network

Open full explorer

Inspect nearby papers, researchers, institutions and communities without opening a separate graph page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Papers in this area

24 paper(s) to start with

preprint2014arXiv

ProMC: Input-output data format for HEP applications using varint encoding

A new data format for Monte Carlo (MC) events, or any structural data, including experimental data, is discussed. The format is designed to store data in a compact binary form using variable-size integer encoding as implemented in the Google's Protocol Buffers package. This approach is implemented in the ProMC library which produces smaller file sizes for MC records compared to the existing input-output libraries used in high-energy physics (HEP). Other important features of the proposed format are a separation of abstract data layouts from concrete programming implementations, self-description and random access. Data stored in ProMC files can be written, read and manipulated in a number of programming languages, such C++, JAVA, FORTRAN and PYTHON.

preprint2017arXiv

Picturing Indefinite Causal Structure

Following on from the notion of (first-order) causality, which generalises the notion of being tracepreserving from CP-maps to abstract processes, we give a characterization for the most general kind of map which sends causal processes to causal processes. These new, second-order causal processes enable us to treat the input processes as 'local laboratories' whose causal ordering needs not be fixed in advance. Using this characterization, we give a fully-diagrammatic proof of a non-trivial theorem: namely that being causality-preserving on separable processes implies being 'completely' causality preserving. That is, causality is preserved even when the 'local laboratories' are allowed to have ancilla systems. An immediate consequence is that preserving causality is separable processes is equivalence to preserving causality for strongly non-signalling (a.k.a. localizable) processes.

preprint2016arXiv

Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence

Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended evolution and the adaptability of computable dynamical systems. Within this framework, we show that decidability imposes absolute limits to the stable growth of complexity in computable dynamical systems. Conversely, systems that exhibit (strong) open-ended evolution must be undecidable, establishing undecidability as a requirement for such systems. Complexity is assessed in terms of three measures: sophistication, coarse sophistication and busy beaver logical depth. These three complexity measures assign low complexity values to random (incompressible) objects. As time grows, the stated complexity measures allow for the existence of complex states during the evolution of a computable dynamical system. We show, however, that finding these states involves undecidable computations. We conjecture that for similar complexity measures that assign low complexity values, decidability imposes comparable limits to the stable growth of complexity, and that such behaviour is necessary for non-trivial evolutionary sy

preprint2016arXiv

Improving the Quality of Random Number Generators by Applying a Simple Ratio Transformation

It is well-known that the quality of random number generators can often be improved by combining several generators, e.g. by summing or subtracting their results. In this paper we investigate the ratio of two random number generators as an alternative approach: the smaller of two input random numbers is divided by the larger, resulting in a rational number from $[0,1]$. We investigate theoretical properties of this approach and show that it yields a good approximation to the ideal uniform distribution. To evaluate the empirical properties we use the well-known test suite \textsc{TestU01}. We apply the ratio transformation to moderately bad generators, i.e. those that failed up to 40\% of the tests from the test battery \textsc{Crush} of \textsc{TestU01}. We show that more than half of them turn into very good generators that pass all tests of \textsc{Crush} and \textsc{BigCrush} from \textsc{TestU01} when the ratio transformation is applied. In particular, generators based on linear operations seem to benefit from the ratio, as this breaks up some of the unwanted regularities in the input sequences. Thus the additional effort to produce a second random number and to calculate the r

preprint2016arXiv

Computational Intelligence: are you crazy? Since when has intelligence become computational?

Computational Intelligence is a dead-end attempt to recreate human-like intelligence in a computing machine. The goal is unattainable because the means chosen for its accomplishment are mutually inconsistent and contradictory: "Computational" implies data processing ability while "Intelligence" implies the ability to process information. In the research community, there is a lack of interest in data versus information divergence. The cause of this indifference is the Shannon's Information theory, which has dominated the scientific community since the early 1950s. However, today it is clear that Shannon's theory is applicable only to a specific case of data communication and is inapplicable to the majority of other occasions, where information about semantic properties of a message must be taken into account. The paper will try to explain the devastating results of overlooking some of these very important issues - what is intelligence, what is semantic information, how they are interrelated and what happens when the relationship is disregarded.

preprint2016arXiv

DEMoS Manifesto

This is a manifesto for DEMoS, which is a Distributed Embedded Modular System, but also a manifesto addressing the need for more inter-/cross-disciplinary mastery of working knowledge related to installing this class of systems in the real world. There is somehow room for yet another class of systems - complementary to existing embedded systems - complementing distributed operating systems - which takes on an interdisciplinary cyber-physical-materiality approach, a dedicated holistic perspective that recognizes the true value of interdisciplinary mastery vs. the implicit and overlooked expense of narrow intra-disciplinary focus dominating much of systems development (e.g. EE, CE, CS, SE, and IS). Interdisciplinary mastery yields its accumulated value across the development, deployment, use, re-use, and decommission phases for this class of systems: DEMoS is a system architected to be locally distributed, embedded, and modular as outlined herein and with the additional goals of human interdisciplinary mastery in this context: A potential set of goals for developing and applying DEMoS can be found in UN Resolution 70/1.

preprint2016arXiv

Detection of Dangerous Magnetic Field Ranges from Tablets by Clustering Analysis

The paper considers the problem of the extremely low frequency magnetic field radiation generated by the tablet computers. Accordingly, the measurement of the magnetic field radiation from a set of tablets is carried out. Furthermore, the measurement results are analyzed and clustered according to the K-Medians algorithm to obtain different magnetic field ranges. The obtained cluster ranges are evaluated according to the reference level proposed by the TCO standard in order to define dangerous areas in the neighborhood of tablet, which are established during the typical work with tablet computers. Analysis shows that dangerous areas correspond to specific inner components of tablet, and gives suggestions to users for a safe usage of tablet and to companies producing tablet components for limiting the risk of magnetic field exposure.

preprint2016arXiv

Virtual Micromagnetics: A Framework for Accessible and Reproducible Micromagnetic Simulation

Computational micromagnetics requires numerical solution of partial differential equations to resolve complex interactions in magnetic nanomaterials. The Virtual Micromagnetics project described here provides virtual machine simulation environments to run open-source micromagnetic simulation packages. These environments allow easy access to simulation packages that are often difficult to compile and install, and enable simulations and their data to be shared and stored in a single virtual hard disk file, which encourages reproducible research. Virtual Micromagnetics can be extended to automate the installation of micromagnetic simulation packages on non-virtual machines, and to support closed-source and new open-source simulation packages, including packages from disciplines other than micromagnetics, encouraging reuse. Virtual Micromagnetics is stored in a public GitHub repository under a three-clause Berkeley Software Distribution (BSD) license.

preprint2016arXiv

On the Origin of Samples: Attribution of Output to a Particular Algorithm

With unprecedented advances in genetic engineering we are starting to see progressively more original examples of synthetic life. As such organisms become more common it is desirable to be able to distinguish between natural and artificial life forms. In this paper, we present this challenge as a generalized version of Darwin's original problem, which he so brilliantly addressed in On the Origin of Species. After formalizing the problem of determining origin of samples we demonstrate that the problem is in fact unsolvable, in the general case, if computational resources of considered originator algorithms have not been limited and priors for such algorithms are known to be equal. Our results should be of interest to astrobiologists and scientists interested in producing a more complete theory of life, as well as to AI-Safety researchers.

preprint2014arXiv

On the Behavioral Interpretation of System-Environment Fit and Auto-Resilience

Already 71 years ago Rosenblueth, Wiener, and Bigelow introduced the concept of the "behavioristic study of natural events" and proposed a classification of systems according to the quality of the behaviors they are able to exercise. In this paper we consider the problem of the resilience of a system when deployed in a changing environment, which we tackle by considering the behaviors both the system organs and the environment mutually exercise. We then introduce a partial order and a metric space for those behaviors, and we use them to define a behavioral interpretation of the concept of system-environment fit. Moreover we suggest that behaviors based on the extrapolation of future environmental requirements would allow systems to proactively improve their own system-environment fit and optimally evolve their resilience. Finally we describe how we plan to express a complex optimization strategy in terms of the concepts introduced in this paper.

preprint2013arXiv

Multi-User Multi-Carrier Differential Chaos Shift Keying Communication System

In this paper, a multi user Multi-Carrier Differential Chaos Shift Keying (MC-DCSK) modulation is presented. The system endeavors to provide a good trade-off between robustness, energy efficiency and high data rate, while still being simple. In this architecture of MC-DCSK system, for each user, chaotic reference sequence is transmitted over a predefined subcarrier frequency. Multiple modulated data streams are transmitted over the remaining subcarriers allocated for each user. This transmitter structure saves energy and increases the spectral efficiency of the conventional DCSK system.

preprint2007arXiv

On the Polyphase Decomposition for Design of Generalized Comb Decimation Filters

Generalized comb filters (GCFs) are efficient anti-aliasing decimation filters with improved selectivity and quantization noise (QN) rejection performance around the so called folding bands with respect to classical comb filters. In this paper, we address the design of GCF filters by proposing an efficient partial polyphase architecture with the aim to reduce the data rate as much as possible after the Sigma-Delta A/D conversion. We propose a mathematical framework in order to completely characterize the dependence of the frequency response of GCFs on the quantization of the multipliers embedded in the proposed filter architecture. This analysis paves the way to the design of multiplier-less decimation architectures. We also derive the impulse response of a sample 3rd order GCF filter used as a reference scheme throughout the paper.

preprint2012arXiv

Performance of MIMO Relay DCSK-CD Systems over Nakagami Fading Channels

A multi-access multiple-input multiple-output (MIMO) relay differential chaos shift keying cooperative diversity (DCSK-CD) system is proposed in this paper as a comprehensive cooperation scheme, in which the relay and destination both employ multiple antennas to strengthen the robustness against signal fading in a wireless network. It is shown that, with spatial diversity gains, the bit error rate (BER) performance of the proposed system is remarkably better than the conventional DCSK non-cooperation (DCSK-NC) and DCSK cooperative communication (DCSK-CC) systems. Moreover, the exact BER and close-form expressions of the proposed system are derived over Nakagami fading channels through the moment generating function (MGF), which is shown to be highly consistent with the simulation results. Meanwhile, this paper illustrates a trade-off between the performance and the complexity, and provides a threshold for the number of relay antennas keeping the user consumed energy constant. Due to the above-mentioned advantages, the proposed system stands out as a good candidate or alternative for energy-constrained wireless communications based on chaotic modulation, especially for low-power and

preprint2015arXiv

Behavior, Organization, Substance: Three Gestalts of General Systems Theory

The term gestalt, when used in the context of general systems theory, assumes the value of "systemic touchstone", namely a figure of reference used to categorize the properties or qualities of a set of systems. Typical gestalts used in biology are those based on anatomical or physiological characteristics, which correspond respectively to architectural and organizational design choices in natural and artificial systems. In this paper we discuss three gestalts of general systems theory: behavior, organization, and substance, which refer respectively to the works of Wiener, Boulding, and Leibniz. Our major focus here is the system introduced by the latter. Through a discussion of some of the elements of the Leibnitian System, and by means of several novel interpretations of those elements in terms of today's computer science, we highlight the debt that contemporary research still has with this Giant among the giant scholars of the past.

preprint2014arXiv

Training-Free Non-Intrusive Load Monitoring of Electric Vehicle Charging with Low Sampling Rate

Non-intrusive load monitoring (NILM) is an important topic in smart-grid and smart-home. Many energy disaggregation algorithms have been proposed to detect various individual appliances from one aggregated signal observation. However, few works studied the energy disaggregation of plug-in electric vehicle (EV) charging in the residential environment since EVs charging at home has emerged only recently. Recent studies showed that EV charging has a large impact on smart-grid especially in summer. Therefore, EV charging monitoring has become a more important and urgent missing piece in energy disaggregation. In this paper, we present a novel method to disaggregate EV charging signals from aggregated real power signals. The proposed method can effectively mitigate interference coming from air-conditioner (AC), enabling accurate EV charging detection and energy estimation under the presence of AC power signals. Besides, the proposed algorithm requires no training, demands a light computational load, delivers high estimation accuracy, and works well for data recorded at the low sampling rate 1/60 Hz. When the algorithm is tested on real-world data recorded from 11 houses over about a who

preprint2014arXiv

Crawford-Sobel meet Lloyd-Max on the grid

The main contribution of this work is twofold. First, we apply, for the first time, a framework borrowed from economics to a problem in the smart grid namely, the design of signaling schemes between a consumer and an electricity aggregator when these have non-aligned objectives. The consumer's objective is to meet its need in terms of power and send a request (a message) to the aggregator which does not correspond, in general, to its actual need. The aggregator, which receives this request, not only wants to satisfy it but also wants to manage the cost induced by the residential electricity distribution network. Second, we establish connections between the exploited framework and the quantization problem. Although the model assumed for the payoff functions for the consumer and aggregator is quite simple, it allows one to extract insights of practical interest from the analysis conducted. This allows us to establish a direct connection with quantization, and more importantly, to open a much more general challenge for source and channel coding.

preprint2013arXiv

Device-Free Person Detection and Ranging in UWB Networks

We present a novel device-free stationary person detection and ranging method, that is applicable to ultra-wide bandwidth (UWB) networks. The method utilizes a fixed UWB infrastructure and does not require a training database of template waveforms. Instead, the method capitalizes on the fact that a human presence induces small low-frequency variations that stand out against the background signal, which is mainly affected by wideband noise. We analyze the detection probability, and validate our findings with numerical simulations and experiments with off-the-shelf UWB transceivers in an indoor environment.

preprint2013arXiv

SolarStat: Modeling Photovoltaic Sources through Stochastic Markov Processes

In this paper, we present a methodology and a tool to derive simple but yet accurate stochastic Markov processes for the description of the energy scavenged by outdoor solar sources. In particular, we target photovoltaic panels with small form factors, as those exploited by embedded communication devices such as wireless sensor nodes or, concerning modern cellular system technology, by small-cells. Our models are especially useful for the theoretical investigation and the simulation of energetically self-sufficient communication systems including these devices. The Markov models that we derive in this paper are obtained from extensive solar radiation databases, that are widely available online. Basically, from hourly radiance patterns, we derive the corresponding amount of energy (current and voltage) that is accumulated over time, and we finally use it to represent the scavenged energy in terms of its relevant statistics. Toward this end, two clustering approaches for the raw radiance data are described and the resulting Markov models are compared against the empirical distributions. Our results indicate that Markov models with just two states provide a rough characterization of t

preprint2013arXiv

Design and Development of a Heart Rate Measuring Device using Fingertip

In this paper, we presented the design and development of a new integrated device for measuring heart rate using fingertip to improve estimating the heart rate. As heart related diseases are increasing day by day, the need for an accurate and affordable heart rate measuring device or heart monitor is essential to ensure quality of health. However, most heart rate measuring tools and environments are expensive and do not follow ergonomics. Our proposed Heart Rate Measuring (HRM) device is economical and user friendly and uses optical technology to detect the flow of blood through index finger. Three phases are used to detect pulses on the fingertip that include pulse detection, signal extraction, and pulse amplification. Qualitative and quantitative performance evaluation of the device on real signals shows accuracy in heart rate estimation, even under intense of physical activity. We compared the performance of HRM device with Electrocardiogram reports and manual pulse measurement of heartbeat of 90 human subjects of different ages. The results showed that the error rate of the device is negligible.

preprint2012arXiv

PCNM: A New Platform for Cellular Networks Measurements and Optimization

In this paper, we present PCNM, a new mobile platform for cellular networks measurements. PCNM is based on a set of techniques that tailors theoretical calculations and simulations to the real cellular network environment. It includes: (a) modules that measure different parameters of a base station (BS) such as localization, cells identification, time advance information, reception level and quality, (b) a new protocol that optimizes the task of network measurement by monitoring a set of mobile nodes and finally (c) the ability to extend an existing cellular network by adding new base stations. We evaluate our genetic algorithm used to reduce the nodes mobility and optimize the measurement extraction of N base stations using k mobile sensors (k >= 1). We show how connecting real measurements (using mobile sensors in a collaborative way) to theoretical and prediction methods is of high benefits for cellular networks maintenance, extension and performances evaluation.

preprint2010arXiv

FP-tree and COFI Based Approach for Mining of Multiple Level Association Rules in Large Databases

In recent years, discovery of association rules among itemsets in a large database has been described as an important database-mining problem. The problem of discovering association rules has received considerable research attention and several algorithms for mining frequent itemsets have been developed. Many algorithms have been proposed to discover rules at single concept level. However, mining association rules at multiple concept levels may lead to the discovery of more specific and concrete knowledge from data. The discovery of multiple level association rules is very much useful in many applications. In most of the studies for multiple level association rule mining, the database is scanned repeatedly which affects the efficiency of mining process. In this research paper, a new method for discovering multilevel association rules is proposed. It is based on FP-tree structure and uses cooccurrence frequent item tree to find frequent items in multilevel concept hierarchy.

preprint2016arXiv

COOLL: Controlled On/Off Loads Library, a Public Dataset of High-Sampled Electrical Signals for Appliance Identification

This paper gives a brief description of the Controlled On/Off Loads Library (COOLL) dataset. This latter is a dataset of high-sampled electrical current and voltage measurements representing individual appliances consumption. The measurements were taken in June 2016 in the PRISME laboratory of the University of Orléans, France. The appliances are mainly controllable appliances (i.e. we can precisely control their turn-on/off time instants). 42 appliances of 12 types were measured at a 100 kHz sampling frequency.

preprint2016arXiv

An Efficient Framework for Floor-plan Prediction of Dynamic Runtime Reconfigurable Systems

Several embedded application domains for reconfigurable systems tend to combine frequent changes with high performance demands of their workloads such as image processing, wearable computing and network processors. Time multiplexing of reconfigurable hardware resources raises a number of new issues, ranging from run-time systems to complex programming models that usually form a Reconfigurable hardware Operating System (ROS). The Operating System performs online task scheduling and handles resource management. There are many challenges in adaptive computing and dynamic reconfigurable systems. One of the major understudied challenges is estimating the required resources in terms of soft cores, Programmable Reconfigurable Regions (PRRs), the appropriate communication infrastructure, and to predict a near optimal layout and floorplan of the reconfigurable logic fabric. Some of these issues are specific to the application being designed, while others are more general and relate to the underlying run-time environment. Static resource allocation for Run- Time Reconfiguration (RTR) often leads to inferior and unacceptable results. In this paper, we present a novel adaptive and dynamic meth

People in this topic

12 visible researcher(s)