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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

69 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

71 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

59 篇 工学
- 57 篇 软件工程
- 48 篇 计算机科学与技术...
- 4 篇 控制科学与工程
- 3 篇 信息与通信工程
- 1 篇 光学工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 纺织科学与工程
- 1 篇 生物工程
- 1 篇 安全科学与工程
11 篇 理学
- 8 篇 数学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 生物学
- 1 篇 统计学（可授理学、...
7 篇 管理学
- 5 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

5 篇 design
3 篇 program synthesi...
3 篇 languages
3 篇 probabilistic pr...
3 篇 software design
3 篇 java programming...
3 篇 programming by e...
3 篇 programming lang...
2 篇 object oriented ...
2 篇 experimentation
2 篇 performance
2 篇 compilers
2 篇 modules
2 篇 intel ixa
2 篇 parallel program...
2 篇 java
2 篇 register allocat...
2 篇 bank assignment
2 篇 composition
2 篇 end-user program...

机构

3 篇 univ michigan an...
3 篇 carnegie mellon ...
3 篇 univ penn philad...
2 篇 university of to...
2 篇 kyushu institute...
2 篇 kyushu universit...
2 篇 univ chicago il ...
2 篇 univ calif santa...
2 篇 univ texas austi...
1 篇 programming tool...
1 篇 google ca united...
1 篇 univ wisconsin d...
1 篇 univ southern ca...
1 篇 mpi sws saarbruc...
1 篇 univ wisconsin m...
1 篇 radboud univ nij...
1 篇 network speed te...
1 篇 institute for co...
1 篇 university of ma...
1 篇 university of tw...

作者

2 篇 wang xinyu
2 篇 sherwood timothy
2 篇 fursin grigori
2 篇 chong frederic t...
2 篇 alur rajeev
2 篇 hardekopf ben
2 篇 dillig isil
1 篇 milano matthew
1 篇 blinn andrew
1 篇 tao runzhou
1 篇 kashyap vineeth
1 篇 pailoor shankara
1 篇 campagna giovann...
1 篇 fedorova alexand...
1 篇 collins nick
1 篇 sewe andreas
1 篇 lerner sorin
1 篇 best micah j.
1 篇 f.r.m. barnes
1 篇 ekman torbjorn

语言

71 篇 英文

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

共 71 条记录，以下是61-70 订阅

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

详细简洁

排序：

Component-based DSL development

引用

2nd International conference on Generative programming and Component Engineering

作者： Cleenewerck, T Free Univ Brussels Programming Technol Lab B-1050 Brussels Belgium

ISBN: (纸本)3540201025

Domain specific languages (DSLs) have proven to be a very adequate mechanism to encapsulate and hide the complex implementation details of component-based software development. Since evolution lies at the heart of any software system the DSLs that were built around them must evolve as well. In this paper we identify important issues that cause a DSL implementation to be very rigid in which all phases are tightly coupled and highly dependent upon one another. To increase the poor evolvability of current day DSL development environments a new development environment Keyword based programming (KBP) is proposed where DSLs are built by using a language specification to compose and glue loosely coupled and independent language components (called keywords).

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Taming the IXP network processor 03

引用

proceedings of the acm sigplan 2003 conference on programming language design and implementation

作者： Lal George Matthias Blume Network Speed Technologies Inc Toyota Technological Institute at Chicago

ISBN: (纸本)9781581136623

We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal bank assignment, and spills. The compiler's optimizer employs CPS as its intermediate representation; some of the invariants that this IR guarantees are essential for the formulation of a practical ILP *** and George used a similar ILP-based technique for the IA32 to decide which variables reside in registers but deferred the actual assignment of colors to a later phase. We demonstrate how to carry over their idea to an architecture with many more banks, register aggregates, variables with multiple simultaneous register assignments, and, very importantly, one where bank- and register-assignment cannot be done in isolation from each other. Our approach performs well in practise---without causing an explosion in size or solve time of the generated integer linear programs.

关键词： bank assignment network processors integer linear programming programming languages code generation Intel IXA register allocation

来源：评论

学校读者我要写书评

