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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,072 篇 工学
- 1,005 篇 软件工程
- 778 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 36 篇 电气工程
- 32 篇 信息与通信工程
- 12 篇 机械工程
- 10 篇 电子科学与技术（可...
- 6 篇 建筑学
- 6 篇 土木工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 安全科学与工程
- 4 篇 光学工程
- 4 篇 航空宇航科学与技...
- 2 篇 冶金工程
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
138 篇 理学
- 112 篇 数学
- 13 篇 系统科学
- 8 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 物理学
- 5 篇 化学
89 篇 管理学
- 52 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 29 篇 工商管理
17 篇 教育学
- 17 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
1 篇 医学
1 篇 军事学

主题

170 篇 design
157 篇 languages
96 篇 performance
95 篇 computer program...
57 篇 algorithms
49 篇 computer program...
47 篇 object oriented ...
43 篇 experimentation
42 篇 java programming...
39 篇 verification
34 篇 reliability
28 篇 java
28 篇 functional progr...
26 篇 program synthesi...
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 compilers
19 篇 domain-specific ...
19 篇 theory
18 篇 type systems

机构

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 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...
7 篇 northeastern uni...

作者

12 篇 walker david
10 篇 dillig isil
9 篇 shao zhong
9 篇 chlipala adam
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,156 篇 英文
80 篇 其他
1 篇 中文

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

共 1237 条记录，以下是131-140 订阅

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

详细简洁

排序：

Automated Clustering and Program Repair for Introductory programming Assignments 2018

Automated Clustering and Program Repair for Introductory Pro...

引用

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

作者： Gulwani, Sumit Radicek, Ivan Zuleger, Florian Microsoft Corp Redmond WA 98052 USA TU Wien Vienna Austria

ISBN: (纸本)9781450356985

Providing feedback on programming assignments is a tedious task for the instructor, and even impossible in large Massive Open Online Courses with thousands of students. Previous research has suggested that program repair techniques can be used to generate feedback in programming education. In this paper, we present a novel fully automated program repair algorithm for introductory programming assignments. The key idea of the technique, which enables automation and scalability, is to use the existing correct student solutions to repair the incorrect attempts. We evaluate the approach in two experiments: (I) We evaluate the number, size and quality of the generated repairs on 4,293 incorrect student attempts from an existing MOOC. We find that our approach can repair 97% of student attempts, while 81% of those are small repairs of good quality. (II) We conduct a preliminary user study on performance and repair usefulness in an interactive teaching setting. We obtain promising initial results (the average usefulness grade 3.4 on a scale from 1 to 5), and conclude that our approach can be used in an interactive setting.

关键词： programming education MOOC dynamic analysis program repair clustering

来源：评论

学校读者我要写书评

暂无评论

Incremental Inference for Probabilistic Programs 2018

Incremental Inference for Probabilistic Programs

引用

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

作者： Cusumano-Towner, Marco Bichsel, Benjamin Gehr, Timon Vechev, Martin Mansinghka, Vikash K. MIT 77 Massachusetts Ave Cambridge MA 02139 USA Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450356985

We present a novel approach for approximate sampling in probabilistic programs based on incremental inference. The key idea is to adapt the samples for a program P into samples for a program Q, thereby avoiding the expensive sampling computation for program Q. To enable incremental inference in probabilistic programming, our work: (i) introduces the concept of a trace translator which adapts samples from P into samples of Q, (ii) phrases this translation approach in the context of sequential Monte Carlo (SMC), which gives theoretical guarantees that the adapted samples converge to the distribution induced by Q, and (iii) shows how to obtain a concrete trace translator by establishing a correspondence between the random choices of the two probabilistic programs. We implemented our approach in two different probabilistic programming systems and showed that, compared to methods that sample the program Q from scratch, incremental inference can lead to orders of magnitude increase in efficiency, depending on how closely related P and Q are.

关键词： Probabilistic programming sequential Monte Carlo incremental computation

来源：评论

学校读者我要写书评

暂无评论

