In this paper, we introduce a variation of the wellstudied Yao graphs. Given a set of points S ⊂ R and an angle 0 < θ ≤ 2π, we define the continuous Yao graph cY (θ) with vertex set S and angle θ as follows. For each p, q ∈ S, we add an edge from p to q in cY (θ) if there exists a cone with apex p and aperture θ such that q is the closest point to p inside this cone. We study the spanning ratio...

Let K denote a field. Let d denote a nonnegative integer and consider a sequence p = (θi, θ ∗ i , i = 0...d;φj , φj , j = 1...d) consisting of scalars taken from K. We call p a parameter array whenever: (PA1) θi 6= θj, θ ∗ i 6= θ ∗ j if i 6= j, (0 ≤ i, j ≤ d); (PA2) φi 6= 0, φi 6= 0 (1 ≤ i ≤ d); (PA3) φi = φ1 ∑i−1 h=0 θh−θd−h θ0−θd + (θ i − θ ∗ 0)(θi−1 − θd) (1 ≤ i ≤ d); (PA4) φi = φ1 ∑i−1 h=0 ...

MAIN TEXT A natural temporal extension of the relational calculus allows explicit variables and quantification over a given time domain, in addition to the variables and quantifiers over a data domain of uninterpreted constants. The language is simply the two-sorted version (variables and constants are temporal or non-temporal) of first-order logic over a data domain D and a time domain T . The...

Kodlama teorisinde, lineer kodların özel bir sınıfı olan devirli kodlar ile ilgili araştırmalar büyük ilgi görmektedir. Bu ilginin en önemli nedenlerinden bazıları zengin cebirsel özelliklere sahip olmaları, birçok uygulama alanlarının bulunması, kodlama ve kod çözmede kolaylık sağlamaları olarak sayılabilir. Devirli sabit-devirli, parçalı yarı burmalı gibi genellemeleri bulunmaktadır. genellem...

This paper aims to investigate properties of involution palindrome languages. Let θ be either a morphic or antimorphic involution. we show that if θ is an antimorphic involution, then the set of all θ-palindrome words is a proper subset of all skew θ-palindrome words. We give a characterization for that a word is skew θ-palindrome. That is, A word is skew θ-palindrome if and only if it is a pro...

1 Frame of the first-order asymptotic decision theory Consider a sequence of statistical experiments ET = (X T ,AT , {P T θ }θ∈Θ) (T ∈ R+). Let θ̂T : X T → Θ be a sequence of estimators of the unknown parameter θ. A basic property θ̂T should have is the consistency : θ̂T →PT θ θ (T → ∞) for every θ ∈ Θ. The analyst should not use any estimator without checking this property. For example, if one us...

In the present paper we introduced the notion of (θ ,φ)-derivations of a BCI-algebra X . Some interesting results on inside (or outside) (θ ,φ)-derivations in BCI-algebras are discussed. It is shown that for any commutative BCI-algebra X , every inside (θ ,φ)derivation of X is isotone. Furthermore it is also proved that for any outside (θ ,φ)-derivation d(θ ,φ) of a BCI-algebra X , d(θ ,φ)(x) =...

In Bayesian analysis, the posterior follows from the data and a choice of a prior and a likelihood. One hopes that the posterior is robust to reasonable variation in the choice of prior, since this choice is made by the modeler and is often somewhat subjective. A different, equally subjectively plausible choice of prior may result in a substantially different posterior, and so different conclus...

In previous lectures, we have analyzed random forms of optimization problems, in which the randomness was injected (via random projection) for algorithmic reasons. On the other hand, in statistical problems—even without considering approximations—the starting point is a random instance of an optimization problem. To be more concrete, suppose that we are interested in estimating some parameter θ...