In this paper the problem of sorting in various models of magnetic bubble memory systems is studied. Three basic parameters are of interest, namely, the number of steps to sort, the number of switches required, and th...
详细信息
In this paper the problem of sorting in various models of magnetic bubble memory systems is studied. Three basic parameters are of interest, namely, the number of steps to sort, the number of switches required, and the number of control states necessary for the switches. Several sorting algorithms are proposed with respective running times essentially n2, n/2, 1/2 n log2 n, 7/2 n, n log2n, respective numbers of switches essentially, 1, n, 2√n, 2√nlog2n , 1og2n, and respective numbers of control states essentially, 3, 2, 1/8 log2n, 1/8 log2n, and 3 log2n.
The results of a Monte-Carlo simulation of algorithms for statistical analysis of information from detectors in radiation monitors, recording the presence of random, short-time, weak radioactive radiation, are present...
详细信息
The results of a Monte-Carlo simulation of algorithms for statistical analysis of information from detectors in radiation monitors, recording the presence of random, short-time, weak radioactive radiation, are presented. The Neyman-Pearson test and likelihood ratio, moving average, digital recursive filter, a priori probability, half-sums, and relative dispersion methods are examined. The results of a comparative analysis of the algorithms and the investigation of the possibilities and conditions for realizing their maximum possibilities are presented. The analysis has shown that the moving average method has advantages. It can be replaced by the similarity ratio method in the event of a Poisson distribution and the a priori probability method in the event of a Gaussian distribution. For an average background of not more than 5 with a large separation the moving average and similarity ratio methods are best. Otherwise the digital recursive filter method is best. The best results are obtained by combining the detection method with the moving average method together with likelihood ratio and a priori probability methods.
The optimization versions of the 3-Partitioning and the Kernel 3-Partitioning problems are considered in this paper. For the objective to maximize the minimum load of the m subsets, it is shown that the MODIFIED LPT a...
详细信息
The optimization versions of the 3-Partitioning and the Kernel 3-Partitioning problems are considered in this paper. For the objective to maximize the minimum load of the m subsets, it is shown that the MODIFIED LPT algorithm has performance ratios (3m - 1)/(4m - 2) and (2m - 1)/(3m - 2), respectively, in the worst case.
A general algorithm, called ALG, for online and semi-online scheduling problem Pm || C-max with m >= 2 is introduced. For the semi-online version, it is supposed that all job have their processing times within the ...
详细信息
A general algorithm, called ALG, for online and semi-online scheduling problem Pm || C-max with m >= 2 is introduced. For the semi-online version, it is supposed that all job have their processing times within the interval [p, rp], where p > 0, 1 < r <= m/m - 1. ALG is a generalization of LS and is optimal in the sense that there is not an algorithm with smaller competitive ratio than that of ALG.
This paper revisits the scheduling problem on an unbounded parallel batch machine for minimizing a maximum cost f(max). It was reported in the literature that the decision version of the problem is solvable in O (n(2)...
详细信息
This paper revisits the scheduling problem on an unbounded parallel batch machine for minimizing a maximum cost f(max). It was reported in the literature that the decision version of the problem is solvable in O (n(2) + n log P) time, where n is the number of jobs and P is the total processing time of jobs. This implies that the optimization version for minimizing fmax can be solved in weakly polynomial time. But a strongly polynomial-time algorithm has not been provided for this problem. In this paper, we present an O (n(4))-time algorithm for the Pareto optimization problem for minimizing C-max and f(max), where Cam is the maximum completion time of jobs. Consequently, the problem for minimizing fmax can also be solved in O (n(4)) time. (C) 2015 Elsevier B.V. All rights reserved.
The field of medical imaging has progressed dramatically. Advances have been both methodological (vision and analysisalgorithms) and technological (processing, storage, and communication), despite often troublesome s...
详细信息
The field of medical imaging has progressed dramatically. Advances have been both methodological (vision and analysisalgorithms) and technological (processing, storage, and communication), despite often troublesome shortcomings. The author discusses the application of virtual reality, virtual sensor modelling and image rendering in the medical field. He shows the initial outline of a navigation into 3D discrete arrays.
The algorithms for analysis of shape and size of a cavity in a hydrate framework are considered. As an example, the framework structure of cubic structure II is analyzed. (c) 2005 Pleiades Publishing, Inc.
The algorithms for analysis of shape and size of a cavity in a hydrate framework are considered. As an example, the framework structure of cubic structure II is analyzed. (c) 2005 Pleiades Publishing, Inc.
In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off\|line or on\|line environment. But in practice, problems are often not really off\|line or on\|line but someh...
详细信息
In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off\|line or on\|line environment. But in practice, problems are often not really off\|line or on\|line but somehow in between. This means that, with respect to the on\|line problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi on\|line ones. The authors studied two semi on\|line multiprocessor scheduling problems, in which, the total processing time of all tasks is known in advance, or all processing times lie in a given interval. They proposed approximation algorithms for minimizing the makespan and analyzed their performance guarantee. The algorithms improve the known results for 3 or more processor cases in the literature.
Fibonacci words are among those words containing a repetition, i.e., at least 2 consecutive equal factors. Main and Lorentz have introduced an algorithm to find one repetition or square in a word. In the word aababb...
详细信息
Fibonacci words are among those words containing a repetition, i.e., at least 2 consecutive equal factors. Main and Lorentz have introduced an algorithm to find one repetition or square in a word. In the word aababba, for example, abab is a repetition or square. An algorithm is presented to compute all the repetitions of factors in a word. The algorithm uses an improved version of the well-known partitioning technique. Proofs are presented to demonstrate that the new algorithm, referred to as REP, is optimal in the class of algorithms computing all the repetitions of a word. Proofs also are presented to show that an associated procedure, REPMAX, is optimal in the class of algorithms computing all the maximal repetitions of a word.
Following the model introduced by Aguech et al. (Probab Eng Inf Sci 21:133-141, 2007), the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We an...
详细信息
Following the model introduced by Aguech et al. (Probab Eng Inf Sci 21:133-141, 2007), the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyse weighted depths of nodes with given labels, the last inserted node, nodes ordered as visited by the depth first search process, the weighted path length and the weighted Wiener index in a random binary search tree. We establish three regimes of nodes depending on whether the second-order behaviour of their weighted depths follows from fluctuations of the keys on the path, the depth of the nodes or both. Finally, we investigate a random distribution function on the unit interval arising as scaling limit for weighted depths of nodes with at most one child.
暂无评论