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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
109 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

1,400 篇 工学
- 1,353 篇 软件工程
- 1,103 篇 计算机科学与技术...
- 176 篇 控制科学与工程
- 38 篇 信息与通信工程
- 21 篇 建筑学
- 15 篇 土木工程
- 15 篇 生物工程
- 12 篇 光学工程
- 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,423 篇 英文
70 篇 其他

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

共 1493 条记录，以下是681-690 订阅

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

详细简洁

排序：

Formal refactorings for object models

Formal refactorings for object models

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Gheyi, Rohit Massoni, Tiago Informatics Center Federal University of Pernambuco Recife Brazil

Both model and program refactorings are usually proposed in an ad hoc way because it is difficult to prove that they are sound with respect to a formal semantics. Even developers using refactoring tools have to rely on compilation and tests to guarantee the semantics preservation, which may not be satisfactory to critical software development. This work proposes a set of primitive structural semantics-preserving transformations for Alloy, a formal object-oriented modeling language. We use the Prototype Verification System (PVS), which contains a formal specification language and a theorem prover, to specify and prove the soundness of the transformations. Although our transformations are primitive, we can compose them in order to derive coarse grained transformations, such as a model refactoring to introduce a design pattern into a model. Moreover, proposing refactorings in this way can not only facilitate design, but also improve the quality of model refactoring tools. © 2005 ACM.

关键词： Theorem proving

来源：评论

学校读者我要写书评

暂无评论

Io, a Small programming Language

Io, a Small Programming Language

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Dekorte, Steve *** Mexico

Io is small prototype-based programming language. The ideas in Io are mostly inspired by Smalltalk[1] (all values are objects), Self[2] (prototype-based), NewtonScript[3] (differential inheritance), Act1[4] (actors and futures for concurrency), LISP[5] (code is a runtime inspectable / modifiable tree) and Lua[6] (small, embeddable).Io offers a more flexible language with more scalable concurrency in a smaller, simpler package than traditional languages and is well suited for use as both scripting and embedding within larger projects. Io is implemented in C and it's actor based concurrency model is built on coroutines and asynchronous i/o. It supports exceptions, incremental garbage collection and weak links. Io has bindings for many multiplatform libraries including Sockets, OpenGL, FreeType, PortAudio and others as well as some modules for transparent distributed objects and a user interface toolkit written in Io. This presentation will include an overview of the language and demos of some multi-platform desktop applications written with it. © 2005 ACM.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Ercatons and Organic programming: Say Good-Bye to Planned Economy

Ercatons and Organic Programming: Say Good-Bye to Planned Ec...

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Imbusch, Oliver Langhammer, Falk Von Walter, Guido Living Pages Research GmbH Kolosseumstrasse 1a Munich80469 Germany

Organic programming (OP) is our proposed and already emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-oriented programming (OOP) in particular. Ercatons provide an implementation of the model. In some respects, OP is less than a (new) programming language, in others, it is more. An "ercato machine"implements the ideas discussed and has been used to validate the concepts described *** programming is centered around the concept of a true "Thing". A thing in an executing software system is bound to behave the way an autonomous object does in our real world, or like a cell does in an organism. Software objects do not. Therefore, traditional software systems must be planned ahead like in a centrally planned economy while with OP, software systems grow. This fact is traced back to be the root why current software development often fails to meet our expectations when it comes to large-scale projects. OP should then be able to provide the means to make software development achieve what other engineering dis-ciplines have achieved a long time ago: that project effort scales sub-linearly with *** OP we introduce a new term because we hope that the approach we are pursuing is radical enough to justify this. © 2005 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Automating vertical profiling

Automating vertical profiling

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Hauswirth, Matthias Sweeney, Peter F. Diwan, Amer Mozer, Michael C. University of Colorado Boulder IBM Thomas J. Watson Research Center

