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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6 篇 会议

馆藏范围

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

日期分布

学科分类号

5 篇 工学
- 5 篇 计算机科学与技术...
- 5 篇 软件工程
- 1 篇 农业工程
3 篇 理学
- 3 篇 数学
- 1 篇 生物学
1 篇 农学
- 1 篇 作物学
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

4 篇 object oriented ...
1 篇 memory architect...

机构

1 篇 institut für inf...
1 篇 school of comput...
1 篇 università di ro...
1 篇 department of co...
1 篇 school of engine...
1 篇 università di ro...
1 篇 osservatorio ast...
1 篇 sezione di catan...
1 篇 università degli...
1 篇 tokyo institute ...
1 篇 ercis leonardo-c...

作者

1 篇 homer michael
1 篇 teegen finn
1 篇 noble james
1 篇 pierce benjamin ...
1 篇 dageförde jan c.
1 篇 masuhara hidehik...
1 篇 marr stefan
1 篇 roberts richard
1 篇 puglisi giuseppe
1 篇 igarashi atsushi
1 篇 springer matthia...
1 篇 anand avinash

语言

5 篇 英文
1 篇 其他

检索条件"任意字段=33rd European Conference on Object-Oriented Programming, ECOOP 2019"

共 6 条记录，以下是1-10 订阅

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

详细简洁

排序：

BrahMap: A scalable and modular map-making framework for the CMB experiments 33

BrahMap: A scalable and modular map-making framework for the...

引用

33rd Euromicro International conference on Parallel, Distributed, and Network-Based Processing, PDP 2025

作者： Anand, Avinash Puglisi, Giuseppe Università di Roma Tor Vergata Dipartimento di Fisica Via della Ricerca Scientifica 1 Roma00133 Italy Università di Roma Tor Vergata INFN Sezione di Roma2 Via della Ricerca Scientifica 1 Roma00133 Italy Università degli Studi di Catania Dipartimento di Fisica e Astronomia Via S. Sofia 64 Catania95123 Italy Osservatorio Astrofisico di Catania INAF Via S.Sofia 78 CataniaI-95123 Italy Sezione di Catania INFN Via S.Sofia 64 CataniaI-95123 Italy

ISBN: (纸本)9798331524937

The cosmic microwave background (CMB) experiments have reached an era of unprecedented precision and complexity. Aiming to detect the primordial B-mode polarization signal, these experiments will soon be equipped with $10^{4}$ to $10^{5}$ detectors. Consequently, future CMB missions will face the substantial challenge of efficiently processing vast amounts of raw data to produce the initial scientific outputs - the sky maps - within a reasonable time frame and with available computational resources. To address this, we introduce BrahMap, a new map-making framework that will be scalable across both CPU and GPU platforms. Implemented in C++ with a user-friendly Python interface for handling sparse linear systems, BrahMap employs advanced numerical analysis and high-performance computing techniques to maximize the use of super-computing infrastructure. This work features an overview of the BrahMap's capabilities and preliminary performance scaling results, with application to a generic CMB polarization experiment. © 2025 IEEE.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Structured Traversal of Search Trees in Constraint-Logic object-oriented programming 22nd

Structured Traversal of Search Trees in Constraint-Logic Obj...

引用

22nd International conference on Applications of Declarative programming and Knowledge Management, INAP 2019, the 33rd Workshop on Logic programming, WLP 2019, and the 27th Workshop on Functional and Constraint Logic programming, WFLP 2019

作者： Dageförde, Jan C. Teegen, Finn ERCIS Leonardo-Campus 3 Münster48149 Germany Institut für Informatik CAU Kiel Kiel24098 Germany

ISBN: (纸本)9783030467135

In this paper, we propose an explicit, non-strict representation of search trees in constraint-logic object-oriented programming. Our search tree representation includes both the non-deterministic and deterministic behaviours of executing an application. Introducing such a representation facilitates the use of various search strategies. In order to demonstrate the applicability of our approach, we incorporate explicit search trees into the virtual machine of the constraint-logic object-oriented programming language Muli. We then exemplarily implement three search algorithms that traverse the search tree on-demand: depth-first search, breadth-first search, and iterative deepening depth-first search. In particular, the last two strategies allow for a complete search, which is novel in constraint-logic object-oriented programming and highlights our main contribution. Finally, we compare the implemented strategies using several benchmarks. © 2020, Springer Nature Switzerland AG.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

22nd International conference on Applications of Declarative programming and Knowledge Management, INAP 2019, the 33rd Workshop on Logic programming, WLP 2019, and the 27th Workshop on Functional and Constraint Logic programming, WFLP 2019

22nd International Conference on Applications of Declarative...

引用

ISBN: (纸本)9783030467135

