Control charts are widely applied in industrial practice to maintain manufacturing processes in desired operating conditions. Design of control charts aims at finding the best parameters for the operation of chart. In recent years, it has been revealed that the control charts operating with VSI (variable sampling interval) schemes give better performance than with FSI (fixed sampling interval) ...

The increasing intensity of global competition and the rapid advances in information technology (IT) have led organisations to search for more efficient and effective ways to manage their business. With the rapid growth of IT and global complexity, selecting information system projects that further business objectives has become a complex task. This complexity is due to a larger number of alter...

ACCm circuits are circuits consisting of unbounded fan-in AND, OR and MODm gates and unary NOT gates, where m is a fixed integer. We show that there exists a language in non-deterministic exponential time which can not be computed by any non-uniform family of ACCm circuits of quasipolynomial size and o(log log n) depth, where m is an arbitrarily chosen constant.

In this paper a multi-objective mathematical model has been used to optimize grinding parameters include workpiece speed, depth of cut and wheel speed which highly affect the final surface quality. The optimization problem consists three conflict objective functions subject wear production rate constraints. Exact methods can solve NLP in few seconds, therefore using Meta-heuristic algorithms pr...

We study the problem of embedding degree an abelian variety over a finite field. In particular, we show that for prescribed CM field L ≥4, integers m, n and prime ℓ≡1(modm⋅n) splits completely in L, there exists ordinary with endomorphism algebra respect to ℓ full m⋅n ℓ. also class absolutely simple higher dimensional varieties whose algebras are central imaginary quadratic fields.

In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known func...

Let {Bn(x)} denote Bernoulli polynomials. In this paper we generalize Kummer’s congruences by determining Bk(p−1)+b(x)=(k(p − 1) + b) (modp), where p is an odd prime, x is a p-integral rational number and p − 1 b. As applications we obtain explicit formulae for ∑p−1 x=1 (1=x ) (modp ); ∑(p−1)=2 x=1 (1=x ) (modp ); (p − 1)! (modp ) and Ar(m;p) (modp), where k ∈ {1; 2; : : : ; p− 1} and Ar(m;p) i...

We develop quantum fingerprinting technique for constructing quantum branching programs (QBPs), which are considered as circuits with an ability to use classical bits as control variables. We demonstrate our approach constructing optimal quantum ordered binary decision diagram (QOBDD) for MODm Boolean function. The construction of our technique also allows to extend the recent result of Ambaini...