Spatial: A language and Compiler for Application Accelerators 2018

Spatial: A Language and Compiler for Application Accelerator...

引用

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

作者： Koeplinger, David Feldman, Matthew Prabhakar, Raghu Zhang, Yaqi Hadjis, Stefan Fiszel, Ruben Zhao, Tian Nardi, Luigi Pedram, Ardavan Kozyrakis, Christos Olukotun, Kunle Stanford Univ Stanford CA 94305 USA Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781450356985

Industry is increasingly turning to reconfigurable architectures like FPGAs and CGRAs for improved performance and energy efficiency. Unfortunately, adoption of these architectures has been limited by their programming models. HDLs lack abstractions for productivity and are difficult to target from higher level languages. HLS tools are more productive, but offer an ad-hoc mix of software and hardware abstractions which make performance optimizations difficult. In this work, we describe a new domain-specific language and compiler called Spatial for higher level descriptions of application accelerators. We describe Spatial's hardware-centric abstractions for both programmer productivity and design performance, and summarize the compiler passes required to support these abstractions, including pipeline scheduling, automatic memory banking, and automated design tuning driven by active machine learning. We demonstrate the language's ability to target FPGAs and CGRAs from common source code. We show that applications written in Spatial are, on average, 42% shorter and achieve a mean speedup of 2.9x over SDAccel HLS when targeting a Xilinx UltraScale+ VU9P FPGA on an Amazon EC2 F1 instance.

关键词： domain-specific languages compilers hardware accelerators high-level synthesis reconfigurable architectures FPGAs CGRAs

来源：评论

学校读者我要写书评

暂无评论

Bounded Expectations: Resource Analysis for Probabilistic Programs 2018

Bounded Expectations: Resource Analysis for Probabilistic Pr...

引用

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

作者： Van Chan Ngo Carbonneaux, Quentin Hoffmann, Jan Carnegie Mellon Univ Pittsburgh PA 15213 USA Yale Univ New Haven CT 06520 USA

ISBN: (纸本)9781450356985

This paper presents a new static analysis for deriving upper bounds on the expected resource consumption of probabilistic programs. The analysis is fully automatic and derives symbolic bounds that are multivariate polynomials in the inputs. The new technique combines manual state-of-the-art reasoning techniques for probabilistic programs with an effective method for automatic resource-bound analysis of deterministic programs. It can be seen as both, an extension of automatic amortized resource analysis (AARA) to probabilistic programs and an automation of manual reasoning for probabilistic programs that is based on weakest preconditions. An advantage of the technique is that it combines the clarity and compositionality of a weakest-precondition calculus with the efficient automation of AARA. As a result, bound inference can be reduced to off-the-shelf LP solving in many cases and automatically-derived bounds can be interactively extended with standard program logics if the automation fails. Building on existing work, the soundness of the analysis is proved with respect to an operational semantics that is based on Markov decision processes. The effectiveness of the technique is demonstrated with a prototype implementation that is used to automatically analyze 39 challenging probabilistic programs and randomized algorithms. Experiments indicate that the derived constant factors in the bounds are very precise and even optimal for some programs.

关键词： probabilistic programming resource bound analysis static analysis

来源：评论

学校读者我要写书评

暂无评论

Heartbeat Scheduling: Provable Efficiency for Nested Parallelism 2018

Heartbeat Scheduling: Provable Efficiency for Nested Paralle...

引用

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

作者： Acar, Umut A. Chargueraud, Arthur Guatto, Adrien Rainey, Mike Sieczkowski, Filip Carnegie Mellon Univ Pittsburgh PA 15213 USA INRIA Rocquencourt France Univ Strasbourg ICube Strasbourg France CREST Bloomington IN USA

ISBN: (纸本)9781450356985

