In this research, a new method for market-product strategic planning is presented. In this method, an expert system is designed on the basis of identifying important factors that are effective in a firm and analyzing the logical relations between them. The objective is to develop a decision support system (DSS) for helping managers to make strategic decisions. DDS can serve as suitable replacem...

To formulate a single-leg seat inventory control problem in an airline ticket sales system, the concept and techniques of revenue management are applied in this research. In this model, it is assumed the cabin capacity is stochastic and hence its exact size cannot be forecasted in advance, at the time of planning. There are two groups of early-reserving and late-purchasing customers demanding t...

Consider a d k RLL constraint that is contained in a d k RLL con straint where k d and d and x a codeword length q k It is shown that whenever there exist block decodable encoders with codeword length q for those two constraints there exist such encoders where one is a subgraph of the other furthermore both encoders can be decoded by essentially the same de coder Speci cally a d k RLL constrain...

This study aims to cluster and visualize the earthquake data on a geographical map determine earthquakes' characteristics using k-means algorithm. Cluster analysis algorithm was carried out data. K-means is familiar one of well-known techniques have been applied in analysis. One Its advantages scaling large datasets, for example, The used this West Nusa Tenggara from 1991 2021. Applying propose...

We state some new properties on sturmian words and classify words which have, for any non-zero integer n, exactly n+2 subwords of length n. We also introduce notion of insertion k by k on in nite words and we give the complexity function's formula of words got by applying the insertion on sturmian words.

A compressed sensing dynamic MR technique called k-t FOCUSS (k-t FOCal Underdetermined System Solver) has been recently proposed. It outperforms the conventional k-t BLAST/SENSE (Broad-use Linear Acquisition Speed-up Technique/SENSitivity Encoding) technique by exploiting the sparsity of x-f signals. This paper applies this idea to radial trajectories for high-resolution cardiac cine imaging. R...

We prove that any k-uniform hypergraph on n vertices with minimum degree at least n 2(k−1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by Kühn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.

Exercise [2.1.5] Let > 0 and pick K = K( ) finite such that if k ≥ K then r(k) ≤ . Applying the Cauchy-Schwarz inequality for Xi −EXi and Xj −EXj we have that Cov(Xi, Xj) ≤ [Var(Xi)Var(Xj)] ≤ r(0) <∞ for all i, j. Thus, breaking the double sum in Var(Sn) = ∑n i,j=1 Cov(Xi, Xj) into {(i, j) : |i − j| < K} and {(i, j) : |i− j| ≥ K} gives the bound Var(Sn) ≤ 2Knr(0) + n . Dividing by n we see that...

Exercise [2.1.5] Let > 0 and pick K = K( ) finite such that if k ≥ K then r(k) ≤ . Applying the Cauchy-Schwarz inequality for Xi −EXi and Xj −EXj we have that Cov(Xi, Xj) ≤ [Var(Xi)Var(Xj)] ≤ r(0) <∞ for all i, j. Thus, breaking the double sum in Var(Sn) = ∑n i,j=1 Cov(Xi, Xj) into {(i, j) : |i − j| < K} and {(i, j) : |i− j| ≥ K} gives the bound Var(Sn) ≤ 2Knr(0) + n . Dividing by n we see that...