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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,085 篇 工学
- 1,014 篇 软件工程
- 779 篇 计算机科学与技术...
- 45 篇 控制科学与工程
- 42 篇 电气工程
- 40 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 3 篇 生物工程
- 2 篇 光学工程
- 2 篇 农业工程
132 篇 理学
- 112 篇 数学
- 13 篇 系统科学
- 8 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 物理学
- 4 篇 化学
88 篇 管理学
- 52 篇 管理科学与工程(可...
- 40 篇 图书情报与档案管...
- 29 篇 工商管理
13 篇 教育学
- 13 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
2 篇 农学
- 2 篇 作物学

主题

185 篇 design
173 篇 languages
102 篇 performance
96 篇 computer program...
62 篇 algorithms
50 篇 computer program...
47 篇 object oriented ...
46 篇 experimentation
43 篇 java programming...
40 篇 verification
35 篇 reliability
32 篇 functional progr...
31 篇 java
26 篇 program synthesi...
24 篇 probabilistic pr...
21 篇 domain-specific ...
20 篇 c (programming l...
20 篇 measurement
20 篇 concurrency
19 篇 theory

机构

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 篇 mit cambridge ma...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
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
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 篇 foster nate
6 篇 felleisen matthi...
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

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

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

共 1259 条记录，以下是771-780 订阅

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

详细简洁

排序：

Bootstrapping one-sided flexible arrays 02

Bootstrapping one-sided flexible arrays

引用

7th International conference on Functional programming

作者： Hinze, R Univ Bonn Inst Informat 3 D-53117 Bonn Germany

ISBN: (纸本)9781581134872

The abstract data type one-sided flexible array, also called random-access list, supports look-up and update of elements and can grow and shrink at one end. We describe a purely functional implementation based on weight-balanced multiway trees that is both simple and versatile. A novel feature of the representation is that the running time of the operations can be tailored to one's needs-even dynamically at array-creation time. In particular, one can trade the running time of look-up operations for the running time of update operations. For instance, if the multiway trees have a fixed degree, the operations take Theta(log n) time, where n is the size of the flexible array. If the degree doubles levelwise, look-up speeds up to Theta(rootlog n) while update slows down to Theta(2(rootlog n)). We show that different tree shapes can be conveniently modelled after mixed-radix number systems.

关键词： algorithms design performance purely functional data structures flexible arrays sub-logarithmic look-up mixed-radix number systems Haskell

来源：评论

学校读者我要写书评

暂无评论

language-specific make technology for the Java™ programming language

Language-specific make technology for the Java™ programming...

引用

17th Meeting on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2002)

作者： Dmitriev, M Sun Microsyst Inc Mt View CA 94043 USA

Keeping the code of a Java(TM) application consistent (code is consistent if all of the project classes can be recompiled together without errors) prevents late linking errors, and thus may significantly improve development turnaround time. In this paper we describe a make technology for the Java programming language, that is based on smart dependency checking, guarantees consistency of the project code, and at the same time reduces the number of source code recompilations to the minimum. After project code consistency is initially assured by complete recompilation, the information extracted from the binary classes is stored in a so-called project database. Whenever the source code for some class C is changed, its recompiled binary is compared to the old version of C preserved in the project database. As a, result, we find a minimum subset of classes that depend on C and may be affected by the particular change made to it. These are recompiled in turn, and absence of compilation errors at this phase guarantees the consistency of the new project code. To determine which dependent classes to recompile, we categorize all source incompatible changes, and for each category establish a criterion for finding the smallest possible subset of dependent classes.

关键词： design languages Java dependency checking make development turnaround time

来源：评论

学校读者我要写书评

暂无评论

Towards a formalization for COM part I: The primitive calculus 02

Towards a formalization for COM part I: The primitive calcul...

引用

17th Meeting on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2002)

作者： Pucella, R Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)9781581134711

