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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,155 篇 会议
135 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,115 篇 工学
- 1,040 篇 软件工程
- 803 篇 计算机科学与技术...
- 50 篇 控制科学与工程
- 43 篇 电气工程
- 36 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 航空宇航科学与技...
- 5 篇 生物工程
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 农业工程
141 篇 理学
- 117 篇 数学
- 13 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 生物学
- 5 篇 物理学
- 4 篇 化学
89 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 28 篇 工商管理
15 篇 教育学
- 15 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

180 篇 design
167 篇 languages
103 篇 computer program...
99 篇 performance
59 篇 algorithms
49 篇 object oriented ...
49 篇 computer program...
45 篇 experimentation
45 篇 java programming...
39 篇 verification
35 篇 reliability
34 篇 java
32 篇 functional progr...
26 篇 program synthesi...
24 篇 probabilistic pr...
22 篇 software design
21 篇 theory
20 篇 concurrency
19 篇 domain-specific ...
19 篇 c (programming l...

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
12 篇 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 篇 microsoft res re...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
9 篇 microsoft resear...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...

作者

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 篇 rajan hridesh
6 篇 foster nate
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,204 篇 英文
85 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM Sigplan 2003 Conference on Programming Language Design and Implementation"

共 1290 条记录，以下是1061-1070 订阅

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

详细简洁

排序：

Optimizing dynamically-dispatched calls with run-time type feedback 94

Optimizing dynamically-dispatched calls with run-time type f...

引用

proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Holzle, Urs Ungar, David Stanford Univ Stanford CA United States

ISBN: (纸本)089791662X

Object-oriented programs are difficult to optimize because they execute many dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler does not know which callee will be invoked at runtime. We have developed a simple technique that feeds back type information from the runtime system to the compiler. With this type feedback, the compiler can inline any dynamically-dispatched call. Our compiler drastically reduces the call frequency of a suite of large SELF applications (by a factor of 3.6) and improves performance by a factor of 1.7. We believe that type feedback could significantly reduce call frequencies and improve performance for most other object-oriented languages (statically-typed or not) as well as for languages with type-dependent operations such as generic arithmetic.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Type analysis of Prolog using type graphs 94

Type analysis of Prolog using type graphs

引用

proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Van Hentenryck, P. Cortesi, A. Le Charlier, B. Brown Univ Providence United States

ISBN: (纸本)089791662X

Type analysis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types and hence expensive in computation time. The purpose of this paper is to describe a type analysis system for Prolog based on abstract interpretation and type graphs (i.e. disjunctive rational trees) with this functionality. The system (about 15,000 lines of C) consists of the combination of a generic fixpoint algorithm, a generic pattern domain, and a type graph domain. The main contribution of the paper is to show that this approach can be engineered to be practical for medium-sized programs without sacrificing accuracy. The main technical contributions to achieve this result are (1) a novel widening operator for type graphs which appears to be accurate and effective in keeping the sizes of the graphs, and hence the computation time, reasonably small;(2) the use of the generic pattern domain to obtain a compact representation of equality constraints between subterms and to factor out sure structural information.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Backtracking without trailing in CLP (RLin) 94

Backtracking without trailing in CLP (RLin)

引用

proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Van Hentenryck, Pascal Ramachandran, Viswanath Brown Univ Providence United States

ISBN: (纸本)089791662X

Constraint logic programming (CLP) is a generalization of logic programming where unification is replaced by constraint solving as the basic operation of the language. The combination of constraint solving and nondeterminism (approximated by backtracking) makes these languages appealing for a variety of combinatorial search problems. Existing CLP languages support backtracking by generalizing traditional Prolog implementations: modifications to the constraint system are trailed and restored on backtracking. Although simple and efficient, trailing may be very demanding in memory space, since the constraint system may potentially be saved at each choice point. This paper proposes a fundamentally new implementation scheme for backtracking in CLP languages over linear (rational or real) arithmetic. The new scheme, called semantic backtracking, does not use trailing but rather exploits the semantics of the constraints to undo the effect of newly added constraints. Semantic backtracking reduces the space complexity by an order of magnitude compared to implementations based on trailing and makes space complexity essentially independent of the number of choice points. In addition, semantic backtracking introduces negligible space and time overhead on deterministic programs. The price for this improvement is an increase in backtracking time, although constraint-solving time may actually decrease. The scheme has been implemented as part of a complete CLP system CLP (RLin) and compared analytically and experimentally with an optimized trailing implementation. Experimental results indicate that semantic backtracking produces significant reduction in memory space, while keeping the time overhead reasonably small.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Randomized implementation of multiple functional arrays

Randomized implementation of multiple functional arrays

引用

proceedings of the 1994 acm conference on LISP and Functional programming

作者： Chuang, Tyng-Ruey Chalmers Univ of Technology Goteborg Sweden

ISBN: (纸本)0897916433

The array update problem in the implementation of a purely functional language is the following: once an array is updated, both the original array and the newly updated one must be preserved to maintain referential transparency. Previous approaches have mainly based on the detection or enforcement of single-threaded accesses to an aggregate, by means of compiler-time analyses or language restrictions. These approaches cannot deal with aggregates which are updated in a multi-threaded manner. Baker's shallow binding scheme can be used to implement multi-threaded functional arrays. His scheme, however, can be very expensive if there are repeated alternations between long binding paths. We design a scheme that fragments binding paths randomly. The randomization scheme is on-line, simple to implement, and its expected performance comparable to that of the optimal off-line solutions. All this is achieved without using compiler-time analyses, and without restricting the languages. The expected performance of the randomization scheme is analyzed in details, and some preliminary results are shown. Applications of the randomization technique to other functional aggregates, as well as its implications, are briefly outlined.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Program structure tree. Computing control regions in linear time

Program structure tree. Computing control regions in linear ...

引用

proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Johnson, Richard Pearson, David Pingali, Keshav Cornell Univ Ithaca United States

ISBN: (纸本)089791662X

In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flow graph. We give a linear-time algorithm for finding SESE regions and for building the PST of arbitrary control flow graphs (including irreducible ones). Next, we establish a connection between SESE regions and control dependence equivalence classes, and show how to use the algorithm to find control regions in linear time. Finally, we discuss some applications of the PST. Many control flow algorithms, such as construction of Static Single Assignment form, can be speeded up by applying the algorithms in a divide-and-conquer style to each SESE region on its own. The PST is also used to speed up data flow analysis by exploiting `sparsity'. Experimental results from the Perfect Club and SPEC89 benchmarks confirm that the PST approach finds and exploits program structure.

关键词： Structured programming

来源：评论

学校读者我要写书评

暂无评论

Implementing internal program representations with Ada and Ada 9X

Implementing internal program representations with Ada and A...

引用

1994 Annual International conference on TRI-Ada 1994

作者： Duncan, Arthur G. ALIMAR Software Research SchenectadyNY United States

ISBN: (纸本)0897916662

In an earlier paper, the author discussed the use of Ada to implement the internal program representation for an Ada software reengineering system. While many of Ada's features were used to advantage in the implementation, the lack of an inheritance mechanism and an expressive subtyping system make the implementation unnecessarily cumbersome and insecure. Had Ada 9X been available at the time, we could have achieved a simpler, more readable. and more secure design;furthermore, the implementation (most likely) would have been more efficient. Contrasting the Ada and Ada 9X implementations leads naturafly to some observations on how one could build tcmls to convert Ada legacy code to Ada 9X. © 1994 acm.

关键词： Ada (programming language)

来源：评论

学校读者我要写书评

暂无评论

Object oriented design and implementation of concurrent and real time systems in Ada

Object oriented design and implementation of concurrent and ...

引用

1994 Annual International conference on TRI-Ada 1994

作者： Oliver, S. Ron Department of Computer Science California Polytechnic State University San Luis ObispoCA93407 United States

ISBN: (纸本)0897916662

Object Oriented technology, especially Object Oriented programming (OOP), has recently become very popular in a number of contexts, and for various applications. However, there have been relatively few reports of using 00 Methods (OOM) for concurrent and real time systems (CRTS), Moreover, it has often been claimed that Ada 83 is an inappropriate language for doing 00P. This paper briefly reports successful use of 00M, with Ada, in a variety of CRTS, including a concurrent approach to discrete event simulation. Results show there are substantial benefits to using OOM with Ada, contradicting popular myth. Object Oriented design and implementation (OOD&I), versus 00P, is superior for developing large, complex software systems, and is better supported by Ada 83, than by "true" OO languages. © 1994 acm.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

A rating system for qualification analysis with application to personal evaluation 94

A rating system for qualification analysis with application ...

引用

International conference on APL: The language and its Applications, APL 1994

作者： Kononov, Mexei I. Reimarov, Gennady A. Obninsk State Study and Conference Centre Algorithm Researeh and Methodology Bureau 21 Kurehatov M. Obninsk Kaiuga Region249020 Russia

A way opinions and its embodiment as a rating algorithm for an end-user personnel qualification system is described. The system is tested for clerks cert@ing for the State Ministry and is customised for Nuclear Power ... 详细信息

ISBN: (纸本)0897916751

关键词： APL*PLUS statistical rating algorithm Personal suitability evaluation machine made testimonial menu dialogue system design

来源：评论

学校读者我要写书评

暂无评论

Simulation of mail warehouse an APL2 solution for a large company problem

Simulation of mail warehouse an APL2 solution for a large co...

引用

International conference on APL: The language and its Applications, APL 1994

作者： Skomorokhov, Alexander O. Institute of Atomic Energetic P.O.Box 5061 Obninsk-6 Kaluga Region249020 Russia

ISBN: (纸本)0897916751

The paper describes an APL2 soIution for a real life problem of a large eompauy. The problem is to make a decision on establishing a new fully automated warehouse for delive of business papers. Large scale of the projeet and poorly specified control process, the lack of operational experience leads to computer simulation method to support decision making. The diflkulties of simulation software design are considered. Among them very short time of implementation unstable speeitications, "fuzzy" definition of signifkant parameters, heuristic optimization criteria ***. It is shown that APL2 benefits, especially high development productivity, user defined operators technique, general arrays facilities, and AP124 auxiliary processor have allowed us to achieve the main design goals. The directions of future work are discussed in brief. © 1994 acm.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

proceedings of the conference on TRI-Ada 1994

Proceedings of the Conference on TRI-Ada 1994

引用

1994 Annual International conference on TRI-Ada 1994

ISBN: (纸本)0897916662

The proceedings contain 48 papers. The topics discussed include: Ada 9x tagged types and their implementation in GNAT;features of the Gnu Ada runtime library;working with Ada 9X classes;quality guidelines = designer metrics;run-time check elimination for Ada 9X;smart recompilation and the GNAT compiler;lessons learned in implementing a team review process;integrating GNAT into GCC;the GNAT compilation model;the GNAT project: a GNU-Ada 9X compiler;an object-oriented approach to software process modeling and definition;software project reporting: management, measurement, and process improvement;the STARS process engine: language and architecture to support process capture and multi-user execution;delegation: dynamic specialization;Ada-based programming language course in Moscow State University;educating educators: lessons in adding Ada to a small school curriculum;profiling in an object-oriented design environment that supports Ada 9x and Ada 83 code generation;selecting a software development process;Easy-Sim: using Ada 9x in a graphics system software architecture;implementing internal program representations with Ada and Ada 9x;and design of GUIs from a programming perspective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共129页 << < 103 104 105 106 107 108 109 110 111 112 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：