The proceedings contain 18 papers. The special focus in this conference is on Applications of Declarative programming and Knowledge Management. The topics include: Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic;KBSET – Knowledge-Based Support for Scholarly Editing and Text Processing with Declarative Markup and a Core Written in SWI-Prolog;structured Traversal of Search Trees in Constraint-Logic object-oriented programming;performance Analysis of Zippers;adding Data to Curry;free Theorems Simply, via Dinaturality;Improving the Performance of the Paisley Pattern-Matching EDSL by Staged Combinatorial Compilation;ICurry;a Process Calculus for Formally Verifying Blockchain Consensus Protocols;modular Modeling and Optimized Scheduling of Building Energy Systems Based on Mixed Integer programming;finding Maximal Non-redundant Association Rules in Tennis Data;from Textual Information Sources to Linked Data in the Agatha Project;allen’s Interval Algebra Makes the Difference;exploring Properties of Icosoku by Constraint Satisfaction Approach;the Regularization of Small Sub-Constraint Satisfaction Problems;declarative programming for Microcontrollers - Datalog on Arduino.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Transient typechecks are (almost) free 33

Transient typechecks are (almost) free

引用

33rd european conference on object-oriented programming, ecoop 2019

作者： Roberts, Richard Marr, Stefan Homer, Michael Noble, James School of Engineering and Computer Science Victoria University of Wellington New Zealand School of Computing University of Kent

ISBN: (纸本)9783959771115

Transient gradual typing imposes run-time type tests that typically cause a linear slowdown. This performance impact discourages the use of type annotations because adding types to a program makes the program slower. A virtual machine can employ standard just-in-time optimizations to reduce the overhead of transient checks to near zero. These optimizations can give gradually-typed languages performance comparable to state-of-the-art dynamic languages, so programmers can add types to their code without affecting their programs’ performance. © Richard Roberts, Stefan Marr, Michael Homer, and James Noble.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Dynasoar: A parallel memory allocator for object-oriented programming on GPUs with efficient memory access 33

Dynasoar: A parallel memory allocator for object-oriented pr...

引用

33rd european conference on object-oriented programming, ecoop 2019

作者： Springer, Matthias Masuhara, Hidehiko Tokyo Institute of Technology Japan

ISBN: (纸本)9783959771115

object-oriented programming has long been regarded as too inefficient for SIMD high-performance computing, despite the fact that many important HPC applications have an inherent object structure. On SIMD accelerators, including GPUs, this is mainly due to performance problems with memory allocation and memory access: There are a few libraries that support parallel memory allocation directly on accelerator devices, but all of them suffer from uncoalesed memory accesses. We discovered a broad class of object-oriented programs with many important real-world applications that can be implemented efficiently on massively parallel SIMD accelerators. We call this class Single-Method Multiple-objects (SMMO), because parallelism is expressed by running a method on all objects of a type. To make fast GPU programming available to domain experts who are less experienced in GPU programming, we developed DynaSOAr, a CUDA framework for SMMO applications. DynaSOAr consists of (1) a fully-parallel, lock-free, dynamic memory allocator, (2) a data layout DSL and (3) an efficient, parallel do-all operation. DynaSOAr achieves performance superior to state-of-the-art GPU memory allocators by controlling both memory allocation and memory access. DynaSOAr improves the usage of allocated memory with a Structure of Arrays (SOA) data layout and achieves low memory fragmentation through efficient management of free and allocated memory blocks with lock-free, hierarchical bitmaps. Contrary to other allocators, our design is heavily based on atomic operations, trading raw (de)allocation performance for better overall application performance. In our benchmarks, DynaSOAr achieves a speedup of application code of up to 3x over state-of-the-art allocators. Moreover, DynaSOAr manages heap memory more efficiently than other allocators, allowing programmers to run up to 2x larger problem sizes with the same amount of memory. © Matthias Springer and Hidehiko Masuhara.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Foundations for virtual types 13th

引用

13th european conference on object-oriented programming, ecoop 1999

作者： Igarashi, Atsushi Pierce, Benjamin C. Department of Computer and Information Science University of Pennsylvania 200 South 33rd St PhiladelphiaPA19104 United States

ISBN: (纸本)3540661565

Virtual types have been proposed as a notation for generic programming in object-oriented languages|an alternative to the more familiar mechanism of parametric classes. The tradeoffs between the two mechanisms are a matter of current debate: for many examples, both appear to over convenient (indeed almost interchangeable) solutions;in other situations, one or the other seems to be more satisfactory. However, it has proved difficult to draw rigorous comparisons between the two approaches, partly because current proposals for virtual types vary considerably in their details, and partly because the proposals themselves are described rather informally, usually in the complicating context of full-scale language designs. Work on the foundations of object-oriented languages has already established a clear connection between parametric classes and the polymorphic functions found in familiar typed lambda-calculi. Our aim here is to explore a similar connection between virtual types and dependent records. We present, by means of examples, a straightforward model of objects with embedded type fields in a typed lambda-calculus with subtyping, type operators, fixed points, dependent functions, and dependent records with both "bounded" and "manifest" type fields (this combination of features can be viewed as a measure of the inherent complexity of virtual types). Using this model, we then discuss some of the major differences between previous proposals and show why some can be checked statically while others require run-time checks. We also investigate how the partial "duality" of virtual types and parametric classes can be understood in terms of translations between universal and (dependent) existential types. © Springer-Verlag Berlin Heidelberg 1999.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：