检索结果-内蒙古大学图书馆

Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

作者： Noga Alon Manuel Blum Amos Fiat Sampath Kannan Moni Naor Rafail Ostrovsky Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University Tel Aviv Israel and AT&T Bell Labs Murray Hill NJ Computer Science Division University of California at Berkeley Berkeley CA Department of Computer Science Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University Tel Aviv Israel Department of Computer Science University of Arizona Department of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100 Israel University of California at Berkeley Computer Science Division and International Computer Science Institute at Berkeley

来源：评论

学校读者我要写书评

暂无评论

The Stochastic Optimality of SEPT in Parallel Machine Scheduling

引用

Probability in the Engineering and Informational sciences 1994年第2期8卷 179-188页

作者： Chang, Cheng-Shang Hordijk, Arie Righter, Rhonda Weiss, Gideon IBM Research Division T. J. Watson Research Center P.O. Box 704 Yorktown HeightsNY10598 United States Institute of Applied Mathematics and Computer Science University of Leiden P.O. Box 9512 Leiden2333 CA Netherlands Department of Decision and Information Sciences Santa Clara University Santa ClaraCA95053 United States Faculty of Industrial Engineering and Management The Technion Technion City Haifa32000 Israel

We consider preemptive scheduling on parallel machines where processing times of jobs are i.i.d. but jobs may already have received distinct amounts of service. We show that when processing times are increasing in likelihood ratio, SEPT (shortest expected [remaining] processing time first) stochastically minimizes any increasing and Schur-concave function of the job completion times. The same result holds when processing times are exponential with possibly different means. Copyright © Cambridge University Press 1994.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Fast parallel algorithms for finding cutpoints and bridges of undirected graphs

引用

Parallel Algorithms and Applications 1994年第1-2期3卷 45-55页

作者： Nikolopoulos, Stavros D. Danielopoulos, Stylianos D. Department of Computer Science University of Cyprus Nicosia 75 Kallipoleos P.O. Box 537 Cyprus Division of Applied Mathematics and Informatics University of Ioannina GR-451 10 Ioannina Greece

In this paper we present fast parallel algorithms for finding the cutpoints and bridges of an undirected graph G = (V, E) having n vertices. We start with the notion of partitioning a graph in a set of (mutually disjoint) adjacency-level sets, and we propose a parallel algorithm which computes these sets in time O(log L) using L. H. n2 processors on a CRCW-PRAM, where L < n and H < n. Based on the properties of the adjacency-level sets, we formulate parallel algorithms which locate all cutpoints and bridges of an undirected graph in constant time 0(1) by using no more than L. H. n2 processors on a CRCW-PRAM computational model. © 1994, Taylor & Francis Group, LLC. All rights reserved.

关键词： bridges complexity CRCW-PRAM cutpoints cutvertices graph partition Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

ACQUISITION REFORM AND BEST PRODUCT PROCUREMENT - AN ENGINEERING VIEW

引用

NAVAL ENGINEERS JOURNAL 1994年第6期106卷 41-57页

作者： FISHER, DA SKOLNICK, A He has been involved with several weapon system developments. Among these were the Trident II fire control and navigation systems the BSY-I Anti-Submarine Warfare System and the Navy standard computers (UYK44 and EMSP). He served as manager of the Digital Circuits Engineering Branch and was then appointed as manager of the Automatic Test Equipment (ATE) Technology Division. As manager of the ATE Technology Division he was responsible for the SP-23 Fire Control System Support Project the SP-24 Navigation Project and the Fleet Progressive Maintenance Program (2M/ATE). This Division was responsible for selection and application of electronic product technology and for developing fleet test and repair techniques. He holds a B.S. in Electrical Engineering from the University of Evansville and is currently pursuing a Masters of Public Administration at Indiana University-Purdue University Indianapolis. Dr. Alfred Skolnick:retired from the Navy in 1983 with the rank of captain. He is president of System Science Consultants (SSC) specializing in strategic planning technical program definition technology assessment and engineering analyses on selected matters of national interest. Dr. Skolnick taught mathematics and management sciences at University of Virginia and Marymount University. He is adjunct faculty at Northern Virginia Community College. From 1985 to 1989 he was president of the American Society of Naval Engineers. In the Navy he served at Applied Physics Laboratory/The Johns Hopkins University then aboard USSBoston(CAG-1) and played leading roles in several weapon system developments inertial navigation (Polaris) deep submergence (DSRV) and advanced ship designs (SES). He later was director Combat System Integration Naval Sea Systems Command and head Combat Projects Naval Ship Engineering Center. In 1975 he became a major project manager and led the Navy's High Energy Lasers Program in 1981 he was assigned all Navy Directed Energy Weapons development efforts. He was vice president advanced tech

