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

6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995

作者： Chan, Timothy M.Y. Snoeyink, Jack Yap, Chee-Keng Dept. of Computer Science Univ. of British Columbia Canada Courant Inst of Math. Sciences New York University United States

ISBN: (纸本)0898713498

In this paper, we give an algorithm for output-sensitn construction of an f-face polytope that is defined by halfspaces in E4. Our algorithm runs in O((n + /)log2 ) time and uses 0(n + f) space. This is the first algorithi within a polylogarithmic factor of optimal 0(n logf/ + f) time over the whole range of f. By a standard liftir map, we obtain output-sensitive algorithms for the Voroni diagram or Delaunay triangulation in E3 and for the portic of a Voronoi diagram that is clipped to a convex polytop Our approach also simplifies the "ultimate convex hn algorithm" of Kirkpatrick and Seidel in E2.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

INFLUENCE ANALYSIS OF LINK PARAMETER IN GLM

引用

Acta math.matica Scientia 1995年第S1期15卷 53-63页

作者：石磊吴传义 Inst. of Appl. Math. of Yunnan Provice Dept. of Stat. Yunnan University Kunming 650091 China Institute of System Science Academia Sinica Beijing 100080 China

in this paper, we describe a new method for assessing the degree in which the individual case influence the maximum likelihood estimation of link parameter in generalized linear model. Several influential statistics ... 详细信息

关键词： Generalized linear model Link parameter Deviance Influence observation.

来源：评论

学校读者我要写书评

暂无评论

Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three 95

Output-sensitive construction of polytopes in four dimension...

引用

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

作者： Timothy M. Y. Chan Jack Snoeyink Chee-Keng Yap Dept. of Computer Science Univ. of British Columbia Courant Inst. of Math. Sciences New York University

来源：评论

学校读者我要写书评

暂无评论

A journey into multicomputer routing algorithms 1

A journey into multicomputer routing algorithms

引用

1st Aizu International Symposium on Parallel Algorithms/Architecture Synthesis, AISPAS 1995

作者： Grammatikakis, Miltos D. Hsu, D. Frank Kraetzl, Miro Computer Science Inst. F.O.R.T.H. Heraklion Crete71110 Greece Computer Information Science Fordham Univ. BronxNY10458 United States Math and Statistics Curtin Univ. of Technology PerthWA6001 Australia

ISBN: (纸本)081867038X

We survey various aspects of packet routing, namely (partial) permutation, h-relation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We present theoretical results for general graphs and the hypercube topology, assuming both SIMD and MIMD communication models. © 1995 IEEE.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimal enclosing parallelogram with application 95

Minimal enclosing parallelogram with application

引用

11th Annual Symposium on Computational Geometry, SCG 1995

作者： Schwarz, Christian Teich, Jürgen Vainshtein, Alek Welzl, Emo Evans, Brian L. Max-Planck-Institut f. Informatik Im Stadtwald SaarbrückenD-66123 Germany Institut TIK ETH Zürich Gloriastr. 35 ZürichCH-8092 Switzerland School of Math. Sci. Tel Aviv Univ. Tel Aviv Israel Freie Univ. Berlin Inst. f. Informatik Takustr. 9 BerlinD-14195 Germany Dept. of Electrical Eng. and Computer Sci. Univ. of California BerkeleyCA94720 United States

No abstract available.

ISBN: (纸本)0897917243

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

3-D docking of protein molecules 4th

引用

Conference of the European Society for Fuzzy Logic and Technology, EUSFLAT 2017 and 16th International Workshop on Intuitionistic Fuzzy Sets and Generalized Nets, IWIFSGN 2017

作者： Fischer, Daniel Norel, Raquel Nussinov, Ruth Wolfson, Haim J. Computer Science Department Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University Israel Sackler Inst. of Molecular Medicine Faculty of Medicine Tel Aviv University Israel Lab of Math. Biology PRI - Dynacor NCI-FCRF NIH United States

ISBN: (纸本)9783540567646

We present geometric algorithms which tackle the docking problem in Molecular Biology. This problem is a central research topic both for synthetic drug design and for biomolecular recognition and interaction of proteins in general. Our algorithms have been implemented and experimented on several ‘real world’ biological examples. The preliminary experimental results show an order of magnitude improvement in the actual run-time of the algorithms in comparison to previously published techniques. The matching part of our algorithm is based on the Geometric Hashing technique, originally developed for computer Vision applications. The algorithmic similarity between the problems emphasizes the importance of interdisciplinary research in Computational Molecular Biology. Future research directions are outlined as well. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Taking it to the limit: on infinite variants of NP-complete problems