A classic problem in parallel computing is to take a high-level parallel program written, for example, in nested-parallel style with fork-join constructs and run it efficiently on a real machine. The problem could be considered solved in theory, but not in practice, because the overheads of creating and managing parallel threads can overwhelm their benefits. Developing efficient parallel codes therefore usually requires extensive tuning and optimizations to reduce parallelism just to a point where the overheads become acceptable. In this paper, we present a scheduling technique that delivers provably efficient results for arbitrary nested-parallel programs, without the tuning needed for controlling parallelism overheads. The basic idea behind our technique is to create threads only at a beat (which we refer to as the "heartbeat") and make sure to do useful work in between. We specify our heartbeat scheduler using an abstract-machine semantics and provide mechanized proofs that the scheduler guarantees low overheads for all nested parallel programs. We present a prototype C++ implementation and an evaluation that shows that Heartbeat competes well with manually optimized Cilk Plus codes, without requiring manual tuning.

关键词： parallel programming languages granularity control

来源：评论

学校读者我要写书评

暂无评论

MixT: A language for Mixing Consistency in Geodistributed Transactions 2018

MixT: A Language for Mixing Consistency in Geodistributed Tr...

引用

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

作者： Milano, Matthew Myers, Andrew C. Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)9781450356985

programming concurrent, distributed systems is hard-especially when these systems mutate shared, persistent state replicated at geographic scale. To enable high availability and scalability, a new class of weakly consistent data stores has become popular. However, some data needs strong consistency. To manipulate both weakly and strongly consistent data in a single transaction, we introduce a new abstraction: mixed-consistency transactions, embodied in a new embedded language, MixT. Programmers explicitly associate consistency models with remote storage sites;each atomic, isolated transaction can access a mixture of data with different consistency models. Compile-time information-flow checking, applied to consistency models, ensures that these models are mixed safely and enables the compiler to automatically partition transactions. New run-time mechanisms ensure that consistency models can also be mixed safely, even when the data used by a transaction resides on separate, mutually unaware stores. Performance measurements show that despite their stronger guarantees, mixed-consistency transactions retain much of the speed of weak consistency, significantly outperforming traditional serializable transactions.

关键词： Consistency Transactions Information Flow

来源：评论

学校读者我要写书评

暂无评论

A General Path-Based Representation for Predicting Program Properties 2018

A General Path-Based Representation for Predicting Program P...

引用

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

作者： Alon, Uri Zilberstein, Meital Levy, Omer Yahav, Eran Technion Haifa Israel Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450356985

Predicting program properties such as names or expression types has a wide range of applications. It can ease the task of programming, and increase programmer productivity. A major challenge when learning from programs is how to represent programs in a way that facilitates effective learning. We present a general path-based representation for learning from programs. Our representation is purely syntactic and extracted automatically. The main idea is to represent a program using paths in its abstract syntax tree (AST). This allows a learning model to leverage the structured nature of code rather than treating it as a flat sequence of tokens. We showthat this representation is general and can: (i) cover different prediction tasks, (ii) drive different learning algorithms (for both generative and discriminative models), and (iii) work across different programming languages. We evaluate our approach on the tasks of predicting variable names, method names, and full types. We use our representation to drive both CRF-based and word2vec-based learning, for programs of four languages: JavaScript, Java, Python and C#. Our evaluation shows that our approach obtains better results than task-specific handcrafted representations across different tasks and programming languages.

关键词： programming languages Big Code Machine Learning Learning Representations

来源：评论

学校读者我要写书评

暂无评论

Persistency for Synchronization-Free Regions 2018

Persistency for Synchronization-Free Regions

引用

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

作者： Gogte, Vaibhav Diestelhorst, Stephan Wang, William Narayanasamy, Satish Chen, Peter M. Wenisch, Thomas F. Univ Michigan Ann Arbor MI 48109 USA Arm Res Cambridge England

ISBN: (纸本)9781450356985