Last year at oopsla we presented a methodology, vertical profiling, for understanding the performance of object-oriented programs. The key insight behind this methodology is that modern programs run on top of many layers (virtual machine, middleware, etc) and thus we need to collect and combine information from all layers in order to understand system performance. Although our methodology was able to explain previously unexplained performance phenomena, it was extremely labor intensive, In this paper we describe and evaluate techniques for automating two significant activities of vertical profiling: trace alignment and correlation. Trace alignment aligns traces obtained from separate runs so that one can reason across the traces. We are not aware of any prior approach that effectively and automatically aligns traces. Correlation sifts through hundreds of metrics to find ones that have a bearing on a performance anomaly of interest. In prior work we found that statistical correlation was only sometimes effective. We have identified highly-effective approaches for both activities. For aligning traces we explore dynamic time warping, and for correlation we explore eight correlators based on statistical correlation, distance measures, and piecewise linear segmentation. Although we explore these activities in the context of vertical profiling, both activities are widely applicable in the performance analysis area. Copyright 2005 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Using globus grid objects to extend a corba-based object-oriented system

Using globus grid objects to extend a corba-based object-ori...

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Spetka, Scott E. Ramseyer, George O. Linderman, Richard W. Itt Industries Suny Institute of Technology PO Box 3050 UticaNY13501 United States Afrl Information Directorate 26 Electronics Parkway RomeNY13441 United States

This paper, along with the accompanying demonstration, describes an object-oriented framework for high-performance computing. The original system [1] was developed with Common object Request Broker Architecture (Corba) [2] objects to implement the framework interfaces to code-dependent methods. To add new codes to the initial system required the implementation of new Corba interface objects. Globus Grid objects [3] have extended that original system, and have resulted in added flexibility in the design for the addition of new codes. High-performance computing agent services were also implemented as Globus Grid objects, resulting in enhanced communications between the framework user interface services and the agents responsible for executing the codes. The management functions for remote agents have also been improved. © 2005 ACM.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Incrementalization across object abstraction

Incrementalization across object abstraction

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Liu, Yanhong A. Stoller, Scott D. Gorbovitski, Michael Rothamel, Tom Liu, Yanni Ellen Computer Science Department State University of New York at Stony Brook Stony Brook NY 11794 Department of Computer Science University of Manitoba Winnipeg MB R3T 2N2 Canada

object abstraction supports the separation of what operations are provided by systems and components from how the operations are implemented, and is essential in enabling the construction of complex systems from components. Unfortunately, clear and modular implementations have poor performance when expensive query operations are repeated, while efficient implementations that incrementally maintain these query results are much more difficult to develop and to understand, because the code blows up significantly, and is no longer clear or modular. This paper describes a powerful and systematic method that first allows the "what" of each component to be specified in a clear and modular fashion and implemented straightforwardly in an object-oriented language;then analyzes the queries and updates, across object abstraction, in the straightforward implementation;and finally derives the sophisticated and efficient "how" of each component by incrementally maintaining the results of repeated expensive queries with respect to updates to their parameters. Our implementation and experimental results for example applications in query optimization, role-based access control, etc. demonstrate the effectiveness and benefit of the method. Copyright 2005 ACM.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Lifting sequential graph algorithms for distributed-memory parallel computation

Lifting sequential graph algorithms for distributed-memory p...

引用

20th conference on object-oriented programming, systems, languages and applications

作者： Gregor, D Lumsdaine, A Indiana Univ Open Syst Lab Bloomington IN 47405 USA

This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algorithms and supporting data structures, but it was not originally designed with parallelism in mind. In this paper, we revisit the abstractions comprising the BGL in the context of distributed-memory parallelism, lifting away the implicit requirements of sequential execution and a single shared address space. We illustrate our approach by describing the process as applied to one of the core algorithms in the BGL, breadth-first search. The result is a generic algorithm that is unchanged from the sequential algorithm, requiring only the introduction of external (distributed) data structures for parallel execution. More importantly, the generic implementation retains its interface and semantics, such that other distributed algorithms can be built upon it, just as algorithms are layered in the sequential case. By characterizing these extensions as well as the extension process, we develop general principles and patterns for using (and reusing) generic, object-oriented parallel software libraries. We demonstrate that the resulting algorithm implementations are both efficient and scalable with performance results for several algorithms.