暂无评论

Effective sign extension elimination 02

Effective sign extension elimination

引用

conference on programming language design and implementation (PLDI 02)

作者： Kawahito, M Komatsu, H Nakatani, T IBM Tokyo Res Lab Kanagawa 2428502 Japan

ISBN: (纸本)9781581134636

Computer designs are shifting from 32-bit architectures to 64-bit architectures, while most of the programs available today are still designed for 32-bit architectures, Java(TM), for example, specifies the frequently used "int" as a 32-bit data type. If such Java programs are executed on a 64-bit architecture, many 32-bit values must be sign-extended to 64-bit values for integer operations. This causes serious performance overhead. In this paper, we present a fast and effective algorithm for eliminating sign extensions. We implemented this algorithm in the IBM Java Just-in-Time (JIT) compiler for IA-64(TM). Our experimental results show that our algorithm effectively eliminates the majority of sign extensions, They also show that it significantly improves performance, while it increases JIT compilation time by only 0.11%. We implemented our algorithm for programs in Java, but it can be applied to any language requiring sign extensions.

关键词： algorithms performance design experimentation sign extension 64-bit architectures Java JIT compilers IA-64

来源：评论

学校读者我要写书评

暂无评论

Towards a Discipline of Dynamic programming 32

Towards a Discipline of Dynamic Programming

引用

32. Jahrestagung der Gesellschaft fur Informatik, Informatik bewegt, INFORMATIK 2002 - 32nd Annual conference of the German Informatics Society, Informatics Moves, INFORMATIK 2002

作者： Giegerich, Robert Meyer, Carsten Steffen, Peter Faculty of Technology Bielefeld University Postfach 10 01 31 Bielefeld33501 Germany

ISBN: (纸本)3885793482

Dynamic programming is a classic programming technique, applicable in a wide variety of domains, like stochastic systems analysis, operations research, combinatorics of discrete structures, flow problems, parsing ambiguous languages, or biosequence analysis. Yet, heretofore no methodology was available guiding the design of such algorithms. The matrix recurrences that typically describe a dynamic programming algorithm are difficult to construct, error-prone to implement, and almost impossible to debug. This article introduces an algebraic style of dynamic programming over sequence data. We define its formal framework including a formalization of Bellman's principle. We suggest a language for algorithm design on a convenient level of abstraction. We outline three ways of implementation, including an embedding in a lazy functional language. The workings of the new method are illustrated by a series of examples from diverse areas of computer science. © 2002 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Hancock: A language for processing very large-scale data 99

Hancock: A language for processing very large-scale data

引用

2nd conference on Domain-Specific languages (DSL 99)

作者： Bonachea, D Fisher, K Rogers, A Smith, F AT&T Labs Res Shannon Lab Florham Park NJ 07932 USA

ISBN: (纸本)1880446278

A signature is an evolving customer profile computed from call records. AT&T uses signatures to detect fraud and to target marketing. Code to compute signatures can be difficult to write and maintain because of the volume of data. We have designed and implemented Hancock, a C-based domain-specific programming language for describing signatures. Hancock provides data abstraction mechanisms to manage the volume of data and control abstractions to facilitate looping over records. This paper describes the design and implementation of Hancock, discusses early experiences with the language, and describes our design process.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

A collaboration specification language 99

A collaboration specification language

引用

2nd conference on Domain-Specific languages, DSL 1999

作者： Li, Du Muntz, Richard R. Department of Computer Science University of California Los Angeles Los AngelesCA90024 United States

ISBN: (纸本)1581132557

COCA (Collaborative Objects Coordination Architecture) was proposed as a novel means to model and support collaborations over the Internet. Our approach separates coordination policies from user interfaces and the policies are specified in a logic-based language. Over the past year, both the collaboration model and the specification language have been substantially refined and evaluated through our experience in building real-life collaboration systems. This paper presents the design of the specification language and illustrates the main ideas with a few simple design examples. Semantics, implementation, runtime support, and applications are also covered but not as the focus of this paper.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

DSL implementation using staging and monads 99

DSL implementation using staging and monads