Nascent persistent memory (PM) technologies promise the performance of DRAM with the durability of disk, but how best to integrate them into programming systems remains an open question. Recent work extends language memory models with a persistency model prescribing semantics for updates to PM. These semantics enable programmers to design data structures in PM that are accessed like memory and yet are recoverable upon crash or failure. Alas, we find the semantics and performance of existing approaches unsatisfying. Existing approaches require high-overhead mechanisms, are restricted to certain synchronization constructs, provide incomplete semantics, and/or may recover to state that cannot arise in fault-free execution. We propose persistency semantics that guarantee failure atomicity of synchronization-free regions (SFRs) -program regions delimited by synchronization operations. Our approach provides clear semantics for the PM state recovery code may observe and extends C++11's "sequential consistency for data-race-free" guarantee to post-failure recovery code. We investigate two designs for failure-atomic SFRs that vary in performance and the degree to which commit of persistent state may lag execution. We demonstrate both approaches in LLVM v3.6.0 and compare to a state-of-the-art baseline to show performance improvement up to 87.5% (65.5% avg).

关键词： Persistent memories persistency models language memory models failure-atomicity synchronization-free regions

来源：评论

学校读者我要写书评

暂无评论

To-Many or To-One? All-in-One! Efficient Purely Functional Multi-maps with Type-Heterogeneous Hash-Tries 2018

To-Many or To-One? All-in-One! Efficient Purely Functional M...

引用

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

作者： Steindorfer, Michael J. Vinju, Jurgen J. Delft Univ Technol Delft Netherlands Ctr Wiskunde & Informat Amsterdam Netherlands TU Eindhoven Eindhoven Netherlands

ISBN: (纸本)9781450356985

An immutable multi-map is a many-to-many map data structure with expected fast insert and lookup operations. This data structure is used for applications processing graphs or many-to-many relations as applied in compilers, runtimes of programming languages, or in static analysis of object-oriented systems. Collection data structures are assumed to carefully balance execution time of operations with memory consumption characteristics and need to scale gracefully from a few elements to multiple gigabytes at least. When processing larger in-memory data sets the overhead of the data structure encoding itself becomes a memory usage bottleneck, dominating the overall performance. In this paper we propose AXIOM, a novel hash-trie data structure that allows for a highly efficient and type-safe multi-map encoding by distinguishing inlined values of singleton sets from nested sets of multi-mappings. AXIOM strictly generalizes over previous hash-trie data structures by supporting the processing of fine-grained type-heterogeneous content on the implementation level (while API and language support for type-heterogeneity are not scope of this paper). We detail the design and optimizations of AXIOM and further compare it against state-of-the-art immutable maps and multi-maps in Java, Scala and Clojure. We isolate key differences using microbenchmarks and validate the resulting conclusions on a case study in static analysis. AXIOM reduces the key-value storage overhead by 1.87 x;with specializing and inlining across collection boundaries it improves by 5.1 x.

关键词： Data structures persistent data structures functional programming hashtable multi-map many-to-many relation graph optimization performance JVM

来源：评论

学校读者我要写书评

暂无评论

Symbolic Reasoning for Automatic Signal Placement 2018

Symbolic Reasoning for Automatic Signal Placement

引用

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

作者： Ferles, Kostas Van Geffen, Jacob Dillig, Isil Smaragdakis, Yannis Univ Texas Austin Austin TX 78712 USA Univ Athens Athens Greece

ISBN: (纸本)9781450356985

Explicit signaling between threads is a perennial cause of bugs in concurrent programs. While there are several runtime techniques to automatically notify threads upon the availability of some shared resource, such techniques are not widely-adopted due to their run-time overhead. This paper proposes a new solution based on static analysis for automatically generating a performant explicit-signal program from its corresponding implicit-signal implementation. The key idea is to generate verification conditions that allow us to minimize the number of required signals and unnecessary context switches, while guaranteeing semantic equivalence between the source and target programs. We have implemented our method in a tool called Expresso and evaluate it on challenging benchmarks from prior papers and open-source software. Expresso-generated code significantly outperforms past automatic signaling mechanisms (avg. 1.56x speedup) and closely matches the performance of hand-optimized explicit-signal code.

关键词： Implicit signal monitors concurrent programming symbolic reasoning verification conditions abductive reasoning monitor invariant

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共124页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：