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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 计算机科学与技术...
- 86 篇 控制科学与工程
- 57 篇 信息与通信工程
- 55 篇 电气工程
- 22 篇 电子科学与技术（可...
- 17 篇 机械工程
- 13 篇 材料科学与工程（可...
- 13 篇 建筑学
- 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,356 篇 英文
214 篇 其他
4 篇 中文
1 篇 葡萄牙文

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

共 2575 条记录，以下是331-340 订阅

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

详细简洁

排序：

Compiling Markov Chain Monte Carlo Algorithms for Probabilistic Modeling 2017

Compiling Markov Chain Monte Carlo Algorithms for Probabilis...

引用

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

作者： Huang, Daniel Tristan, Jean-Baptiste Morrisett, Greg Harvard Univ Cambridge MA 02138 USA Oracle Labs Burlington MA USA Cornell Univ Ithaca NY USA

ISBN: (纸本)9781450349888

The problem of probabilistic modeling and inference, at a high-level, can be viewed as constructing a (model, query, inference) tuple, where an inference algorithm implements a query on a model. Notably, the derivation of inference algorithms can be a difficult and error-prone task. Hence, researchers have explored how ideas from probabilistic prog ramming can be applied. In the context of constructing these tuples, probabilistic programming can be seen as taking a language-based approach to probabilistic modeling and inference. For instance, by using (1) appropriate languages for expressing models and queries and (2) devising inference techniques that operate on encodings of models (and queries) as program expressions, the task of inference can be automated. In this paper, we describe a compiler that transforms a probabilistic model written in a restricted modeling language and a query for posterior samples given observed data into a Markov Chain Monte Carlo (MCMC) inference algorithm that implements the query. The compiler uses a sequence of intermediate languages (ILs) that guide it in gradually and successively refining a declarative specification of a probabilistic model and the query into an executable MCMC inference algorithm. The compilation strategy produces composable MCMC algorithms for execution on a CPU or GPU.

关键词： probabilistic programming intermediate languages Markov-chain Monte Carlo kernels

来源：评论

学校读者我要写书评

暂无评论

A comparison of two object-oriented design methodologies (abstract only) 87

