Methods and first results of plasma non-isothermal parameters measurements in meteor trails

There is no reliable experimental evidence so far of either the presence or absence of nonisothermal effects in newly formed meteor trails. Neither is there a common opinion on the most effective mechanism of electron cooling. According to the laboratory experimental data collisions of atomic and molecular particles of all kinds having velocities of 10 to 70/kms often yields 1 eV electrons and not infrequently some have energies reaching several electron volts. These highest energy electrons are referred to as superhot electrons. The method of measurement and the results of these measurements in meteor trails are discussed

Geostatistical mapping and spatial variability of surficial sediment types on the Beaufort Sea shelf based on grain size data

The nearshore Beaufort Sea is a sensitive marine environment that is also the focus of oil and gas exploration. Offshore, the Beaufort Sea contains large potential reserves of hydrocarbons. Any future exploitation of these resources will present unique engineering challenges and will require an understanding of the processes that govern stability, nearshore morphology and sediment properties in the extensive shallow coastal zone of the Beaufort Sea shelf. Knowledge of the surficial sediment distribution is, therefore, necessary to provide a framework for understanding sediment stability, sediment transport, platform foundation conditions and to balance engineering challenges with environmental concerns, resource development and precautionary sustainable management. We describe an approach for a quality controlled mapping of grain sizes and sediment textures for the Beaufort Sea shelf in the Canadian Arctic. The approach is based on grain size data sampled during the period 1969-2008. A replenishment of grain size data since the 1980’s, as well as the consideration of correlating parameters (bathymetry, slope and sediment input) to a cokriging algorithm, amends the former way of mapping the surficial sediments of the Beaufort Sea shelf. Subsequent to data processing and applying autocorrelation, four single grids (clay, silt, sand and gravel) were generated from grain size data by ordinary kriging and cokriging. Cokriging also considered parameters that influence sediment texture such as bathymetry, slope, cost distance from the Mackenzie River and data anisotropy (directional dependency). The cokriging algorithm expressed as a variogram was quality controlled by cross-validation and predicted standard errors (PSEs). PSE values express a maximum deviation of modeled from the real values and therefore help to estimate the quality in these regions regarding the interpolation results for each grain size range. A sediment type classification scheme applied to the set of clay, silt, sand and gravel content maps resulted in a sediment type map of the Beaufort Sea shelf. The PSEs of ordinary kriging and cokriging have been compared and showed that the cokriging technique provided superior interpolation results for silt and slightly improved results for clay and sand. Cokriging was able to capture most of the small variations in the sediment texture distribution. Furthermore, reduced nugget effects confirmed that the cost distance grid was a better indicator for sediment texture when compared to bathymetry and slope. For gravel, ordinary kriging achieved better prediction probabilities and was, therefore, used for generation of the distribution map for this grain size class. The use of cokriging and ordinary kriging greatly enhanced interpolation estimates without additional sampling. Especially in nearshore regions, like the Beaufort Sea shelf, geostatistical interpolation techniques are very useful for evaluating seabed sediment texture because sampling is often difficult or impossible due to ice conditions or even prohibited near oil platforms. The described methodology along with the inclusion of recent data, provided an improved mapping of the surficial sediments of the Beaufort Sea shelf

Conjunctive queries with negation over DL-Lite: a closer look

While conjunctive query (CQ) answering over DL-Lite has been studied extensively, there have been few attempts to analyse CQs with negated atoms. This paper deepens the study of the problem. Answering CQs with safe negation and CQs with a single inequality over DL-Lite with role inclusions is shown to be undecidable, even for a fixed TBox and query.Without role inclusions, answering CQs with one inequality is P-hard and with two inequalities CoNP-hard in data complexity

Beyond Well-designed SPARQL

