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

AN ADVANCED METHODOLOGY FOR PRELIMINARY HULL FORM DEVELOPMENT

NAVAL ENGINEERS JOURNAL 1984年第4期96卷 147-161页

作者： LIN, WC DAY, WG HOUGH, JJ KEANE, RG WALDEN, DA KOH, IY Wen-Chin Lin:heads the Ship Powering Division at the David Taylor Naval Ship R&D Center (DTNSRDC). Dr. Lin received his B.S. degree in mechanical engineering from the National Taiwan University in 1957. He was awarded his M.S. degree in naval architecture and Ph.D. in engineering science from the University of California at Berkeley in 1963 and 1966 respectively. From 1966 to 1969 he was employed by ESSO Research and Engineering Company to conduct marine hydrodynamic research for oil tankers and offshore structures. Since joining DTNSRDC in 1969 he has actively conducted and directed hydrodynamic research to advance naval ship design technology and improve ship performance. Active in national and international symposia on ship hydrodynamic research he is recognized for contributions to the ship research community. For the past six years he has been a member of the Performance Committee of the ITTC and currently serves as secretary of the committee. He is a member of SNAME and the Society of Naval Architects of Japan. William G. Day Jr:. has been employed as a naval architect at the David Taylor Naval Ship R&D Center since receiving a B.E.S. degree from the Johns Hopkins University in 1966. He obtained an M.S. E. degree from George Washington University in 1971. As Head Design Evaluation Branch of the Ship Performance Department he is responsible for model experiments to evaluate the hydrodynamic performance of ships and propulsors. He is a member of ASNE and SNAME. In-Young Koh:received his B.S. and M.S. degrees in electrical engineering from Lowell University in 1969 and 1971 respectively and his Ph.D. in applied mechanics from Rensselaer Polytechnic Institute in 1976. Dr. Koh joined DTNSRDC as an electronic engineer specializing in the application of advanced instrumentation and computer techniques to ship research and design. He is currently engaged in research and development of active control systems for naval ship applications. Dr. Koh is a member of ASNE SNAME and IEEE. David Andrew Walden:is

A ship design methodology is presented for developing hull forms that attain improved performance in both seakeeping and resistance. Contrary to traditional practice, the methodology starts with developing a seakeeping-optimized hull form without making concessions to other performance considerations, such as resistance. The seakeeping-optimized hull is then modified to improve other performance characteristics without degrading the seakeeping. Presented is a point-design example produced by this methodology. Merits of the methodology and the point design are assessed on the basis of theoretical calculations and model experiments. This methodology is an integral part of the Hull Form Design System (HFDS) being developed for computer-supported naval ship design. The modularized character of HFDS and its application to hull form development are discussed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of an Integrated Access Scheme in a Satellite Communication Channel

引用

IEEE Journal on Selected Areas in Communications 1983年第1期1卷 153-164页

作者： Suda, Tatsuya Miyahara, Hideo Hasegawa, Toshiharu Department of Computer Science Columbia University New York NY 10027 United States Department of Information and Computer Science Osaka University Toyonaka-shi 560 Japan Department of Applied Mathematics and Physics Kyoto University Kyoto 606 Japan

A method for realizing a circuit and packet integrated access scheme in a satellite communication channel is considered. Two kinds of terminals are assumed, namely, bursty terminals for handling bursty traffic and heavily loaded terminals for long-holding-time message traffic. In this method, the channel frame is divided into two subframes: one is for bursty terminals, and the other is for heavily loaded terminals. The subframe for heavily loaded terminals is further divided into two subchannels, a reservation subchannel (consisting of small slots) and a message subchannel. The bursty terminals transmit their packets in their dedicated subframes on the slotted ALOHA protocol. The heavily loaded terminal having a message transmits, first of all, a reservation packet in a randomly selected small slot of the reservation subchannel to reserve slots in the coming message subchannels. One slot in the same position of each of the succeeding message subchannels is reserved for the terminal until the end-of-use flag, transmitted from the terminal, is received by the satellite. Mean transmission delays for both kinds of traffic in this method are analytically obtained. We show that there exists an optimal frame length which minimizes mean transmission delay for one kind of traffic while keeping mean transmission delay for the other kind under some permissible value. Copyright © 1983 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Satellite communication Access protocols Telecommunication traffic Delay Circuits computer science Mathematics physics computer peripherals

来源：评论

学校读者我要写书评

暂无评论

Graphs of processors

Graphs of processors

引用

International Workshop on Graph-Grammars and Their Application to computer science and Biology, 1978

作者： Savitch, Walter J. Computer Science Program Department of Applied Physics and Information Science University of California at San Diego La JollaCA92093 United States

来源：评论

学校读者我要写书评

暂无评论

Parallel and nondeterministic time complexity classes: Preliminary report 5th

引用

