Dimensional Inconsistency Measures and Postulates in Spatio-Temporal Databases

The problem of managing spatio-temporal data arises in many applications, such as location-based services, environmental monitoring, geographic information systems, and many others. Often spatio-temporal data arising from such applications turn out to be inconsistent, i.e., representing an impossible situation in the real world. Though several inconsistency measures have been proposed to quantify in a principled way inconsistency in propositional knowledge bases, little effort has been done so far on inconsistency measures tailored for the spatio-temporal setting. In this paper, we define and investigate new measures that are particularly suitable for dealing with inconsistent spatio-temporal information, because they explicitly take into account the spatial and temporal dimensions, as well as the dimension concerning the identifiers of the monitored objects. Specifically, we first define natural measures that look at individual dimensions (time, space, and objects), and then propose measures based on the notion of a repair. We then analyze their behavior w.r.t. common postulates defined for classical propositional knowledge bases, and find that the latter are not suitable for spatio-temporal databases, in that the proposed inconsistency measures do not often satisfy them. In light of this, we argue that also postulates should explicitly take into account the spatial, temporal, and object dimensions and thus define “dimension-aware” counterparts of common postulates, which are indeed often satisfied by the new inconsistency measures. Finally, we study the complexity of the proposed inconsistency measures.

Priority areas of the estimation of environmental-economic situation in oil-gas industry

The paper analyzes the methodological approaches to the sole environmental-economic estimation of natural measures. The issues of the improvement of environmental-economic mechanism and ensuring environmental safety towards the formation of ecological measures in the construction of oil-gas objects within SOCAR strategy of steady economic development have been studied, the analysis on the waste management within SOCAR carried out and as a result of conducted research, the priorities in the spheres of environmental protection and rational nature management of business entities in the oil-gas industry specified as well.

Optimizing speech intelligibility in a noisy environment: A unified view

Modern communication technology facilitates communication from anywhere to anywhere. As a result, low speech intelligibility has become a common problem, which is exacerbated by the lack of feedback to the talker about the rendering environment. In recent years, a range of algorithms has been developed to enhance the intelligibility of speech rendered in a noisy environment. We describe methods for intelligibility enhancement from a unified vantage point. Before one defines a measure of intelligibility, the level of abstraction of the representation must be selected. For example, intelligibility can be measured on the message, the sequence of words spoken, the sequence of sounds, or a sequence of states of the auditory system. Natural measures of intelligibility defined at the message level are mutual information and the hit-or-miss criterion. The direct evaluation of high-level measures requires quantitative knowledge of human cognitive processing. Lower-level measures can be derived from higher-level measures by making restrictive assumptions. We discuss the implementation and performance of some specific enhancement systems in detail, including speech intelligibility index (SII)-based systems and systems aimed at enhancing the sound-field where it is perceived by the listener. We conclude with a discussion of the current state of the field and open problems. © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Optimizing speech intelligibility in a noisy environment: A unified view

Modern communication technology facilitates communication from anywhere to anywhere. As a result, low speech intelligibility has become a common problem, which is exacerbated by the lack of feedback to the talker about the rendering environment. In recent years, a range of algorithms has been developed to enhance the intelligibility of speech rendered in a noisy environment. We describe methods for intelligibility enhancement from a unified vantage point. Before one defines a measure of intelligibility, the level of abstraction of the representation must be selected. For example, intelligibility can be measured on the message, the sequence of words spoken, the sequence of sounds, or a sequence of states of the auditory system. Natural measures of intelligibility defined at the message level are mutual information and the hit-or-miss criterion. The direct evaluation of high-level measures requires quantitative knowledge of human cognitive processing. Lower-level measures can be derived from higher-level measures by making restrictive assumptions. We discuss the implementation and performance of some specific enhancement systems in detail, including speech intelligibility index (SII)-based systems and systems aimed at enhancing the sound-field where it is perceived by the listener. We conclude with a discussion of the current state of the field and open problems. © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

On Combinatorial Depth Measures

Given a set [Formula: see text] of points and a point [Formula: see text] in the plane, we define a function [Formula: see text] that provides a combinatorial characterization of the multiset of values [Formula: see text], where for each [Formula: see text], [Formula: see text] is the open half-plane determined by [Formula: see text] and [Formula: see text]. We introduce two new natural measures of depth, perihedral depth and eutomic depth, and we show how to express these and the well-known simplicial and Tukey depths concisely in terms of [Formula: see text]. The perihedral and eutomic depths of [Formula: see text] with respect to [Formula: see text] correspond respectively to the number of subsets of [Formula: see text] whose convex hull contains [Formula: see text], and the number of combinatorially distinct bisections of [Formula: see text] determined by a line through [Formula: see text]. We present algorithms to compute the depth of an arbitrary query point in [Formula: see text] time and medians (deepest points) with respect to these depth measures in [Formula: see text] and [Formula: see text] time respectively. For comparison, these results match or slightly improve on the corresponding best-known running times for simplicial depth, whose definition involves similar combinatorial complexity.

Dimensions of random affine code tree fractals

We study the dimension of code tree fractals, a class of fractals generated by a set of iterated function systems. We first consider deterministic affine code tree fractals, extending to the code tree fractal setting the classical result of Falconer and Solomyak on the Hausdorff dimension of self-affine fractals generated by a single iterated function system. We then calculate the almost sure Hausdorff, packing and box counting dimensions of a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.

Information Recall Using Relative Spike Timing in a Spiking Neural Network

We present a neural network that is capable of completing and correcting a spiking pattern given only a partial, noisy version. It operates in continuous time and represents information using the relative timing of individual spikes. The network is capable of correcting and recalling multiple patterns simultaneously. We analyze the network's performance in terms of information recall. We explore two measures of the capacity of the network: one that values the accurate recall of individual spike times and another that values only the presence or absence of complete patterns. Both measures of information are found to scale linearly in both the number of neurons and the period of the patterns, suggesting these are natural measures of network information. We show a smooth transition from encodings that provide precise spike times to flexible encodings that can encode many scenes. This makes it plausible that many diverse tasks could be learned with such an encoding.

A chaotically driven model climate: extreme events and snapshot attractors

In a low-order chaotic global atmospheric circulation model the effects of deterministic chaotic driving are investigated. As a result of driving, peak-over-threshold type extreme events, e.g. cyclonic activity in the model, become more extreme, with increased frequency of recurrence. When the characteristic time of the driving is comparable to that of the undriven system, a resonance effect with amplified variance shows up. For very fast driving we find a reduced enhancement of variance, which is also the case with white noise driving. Snapshot attractors and their natural measures are determined as a function of time, and a resonance effects is also identified. The extreme value statistics of group maxima is found to follow a Weibull distribution.