This paper discusses the estimation and plug-in kriging prediction of a non-stationary spatial process assuming a smoothly varying variance function with an additive independent measurement error. A difference-based kernel smoothing estimator of the variance function and a modified likelihood estimator of the measurement error variance are used for parameter estimation. Asymptotic properties of...

This report constitutes the Doctoral Dissertation for Michael Perregaard and is a collection of results on the efficient generation of disjunctive cuts for mixed integer programs. Disjunctive cuts is a very broad class of cuts for mixed integer programming. In general, any cut that can be derived from a disjunctive argument can be considered a disjunctive cut. Here we consider specifically cuts...

We present a new framework for learning disjunctive logic programs from interpretation transitions, called LFDT. It is a nontrivial extension to Inoue, Ribeiro and Sakama’s LF1T learning framework, which learns normal logic programs from interpretation transitions. Two resolutions for disjunctive rules are also presented and used in LFDT to simplify learned disjunctive rules.

It is known that bottom-up query evaluation can be extended to work with disjunctive facts, but there seems to be the common assumption that it is much too ineecient for practical applications. In this paper, we improve the extended bottom-up evaluation by making the resolvable literal in a disjunctive fact unique. In many cases, this reduces an exponential behaviour to a polynomial one. We app...

One of the major hurdles to implementing a practical disjunctive database is the CoNP-completeness of executing queries. We demonstrate, however, that this problem is similar to the problem of computing the transitive closure of a node in a disjunctive graph. While this problem is also CoNP-complete in general, we show in this paper that there is a polynomial-time solution that solves it for ce...

It is now common practice to use structured sets of features to describe syntactic structures, and to compare such structured sets by some form of unification. It is extremely tempting to try to encode disjunctive information within this framework; unfortunately, general unification of disjunctive structures is NPcomplete, which is not a desirable property for the basic operation involved in co...

Method for reducing the number of wild animal monitors is proposed by means of Kriging. Through wild animal route of simulations with 128 by 128 cells, the required number of wild animal monitors is clarified. Then it is found that the number of wild animal monitors can be reduced based on Kriging by using variograms and semi-variograms among the neighboring monitors. Also, it is found that the...

Consideration of the mining method is an essential component of ore reserves evaluation. This is particularly true where the profitability of a project is conditioned by the ability to mine selectively. Linear estimation methods such as Ordinary and Simple Kriging commonly fail to provide unbiased estimates of recovered ore tonnage and metal content which means that a mining project can be expo...

A lot of different proposals were made claiming to extend the wellfounded semantics to logic programs with disjunction. None of these however has been established as ’the’ disjunctive well-founded semantics which is mainly caused by the different intuitive ideas on which these semantics are based. In fact, some of them are even incomparable with respect to their derivable knowledge, and systema...

In both human and artificial societies some activities are only allowed to coalitions that satisfy certain criteria, e.g., to sufficiently large coalitions or coalitions which involve players of sufficient seniority. Simmons (1988) formalised this idea in the context of secret sharing schemes by defining the concept of a (disjunctive) hierarchical access structure. The mathematical concept whic...