We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.
This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.
This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips. 相似文献
In response to a change of the Belgian National Directives whereby hospital laboratories became responsible for all point-of-care testing (POCT) performed within hospital walls a standardized and automated POC glucose-testing system was implemented in our hospital. The system consists of 50 AccuCheck Inform instruments (Roche Diagnostics, Vilvoorde, Belgium), 50 docking stations, a DataCare Server, and connections to the medical laboratory information system (MOLIS, Sysmex, Barchon, Belgium) and to the hospital information system. Implementation involved many parties and extensive preparation and communication. Key issues were bar-coded patient and user identification, training, and responsibilities. One year after the hospital wide implementation of this system the quality of POC glucose testing has significantly increased, thereby improving patient safety. This study describes a stepwise change over involving the medical laboratory and with a focus on hands-on quality.Presented at the ninth conference on Quality in the Spotlight, 18–19 March 2004, Antwerp, Belgium. 相似文献
0 IntroductionNowthere are many well known cryptosystems based ondiscrete logarithms , such as the ElGamal cryptosys-tem[1]and the digital signature algorithm(DSA)[2]. Discretelogarithms have many advantages . Breaking the discrete log-arithm modulo pri mepappears to be somewhat harder thanfactoringintegern,and elliptic curve cryptosystems may usemuchsmaller keysizesthan RSA-basedcryptosystems of com-parable security.The discrete logarithmproblemover a group can be bro-ken down into a numb… 相似文献
Based on observations made during an extensive study of police patrol operations in New York City, we examine the issues of the validity and utility of queueing models of service systems in which adaptive behavior by the (human) customers or servers is likely. We find that in addition to depending on the technical accuracy of its assumptions, the accuracy of such a model will also depend upon the level of managerial control of the system and adequacy of resources. We recommend that queueing models of human service systems be used in a normative fashion and incorporated in the management feedback loop. 相似文献