引用

2nd conference on Domain-Specific languages, DSL 1999

作者： Sheard, Tim Benaissa, Zine-El-Abidine Pasalic, Emir Pacific Software Research Center Oregon Graduate Institute P.O. Box 91000 PortlandON97291-1000 United States

ISBN: (纸本)1581132557

The impact of Domain Specific languages (DSLs) on software design is considerable. They allow programs to be more concise than equivalent programs written in a high-level programming languages. They relieve programmers from making decisions about data-structure and algorithm design, and thus allows solutions to be constructed quickly. Because DSL's are at a higher level of abstraction they are easier to maintain and reason about than equivalent programs written in a high-level language, and perhaps most importantly they can be written by domain experts rather than programmers. The problem is that DSL implementation is costly and prone to errors, and that high level approaches to DSL implementation often produce inefficient systems. By using two new programming language mechanisms, program staging and monadic abstraction, we can lower the cost of DSL implementations by allowing reuse at many levels. These mechanisms provide the expressive power that allows the construction of many compiler components as reusable libraries, provide a direct link between the semantics and the low-level implementation, and provide the structure necessary to reason about the implementation.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

2nd JSSST International Symposium on Object Technologies for Advanced Software, ISOTAS 1996

引用

2nd International Symposium on Object Technologies for Advanced Software, ISOTAS 1996

ISBN: (纸本)3540609547

The proceedings contain 19 papers. The special focus in this conference is on design and Evolution. The topics include: Automating the evolution of object-oriented systems;using C++ templates to implement role-based designs;explicit metaclasses as a tool for improving the design of class libraries;towards formally provable object-oriented software;static typing;an efficient scheme to build an object-oriented distributed class library for massively parallel computation;adaptive parameter passing;designing a meta object protocol to wrap a standard graphical toolkit;avoiding confusion in metacircularity;an algebraic semantics of reflective objects;a meme media architecture for fine-grain component software;a metric for evaluating effectiveness of object-oriented interface abstraction for promoting software reuse;an experiment in classification and specialization of synchronization schemes;synergies between object-oriented programming language design and implementation research;integrating persistence into a parallel object-oriented language;a metaobject protocol for controlling file cache management and subtyping by constraints in object-oriented databases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Strongtalk: Typechecking smalltalk in a production environment 8

Strongtalk: Typechecking smalltalk in a production environme...

引用

8th Annual conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 1993

作者： Bracha, Gilad Griswold, David Horizon Technologies of New York Inc. 38 W. 32nd St. New YorkNY10001 United States

ISBN: (纸本)0897915879

Strongtalk™ is a typechecker for a downwardcompatible Smalltalk dialect. It is designed for large-scale production software development, and incorporates a strong, modem structural type system. It not only separates the notions of type and class, but also deals with the more difficult issue of separating inheritance and subtyping using the notion of inherited types [CHC90, Bru93a] to preserve encapsulation. Strongtalk integrates inherited types, metaclasses, blocks and polymorphic methods into a highly usable, full-scale language. © 1993 acm.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Tachyon Common Lisp: An efficient and portable implementation of CLtL2

Tachyon Common Lisp: An efficient and portable implementatio...

引用

proceedings of the 1992 acm conference on Lisp and Functional programming

作者： Nagasaka, Atsushi Shintani, Yoshihiro Ito, Tanji Gomi, Hiroshi Takahashi, Junichi Oki Electric Industry Co Ltd Tokyo Japan

ISBN: (纸本)0897914813

Tachyon Common Lisp is an efficient and portable implementation of Common Lisp 2nd Edition. The design objective of Tachyon is to apply both advanced optimization technology developed for RISC processors and Lisp optimization techniques. The compiler generates very fast codes comparable to, and sometimes faster than the code generated by UNIX C compiler. Comparing with the most widely used commercial Common Lisp, Tachyon Common Lisp compiled code is 2 times faster and the interpreter is 6 times faster than the Lisp in Gabriel benchmark suit. Tachyon Common Lisp is the fastest among the Lisp systems known to the authors.

关键词： LISP (programming language)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：