A comparison of two object-oriented design methodologies (ab...

引用

Proceedings of the 15th annual conference on Computer Science

作者： Linda Rising Department of Computer Technology Indiana University-Purdue University at Fort Wayne Fort Wayne Indiana

ISBN: (纸本)9780897912181

With the increasing use of Ada* in light of DoD Directive 5000.31, “The Ada programming language shall become the single, common, computer programming language for Defense mission-critical applications.” there has been an accompanying increase in interest in the proper software engineering techniques to insure that the powerful capabilities of Ada will be used to their *** one Ada development site, the design and implementation approach used has been that proposed by Grady Booch, Object-Oriented design (OOD):identify the objects of interest in the problem space and their attributesidentify the operations suffered by and required of each objectestablish the visibility of each object in relation to other objectsestablish the interface of each objectA proposal has been made to compare the deliverables and the end results of the above method with that of David Parnas, the Software Cost Reduction Method (SCR):identify a list of design decisions for which change cannot be ruled out (data structures, algorithms, etc.) make each design decision the “secret” of one module which comprises sub-programs that cannot be coded without knowledge of the “secret”design module interfaces that are insensitive to anticipated changes*Ada is a registered trademark of the U.S. Department of Defense (Ada Joint Program Office)

关键词：

来源：评论

学校读者我要写书评

暂无评论

Replacing Phrase Structure Grammar with Dependency Grammar in the design and implementation of programming languages

Replacing Phrase Structure Grammar with Dependency Grammar i...

引用

acm sigplan International Symposium on New Ideas, New Paradigms, and Reflections on programming and Software (Onward) part of SPLASH conference

作者： Steimann, Friedrich Fernuniv Hagen Germany

ISBN: (纸本)9781450355308

For decades, the design and implementation of programming languages has been based on phrase structure grammars, which divide a program recursively into phrases (represented by nonterminals), leaving the words of the program (the terminals) as the atoms of this division. By contrast, dependency grammar suggests that dependency between words, not constituency between phrases, is the primary grammatical relationship, and that a grammar capturing this relationship is basically a lexicon. In this paper, I suggest the use of dependency grammar for the design and implementation of programming languages. This allows me to unify the dictionaries populated by programs (with variables, procedures, functions, etc.) written in a programming language with the grammar of this language. I call the compilation of a programming language and its programs into a lexicon a langram and, using the example of the while language, show how langrams serve the "growing of languages".

关键词： dependency grammar lexicon langram

来源：评论

学校读者我要写书评

暂无评论

Practical Partial Evaluation for High-Performance Dynamic language Runtimes 2017

Practical Partial Evaluation for High-Performance Dynamic La...

引用

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

作者： Wurthinger, Thomas Wimmer, Christian Humer, Christian Woess, Andreas Stadler, Lukas Seaton, Chris Duboscq, Gilles Simon, Doug Grimmer, Matthias Oracle Labs Zurich Switzerland Johannes Kepler Univ Linz Inst Syst Software Linz Austria

ISBN: (纸本)9781450349888

Most high-performance dynamic language virtual machines duplicate language semantics in the interpreter, compiler, and runtime system. This violates the principle to not repeat yourself. In contrast, we define languages solely by writing an interpreter. The interpreter performs specializations, e.g., augments the interpreted program with type information and profiling information. Compiled code is derived automatically using partial evaluation while incorporating these specializations. This makes partial evaluation practical in the context of dynamic languages: It reduces the size of the compiled code while still compiling all parts of an operation that are relevant for a particular program. When a speculation fails, execution transfers back to the interpreter, the program re-specializes in the interpreter, and later partial evaluation again transforms the new state of the interpreter to compiled code. We evaluate our approach by comparing our implementations of JavaScript, Ruby, and R with best-inclass specialized production implementations. Our general-purpose compilation system is competitive with production systems even when they have been heavily optimized for the one language they support. For our set of benchmarks, our speedup relative to the V8 JavaScript VM is 0.83x, relative to JRuby is 3.8x, and relative to GNU R is 5x.

关键词： dynamic languages virtual machine language implementation optimization partial evaluation

来源：评论

学校读者我要写书评

暂无评论

Network Configuration Synthesis with Abstract Topologies 2017

Network Configuration Synthesis with Abstract Topologies

引用

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

作者： Beckett, Ryan Mahajan, Ratul Millstein, Todd Padhye, Jitendra Walker, David Princeton Univ Princeton NJ 08544 USA Intentionet Redmond WA USA Microsoft Redmond WA USA Univ Calif Los Angeles Los Angeles CA 90024 USA

ISBN: (纸本)9781450349888

We develop Propane/AT, a system to synthesize provablycorrect BGP (border gateway protocol) configurations for large, evolving networks from high-level specifications of topology, routing policy, and fault-tolerance requirements. Propane/AT is based on new abstractions for capturing parameterized network topologies and their evolution, and algorithms to analyze the impact of topology and routing policy on fault tolerance. Our algorithms operate entirely on abstract topologies. We prove that the properties established by our analyses hold for every concrete instantiation of the given abstract topology. Propane/AT also guarantees that only incremental changes to existing device configurations are required when the network evolves to add or remove devices and links. Our experiments with real-world topologies and policies show that our abstractions and algorithms are effective, and that, for large networks, Propane/AT synthesizes configurations two orders of magnitude faster than systems that operate on concrete topologies.

关键词： Propane/AT Domain-specific language BGP Fault Tolerance Compilation Network Management

来源：评论

学校读者我要写书评

暂无评论

Cross-cutting commentary : Narratives for multi-party mechanisms and concerns 10

Cross-cutting commentary : Narratives for multi-party mechan...

引用

10th International Workshop on Context-Oriented programming: Advanced Modularity for Run-time Composition, COP 2018 - Co-located with the European conference on Object-Oriented programming

作者： Hirschfeld, Robert Dürschmid, Tobias Rein, Patrick Taeumel, Marcel Hasso Plattner Institute University of Potsdam Potsdam Germany

ISBN: (纸本)9781450357227

Cross-cutting concerns are an inherent property of the implementation of non-trivial software systems. Their study led to the development of advanced modularity constructs, usually supported by meta-level frameworks and programming language constructs, to improve comprehensibility. Because of their invasive nature, systems need to be refactored or rewritten to take advantage of these constructs. However, practical considerations such as organizational or economical constraints often do not allow for such reengineering efforts, leaving those systems without explicit representations of their cross-cutting concerns. We propose a lightweight, non-invasive approach to explicate and document cross-cutting, multi-party concerns called Crosscutting Commentary, or Commentary for short. Our proposal is based on the observation that comments are co-located with the individual semantic units they are about and with that scattered and tangled in the absence of advanced modularity constructs for crosscutting concerns and the assumption that well-crafted, informal explanations of system properties (their intents and the mechanisms they provide) improve comprehensibility. Commentaries are to help communicate narratives about system properties that involve multiple participants, both co-located in a single module or crosscutting several of them, and allow for navigating to, from, and between them to explore the implementation artifacts involved. Commentary was inspired by layers introduced with Contextoriented programming to associate and manage partial definitions of system elements. While layers contribute to system comprehension during development and software composition at run-time, Commentary focuses on narratives for system exploration. We present our first attempt to provide Commentaries in Squeak/Smalltalk. We explain implementation details and discuss several application scenarios considering the documentation of basic mechanisms of this programming and runtime environment

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Recaf: Java Dialects as Libraries 2016

Recaf: Java Dialects as Libraries

引用

15th acm International conference on Generative programming - Concepts and Experiences (GPCE)

作者： Biboudis, Aggelos Inostroza, Pablo van der Storm, Tijs CWI Amsterdam Netherlands Univ Athens Athens Greece Univ Groningen Groningen Netherlands

ISBN: (纸本)9781450344463

Mainstream programming languages like Java have limited support for language extensibility. Without mechanisms for syntactic abstraction, new programming styles can only be embedded in the form of libraries, limiting expressiveness. In this paper, we present Recaf, a lightweight tool for creating Java dialects;effectively extending Java with new language constructs and user defined semantics. The Recaf compiler generically transforms designated method bodies to code that is parameterized by a semantic factory (Object Algebra), defined in plain Java. The implementation of such a factory defines the desired runtime semantics. We applied our design to produce several examples from a diverse set of programming styles and two case studies: we define i) extensions for generators, asynchronous computations and asynchronous streams and ii) a Domain-Specific language (DSL) for Parsing Expression Grammars (PEGs), in a few lines of code.

