Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.     

Risk evaluations for the courts: Is service quality a function of specialization?

Psychologists are often asked to testify in court. However, concerns have been expressed in both the legal and psychological literatures about the quality of these services. This article presents survey results comparing the practice patterns of generally licensed psychologists with those of specialist forensic diplomates in providing risk evaluations. Results suggest that general clinicians frequently perform these evaluations, but forensic diplomates use more modern risk instruments, are more aware of the scientific literature, and provide the court with more information about the scientific basis of their testimony. The implication of these results for legal professionals, psychologist training, and practice are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Perceptual evaluation of color gamut mapping algorithms

The recommendation of the CIE has been followed as closely as possible to evaluate the accuracy of five color gamut mapping algorithms (GMAs)—two nonspatial and three spatial algorithms—by psychophysical experiments with 20 test images, 20 observers, one test done on paper and a second one on display. Even though the results do not show any overall “winner,” one GMA is definitely perceived as not accurate. The importance of a high number of test images to obtain robust evaluation is underlined by the high variability of the results depending on the test images. Significant correlations between the percentage of out‐of‐gamut pixels, the number of distinguishable pairs of GMAs, and the perceived difficulty to distinguish them have been found. The type of observers is also important. The experts, who prefer a spatial GMA, show a stronger consensus and look especially for a good rendering of details, whereas the nonexperts hardly make a difference between the GMAs. © 2008 Wiley Periodicals, Inc. Col Res Appl, 33, 470–476, 2008     

An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs

A graph is distance-hereditary if the distance stays the same between any of two vertices in every connected induced subgraph containing both. Two well-known classes of graphs, trees and cographs, both belong to distance-hereditary graphs. In this paper, we first show that the perfect domination problem can be solved in sequential linear-time on distance-hereditary graphs. By sketching some regular property of the problem, we also show that it can be easily parallelized on distance-hereditary graphs.     

开放式玻璃自动切割机计算机控制系统

文章介绍一种自行研制的玻璃自动切割机开放式计算机控制系统，并针对该切割机加工范围大、惯性大、动态精度要求高等特点，研究了一种智能适应型PID控制算法。现场测试表明，该系统在功能、性能和控制精度上达到或接近国外同类产品的先进水平，在系统硬件和软件的开放性上优于国外产品。文中详细介绍了该计算机控制系统的功能、系统设计、控制算法及其调试结果。     

计算几何与并行算法

本文首先介绍了计算几何的基本概念,论述了计算几何的四个基本问题,即几何搜索问题、相交问题、邻接问题及凸壳问题。然后重点分析了凸壳构造问题,介绍了其最佳串行算法、及相应的并行算法。接着对一些计算几何的串行及并行算法进行了分析比较。最后提出了笔者对新一代并行计算机系统上设计计算几何并行算法的看法。     

K终端可靠度分解算法中多边形→链简化定理的完善

无向网络K终端可靠度的分解算法中,包括多边形→链简化在内的等可靠度简化和分解定理结合,可以降低算法的复杂度。本文完善了边随机无向网络和混合随机无向网络的4#,6#,7#型多边形→链简化定理。计算机编程验证了其正确性。     

An expert PID controller uses refined ziegler and nichols rules and fuzzy logic ideas

This article proposes a scheme for the on-line adjustment of three mode controller settings based on experimental measurements of closed-loop performance. It uses a recently developed heuristic tuning procedure to identify estimated process parameters. This method may give rise to conflicting estimates. Fuzzy Set theory is applied to manage the situation in terms of a fuzzy conjunction to combine the various estimates. PID control was chosen because of its wide use in the industrial environment due to driving simplicity and robustness. The article shows design, development, and computer simulation aspects.     

Genetic algorithms for symbolic clustering

This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical information. A new type of representation for chromosome structure is presented here along with a new method for mutation. The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the clusters obtained is examined.