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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,268 篇 会议
296 篇 期刊文献
2 册 图书

馆藏范围

2,566 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,271 篇 工学
- 2,139 篇 软件工程
- 1,693 篇 计算机科学与技术...
- 83 篇 控制科学与工程
- 57 篇 信息与通信工程
- 55 篇 电气工程
- 22 篇 电子科学与技术（可...
- 17 篇 机械工程
- 13 篇 材料科学与工程（可...
- 13 篇 建筑学
- 13 篇 土木工程
- 13 篇 生物工程
- 10 篇 光学工程
- 9 篇 安全科学与工程
- 8 篇 化学工程与技术
- 5 篇 动力工程及工程热...
- 5 篇 生物医学工程（可授...
- 4 篇 力学（可授工学、理...
280 篇 理学
- 218 篇 数学
- 32 篇 系统科学
- 18 篇 统计学（可授理学、...
- 16 篇 物理学
- 16 篇 生物学
- 8 篇 化学
- 6 篇 地质学
209 篇 管理学
- 112 篇 图书情报与档案管...
- 109 篇 管理科学与工程(可...
- 50 篇 工商管理
22 篇 教育学
- 22 篇 教育学
17 篇 法学
- 15 篇 社会学
11 篇 经济学
- 11 篇 应用经济学
2 篇 农学
2 篇 艺术学
1 篇 军事学

主题

390 篇 design
369 篇 languages
187 篇 computer program...
182 篇 performance
162 篇 object oriented ...
89 篇 algorithms
88 篇 java programming...
81 篇 experimentation
79 篇 functional progr...
71 篇 theory
70 篇 computer program...
65 篇 java
63 篇 verification
61 篇 reliability
49 篇 semantics
47 篇 software design
45 篇 domain-specific ...
38 篇 parallel program...
37 篇 concurrency
35 篇 measurement

机构

25 篇 carnegie mellon ...
22 篇 univ washington ...
18 篇 univ penn philad...
17 篇 princeton univ p...
17 篇 stanford univ st...
16 篇 univ texas austi...
15 篇 harvard univ cam...
14 篇 purdue univ w la...
13 篇 microsoft res re...
13 篇 microsoft resear...
13 篇 rice univ housto...
12 篇 univ wisconsin m...
12 篇 mit cambridge ma...
12 篇 cornell univ ith...
12 篇 microsoft res ca...
11 篇 univ michigan an...
11 篇 swiss fed inst t...
11 篇 univ calif berke...
10 篇 microsoft res re...
10 篇 yale univ new ha...

作者

19 篇 hirschfeld rober...
16 篇 walker david
15 篇 visser eelco
15 篇 felleisen matthi...
14 篇 findler robert b...
13 篇 grossman dan
13 篇 bacon david f.
12 篇 chlipala adam
11 篇 flatt matthew
11 篇 sarkar vivek
11 篇 myers andrew c.
11 篇 mezini mira
11 篇 morrisett greg
10 篇 mckinley kathryn...
10 篇 bockisch christo...
10 篇 adl-tabatabai al...
10 篇 van der storm ti...
10 篇 de moor oege
10 篇 dillig isil
9 篇 lumsdaine a

语言

2,348 篇 英文
213 篇 其他
4 篇 中文
1 篇 葡萄牙文

检索条件"任意字段=ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 2566 条记录，以下是2551-2560 订阅

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

详细简洁

排序：

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving design and source code modularity using AspectJ (tutorial session) 00

Improving design and source code modularity using AspectJ (t...

引用

Proceedings of the 22nd international conference on Software engineering

作者： Cristina Videira Lopes Gregor Kiczales Computer Science Laboratory Xerox Palo Alto Research Center 3333 Coyote Hill Rd. Palo Alto CA Department of Computer Science University of British Columbia 201-2366 Main Mall Vancouver BC V6T 1Z4 Canada

ISBN: (纸本)9781581132069

Using only traditional techniques the implementation of concerns like exception handling, multi-object protocols, synchronization constraints, and security policies tends to be spread out in the code. The lack of modularity for these concerns makes them more difficult to develop and maintain. This tutorial shows how to use Aspect-oriented programming (AOP) [2, 3] to implement concerns like these in a concise modular way. We discuss the effect aspects have on software design and on code modularity. The concrete examples in the tutorial use AspectJ [1], a freely available aspect-oriented extension to the Java™ programming language.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A query language for multidimensional arrays: design, implementation, and optimization techniques 96

A query language for multidimensional arrays: design, implem...

引用

Proceedings of the 1996 acm SIGMOD international conference on Management of data

作者： Leonid Libkin Rona Machlin Limsoon Wong Bell Laboratories 600 Mountain Avenue Murray Hill NJ Dept. of Comp. & Info. Science Univ. of Pennsylvania Philadelphia PA Real World Computing Partnership Novel Function Institute of Systems Science Laboratory Heng Mui Keng Terrace Singapore 0511

ISBN: (纸本)9780897917940

While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data organized in (multidimensional) arrays. The scientific computing community has made little use of available database technology. Instead, multidimensional scientific data is typically stored in local files conforming to various data exchange formats and queried via specialized access libraries tied in to general purpose programming *** allow such data to be queried using known database techniques, we design and implement a query language for multidimensional arrays. Our main design decision is to treat arrays as functions from index sets to values rather than as collection types. This leads to clean syntax and semantics as well as simple but powerful optimization *** present a calculus for arrays that extends standard calculi for complex objects. We derive a higher-level comprehension style query language based on this calculus and describe its implementation, including a data driver for the NetCDF data exchange format. Next, we explore some optimization rules obtained from the equational laws of our core calculus. Finally, we study the expressiveness of our calculus and prove that it essentially corresponds to adding ranking to a query language for complex objects.

关键词：

来源：评论

学校读者我要写书评

暂无评论

[email protected]: an implementation of lattice-based array contraction in the source-to-source translator rose 07

[email protected]: an implementation of lattice-based array ...

引用

Proceedings of the 2007 acm sigplan/SIGBED conference on languages, compilers, and tools for embedded systems

作者： Christophe Alias Fabrice Baray Alain Darte LIP: CNRS - ENS Lyon - UCB Lyon - INRIA Lyon France

ISBN: (纸本)9781595936325

We build on prior work on intra-array memory reuse, for which a general theoretical framework was proposed based on lattice theory. Intra-array memory reuse is a way of reducing the size of a temporary array by folding, thanks to affine mappings and modulo operations, reusing memory locations when they contain a value not used later. We describe the algorithms needed to implement such a strategy. Our implementation has two parts. The first part, Bee, uses the source-to-source transformer ROSE to extract from the program all necessary information on the lifetime of array elements and to generate the code after memory reduction. The second part, [email protected], is a stand-alone mathematical tool dedicated to optimizations on polyhedra, in particular the computation of successive minima and the computation of good admissible lattices, which are the basis for lattice-based memory reuse. Both tools are developed in C++ and use linear programming and polyhedra manipulations. They can be used either for embedded program optimizations, e.g., to limit memory expansion introduced for parallelization, or in high-level synthesis, e.g., to design memories between communicating hardware accelerators.

关键词： lattices source-to-source transformations memory reduction program analysis

来源：评论

学校读者我要写书评

暂无评论

High Performance Computing with the Array Package for Java: A Case Study using Data Mining

High Performance Computing with the Array Package for Java: ...

引用

Supercomputing conference

作者： J. Moreira S. Midkiff M. Gupta R. Lawrence IBM Thomas J. Watson Research Center Yorktown Heights NY USA

This paper discusses several techniques used in developing a parallel, production quality data mining application in Java. We started by developing three sequential versions of a product recommendation data mining application: (i) a Fortran 90 version used as a performance reference, (ii) a plain Java implementation that only uses the primitive array structures from the language, and (iii) a baseline Java implementation that uses our Array package for Java. This Array package provides parallelism at the level of individual Array and BLAS operations. Using this Array package, we also developed two parallel Java versions of the data mining application: one that relies entirely on the implicit parallelism provided by the Array package, and another that is explicitly parallel at the application level. We discuss the design of the Array package, as well as the design of the data mining application. We compare the trade-offs between performance and the abstraction level the different Java versions present to the application programmer. Our studies show that, although a plain Java implementation performs poorly, the Java implementation with the Array package is quite competitive in performance with Fortran. We achieve a single processor performance of 109 Mflops, or 91% of Fortran performance, on a 332 MHz PowerPC 604e processor. Both the implicitly and explicitly parallel forms of our Java implementations also parallelize well. On an SMP with four of those PowerPC processors, the implicitly parallel form achieves 290 Mflops with no effort from the application programmer, while the explicitly parallel form achieves 340 Mflops.

关键词： High performance computing Packaging Java Computer aided software engineering Data mining Production Parallel processing programming profession Image processing Computer crime

来源：评论

学校读者我要写书评

暂无评论

An effective garbage collection strategy for parallel programming languages on large scale distributed-memory machines 97

An effective garbage collection strategy for parallel progra...

引用

Proceedings of the sixth acm sigplan symposium on Principles and practice of parallel programming

作者： Kenjiro Taura Akinori Yonezawa Department of Information Science Faculty of Science University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113 Japan

ISBN: (纸本)9780897919067

This paper describes the design and implementation of a garbage collection scheme on large-scale distributed-memory computers and reports various experimental results. The collector is based on the conservative GC library by Boehm & Weiser. Each processor traces local pointers using the GC library while traversing remote pointers by exchanging "mark messages" between processors. It exhibits a promising performance---in the most space-intensive settings we tested, the total collection overhead ranges from 5% up to 15% of the application running time (excluding idle time). We not only examine basic performance figures such as the total overhead or latency of a global collection, but also demonstrate how local collection scheduling strategies affect application performance. In our collector, a local collection is scheduled either independently or synchronously. Experimental results show that the benefit of independent local collections has been overstated in the literature. Independent local collections slowed down application performance to 40%, by increasing the average communication latency. Synchronized local collections exhibit much more robust performance characteristics than independent local collections and the overhead for global synchronization is not significant. Furthermore, we show that an adaptive collection scheduler can select the appropriate local collection strategy based on the application's behavior. The collector has been used in a concurrent object-oriented language ABCL/f and the performance is measured on a large-scale parallel computer (256 processors) using four non-trivial applications written in ABCL/f.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HydroJ: object-oriented pattern matching for evolvable distributed systems 03

HydroJ: object-oriented pattern matching for evolvable distr...

引用

Proceedings of the 18th annual acm sigplan conference on Object-oriented programing, systems, languages, and applications

作者： Keunwoo Lee Anthony LaMarca Craig Chambers University of Washington Intel Research Seattle

ISBN: (纸本)9781581137125

In an evolving software system, components must be able to change independently while remaining compatible with their peers. One obstacle to independent evolution is the brittle parameter problem: the ability of two components to communicate can depend on a number of inessential details of the types, structure, and/or contents of the values communicated. If these details change, then the components can no longer communicate, even if the essential parts of the message remain *** present HydroJ, an extension of Java that addresses this problem. In HydroJ, components communicate using self-describing, semi-structured messages, and programmers use pattern matching to define the handling of messages. This design stems from two central ideas: first, that self-describing messages reduce dependence on inessential message format details; and second, that object-oriented pattern matching naturally focuses on the essential information in a message and is insensitive to inessential *** have developed these ideas in the context of Rain, a distributed, heterogeneous messaging system for ubiquitous computing. To evaluate the design, we have constructed a prototype HydroJ compiler, implemented some Rain services in HydroJ, studied the evolution of an existing Rain service over time, and formalized HydroJ's key features in a core language.

关键词： pattern matching XML HydroJ ubiquitous computing object-oriented programming software evolution dynamic dispatch semi-structured data distributed systems

来源：评论

学校读者我要写书评

暂无评论

Service-Oriented Architecture (SOA) Concepts and implementations 11

Service-Oriented Architecture (SOA) Concepts and Implementat...

引用

acm International conference on Ada and Related Technologies

作者： Ricky E. Sward Jeff Boleng The MITRE Corporation 1155 Academy Park Loop Colorado Springs CO 80910 US Air Force Academy 2354 Fairchild Drive USAF Academy CO 80840

ISBN: (纸本)9781450314008

This tutorial explains how to implement a Service-Oriented Architecture (SOA) for reliable systems using Enterprise Service Bus (ESB) technologies. The first half of the tutorial describes terms of Service-Oriented Architectures (SOA) including service, service registry, service provider, service consumer, Simple Object Access Protocol (SOAP), Representational State Transfer (REST), and Web Service Description language (WSDL). Several examples of REST and SOAP web services are provided using the Ada Web Server (AWS). This tutorial also presents principles of SOA including loose coupling, encapsulation, composibility of web services, and statelessness of web services. The tutorial covers the benefits of SOA and organizations that are supporting SOA infrastructure. The second half of the tutorial covers Enterprise Service Bus (ESB) technologies including definitions, capabilities, benefits and drawbacks. The tutorial discusses the difference between SOA and an ESB, as well as some of the commercially available ESB solutions on the market. The Mule ESB is explored in more detail and several examples are given. Several examples of using an ESB in a SOA application are given using AWS as an Ada implementation. An AWS server is built in the examples and connected to the ESB providing REST and SOAP web services. AWS allows the developer to expose services in a high-integrity system using the Ada and SPARK programming languages. This tutorial is slightly different than the one given at Ada Europe 2008 in that it will focus more on the application of SOA and ESB technology to reliable, high-integrity systems. All tutorial material will be provided to attendees and the opportunity for hands-on participation in examples will be possible.

关键词： algorithms design languages Service-oriented architecture Semiconductor Optical Amplifier ESB Web Service Tutorials ADA (programming language) JAG1 gene Soaps

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共257页 << < 248 249 250 251 252 253 254 255 256 257 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：