关键词： language virtualization object algebras transformation extensible languages

来源：评论

学校读者我要写书评

暂无评论

Thinking in imperative or objects? A study on how novice programmer thinks when it comes to designing an application

Thinking in imperative or objects? A study on how novice pro...

引用

IEEE International conference on Teaching, Assessment and Learning for Engineering (TALE)

作者： Sim Tze Ying School of Interdisciplinary Studies Sunway University Subang Jaya Malaysia

ISBN: (数字)9781728126654

ISBN: (纸本)9781728126661

Novice programming is a challenging subject to teach and learn. However, programming is an essential skill that is required by many majors apart from Computer Science. The challenges in a novice programming subject change according to the programming language used. At the beginning of the 90s, the object-oriented programming was introduced. Detienne claimed that it is easier for programmers to program using the object-first approach as humans think naturally in objects. The IEEE and acm joint task force on Computing Curriculum proposed two tracks of curriculum, one for imperative-first and the other for object-first implementation. However, most of the work conducted on novice programming focused on the issues of syntax errors, reducing the possibilities of syntax error through a new or adapted programming environment. This paper will present the preliminary work to investigate if students will naturally think in objects or a series of steps. Three intervention methods were implemented in three different workshops. The intervention methods are the object-first, the imperative-first and the problem-solving-first. The students are then requested to design an application. Through the design, the research will identify if the students use the object-first or the imperative-first design. Assuming that the object-first intervention group will design primarily in objects, and the imperative-first intervention group in a series of steps, the problem-solving intervention will be the “neutral” group. The object-first design is reflected through the attributes and methods of a particular object. The imperative-first design is identified if the solution contains a series of steps. The findings show that most of the students designed the application using a series of steps reflecting the imperative-first design. This finding should be included when considering if imperative-first or object-first should be the way forward for a novice programming subject.

关键词： Syntactics programming profession conferences Computer languages Object oriented programming Tools

来源：评论

学校读者我要写书评

暂无评论

CC 2018 - Proceedings of the 27th International conference on Compiler Construction, Co-located with CGO 2018

CC 2018 - Proceedings of the 27th International Conference o...

引用

27th International conference on Compiler Construction, CC 2018

ISBN: (纸本)9781450356442

The proceedings contain 19 papers. The topics discussed include: generalized profile-guided iterator recognition;rethinking compilers in the rise of machine learning and AI;compiler and language design for quantum computing;a session type provider;computing partially path-sensitive MFP solutions in data flow analyses;tail call elimination and data representation for functional languages on the Java virtual machine;fast and flexible instruction selection with constraints;semantic reasoning about the sea of nodes;compiling for concise code and efficient I/O;towards a compiler analysis for parallel algorithmic skeletons;an efficient data structure for must-alias analysis;modeling the conflicting demands of parallelism and temporal/spatial locality in affine scheduling;a polyhedral compilation framework for loops with dynamic data-dependent bounds;CAnDL: a domain specific language for compiler analysis;parallel sparse flow-sensitive points-to analysis;finding missed compiler optimizations by differential testing;and PAYJIT: space-optimal JIT compilation and its practical implementation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compiler and language design for Quantum Computing 2018

Compiler and Language Design for Quantum Computing

引用

27th International conference on Compiler Construction (CC)

作者： Heim, Bettina Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450356442

Quantum computing, once merely a curious concept discussed within the field of theoretical physics, has long-since become of practical interest in numerous fields and caught the attention of mainstream media. The reason for the widespread interest stems from the tremendous impact it could have on today's technology. Quantum computing could revolutionize how we develop new materials, how we approach machine learning and optimization tasks, and provide answers to some of the most intriguing questions in physics, chemistry and biology. Despite having been conceived as early as 1981, quantum computers remained beyond the realms of possibility until recently. Building a scalable programmable universal device to this day is one of the biggest challenges of the 21st century. Such an endeavor entails a set of unique requirements for the design of classical software. In my talk I will discuss the particularities of compiling for quantum hardware compared to classical machines, and what advantages a well designed quantum computing language can provide. I will outline the architecture of the software stack involved in translating high level mathematical concepts into machine instructions, and elaborate on the role of classical computing in this new age of quantum.

关键词： Quantum Computing Compiler programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：