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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,152 篇 会议
135 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,112 篇 工学
- 1,037 篇 软件工程
- 800 篇 计算机科学与技术...
- 48 篇 控制科学与工程
- 43 篇 电气工程
- 36 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 航空宇航科学与技...
- 5 篇 生物工程
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 农业工程
141 篇 理学
- 117 篇 数学
- 13 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 生物学
- 5 篇 物理学
- 4 篇 化学
89 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 28 篇 工商管理
15 篇 教育学
- 15 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

180 篇 design
167 篇 languages
103 篇 computer program...
99 篇 performance
59 篇 algorithms
49 篇 object oriented ...
49 篇 computer program...
45 篇 experimentation
45 篇 java programming...
39 篇 verification
35 篇 reliability
34 篇 java
32 篇 functional progr...
26 篇 program synthesi...
24 篇 probabilistic pr...
22 篇 software design
21 篇 theory
20 篇 concurrency
19 篇 domain-specific ...
18 篇 type systems

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
12 篇 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 篇 microsoft res re...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
9 篇 microsoft resear...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...

作者

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 篇 rajan hridesh
6 篇 foster nate
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,205 篇 英文
81 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM Sigplan 2003 Conference on Programming Language Design and Implementation"

共 1287 条记录，以下是561-570 订阅

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

详细简洁

排序：

Hope: An experimental applicative language 80

Hope: An experimental applicative language

引用

1980 acm conference on LISP and Functional programming, LFP 1980

作者： Burstall, R.M. MacQueen, D.B. Sannella, D.T. Department of Computer Science University of Edinburgh Edinburgh United Kingdom USC Information Sciences Institute Marina del ReyCA United States

ISBN: (纸本)9781450373968

An applicative language called HOPE is described and discussed. The underlying goal of the design and implementation effort was to produce a very simple programming language which encourages the construction of clear and manipulable programs. HOPE does not include an assignment statement;this is felt to be an important simplification. The user may freely define his own data types, without the need to devise a complicated encoding in terms of low-level types. The language is very strongly typed, and as implemented it incorporates a typechecker which handles polymorphic types and overloaded operators. Functions are defined by a set of recursion equations;the left-hand side of each equation includes a pattern used to determine which equation to use for a given argument. The availability of arbitrary higher-order types allows functions to be defined which 'package' recursion. Lazily-evaluated lists are provided, allowing the use of infinite lists which could be used to provide interactive input/output and concurrency. HOPE also includes a simple modularisation facility which may be used to protect the implementation of an abstract data type. © proceedings of the 1980 acm conference on LISP and Functional programming, LFP 1980. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient control flow quantification 06

Efficient control flow quantification

引用

21st Annual acm sigplan conference on Object-oriented programming Systems, languages, and Applications, OOPSLA 2006

作者： Bockisch, Christoph Kanthak, Sebastian Haupt, Michael Arnold, Matthew Mezini, Mira Software Technology Group Darmstadt University of Technology Germany Software Architecture Research Group Hasso Plattner Institute for Software Systems Engineering Potsdam Germany IBM T. J.Watson Research Center Yorktown Heights NY United States

ISBN: (纸本)1595933484

Aspect-oriented programming (AOP) is increasingly gaining in popularity. However, the focus of aspect-oriented language research has been mostly on language design issues;efficient implementation techniques have been less popular. As a result, the performance of certain AOP constructs is still poor. This is in particular true for constructs that rely on dynamic properties of the execution (e.g., the cflow construct).In this paper, we present efficient implementation techniques for cflow that exploit direct access to internal structures of the virtual machine running an application, such as the call stack, as well as the integration of these techniques into the just-in-time compiler code generation *** results show that AOP has the potential to make programs that need to define control flow-dependent behavior not only more modular but also more efficient. By making means for control flow-dependent behavior part of the language, AOP opens the possibility of applying sophisticated compiler optimizations that are out of reach for application programmers. Copyright © 2006 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

GPCE 2016 - proceedings of the 2016 acm sigplan International conference on Generative programming: Concepts and Experiences, co-located with SPLASH 2016

GPCE 2016 - Proceedings of the 2016 ACM SIGPLAN Internationa...

引用

15th acm sigplan International conference on Generative programming: Concepts and Experiences, GPCE 2016

ISBN: (纸本)9781450344463

The proceedings contain 20 papers. The topics discussed include: Recaf: Java dialects as libraries;classless Java;extensible modeling with managed data in Java;actor profiling in virtual execution environments;bootstrapping domain-specific meta-languages in language workbenches;dependence-driven delimited CPS transformation for JavaScript;synthesizing regular expressions from examples for introductory automata assignments;programmable semantic fragments: the design and implementation of typy;delaying decisions in variable concern hierarchies;automatic code generation in practice: experiences with embedded robot controllers;a change-centric approach to compile configurable systems with #ifdefs;a feature-based personalized recommender system for product-line configuration;IncLing: efficient product-line testing using incremental pairwise sampling;towards a software product line of trie-based collections;tool demo: testing configurable systems with FeatureIDE;automated regression testing of BPMN 2.0 processes: a capture and replay framework for continuous delivery;a vision for online verification-validation;and automatic non-functional testing of code generators families.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Shangri-La: Achieving high performance from compiled network applications while enabling ease of programming