SPARQL is the standard query language for RDF data. The distinctive feature of SPARQL is the OPTIONAL operator, which allows for partial answers when complete answers are not available due to lack of information. However, optional matching is computationally expensive - query answering is PSPACE-complete. The well-designed fragment of SPARQL achieves much better computational properties by restricting the use of optional matching - query answering becomes coNP-complete. However, well-designed SPARQL captures far from all real-life queries - in fact, only about half of the queries over DBpedia that use OPTIONAL are well-designed. In the present paper, we study queries outside of well-designed SPARQL. We introduce the class of weakly well-designed queries that subsumes well-designed queries and includes most common meaningful non-well-designed queries: our analysis shows that the new fragment captures about 99% of DBpedia queries with OPTIONAL. At the same time, query answering for weakly well-designed SPARQL remains coNP-complete, and our fragment is in a certain sense maximal for this complexity. We show that the fragment\u27s expressive power is strictly in-between well-designed and full SPARQL. Finally, we provide an intuitive normal form for weakly well-designed queries and study the complexity of containment and equivalence

Stratified Negation in Limit Datalog Programs

There has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation are delegated to a general-purpose query engine. Existing declarative languages for data analysis can be formalised as variants of logic programming equipped with arithmetic function symbols and/or aggregation, and are typically undecidable. In prior work, the language of $\mathit{limit\ programs}$ was proposed, which is sufficiently powerful to capture many analysis tasks and has decidable entailment problem. Rules in this language, however, do not allow for negation. In this paper, we study an extension of limit programs with stratified negation-as-failure. We show that the additional expressive power makes reasoning computationally more demanding, and provide tight data complexity bounds. We also identify a fragment with tractable data complexity and sufficient expressivity to capture many relevant tasks.Comment: 14 pages; full version of a paper accepted at IJCAI-1

Foundations of Declarative Data Analysis Using Limit Datalog Programs

Motivated by applications in declarative data analysis, we study $\mathit{Datalog}_{\mathbb{Z}}$---an extension of positive Datalog with arithmetic functions over integers. This language is known to be undecidable, so we propose two fragments. In $\mathit{limit}~\mathit{Datalog}_{\mathbb{Z}}$ predicates are axiomatised to keep minimal/maximal numeric values, allowing us to show that fact entailment is coNExpTime-complete in combined, and coNP-complete in data complexity. Moreover, an additional $\mathit{stability}$ requirement causes the complexity to drop to ExpTime and PTime, respectively. Finally, we show that stable $\mathit{Datalog}_{\mathbb{Z}}$ can express many useful data analysis tasks, and so our results provide a sound foundation for the development of advanced information systems.Comment: 23 pages; full version of a paper accepted at IJCAI-17; v2 fixes some typos and improves the acknowledgment

Variable damping and coherence in a high-density magnon gas

We report on the fast relaxation behavior of a high-density magnon gas created by a parametric amplification process. The magnon gas is probed using the technique of spin-wave packet recovery by parallel parametric pumping. Experimental results show a damping behavior which is in disagreement with both the standard model of exponential decay and with earlier observations of non-linear damping. In particular, the inherent magnon damping is found to depend upon the presence of the parametric pumping field. A phenomenological model which accounts for the dephasing of the earlier injected magnons is in good agreement with the experimental data

CONSTRUCT Queries in SPARQL

SPARQL has become the most popular language for querying RDF datasets, the standard data model for representing information in the Web. This query language has received a good deal of attention in the last few years: two versions of W3C standards have been issued, several SPARQL query engines have been deployed, and important theoretical foundations have been laid. However, many fundamental aspects of SPARQL queries are not yet fully understood. To this end, it is crucial to understand the correspondence between SPARQL and well-developed frameworks like relational algebra or first order logic. But one of the main obstacles on the way to such understanding is the fact that the well-studied fragments of SPARQL do not produce RDF as output. In this paper we embark on the study of SPARQL CONSTRUCT queries, that is, queries which output RDF graphs. This class of queries takes rightful place in the standards and implementations, but contrary to SELECT queries, it has not yet attracted a worth-while theoretical research. Under this framework we are able to establish a strong connection between SPARQL and well-known logical and database formalisms. In particular, the fragment which does not allow for blank nodes in output templates corresponds to first order queries, its well-designed sub-fragment corresponds to positive first order queries, and the general language can be re-stated as a data exchange setting. These correspondences allow us to conclude that the general language is not composable, but the aforementioned blank-free fragments are. Finally, we enrich SPARQL with a recursion operator and establish fundamental properties of this extension