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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,046 篇 工学
- 982 篇 软件工程
- 752 篇 计算机科学与技术...
- 44 篇 控制科学与工程
- 42 篇 电气工程
- 32 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 5 篇 土木工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 3 篇 生物工程
- 2 篇 光学工程
- 2 篇 冶金工程
- 2 篇 农业工程
126 篇 理学
- 106 篇 数学
- 12 篇 系统科学
- 8 篇 统计学（可授理学、...
- 5 篇 物理学
- 5 篇 生物学
- 4 篇 化学
81 篇 管理学
- 48 篇 管理科学与工程(可...
- 36 篇 图书情报与档案管...
- 26 篇 工商管理
12 篇 教育学
- 12 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

170 篇 design
157 篇 languages
100 篇 computer program...
96 篇 performance
57 篇 algorithms
49 篇 computer program...
47 篇 object oriented ...
43 篇 experimentation
39 篇 verification
35 篇 java programming...
34 篇 reliability
29 篇 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
8 篇 sarkar vivek
7 篇 august david i.
7 篇 bacon david f.
6 篇 wang xinyu
6 篇 hendren laurie
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 bodik rastislav

语言

1,132 篇 英文
77 篇 其他
1 篇 中文

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

共 1210 条记录，以下是1191-1200 订阅

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

详细简洁

排序：

Exploiting parallelism in the implementation of AGNA, a persistent programming system

Exploiting parallelism in the implementation of AGNA, a pers...

引用

International conference on Data Engineering

作者： R.S. Nikhil M.L. Heytens MIT Laboratory for Computer Science Cambridge MA USA Massachusetts Institute of Technology Cambridge MA USA

A design for AGNA, a persistent object system that utilizes parallelism in a fundamental way to enhance performance, is presented. The underlying thesis is that fine-grained parallelism is essential for achieving scalable performance on parallel multiple instruction/multiple data (MIMD) machines. This, in turn, implies a data-driven model of computation for efficiency. The complete design based on these principles starts with a declarative source language because such languages reveal the most fine-grained parallelism. It is described how transactions are compiled into an abstract, fine-grained parallel machine called P-RISC. The P-RISC virtual heap is implemented in the memory and disk of a parallel machine in such a way that paging is overlapped with useful computation. The current implementation status is described, some preliminary performance results are reported and the approach presented is compared to several recent parallel database system projects.< >

关键词： Parallel programming Parallel processing Database systems Computer languages Concurrent computing Data structures Laboratories Computer science Computational modeling Power engineering computing

来源：评论

学校读者我要写书评

暂无评论

A generational on-the-fly garbage collector for Java 00

A generational on-the-fly garbage collector for Java

引用

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

作者： Tamar Domani Elliot K. Kolodner Erez Petrank IBM Haifa Research Lab. Computer Science Dept. Technion - Israel Institute of Technology

ISBN: (纸本)9781581131994

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications running on multiprocessor servers, where it is important to fully utilize all processors and provide even response time, especially for systems for which stopping the threads is a costly operation. In this work, we report on the incorporation of generations into an on-the-fly garbage collector. The incorporation is non-trivial since an on-the-fly collector avoids explicit synchronization with the program threads. To the best of our knowledge, such an incorporation has not been tried before. We have implemented the collector for a prototype Java Virtual Machine on AIX, and measured its performance on a 4-way *** for other generational collectors, an on-the-fly generationalcollector has the potential for reducing the overall running time and working set of an application by concentrating collection efforts on the young objects. However, in contrast to other generational collectors,on-the-fly collectors do not move the objects; thus, there is no segregation between the old and the young objects. Furthermore, on-the-fly collectors do not stop the threads, so there is no extra benefit for the short pauses obtained by generational collection. Nevertheless, comparing our on-the-fly collector with and without generations, it turns out that the generational collector performs better for most applications. The best reduction in overall running time for the benchmarks we measured was 25%. However, there were some benchmarks for which it had no effect and one for which the overall running time increased by 4%.

关键词： memory management generational garbage collection programming languages garbage collection

来源：评论

学校读者我要写书评

暂无评论

Use object-oriented paradigm to design and implement an algorithm for object-oriented class-level testing

Use object-oriented paradigm to design and implement an algo...

引用

IEEE International conference on Systems, Man and Cybernetics

作者： Yu Xia Sun Huo Yan Chen Department of Computer Science Jinan University Guangzhou China

ISBN: (纸本)0780379527

One of the means to enhance software reliability and quality is testing. The testing for object-oriented software is more complex and difficult than that for traditional programming. For object-oriented class-level and cluster-level testing, we proposed a significant methodology TACLLE which has been published in acm Transactions on Software Engineering and Methodology (vol.7., no.3, p.250-95, 1998; vol.10, no.1, p.56-109, 2001). This methodology includes an important algorithm named DOE to determine whether two objects are observational equivalent or not. This paper presents the design and implementation for a new prototype of DOE using object-oriented paradigm. The new prototype is based on UML model. It is improved on the technique, and optimized in the system interface.

关键词： Algorithm design and analysis Software testing Clustering algorithms US Department of Energy Software prototyping Prototypes Software reliability Object oriented programming Software engineering Unified modeling language

来源：评论

学校读者我要写书评

暂无评论

Analysis and design of latch-controlled synchronous digital circuits 90

Analysis and design of latch-controlled synchronous digital ...

引用

proceedings of the 27th acm/IEEE design Automation conference

作者： Karem A. Sakallah Trevor N. Mudge Oyekunle A. Olukotun Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI

ISBN: (纸本)9780897913638

We present a succinct formulation of the timing constraints for latch-controlled synchronous digital circuits. We show that the constraints are mildly nonlinear, and prove the equivalence of the nonlinear optimal cycle time calculation problem to an associated and simpler linear programming (LP) problem. We present an LP-based algorithm which is guaranteed to obtain the optimal cycle time for arbitrary circuits controlled by a general class of multi-phase overlapped clocks. We illustrate the formulation and an initial implementation of the algorithm on some example circuits.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Load-reuse analysis: design and evaluation 99

Load-reuse analysis: design and evaluation

引用

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

作者： Rastislav Bodík Rajiv Gupta Mary Lou Soffa Dept. of Computer Science University of Pittsburgh Pittsburgh PA

ISBN: (纸本)9781581130942

Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the results of prior memory accesses. This paper develops a load-reuse analysis and designs a method for evaluating its *** designing the analysis, we aspire for completeness---the goal of exposing all reuse that can be harvested by a subsequent program transformation. For register promotion, a suitable transformation is partial redundancy elimination (PRE). To approach the ideal goal of PRE-completeness, the load-reuse analysis is phrased as a data-flow problem on a program representation that is path-sensitive, as it detects reuse even when it originates in a different instruction along each control flow path. Furthermore, the analysis is comprehensive, as it treats scalar, array and pointer-based loads *** evaluating the analysis, we compare it with an ideal analysis. By observing the run-time stream of memory references, we collect all PRE-exploitable reuse and treat it as the ideal analysis performance. To compare the (static) load-reuse analysis with the (dynamic) ideal reuse, we use an estimator algorithm that computes, given a data-flow solution and a program profile, the dynamic amount of reuse detected by the analysis. We developed a family of estimators that differ in how well they bound the profiling error inherent in the edge profile. By bounding the error, the estimators offer a precise and practical method for determining the run-time optimization *** experiments show that about 55% of loads executed in Spec95 exhibit reuse. Of those, our analysis exposes about 80%.

关键词： register promotion program representations data-flow analysis profile-guided optimizations

来源：评论

学校读者我要写书评

暂无评论

Structured programming: From theory to practice 76

Structured Programming: From theory to practice

引用

proceedings of the 2nd international conference on Software engineering

作者： John C. Carrow

One of the more controversial topics to appear within the field of Computer Science has been the theory of Structured programming and the specific tools and techniques associated with this generic title. With respect to this topic, it is the intent of this paper to provide a documented history of the research, prototyping and deliberate implementation of the Structured programming Technology within the United States Army Computer Systems Command. Structured programming as used within the context of this paper involves the concepts of structured code, top down development, walkthrus, program design language, design and documentation tools, program support library and a programming team. The USACSC experience is viewed as not just another case study but rather an organizational change impacting a large number (500 COBOL programmers) of personnel, standards, and normal operating *** of the more intriguing topics to appear within the field of Computer Science has been the theory of Structured programming and the specific tools and techniques associated with this generic title. After several years of discussion, pilot projects, technical articles and more discussions, the basic questions remain: What does the technology buy you? What does it cost you? How does one implement the technology on a large scale in a software production shop?With respect to these questions, and many others that the Software community shares regarding Structured programming, it is the intent of this paper to provide a documented history of the research, prototyping and deliberate implementation of the Structured programming Technology within the United States Army Computer Systems Command (USACSC).

关键词： Functional decomposition

来源：评论

学校读者我要写书评

暂无评论

Object versioning in Ode

Object versioning in Ode

引用

International conference on Data Engineering

作者： R. Agrawal S. Buroff N. Gehani D. Shasha IBM Almaden Research Center San Jose CA USA AT and T Bell Laboratories Inc. NJ USA New York University New York NY USA

In designing the versioning facility in Ode, a few but semantically sound and powerful concepts are introduced that allow implementation of a wide variety of paradigms. Some of the salient features of these versioning facilities are the following: (1) object versioning is orthogonal to type; (2) reference to an object can be bound statically to a specific version of the object or dynamically to whatever is its latest version; and (3) both temporal as well as derived-from relationships between versions of an object are maintained automatically. These facilities have been incorporated seamlessly into Ode's database programming language, O++. The new language constructs are powerful enough to make O++ a suitable platform for implementing a variety of versioning paradigms and application-specific systems.< >

关键词： Object oriented databases Database systems Object oriented modeling design automation Computer languages Application software Power system modeling Data models Object oriented programming Organizing

来源：评论

学校读者我要写书评

暂无评论

Java-through-C compilation: an enabling technology for Java in embedded systems 04

Java-through-C compilation: an enabling technology for Java ...

引用

design, Automation and Test in Europe conference and Exhibition

作者： A. Varma S.S. Bhattacharyya University of Maryland College Park USA

ISBN: (纸本)9780769520858

The Java programming language is acheiving greater acceptance in high-end embedded systems such as cellphones and PDAs. However, current embedded implementations of Java impose tight constraints on functionality, while requiring significant storage space. In addition, they require that a JVM be ported to each such platform. We demonstrate the first Java-to-C compilation strategy that is suitable for a wide range of embedded systems, thereby enabling broad use of Java on embedded platforms. This strategy removes many of the constraints on functionality and reduces code size without sacrificing performance. The compilation framework described is easily retargetable, and is also applicable to bare-bones embedded systems with no operating system or JVM. On an average, we found the size of the generated executables to be over 25 times smaller than those generated by a cutting-edge Java-to-native-code compiler, while providing performance comparable to the best of various Java implementation strategies.

关键词： Java Embedded system Yarn Libraries Data structures Educational institutions design automation Automatic testing System testing Europe

来源：评论

学校读者我要写书评

暂无评论

A randomized implementation of multiple functional arrays 94

A randomized implementation of multiple functional arrays

引用

proceedings of the 1994 acm conference on LISP and functional programming

作者： Tyng-Ruey Chuang

ISBN: (纸本)9780897916431

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 ***'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 *** 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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An expert tutor in the SLAW programming environment (abstract only) 87

An expert tutor in the SLAW programming environment (abstrac...

引用

proceedings of the 15th annual conference on Computer Science

作者： Michael V. Doran Tulane University Department of Computer Science

ISBN: (纸本)9780897912181

SLAW is a language free programming environment based on structure chart techniques presented in the department's introductory courses [LAW83] [LAW86]. The current implementation, which was developed on the IBM-PC, allows for automatic translation of an algorithm design (structure chart) into PASCAL, FORTRAN and BASIC [DOR86a]. This translation is possible due in part to inclusion of the dictionary of variables into the design [DOR85]. The environment has been tested and used by many students at Tulane and is currently being used in a local high school's advanced computer science course [DOR86b].A structure chart is a tree representation of an algorithm. Procedures and functions are represented as separate charts, themselves forming trees, with all the trees forming a forest of trees. Within this tree representation only certain structured constructs are allowed to be used. These constructs are: sequence, selection, looping and procedure/function call. Under no conditions are unrestricted branches allowed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共121页 << < 112 113 114 115 116 117 118 119 120 121 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：