The military services are being moved in the direction of performance-based specifications and standards. They are being steered against dictating ''how to'' produce an item since such action forecloses on the ability to gain access to components or technology that may have a commercial equivalent. Why should the engineering community embrace the new approach? Aside from the obvious weight of it being approved policy, therefore currently mandated, it warrants examination because it is the correct approach at this time when applied to appropriate products. Military specifications and standards are to be displaced then, by acceptable alternative contractor design solutions. Industry bidders will be allowed to propose the particular design details, permitting procurement flexibility by contractually citing only system level or interface requirements, both physical and functional. Hopefully, this can broaden the industrial base and increase competition with reduced costs to follow. Conceptually, the approach appears both performance-sensible and cost-attractive (there are, of course, consequent risks) but how does implementation proceed? Is it possible to pursue the goals envisioned along paths that are not in themselves experimental? Can the American postulate, minimal loss of life and limb to U.S. military people, continue to be honored? Experience and track record elsewhere imply encouraging possibilities in select situations-useful prospects are identified and discussed in practical terms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A NEAR-OPTIMAL MANHATTAN CHANNEL ROUTER FOR A CLASS OF NETS WITH THE SHIFT-RIGHT-ONE PATTERN

引用

applied mathematics LETTERS 1993年第6期6卷 65-69页

作者： TUAN, TC Institute of Applied Mathematics (Computer Science Program) National Sun Yat-sen University Kaohsiung Taiwan 80424 People's Republic of China

The Manhattan channel routing problem of providing a one-to-one rectilinear wire connection (horizontal segments on one layer, while vertical segments are on the other) between two sets of terminals which lie on two horizontal lines, with the smallest width, is NP-hard. In this paper, it is studied for m consecutive shift-right-one nets, and a near-optimal router which produces a layout with width at most 2 more than the theoretical lower bound given in [1] is presented.

关键词：

来源：评论

学校读者我要写书评

暂无评论

THE CALLING(SM) NETWORK - A GLOBAL WIRELESS COMMUNICATION-SYSTEM

引用

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS 1994年第1期12卷 45-61页

作者： TUCK, EF PATTERSON, DP STUART, JR LAWRENCE, MH Calling Communications Corporation. 1900 West Garvey Ave South. Suite 200 West Covina CA 91790 USA. Chairman of Calling Communications Corporation. He is also the Managing Director of Kinship Venture Management Inc. the general partner of Kinship Partners 11 and a General Partner of Boundary the general partner of The Boundary Fund. As a venture capitalist he has founded or participated in founding several telecommunications companies including Calling Communications Corporation Magellan Systems Corporation manufactures of Global Positioning System receivers Applied Digital Access manufacturer of DS-3 test access and network performance monitoring equipment Endgate Technology Corporation specialists in satellite phased array antennas and Poynting Systems Corporation. now a division of Reliance Corporation manufacturers of fibre optic transport equipment. He was a founder of Kebby Microwave Corporation where he invented the first solid-state. frequency-modulated commercial microwave link system. The company was acquired by ITT Corporation where he rose to the position of V.P. and Technical Director of ITT North America Telecommunications Inc. Subsequently he was V.P. of Marketing and Engineering at American Telecommunications Inc. (ATC). He was founding Director of American Telecom Inc. a joint venture between ATC and Fujitsu and has served on more than 20 boards of directors including those of three public companies. He has authored articles on microwave engineering and telephone signalling and was a contributor to Reference Data For Radio Engineers. He is a graduate of the University of Missouri at Rolla where he was later awarded an honorary Professional degree and serves on its Academy of Electrical Engineering. Mr Tuck is a Senior Member of the IEEE a Fellow of the Institution of Engineers (Australia) a Professional Member of the AIAA and a registered professional engineer in three states. More than 25 years of experience in the telecommunications industry where he has been responsibl

There is a very large demand for basic telephone service in developing nations, and remote parts of industrialized nations, which cannot be met by conventional wireline and cellular systems. This is the world's largest unserved market. We describe a system which uses recent advances in active phased arrays, fast-packet switching technology, adaptive routeing, and light spacecraft technology, in part based on the work of the Jet Propulsion Laboratory and on recently-declassified work done on the Strategic Defense Initiative, to make it possible to address this market with a global telephone network based on a large low-Earth-orbit constellation of identical satellites. A telephone utility can use such a network to provide the same modern basic and enhanced telephone services offered by telephone utilities in the urban centres of fully-industrialized nations. Economies of scale permit capital and operating costs per subscriber low enough to provide a service to all subscribers, regardless of location, at prices comparable to the same services in urban areas of industrialized nations, while generating operating profits great enough to attract the capital needed for its construction. The bandwidth needed to support the capacity needed to gain these economies of scale requires that the system use K(alpha)-band frequencies. This choice of frequencies places unusual constraints on the network design, and in particular forces the use of a large number of satellites. Global demand for basic and enhanced telephone service is great enough to support at least three networks of the size described herein. The volume of advanced components, and services such as launch services, required to construct and replace these networks is sufficient to propel certain industries to market leadership positions in the early 21st Century.

