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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,381 篇 会议
108 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

1,399 篇 工学
- 1,354 篇 软件工程
- 1,101 篇 计算机科学与技术...
- 176 篇 控制科学与工程
- 38 篇 信息与通信工程
- 21 篇 建筑学
- 15 篇 土木工程
- 15 篇 生物工程
- 13 篇 电气工程
- 12 篇 光学工程
- 6 篇 机械工程
- 6 篇 材料科学与工程（可...
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 3 篇 冶金工程
- 3 篇 航空宇航科学与技...
- 2 篇 力学（可授工学、理...
- 2 篇 生物医学工程（可授...
166 篇 理学
- 126 篇 数学
- 23 篇 系统科学
- 18 篇 生物学
- 6 篇 化学
- 6 篇 统计学（可授理学、...
- 5 篇 物理学
- 2 篇 地质学
145 篇 管理学
- 103 篇 图书情报与档案管...
- 55 篇 管理科学与工程(可...
- 31 篇 工商管理
18 篇 教育学
- 17 篇 教育学
10 篇 法学
- 9 篇 社会学
3 篇 经济学
- 3 篇 应用经济学
2 篇 医学
1 篇 农学

主题

452 篇 object oriented ...
226 篇 languages
81 篇 performance
79 篇 design
71 篇 java programming...
52 篇 algorithms
48 篇 java
44 篇 experimentation
43 篇 verification
36 篇 computer program...
31 篇 reliability
30 篇 theory
28 篇 aspect oriented ...
21 篇 measurement
17 篇 human factors
16 篇 parallel program...
15 篇 concurrency
14 篇 static analysis
14 篇 scala
14 篇 refactoring

机构

18 篇 univ washington ...
12 篇 ecole polytech f...
12 篇 univ texas austi...
9 篇 microsoft res re...
9 篇 swiss fed inst t...
8 篇 mit csail cambri...
8 篇 univ calif berke...
8 篇 university of il...
7 篇 victoria univers...
6 篇 programming tool...
6 篇 univ waterloo wa...
6 篇 suny binghamton ...
6 篇 university of wa...
6 篇 carnegie mellon ...
6 篇 aarhus univ dk-8...
6 篇 purdue univ dept...
5 篇 univ marburg d-3...
5 篇 tech univ darmst...
5 篇 ibm t.j. watson ...
5 篇 delft univ techn...

作者

13 篇 noble james
13 篇 de moor oege
13 篇 aldrich jonathan
11 篇 lorenz david h.
10 篇 biddle robert
10 篇 odersky martin
10 篇 ernst michael d.
9 篇 mckinley kathryn...
9 篇 baniassad elisa
9 篇 hendren laurie
9 篇 visser eelco
9 篇 ostermann klaus
8 篇 de champeaux den...
8 篇 tip frank
8 篇 cook william r.
8 篇 johnson ralph
8 篇 liu yu david
8 篇 binder walter
8 篇 abi-antoun marwa...
8 篇 mezini mira

语言

1,424 篇 英文
69 篇 其他

检索条件"任意字段=1987 Conference on Object Oriented Programming Systems Languages and Applications, OOPSLA 1987"

共 1493 条记录，以下是821-830 订阅

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

详细简洁

排序：

A comparative study of language support for generic programming

A comparative study of language support for generic programm...

引用

18th Annual conference on object-oriented programming, systems, languages and applications (oopsla 2003)

作者： Garcia, R Järvi, J Lumsdaine, A Siek, J Willcock, J Indiana Univ Open Syst Lab Bloomington IN 47401 USA

Many modem programming languages support basic generic programming, sufficient to implement type-safe polymorphic containers. Some languages have moved beyond this basic support to a broader, more powerful interpretation of generic programming, and their extensions have proven valuable in practice. This paper reports on a comprehensive comparison of generics in six programming languages: C++, Standard NIL, Haskell, Eiffel, Java (with its proposed generics extension), and Generic C#. By implementing a substantial example in each of these languages, we identify eight language features that support this broader view of generic programming. We find these features are necessary to avoid awkward designs, poor maintainability, unnecessary run-time checks, and painfully verbose code. As languages increasingly support generics, it is important that language designers understand the features necessary to provide powerful generics and that their absence causes serious difficulties for programmers.

关键词： languages design standardization generics generic programming polymorphism C plus Standard ML Haskell Eiffel Java C#

来源：评论

学校读者我要写书评

暂无评论

Partial behavioral reflection:: Spatial and temporal selection of reification

Partial behavioral reflection:: Spatial and temporal selecti...

引用

18th Annual conference on object-oriented programming, systems, languages and applications (oopsla 2003)

作者： Tanter, É Noyé, J Caromel, D Cointe, P Univ Chile DCC CWR Santiago Chile INRIA Ecole Mines Nantes OBASCO Project Nantes France INRIA Rennes France Univ Nice IUF INFIA CNRSOASIS Project Sophia Antipolis France

Behavioral reflection is a powerful approach for adapting the behavior of running applications. In this paper we present and motivate partial behavioral reflection, an approach to more efficient and flexible behavioral reflection. We expose the spatial and temporal dimensions of such reflection, and propose a model of partial behavioral reflection based on the notion of hooksets. In the context of Java, we describe a reflective architecture offering appropriate interfaces for static and dynamic configuration of partial behavioral reflection at various levels, as well as Reflex, an open reflective extension for Java implementing this architecture. Reflex is the first extension that fully supports partial behavioral reflection in a portable manner, and that seamlessly integrates load-time and runtime behavioral reflection. The paper shows preliminary benchmarks and examples supporting the approach. The examples, dealing with the observer pattern and asynchronous communication via transparent futures, also show the interest of partial behavioral reflection as a tool for open dynamic Aspect-oriented programming.

关键词： languages experimentation aspect-oriented programming open systems reflection

来源：评论

学校读者我要写书评

暂无评论

A pair-programming experiment in a non-programming course

A pair-programming experiment in a non-programming course

引用

18th Annual ACM SIGPLAN conference on object-oriented programming, systems, languages, and applications, oopsla'03

作者： Gehringer, Edward F. North Carolina State University Department of Computer Science Box 8206 Raleigh NC 27606 United States

ISBN: (纸本)1581137516

Pair programming is a concept where two programmers work side by side at the same computer, writing code jointly. One of them, called the driver, is in control of the keyboard and mouse. The other, called the navigator, observes what the driver is doing and offers advice. It is the driver's job to write the code. The navigator has a chance to observe the larger picture, evaluating the driver's code for correctness of design and implementation. Studies have shown that pair programming is very effective. Two programmers can finish a task in little over half the elapsed time that a single programmer takes. And the quality of the code - measured in terms of absence of defects -is much higher. In the past few years, pair programming has made inroads into industry and into programming courses. However, it has not typically been used in courses that teach subjects other than programming or software engineering, nor has it been used in the analysis of experimental results. This paper reports on an experiment in a combined senior/masters-level computer architecture class, using Hennessy & Patterson's Computer Architecture: A Quantitative Approach as a text. Students were required to implement three projects simulating various aspects of a microarchitecture (cache, branch predictor, dynamic instruction scheduler). Then they engaged in an experimental analysis to find the best configuration in a design space. Students reported high levels of satisfaction with the experience of pair programming. Pair programmers obtained significantly higher grades on Project 1;however, differences on the other projects were not statistically significant.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

MetaEdit+: Defining and using domain-specific modeling languages and code generators

MetaEdit+: Defining and using domain-specific modeling langu...

引用

18th Annual ACM SIGPLAN conference on object-oriented programming, systems, languages, and applications, oopsla'03

作者： Tolvanen, Juha-Pekka Rossi, Matti MetaCase Consulting Ylistonmaentie 31 FIN-40500 Jyvaskyla Finland Helsinki School of Economics FIN-00100 Helsinki Finland

ISBN: (纸本)1581137516

MetaEdit+ is an environment that allows building modeling tools and generators fitting to application domains, without having to write a single line of code. The capability to define modeling tools and generators is relevant as it provides the ability to raise the abstraction of design work from code to domain concepts, and a raise in abstraction leads to an imminent raise in productivity, as illustrated by the past years' experiences. In domain-specific modeling and MetaEdit+, one expert defines a domain-specific language as a metamodel containing the domain concepts and rules, and specifies the mapping from that to code in a domain-specific code generator. For the method implementation, MetaEdit+ provides a metamodeling language and tool suite for defining the method concepts, their properties, associated rules, symbols, checking reports, and generators. Once the expert defines a modeling method, or even a partial prototype, the rest of the team can start to use it in MetaEdit+ to make models with the modeling language and the required code is automatically generated from those models. Based on the metamodel, MetaEdit+ automatically provides CASE tool functionality: diagramming editors, browsers, generators, multiuser/project/platform support, etc. The MetaEdit+ demo will focus on showing how the domainspecific languages and generators are made;complete with several examples of domain-specific methods and related code generators.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

A first-class approach to genericity

A first-class approach to genericity

引用

18th Annual conference on object-oriented programming, systems, languages and applications (oopsla 2003)

作者： Allen, E Bannet, J Cartwright, R Rice Univ Houston TX 77005 USA

This paper describes how to add first-class generic types including mixins - to strongly-typed 00 languages with nominal subtyping such as Java and C#. A generic type system is "first-class" if generic types can appear in any context where conventional types can appear. In this context, a mixin is simply a generic class that extends one of its type parameters, e.g., a class C that extends T. Although mixins of this form are widely used in C++ (via templates), they are clumsy and error-prone because C++ treats mixins as macros, forcing each mixin instantiation to be separately compiled and type-checked. The abstraction embodied in a mixin is never separately analyzed. Our formulation of mixins using first-class genericity accommodates sound local (class-by-class) type checking. A mixin can be fully type-checked given symbol tables for each of the classes that it directly references-the same context in which Java performs incremental class compilation. To our knowledge, no previous formal analysis of first-class genericity in languages with nominal type systems has been conducted, which is surprising because nominal subtyping has become predominant in mainstream object-oriented programming languages. What makes our treatment of first-class genericity particularly interesting and important is the fact that it can be added to the existing Java language without any change to the underlying Java Virtual Machine. Moreover, the extension is backward compatible with legacy Java source and class files. Although our discussion of a, practical implementation strategy focuses on Java, the same implementation techniques could be applied to other object-oriented languages such as C# or Eiffel that support incremental compilation, dynamic class loading, and nominal subtyping.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

Dynamic metrics for Java

Dynamic metrics for Java

引用

18th Annual conference on object-oriented programming, systems, languages and applications (oopsla 2003)

作者： Dufour, B Driesen, K Hendren, L Verbrugge, C McGill Univ Sch Comp Sci Montreal PQ H3A 2A7 Canada

In order to perform meaningful experiments in optimizing compilation and run-time system design, researchers usually rely on a suite of benchmark programs of interest to the optimization technique under consideration. Programs are described as numeric, memory-intensive, concurrent, or object-oriented, based on a qualitative appraisal, in some cases with little justification. We believe it is beneficial to quantify the behaviour of programs with a concise and precisely defined set of metrics, in order to make these intuitive notions of program behaviour more concrete and subject to experimental validation. We therefore define and measure a set of unambiguous, dynamic, robust and architecture-independent metrics that can be used to categorize programs according to their dynamic behaviour in five areas: size, data structure, memory use, concurrency, and polymorphism. A framework computing some of these metrics for Java programs is presented along with specific results demonstrating how to use metric data to understand a program's behaviour, and both guide and evaluate compiler optimizations.

关键词： experimentation languages measurement performance standardization dynamic metrics software metrics program analysis Java profiling execution traces optimization

来源：评论

学校读者我要写书评

暂无评论

Applying traits to the smalltalk collection classes

Applying traits to the smalltalk collection classes

引用

18th Annual conference on object-oriented programming, systems, languages and applications (oopsla 2003)

作者： Black, AP Schärli, N Ducasse, S Oregon Hlth & Sci Univ OGI Sch Sci & Engn Portland OR 97201 USA Univ Bern Software Composit Grp CH-3012 Bern Switzerland

Traits are a programming language technology that promote the reuse of methods between unrelated classes. This paper reports on a refactoring of the Smalltalk collections classes using traits. The original collection classes contained much duplication of code;traits let us remove all of it. We also found places where the protocols of the collections lacked uniformity;traits allowed us to correct these non-uniformities without code duplication. Traits also make it possible to reuse fragments of collection code outside of the existing hierarchy;for example, they make it easy to convert other collection-like things into true collections. Our refactoring reduced the number of methods in the collection classes by approximately 10 per cent. More importantly, understandability maintainability and reusability of the code were significantly improved.

关键词： design languages reuse mixins traits Smalltalk collection hierarchy stream classes refactoring inheritance multiple inheritance

来源：评论

学校读者我要写书评

暂无评论

Lazy modular upgrades in persistent object stores

Lazy modular upgrades in persistent object stores

引用

18th Annual conference on object-oriented programming, systems, languages and applications (oopsla 2003)

作者： Boyapati, C Liskov, B Shrira, L Moh, CH Richman, S MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

Persistent object stores require a way to automatically upgrade persistent objects, to change their code and storage representation. Automatic upgrades are a challenge for such systems. Upgrades must be performed in a way that is efficient both in space and time, and that does not stop application access to the store. In addition, however, the approach must be modular: it must allow programmers to reason locally about the correctness of their upgrades similar to the way they would reason about regular code. This paper provides solutions to both problems. The paper first defines upgrade modularity conditions that any upgrade system must satisfy to support local reasoning about upgrades. The paper then describes a new approach for executing upgrades efficiently while satisfying the upgrade modularity conditions. The approach exploits object encapsulation properties in a novel way. The paper also describes a prototype implementation and shows that our upgrade system imposes only a small overhead on application performance.

关键词： software upgrades presistent objects ownership types

来源：评论

学校读者我要写书评

暂无评论

Mostly concurrent garbage collection revisited

Mostly concurrent garbage collection revisited

引用

18th Annual conference on object-oriented programming, systems, languages and applications (oopsla 2003)

作者： Barabash, K Ossia, Y Petrank, E IBM Corp Haifa Res Lab IL-31905 Haifa Israel Technion Israel Inst Technol Comp Sci Dept IL-32000 Haifa Israel

The mostly concurrent garbage collection was presented in the seminal paper of Boehm et al. With the deployment of Java as a portable, secure and concurrent programming language, the mostly concurrent garbage collector turned out to be an excellent solution for Java's garbage collection task. The use of this collector is reported for several modern production Java Virtual Machines and it has been investigated further in academia. In this paper, we present a modification of the mostly concurrent collector, which improves the throughput, the memory footprint, and the cache behavior of the collector without foiling the other good qualities (such as short pauses and high scalability). We implemented our solution on the IBM production JVM and obtained a performance improvement of up to 26.7%, a reduction in the heap consumption by up to 13.4%, and no substantial change in the (short) pause times. The modified algorithm was subsequently incorporated into the IBM production JVM.

关键词： languages performance algorithms garbage collection Java JVM concurrent garbage collection incremental garbage collection

来源：评论

学校读者我要写书评

暂无评论

Refactoring for generalization using type constraints

Refactoring for generalization using type constraints

引用

18th Annual conference on object-oriented programming, systems, languages and applications (oopsla 2003)

作者： Tip, F Kiezun, A Bäumer, D IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA MIT Comp Sci Lab Cambridge MA 02139 USA IBM Res Corp OTI Labs CH-8001 Zurich Switzerland

Refactoring is the process of applying behavior-preserving transformations (called "refactorings") in order to improve a program's design. Associated with a refactoring is a set of preconditions that must be satisfied to guarantee that program behavior is preserved, and a set of source code modifications. An important category of refactorings is concerned with generalization (e.g., EXTRACT INTERFACE for re-routing the access to a class via a newly created interface, and PULL UP MEMBERS for moving members into a superclass). For these refactorings, both the preconditions and the set of allowable source code modifications depend on interprocedural relationships between types of variables. We present an approach in which type constraints are used to verify the preconditions and to determine the allowable source code modifications for a number of generalization-related refactorings. This work is implemented in the standard distribution of Eclipse (see www. eclipse. org).

关键词： design languages theory refactoring type constraints program analysis subtyping class hierarchy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共150页 << < 79 80 81 82 83 84 85 86 87 88 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：