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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,280 篇 工学
- 2,149 篇 软件工程
- 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
187 篇 computer program...
182 篇 performance
162 篇 object oriented ...
89 篇 algorithms
88 篇 java programming...
81 篇 experimentation
78 篇 functional progr...
71 篇 computer program...
71 篇 theory
65 篇 java
63 篇 verification
61 篇 reliability
48 篇 semantics
47 篇 software design
45 篇 domain-specific ...
38 篇 parallel program...
37 篇 concurrency
35 篇 measurement

机构

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

语言

2,354 篇 英文
216 篇 其他
4 篇 中文
1 篇 葡萄牙文

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

共 2575 条记录，以下是691-700 订阅

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

详细简洁

排序：

QuaFL: A typed DSL for quantum programming

QuaFL: A typed DSL for quantum programming

引用

2013 1st acm sigplan Workshop on Functional programming Concepts in Domain-Specific languages, FPCDSL 2013 - Co-located with the 18th acm sigplan International conference on Functional programming, ICFP 2013

作者： Lapets, Andrei Da Silva, Marcus P. Thome, Mike Adler, Aaron Beal, Jacob Rötteler, Martin Raytheon BBN Technologies 10 Moulton Street Cambridge MA 02138 United States NEC Laboratories America 4 Independence Way Princeton NJ 08540 United States

ISBN: (纸本)9781450323802

Quantum computers represent a novel kind of programmable hardware with properties and restrictions that are distinct from those of classical *** investigate how some existing abstractions and programming language features developed within the programming languages community can be adapted to expose the unique capabilities of quantum computers to programmers while at the same time allowing them to manage the new and unfamiliar constraints of programming a quantum device. We introduce QuaFL, a statically typed domain-specific programming language for writing high-level definitions of algorithms that can be compiled into logical quantum circuits. The primary purpose of QuaFL is to support programmers in defining high-level yet physically realizable quantum algorithms and in helping them make informed decisions about implementation trade-offs. QuaFL allows programmers to use high-level data structures including integers, fixed point reals, and arrays within quantum algorithms, and to explicitly define superpositions and unitary transformations on data. The QuaFL type system allows programmers to distinguish between classical and quantum portions of a program, uses a variant of linear types and an orthogonality checking algorithm to ensure the quantum portions are physically realizable, and provides type size annotations that can facilitate automated computation of the quantities of quantum resources that will be necessary to run the compiled program (i.e., a logical quantum circuit). © 2013 by the Association for Computing Machinery, Inc. (acm).

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

Towards a functional run-time for dense NLA domain

Towards a functional run-time for dense NLA domain

引用

2nd acm sigplan Workshop on Functional High-Performance Computing, FHPC 2013 - Co-located with the 18th acm sigplan International conference on Functional programming, ICFP 2013

作者： Blanco, Mauro Perdomo, Pablo Ezzatti, Pablo Pardo, Alberto Viera, Marcos Instituto de Computación Universidad de la República Montevideo Uruguay

ISBN: (纸本)9781450323819

We investigate the use of functional programming to develop a numerical linear algebra run-time;i.e. a framework where the solvers can be adapted easily to different contexts and task parallelism can be attained (semi-) automatically. We follow a bottom up strategy, where the first step is the design and implementation of a framework layer, composed by a functional version of BLAS (Basic Linear Algebra Subprograms) routines. The framework allows the manipulation of arbitrary representations for matrices and vectors and it is also possible to write and combine multiple implementations of BLAS operations based on different algorithms and parallelism strategies. Using this framework, we implement a functional version of Cholesky factorization, which serves as a proof of concept to evaluate the flexibility and performance of our approach. Copyright © 2013 by the Association for Computing Machinery, Inc. (acm).

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Identifying and specifying crosscutting contracts with aspectJML

Identifying and specifying crosscutting contracts with aspec...

引用

4th Annual acm International conference on Systems, programming, languages, and Applications: Software for Humanity, SPLASH 2013

作者： Rebêlo, Henrique Universidade Federal de Pernambuco PE Brazil

ISBN: (纸本)9781450319959

I propose AspectJML, a simple and practical aspect-oriented extension to JML. It supports the specification of crosscutting contracts for Java code in a modular way while keeping the benefits of a design by contract language, like documentation and modular reasoning. Copyright © 2013 by the Association for Computing Machinery, Inc. (acm).

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Position paper: Sapper - A language for provable hardware policy enforcement

Position paper: Sapper - A language for provable hardware po...

引用

2013 8th acm sigplan Workshop on programming languages and Analysis for Security, PLAS 2013 - Co-located with PLDI 2013

作者： Li, Xun Kashyap, Vineeth Oberg, Jason K. Tiwari, Mohit Rajarathinam, Vasanth Ram Kastner, Ryan Sherwood, Timothy Hardekopf, Ben Chong, Frederic T. Department of Computer Science University of California Santa Barbara Santa Barbara CA United States Department of Computer Science and Engineering University of California San Diego San Diego CA United States Department of Electrical Engineering and Computer Science University of California Berkeley Berkeley CA United States

