This paper is to study how to conduct the sequential change point detection only known the possible region of fault magnitudes but unknown the exact fault magnitude, which is a common situation in reality in process change detection problem. It is well known that sequential change detection using log likelihood ratio statistics has the following optimal properties in error probabilities when co...

this paper presents a model for constrained multiobjective optimization of mixed-cropping planning. the decision challenges that are normally faced by farmers include what to plant, when to plant, where to plant and how much to plant in order to yield maximum output. consequently, the central objective of this work is to concurrently maximize net profit, maximize crop production and minimize pl...

Given a non-principal Dirichlet character χ (mod q), an important problem in number theory is to obtain good estimates for the size of L(1, χ). The best bounds known give that q−ǫ ≪ǫ |L(1, χ)| ≪ log q, while assuming the Generalized Riemann Hypothesis, J.E. Littlewood showed that 1/ log log q ≪ |L(1, χ)| ≪ log log q. Littlewood’s result reflects the true range of the size of |L(1, χ)| as it is ...

We present output sensitive techniques for the generalized reporting versions of the planar range maxima problem and the planar range convex hull problem. Our solutions are in the pointer machine model, for orthogonal range queries on a static point set. We solve the planar range maxima problem for two-sided, three-sided and four-sided queries. We achieve a query time of O(log n+c) using O(n) s...

We make an observation which enables one to deduce the existence of an algebraic stack of log maps for all generalized Deligne– Faltings log structures (in particular simple normal crossings divisor) from the simplest case with characteristic generated by N (essentially the smooth divisor case).

We find sufficient conditions for log-convexity and log-concavity for the functions of the forms a 7→ ∑ fk(a)kx , a 7→ ∑ fkΓ(a + k)x k and a 7→ ∑ fkx k/(a)k. The most useful examples of such functions are generalized hypergeometric functions. In particular, we generalize the Turán inequality for the confluent hypergeometric function recently proved by Barnard, Gordy and Richards and log-convexi...

Sequence pattern mining is one of the most important methods for mining WWW access log. The Apriori algorithm is well known as a typical algorithm for sequence pattern mining. However, it suffers from inherent difficulties in finding long sequential patterns and in extracting interesting patterns among a huge amount of results. This article proposes a new method for finding generalized sequence...

In this paper, three state of the art non-stationary sinusoidal analysis methods based on Fourier transform (FT) are compared the derivative method, reassignment and generalized reassignment. 1 The derivative method and reassignment were designed to analyze linear log-AM/linear FM sinusoids. Generalized reassignment can analyze sinusoids containing arbitrary order modulations, however the discu...

We consider L-functions \(L_1,\ldots ,L_k\) from the Selberg class which have polynomial Euler product and satisfy Selberg’s orthonormality condition. show that on every vertical line \(s=\sigma +it\) with \(\sigma \in (1/2,1)\), these simultaneously take large values of size \(\exp \left( c\frac{(\log t)^{1-\sigma }}{\log \log t}\right) \) inside a small neighborhood. Our method extends to =1\...