Results 1 to 10 of about 1,193,354 (264)
Dual Density Operators and Natural Language Meaning [PDF]
Density operators allow for representing ambiguity about a vector representation, both in quantum theory and in distributional natural language meaning.
Daniela Ashoush, Bob Coecke
doaj +4 more sources
Density-Distance Outlier Detection Algorithm Based on Natural Neighborhood
Outlier detection is of great significance in the domain of data mining. Its task is to find those target points that are not identical to most of the object generation mechanisms.
Jiaxuan Zhang, Youlong Yang
doaj +3 more sources
Fiber density can be used to estimate composite weight and to evaluate fiber content for property predictions in fiber-reinforced composites. Yet, natural fibers don’t have fixed density value given on datasheet and their density measurement is affected ...
Abebayehu Abdela +4 more
doaj +3 more sources
Chlodowsky type $\left( \lambda,q\right)$-Bernstein Stancu operators of Pascal rough triple sequences [PDF]
The fundamental concept of statistical convergence first was put forward by Steinhaus and at the same time but also by Fast \cite{Fast} independently both for complex and real sequences. In fact, the convergence in terms of statistical manner can be
Ayhan Esi +2 more
doaj +1 more source
Natural Density and the Quantifier “Most” [PDF]
This paper proposes a formalization of the class of sentences quantified by \textit{most}, which is also interpreted as {\em proportion of} or {\em majority of} depending on the domain of discourse. We consider sentences of the form "\textit{Most A are B}", where \textit{A} and \textit{B} are plural nouns and the interpretations of $ A $ and $ B $ are ...
Selçuk Topal, Ahmet Çevik
openaire +3 more sources
STATISTICAL BOUNDED SEQUENCES OF BI-COMPLEX NUMBERS
In this paper, we extend statistical bounded sequences of real or complex numbers to the setting of sequences of bi-complex numbers. We define the statistical bounded sequence space of bicomplex numbers b^* ∞and also define the statistical bounded ...
S. Bera, B. Ch. Tripathy
doaj +1 more source
On the Parity of the Order of Appearance in the Fibonacci Sequence
Let (Fn)n≥0 be the Fibonacci sequence. The order of appearance function (in the Fibonacci sequence) z:Z≥1→Z≥1 is defined as z(n):=min{k≥1:Fk≡0(modn)}.
Pavel Trojovský
doaj +1 more source
The Proof of a Conjecture on the Density of Sets Related to Divisibility Properties of z(n)
Let (Fn)n be the sequence of Fibonacci numbers. The order of appearance (in the Fibonacci sequence) of a positive integer n is defined as z(n)=min{k≥1:n∣Fk}.
Eva Trojovská, Venkatachalam Kandasamy
doaj +1 more source
The Proof of a Conjecture Related to Divisibility Properties of z(n)
The order of appearance of n (in the Fibonacci sequence) z(n) is defined as the smallest positive integer k for which n divides the k—the Fibonacci number Fk. Very recently, Trojovský proved that z(n) is an even number for almost all positive integers n (
Eva Trojovská, Kandasamy Venkatachalam
doaj +1 more source
On Some Properties of the Limit Points of (z(n)/n)n
Let (Fn)n≥0 be the sequence of Fibonacci numbers. The order of appearance of an integer n≥1 is defined as z(n):=min{k≥1:n∣Fk}. Let Z′ be the set of all limit points of {z(n)/n:n≥1}.
Eva Trojovská, Kandasamy Venkatachalam
doaj +1 more source