Shangri-La: Achieving high performance from compiled network...

引用

2005 acm sigplan conference on programming language design and implementation, PLDI 05

作者： Chen, Michael K. Li, Xiao Feng Lian, Ruiqi Lin, Jason H. Liu, Lixia Liu, Tao Ju, Roy Microprocessor Technology Labs. Intel Corporation Santa Clara CA United States Intel China Research Center Ltd. Beijing China Institute of Computing Technology China Academy of Sciences Beijing China

programming network processors is challenging. To sustain high line rates, network processors have extremely tight memory access and instruction budgets. Achieving desired performance has traditionally required hand-coded assembly. Researchers have recently proposed high-level programming languages for packet processing, but the challenges of compiling these languages into code that is competitive with hand-tuned assembly remain unanswered. This paper describes the Shangri-La compiler, which accepts a packet program written in a C-like high-level language and applies scalar and specialized optimizations to generate a highly optimized binary. Hot code paths identified by profiling are mapped across processing elements to maximize processor utilization. Since our compilation target has no hardware caches, software-controlled caches are generated for frequently accessed application data structures. Packet handling optimizations significantly reduce perpacket memory access and instruction counts. Finally, a custom stack model maps stack frames to the fastest levels of the target processor's heterogeneous memory hierarchy. Binaries generated by the compiler were evaluated on the Intel 1XP2400 network processor with eight packet processing cores and eight threads per core. Our results show the importance of both traditional and specialized optimization techniques for achieving the maximum forwarding rates on three network applications, L3-Switch, MPLS and Firewall. Copyright 2005 acm.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Green-Marl: A DSL for Easy and Efficient Graph Analysis

Green-Marl: A DSL for Easy and Efficient Graph Analysis

引用

17th International conference on Architectural Support for programming languages and Operating Systems

作者： Hong, Sungpack Chafi, Hassan Sedlar, Eric Olukotun, Kunle Stanford Univ Pervas Parallelism Lab Stanford CA 94305 USA

ISBN: (纸本)9781450307598

The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level language constructs allow developers to describe their graph analysis algorithms intuitively, but expose the data-level parallelism inherent in the algorithms. We also present our Green-Marl compiler which translates high-level algorithmic description written in Green-Marl into an efficient C++ implementation by exploiting this exposed data-level parallelism. Furthermore, our Green-Marl compiler applies a set of optimizations that take advantage of the high-level semantic knowledge encoded in the Green-Marl DSL. We demonstrate that graph analysis algorithms can be written very intuitively with Green-Marl through some examples, and our experimental results show that the compiler-generated implementation out of such descriptions performs as well as or better than highly-tuned handcoded implementations.

关键词： Algorithms design Performance Graph Domain-Specific language Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Parsek: Object oriented particle-in-cell implementation and performance issues 02

Parsek: Object oriented particle-in-cell implementation and ...

引用

proceedings of the Joint acm Java Grande - ISCOPE 2002 conference

作者： Markidis, Stefano Lapenta, G. VanderHeyden, W.B. Politecnico di Torino Corso Duca degli Abruzzi 24 10129 Torino Italy Theoretical Division MS: K717 LANL Los Alamos NM 87545 United States Theoretical Division MS: B216 LANL Los Alamos NM 87545 United States

ISBN: (纸本)9781581135992

Previous plasma simulations have used Fortran or other computer languages in which it is difficult to directly express the underlying physics. In a plasma, each particle - electron, ion, or dust - interacts with the external fields and with other particles in ways that can be readily and effectively mimicked by object oriented programming. Thus, we have used JAVA's strong object design to rewrite traditional plasma simulation codes. By using coarse grain and fine grain object design, we incorporate the power of object oriented design for programming and for making the physics clear while paying only a small cost in increased computational time. The JAVA implementation has also the advantage that changes in the underlying physical model can be easily completed swapping or adding objects without large scale revisions of the code.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

An end-to-end domain-driven software development framework

An end-to-end domain-driven software development framework

引用

18th Annual acm sigplan conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA'03

作者： Agrawal, Aditya Karsai, Gabor Ledeczi, Akos Institute for Software Integrated Systems Vanderbilt University Nashville TN 37235 United States

ISBN: (纸本)1581137516

This paper presents a comprehensive, domain-driven framework for software development. It consists of a meta-programmable domain specific modeling environment and a model transformation generator toolset based on graph transformations. The framework allows the creation of custom, domain-oriented programming environments that support end-user programmability. In addition, the framework could be considered an early, end-to-end implementation of the concepts advocated by the OMG's Model Driven Architecture initiative.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Surgical Precision JIT Compilers 14