关键词： algorithms design generic programming parallel graph algorithms distributed computing

来源：评论

学校读者我要写书评

暂无评论

Subtext: Uncovering the simplicity of programming

Subtext: Uncovering the simplicity of programming

引用

20th conference on object-oriented programming, systems, languages and applications

作者： Edwards, J MIT CSAIL Cambridge MA 02139 USA

Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is what makes programming so inhumanly difficult - we are not compilers. Subtext is a new medium in which the representation of a program is the same thing as its execution. Like a spreadsheet, a program is visible and alive, constantly executing even as it is edited. Program edits are coherent semantic transformations. The essence of this new medium is copying. Programs are constructed by copying and executed by copyflow: the projection of changes through copies. The simple idea of copying develops into a rich theory of higher-order continual copying of trees. Notably absent are symbolic names, the workhorse of textual notation, replaced by immediately-bound explicit relationships. Subtext unifies traditionally distinct programming tools and concepts, and enables some novel ones. Ancestral structures are a new primitive data type that combines the features of lists and records, along with unproblematic multiple inheritance. Adaptive conditionals use first-class program edits to dynamically adapt behavior. A prototype implementation shows promise, but calls for much further research. Subtext suggests that we can make programming radically easier, if we are willing to be radical.

关键词： human factors languages non-textual programming visual programming prototypes copying

来源：评论

学校读者我要写书评

暂无评论

Combining the robustness of checked exceptions with the flexibility of unchecked exceptions using anchored exception declarations 05

Combining the robustness of checked exceptions with the flex...

引用

20th conference on object-oriented programming, systems, languages and applications

作者： van Dooren, M Steegmans, E Katholieke Univ Leuven Louvain Belgium

ISBN: (纸本)9781595930316

Ever since their invention 30 years ago, checked exceptions have been a point of much discussion. On the one hand, they increase the robustness of software by preventing the manifestation of unanticipated checked exceptions at run-time. On the other hand, they decrease the adaptability of software because they must be propagated explicitly, and must often be handled even if they cannot be signalled. We show that the problems with checked exceptions are caused by a lack of expressiveness of the exceptional return type of a method, which currently dictates a copy & paste style. We add the required expressiveness by introducing anchored exception declarations, which allow the exceptional behavior of a method to be declared relative to that of others. We present the formal semantics of anchored exception declarations, along with the necessary rules for ensuring compile-time safety, and give a proof of soundness. We show that anchored exception declarations do not violate the principle of information hiding when used properly, and provide a guideline for when to use them. We have implemented anchored exception declarations in Cappuccino, which is an extension to the ClassicJava programming language.

关键词： languages theory reliability verification exception handling anchored exception declaration Cappuccino

来源：评论

学校读者我要写书评

暂无评论

Runtime specialization with optimistic heap analysis 05

Runtime specialization with optimistic heap analysis

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Shankar, Ajeet Bodík, Rastislav Subramanya Sastry, S. Smith, James E. University of California Berkeley United States University of Wisconsin Madison United States

ISBN: (纸本)1595930310

We describe a highly practical program specializer for Java programs. The specializer is powerful, because it specializes optimistically, using (potentially transient) constants in the heap;it is precise, because it specializes using data structures that are only partially invariant;it is deployable, because it is hidden in a JIT compiler and does not require any user annotations or offline preprocessing;it is simple, because it uses existing JIT compiler ingredients;and it is fast, because it specializes programs in under Is. These properties are the result of (1) a new algorithm for selecting specializable code fragments, based on a notion of influence;(2) a precise store profile for identifying constant heap locations;and (3) an efficient invalidation mechanism for monitoring optimistic assumptions about heap constants. Our implementation of the specializer in the Jikes RVM has low overhead, selects specialization points that would be chosen manually, and produces speedups ranging from a factor of 1.2 to 6.4, comparable with annotation-guided specializers. Copyright 2005 ACM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共150页 << < 65 66 67 68 69 70 71 72 73 74 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：