We introduce in this paper a typed calculus intended to capture the execution model of COM. The innovation of this calculus is to model very low-level aspects of the COM framework, specifically the notion of interface pointers. This is handled by specifying an allocation semantics for the calculus, thereby modeling heap allocation of interfaces explicitly. Having an explicit way of talking about interface pointers allows us to model in a reasonable way the notions of interface sharing and object identity. We introduce a type system that can be used to disambiguate between specification and implementation of interfaces. The type system moreover can capture a notion of COM conformance, that is, the legality of COM components. We discuss extensions of the calculus to handle subtyping of interfaces, dynamic interface negotiation and aggregation.

关键词： design languages COM components interfaces calculus formalism type system

来源：评论

学校读者我要写书评

暂无评论

1st acm sigplan/SIGSOFT International conference on Generative programming and Component Engineering, GPCE 2002

1st ACM SIGPLAN/SIGSOFT International Conference on Generati...

引用

1st acm sigplan/SIGSOFT International conference on Generative programming and Component Engineering, GPCE 2002

ISBN: (纸本)3540442847

The proceedings contain 20 papers. The special focus in this conference is on Generative programming and Component Engineering. The topics include: Program generation, termination, and binding-time analysis;generative programming for embedded systems;a specification and scripting language for binary data;memoization in type-directed partial evaluation;a protocol stack development tool using generative programming;building composable aspect-specific languages with logic metaprogramming;architectural refactoring in framework evolution;towards a modular program derivation via fusion and tupling;generative programming for embedded software;a framework for the detection and resolution of aspect interactions;bridging the gap between implementation and design;program termination analysis in polynomial time;generators for synthesis of qos adaptation in distributed real-time embedded systems;optimizing content management system pipelines;component-based programming for higher-order attribute grammars;altering java semantics via bytecode manipulation;meta-programming with concrete object syntax and managing dynamic changes in multi-stage program generation systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Component technologies: Java beans, COM, CORBA, RMI, EJB and the CORBA component model

Component technologies: Java beans, COM, CORBA, RMI, EJB and...

引用

24th International conference on Software Engineering

作者： Emmerich, W Kaveh, N UCL Dept Comp Sci London WC1E 6BT England

ISBN: (纸本)158113472X

This one-day tutorial is aimed at software engineering practitioners and researchers, who axe familiar with object-oriented analysis, design and programming and want to obtain an overview of the technologies that are enabling component-based development. We introduce the idea of component-based development by defining the concept and providing its economic rationale. We describe how object-oriented programming evolved into local component models, such as Java Beans and distributed object technologies, such as the Common Object Request Broker Architecture (CORBA), Java Remote Method Invocation (RMI) and the Component Object Model (CONI). We then address how these technologies matured into distributed component models, in partiuclar Enterprise Java Beans (EJB) and the CORBA Component Model (CCM). We give an assessment of the maturity of each of these technologies and sketch how they are used to build distributed architectures.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

A framework for the detection and resolution of aspect interactions 1

A framework for the detection and resolution of aspect inter...

引用

1st International conference on Generative programming and Component Engineering

作者： Douence, R Fradet, P Südholt, M INRIA Ecole Mines Nantes Nantes France INRIA IRISA Rennes France

ISBN: (纸本)3540442847

Aspect-Oriented programming (AOP) promises separation of concerns at the implementation level. However, aspects are not always orthogonal and aspect interaction is an important problem. Currently there is almost no support for the detection and resolution of such interactions. The programmer is responsible for identifying interactions between conflicting aspects and implementing conflict resolution code. In this paper, we propose a solution to this problem based on a generic framework for AOP. The contributions are threefold: we present a formal and expressive crosscut language, two static conflict analyses and some linguistic support for conflict resolution.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Higher-order functions and partial applications for a C++ skeleton library 02

Higher-order functions and partial applications for a C++ sk...

引用

proceedings of the Joint acm Java Grande - ISCOPE 2002 conference

作者： Kuchen, Herbert Striegnitz, Jörg University of Münster Department of Information Systems Leonardo Campus 3 48149 Münster Germany Research Centre Jülich Central Institute for Applied Math. D-52425 Jülich Germany

ISBN: (纸本)9781581135992

