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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,062 篇 工学
- 1,002 篇 软件工程
- 769 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 36 篇 电气工程
- 31 篇 信息与通信工程
- 8 篇 电子科学与技术（可...
- 7 篇 机械工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 4 篇 生物工程
- 2 篇 光学工程
- 2 篇 农业工程
134 篇 理学
- 111 篇 数学
- 14 篇 系统科学
- 8 篇 统计学（可授理学、...
- 6 篇 生物学
- 5 篇 物理学
- 4 篇 化学
82 篇 管理学
- 47 篇 管理科学与工程(可...
- 38 篇 图书情报与档案管...
- 27 篇 工商管理
12 篇 教育学
- 12 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
2 篇 农学
- 2 篇 作物学

主题

170 篇 design
157 篇 languages
99 篇 computer program...
96 篇 performance
57 篇 algorithms
54 篇 object oriented ...
51 篇 computer program...
43 篇 experimentation
39 篇 verification
34 篇 reliability
34 篇 java programming...
29 篇 functional progr...
26 篇 program synthesi...
26 篇 java
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
18 篇 c (programming l...
17 篇 compilers

机构

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...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 shao zhong
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,148 篇 英文
77 篇 其他
1 篇 中文

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

共 1226 条记录，以下是521-530 订阅

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

详细简洁

排序：

Highly efficient and encapsulated re-use of synchronization code in concurrent object-oriented languages 8

Highly efficient and encapsulated re-use of synchronization ...

引用

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

作者： Matsuoka, Satoshi Taura, Kenjiro Yonezawa, Akinori Department of Information Science University of Tokyo Japan

ISBN: (纸本)0897915879

Re-use of synchronization code in concurrent 00-languages has been considered difficult due to inheritance anomaly, which we minimize with our new proposal. designed with high practicality in mind, we propose language primitives (plus their implementation) with the following characteristics: (1) it allows multiple synchronization schemes-the language schemes for programming synchronization- to coexist and be integrated, (2) re-use of synchronization code is done similarly to sequential OO-languages for user familiarity, (3) it offers high degree of encapsulation-even synchronization schemes could be encapsulated in superclasses in many cases, and (4) it can be efficiently implemented on conventional MPPs. We demonstrate the effectiveness of our proposal with solutions to the example inheritance anomaly cases from [16]. We also give an overview of the implementation architecture, along with preliminary benchmarks. The proposed language primitives are being incorporated into our ABCL/on AP1000 running on Fujitsu's 512-node MPP, AP1000. © 1993 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Scalable lock-free dynamic memory allocation

Scalable lock-free dynamic memory allocation

引用

proceedings of the 2004 acm sigplan conference on programming language design and implementation (PLDI'04)

作者： Michael, Maged M. IBM Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights NY 10598 United States

Dynamic memory allocators (malloc/free) rely on mutual exclusion locks for protecting the consistency of their shared data structures under multithreading. The use of locking has many disadvantages with respect to performance, availability, robustness, and programming flexibility. A lock-free memory allocator guarantees progress regardless of whether some threads are delayed or even killed and regardless of scheduling policies. This paper presents a completely lock-free memory allocator. It uses only widely-available operating system support and hardware atomic instructions. It offers guaranteed availability even under arbitrary thread termination and crash-failure, and it is immune to dead-lock regardless of scheduling policies, and hence it can be used even in interrupt handlers and real-time applications without requiring special scheduler support. Also, by leveraging some high-level structures from Hoard, our allocator is highly scalable, limits space blowup to a constant factor, and is capable of avoiding false sharing. In addition, our allocator allows finer concurrency and much lower latency than Hoard. We use PowerPC shared memory multiprocessor systems to compare the performance of our allocator with the default AIX 5.1 libc malloc, and two widely-used multithread allocators, Hoard and Ptmalloc. Our allocator outperforms the other allocators in virtually all cases and often by substantial margins, under various levels of parallelism and allocation patterns. Furthermore, our allocator also offers the lowest contention-free latency among the allocators by significant margins.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

EVA: An Encrypted Vector Arithmetic language and Compiler for Efficient Homomorphic Computation 2020

EVA: An Encrypted Vector Arithmetic Language and Compiler fo...

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Dathathri, Roshan Kostova, Blagovesta Saarikivi, Olli Dai, Wei Laine, Kim Musuvathi, Madan Univ Texas Austin Austin TX 78712 USA Ecole Polytech Fed Lausanne Lausanne Switzerland Microsoft Res Redmond WA USA

ISBN: (纸本)9781450376136

Fully-Homomorphic Encryption (FHE) offers powerful capabilities by enabling secure offloading of both storage and computation, and recent innovations in schemes and implementations have made it all the more attractive. At the same time, FHE is notoriously hard to use with a very constrained programming model, a very unusual performance profile, and many cryptographic constraints. Existing compilers for FHE either target simpler but less efficient FHE schemes or only support specific domains where they can rely on expert-provided high-level runtimes to hide complications. This paper presents a new FHE language called Encrypted Vector Arithmetic (EVA), which includes an optimizing compiler that generates correct and secure FHE programs, while hiding all the complexities of the target FHE scheme. Bolstered by our optimizing compiler, programmers can develop efficient general-purpose FHE applications directly in EVA. For example, we have developed image processing applications using EVA, with a very few lines of code. EVA is designed to also work as an intermediate representation that can be a target for compiling higher-level domain-specific languages. To demonstrate this, we have re-targeted CHET, an existing domain-specific compiler for neural network inference, onto EVA. Due to the novel optimizations in EVA, its programs are on average 5.3x faster than those generated by CHET. We believe that EVA would enable a wider adoption of FHE by making it easier to develop FHE applications and domain-specific FHE compilers.

关键词： Homomorphic encryption compiler neural networks privacy-preserving machine learning

来源：评论

学校读者我要写书评

暂无评论

Fast RMWs for TSO: Semantics and implementation

Fast RMWs for TSO: Semantics and Implementation

引用

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

作者： Rajaram, Bhargava Nagarajan, Vijay Sarkar, Susmit Elver, Marco Univ Edinburgh Edinburgh EH8 9YL Midlothian Scotland Univ St Andrews St Andrews KY16 9AJ Fife Scotland

ISBN: (纸本)9781450320146

Read-Modify-Write (RMW) instructions are widely used as the building blocks of a variety of higher level synchronization constructs, including locks, barriers, and lock-free data structures. Unfortunately, they are expensive in architectures such as x86 and SPARC which enforce (variants of) Total-Store-Order (TSO). A key reason is that RMWs in these architectures are ordered like a memory barrier, incurring the cost of a write-buffer drain in the critical path. Such strong ordering semantics are dictated by the requirements of the strict atomicity definition (type-1) that existing TSO RMWs use. Programmers often do not need such strong semantics. Besides, weakening the atomicity definition of TSO RMWs, would also weaken their ordering - thereby leading to more efficient hardware implementations. In this paper we argue for TSO RMWs to use weaker atomicity definitions - we consider two weaker definitions: type-2 and type-3, with different relaxed ordering differences. We formally specify how such weaker RMWs would be ordered, and show that type-2 RMWs, in particular, can seamlessly replace existing type-1 RMWs in common synchronization idioms - except in situations where a type-1 RMW is used as a memory barrier. Recent work has shown that the new C/C++ 11 concurrency model can be realized by generating conventional (type-1) RMWs for C/C++ 11 SC-atomic-writes and/or SC-atomic-reads. We formally prove that this is equally valid using the proposed type-2 RMWs;type-3 RMWs, on the other hand, could be used for SC-atomic-reads (and optionally SC-atomic-writes). We further propose efficient microarchitectural implementations for type-2 (type-3) RMWs - simulation results show that our implementation reduces the cost of an RMW by up to 58.9% (64.3%), which translates into an overall performance improvement of up to 9.0% (9.2%) on a set of parallel programs, including those from the SPLASH-2, PARSEC, and STAMP benchmarks.

关键词： design Performance Experimentation Read-Modify-Write (RMW) Total-Store-Order (TSO) Atomics

来源：评论

学校读者我要写书评

暂无评论

Ada 9x: From abstraction-oriented to object-oriented 8

Ada 9x: From abstraction-oriented to object-oriented

引用

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

作者： Taft, S. Tucker Intermetrics Inc. 733 Concord Avenue CambridgeMA02138 United States

ISBN: (纸本)0897915879

Ada 83 is an abstraction-oriented programming language. It supports the definition of abstract data types in modules called "packages," with a separate interface and implementation. The next revision of the language is now being prepared, and is designated Ada 9X. This revision will support full object-oriented programming. As part of designing the object-oriented features of Ada 9X, we had a choice whether to construct a conventional but essentially independent objectoriented capability in addition to the existing abstraction-oriented features of Ada 83, or to make an effort to integrate the existing abstraction support with the minimal set of additional capabilities necessary to support object-oriented programming. We have chosen the latter approach, and as part of this effort, we have tried to isolate exactly what capabilities distinguish a full object-oriented programming language from an abstraction-oriented programming language like Ada 83. Our conclusion is that the essential new capability of object-oriented programming is that a given abstraction may effectively have multiple implementations. The objects carry sufficient extra information at run-time to identify to which implementation they correspond. in Ada 9X, we call this run-time type identification the "tag" of the object, and the corresponding new language capability is called "tagged types." © 1993 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Constrained Kinds 12

Constrained Kinds

引用

acm International conference on Object Oriented programming Systems languages and Applications

作者： Tardieu, Olivier Nystrom, Nathaniel Peshansky, Igor Saraswat, Vijay IBM Res Yorktown Hts NY USA Univ Lugano Lugano Switzerland Google Mountain View CA USA

ISBN: (纸本)9781450315616

Modern object-oriented languages such as X 1 0 require a rich framework for types capable of expressing both value-dependency and genericity, and supporting pluggable, domain-specific extensions. In earlier work, we presented a framework for constrained types in object-oriented languages, parametrized by an underlying constraint system. Types are viewed as formulas C {c} where C is the name of a class or an interface and c is a constraint on the immutable instance state (the properties) of C. Constraint systems are a very expressive framework for partial information. Many (value-) dependent type systems for object-oriented languages can be viewed as constrained types. This paper extends the constrained types approach to handle type-dependency ("genericity"). The key idea is to introduce constrained kinds: in the same way that constraints on values can be used to define constrained types, constraints on types can define constrained kinds. We develop a core programming language with constrained kinds. Generic types are supported by introducing type variables-literally, variables with "type" Type-and permitting programs to impose subtyping and equality constraints on such variables. We formalize the type-checking rules and establish soundness. While the language now intertwines constraints on types and values, its type system remains parametric in the choice of the value constraint system (language and solver). We demonstrate that constrained kinds are expressive and practical and sketch possible extensions with a discussion of the design and implementation of X10.

关键词： design languages Theory types generics constraints X10

来源：评论

学校读者我要写书评

暂无评论

Lightweight Modular Staging: A Pragmatic Approach to Runtime Code Generation and Compiled DSLs 10

Lightweight Modular Staging: A Pragmatic Approach to Runtime...

引用

9th International conference on Generative programming and Component Engineering

作者： Rompf, Tiark Odersky, Martin Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland

ISBN: (纸本)9781450301541

Software engineering demands generality and abstraction, performance demands specialization and concretization. Generative programming can provide both, but developing high-quality program generators takes a large effort, even if a multi-stage programming language is used. We present lightweight modular staging, a library-based multi-stage programming approach that breaks with the tradition of syntactic quasi-quotation and instead uses only types to distinguish between binding times. Through extensive use of component technology, lightweight modular staging makes an optimizing compiler framework available at the library level, allowing programmers to tightly integrate domain-specific abstractions and optimizations into the generation process. We argue that lightweight modular staging enables a form of language virtualization, i.e. allows to go from a pure-library embedded language to one that is practically equivalent to a stand-alone implementation with only modest effort.

关键词： design languages Code Generation Multi-stage programming Domain-specific languages language Virtualization

来源：评论

学校读者我要写书评

暂无评论

Duce: An XML-centric general-purpose language

Duce: An XML-centric general-purpose language

引用

proceedings of the 2003 acm sigplan International conference on Functional programming

作者： Benzaken, Véronique Castagna, Giuseppe Frisch, Alain Université Paris-Sud 91405 Orsay France CNRS Département d'Informatique École Normale Superieure 45 Rue d'Ulm Paris France Département d'Informatique École Normale Superieure 45 Rue d'Ulm Paris France

We present the functional language Duce, discuss some design issues, and show its adequacy for working with XML documents. Distinctive features of Duce are a powerful pattern matching, first class functions, overloaded functions, a very rich type system (arrows, sequences, pairs, records, intersections, unions, differences), precise type inference for patterns and error localization, and a natural interpretation of types as sets of values. We also outline some important implementation issues;in particular, a dispatch algorithm that demonstrates how static type information can be used to obtain very efficient compilation schemas.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Eventrons: A safe programming construct for high-frequency hard real-time applications 06

Eventrons: A safe programming construct for high-frequency h...

引用

acm sigplan conference on programming language design and implementation, PLDI 2006 - PLAS 2006: 2006 programming languages and Analysis for Security Workshop

作者： Spoonhower, Daniel Auerbach, Joshua Bacon, David F. Cheng, Perry Grove, David Carnegie Mellon University United States IBM Research

ISBN: (纸本)1595933743

While real-time garbage collection has achieved worst-case latencies on the order of a millisecond, this technology is approaching its practical limits. For tasks requiring extremely low latency, and especially periodic tasks with frequencies above 1 KHz, Java programmers must currently resort to the NoHeapRealtimeThread construct of the Real-Time Specification for Java. This technique requires expensive run-time checks, can result in unpredictable low-level exceptions, and inhibits communication with the rest of the garbage-collected application. We present Eventrons, a programming construct that can arbitrarily preempt the garbage collector, yet guarantees safety and allows its data to be visible to the garbage-collected heap. Eventrons are a strict subset of Java, and require no run-time memory access checks. Safety is enforced using a data-sensitive analysis and simple run-time support with extremely low overhead. We have implemented Eventrons in IBM's J9 Java virtual machine, and present experimental results in which we ran Eventrons at frequencies up to 22 KHz (a 45 s period). Across 10 million periods, 99.997% of the executions ran within 10 ss of their deadline, compared to 99.999% of the executions of the equivalent program written in C. Copyright © 2006 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

language extension and composition with language workbenches

Language extension and composition with language workbenches

引用

acm International conference Companion on Object Oriented programming Systems languages and Applications Companion, SPLASH '10

作者： Völter, Markus Visser, Eelco Independent/Itemis Germany Delft University of Technology Netherlands

ISBN: (纸本)9781450302401

Domain-specific languages (DSLs) provide high expressive power focused on a particular problem domain. They provide linguistic abstractions and specialized syntax specifically designed for a domain, allowing developers to avoid boilerplate code and low-level implementation details. language workbenches are tools that integrate all aspects of the definition of domain-specific or general-purpose software languages and the creation of a programming environment from such a definition. To count as a language workbench, a tool needs to satisfy basic requirements for the integrated definition of syntax, semantics, and editor services, and preferably also support language extension and composition. Within these requirements there is ample room for variation in the design of a language workbench. In this tutorial, we give an introduction to the state of the art in textual DSLs and language workbenches. We discuss the main requirements and variation points in the design of language workbenches, and describe two points in the design space using two state-of-the-art language workbenches. Spoofax is an example of a parser-based language workbench, while MPS represents language workbenches based on projectional editors.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共123页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：