Taking it to the limit: on infinite variants of NP-complete ...

引用

Annual Conference on Structure in Complexity Theory

作者： T. Hirst D. Harel Department of Applied Mathematics & Computer Science Weizmann Institute of Science Rehovot Israel Dept. of Appl. Math. & Comput. Sci. Weizmann Inst. of Sci. Rehovot Israel

Infinite, recursive versions of NP optimization problems are defined. For example, MAX CLIQUE becomes the question of whether a recursive graph contains an infinite clique. The work was motivated by trying to understand what makes some NP problems highly undecidable in the infinite case, while others remain on low levels of the arithmetical hierarchy. Two results are proved; one enables using knowledge about the infinite case to yield implications to the finite case, and the other enables implications in the other direction. Taken together, the two results provide a method for proving (finitary) problems to be outside the syntactic class MAX NP, hence outside MAX SNP too. The technique is illustrated with many examples.< >

关键词： NP-complete problem Polynomials math.matics computer science Turing machines

来源：评论

学校读者我要写书评

暂无评论

MPSA abstracts

引用

Journal of Protein Chemistry 1994年第5期13卷 515-543页

作者： Aminlari, Mahmoud Asquith, Thomas Sarlo, Katherine Bailey, Jerome M. Tu, Oanh Issai, Gilbert Ha, Alice Shively, John E. Bell, Alexander W. Baur, Nicole C. Bergeron, John J. M. Ou, Wei -Jia Thomas, David Y. Cianflone, Katherine Baldo, Allain Hincke, Maxwell T. Momparler, Richard L. Laliberté, Josée Thomson, David M. P. Sutherland, M. Besada, Vladimir Gonzalez, Javier Padron, Gabriel Garay, Hilda Reyes, Osvaldo Takao, Toshifumi Shimonishi, Yasutsugu Bischoff, Rainer Roecklin, Dominique Bouchon, Bernadette Klarskov, Klaus Van Dorsselaer, Alain Brake, Patricia G. Pacitti, Anne Higgins, Terry Stevis, Panos Malinowski, John McElhiney, Sue Huang, Janes Vestal, Christine Buckel, Scott D. Stevenson, Tracy Loo, Joseph A. Caffrey, Martin Wang, Jin Wallace, Carmichael J. A. Clark-Lewis, Ian Carraway, C. A. Carothers Huang, J. Li, Y. Juang, S. -H. Gallo, A. Mayer, B. J. Carraway, K. L. Coleman, Patrick L. Sarpong, Daniel Deerfield, David W. Holland-Minkley, Amanda Hempel, John D. Nicholas, Hugh B. Denslow, Nancy D. Folmar, Leroy C. Sullivan, Craig V. Dixon, James D. Mark, Jonathan P. Elicone, Christopher P. Maleknia, Simin D. McGuinness, Brian F. Regnier, Fred E. Afeyan, Noubar B. Dolence, Julia M. Poulter, C. Dale Egorov, Tsezi Musolyamov, Alexander Popineau, Yves Andersen, Jens Roepstorff, Peter Falkenstein, Roberto J. Biscoglio de Jiménez Bonino, Mirtha J. Peña, Clara Gauggel, D. L. Asquith, T. N. Isfort, R. J. Miller, N. S. Cody, D. B. Giblin, Michael F. Wong, Tuck C. Quinn, Thomas P. Grant, Gregory A. Crankshaw, Mark W. Griffith, Scott Schroeder, Steve Quinn, Thomas Guinet, F. Petillot, Y. Chapsal, J. M. Dubayle, J. Greco, F. Barge, O. Forest, E. Valentin, C. Hahn, Frederick M Baker, Jonathan A. Haniu, Mitsuru Kenney, William C. Rohde, Michael F. Harman, James G. Lee, Eun Ju Glasgow, Joel Lew, Sew Fen Belduz, Ali O. Harris, Reed J. Molony, Michael S. Keyt, Lene H. Wu, Shiaw -Lin Hawke, David H. Tso, Jaqueline Early, Sherrell Miller, Chad G. Hayman, G. Thomas Miernyk, Jan A. Hellman, Ulf Wernstedt, Christer Góñez, Jorge H Department of Biochemistry School of Veterinary Medicine Shiraz University Shiraz Iran Corporate Professional & Regulatory Services/Human Safety Dept. The Procter & Gamble Co. Cincinnati Division of Immunology Beckman Research Institute of the City of Hope Duarte Protein Analytic Facility Sheldon Biotechnology Centre USA McGill University Montreal Department of Anatomy USA Biotechnology Research Institute NRC Canada Division of Cardiology Royal Victoria Hospital USA Department of Anatomy University of Ottawa Faculty of Health Science Ottawa Centre de Recherche Pediatrique Hôpital Ste-Justine Université de Montréal Montreal Department of Immunology Montreal General Hospital USA Center for Genetic Engineering & Biotechnology Cuba Institute for Protein Research Osaka University Osaka Japan Protein Analytical Group TRANSGENE S.A. Strasbourg Cedex France Vakgroep Biochemie Fysiologie en Microbiologie Gent Belgium Laborat. de Spectrométrie de Masse Bioorganique URA 31 CNRS Université Louis Pasteur Strasbourg Cedex France Sterling winthrop Inc. Collegeville Lexin Pharmaceutical Corporation Horsham PerSeptive Biosystems Houston Parke-Davis Pharmaceutical Research Division of Warner Lambert Company Ann Arbor Dept. of Chemistry The Ohio State University Columbus USA Dept. of Biochemistry Dalhousie University Halifax Canada Biomedical Research Center University of British Columbia Vancouver Canada Dept. of Biochem. & Molec. Biol. Univ. of Miami Sch. of Medicine Miami The Rockefeller Institute New York Dept. of Cell Biol. & Anat. Univ. of Miami Sch. of Medicine Miami Biosciences Laboratory 3M Co. St. Paul Pittsburgh Supercomputing Center Pittsburgh Department of Molecular Genetics/Biochemistry University of Pittsburgh Pittsburgh Dept. Biochem. and Mol. Biol. University of Florida Gainesville U.S. Environmental Protection Agency Gulf Breeze Dept. Zoology North Carolina State University Raleigh PerSeptive Biosystems Inc. Cambridge Department of Chemistry Univ

