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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

24 篇 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 篇 de moor oege
10 篇 dillig isil
9 篇 lumsdaine a
9 篇 van der storm ti...

语言

2,349 篇 英文
222 篇 其他
4 篇 中文
1 篇 葡萄牙文

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

共 2576 条记录，以下是881-890 订阅

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

详细简洁

排序：

AARTS: Low overhead online adaptive auto-tuning 11

AARTS: Low overhead online adaptive auto-tuning

引用

1st acm sigplan International Workshop on Adaptive Self-Tuning Computing Systems for the Exaflop Era, Exadapt 2011 - Co-located with 32nd acm sigplan conference on programming language design and implementation, PLDI 2011 at FCRC 2011

作者： Teodoro, George Sussman, Alan Department of Computer Science University of Maryland College Park MD 20742 United States

ISBN: (纸本)9781450307086

We present an online lightweight auto-tuning system for shared-memory parallel programs. We employ an online adaptive tuning algorithm that is based on performance measurements, to adapt to performance variability that arises during program execution. We address the impact of synchronous vs. asynchronous interactions between the application and the tuning system, and describe an adaptive approach that benefits from the improvements provided by both options. We presented a performance study of the online tuning system, and compared it to synchronous tuning systems. Finally, AARTS is evaluated under different scenarios, showing the potential benefits of using online tuning and the ability of AARTS to exploit those benefits. © 2011 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Pattern matching for object-like structures in the Go programning language

Pattern matching for object-like structures in the Go progra...

引用

6th Workshop on the implementation, Compilation, Optimization of Object-Oriented languages, Programs and Systems, ICOOOLPS 2011 - In Conjunction with the 25th European conference on Object-Oriented programming, ECOOP 2011

作者： Kaewkasi, Chanwit Kaewkasi, Pitchaya School of Computer Engineering Suranaree University of Technology Nakhon Ratchasima Thailand

ISBN: (纸本)9781450308946

This paper explores the feasibility of implementing pattern matching for the Go programming language. The design of pattern matching is taken from Scala, and reimplemented using Go's constructs and new language extensions, namely casestruct and trait. The evaluations show that pattern matching allows expressing decomposition for struct in concise forms. The concepts of casestruct and trait are suggested to add to the Go language in order to make it properly supports pattern matching. However, the performance of the current implementation is still slower than hand-written struct decompositions. The evaluations also suggest that performance penalty of the type embedding feature proposed by Go for inheritance-like relationship is found in the GCCGO implementation, but not in another implementation, namely 8g. © 2011 acm.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

KonohaScript: Static scripting for practical use

KonohaScript: Static scripting for practical use

引用

acm International conference on Systems, programming, languages, and Applications: Software for Humanity, SPLASH'11

作者： Kuramitsu, Kimio JST/CREST/DEOS Project Yokohama National University Japan

ISBN: (纸本)9781450309424

This demonstration presents the language design of Konoha-Script, a statically typed object-oriented scripting language. KonohaScript provides the very similar scripting experiences compared to dynamic languages. In addition, it also preserves useful programming supports by static typing, such as automated verification of careless mistakes, improved readability of source code, better opportunity of optimized code generation. This demonstration will show how KonohaScript improved scripting experiences with static typing, using our open source implementation fully written in C.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Automating String Processing in Spreadsheets Using Input-Output Examples 11

Automating String Processing in Spreadsheets Using Input-Out...

引用

38th Symposium on Principles of programming languages

作者： Gulwani, Sumit Microsoft Res Redmond WA USA

ISBN: (纸本)9781450304900

We describe the design of a string programming/expression language that supports restricted forms of regular expressions, conditionals and loops. The language is expressive enough to represent a wide variety of string manipulation tasks that end-users struggle with. We describe an algorithm based on several novel concepts for synthesizing a desired program in this language from input-output examples. The synthesis algorithm is very efficient taking a fraction of a second for various benchmark examples. The synthesis algorithm is interactive and has several desirable features: it can rank multiple solutions and has fast convergence, it can detect noise in the user input, it supports an active interaction model wherein the user is prompted to provide outputs on inputs that may have multiple computational interpretations. The algorithm has been implemented as an interactive add-in for Microsoft Excel spreadsheet system. The prototype tool has met the golden test it has synthesized part of itself, and has been used to solve problems beyond author's imagination.