ISBN: (纸本)9781450321440

We describe Sapper, a language for creating critical hardware components that have provably secure information flow. Most systems that enforce information flow policies place the hardware microarchitecture within the trusted computing base, and also assume that the observable behavior of that microarchitecture is fully and correctly documented. However, the reality is that this behavior is incompletely (and sometimes incorrectly) specified, and that the microarchitecture itself often contains implementation bugs. This fact means that all such systems are vulnerable to attack by exploiting undocumented or buggy hardware features. Sapper addresses this problem by enabling flexible and efficient hardware design that is provably secure with respect to a given information flow policy. Sapper uses a hybrid approach that leverages unique language features and static analysis to determine a set of dynamic checks that are automatically inserted into the hardware design. These checks are provably sufficient to guarantee that the resulting hardware prevents all explicit, implicit, and timing channels even if the hardware is otherwise buggy or poorly documented. Copyright © 2013 acm 978-1-4503-2144-0/13/06. . . $15.00.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Option Contracts 13

Option Contracts

引用

2013 acm sigplan International conference on Object Oriented programming Systems languages

作者： Dimoulas, Christos Findler, Robert Bruce Felleisen, Matthias Harvard Univ Cambridge MA 02138 USA Northwestern Univ Evanston IL 60208 USA Northeastern Univ Boston MA USA

ISBN: (纸本)9781450323741

Many languages support behavioral software contracts so that programmers can describe a component's obligations and promises via logical assertions in its interface. The contract system monitors program execution, checks whether the assertions hold, and, if not, blames the guilty component. Pinning down the violator gets the debugging process started in the right direction. Quality contracts impose a serious runtime cost, however, and programmers therefore compromise in many ways. Some turn off contracts for deployment, but then contracts and code quickly get out of sync during maintenance. Others test contracts randomly or probabilistically. In all cases, programmers have to cope with lack of blame information when the program eventually fails. In response, we propose option contracts as an addition to the contract tool box. Our key insight is that in ordinary contract systems, server components impose their contract on client components, giving them no choice whether to trust the server's promises or check them. With option contracts, server components may choose to tag a contract as an option and clients may choose to exercise the option or accept it, in which case they also shoulder some responsibility. We show that option contracts permit programmers to specify flexible checking policies, that their cost is reasonable, and that they satisfy a complete monitoring theorem.

关键词： programming language design behavioral software contracts random testing probabilistic spot checking

来源：评论

学校读者我要写书评

暂无评论

A JVM for Soft-Error-Prone Embedded Systems

A JVM for Soft-Error-Prone Embedded Systems

引用

14th acm sigplan/SIGBED conference on languages, Compilers and Tools for Embedded Systems

作者： Stilkerich, Isabella Strotz, Michael Erhardt, Christoph Hoffmann, Martin Lohmann, Daniel Scheler, Fabian Schroeder-Preikschat, Wolfgang Univ Erlangen Nurnberg Nurnberg Germany

ISBN: (纸本)9781450320856

The reduction of structure sizes in microcontollers, environmental conditions or low supply voltages increase the susceptibility of embedded systems to soft errors. As a result, the employment of fault-detection and fault-tolerance measures is becoming a mandatory task even for moderately critical applications. Accordingly, software-based techniques have recently gained in popularity, and a multitude of approaches that differ in the number and frequency of tolerated errors as well as their associated overhead have been proposed. Using type-safe programming languages to isolate critical software components is very popular among those techniques. An automated application of fault-detection and fault-tolerance measures based on the type system of the programming language and static code analyses is possible. It facilitates an easy evaluation of the protection characteristics and costs as well as the migration of software to new hardware platforms with different failure rates. Transient faults, however, are not bound to the application code secured by the type system, but can also affect the correctness of the type system itself. Thereby, the type system might lose its ability to isolate critical components. As a consequence, it is essential to also protect the type system itself against soft errors. In this paper, we show how soft errors can affect the integrity of the type system. Furthermore, we provide means to secure it against these faults, thus preserving its isolating character. These measures can be applied selectively to achieve a suitable tradeoff between level of protection and resource consumption. (1)

关键词： Reliability design languages KESO Java RTSJ Embedded Systems Real-Time Systems Reliability

来源：评论

学校读者我要写书评

暂无评论

Wringing out objects for programming and modeling component-based systems 13

Wringing out objects for programming and modeling component-...

引用

2nd International Workshop on Combined Object-Oriented Modelling and programming languages, ECOOP 2013

作者： Spacek, Petr Dony, Christophe Tibermacine, Chouki Fabresse, Luc LIRMM CNRS Montpellier II University 161 Rue Ada 34392 Montpellier Cedex 5 France Université Lille Nord de France Ecole des Mines de Douai 941 rue Charles Bourseul 59508 Douai cedex France

ISBN: (纸本)9781450320399