Message passing based on libraries such as MPI is typically used to program parallel machines with distributed memory. This is efficient but error prone. Algorithmic skeletons intend to simplify parallel programming by increasing the expressive power. The idea is to offer typical parallel programming patterns as polymorphic higher-order functions which are efficiently implemented in parallel. The present paper describes, how C++ templates and operator overloading can be used in order to provide the main features needed for algorithmic skeletons, namely higher-order functions, partial applications, and parametric polymorphism. Experimental results based on a draft implementation of our C++ skeleton library show that the higher expressive power can be gained without a significant performance penalty.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

GCspy: An adaptable heap visualisation framework 02

GCspy: An adaptable heap visualisation framework

引用

17th Meeting on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2002)

作者： Printezis, T Jones, R Univ Glasgow Dept Comp Sci Glasgow G12 8RZ Lanark Scotland Univ Kent Comp Lab Canterbury CT2 7NF Kent England

ISBN: (纸本)9781581134711

GCspy is an architectural framework for the collection, transmission, storage and replay of memory management behaviour. It makes new contributions to the understanding of the dynamic memory behaviour of programming languages (and especially object-oriented languages that make heavy demands on the performance of memory managers). GCspy's architecture allows easy incorporation into any memory management system: it is not limited to garbage-collected languages. It requires only small changes to the system in which it is incorporated but provides a simple to use yet powerful data-gathering API. GCspy scales to allow very large heaps to be visualised effectively and efficiently. It allows already-running, local or remote systems to be visualised and those systems to run at full speed outside the points at which data is gathered. GCspy's visualisation tool presents this information in a number of novel ways. Deep understanding of program behaviour is essential to the design of the next generation of garbage collectors and explicit allocators. Until now, no satisfactory tools have been available to assist the implementer in gaining an understanding of heap behaviour. GCspy has been demonstrated to be a practical solution to this dilemma. It has been used to analyse production Java virtual machines running applications of realistic sizes. Its use has revealed important insights into the interaction between application program and JVM and has led to the development of better garbage collectors.

关键词： algorithms measurement performance languages human factors language implementation memory management garbage collection visualisation of objects Java

来源：评论

学校读者我要写书评

暂无评论

Execution of monolithic Java programs on large non-dedicated collections of commodity workstations

Execution of monolithic Java programs on large non-dedicated...

引用

proceedings of the Joint acm Java Grande - ISCOPE 2002 conference

作者： Factor, Michael Schuster, Assaf Shagin, Konstantin IBM Research Lab in Haifa Haifa University Campus Haifa 31905 Israel Computer Science Department Israel Institute of Technology Technion City Haifa 32000 Israel

Today's typical computational environment consists of a large numbers of commodity workstations interconnected by high bandwidth networks. However, only a small portion of workstation's capacity is utilized since a large share of workstations may idle at any given moment. This paper proposes the general design of a runtime that executes a standard Java application on available idle workstations. This runtime transparently distributes the application's threads and objects among the currently idle nodes.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Aspect-oriented modeling: Bridging the gap between implementation and design 1

Aspect-oriented modeling: Bridging the gap between implement...

引用

1st International conference on Generative programming and Component Engineering

作者： Elrad, T Aldawud, O Bader, A IIT Chicago IL 60616 USA

ISBN: (纸本)3540442847

Separation of Concerns is one of the software engineering design principles that is getting more attention from practitioners and researchers in order to promote design and code reuse. Separation of Concerns (SoC) separates requirements such as synchronization and scheduling from the core functionality. These requirements are often referred to as crosscutting-concerns. The implementation of such requirements is scattered throughout the system, which results in the code-tangling problem. Aspect Oriented programming provides the user with the ability to modularize, and weave crosscutting-concerns in order to maximize code reusability and solves the code-tangling problem. Weaving is the process of combining crosscutting concerns with the core functionality. Using the UML to model and inter-weave these concerns is a craft that is hard to master due to the lack of formal modeling techniques based on SoC. In this paper we present a formal design methodology to model the system's concerns based on aspect-orientation.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 74 75 76 77 78 79 80 81 82 83 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：