关键词： Program Synthesis User Intent programming by Example (PBE) Version Space Algebra Spreadsheet programming String Manipulation

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of the plaid language

Efficient implementation of the plaid language

引用

acm International conference on Systems, programming, languages, and Applications: Software for Humanity, SPLASH'11

作者： Chasins, Sarah Swarthmore College Carnegie Mellon University United States

ISBN: (纸本)9781450309424

The Plaid language introduces native support for state abstractions and state change. While efficient language implementation typically relies on stable object members, state change alters members at runtime. We built a JavaScript compilation target with a novel state representation, which enables fast member access. Cross-language performance comparisons are used for evaluation.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

The tao of parallelism in algorithms 11

引用

32nd acm conference on programming language design and implementation, PLDI 2011

作者： Pingali, Keshav Nguyen, Donald Kulkarni, Milind Burtscher, Martin Hassaan, M. Amber Kaleem, Rashid Lee, Tsung-Hsien Lenharth, Andrew Manevich, Roman Méndez-Lojo, Mario Prountzos, Dimitrios Sui, Xin Department of Computer Science University of Texas Austin TX United States Electrical and Computer Engineering University of Texas Austin TX United States Institute for Computational Engineering and Sciences University of Texas Austin TX United States Department of Computer Science Texas State University San Marcos TX United States School of Electrical and Computer Engineering Purdue University United States

ISBN: (纸本)9781450306638

For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in "regular" algorithms that use dense arrays, such as finite-differences and FFTs. In this paper, we argue that the dependence graph is not a suitable abstraction for algorithms in new application areas like machine learning and network analysis in which the key data structures are "irregular" data structures like graphs, trees, and sets. To address the need for better abstractions, we introduce a data-centric formulation of algorithms called the operator formulation in which an algorithm is expressed in terms of its action on data structures. This formulation is the basis for a structural analysis of algorithms that we call tao-analysis. Tao-analysis can be viewed as an abstraction of algorithms that distills out algorithmic properties important for parallelization. It reveals that a generalized form of data-parallelism called amorphous data-parallelism is ubiquitous in algorithms, and that, depending on the tao-structure of the algorithm, this parallelism may be exploited by compile-time, inspector-executor or optimistic parallelization, thereby unifying these seemingly unrelated parallelization techniques. Regular algorithms emerge as a special case of irregular algorithms, and many application-specific optimization techniques can be generalized to a broader context. These results suggest that the operator formulation and tao-analysis of algorithms can be the foundation of a systematic approach to parallel programming. © 2011 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

language-independent sandboxing of just-in-time compilation and self-modifying code 11

引用

32nd acm conference on programming language design and implementation, PLDI 2011

作者： Ansel, Jason Marchenko, Petr Erlingsson, Ulfar Taylor, Elijah Chen, Brad Schuff, Derek L. Sehr, David Biffle, Cliff L. Yee, Bennet Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology United States University College London United Kingdom Google Inc. United States

ISBN: (纸本)9781450306638

When dealing with dynamic, untrusted content, such as on the Web, software behavior must be sandboxed, typically through use of a language like JavaScript. However, even for such specially-designed languages, it is difficult to ensure the safety of highly-optimized, dynamic language runtimes which, for efficiency, rely on advanced techniques such as Just-In-Time (JIT) compilation, large libraries of native-code support routines, and intricate mechanisms for multi-threading and garbage collection. Each new runtime provides a new potential attack surface and this security risk raises a barrier to the adoption of new languages for creating untrusted content. Removing this limitation, this paper introduces general mechanisms for safely and efficiently sandboxing software, such as dynamic language runtimes, that make use of advanced, low-level techniques like runtime code modification. Our language-independent sandboxing builds on Software-based Fault Isolation (SFI), a traditionally static technique. We provide a more flexible form of SFI by adding new constraints and mechanisms that allow safety to be guaranteed despite runtime code modifications. We have added our extensions to both the x86-32 and x86-64 variants of a production-quality, SFI-based sandboxing platform;on those two architectures SFI mechanisms face different challenges. We have also ported two representative language platforms to our extended sandbox: the Mono common language runtime and the V8 JavaScript engine. In detailed evaluations, we find that sandboxing slowdown varies between different benchmarks, languages, and hardware platforms. Overheads are generally moderate and they are close to zero for some important benchmark/platform combinations. © 2011 acm.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Synchronous programming of Device Drivers for Global Resource Control in Embedded Operating Systems 11

