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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

358 篇 会议
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

238 篇 工学
- 235 篇 计算机科学与技术...
- 76 篇 软件工程
- 16 篇 电子科学与技术（可...
- 11 篇 电气工程
- 7 篇 信息与通信工程
- 7 篇 控制科学与工程
- 4 篇 机械工程
- 4 篇 动力工程及工程热...
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 建筑学
- 2 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 土木工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 生物工程
160 篇 理学
- 155 篇 数学
- 11 篇 统计学（可授理学、...
- 4 篇 物理学
- 1 篇 化学
- 1 篇 生物学
11 篇 管理学
- 8 篇 管理科学与工程(可...
- 8 篇 工商管理
- 2 篇 图书情报与档案管...
3 篇 教育学
- 3 篇 教育学
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 农学
- 1 篇 作物学

主题

83 篇 computer science
32 篇 formal logic
19 篇 logic
19 篇 computational mo...
19 篇 polynomials
16 篇 registers
16 篇 semantics
15 篇 mathematics
13 篇 probabilistic lo...
13 篇 standards
13 篇 delay
12 篇 computer archite...
12 篇 hardware
11 篇 concurrent compu...
11 篇 first-order logi...
11 篇 contracts
11 篇 complexity theor...
10 篇 automata
9 篇 linear logic
9 篇 application soft...

机构

8 篇 univ oxford oxfo...
8 篇 cnrs
6 篇 rhein westfal th...
5 篇 univ warsaw wars...
5 篇 department of co...
4 篇 univ bologna bol...
4 篇 tech univ dresde...
3 篇 inria le chesnay
3 篇 department of co...
3 篇 department of ap...
3 篇 univ tokyo
3 篇 carnegie mellon ...
3 篇 mit laboratory f...
2 篇 department of co...
2 篇 vienna tech univ...
2 篇 international co...
2 篇 univ warsaw inst...
2 篇 shanghai jiao to...
2 篇 univ pisa pisa
2 篇 nyu ny 10003 usa

作者

4 篇 b. awerbuch
4 篇 dal lago ugo
3 篇 vardi moshe y.
3 篇 d.m. tullsen
3 篇 d. peleg
3 篇 bojanczyk mikola...
3 篇 gastin paul
3 篇 kiefer sandra
3 篇 worrell james
3 篇 schweitzer pasca...
2 篇 s. dwarkadas
2 篇 adsul bharat
2 篇 kanovich max i.
2 篇 t. leighton
2 篇 kolaitis phokion...
2 篇 avanzini martin
2 篇 krishna shankara...
2 篇 d.h. albonesi
2 篇 tsukada takeshi
2 篇 skrzypczak micha...

语言

358 篇 英文
2 篇 其他

检索条件"任意字段=Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science"

共 360 条记录，以下是321-330 订阅

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

详细简洁

排序：

Highly efficient asynchronous execution of large-grained parallel programs

Highly efficient asynchronous execution of large-grained par...

引用

annual ieee symposium on Foundations of computer science

作者： Y. Aumann Z.M. Kedum K.V. Palem M.O. Rabin Department Computer Science Weizmann Institute of Science Rehovot Israel IBM Research Division IBM Thomas J. Watson Research Center Yorktown Heights NY USA Institute of Computer Science Hebrew University Jerusalem Israel Aiken Computation Laboratory Harvard University Cambridge MA USA

An n-thread parallel program p is large-grained if in every parallel step the computations on each of the threads are complex procedures requiring numerous processor instructions. this practically relevant style of programs differs from PRAM programs in its large granularity and the possibility that within a parallel step the computations on different threads may considerably vary in size. Let M be an n-processor asynchronous parallel system, with no restriction on the degree of asynchrony and without any specialized synchronization mechanisms. It is a challenging theoretical as well as practically important problem to ensure correct execution of P on such a parallel machine. Let P be a large-grained program requiring total work W for its execution on a synchronous a-processor parallel system. We present a transformation (compilation) of P into a program C(P) which correctly and efficiently effects the computation of P on the asynchronous machine M. Under moderate assumptions on the granularity of threads and the size of the program variables, execution of C(P) requires just O(Wlog* n) expected total work, and the memory space overhead is a small multiplicative constant.< >

关键词： Yarn Concurrent computing computer science computer aided instruction Phase change random access memory Parallel machines Bridges Contracts Error correction codes Application software

来源：评论

学校读者我要写书评

暂无评论

Directed vs. undirected monotone contact networks for threshold functions

Directed vs. undirected monotone contact networks for thresh...

引用

annual ieee symposium on Foundations of computer science

作者： M.M. Halldorsson J. Radhakrishnan K.V. Subrahmanyam School of Information Science Japan Advanced Institute of Science and Technology Tatsunokuchi Ishikawa Japan Hokuriku Sentan Kagaku Gijutsu Daigakuin Daigaku Nomi Ishikawa JP Sch. of Inf. Sci. JAIST Ishikawa Japan Theoretical Computer Science Group Tata Institute of Fundamental Research Bombay India

We consider the problem of computing threshold functions using directed and undirected monotone contact networks. Our main results are the following. First, we show that there exist directed monotone contact networks that compute T/sub k//sup n/, 2/spl les/k/spl les/n-1, of size O(k(n-k+2)log(n-k+2)). this bound is almost optimal for small thresholds, since there exists an /spl Omega/(knlog (n/(k-1))) lower bound. Our networks are described explicitly; the previously best upper bound known, obtained from the undirected networks of Dubiner and Zwick, used non-constructive arguments and gave directed networks of size O(k/sup 3.99/nlog n). Second, we show a lower bound of O(nlogloglog n) on the size of undirected monotone contact networks computing T/sub n-1//sup n/, improving the 2(n-1) lower bound of Markov. Combined with our upper bound result, this shows that directed monotone contact networks compute some threshold functions more easily than undirected networks.< >

关键词： computer networks Upper bound Information science Circuits computer science Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Breaking the /spl theta/(nlog/sup 2/ n) barrier for sorting with faults

Breaking the /spl Theta/(nlog/sup 2/ n) barrier for sorting ...

引用

annual ieee symposium on Foundations of computer science

作者： T. Leighton Yuan Ma Department of Mathematics and Laboratory for Computer Science Massachusetts Institute of Technology Cambridge MA USA

We study the problem of constructing a sorting circuit, network, or PRAM algorithm that is tolerant to faults. For the most part, we focus on fault patterns that are random, e.g., where the result of each comparison is independently faulty with probability upper-bounded by some constant. All previous fault-tolerant sorting circuits, networks, and parallel algorithms require /spl Omega/(log/sup 2/ n) depth (time) and/or /spl Omega/(nlog/sup 2/ n) comparisons to sort n items. In this paper, we construct a passive-fault-tolerant sorting circuit with O(nlog nloglog n) comparators, a reversal-fault-tolerant sorting network with O(n log/sup log(2)/ /sup 3/ n) comparators, and a deterministic O(log n)-step O(n)-processor EREW PRAM fault-tolerant sorting algorithm. the results are based on a new analysis of the AKS circuit, which uses a much weaker notion of expansion that can be preserved in the presence of faults. Previously, the AKS circuit was not believed to be fault-tolerant because the expansion properties that were believed to be crucial for the performance of the circuit are destroyed by random faults. Extensions of our results for worst-case faults are also presented.< >

关键词： Sorting Circuit faults Fault tolerance Merging Contracts Phase change random access memory Parallel algorithms Leg Switching circuits Packet switching

来源：评论

学校读者我要写书评

暂无评论

An on-line algorithm for improving performance in navigation

An on-line algorithm for improving performance in navigation

引用

annual ieee symposium on Foundations of computer science

作者： A. Blum P. Chalasani School of Computer Science Carnegie Mellon University Pittsburgh PA USA

Recent papers have shown optimally-competitive on-line strategies for a robot traveling from a point s to a point t in certain unknown geometric environments. We consider the question: Having gained some partial information about the scene on its first trip from s to t, can the robot improve its performance on subsequent trips it might make? this is a type of on-line problem where a strategy must exploit partial information about the future (e.g., about obstacles that lie ahead). For scenes with axis-parallel rectangular obstacles where the Euclidean distance between s and t is n, we present a deterministic algorithm whose average trip length after t trips, k/spl les/n, is O(/spl radic/n/k) times the length of the shortest s-t path in the scene. We also show that this is the best a deterministic strategy can do. this algorithm can be thought of as performing an optimal tradeoff between search effort and the goodness of the path found. We improve this algorithm so that for every i/spl les/n, the robot's ith trip length is O(/spl radic/n/t) times the shortest s-t path length. A key idea of the paper is that a tree structure can be defined in the scene, where the nodes are portions of certain obstacles and the edges are "short" paths from a node to its children. the core of our algorithms is an on-line strategy for traversing this tree optimally.< >

关键词： Navigation Layout Robot kinematics computer science Euclidean distance Cities and towns Tree data structures

来源：评论

学校读者我要写书评

暂无评论

Faster algorithms for the generalized network flow problem

Faster algorithms for the generalized network flow problem

引用

annual ieee symposium on Foundations of computer science

作者： T. Radzik Computer Science Department King''s College London UK

We consider the generalized network flow problem. Each arc e in the network has a gain factor /spl gamma/(e). If f(e) units of flow enter arc e, then f(e)/spl gamma/(e) units arrive at the other end of e. the generalized network flow problem is to maximize the net flow into one specific node, the sink. We give an algorithm which solves this problem in O/spl tilde/(m/sup 2/(m+nloglog B)log B) time, where B is the largest integer used to represent the gain factors, the capacities, and the initial supplies at the nodes. If m is O(n/sup (4/3/-/spl epsiv/) and B is not extremely large, then our bound improves the previous best bound O(m/sup 1.5/n/sup 2/log B) given by P.M. Vaidya (1989). Our algorithm is an approximation scheme which in each iteration reduces by a constant factor the difference between the current net flow into the sink and the optimal one. the solution which is within a factor of 1+/spl xi/ from the optimum can be computed in O/spl tilde/(m/sup 2/n+min{m/sup 2/n, m(m+nloglog B)}log(1//spl xi/)) time. this improves the previous bounds on the approximate generalized flow problem.< >

关键词： Linear programming Costs computer science Educational institutions Approximation algorithms Operations research Manufacturing processes Transportation Shortest path problem

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 7th annual ieee symposium on logic in computer science

Proceedings of the 7th Annual IEEE Symposium on Logic in Com...

引用

proceedings of the 7th annual ieee symposium on logic in computer science

the following topics are dealt with: lambda and related calculi;computation theory;logic;logic programming;programming theory;concurrent computation;and programming language theory. Abstracts of individual papers can ... 详细信息

ISBN: (纸本)0818627352

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Specifications in software development

Specifications in software development

引用

proceedings of the 7th annual ieee symposium on logic in computer science

作者： Wing, Jeannette M. Sch of Comput Sci Carnegie Mellon Univ Pittsburgh PA USA

Summary form only given. Various kinds of specifications used during software development are presented through examples. the focus is on the practical aspects of the nature and use of formal specifications. Some open... 详细信息

ISBN: (纸本)0818627352

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

References, local variables and operational reasoning

References, local variables and operational reasoning

引用

proceedings of the 7th annual ieee symposium on logic in computer science

作者： Mason, Ian A. Talcott, Carolyn L.

ISBN: (纸本)0818627352

A. R. Meyer and K. Sieber (Proc. 15th acm. Symp. on Principles of Programming Languages, 1988, pp. 191-208) gave a series of examples of programs that are operationally equivalent (according to the intended semantics of block-structured Algol-like programs) but are not given equivalent denotations in traditional denotational semantics. they propose various modifications to the denotational semantics that solve some of these discrepancies, but not all. the present authors approach the same problem, but from an operational rather than a denotational perspective. they present the first-order part of a new logic for reasoning about programs, and they use this logic to prove the equivalence of the Meyer-Sieber examples.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Disjunctive strictness analysis

Disjunctive strictness analysis

引用

proceedings of the 7th annual ieee symposium on logic in computer science

作者： Jensen, thomas P. Imperial Coll

ISBN: (纸本)0818627352

the problem of constructing a disjunctive strictness analysis for a higher-order, functional language is addressed. A system of disjunctive types for strictness analysis of typed λ-calculus is introduced, and the types are used to define a program logic for strictness analysis. A disjunctive abstract interpretation is then obtained as a sound and complete model of the program logic. the results extend earlier work on using the tensor product of lattices to analyze disjunctive properties of programs by abstract interpretation.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Deterministic vs. nondeterministic transitive closure logic

Deterministic vs. nondeterministic transitive closure logic

引用

proceedings of the 7th annual ieee symposium on logic in computer science

作者： Gradel, Erich McColm, Gregory L. Math Inst Univ Basel

ISBN: (纸本)0818627352

It is shown that transitive closure logic (FO + TC) is strictly more powerful than deterministic transitive closure logic (FO + DTC) on unordered structures. In fact, on certain classes of graphs, such as hypercubes or regular graphs of large degree and girth, every query in (FO + DTC) is first-order expressible. On the other hand, there are simple (FO + pos TC) queries on these classes that cannot be defined by first-order formulas.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 27 28 29 30 31 32 33 34 35 36 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：