Although automation and control systems continue to grow in scope and complexity, end users seem inclined to devote fewer in-house resources to develop and maintain them. Many manufacturers have eliminated their staff...
详细信息
Although automation and control systems continue to grow in scope and complexity, end users seem inclined to devote fewer in-house resources to develop and maintain them. Many manufacturers have eliminated their staff engineering positions entirely, preferring to hire the help they need when the need arises. As manufacturers outsource more automation engineering work, the system integration business has grown dramatically. A survey for the 1999 Automation Integrator Guide identified more than a thousand engineering companies that can provide some or all of the services required for their clients' automation projects.
With text processing growing in importance as a computer application, the problems of sorting and merging will be encountered with increasing frequency. Various techniques have been used in ordering alphabetic strings...
详细信息
With text processing growing in importance as a computer application, the problems of sorting and merging will be encountered with increasing frequency. Various techniques have been used in ordering alphabetic strings, but text processing, involving upper- and lower-case alphabets, introduces an extra degree of freedom and complexity to the problem. This paper presents APL models of a solution for the generalized sorting problem.
This paper presents some modifications of stable merging by decomposition (referred to as DM here). The changes made reduce the time requirements considerably. Furthermore, a O(1)-space version of merging is described...
详细信息
This paper presents some modifications of stable merging by decomposition (referred to as DM here). The changes made reduce the time requirements considerably. Furthermore, a O(1)-space version of merging is described. The modifications of DM resemble improvements to the original Quicksort method for sorting, since both the algorithms are of the same generic scheme.
It has been said that the greatest challenge for the future of computers in industrial engineering is not the further development of new systems or new architectures, rather it is the expansion of the usefulness of th...
详细信息
It has been said that the greatest challenge for the future of computers in industrial engineering is not the further development of new systems or new architectures, rather it is the expansion of the usefulness of the powerful tools we already possess. The efficient use of a system or software package is dependent on the non-machine interface. The use of menus has long been viewed as a effective way of implementing this interface. But an inappropriate menu design can obscure useful functions and prevent the user from accessing the full power of a system. This paper discusses such menu features as size, shape, content and organization (layout). Cursor control and the use of texture formatting (highlighting, blinking, etc.) are also covered. A survey of the main principles of menu design as presented in the literature is discussed. This survey is followed by a description of an extensive menu-driven system developed by the authors. How the principles proposed by other researchers were integrated or adapted is discussed; as well as the introduction of new concepts. All this is condensed into a set of practical guidelines for menu designers.
Programmers plagued by the microcomputer development gaps of Pascal can get a helping hand from a language development system that edits, compiles, integrates, and debugs programs. Called LANDS, the system represents ...
详细信息
Programmers plagued by the microcomputer development gaps of Pascal can get a helping hand from a language development system that edits, compiles, integrates, and debugs programs. Called LANDS, the system represents a high-level tool that can be used for the entire software cycle, from initial editing of the source code to the final stages of debugging in the prototype hardware environment. Together the elements of the LANDS package meet the development needs of a Pascal-based design. The system compiler makes the system suitable for designing real-time software, as shown by an illustrative example.
The methods discussed here employ internal parallel sorting with subsequent external parallel merging. They differ from each other in the last sorting phase (merging). The proposed methods provide considerably better ...
详细信息
The methods discussed here employ internal parallel sorting with subsequent external parallel merging. They differ from each other in the last sorting phase (merging). The proposed methods provide considerably better estimates than the known similar methods.
The method of sorting by address calculation is seldom discussed in the literature although it has been around for nearly three decades. This paper presents and discusses a sorting algorithm which is similar to the ad...
详细信息
The method of sorting by address calculation is seldom discussed in the literature although it has been around for nearly three decades. This paper presents and discusses a sorting algorithm which is similar to the address calculation sort method of Isaac and Singleton. Our algorithm is based on finding the smallest and the largest keys and makes use of assign and test-zero type operations. The complexity of the algorithm depends on a certain parameter. Under certain conditions, it is shown that the behaviour of the algorithm is linear. For another range of values of the parameter the algorithm is comparable to other good sorting algorithms. The algorithm is compared with the recursive Quicksort algorithm and comparative timings are given to illustrate its efficiency.
Two sorting algorithms are described, general_cycle_sort, and special_cycle_sort, based upon the decomposability of a permutation into a product of cyclic permutations. Under the conditions in which these algorithms a...
详细信息
Two sorting algorithms are described, general_cycle_sort, and special_cycle_sort, based upon the decomposability of a permutation into a product of cyclic permutations. Under the conditions in which these algorithms are applicable, the sorting can be accomplished in linear time.
The Karp-Miller-Rosenberg (1972) algorithm was one of the first efficient (almost linear) sequential algorithms for finding repeated patterns and for string matching. In the area of efficient sequential computations o...
详细信息
The Karp-Miller-Rosenberg (1972) algorithm was one of the first efficient (almost linear) sequential algorithms for finding repeated patterns and for string matching. In the area of efficient sequential computations on strings it was soon superseded by more efficient (and more sophisticated) algorithms. We show that the Karp-Miller-Rosenberg algorithm (KMR) must be considered as a basic technique in parallel computations. For many problems, variations of KMR must be considered as a basic technique in parallel computations. For many problems, variations of KMR give the (known) most efficient parallel algorithms. The representation of the set of basic factors (subarrays) of a string (array) produced by the algorithm is an extremely useful data structure in parallel algorithms on strings and arrays. This gives also a general unifying framework for a large variety of problems. We show that the following problems for strings and arrays can be solved by almost optimal parallel algorithms: pattern-matching, longest repeated factor (subarray), longest common factor (subarray), maximal symmetric factor (subarray). Also the following problems for strings can be solved within the same complexity bounds: finding squares, testing even palstars and compositions of k palindromes for k = 2, 3, 4, computing Lyndon factorization and building minimal pattern-matching automata. In the model without concurrent writes the parallel time is O(log(n)2) (with n processors) and in the model with concurrent writes the time, for most of the problems, is O(log(n)) (with n processors). For two problems related to the one-dimensional case (longest repeated factor and longest common factor) there were designed parallel algorithms using suffix trees (Apostolico et al. 1988). However, our data structure is simpler and, furthermore, for the two-dimensional case suffix trees do not work. The complexity of our algorithms does not depend on the size of the alphabet, except for the computation of pattern-
This paper has described hardware extensions to System/370 to provide multiprocessing. While the emphasis is upon tightly-coupled implementation through MP hardware and o s l v s 2 Release 2, the characteristics of lo...
详细信息
This paper has described hardware extensions to System/370 to provide multiprocessing. While the emphasis is upon tightly-coupled implementation through MP hardware and o s l v s 2 Release 2, the characteristics of loosely-coupled systems have been sketched out for contrasTt.h e comparison of IBM multiprocessors has been included to provide a rationale for thee volution of System/370 multiprocessing architecture with significant differences from and improvements upon prior System/360 implementation.
暂无评论