Synchronous Programming of Device Drivers for Global Resourc...

引用

acm sigplan/SIGBED conference on languages Compilers, Tools, and Theory for Embedded Systems (LCTES 2011)

作者： Berthier, Nicolas Maraninchi, Florence Mounier, Laurent UJF Verimag CNRS Verimag Acad Res Lab Rome Italy

ISBN: (纸本)9781450305556

In embedded systems, controlling a shared resource like the bus, or improving a property like power consumption, may be hard to achieve when programming device drivers individually. There is a need for global resource control, taking decisions based on a centralized view of the devices' states. In this paper, we study power consumption in sensor networks, where the nodes are small embedded systems powered by batteries. We concentrate on the hardware/software architecture of a node, where significant gains can be achieved by controlling the consumption modes of the various devices globally. The architecture we propose involves a simple adaptation of the application level, to communicate with the hardware via a control layer. The control layer itself is built from a set of simple automata: the drivers of the devices, whose states correspond to power consumption modes, and a controller that enforces global properties. All these automata are programmed using a synchronous language, whose compiler performs static scheduling and produces a single piece of C code. We explain the approach in details, demonstrate its use with either Contiki or a traditional multithreading operating system, and report on our experiments.

关键词： Synchronous Paradigm Automated Control Power-Aware implementation Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 2011 acm sigplan X10 Workshop, X10 '11

Proceedings of the 2011 ACM SIGPLAN X10 Workshop, X10 '11

引用

2011 acm sigplan X10 Workshop, X10 '11

ISBN: (纸本)9781450307703

The proceedings contain 7 papers. The topics discussed include: a performance model for X10 applications;parallel programming: design of an overview class;compiling X10 to java;using the cowichan problems to investigate the programmability of X10 programming system;X10 implementation of parallel option pricing with BSDE method;distributed deductive databases, declaratively: the L10 logic programming language;X10 on the single-chip cloud computer;and GPU programming in a high level language compiling X10 to CUDA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secure Distributed programming with Value-Dependent Types 11

Secure Distributed Programming with Value-Dependent Types

引用

16th acm sigplan International conference on Functional programming (ICFP 11)

作者： Swamy, Nikhil Chen, Juan Fournet, Cedric Strub, Pierre-Yves Bhargavan, Karthikeyan Yang, Jean Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450308656

Distributed applications are difficult to program reliably and securely. Dependently typed functional languages promise to prevent broad classes of errors and vulnerabilities, and to enable program verification to proceed side-by-side with development. However, as recursion, effects, and rich libraries are added, using types to reason about programs, specifications, and proofs becomes challenging. We present F-star, a full-fledged design and implementation of a new dependently typed language for secure distributed programming. Unlike prior languages, F-star provides arbitrary recursion while maintaining a logically consistent core;it enables modular reasoning about state and other effects using affine types;and it supports proofs of refinement properties using a mixture of cryptographic evidence and logical proof terms. The key mechanism is a new kind system that tracks several sub-languages within F-star and controls their interaction. F-star subsumes two previous languages, F7 and Fine. We prove type soundness (with proofs mechanized in Coq) and logical consistency for F-star. We have implemented a compiler that translates F-star to NET bytecode, based on a prototype for Fine. F-star provides access to libraries for concurrency, networking, cryptography, and interoperability with C#, F#, and the other .NET languages. The compiler produces verifiable binaries with 60% code size overhead for proofs and types, as much as a 45x improvement over the Fine compiler, while still enabling efficient bytecode verification. To date, we have programmed and verified more than 20,000 lines of F-star including (1) new schemes for multi-party sessions;(2) a zero-knowledge privacy-preserving payment protocol;(3) a provenance-aware curated database;(4) a suite of 17 web-browser extensions verified for authorization properties;and (5) a cloud-hosted multi-tier web application with a verified reference monitor.

关键词： Security type systems refinement types

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 85 86 87 88 89 90 91 92 93 94 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：