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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

256 篇 会议
26 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

225 篇 工学
- 215 篇 软件工程
- 164 篇 计算机科学与技术...
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 材料科学与工程（可...
- 1 篇 电气工程
41 篇 理学
- 38 篇 数学
- 4 篇 系统科学
- 3 篇 统计学（可授理学、...
13 篇 管理学
- 7 篇 图书情报与档案管...
- 6 篇 管理科学与工程(可...
- 4 篇 工商管理
1 篇 经济学
- 1 篇 应用经济学

主题

83 篇 languages
43 篇 performance
29 篇 computer program...
24 篇 algorithms
24 篇 verification
23 篇 design
19 篇 theory
18 篇 parallel program...
10 篇 functional progr...
8 篇 logic programmin...
7 篇 experimentation
7 篇 semantics
6 篇 reliability
6 篇 mpi
6 篇 dependent types
6 篇 transactional me...
5 篇 abstract interpr...
4 篇 object oriented ...
4 篇 static analysis
4 篇 atomicity

机构

4 篇 carnegie mellon ...
3 篇 univ texas austi...
3 篇 univ of tokyo
3 篇 tohoku univ send...
3 篇 imdea software i...
3 篇 microsoft resear...
3 篇 univ texas austi...
2 篇 epfl
2 篇 univ wisconsin d...
2 篇 univ wisconsin m...
2 篇 xerox parc
2 篇 univ illinois ur...
2 篇 department of co...
2 篇 swiss fed inst t...
2 篇 univ lugano usi ...
2 篇 natl inst inform...
2 篇 mcgill univ mont...
2 篇 northeastern uni...
2 篇 univ calif santa...
2 篇 microsoft resear...

作者

4 篇 pingali keshav
4 篇 burtscher martin
3 篇 taura kenjiro
3 篇 yonezawa akinori
3 篇 flanagan cormac
3 篇 walker david
3 篇 abadi martin
3 篇 kobayashi naoki
2 篇 hoefler torsten
2 篇 saraswat vijay
2 篇 wand mitchell
2 篇 huelsbergen lore...
2 篇 grossman dan
2 篇 stulova nataliia
2 篇 palsberg jens
2 篇 donaldson alasta...
2 篇 yoshida nobuko
2 篇 kim jungwon
2 篇 gay simon j.
2 篇 welc adam

语言

282 篇 英文
2 篇 其他

检索条件"任意字段=Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"

共 284 条记录，以下是41-50 订阅

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

详细简洁

排序：

POPL 2013 - proceedings of 40th Annual acm sigplan-SIGACT symposium on principles of programming languages

POPL 2013 - Proceedings of 40th Annual ACM SIGPLAN-SIGACT Sy...

引用

40th Annual acm sigplan-SIGACT symposium on principles of programming languages, POPL 2013

ISBN: (纸本)9781450318327

the proceedings contain 47 papers. the topics discussed include: full abstraction for nominal Scott domains;copatterns: programming infinite structures by observations;on the linear ranking problem for integer linear-constraint loops;automating relatively complete verification of higher-order functional programs;abstraction and invariance for algebraically indexed types;static and dynamic semantics of NoSQL languages;quantitative abstraction refinement;the lambda lambda-bar calculus: a dual calculus for unconstrained strategies;universal properties of impure programming languages;the power of parameterization in coinductive proof;deadlock-freedom-by-design: multiparty asynchronous global programming;the type discipline of behavioral separation;views: compositional reasoning for concurrent programs;quantitative relaxation of concurrent data structures;and towards fully automatic placement of security sanitizers and declassifiers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A library for portable and composable data locality optimizations for NUMA systems 2015

A library for portable and composable data locality optimiza...

引用

20th acm sigplan symposium on principles and Practice of Parallel programming, PPoPP 2015

作者： Majo, Zoltan Gross, thomas R. Department of Computer Science ETH Zurich Switzerland

ISBN: (纸本)9781450332057

Many recent multiprocessor systems are realized with a nonuniform memory architecture (NUMA) and accesses to remote memory locations take more time than local memory accesses. Optimizing NUMA memory system performance is difficult and costly for three principal reasons: (1) today's programming languages/libraries have no explicit support for NUMA systems, (2) NUMA optimizations are not portable, and (3) optimizations are not composable (i.e., they can become ineffective or worsen performance in environments that support composable parallel software). this paper presents TBB-NUMA, a parallel programming library based on Intel threading Building Blocks (TBB) that supports portable and composable NUMA-aware programming. TBB-NUMA provides a model of task affinity that captures a programmer's insights on mapping tasks to resources. NUMA-awareness affects all layers of the library (i.e., resource management, task scheduling, and high-level parallel algorithm templates) and requires close coupling between all these layers. Optimizations implemented with TBB-NUMA (for a set of standard benchmark programs) result in up to 44% performance improvement over standard TBB, but more important, optimized programs are portable across different NUMA architectures and preserve data locality also when composed with other parallel computations. Copyright 2015 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

proceedings of the acm sigplan symposium on principles and Practice of Parallel programming, PPOPP

Proceedings of the ACM SIGPLAN Symposium on Principles and P...

引用

20th acm sigplan symposium on principles and Practice of Parallel programming, PPoPP 2015

ISBN: (纸本)9781450332057

the proceedings contain 44 papers. the topics discussed include: predicate RCU: an RCU for scalable concurrent updates;automatic scalable atomicity via semantic locking;a framework for practical parallel fast matrix multiplication;PLUTO+: near-complete modeling of affine transformations for parallelism and locality;distributed memory code generation for mixed irregular/regular computations;performance implications of dynamic memory allocators on transactional memory systems;low-overhead software transactional memory with progress guarantees and strong semantics∗;barrier elision for production parallel programs;scalable and efficient implementation of 3D unstructured meshes computation: a case study on matrix assembly;and diagnosing the causes and severity of one-sided message contention.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PPoPP 2014 - proceedings of the 2014 acm sigplan symposium on principles and Practice of Parallel programming

PPoPP 2014 - Proceedings of the 2014 ACM SIGPLAN Symposium o...

引用

2014 19th acm sigplan symposium on principles and Practice of Parallel programming, PPoPP 2014

ISBN: (纸本)9781450326568

the proceedings contain 43 papers. the topics discussed include: predator: predictive false sharing detection;concurrency testing using schedule bounding: an empirical study;trace driven dynamic deadlock detection and reproduction;efficient search for inputs causing high floating-point errors;portable, MPI-interoperable coarray Fortran;eliminating global interpreter locks in ruby through hardware transactional memory;leveraging hardware message passing for efficient thread synchronization;well-structured futures and cache locality;time-warp: lightweight abort minimization in transactional memory;beyond parallel programming with domain specific languages;a decomposition for in-place matrix transposition;in-place transposition of rectangular matrices on accelerators;and parallelizing dynamic programming through rank convergence.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

On Combining Backward and Forward Chaining in Constraint Logic programming 14

On Combining Backward and Forward Chaining in Constraint Log...

引用

16th International symposium on principles and Practice of Declarative programming (PPDP)

作者： Haemmerle, Remy Univ Politecn Madrid Madrid Spain IMDEA Software Inst Madrid Spain

ISBN: (纸本)9781450329477

We address the problem of designing constraint logic languages that usefully combine backward and forward chaining in a sound and complete way. Following the approach of Constraint Logic programming, we define a class of programming languages that generalize both Constraint Logic and Concurrent Constraint programming. Syntactically, this class corresponds to Constraint Handling Rules with disjunctions, but differ operationally by featuring set-based semantics instead of multiset-based ones;i. e., conjunction and disjunction are idempotent. the assumption of program confluence is the crux on which both the committed choice strategy and the logical completeness of the languages rely.

关键词： CLP backward&forward chaining CHR confluence

来源：评论

学校读者我要写书评

暂无评论

POPL'12 - proceedings of the 39th Annual acm sigplan-SIGACT symposium on principles of programming languages

POPL'12 - Proceedings of the 39th Annual ACM SIGPLAN-SIGACT ...

引用

39th Annual acm sigplan-SIGACT symposium on principles of programming languages, POPL'12

ISBN: (纸本)9781450310833

the proceedings contain 44 papers. the topics discussed include: underspecified harnesses and interleaved bugs;towards a program logic for JavaScript;higher-order functional reactive programming in bounded space;the marriage of bisimulations and Kripke logical relations;information effects;a language for automatically enforcing privacy policies;probabilistic relational reasoning for differential privacy;access permission contracts for scripting languages;recursive proofs for inductive tree data-structures;symbolic finite state transducers: algorithms and applications;multiple facets for dynamic information flow;deciding choreography realizability;programming languages for programmable networks;a compiler and run-time system for network programming languages;an abstract interpretation framework for termination;run your research: on the effectiveness of lightweight mechanization;and verification of parameterized concurrent programs by modular reasoning about data and control.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parametricity and Proving Free theorems for Functional-Logic languages 14

Parametricity and Proving Free Theorems for Functional-Logic...

引用

16th International symposium on principles and Practice of Declarative programming (PPDP)

作者： Mehner, Stefan Seidel, Daniel Strassburger, Lutz Voigtlaender, Janis Univ Bonn Inst Informat Bonn Germany Ecole Polytech INRIA Palaiseau France Ecole Polytech LIX Palaiseau France

ISBN: (纸本)9781450329477

the goal of this paper is to provide the required foundations for establishing free theorems statements about program equivalence, guaranteed by polymorphic types for the functional-logic programming language Curry. For the sake of presentation we restrict ourselves to a language fragment that we call CuMin, and that has the characteristic features of Curry (both functional and logic). We present a new denotational semantics based on partially ordered sets without limits. We then introduce an intermediate language called SaLT that is essentially a lambda-calculus extended with an abstract set type, and again give a denotational semantics. We show that the standard (logical relations) techniques can be applied to obtain a general parametricity theorem for SaLT and derive free theorems from it. Via a translation from CuMin to SaLT that fits the respective semantics, we then derive free theorems for CuMin.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Structure-Preserving Compilation: Efficient Integration of Functional DSLs into Legacy Systems 14

Structure-Preserving Compilation: Efficient Integration of F...

引用

16th International symposium on principles and Practice of Declarative programming (PPDP)

作者： Kranz, Julian Simon, Axel Tech Univ Munich Inst Informat 2 Garching Germany

ISBN: (纸本)9781450329477

We present a translation scheme from a pure functional domain-specific language (DSL) to C. the over-arching idea of this scheme is to preserve the structure of the input program as much as possible. this includes, among other things, to refrain from inlining user-written functions and to retain variable names as much as possible. We apply this translation scheme to GDSL, a DSL used for the specification of decoders for machine instructions. GDSL offers non-trivial language features such as monadic actions that our translation scheme maps one-to-one to C statements, resulting in code that closely resembles hand-written C code. Indeed, it is feasible to debug and profile the program at the C level and to interface the generated code with existing C code without marshaling data. Our translation scheme is therefore an attractive starting point for a light-weight DSL since no other language-specific tools besides the compiler are necessary. Moreover, the generated code is amenable to compiler optimizations found in off-the-shelf C compilers. this is illustrated by the performance achieved by a decoder for x86 machine instructions implemented in GDSL which is as fast as a production-quality decoding library shipped by Intel.

关键词： Domain specific languages translation scheme interfacing between programming languages code optimization functional languages type inference instruction decoding

来源：评论

学校读者我要写书评

暂无评论

BiFluX: A Bidirectional Functional Update Language for XML 14

BiFluX: A Bidirectional Functional Update Language for XML

引用

16th International symposium on principles and Practice of Declarative programming (PPDP)

作者： Pacheco, Hugo Zan, Tao Hu, Zhenjiang Cornell Univ Ithaca NY 14853 USA Grad Univ Adv Studies Hayama Kanagawa Japan Natl Inst Informat Tokyo Japan

ISBN: (纸本)9781450329477

Different XML formats are widely used for data exchange and processing, being often necessary to mutually convert between them. Standard XML transformation languages, like XSLT or XQuery, are unsatisfactory for this purpose since they require writing a separate transformation for each direction. Existing bidirectional transformation languages mean to cover this gap, by allowing programmers to write a single program that denotes both transformations. However, they often 1) induce a more cumbersome programming style than their traditionally unidirectional relatives, to establish the link between source and target formats, and 2) offer limited configurability, by making implicit assumptions about how modifications to both formats should be translated that may not be easy to predict. this paper proposes a bidirectional XML update language called BIFLUX (BIdirectional FunctionaL Updates for XML), inspired by the FLUX XML update language. Our language adopts a novel bidirectional programming by update paradigm, where a program succinctly and precisely describes how to update a source document with a target document, in an intuitive way, such that there is a unique " inverse" source query for each update program. BIFLUX extends FLUX with bidirectional actions that describe the connection between source and target formats. We introduce a core BIFLUX language, with a clear and well-behaved bidirectional semantics and a decidable static type system based on regular expression types.