languages and technologies used to implement component-based software are not component-based, i.e. while the design phase happens in the component world, the programming phase occurs in the object-oriented world. When an object-oriented language is used for the programming stage, then the original component-based design vanish, because component concepts like requirements and architectures are not treated explicitly. This makes it difficult to keep model and its implementation causally connected. We present a new pure reflective component-based programming and modeling language where all core component concepts are treated explicitly and therefore keeping original component-design alive. The language makes it possible to model and program component-based software using the same language plus its uniform component-based meta-model and integrated reflection capabilities make the language and its applications open and flexible. Copyright 2013 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Mio: A High-Performance Multicore IO Manager for GHC

Mio: A High-Performance Multicore IO Manager for GHC

引用

acm sigplan Haskell Symposium Co-located with ICFP

作者： Voellmy, Andreas Wang, Junchang Hudak, Paul Yamamoto, Kazuhiko Yale Univ Dept Comp Sci New Haven CT 06520 USA IIJ Innovat Inst Inc Tokyo Japan

ISBN: (纸本)9781450323833

Haskell threads provide a key, lightweight concurrency abstraction to simplify the programming of important network applications such as web servers and software-defined network (SDN) controllers. The flagship Glasgow Haskell Compiler (GHC) introduces a run-time system (RTS) to achieve a high-performance multicore implementation of Haskell threads, by introducing effective components such as a multicore scheduler, a parallel garbage collector, an IO manager, and efficient multicore memory allocation. Evaluations of the GHC RTS, however, show that it does not scale well on multicore processors, leading to poor performance of many network applications that try to use lightweight Haskell threads. In this paper, we show that the GHC IO manager, which is a crucial component of the GHC RTS, is the scaling bottleneck. Through a series of experiments, we identify key data structure, scheduling, and dispatching bottlenecks of the GHC IO manager. We then design a new multicore IO manager named Mio that eliminates all these bottlenecks. Our evaluations show that the new Mio manager improves realistic web server throughput by 6.5x and reduces expected web server response time by 5.7x. We also show that with Mio, McNettle (an SDN controller written in Haskell) can scale effectively to 40+ cores, reach a throughput of over 20 million new requests per second on a single machine, and hence become the fastest of all existing SDN controllers.

关键词： languages Performance design Haskell GHC lightweight threads network programs IO manager event notification multicore processors concurrency scalability

来源：评论

学校读者我要写书评

暂无评论

Self-Optimizing AST Interpreters

Self-Optimizing AST Interpreters

引用

11th International conference on Generative programming and Component Engineering8th symposium on Dynamic languages

作者： Wuerthinger, Thomas Woess, Andreas Stadler, Lukas Duboscq, Gilles Simon, Doug Wimmer, Christian Johannes Kepler Univ Linz Linz Austria

An abstract syntax tree (AST) interpreter is a simple and natural way to implement a programming language. However, it is also considered the slowest approach because of the high overhead of virtual method dispatch. language implementers therefore define bytecodes to speed up interpretation, at the cost of introducing inflexible and hard to maintain bytecode formats. We present a novel approach to implementing AST interpreters in which the AST is modified during interpretation to incorporate type feedback. This tree rewriting is a general and powerful mechanism to optimize many constructs common in dynamic programming languages. Our system is implemented in Java (TM) and uses the static typing and primitive data types of Java elegantly to avoid the cost of boxed representations of primitive values in dynamic programming languages.

关键词： Algorithms languages Performance Java JavaScript dynamic languages virtual machine language implementation optimization

来源：评论

学校读者我要写书评

暂无评论

language Support for Dynamic, Hierarchical Data Partitioning 13

Language Support for Dynamic, Hierarchical Data Partitioning

引用

2013 acm sigplan International conference on Object Oriented programming Systems languages

作者： Treichler, Sean Bauer, Michael Aiken, Alex Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450323741

Applications written for distributed-memory parallel architectures must partition their data to enable parallel execution. As memory hierarchies become deeper, it is increasingly necessary that the data partitioning also be hierarchical to match. Current language proposals perform this hierarchical partitioning statically, which excludes many important applications where the appropriate partitioning is itself data dependent and so must be computed dynamically. We describe Legion, a region-based programming system, where each region may be partitioned into subregions. Partitions are computed dynamically and are fully programmable. The division of data need not be disjoint and subregions of a region may overlap, or alias one another. Computations use regions with certain privileges (e.g., expressing that a computation uses a region read-only) and data coherence (e.g., expressing that the computation need only be atomic with respect to other operations on the region), which can be controlled on a per-region (or subregion) basis. We present the novel aspects of the Legion design, in particular the combination of static and dynamic checks used to enforce soundness. We give an extended example illustrating how Legion can express computations with dynamically determined relationships between computations and data partitions. We prove the soundness of Legion's type system, and show Legion type checking improves performance by up to 71% by eliding provably safe memory checks. In particular, we show that the dynamic checks to detect aliasing at runtime at the region granularity have negligible overhead. We report results for three real-world applications running on distributed memory machines, achieving up to 62.5X speedup on 96 GPUs on the Keeneland supercomputer.

关键词： Legion regions type system independence aliasing hierarchical scheduling data partitioning coherence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 66 67 68 69 70 71 72 73 74 75 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：