5th International Colloquium on Automata, Languages and programming, ICALP 1978

作者： Savitch, Walter J. Computer Science Program Department of Applied Physics and Information Science University of California at San Diego La JollaCA92093 United States

ISBN: (纸本)9783540088608

A random access machine model that has parallel processing and string manipulation is introduced. It is shown that NP is equal to the class of sets accepted by this model in nondeterministic time 0(log n), and this result is generalized to arbitrary time classes. A well-behaved subclass of the class of parallel, nondeter-ministic programs is analyzed. © 1978, Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

On the Complexity of Computing the Measure of ∪[a_i,b_i]

引用

Communications of the ACM 1978年第7期21卷 540-544页

作者： Fredman, Michael L. Weide, Bruce Computer Science Division Department of Applied Physics and Information Science University of California San Diego La Jolla CA 92093 United States Department of Computer Science Carnegie-Mellon University Pittsburgh PA 15213 United States

The decision tree complexity of computing the measure of the union of n (possibly overlapping) intervals is shown to be Ω(n log n), even if comparisons between linear functions of the interval endpoints are allowed. The existence of an Ω(n log n) lower bound to determine whether any two of n real numbers are within ∈ of each other is also demonstrated. These problems provide an excellent opportunity for discussing the effects of the computational model on the ease of analysis and on the results produced. © 1978, ACM. All rights reserved.

关键词： analysis of algorithms combinatorial problems computational complexity computational models computational problems decision tree programs lower bounds

来源：评论

学校读者我要写书评

暂无评论

ASSOCIATIVE RETRIEVAL TRIE HASH-CODING

引用

JOURNAL OF computer AND SYSTEM scienceS 1977年第3期15卷 280-299页

作者： BURKHARD, WA Computer Science Division Department of Applied Physics and Information Science University of California San Diego La Jolla California 92093 USA

In this paper, data base designs for retrieval from a file of k-letter records when queries may be only partially specified are examined. A family of data base designs referred to as the Hαβκ PMF-trie designs which yield a data structure with good worst case and average case performances and require an amount of storage space essentially equal to that required of the records themselves is introduced. The analysis of the designs including bounds on the worst case performance and an explicit expression for the average performance is presented. Previously known families of PMF-trie designs are seen to be special cases within the Hαβκ family.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Non-uniform partial-match file designs

引用

Theoretical computer science 1977年第1期5卷 1-23页

作者： Burkhard, Walter A. Computer Science Division Department of Applied Physics and Information Science University of California San Diego La Jolla CA 92093 United States

File designs suitable for retrieval from a file of k-letter words when queries may be only partially specified are examined. A class of PMF-tries is introduced which admits closed form analysis of worst case bounds and average case performance. The worst case bounds obtained are seen to be bounds on the worst case performance of even larger families of PMF-designs which have no closed form worst case bounds. The implementation of these designs requires storage essentially equal to that required of the records themselves. © 1977.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Abstracts

引用

Environmental Management 1977年第1期1卷 67-96页