关键词： XML bidirectional programming update languages

来源：评论

学校读者我要写书评

暂无评论

Resilient X10: Efficient failure-aware programming 14

Resilient X10: Efficient failure-aware programming

引用

2014 19th acm sigplan symposium on principles and Practice of Parallel programming, PPoPP 2014

作者： Cunningham, David Grove, David Herta, Benjamin Iyengar, Arun Kawachiya, Kiyokuni Murata, Hiroki Saraswat, Vijay Takeuchi, Mikio Tardieu, Olivier IBM T. J. Watson Research Center Japan Google Inc. Japan IBM Research Tokyo Japan

ISBN: (纸本)9781450326568

Scale-out programs run on multiple processes in a cluster. In scale-out systems, processes can fail. Computations using traditional libraries such as MPI fail when any component process fails. the advent of Map Reduce, Resilient Data Sets and MillWheel has shown dramatic improvements in productivity are possible when a high-level programming framework handles scale-out and resilience automatically. We are concerned with the development of generalpurpose languages that support resilient programming. In this paper we show how the X10 language and implementation can be extended to support resilience. In Resilient X10, places may fail asynchronously, causing loss of the data and tasks at the failed place. Failure is exposed through exceptions. We identify a Happens Before Invariance Principle and require the runtime to automatically repair the global control structure of the program to maintain this principle. We show this reduces much of the burden of resilient programming. the programmer is only responsible for continuing execution with fewer computational resources and the loss of part of the heap, and can do so while taking advantage of domain knowledge. We build a complete implementation of the language, capable of executing benchmark applications on hundreds of nodes. We describe the algorithms required to make the language runtime resilient. We then give three applications, each with a different approach to fault tolerance (replay, decimation, and domain-level checkpointing). these can be executed at scale and survive node failure. We show that for these programs the overhead of resilience is a small fraction of overall runtime by comparing to equivalent non-resilient X10 programs. On one program we show end-to-end performance of Resilient X10 is ∼100x faster than Hadoop. Copyright © 2014 acm.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：