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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

959 篇 会议
62 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

905 篇 工学
- 859 篇 软件工程
- 783 篇 计算机科学与技术...
- 155 篇 控制科学与工程
- 28 篇 信息与通信工程
- 16 篇 电气工程
- 12 篇 建筑学
- 10 篇 光学工程
- 9 篇 土木工程
- 9 篇 生物工程
- 6 篇 材料科学与工程（可...
- 5 篇 机械工程
- 4 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 3 篇 冶金工程
- 3 篇 航空宇航科学与技...
- 2 篇 力学（可授工学、理...
123 篇 理学
- 92 篇 数学
- 17 篇 系统科学
- 12 篇 生物学
- 6 篇 统计学（可授理学、...
- 5 篇 化学
- 3 篇 物理学
- 2 篇 地质学
109 篇 管理学
- 78 篇 图书情报与档案管...
- 42 篇 管理科学与工程(可...
- 23 篇 工商管理
16 篇 教育学
- 15 篇 教育学
8 篇 法学
- 8 篇 社会学
2 篇 经济学
- 2 篇 应用经济学
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 农学

主题

468 篇 object oriented ...
24 篇 languages
22 篇 object oriented ...
17 篇 object-oriented ...
16 篇 computer languag...
15 篇 performance
15 篇 java
12 篇 design
10 篇 computer program...
10 篇 user interfaces
9 篇 software enginee...
9 篇 verification
8 篇 application soft...
8 篇 semantics
8 篇 computer aided s...
7 篇 computer science
7 篇 parallel program...
7 篇 static analysis
7 篇 scala
6 篇 reliability

机构

7 篇 swiss fed inst t...
6 篇 univ texas austi...
5 篇 ibm t.j. watson ...
5 篇 carnegie mellon ...
5 篇 university of il...
4 篇 ecole polytech f...
4 篇 univ waterloo wa...
4 篇 victoria univers...
4 篇 at and t united ...
3 篇 ibm united state...
3 篇 school of comput...
3 篇 university of te...
3 篇 univ of washingt...
3 篇 university of il...
3 篇 oregon graduate ...
3 篇 ibm
3 篇 schlumberger-dol...
3 篇 department of co...
3 篇 intel corp santa...
3 篇 computer science...

作者

9 篇 biddle robert
9 篇 aldrich jonathan
8 篇 de champeaux den...
8 篇 noble james
8 篇 cook william r.
7 篇 johnson ralph
7 篇 coad peter
7 篇 abi-antoun marwa...
6 篇 baniassad elisa
6 篇 yonezawa akinori
6 篇 jacobson ivar
5 篇 mckinley kathryn...
5 篇 sweeney peter f.
5 篇 palsberg jens
5 篇 grothoff christi...
5 篇 helm richard
5 篇 yoder joseph w.
5 篇 alphonce carl
5 篇 kiczales gregor
5 篇 ungar david

语言

998 篇 英文
24 篇 其他

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

共 1022 条记录，以下是411-420 订阅

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

详细简洁

排序：

BuddyCache: High-performance object storage for collaborative strong-consistency applications in a WAN 02

BuddyCache: High-performance object storage for collaborativ...

引用

17th ACM conference on object-Orientated programming systems, languages, and applications

作者： Bjornsson, Magnus E. Shrira, Liuba Department of Computer Science Brandeis University Waltham MA 02454-9110 United States

ISBN: (纸本)9781581134711

Collaborative applications provide a shared work environment for groups of networked clients collaborating on a common task. They require strong consistency for shared persistent data and efficient access to fine-grained objects. These properties are difficult to provide in wide-area networks because of high network latency. BuddyCache is a new transactional caching approach that improves the latency of access to shared persistent objects for collaborative strong-consistency applications in high-latency network environments. The challenge is to improve performance while providing the correctness and availability properties of a transactional caching protocol in the presence of node failures and slow peers. We have implemented a BuddyCache prototype and evaluated its performance. Analytical results, confirmed by measurements of the BuddyCache prototype using the multi-user 007 benchmark indicate that for typical Internet latencies, e.g. ranging from 40 to 80 milliseconds round trip time to the storage server, peers using BuddyCache can reduce by up to 50% the latency of access to shared objects compared to accessing the remote servers directly.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Creating and preserving locality of Java applications at allocation and garbage collection times

Creating and preserving locality of Java applications at all...

引用

17th ACM conference on object-Orientated programming systems, languages, and applications

作者： Shuf, Yefim Gupta, Manish Franke, Hubertus Appel, Andrew Pal Singh, Jaswinder IBM T. J. Watson Research Center P.O. Box 218 Yorktown Heights NY 10598 United States Computer Science Department Princeton University Princeton NJ 08544 United States

The growing gap between processor and memory speeds is motivating the need for optimization strategies that improve data locality. A major challenge is to devise techniques suitable for pointer-intensive applications. This paper presents two techniques aimed at improving the memory behavior of pointer-intensive applications with dynamic memory allocation, such as those written in Java. First, we present an allocation time object placement technique based on the recently introduced notion of prolific (frequently instantiated) types. We attempt to co-locate, at allocation time, objects of prolific types that are connected via object references. Then, we present a novel locality based graph traversal technique. The benefits of this technique, when applied to garbage collection (GC), are twofold: (i) it improves the performance of GC due to better locality during a heap traversal and (ii) it restructures surviving objects in a way that enhances locality. On multiprocessors, this technique can further reduce overhead due to synchronization and false sharing. The experimental results, on a well-known suite of Java benchmarks (SPECjvm98 [26], SPECjbb2000 [27], and jOlden [4]), from an implementation of these techniques in the Jikes RVM [1], are very encouraging. The object co-allocation technique improves application performance by up to 21% (10% on average) in the Jikes RVM configured with a non-copying mark- and-sweep collector. The locality-based traversal technique reduces GC times by up to 20% (10% on average) and improves the performance of applications by up to 14% (6% on average) in the Jikes RVM configured with a copying semi-space collector. Both techniques combined can improve application performance by up to 22% (10% on average) in the Jikes RVM configured with a non-copying mark-and-sweep collector.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

Proceedings: conference on object-oriented programming, systems, languages, and applications

Proceedings: Conference on Object-Oriented Programming, Syst...

引用

conference on object-oriented programming, systems, languages and applications (oopsla 2001)

The proceedings contains 27 papers. Topics discussed include object oriented programming, Java syntactic extenders, optimization in Java, complex object queries, Java just in time compilers, pretenuring in Java and co... 详细信息

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A categorization of classes based on the visualization of their internal structure: The class blueprint

A categorization of classes based on the visualization of th...

引用

conference on object-oriented programming, systems, languages and applications (oopsla 2001)

作者： Lanza, Michele Ducasse, Stéphane Software Composition Group University of Bern Bern Switzerland

The reengineering and reverse engineering of software systems is gaining importance in software industry, because the accelerated turnover in software companies creates legacy systems in a shorter period of time. Especially understanding classes is a key activity in object-oriented programming, since classes represent the primary abstractions from which applications are built. The main problem of this task is to quickly grasp the purpose of a class and its inner structure. To help the reverse engineers in their first contact with a foreign system, we propose a categorization of classes based on the visualization of their internal structure. The contributions of this paper are a novel categorization of classes and a visualization of the classes which we call the class blueprint. We have validated the categorization on several case studies, two of which we present here.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

On objects and events

On objects and events

引用

conference on object-oriented programming, systems, languages and applications (oopsla 2001)

作者： Eugster, Patrick Th. Guerraoui, Rachid Damm, Christian Heide Distributed Programming Laboratory Swiss Federal Inst. of Technology CH-1015 Lausanne Switzerland

This paper presents linguistic primitives for publish/subscribe programming using events and objects. We integrate our primitives into a strongly typed object-oriented language through four mechanisms: (1) serialization, (2) multiple subtyping, (3) closures, and (4) deferred code evaluation. We illustrate our primitives through Java, showing how we have overcome its respective lacks. A precompiler transforms statements based on our publish/subscribe primitives into calls to specifically generated typed adapters, which resemble the typed stubs and skeletons generated by the rmic precompiler for remote method invocations in Java.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

object-oriented composition untangled

Object-oriented composition untangled

引用

conference on object-oriented programming, systems, languages and applications (oopsla 2001)

作者： Ostermann, Klaus Mezini, Mira Siemens AG Corporate Technology SE 2 D-81730 Munich Germany

object-oriented languages come with pre-defined composition mechanisms, such as inheritance, object composition, or delegation, each characterized by a certain set of composition properties, which do not themselves individually exist as abstractions at the language level. However, often non-standard composition semantics is needed, with a mixture of composition properties, which is not provided as such by any of the standard composition mechanisms. Such non-standard semantics are simulated by complicated architectures that are sensitive to requirement changes and cannot easily be adapted without invalidating existing clients. In this paper, we propose compound references, a new abstraction for object references, that allows us to provide explicit linguistic means for expressing and combining individual composition properties on-demand. The model is statically typed and allows the programmer to express a seamless spectrum of composition semantics in the interval between object composition and inheritance. The resulting programs are better understandable, due to explicitly expressed design decisions, and less sensitive to requirement changes.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Encapsulating objects with confined types

Encapsulating objects with confined types

引用

conference on object-oriented programming, systems, languages and applications (oopsla 2001)

作者： Grothoff, Christian Palsberg, Jens Vitek, Jan S3 Lab. Department of Computer Sciences Purdue University West Lafayette IN United States

object-oriented languages provide little support for encapsulating objects. Reference semantics allows objects to escape their defining scope. The pervasive aliasing that ensues remains a major source of software defects. This paper introduces Kacheck/J a tool for inferring object encapsulation properties in large Java programs. Our goal is to develop practical tools to assist software engineers, thus we focus on simple and scalable techniques. Kacheck/J is able to infer confinement for Java classes. A class and its subclasses are confined if all of their instances are encapsulated in their defining package. This simple property can be used to identify accidental leaks of sensitive objects. The analysis is scalable and efficient;Kacheck/J is able to infer confinement on a corpus of 46,000 classes (115 MB) in 6 minutes.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Visitor combination and traversal control

Visitor combination and traversal control

引用

conference on object-oriented programming, systems, languages and applications (oopsla 2001)

作者： Visser, Joost CWI P.O. Box 94079 1090 GB Amsterdam Netherlands

The Visitor design pattern allows the encapsulation of polymorphic behavior outside the class hierarchy on which it operates. A common application of Visitor is the encapsulation of tree traversals. Unfortunately, visitors resist composition and allow little traversal control. To remove these limitations, we introduce visitor combinators. These are implementations of the visitor interface that can be used to compose new visitors from given ones. The set of combinators we propose includes traversal combinators that can be used to obtain full traversal control. A clean separation can be made between the generic parts of the combinator set and the parts that are specific to a particular class hierarchy. The generic parts form a reusable framework. The specific parts can be generated from a (tree) grammar. Due to this separation, programming with visitor combinators becomes a form of generic programming with significant reuse of (visitor) code.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Incremental computation of complex object queries

Incremental computation of complex object queries

引用

conference on object-oriented programming, systems, languages and applications (oopsla 2001)

作者： Nakamura, Hiroaki IBM Research Tokyo Research Laboratory 1623-14 Shimotsuruma Yamato-shi Kanagawa-ken 242-8502 Japan

The need for incremental algorithms for evaluating database queries is well known, but constructing algorithms that work on object-oriented databases (OODBs) has been difficult. The reason is that OODB query languages involve complex data types including composite objects and nested collections. As a result, existing algorithms have limitations in that the kinds of database updates are restricted, the operations found in many query languages are not supported, or the algorithms are too complex to be described precisely. We present an incremental computation algorithm that can handle any kind of database updates, can accept any expressions in complex query languages such as OQL, and can be described precisely. By translating primitive values and records into collections, we can reduce all query expressions into ones composed of only one kind of operation, namely comprehension. This makes the problems with incremental computation less complicated and thus allows us to describe the algorithm precisely. Our incremental algorithm consists of two parts: one is to maintain the consistency in each comprehension occurrence and the other is to update the value of an entire expression. The algorithm is so flexible that we can use strict updates, lazy updates, and their combinations. By comparing the performance of applications built with our mechanism and that of equivalent hand written update programs, we show that our incremental algorithm can be implemented efficiently.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Portable resource control in Java: The J-SEAL2 approach

Portable resource control in Java: The J-SEAL2 approach

引用

conference on object-oriented programming, systems, languages and applications (oopsla 2001)

作者： Binder, Walter Hulaas, Jarle G. Villazón, Alex CoCo Software Engineering Margaretenstr. 22/9 A-1040 Vienna Austria

Preventing abusive resource consumption is indispensable for all kinds of systems that execute untrusted mobile code, such as mobile object systems, extensible web servers, and web browsers. To implement the required defense mechanisms, some support for resource control must be available: accounting and limiting the usage of physical resources like CPU and memory, and of logical resources like threads. Java is the predominant implementation language for the kind of systems envisaged here, even though resource control is a missing feature on standard Java platforms. This paper describes the model and implementation mechanisms underlying the new resource-aware version of the J-SEAL2 mobile object kernel. Our fundamental objective is to achieve complete portability, and our approach is therefore based on Java bytecode transformations. Whereas resource control may be targeted towards the provision of quality of service or of usage-based billing, the focus of this paper is on security, and more specifically on prevention of denial-of-service attacks originating from hostile or poorly implemented mobile code.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共103页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：