These article is shown possibility for efficiency activity enterprises improvement by MRPIL/ERP (Manufactory Recourse Planning/Enterprise Recourse Planning) systems implementation. These instruction is devoted to ERP-...
详细信息
ISBN:
(纸本)0780389433
These article is shown possibility for efficiency activity enterprises improvement by MRPIL/ERP (Manufactory Recourse Planning/Enterprise Recourse Planning) systems implementation. These instruction is devoted to ERP-system Axapta 3.0, developing Microsoft Business Solution company. A rise of enterprises activity suggest to carry out in the context of logistics management loop by means of systematization and all-round automation of purchase orders, processing of requests, bills, invoices and so forth.
The author presents and analyzes various algorithms for generating positive integer-valued random variables when the distribution is described either through the generating function sigma(i)infinity = 0 P(i)S(i) or vi...
详细信息
The author presents and analyzes various algorithms for generating positive integer-valued random variables when the distribution is described either through the generating function sigma(i)infinity = 0 P(i)S(i) or via the sequence of moments.
Despite years of railway control and signalling development, modern formal description methods are still not widely used. Lack of standards in the interlocking logic construction method causes the development of the r...
详细信息
Despite years of railway control and signalling development, modern formal description methods are still not widely used. Lack of standards in the interlocking logic construction method causes the development of the railway control systems to be more and more expensive. Moreover, the microprocessor technology used nowadays reaches its limits regarding signal processing time in decentralised systems. This forces the industry to seek for new solutions. This paper presents an algorithmic approach to interlocking logic development, together with a modern implementation methods using hardware description languages and programmable devices. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
The use of Green's theorem and bivariate difference calculus provides a general and unifying framework for the description and generation of incremental algorithms. The method is applied in order to provide algori...
详细信息
The use of Green's theorem and bivariate difference calculus provides a general and unifying framework for the description and generation of incremental algorithms. The method is applied in order to provide algorithms computing various statistics about polyominoes coded by 4-letter words describing their contour. These statistics include area, coordinates of the center of gravity, moment of inertia, size of projections, hook lengths, number of pixels in common with a given set of pixels, in particular the intersection of two polyominoes and also q-statistics for projections. (c) 2004 Elsevier B.V. All rights reserved.
Changing illumination condition can change the result of image segmentation algorithm and reduce the intelligent recognition rate. A novel color image segmentation method robust to illumination variations is presented...
详细信息
Changing illumination condition can change the result of image segmentation algorithm and reduce the intelligent recognition rate. A novel color image segmentation method robust to illumination variations is presented. The method is applied to the skin segmentation. Based on the hue preserving algorithm, the method reduces the dimensionality of the red-green-blue （RGB） space to one dimension, while keeping the hue of every pixel unchanging before and after space transformation. In the new color space, the skin color model is established using Gaussian model. Experimental results show that the method is robust to illumination variations, and has low computational complexity.
We study the problem of testing whether a given set of sequenced jobs can tolerate transient faults. We present efficient algorithms for this problem in several fault models. A fault model describes what types of faul...
详细信息
We study the problem of testing whether a given set of sequenced jobs can tolerate transient faults. We present efficient algorithms for this problem in several fault models. A fault model describes what types of faults are allowed and specifies assumptions on their frequency. Two types of faults are considered: hidden faults, that can only be detected after a job completes, and exposed faults, that can be detected immediately. First, we give an O(n)-time fault-tolerance testing algorithm, for both exposed and hidden faults, if the number of faults does not exceed a given parameter k. Then we consider the model in which any two faults are separated in time by a gap of length at least Delta, where Delta is at least twice the maximum job length. For exposed faults, we give an O(n)-time algorithm. For hidden faults, we give an algorithm with running time O(n(2)), and we prove that if job lengths are distributed uniformly over an interval [0, p(max)], then this algorithm's expected running time is O(n). Our experimental study shows that this linear-time performance extends to other distributions. Finally, we provide evidence that improving the worst-case performance may not be possible, by proving an Omega(n(2)) lower bound, in the algebraic computation tree model, on a slight generalization of this problem.
This paper reviews some of the recent advances in the development of algorithms for wireless sensor networks. We focus on sensor deployment and coverage, routing, and sensor fusion.
This paper reviews some of the recent advances in the development of algorithms for wireless sensor networks. We focus on sensor deployment and coverage, routing, and sensor fusion.
Given a set S of n points in R-2, the Oja depth of a point theta is the sum of the areas of all triangles formed by theta and two elements of S. A point in R-2 with minimum depth is an Oja median. We show how an Oja m...
详细信息
Given a set S of n points in R-2, the Oja depth of a point theta is the sum of the areas of all triangles formed by theta and two elements of S. A point in R-2 with minimum depth is an Oja median. We show how an Oja median may be computed in O(n log(3) n) time. In addition, we present an algorithm for computing the Fermat-Torricelli points of n lines in O(n) time. These points minimize the sum of weighted distances to the lines. Finally, we propose an algorithm which computes the simplicial median of S in O(n(4)) time. This median is a point in R-2 which is contained in the most triangles formed by elements of S. (C) 2003 Elsevier Science B.V. All rights reserved.
Let S be a set of convex polygons in the plans with a total of ii vertices, where a polygon consists of the boundary as well as the interior. Efficient algorithms are given for counting and for reporting output-sensit...
详细信息
Let S be a set of convex polygons in the plans with a total of ii vertices, where a polygon consists of the boundary as well as the interior. Efficient algorithms are given for counting and for reporting output-sensitively the I pairs of polygons that intersect. The algorithm for the counting problem tales O(n(4/3+epsilon)) time and the algorithm for the reporting problem takes O(n(4/3+epsilon) + I) time, where epsilon > 0 is an arbitrarily small constant. The result is based on an interesting characterization of the intersection of two convex polygons in terms of the intersection of certain trapezoids from their trapezoidal decomposition. The problem is interesting and challenging because the output size, I, can be much smaller than the total number of intersections between the polygons and because the number of polygons and their sizes can depend on n. (C) 1999 Elsevier Science B.V. All rights reserved.
This paper outlines an algorithm for optimum linear ordering (OLO) of a weighted parallel graph with O(n log k) worst-case time complexity, and O(n + k log(n/k) log k) expected-case time complexity, where n is the tot...
详细信息
This paper outlines an algorithm for optimum linear ordering (OLO) of a weighted parallel graph with O(n log k) worst-case time complexity, and O(n + k log(n/k) log k) expected-case time complexity, where n is the total number of nodes and k is the number of chains in the parallel graph. Next, the two-layer OLO problem is considered, where the goal is to place the nodes linearly in two routing layers minimizing the total wire length. The two-layer problem is shown to subsume the maxcut problem and a befitting heuristic algorithm is proposed. Experimental results on randomly generated samples show that the heuristic algorithm runs very fast and outputs optimum solutions in more than 90% instances.
暂无评论