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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

521 篇 会议
298 篇 期刊文献
9 册 图书

馆藏范围

828 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

424 篇 工学
- 321 篇 计算机科学与技术...
- 249 篇 软件工程
- 77 篇 信息与通信工程
- 59 篇 控制科学与工程
- 30 篇 生物工程
- 26 篇 电气工程
- 26 篇 化学工程与技术
- 23 篇 机械工程
- 19 篇 电子科学与技术（可...
- 18 篇 动力工程及工程热...
- 17 篇 生物医学工程（可授...
- 15 篇 力学（可授工学、理...
- 15 篇 材料科学与工程（可...
- 14 篇 光学工程
- 14 篇 仪器科学与技术
- 6 篇 航空宇航科学与技...
370 篇 理学
- 302 篇 数学
- 93 篇 统计学（可授理学、...
- 60 篇 物理学
- 39 篇 生物学
- 28 篇 化学
- 28 篇 系统科学
80 篇 管理学
- 42 篇 管理科学与工程(可...
- 38 篇 图书情报与档案管...
- 28 篇 工商管理
13 篇 医学
- 11 篇 临床医学
- 9 篇 基础医学(可授医学...
12 篇 经济学
- 12 篇 应用经济学
12 篇 教育学
- 12 篇 教育学
7 篇 法学
- 6 篇 社会学
5 篇 农学
1 篇 哲学
1 篇 文学
1 篇 历史学
1 篇 军事学
1 篇 艺术学

主题

118 篇 computer science
40 篇 mathematics
19 篇 algorithm design...
19 篇 polynomials
17 篇 artificial intel...
16 篇 educational inst...
16 篇 computational mo...
14 篇 humans
14 篇 shape
13 篇 data mining
13 篇 equations
12 篇 application soft...
11 篇 routing
11 篇 mathematical mod...
11 篇 layout
10 篇 concurrent compu...
10 篇 control systems
10 篇 topology
10 篇 robustness
9 篇 cameras

机构

21 篇 department of co...
11 篇 math. division n...
11 篇 department of ma...
9 篇 college of mathe...
8 篇 courant inst. of...
7 篇 department of ap...
7 篇 inst. math. stoc...
6 篇 department of co...
6 篇 department of co...
6 篇 machine learning...
6 篇 department of ap...
5 篇 department of ap...
5 篇 school of comput...
5 篇 research centre ...
5 篇 department of ap...
5 篇 dept. of math. a...
4 篇 department of ma...
4 篇 math. research i...
4 篇 department of co...
4 篇 department of ma...

作者

11 篇 naor moni
11 篇 ban jung-chao
9 篇 hu wen-guei
9 篇 sharir micha
8 篇 alsmeyer gerold
8 篇 m. irani
8 篇 lai guan-yu
7 篇 r. basri
6 篇 hemaspaandra edi...
6 篇 krishnaswamy smi...
6 篇 srivastava gauta...
6 篇 fitzsimmons zack
6 篇 wu yu-liang
5 篇 chang chih-hung
5 篇 maldonado josé c...
5 篇 irit dinur
5 篇 macdonell stephe...
5 篇 mendes emília
5 篇 pinchasi rom
5 篇 evangelos a. the...

语言

805 篇 英文
20 篇 其他
3 篇 中文
1 篇 西班牙文

检索条件"机构=Computer Science and Applied Math. Department"

共 828 条记录，以下是781-790 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Amplification and percolation (probabilistic Boolean functions) 33

Amplification and percolation (probabilistic Boolean functio...

引用

33rd Annual Symposium on Foundations of computer science, FOCS 1992

作者： Dubiner, Moshe Zwick, Uri Dept. of Applied Math. Tel Aviv Univ. Tel Aviv69978 Israel Dept. of Computer Science Tel Aviv Univ. Tel Aviv69978 Israel

ISBN: (纸本)0818629002

The authors extend R.B. Boppana's results (1989) in two ways. They first show that his two lower bounds hold for general read-once formulae, not necessarily monotone, that may even include exclusive-or gates. They are then able to join his two lower bounds together and show that any read-once, not necessarily monotone, formula that amplifies (p-1/n,p+1/n) to (2-n,1-2-n) has size of at least Omega (n/sup alpha +2/). This result does not follow from Boppana's arguments and it shows that the amount of amplification achieved by L.G. Valiant (1984) is the maximal achievable using read-once formulae. © 1992 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Model based concordance compression

Model based concordance compression

引用

1992 Data Compression Conference, DCC 1992

作者： Bookstein, Abraham Klein, Shmuel T. Raita, Timo Center for Information and Language Studies University of Chicago ChicagoIL60637 United States Depts. of Math. and CS and Economics and BA Bar Ilan University Ramat Gan52900 Israel Department of Computer Science University of Turku TurkuSF-20520 Finland

来源：评论

学校读者我要写书评

暂无评论

Associative parallel lexing

Associative parallel lexing

引用

International Symposium on Parallel Processing

作者： C.R. Asthagiri J.L. Potter CIS Department Cleveland State University Cleveland OH USA Department of Math. & Computer Science Kent University Kent OH USA

Presents near constant time associative parallel lexing (APL) algorithms. The best time complexity thus far claimed is O(logn) (n denotes the number of input characters for the parallel prefix lexing (PPL) algorithm. The linear state recording step in the PPL algorithm, which needs to be done only once for each grammar has been ignored in claiming the log n time complexity for the PPL algorithm. Furthermore, the PPL algorithm does not consider recording line numbers for the tokens and distinguishing identifier tokens as keywords or user-identifiers. The APL algorithms perform all of these functions. Thus, without considering the efforts spent on these functions, the APL algorithm takes constant time since every step depends on the length of the tokens, not on the length of the input. Generalizing and including these extra functions, the APL algorithm takes near constant time.< >

关键词： Concurrent computing computer aided instruction Algorithm design and analysis Associative memory Computational Intelligence Society Lakes Performance analysis Vector processors computer science Process control

来源：评论

学校读者我要写书评

暂无评论

Modeling human visual object recognition

Modeling human visual object recognition

引用

International Joint Conference on Neural Networks (IJCNN)

作者： S. Edelman H.H. Bulthoff Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot Israel Dept. of Appl. Math. & Comput. Sci. Weizmann Inst. of Sci. Rehovot Israel

The topics discussed here are network models of object recognition; a computational theory of recognition; psychophysical support for a view-interpolation model: and an open issue, features of recognition. The authors survey a successful replication of central characteristics of performance in 3-D object recognition by a computational model based on interpolation among a number of stored views of each object. Network models of 3-D object recognition based on interpolation among specific stored views behave in several respects similarly to human observers in a number of recognition tasks. Even closer replication of human performance in recognition should be expected, once the issue of the features used to represent object views is resolved.< >

关键词： Humans Object recognition Image recognition computer networks Biology computing math.matics computer science math.matical model Interpolation Image resolution

来源：评论

学校读者我要写书评

暂无评论

Optimal early stopping in distributed consensus 6th

Optimal early stopping in distributed consensus

引用

6th International Workshop on Distributed Algorithms, WDAG 1992

作者： Berman, Piotr Garay, Juan A. Perry, Kenneth J. Department of Computer Science The Pennsylvania State University University ParkPA16802 United States Dept. of Applied Math and Computer Science The Weizmann Institute of Science Rehovot76100 Israel IBM T.J. Watson Research Center P.O. Box 704 Yorktown HeightsNY10598 United States

ISBN: (纸本)9783540561880

The Distributed Consensus problem involves n processors each of which holds an initial binary value. At most t processors may be faulty and ignore any protocol (even behaving maliciously), yet it is required that the non-faulty processors eventually agree on a value that was initially held by one of them. This paper presents consensus protocols that tolerate arbitrary faults, are early-stopping (i.e., run for a number of rounds proportional to the number of faults f that actually occur during their execution), and are optimal in various measures. Our first contribution is an early-stopping consensus protocol that is simultaneously optimal in round complexity (i.e., min(t+1, f+2) rounds) and number of processors (i.e., n > 3t). This settles a long-standing open question [DRS, 1982]. These bounds were not known to be attainable even with the use of authentication. Since consensus is not attainable with n ≤ 3t we provide a definitive answer to the problem of early-stopping consensus. Previous protocols for this problem that achieved round optimality required n = Ω(t2) [C, DRS], n > 6t [MW] and n > 4t [BGP]. Instrumental in achieving this result is the new safe message reconstruction technique, which we expect to be of broader applicability. The previous protocol is round- and processor-optimal, but not efficient. Our second contribution is a pair of optimal early-stopping consensus protocols that use messages of constant size. No previously existing early-stopping protocol, whether exactly or only asymptotically optimal in some measures, has used messages of constant size. The only other existing early-stopping protocol with constant-sized messages requires n = Ω(t2) [C]. Finally, we indicate how to extend one of the previous protocols to be optimal in total bit (and message) complexity and number of processors. This is the first protocol that is both optimal in these measures and early-stopping. © 1992, Springer Verlag. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Witnesses for Boolean matrix multiplication and for shortest paths 33

Witnesses for Boolean matrix multiplication and for shortest...

引用

33rd Annual Symposium on Foundations of computer science, FOCS 1992

作者： Alon, Noga Galil, Zvi Margalit, Oded Naor, Moni Dept. of Math. Tel Aviv Univ. Israel Department of Computer Science Tel Aviv University Tel Aviv69978 Israel Columbia University New YorkNY10027 United States IBM Almaden Research Center San JoseCA95120 United States

ISBN: (纸本)0818629002

The subcubic (O(nw) for w(3) algorithms to multiply Boolean matrices do not provide the witnesses;namely, they compute C=A.B but if Cij=1 they do not find an index k (a witness) such that Aik=Bkj=1. The authors design a deterministic algorithm for computing the matrix of witnesses that runs in O(nw) time, where here O(nw) denotes O(nw(log n)/sup O(1)/). The subcubic methods to compute the shortest distances between all pairs of vertices also do not provide for witnesses;namely they compute the shortest distances but do not generate information for computing quickly the paths themselves. A witness for a shortest path from vi to vj is an index k such that vk is the first vertex on such a path. They describe subcubic methods to compute such witnesses for several versions of the all pairs shortest paths problem. As a result, they derive shortest paths algorithms that provide characterization of the shortest paths in addition to the shortest distances in the same time (up to a polylogarithmic factor) needed for computing the distances;namely O(n/sup (3+w)/2/) time in the directed case and O(nw) time in the undirected case. They also design an algorithm that computes witnesses for the transitive closure in the same time needed to compute witnesses for Boolean matrix multiplication. © 1992 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Amplification and percolation (probabilistic Boolean functions)

Amplification and percolation (probabilistic Boolean functio...

引用

Annual IEEE Symposium on Foundations of computer science

作者： M. Dubiner U. Zwick Department of Applied Math Tel-Aviv University Tel-Aviv Israel Department of Computer Science Tel-Aviv University Tel-Aviv Israel

The authors extend R.B. Boppana's results (1989) in two ways. They first show that his two lower bounds hold for general read-once formulae, not necessarily monotone, that may even include exclusive-or gates. They are then able to join his two lower bounds together and show that any read-once, not necessarily monotone, formula that amplifies (p-/sup 1///sub n/,p+/sup 1///sub n/) to (2/sup -n/,1-2/sup -n/) has size of at least Omega (n/sup alpha +2/). This result does not follow from Boppana's arguments and it shows that the amount of amplification achieved by L.G. Valiant (1984) is the maximal achievable using read-once formulae.< >

关键词： Boolean functions computer science Relays computer network reliability Polynomials Circuit simulation

来源：评论

学校读者我要写书评

暂无评论

Data-parallel compilation and query power extension of large knowledge bases

Data-parallel compilation and query power extension of large...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： A.K. Bansal J.L. Potter L.V. Prasad Dept. of Math. & Comput. Sci. Kent State Univ. OH USA Department of Mathematics and Computer Science Kent University Kent OH USA

An associative data-parallel compilation model of logic programs capable of answering queries with unspecified relations concerning the given objects is described. The model benefits from the synergy resulting from associative search, data-parallelism during goal reduction, and the use of low-level code to invoke the subgoals and savings in data-transfers resulting from the presence of global registers. The use of associative tables extends the power of logic programming to answer a large class of queries and derive unspecified relation-names for the given objects. In contrast to the interpretation based on a pure data parallel model, this model does not suffer from data sequentiality caused by the presence of multiple-occurrence variables in the goals. The model also handles variable aliasing in the clauses efficiently using the associative data-parallel search and data-parallel assignment property.< >

关键词： Pattern matching Supercomputers Artificial intelligence Logic programming math.matics computer science math.matical model Parallel processing Registers Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Model based concordance compression

Model based concordance compression

引用

Data Compression Conference (DCC)

作者： A. Bookstein S.T. Klein T. Raita Center for Information and Language Studies University of Chicago Chicago IL USA Departments of Math. & CS and Economics & BA Bar-llan University Ramat-Gan Israel Department of Computer Science University of Turku Turku Finland

The authors discuss concordance compression using the framework now customary in compression theory. They begin by creating a math.matical model of concordance generation, and then use optimal compression engines, such as Huffman or arithmetic coding, to do the actual compression. It should be noted that in the context of a static information retrieval system, compression and decompression are not symmetrical tasks. Compression is done only once, while building the system, whereas decompression is needed during the processing of every query and directly affects the response time. One may thus use extensive and costly preprocessing for compression, provided reasonably fast decompression methods are possible. Moreover, compression is applied to the full files (text, concordance, etc.), but decompression is needed only for (possibly many) short pieces, which may be accessed at random by means of pointers to their exact locations. Therefore the use of adaptive methods based on tables that systematically change from the beginning to the end of the file is ruled out. However, their concern is less the speed of encoding or decoding than relating concordance compression conceptually to the modern approach of data compression, and testing the effectiveness of their models.< >

关键词： Dictionaries Information retrieval Databases Data structures Gallium nitride computer science math.matical model Engines Arithmetic Delay

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共83页 << < 74 75 76 77 78 79 80 81 82 83 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：