作者： Frankenfeld, John W. Schulz, Wolfgang McMurty, George J. Petersen, Gary W. May, G. A. Hering, F. S. Schwartz, J. I. Heywood, J. B. Chigier, N. A. Grohse, E. W. Walker, J. D. Colwell, R. R. Petrakis, L. Pergament, H. S. Thorpe, R. D. Schoepf, Richard W. Krzyczkowski, Roman Henneman, Suzanne S. Hudson, Charles L. Putnam, Evelyn S. Thiesen, Donna J. Parks, G. A. McCarty, Perry L. Leckie, J. O. Schrumpf, Barry J. Simonson, G. H. Paine, D. P. Lawrence, R. D. Pyott, W. T. Leh, M. Elders, W. Combs, J. Caplen, T. Harrison, F. L. Wong, K. M. Heft., R. E. Charnell, Robert L. Lehmann, Edward J. Mallon, Lawrence G. Hatfield, Cecile Adams, Gerald H. Johanning, James Talvitie, Antti Noll, Kenneth E. Miller, Terry Smiarowski, Joseph F. Willis, Cleve E. Foster, John H. Schlesinger, Benjamin Daetz, Douglas Lear, Donald U. Smith, Mona F. Hundemann, Audrey S. Crockett, Pernell W. Werner, Kirk G. Carroll, Thomas E. Maase, David L. Genco, Joseph E. Ifeadi, Christopher N. Lowman, F. G. Christensen, S. W. Van Winkle, W. Mattice, J. S. Harrison, Elizabeth A. Barker, James C. Chesness, Jerry L. Smith, Ralph E. Shaheeen, Donald G. Raney, R. Keith Borton, T. Wezernak, C. T. Raney, R. K. Sherwani, Jabbor K. Moreau, David H. Eisenberg, Norman A. Lynch, Cornelius J. Breeding, Roger J. Johnson, J. D. Foster, K. E. Mouat, D. A. Clark, R. Hyden, John William Owen, Wilfred Bayfield, Neil G. Barrow, Graham C. Stolz, Stephanie B. Wienckowski, Louis A. Brown, Betram S. Keyfitz, Nathan Wilson, W. L. Newman, Peter W. G. Bammi, Deepak Bammi, Dalip Goddard, James E. Chisholm, Tony Walsh, Cliff Brennan, Geoffrey Thompson, K. S. Richardson, R. Jensen, Clayton E. Brown, Dail W. Mirabito, John A. Cowing, Thomas G. Binghamton, Suny Siehl, George H. Albrecht, O. W. Alexander, Ariel Barde, Jean -Philippe Darby, William P. McMichael, Francis Clay Dunlap, Robert W. Muckleston, Keith W. Frankenhoff, Charles A. Giulini, Lorenzo T. Wyatt, T. Black, Peter E. Keating, William Thomas Leonard, M. E. Fisher, E. L. Brunelle, M. F. Dickinson, J. E. Pethig, Rudiger Clapham Exxon Research & Engineering Co. Linden Government Research Lab Coast Guard Washington D.C. Department of Transportation Washington D.C. Office For Remote Sensing of Earth Resources. NASA Earth Resources Survey Program Pennsylvania State University Washington D.C. Department of the Navy Washington D.C. Cambridge. Dept. of Mechanical Engineering Massachusetts Inst. of Technology USA Huntsville. School of Graduate Studies and Research Alabama Univ. USA Dept. of Microbiology. Office of Naval Research Maryland Univ. Arlington Research and Development Co. Pittsburgh AeroChem Research Labs. Inc. Princeton Dept. of the Interior Office of Library Services. Bibliographic Series (Final) Washington D.C. Interplan Corp. Santa Barbara Urban Mass Transportation Adm. Washington D.C. Naval Underwater Systems Center Newport Calif. Mercury Project. National Science Found Stanford Univ Washington D.C. Div. of Advanced Environmental Research & Tech. USA Corvallis. NASA Earth Resources Survey Program Oregon State Univ. Washington D.C. Riverside. Inst. of Geophysics and Planetary Physics National Science Foundation California Univ. Washington D.C. Livermore Lawrence Livermore Lab. California Univ. USA Atlantic Oceanographic and Meteorological Labs. National Oceanic and Atmospheric Administration Miami National Technical Information Service Springfield Miami Univ. Coral Gables School of Law National Oceanic and Atmospheric Administration Rockville National Academy of Sciences Office of Sea Grant Washington D. C. School of Law National Oceanic and Atmospheric Administration Office of Sea Grant. Rockville Norman. Dept. of Civil Engineering and Environmental Science. Urban Mass Transportation Administration Oklahoma Univ. Washington D. C. Knoxville.Dept. of Civil Engineering. Federal Highway Administration Tennessee Univ. Washington D. C. Amherst.Water Resources Research Center. Office of Water Research and Technology Massachusetts Univ. Washington D. C. Calif. Dept. of Industria

来源：评论

学校读者我要写书评

暂无评论

Hashing and trie algorithms for partial match retrieval

引用

ACM Transactions on Database Systems (TODS) 1976年第2期1卷 175-187页

作者： Burkhard, W.A. Computer Science Division Department of Applied Physics and Information Science University of California San Diego La Jolla CA 92093 United States

File designs suitable for retrieval from a file of k-letter words when queries may be only partially specified are examined. A new class of partial match file designs (called PMF designs) based upon hash coding and trie search algorithms which provide good worst-case performance is introduced. Upper bounds on the worst-case performance of these designs are given along with examples of files achieving the bound. Other instances of PMF designs are known to have better worst-case performances. The implementation of the file designs with associated retrieval algorithms is considered. The amount of storage required is essentially that required of the records themselves. © 1976, ACM. All rights reserved.

关键词： algorithms analysis associative retrieval hash coding partial match retrieval searching trie search

来源：评论

学校读者我要写书评

暂无评论

Associative retrieval trie hash-coding: Extended abstract 8

Associative retrieval trie hash-coding: Extended abstract

引用

8th Annual ACM Symposium on Theory of Computing, STOC 1976

作者： Burkhard, Walter A. Department of Applied Physics and Information Science Computer Science Division University of California at San Diego San DiegoCA92093 United States

Data base designs for retrieval from a file of k-letter records when queries may be only partially specified are examined. A family of data base designs referred to as the HαβκPMF-trie designs which yield a data structure with good worst case and average case performances and requires an amount of storage space essentially equal to that required of the records themselves is introduced. The analysis of the designs including bounds on the worst case performance and an explicit expression for the average performance is presented. Previously known families of PMF-trie designs are seen to be special cases within the Hαβκfamily.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：