来源：评论

学校读者我要写书评

暂无评论

Bringing the industry view of software engineering to the classroom 93

Bringing the industry view of software engineering to the cl...

引用

Proceedings of the twenty-fourth SIGCSE technical symposium on computer science education

作者： Judith L. Gersting Frank Young Eric Tinsley Helen Hays Anthony Schaeffer Computer Science Department Indiana University-Purdue University at Indianapolis 723 W. Michigan St. SL 2260F Indianapolis IN Computer Science Department Rose-Hulman Inst. of Technology 5500 Wabash Avenue Terre Haute IN Digital Equipment Corporation 8425 Woodfield Crossing Blvd. Suite 100 Indianapolis IN Dept. of Computer Science Southeast Missouri State University One University Plaza Cape Girardeau MO Dept. of Math. and Computer Science Davis and Elkins College Elkins WV

No abstract available.

ISBN: (纸本)9780897915656

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

3-D substructure matching in protein molecules 3rd

引用

3rd Annual Symposium on Combinatorial Pattern Matching, 1992

作者： Fischer, Daniel Nussinov, Ruth Wolfson, Haim J. Computer Science Department Raymond and Beverly Suckler Faculty of Exact Sciences Tel Aviv University Israel Suckler Inst. of Molecular Medicine Faculty of Medicine Tel Aviv University Israel Lab of Math. Biology PRI - Dynacor NCI-FCRF NIH United States Robotics Research Laboratory Courant Inst. of Math. Sc. New York University United States

ISBN: (纸本)9783540560241

Pattern recognition in proteins has become of central importance in Molecular Biology. Proteins are macromolecules composed of an ordered sequence of amino acids, referred to also as residues. The sequence of residues in a protein is called its primary structure. The 3-D conformation of a protein is referred to as its tertiary structure. During the last decades thousands of protein sequences have been decoded. More recently the 3-D conformation of several hundreds of proteins have been resolved using X-ray crystallographic techniques. Todate, most work on 3-D structural protein comparison has been limited to the linear matching of the 3-D conformations of contiguous segments (allowing insertions and deletions) of the amino acid chains. Several techniques originally developed for string matching have been modified to perform 3-D structural comparison based on the sequential order of the structures. We present an application of pattern recognition techniques (in particular matching algorithms) to structural comparison of proteins. The problem we are faced with is to devise efficient techniques for routine scanning of structural databases, searching for recurrences of inexact structural motifs not necessarily composed of contiguous segments of the amino acid chain. The method uses the Geometric Hashing technique which was originally developed for model-based object recognition problems in computer Vision. Given the three dimensional coordinate data of the structures to be compared, our method automatically identifies every region of structural similarity between the structures without prior knowledge of an initial alignment. Typical structure comparison problems are examined and the results of the new method are compared with the published results from previous methods. Examples of the application of the method to identify and search for non-linear 3-D motifs are included. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：