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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

737 篇 会议
127 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

777 篇 工学
- 742 篇 软件工程
- 568 篇 计算机科学与技术...
- 35 篇 控制科学与工程
- 19 篇 电气工程
- 19 篇 信息与通信工程
- 16 篇 生物工程
- 8 篇 土木工程
- 6 篇 建筑学
- 4 篇 化学工程与技术
- 3 篇 材料科学与工程（可...
- 3 篇 电子科学与技术（可...
- 3 篇 环境科学与工程（可...
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 农业工程
59 篇 理学
- 33 篇 数学
- 18 篇 生物学
- 6 篇 物理学
- 6 篇 化学
- 6 篇 系统科学
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 统计学（可授理学、...
59 篇 管理学
- 35 篇 图书情报与档案管...
- 26 篇 管理科学与工程(可...
- 8 篇 工商管理
12 篇 法学
- 12 篇 社会学
- 1 篇 法学
6 篇 教育学
- 6 篇 教育学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

250 篇 languages
111 篇 object oriented ...
83 篇 performance
83 篇 design
52 篇 algorithms
46 篇 verification
43 篇 java
41 篇 experimentation
38 篇 reliability
36 篇 computer program...
34 篇 theory
19 篇 human factors
17 篇 concurrency
16 篇 parallel program...
16 篇 object-oriented ...
15 篇 measurement
14 篇 scala
13 篇 aspect oriented ...
13 篇 javascript
12 篇 type systems

机构

18 篇 univ washington ...
13 篇 ecole polytech f...
12 篇 tech univ darmst...
11 篇 microsoft res re...
9 篇 mit csail cambri...
8 篇 univ texas austi...
7 篇 univ marburg d-3...
7 篇 univ texas austi...
7 篇 aarhus univ dk-8...
6 篇 princeton univ p...
6 篇 johannes kepler ...
6 篇 suny binghamton ...
6 篇 harvard univ cam...
6 篇 purdue univ w la...
6 篇 univ calif berke...
5 篇 univ duisburg es...
5 篇 microsoft res ca...
5 篇 ecole polytech f...
5 篇 mcgill univ mont...
5 篇 univ hong kong p...

作者

12 篇 rajan hridesh
12 篇 odersky martin
11 篇 mezini mira
10 篇 hirschfeld rober...
10 篇 binder walter
9 篇 salvaneschi guid...
9 篇 aldrich jonathan
9 篇 ostermann klaus
8 篇 mckinley kathryn...
8 篇 marr stefan
8 篇 rompf tiark
7 篇 oliveira bruno c...
7 篇 noble james
7 篇 liu yu david
7 篇 kuncak viktor
7 篇 gulwani sumit
6 篇 bond michael d.
6 篇 ceze luis
6 篇 van der storm ti...
6 篇 coad peter

语言

746 篇 英文
116 篇 其他
2 篇 中文
1 篇 俄文

检索条件"任意字段=2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages"

共 865 条记录，以下是171-180 订阅

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

详细简洁

排序：

The HipHop Virtual Machine 14

The HipHop Virtual Machine

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Adams, Keith Evans, Jason Maher, Bertrand Ottoni, Guilherme Paroski, Andrew Simmers, Brett Smith, Edwin Yamauchi, Owen Facebook Cambridge MA USA

ISBN: (纸本)9781450325851

The HipHop Virtual Machine (HHVM) is a JIT compiler and runtime for PHP. While PHP values are dynamically typed, real programs often have latent types that are useful for optimization once discovered. Some types can be proven through static analysis, but limitations in the ahead-of-time approach leave some types to be discovered at run time. And even though many values have latent types, PHP programs can also contain polymorphic variables and expressions, which must be handled without catastrophic slow-down. HHVM discovers latent types by structuring its JIT around the concept of a tracelet. A tracelet is approximately a basic block specialized for a particular set of run-time types for its input values. Tracelets allow HHVM to exactly and efficiently learn the types observed by the program, while using a simple compiler. This paper shows that this approach enables HHVM to achieve high levels of performance, without sacrificing compatibility or interactivity.

关键词： Design languages Performance PHP dynamic languages JIT compiler tracelet

来源：评论

学校读者我要写书评

暂无评论

Staged Parser Combinators for Efficient Data Processing 14

Staged Parser Combinators for Efficient Data Processing

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Jonnalagedda, Manohar Coppey, Thierry Stucki, Sandro Rompf, Tiark Odersky, Martin EPFL LAMP Zurich Switzerland EPFL DATA Zurich Switzerland

ISBN: (纸本)9781450325851

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to be interleaved with processing of parse results. Unfortunately, parser combinators are typically slow due to the high overhead of the host language abstraction mechanisms that enable composition. We present a technique for eliminating such overhead. We use staging, a form of runtime code generation, to dissociate input parsing from parser composition, and eliminate intermediate data structures and computations associated with parser composition at staging time. A key challenge is to maintain support for input dependent grammars, which have no clear stage distinction. Our approach applies to top-down recursive-descent parsers as well as bottom-up nondeterministic parsers with key applications in dynamic programming on sequences, where we auto-generate code for parallel hardware. We achieve performance comparable to specialized, hand-written parsers.

关键词： Parser combinators multi-stage programming algebraic dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Understanding Energy Behaviors of Thread Management Constructs 14

Understanding Energy Behaviors of Thread Management Construc...

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Pinto, Gustavo Castor, Fernando Liu, Yu David Univ Fed Pernambuco Recife PE Brazil SUNY Binghamton Binghamton NY 13902 USA

ISBN: (纸本)9781450325851

Java programmers are faced with numerous choices in managing concurrent execution on multicore platforms. These choices often have different trade-offs (e.g., performance, scalability, and correctness guarantees). This paper analyzes an additional dimension, energy consumption. It presents an empirical study aiming to illuminate the relationship between the choices and settings of thread management constructs and energy consumption. We consider three important thread management constructs in concurrent programming: explicit thread creation, fixed-size thread pooling, and work stealing. We further shed light on the energy/performance trade-off of three "tuning knobs" of these constructs: the number of threads, the task division strategy, and the characteristics of processed data. Through an extensive experimental space exploration over real-world Java programs, we produce a list of findings about the energy behaviors of concurrent programs, which are not always obvious. The study serves as a first step toward improving energy efficiency of concurrent programs on parallel architectures.

关键词： Performance and Measurement Energy Consumption Performance Thread Management Multi-threaded programming Java

来源：评论

学校读者我要写书评

暂无评论

Alembic: Automatic Locality Extraction via Migration 14

Alembic: Automatic Locality Extraction via Migration

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Holt, Brandon Briggs, Preston Ceze, Luis Oskin, Mark Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450325851

Partitioned Global Address Space (PGAS) environments simplify writing parallel code for clusters because they make data movement implicit - dereferencing global pointers automatically moves data around. However, it does not free the programmer from needing to reason about locality - poor placement of data can lead to excessive and even unnecessary communication. For this reason, modern PGAS languages such as X10, Chapel, and UPC allow programmers to express data-layout constraints and explicitly move computation. This places an extra burden on the programmer, and is less effective for applications with limited or data-dependent locality (e.g., graph analytics). This paper proposes Alembic, a new static analysis that frees programmers from having to manually move computation to exploit locality in PGAS programs. It works by determining regions of code that access the same cluster node, then transforming the code to migrate parts of the execution to increase the proportion of accesses to local data. We implement the analysis and transformation for C++ in LLVM and show that in irregular application kernels, Alembic can achieve 82% of the performance of hand-tuned communication (for comparison, naive compiler-generated communication achieves only 13%).

关键词： Compilers Distributed systems languages PGAS LLVM Locality Thread migration Continuation-passing style

来源：评论

学校读者我要写书评

暂无评论

Adaptive LL(*) Parsing: The Power of Dynamic Analysis 14

Adaptive <i>LL</i>(*) Parsing: The Power of Dynamic Analysis

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Parr, Terence Harwell, Sam Fisher, Kathleen Univ San Francisco San Francisco CA 94117 USA Univ Texas Austin Austin TX 78712 USA Tufts Univ Medford MA USA

ISBN: (纸本)9781450325851

Despite the advances made by modern parsing strategies such as PEG, LL(*), GLR, and GLL, parsing is not a solved problem. Existing approaches suffer from a number of weaknesses, including difficulties supporting side-effecting embedded actions, slow and/or unpredictable performance, and counter-intuitive matching strategies. This paper introduces the ALL(*) parsing strategy that combines the simplicity, efficiency, and predictability of conventional top-down LL(k) parsers with the power of a GLR-like mechanism to make parsing decisions. The critical innovation is to move grammar analysis to parse-time, which lets ALL(*) handle any non-left-recursive context-free grammar. ALL(*) is O(n(4)) in theory but consistently performs linearly on grammars used in practice, outperforming general strategies such as GLL and GLR by orders of magnitude. ANTLR 4 generates ALL(*) parsers and supports direct left-recursion through grammar rewriting. Widespread ANTLR 4 use (5000 downloads/month in 2013) provides evidence that ALL(*) is effective for a wide variety of applications.

关键词： Algorithms languages Theory nondeterministic parsing DFA augmented transition networks grammar ALL(*) LL(*) GLR GLL PEG

来源：评论

学校读者我要写书评

暂无评论

Determinacy in Static Analysis for jQuery 14

Determinacy in Static Analysis for jQuery

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Andreasen, Esben Moller, Anders Aarhus Univ DK-8000 Aarhus C Denmark

ISBN: (纸本)9781450325851

Static analysis for JavaScript can potentially help programmers find errors early during development. Although much progress has been made on analysis techniques, a major obstacle is the prevalence of libraries, in particular jQuery, which apply programming patterns that have detrimental consequences on the analysis precision and performance. Previous work on dynamic determinacy analysis has demonstrated how information about program expressions that always resolve to a fixed value in some call context may lead to significant scalability improvements of static analysis for such code. We present a static dataflow analysis for JavaScript that infers and exploits determinacy information on-the-fly, to enable analysis of some of the most complex parts of jQuery. The analysis combines selective context and path sensitivity, constant propagation, and branch pruning, based on a systematic investigation of the main causes of analysis imprecision when using a more basic analysis. The techniques are implemented in the TAJS analysis tool and evaluated on a collection of small programs that use jQuery. Our results show that the proposed analysis techniques boost both precision and performance, specifically for inferring type information and call graphs.

关键词： languages Algorithms Verification JavaScript program analysis

来源：评论

学校读者我要写书评

暂无评论

SURVEYMAN: programming and Automatically Debugging Surveys 14

SURVEYMAN: Programming and Automatically Debugging Surveys

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Tosch, Emma Berger, Emery D. Univ Massachusetts Sch Comp Sci Amherst MA 01003 USA

ISBN: (纸本)9781450325851

Surveys can be viewed as programs, complete with logic, control flow, and bugs. Word choice or the order in which questions are asked can unintentionally bias responses. Vague, confusing, or intrusive questions can cause respondents to abandon a survey. Surveys can also have runtime errors: inattentive respondents can taint results. This effect is especially problematic when deploying surveys in uncontrolled settings, such as on the web or via crowdsourcing platforms. Because the results of surveys drive business decisions and inform scientific conclusions, it is crucial to make sure they are correct. We present SURVEYMAN, a system for designing, deploying, and automatically debugging surveys. Survey authors write their surveys in a lightweight domain-specific language aimed at end users. SURVEYMAN statically analyzes the survey to provide feedback to survey authors before deployment. It then compiles the survey into JavaScript and deploys it either to the web or a crowdsourcing platform. SURVEYMAN's dynamic analyses automatically find survey bugs, and control for the quality of responses. We evaluate SURVEYMAN's algorithms analytically and empirically, demonstrating its effectiveness with case studies of social science surveys conducted via Amazon's Mechanical Turk.

关键词： statistical debugging social science domain specific languages

来源：评论

学校读者我要写书评

暂无评论

Region-based Memory Management for GPU programming languages Enabling Rich Data Structures on a Spartan Host 14

Region-based Memory Management for GPU Programming Languages...

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Holk, Eric Newton, Ryan Siek, Jeremy Lumsdaine, Andrew Indiana Univ Sch Informat & Comp Bloomington IN 47405 USA

ISBN: (纸本)9781450325851

Graphics Processing Units (GPUs) can effectively accelerate many applications, but their applicability has been largely limited to problems whose solutions can be expressed neatly in terms of linear algebra. Indeed, most GPU programming languages limit the user to simple data structures typically only multidimensional rectangular arrays of scalar values. Many algorithms are more naturally expressed using higher level language features, such as algebraic data types (ADTs) and first class procedures, yet building these structures in a manner suitable for a GPU remains a challenge. We present a region-based memory management approach that enables rich data structures in Harlan, a language for data parallel computing. Regions enable rich data structures by providing a uniform representation for pointers on both the CPU and GPU and by providing a means of transferring entire data structures between CPU and GPU memory. We demonstrate Harlan's increased expressiveness on several example programs and show that Harlan performs well on more traditional data-parallel problems.

关键词： Harlan GPU OpenCL parallel programming recursion algebraic data types first class procedures compilers implementation performance optimization

来源：评论

学校读者我要写书评

暂无评论

Static Analysis for Independent App Developers 14

Static Analysis for Independent App Developers

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Brutschy, Lucas Ferrara, Pietro Mueller, Peter Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland IBM Thomas J Watson Res Ctr Yorktown Hts NY USA

ISBN: (纸本)9781450325851

Mobile app markets have lowered the barrier to market entry for software producers. As a consequence, an increasing number of independent app developers offer their products, and recent platforms such as the MIT App Inventor and Microsoft's TouchDevelop enable even lay programmers to develop apps and distribute them in app markets. A major challenge in this distribution model is to ensure the quality of apps. Besides the usual sources of software errors, mobile apps are susceptible to errors caused by the non-determinism of an event-based execution model, a volatile environment, diverse hardware, and others. Many of these errors are difficult to detect during testing, especially for independent app developers, who are not supported by test teams and elaborate test infrastructures. To address this problem, we propose a static program analysis that captures the specifics of mobile apps and is efficient enough to provide feedback during the development process. Experiments involving 51,456 published TouchDevelop scripts show that our analysis analyzes 98% of the scripts in under a minute, and five seconds on average. Manual inspection of the analysis results for a selection of all scripts shows that most of the alarms are real errors.

关键词： languages Reliability Verification Abstract Interpretation Static Program Analysis Mobile Applications TouchDevelop

来源：评论

学校读者我要写书评

暂无评论

Call Sequence Prediction through Probabilistic Calling Automata 14

Call Sequence Prediction through Probabilistic Calling Autom...

引用

2014 acm international conference on object-oriented-programming-systems-languages-and-Applications (OOPSLA 14)

作者： Zhao, Zhijia Wu, Bo Zhou, Mingzhou Ding, Yufei Sun, Jianhua Shen, Xipeng Wu, Youfeng Coll William & Mary Williamsburg VA 23187 USA Colorado Sch Mines Golden CO 80401 USA N Carolina State Univ Raleigh NC 27695 USA

ISBN: (纸本)9781450325851

Predicting a sequence of upcoming function calls is important for optimizing programs written in modern managed languages (e.g., Java, Javascript, C#.) Existing function call predictions are mainly built on statistical patterns, suitable for predicting a single call but not a sequence of calls. This paper presents a new way to enable call sequence prediction, which exploits program structures through Probabilistic Calling Automata (PCA), a new program representation that captures both the inherent ensuing relations among function calls, and the probabilistic nature of execution paths. It shows that PCA-based prediction outperforms existing predictions, yielding substantial speedup when being applied to guide Just-In-Time compilation. By enabling accurate, efficient call sequence prediction for the first time, PCA-based predictors open up many new opportunities for dynamic program optimizations.

关键词： languages Performance Function call Call sequence prediction Probabilistic calling automata Dynamic optimizations Just-in-time compilation Parallel compilation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共87页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：