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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,098 篇 会议
131 篇 期刊文献

馆藏范围

1,229 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,058 篇 工学
- 998 篇 软件工程
- 761 篇 计算机科学与技术...
- 47 篇 控制科学与工程
- 38 篇 电气工程
- 31 篇 信息与通信工程
- 8 篇 电子科学与技术（可...
- 7 篇 机械工程
- 5 篇 化学工程与技术
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
- 4 篇 航空宇航科学与技...
- 4 篇 生物工程
- 2 篇 光学工程
- 2 篇 农业工程
137 篇 理学
- 113 篇 数学
- 13 篇 系统科学
- 9 篇 统计学（可授理学、...
- 6 篇 生物学
- 5 篇 化学
- 4 篇 物理学
- 2 篇 地质学
86 篇 管理学
- 52 篇 管理科学与工程(可...
- 38 篇 图书情报与档案管...
- 30 篇 工商管理
11 篇 教育学
- 11 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

170 篇 design
157 篇 languages
98 篇 computer program...
96 篇 performance
57 篇 algorithms
55 篇 object oriented ...
49 篇 computer program...
43 篇 experimentation
39 篇 verification
34 篇 reliability
34 篇 java programming...
28 篇 functional progr...
26 篇 program synthesi...
26 篇 java
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
17 篇 compilers
17 篇 type systems

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ washington ...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 univ penn philad...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 stanford univ st...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
8 篇 microsoft res re...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...
7 篇 northeastern uni...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 shao zhong
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
8 篇 gulwani sumit
7 篇 august david i.
7 篇 bacon david f.
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 hendren laurie
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 lam monica s.
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,150 篇 英文
78 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation"

共 1229 条记录，以下是1171-1180 订阅

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

详细简洁

排序：

The implementation and evaluation of fusion and contraction in array languages 98

The implementation and evaluation of fusion and contraction ...

引用

proceedings of the acm sigplan 1998 conference on programming language design and implementation

作者： E. Christopher Lewis Calvin Lin Lawrence Snyder University of Washington Seattle WA University of Texas Austin TX

ISBN: (纸本)9780897919876

Array languages such as Fortran 90, HPF and ZPL have many benefits in simplifying array-based computations and expressing data parallelism. However, they can suffer large performance penalties because they introduce intermediate arrays---both at the source level and during the compilation process---which increase memory usage and pollute the cache. Most compilers address this problem by simply scalarizing the array language and relying on a scalar language compiler to perform loop fusion and array contraction. We instead show that there are advantages to performing a form of loop fusion and array contraction at the array level. This paper describes this approach and explains its advantages. Experimental results show that our scheme typically yields runtime improvements of greater than 20% and sometimes up to 400%. In addition, it yields superior memory use when compared against commercial compilers and exhibits comparable memory use when compared with scalar languages. We also explore the interaction between these transformations and communication optimizations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

pHluid: the design of a parallel functional language implementation on workstations 96

pHluid: the design of a parallel functional language impleme...

引用

proceedings of the first acm sigplan international conference on Functional programming

作者： Cormac Flanagan Rishiyur S. Nikhil Rice University Department of Computer Science Houston Texas Digital Equipment Corp. Cambridge Research Laboratory One Kendall Square Bldg. 700 Cambridge Massachusetts

ISBN: (纸本)9780897917704

This paper describes the distributed memory implementation of a shared memory parallel functional language. The language is Id, an implicitly parallel, mostly functional language that is currently evolving into a dialect of Haskell. The target is a distributed memory machine, because we expect these to be the most widely available parallel platforms in the future. The difficult problem is to bridge the gap between the shared memory language model and the distributed memory machine model. The language model assumes that all data is uniformly accessible, whereas the machine has a severe memory hierarchy: a processor's access to remote memory (using explicit communication) is orders of magnitude slower than its access to local memory. Thus, avoiding communication is crucial for good performance. The Id language, and its general dataflow-inspierd compilation to multithreaded code are described elsewhere. In this paper, we focus on our new parallel runtime system and its features for avoiding communication and for tolerating its latency when necessary: multithreading, scheduling and load balancing; the distributed heap model and distributed coherent cacheing, and parallel garbage collection. We have completed the first implementation, and we present some preliminary performance mearsurements.

关键词： data flow parallel and distributed implementations garbage collection and run-time systems

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of Kaleidoscope'90-A constraint imperative programming language

The design and implementation of Kaleidoscope'90-A constrain...

引用

International conference on Computer languages

作者： B.N. Freeman-Benson A. Borning Department of Computer Science University of Victoria Victoria BC Canada Department of Computer Science and Engineering FR-35 University of Washington Seattle WA USA

Two major paradigms in computer programming languages are imperative and declarative programming. The authors describe a scheme for languages that integrate specific features from these two paradigms into a new framework: constraint imperative programming. The authors discuss the design and implementation of a particular instance of this framework, Kaleidoscope'90. From the imperative paradigm, constraint imperative programming adopts explicit control flow, state, and assignment. From the declarative paradigm, it adopts explicit, system-maintained constraints (relations that should hold). There is a strong practical motivation for making this integration: in a typical application, some portions are most clearly described using imperative constructs, while other portions are most clearly described using constraints. By using a constraint imperative language, the most suitable paradigm can be used, as appropriate.< >

关键词： Computer languages Thumb Computer science Object oriented programming Computational modeling Object oriented modeling Mice Application software Data flow computing Pressing

来源：评论

学校读者我要写书评

暂无评论

A logic programming tool for qualitative system design 86

A logic programming tool for qualitative system design

引用

proceedings of the international conference on APL

作者： Gert L. Moller Bang & Olufsen DK - 7600 Struer Denmark

ISBN: (纸本)9780901865359

Introducing a geometrical approach to propositional divalent logic with the truth-tables of the Boolean connectives as the geometrical objects, we can make a simple operational implementation in APL of basic inference methods. This is the basis for a logic programming tool used for preliminary product design at the Danish company Bang&Olufsen.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Practical program analysis using general purpose logic programming systems—a case study 96

Practical program analysis using general purpose logic progr...

引用

proceedings of the acm sigplan 1996 conference on programming language design and implementation

作者： Steven Dawson C. R. Ramakrishnan David S. Warren SRI International 333 Ravenswood Ave. Menlo Park CA and Department of Computer Science SUNY at Stony Brook Stony Brook NY Department of Computer Science SUNY at Stony Brook Stony Brook NY

ISBN: (纸本)9780897917957

Many analysis problems can be cast in the form of evaluating minimal models of a logic program. Although such formulations are appealing due to their simplicity and declarativeness, they have not been widely used in practice because, either existing logic programming systems do not guarantee completeness, or those that do have been viewed as too inefficient for integration into a compiler. The objective of this paper is to re-examine this issue in the context of recent advances in implementation technologies of logic programming *** find that such declarative formulations can indeed be used in practical systems, when combined with the appropriate tool for evaluation. We use existing formulations of analysis problems --- groundness analysis of logic programs, and strictness analysis of functional programs --- in this case study, and the XSB system, a table-based logic programming system, as the evaluation tool of choice. We give experimental evidence that the resultant groundness and strictness analysis systems are practical in terms of both time and space. In terms of implementation effort, the analyzers took less than 2 man-weeks (in total), to develop, optimize and evaluate. The analyzer itself consists of about 100 lines of tabled Prolog code and the entire system, including the components to read and preprocess input programs and to collect the analysis results, consists of about 500 lines of code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the circuit implementation problem (combinatorial logic circuits)

On the circuit implementation problem (combinatorial logic c...

引用

design Automation conference

作者： W. Li A. Lim P. Agrawal S. Sahni Department of Computer Science University of Arkansas USA Department of Computer & Information Science University of Florida USA AT and T Bell Laboratories Inc. Murray Hill NJ USA

The authors consider the problem of selecting an implementation of each circuit module from a cell library to satisfy overall delay and area, or delay and power requirements. Two versions of the circuit implementation problem, the basic circuit implementation problem and the general circuit implementation problem, are shown to be NP-hard. A pseudo-polynomial-time algorithm for the basic circuit implementation problem on series-parallel circuits is developed, and heuristics for the basic circuit implementation problem on general circuits are formulated. The run times for the heuristics are tabulated.< >

关键词： Logic circuits Delay Timing Libraries Dynamic programming Tree graphs Space technology Computer science Information technology Circuit synthesis

来源：评论

学校读者我要写书评

暂无评论

A language-based approach to protocol implementation 92

A language-based approach to protocol implementation

引用

conference proceedings on Communications architectures & protocols

作者： Mark B. Abbott Larry L. Peterson

ISBN: (纸本)9780897915250

Morpheus is special-purpose programming language that facilitates the efficient implementation of communication protocols. Protocols are divided into three categories, called shapes, so that they can inherit code and data structures based on their category; the programmer implements a particular protocol by refining the inherited structure. Morpheus optimization techniques reduce per-layer overhead on time-critical operations to a few assembler instructions even though the protocol stack is not determined until runtime. This supports divide-and-conquer simplification of the programming task by minimizing the penalty for decomposing complex protocols into combinations of simpler protocols.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Composable attribute grammars: support for modularity in translator design and implementation 92

Composable attribute grammars: support for modularity in tra...

引用

proceedings of the 19th acm sigplan-SIGACT symposium on Principles of programming languages

作者： R. Farrow T. J. Marlowe D. M. Yellin

ISBN: (纸本)9780897914536

This paper introduces Composable Attribute Grammars (CAGs), a formalism that extends classical attribute grammars to allow for the modular composition of translation specifications and of translators. CAGs bring to complex translator writing systems the same benefits of modularity found in modern programming languages, including comprehensibility, reusability, and incremental meta-compilation.A CAG is built from several smaller component AGs, each of which solves a particular subproblem, such as name analysis or register allocation. A component AG is based upon a simplified phrase-structure that reflects the properties of its subproblem rather than the phrase-structure of the source language. Different component phrase-structures for various subproblems are combined by mapping them into a phrase-structure for the source language. Both input and output attributes can be associated with the terminal symbols of a component AG. Output attributes enable the results of solving a subproblem to be distributed back to anywhere that originally contributed part of the subproblem, e.g. transparently distributing the results of global name analysis back to every symbolic reference in the source *** introducing CAGs by way of an example, we provide a formal definition of CAGs and their semantics. We describe a subclass of CAGs and their semantics. We describe a subclass of CAGs, called separable CAGs, that have favorable implementation properties. We discuss the novel aspects of CAGs, compare them to other proposals for inserting modularity into attribute grammars, and relate our experience using CAGs in the Linguist translator-writing system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adding trace matching with free variables to AspectJ 05

Adding trace matching with free variables to AspectJ

引用

proceedings of the 20th annual acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Chris Allan Pavel Avgustinov Aske Simon Christensen Laurie Hendren Sascha Kuzins Ondřej Lhoták Oege de Moor Damien Sereni Ganesh Sittampalam Julian Tibble University of Oxford United Kingdom University of Aarhus Denmark McGill University Montreal Canada

ISBN: (纸本)9781595930316

An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspect can make are confined to the current action: it is not possible to directly observe the history of a ***, there have been several interesting proposals for new history-based language features, most notably by Douence et al. and by Walker and Viggers. In this paper, we present a new history-based language feature called tracematches that enables the programmer to trigger the execution of extra code by specifying a regular pattern of events in a computation trace. We have fully designed and implemented tracematches as a seamless extension of AspectJ.A key innovation in our tracematch approach is the introduction of free variables in the matching patterns. This enhancement enables a whole new class of applications in which events can be matched not only by the event kind, but also by the values associated with the free variables. We provide several examples of applications enabled by this *** introducing and motivating the idea of tracematches via examples, we present a detailed semantics of our language design, and we derive an implementation from that semantics. The implementation has been realised as an extension of the abc compiler for AspectJ.

关键词： program monitoring aspect-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Look up!: your future is in the cloud 13

Look up!: your future is in the cloud

引用

proceedings of the 34th acm sigplan conference on programming language design and implementation

作者： James R. Larus Microsoft Research Redmond WA USA

ISBN: (纸本)9781450320146

The "Cloud" is a wonderfully expansive phrase used to denote computation and data storage centralized in a large datacenter and elastically accessed across a network. The concept is not new; web sites and business servers have run in datacenters for a long time. These, however, were specialized applications, outside of the mainstream of desktop programs. The past few years has seen enormous change as the mainstream shifts from a single computer to mobile devices and clusters of computers. Three factors are driving this change. 1) Mobile computing, where apps run on a size- and power-constrained device and would be far less interesting without backend systems to augment computation and storage capacity. 2) Big data, which uses clusters of computers to extract valuable information from vast amounts of unstructured data. 3) Inexpensive, elastic computing, pioneered by Amazon Web Services, which enables everyone to rapidly obtain and use many *** a researcher from the language and compiler community, I firmly believe this sea change is at heart a programming problem. Cloud computing is far different from the environment in which most of today's languages and tools were developed, and few programmers have mastered its complexity. New challenges include pervasive parallelism, partial failure, high and variable communication latency, and replication for reliability and throughput.

关键词： cloud computing distributed computing programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共123页 << < 114 115 116 117 118 119 120 121 122 123 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：