关键词： LOW EARTH ORBIT SATELLITE COMMUNICATIONS FAST PACKET SWITCHING EARTH FIXED CELLS ADAPTIVE ROUTEING LIGHT SPACECRAFT K(A) BAND PHASED-ARRAY ANTENNAS

来源：评论

学校读者我要写书评

暂无评论

A global algorithm for shape from shading

A global algorithm for shape from shading

引用

International Conference on computer Vision (ICCV)

作者： J. Oliensis P. Dupuis Department of Computer Science University of Massachusetts Amherst Amherst MA USA Division of Applied Mathematics Brown University Providence RI USA

A global algorithm for reconstructing shape from shading is described. This algorithm incorporates an earlier local algorithm that has been shown to be capable of fast, robust surface reconstruction for general surfaces if a small amount of information on the surface is provided. The new algorithm is capable of determining this information automatically, and thus can reconstruct a general surface from shading with no a priori information on the surface. In experimental tests on complex synthetic images, this algorithm has produced good surface reconstructions over most of the image. For 128 /spl times/ 128 images, the reconstruction took less than 30 s on a DECstation 5000. The algorithm appears noise resistant, giving good reconstructions even with an added pixel noise of /spl plusmn/10%.< >

关键词： Shape Surface reconstruction Image reconstruction Image converters Convergence Noise shaping computer science mathematics Robustness Testing

来源：评论

学校读者我要写书评

暂无评论

Graph morphology

引用

Journal of Visual Communication and Image Representation 1992年第1期3卷 24-24页

作者： Heijmans, H.J.A. Nacken, P. Toet, A. Vincent, L. Centre for Mathematics and Computer Science P.O. Box 4079 1009 AB Amsterdam The Netherlands Institute for Perception TNO Kampweg 5 3769 DE Soesterberg The Netherlands Division of Applied Sciences Harvard University Cambridge Massachusetts 02138 USA

This paper presents a systematic theory for the construction of morphological operators on graphs. Graph morphology extracts structural information from graphs using predefined test probes called structuring graphs. Structuring graphs have a simple structure and are relatively small compared to the graph that is to be transformed. A neighborhood function on the set of vertices of a graph is constructed by relating individual vertices to each other whenever they belong to a local instantiation of the structuring graph. This function is used to construct dilations and erosions. The concept of the structuring graph is also used to define openings and closings. The resulting morphological operators are invariant under symmetries of the graph. Graph morphology resembles classical morphology (which uses structuring elements to obtain translation-invariant operators) to a large extent. However, not all results from classical morphology have analogues in graph morphology because the local graph structure may be different at different vertices.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Direct method for reconstructing shape from shading

Direct method for reconstructing shape from shading

引用

1992 IEEE computer Society Conference on computer Vision and Pattern Recognition, CVPR 1992

作者： Dupuis, P. Oliensis, J. Division of Applied Mathematics Brown University Box F ProvidenceRI02912 United States Department of Computer Science University of Massachusetts at Amherst AmherstMA01003 United States

ISBN: (纸本)0818628553

An approach to shape-from-shading that is based on a connection with a calculus of variations/optimal control problem is proposed. An explicit representation corresponding to a shaded image is given for the surface;uniqueness of the surface (under suitable conditions) is an immediate consequence. The approach leads naturally to an algorithm for shape reconstruction that is simple, fast, provably convergent (in many cases, provably convergent to the correct solution), and does not require regularization. Given a continuous image, the algorithm can be proved to converge to the continuous surface solution as the image sampling frequency is taken to infinity. Experimental results are presented for synthetic and real images. © 1992 IEEE.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

A tail estimate for Mulmuley’s segment intersection algorithm 19th

引用

19th International Colloquium on Automata, Languages, and programming, ICALP 1992

作者： Matoušek, Jiří Seidel, Raimund Department of Applied Mathematics Charles University Malostranské nám. 25 Praha 1118 00 Czech Republic Computer Science Division University of California BerkeleyCA95720 United States

ISBN: (纸本)9783540557197

We analyze the distribution of the running time of Mulmuley’s randomized algorithm for computing the intersections of n given segments in the plane. Its expectation has been known to be O(n log n + k), where k is the number of intersections. We show that for values of k not too close to n (k ≥ Cnlog15n for a large enough constant C), the running time is sharply concentrated around the expected value;e.g., the probability that the expected value is exceeded more than twice is O(n-c), where c can be an arbitrarily large constant (its choice determines the value of C needed in the assumption). Our proof uses an isoperimetric inequality for permutations. © Springer-Verlag Berlin Heidelberg 1992.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：