Surgical Precision JIT Compilers

引用

35th acm sigplan conference on programming language design and implementation (PLDI)

作者： Rompf, Tiark Sujeeth, Arvind K. Brown, Kevin J. Lee, HyoukJoong Chafi, Hassan Olukotun, Kunle EPFL Zurich Switzerland Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450327848

Just-in-time (JIT) compilation of running programs provides more optimization opportunities than offline compilation. Modern JIT compilers, such as those in virtual machines like Oracle's HotSpot for Java or Google's V8 for JavaScript, rely on dynamic profiling as their key mechanism to guide optimizations. While these JIT compilers offer good average performance, their behavior is a black box and the achieved performance is highly unpredictable. In this paper, we propose to turn JIT compilation into a precision tool by adding two essential and generic metaprogramming facilities: First, allow programs to invoke JIT compilation explicitly. This enables controlled specialization of arbitrary code at run-time, in the style of partial evaluation. It also enables the JIT compiler to report warnings and errors to the program when it is unable to compile a code path in the demanded way. Second, allow the JIT compiler to call back into the program to perform compile-time computation. This lets the program itself define the translation strategy for certain constructs on the fly and gives rise to a powerful JIT macro facility that enables "smart" libraries to supply domain-specific compiler optimizations or safety checks. We present Lancet, a JIT compiler framework for Java bytecode that enables such a tight, two-way integration with the running program. Lancet itself was derived from a high-level Java bytecode interpreter: staging the interpreter using LMS (Lightweight Modular Staging) produced a simple bytecode compiler. Adding abstract interpretation turned the simple compiler into an optimizing compiler. This fact provides compelling evidence for the scalability of the staged-interpreter approach to compiler construction. In the case of Lancet, JIT macros also provide a natural interface to existing LMS-based toolchains such as the Delite parallelism and DSL framework, which can now serve as accelerator macros for arbitrary JVM bytecode.

关键词： design languages Performance JIT Compilation Staging Program Generation

来源：评论

学校读者我要写书评

暂无评论

Cross-language, Type-Safe, and Transparent Object Sharing For Co-Located Managed Runtimes 10

Cross-Language, Type-Safe, and Transparent Object Sharing Fo...

引用

conference on Object Oriented programming Systems, languages and Applications/SPLASH 2010

作者： Wegiel, Michal Krintz, Chandra Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9781450302036

As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming languages and to architect systems that comprise multiple components. Different components are often implemented in different programming languages. In state-of-the-art multicomponent, multi-language systems, cross-component communication relies on remote procedure calls (RPC) and message passing. As components are increasingly co-located on the same physical machine to ensure high utilization of multi-core systems, there is a growing potential for using shared memory for cross-language cross-runtime communication. We present the design and implementation of Co-Located Runtime Sharing (CoLoRS), a system that enables cross-language, cross-runtime type-safe, transparent shared memory. CoLoRS provides object sharing for co-located OO runtimes for both static and dynamic languages. CoLoRS defines a language-neutral object/class model, which is a static-dynamic hybrid and enables class evolution while maintaining the space/time efficiency of a static model. CoLoRS uses type mapping and class versioning to transparently map shared types to private types. CoLoRS also contributes a synchronization mechanism and a parallel, concurrent, on-thefly GC algorithm, both designed to facilitate cross-language cross-runtime object sharing. We implement CoLoRS in open-source, production-quality runtimes for Python and Java. Our empirical evaluation shows that CoLoRS extensions impose low overhead. We also investigate RPC over CoLoRS and find that using shared memory to implement co-located RPC significantly improves both communication throughput and latency by avoiding data structure serialization.

关键词： design languages Management Measurement Performance

来源：评论

学校读者我要写书评

暂无评论

A comparison of empirical and model-driven optimization 03

引用

acm sigplan conference on programming language design and implementation

作者： K., Yotov X., Li G., Ren M., Cibulskis G., DeJong M., Garzaran D., Padua K., Pingali P., Stodghill P., Wu Univ. Illinois at Urbana-Champaign Urbana-Champaign IL United States IBM T.J. Watson Research Center Yorktown Heights NY United States

ISBN: (纸本)9781581136623

Empirical program optimizers estimate the values of key optimization parameters by generating different program versions and running them on the actual hardware to determine which values give the best performance. In contrast, conventional compilers use models of programs and machines to choose these parameters. It is widely believed that model-driven optimization does not compete with empirical optimization, but few quantitative comparisons have been done to date. To make such a comparison, we replaced the empirical optimization engine in ATLAS (a system for generating a dense numerical linear algebra library called the BLAS) with a model-driven optimization engine that used detailed models to estimate values for optimization parameters, and then measured the relative performance of the two systems on three different hardware platforms. Our experiments show that model-driven optimization can be surprisingly effective, and can generate code whose performance is comparable to that of code generated by empirical optimizers for the BLAS.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共129页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：