Search results for "Data type"
showing 10 items of 1183 documents
Spatial joins
2019
The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. This paper reviews research and recent trends on spatial join evaluation. The complexity of different data types, the consideration of different join predicates, the use of modern commodity hardware, and support for parallel processing open the road to a number of interesting directions for future research, some of which we outline in the paper.
Functional Brain Segmentation Using Inter-Subject Correlation in fMRI
2016
The human brain continuously processes massive amounts of rich sensory information. To better understand such highly complex brain processes, modern neuroimaging studies are increasingly utilizing experimental setups that better mimic daily‐life situations. A new exploratory data‐analysis approach, functional segmentation inter‐subject correlation analysis (FuSeISC), was proposed to facilitate the analysis of functional magnetic resonance (fMRI) data sets collected in these experiments. The method provides a new type of functional segmentation of brain areas, not only characterizing areas that display similar processing across subjects but also areas in which processing across subjects is h…
Biologically inspired information processing and synchronization in ensembles of non-identical threshold-potential nanostructures.
2013
Nanotechnology produces basic structures that show a significant variability in their individual physical properties. This experimental fact may constitute a serious limitation for most applications requiring nominally identical building blocks. On the other hand, biological diversity is found in most natural systems. We show that reliable information processing can be achieved with heterogeneous groups of non-identical nanostructures by using some conceptual schemes characteristic of biological networks (diversity, frequency-based signal processing, rate and rank order coding, and synchronization). To this end, we simulate the integrated response of an ensemble of single-electron transisto…
Asynchronously switched control of discrete impulsive switched systems with time delays
2013
This paper is concerned with the stabilization problem for a class of uncertain discrete impulsive switched delay systems under asynchronous switching. The so-called asynchronous switching means that the switches between the candidate controllers and system modes are asynchronous. By using the average dwell time (ADT) approach, sufficient conditions for the existence of an asynchronously switched controller is derived such that the resulting closed-loop system is exponentially stable. The desired controller gains and the admissible switching signals are obtained in terms of a set of matrix inequalities. A numerical example is given to illustrate the effectiveness of the proposed method.
A Lightweight Network Discovery Algorithm for Resource-constrained IoT Devices
2019
Although quite simple, existing protocols for the IoT suffer from the inflexibility of centralized infrastructures and require several configuration stages. The implementation of these protocols is often prohibitive on resource-constrained devices. In this work, we propose a distributed lightweight implementation of network discovery for simple IoT devices. Our approach is based on the exchange of symbolic executable code among nodes. Based on this abstraction, we propose an algorithm that makes even IoT resource-constrained nodes able to construct the network topology graph incrementally and without any a priori information about device positioning and presence. The minimal set of executab…
Trace and density results on regular trees
2019
We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.
Non-wandering sets with non-empty interiors
2003
We study diffeomorphisms of a closed connected manifold whose non-wandering set has a non-empty interior and conjecture that C1-generic diffeomorphisms whose non-wandering set has a non-empty interior are transitive. We prove this conjecture in three cases: hyperbolic diffeomorphisms, partially hyperbolic diffeomorphisms with two hyperbolic bundles, and tame diffeomorphisms (in the first case, the conjecture is folklore; in the second one, it follows by adapting the proof in Brin (1975 Topological transitivity of a certain class of dynamical systems, and flows of frames on manifolds of negative curvature Funct. Anal. Appl. 9 9–19)).We study this conjecture without global assumptions and pro…
Partially hyperbolic diffeomorphisms on Heisenberg nilmanifolds and holonomy maps
2014
Abstract In this note we show that all partially hyperbolic automorphisms on a 3-dimensional non-Abelian nilmanifold can be C 1 -approximated by structurally stable C ∞ -diffeomorphisms, whose chain recurrent set consists of one attractor and one repeller. In particular, all these partially hyperbolic automorphisms are not robustly transitive. As a corollary, the holonomy maps of the stable and unstable foliations of the approximating diffeomorphisms are twisted quasiperiodically forced circle homeomorphisms, which are transitive but non-minimal and satisfy certain fiberwise regularity properties.
Toward an urban transport sustainability index: an European comparison
2011
Introduction The aim of paper is to cluster policies of sustainable mobility in order to define an essential set of specific Transport Performance Indicators (TPI). TPIs are standardized measures suitable for analysis in order to appraise the feasibility of a transport policy or an infrastructural project. Data collection of TPIs is a crucial phase, but data detection and monitoring are not standardized at the city level. Thus, there is no a standard for data collection and storing, this aspect makes much difficult to compare different city contexts. This issue is critical and bounds the analysis of built scenarios. A standardized set of transport performance indicators becomes, hence, esse…
Improved heuristics for the regenerator location problem
2014
Telecommunication systems use optical signals to transmit information. The strength of a signal in an optical network deteriorates and loses power as it goes farther from the source, mainly due to attenuation. Therefore, to enable the signal to arrive its intended destination with good quality, it is necessary to regenerate the signal periodically using regenerators. These components are relatively expensive and therefore it is desirable to deploy as few of them as possible in the network. In the regenerator location problem (RLP), we are given an undirected graph, positive edge lengths, and a parameter specifying the maximum length that a signal can travel before its quality deteriorates a…