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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

52 篇 会议
7 册 图书
4 篇 期刊文献

馆藏范围

62 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

43 篇 工学
- 33 篇 计算机科学与技术...
- 20 篇 软件工程
- 7 篇 电气工程
- 5 篇 仪器科学与技术
- 4 篇 核科学与技术
- 3 篇 信息与通信工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 农业工程
- 1 篇 生物工程
16 篇 理学
- 9 篇 数学
- 5 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 生物学
4 篇 管理学
- 4 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
2 篇 医学
- 2 篇 临床医学
1 篇 农学
- 1 篇 作物学

主题

21 篇 data structures
10 篇 boolean function...
5 篇 computer science
5 篇 binary decision ...
3 篇 information syst...
3 篇 data mining
3 篇 computational mo...
3 篇 discrete mathema...
3 篇 algorithm design...
3 篇 explosions
3 篇 algorithm analys...
3 篇 state-space meth...
2 篇 runtime
2 篇 reachability ana...
2 篇 query processing
2 篇 background elimi...
2 篇 visualisation
2 篇 discrete event s...
2 篇 deconvolution
2 篇 data processing

机构

2 篇 cern european or...
2 篇 slovak acad sci ...
2 篇 inst space sci r...
1 篇 department infor...
1 篇 informatics divi...
1 篇 department of ma...
1 篇 univ lille 1 ctr...
1 篇 univ la habana f...
1 篇 suny binghamton ...
1 篇 univ london impe...
1 篇 hong kong polyte...
1 篇 tongji univ dept...
1 篇 department of co...
1 篇 friedrich-schill...
1 篇 ctr carinthian t...
1 篇 geophysical depa...
1 篇 imec vzw b-3001 ...
1 篇 natl aerospace l...
1 篇 department of ma...
1 篇 the 8th research...

作者

3 篇 gustavson fred g...
2 篇 kliman j
2 篇 waśniewski jerzy
2 篇 krupa l
2 篇 gheata a
2 篇 frank dehne
2 篇 morhác m
2 篇 jandel m
2 篇 turzo i
2 篇 gheata m
2 篇 brun r
2 篇 matousek v
1 篇 durairaj v
1 篇 vollert natalie
1 篇 franceschini g
1 篇 cierniak m.
1 篇 gujral ekta
1 篇 yongning tang
1 篇 augustin m. j.
1 篇 tenenhaus arthur

语言

59 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th International Workshop on Algorithms and Data Structures, WADS 2003"

共 63 条记录，以下是21-30 订阅

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

详细简洁

排序：

Novel data formats and algorithms for dense linear algebra computations: Minisymposium abstract

Novel data formats and algorithms for dense linear algebra c...

引用

8th international workshop on Applied Parallel Computing, PARA 2006

作者： Gustavson, Fred G. Waśniewski, Jerzy IBM T.J. Watson Research Center New York NY United States Umeå University Sweden Technical University of Denmark Lyngby Denmark

ISBN: (纸本)9783540757542

Recently, recursion was introduced into the area of Dense Linear Algebra with the intent of producing new algorithms as well as improving its existing algorithms. Recursion, via the divide-and-conquer paradigm, introduced variable blocking to complement the standard fixed block algorithms. In particular, new data structures for dense linear algebra became an active research area. this minisymposium focuses on both new data structures and/or new or existing algorithms for high performing dense linear algebra algorithms. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

data dependence analysis for the parallelization of numerical tree codes

Data dependence analysis for the parallelization of numerica...

引用

8th international workshop on Applied Parallel Computing, PARA 2006

作者： Zumbusch, Gerhard Friedrich-Schiller-Universität Jena Institut für Angewandte Mathematik Ernst-Abbe-Platz 2 07743 Jena Germany

ISBN: (纸本)9783540757542

data dependence analysis for automatic parallelization of sequential tree codes is discussed. Hierarchical numerical algorithms often use tree data structures for unbalanced, adaptively and dynamically created trees. Moreover, such codes often do not follow a strict divide and conquer concept, but introduce some geometric neighborhood data dependence in addition to parent-children dependencies. Hence, recognition mechanisms and hierarchical partition strategies of trees are not sufficient for automatic parallelization. Generic tree traversal operators are proposed as a domain specific language. Additional geometric data dependence can be specified by code annotation. A code transformation system with data dependence analysis is implemented, which generates several versions of parallel codes for different programming models. © Springer-Verlag Berlin Heidelberg 2007.

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

Minimal data copy for dense linear algebra factorization

Minimal data copy for dense linear algebra factorization

引用

8th international workshop on Applied Parallel Computing, PARA 2006

作者： Gustavson, Fred G. Gunnels, John A. Sexton, James C. IBM T. J. Watson Research Center Yorktown Heights NY 10598 United States

ISBN: (纸本)9783540757542

the full format data structures of Dense Linear Algebra hurt the performance of its factorization algorithms. Full format rectangular matrices are the input and output of level the 3 BLAS. It follows that the LAPACK and Level 3 BLAS approach has a basic performance flaw. We describe a new result that shows that representing a matrix A as a collection of square blocks will reduce the amount of data reformating required by dense linear algebra factorization algorithms from O(n3) to O(n2). On an IBM Power3 processor our implementation of Cholesky factorization achieves 92% of peak performance whereas conventional full format LAPACK DPOTRF achieves 77% of peak performance. All programming for our new data structures may be accomplished in standard Fortran, through the use of higher dimensional full format arrays. thus, new compiler support may not be necessary. We also discuss the role of concatenating submatrices to facilitate hardware streaming. Finally, we discuss a new concept which we call the L1 / L0 cache interface. © Springer-Verlag Berlin Heidelberg 2007.

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

8th international workshop on algorithms and data structures, wads 2003

引用

8th international workshop on algorithms and data structures, wads 2003

ISBN: (纸本)3540405453

the proceedings contain 44 papers. the special focus in this conference is on algorithms and data structures. the topics include: Shape segmentation and matching with flow discretization;phylogenetic reconstruction from gene-rearrangement data with unequal gene content;common-deadline lazy bureaucrat scheduling problems;bandwidth-constrained allocation in grid computing;algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection;fast algorithms for a class of temporal range queries;optimal worst-case operations for implicit cache-oblivious search trees;extremal configurations and levels in pseudoline arrangements;fast relative approximation of potential fields;integrated prefetching and caching with read and write requests;online seat reservations via offline seating arrangements;routing and call control algorithms for ring networks;algorithms and models for railway optimization;approximation of rectilinear Steiner trees with length restrictions on obstacles;cropping-resilient segmented multiple watermarking;on simultaneous planar graph embeddings;approximation algorithm for hotlink assignments in web directories;drawing graphs with large vertices and thick edges;semi-matchings for bipartite graphs and load balancing;sorting circular permutations by reversal;an improved bound on Boolean matrix multiplication for highly clustered data;real two dimensional scaled matching;the zigzag path of a pseudo-triangulation;improved approximation algorithms for the quality of service Steiner tree problem;a model for analyzing black-box optimization;on the hausdorff voronoi diagram of point clusters in the plane;significant-presence range queries in categorical data and parameterized complexity of directed feedback set problems in tournaments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rectangular full packed format for LAPACK algorithms timings on several computers

Rectangular full packed format for LAPACK algorithms timings...

引用

8th international workshop on Applied Parallel Computing, PARA 2006

作者： Gustavson, Fred G. Waśniewski, Jerzy IBM T.J. Watson Research Center Yorktown Heights NY 10598 United States Informatics and Mathematical Modeling Technical University of Denmark DK-2800 Lyngby Denmark

ISBN: (纸本)9783540757542

We describe a new data format for storing triangular and symmetric matrices called RFP (Rectangular Full Packed). the standard two dimensional arrays of Fortran and C (also known as full format) that are used to store triangular and symmetric matrices waste nearly half the storage space but provide high performance via the use of level 3 BLAS. Standard packed format arrays fully utilize storage (array space) but provide low performance as there are no level 3 packed BLAS. We combine the good features of packed and full storage using RFP format to obtain high performance using L3 (level 3) BLAS as RFP is full format. Also, RFP format requires exactly the same minimal storage as packed format. Each full and/or packed symmetric/triangular routine becomes a single new RFP routine. We present LAPACK routines for Cholesky factorization, inverse and solution computation in RFP format to illustrate this new work and to describe its performance on the IBM, Itanium, NEC, and SUN platforms. Performance of RFP versus LA-PACK full routines for both serial and SMP parallel processing is about the same while using half the storage, Performance is roughly one to a factor of 33 for serial and one to a factor of 100 for SMP parallel times faster than LAPACK packed routines. Existing LAPACK routines and vendor LAPACK routines were used in the serial and the SMP parallel study, respectively. In both studies vendor L3 BLAS were used. © Springer-Verlag Berlin Heidelberg 2007.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Relational Methods in Computer Science - 8th international Seminar on Relational Methods in Computer Science, 3rd international workshop on Applications of Kleene Algebra and workshop of COST Action 274: TARSKI

引用

8th international Seminar on Relational Methods in Computer Science, 3rd international workshop on Applications of Kleene Algebra and workshop of COST Action 274: TARSKI

ISBN: (纸本)3540333398

the proceedings contain 19 papers. the topics discussed include: topological representation of precontact algebras;relational semantics through duality;duality theory for projective algebras;relational approach to Boolean logic problems;static analysis of programs using omega algebra with tests;weak contact structures;on relational cycles;a framework for Kleene algebra with an embedded structure;non-termination in unifying theories of programming;towards an algebra of hybrid systems;relational correspondences for lattices with operators;control-flow semantics for assembly-level data-flow graphs;relational implementation of simple parallel evolutionary algorithms;lattice-based paraconsistent logic;verification of pushdown systems using omega algebra with domain;relational representability for algebras of substructural logics;Knuth-Bendix completion as a data structure;and time-dependent contact structures in Goguen categories.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

Knuth-Bendix completion as a data structure

引用

8th international Seminar on Relational Methods in Computer Science, 3rd international workshop on Applications of Kleene Algebra and workshop of COST Action 274: TARSKI

作者： Struth, Georg Fakultät für Informatik Universität der Bundeswehr München

ISBN: (纸本)3540333398

We propose a cooperating Knuth-Bendix completion procedure for transitive relations and equivalences and apply it as a data structure for novel dynamic strongly connected component algorithms. Benefits are separation of declarative and procedural concerns, simple generic specifications and flexible optimisation via execution strategies. © Springer-Verlag Berlin Heidelberg 2006.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Efficient reachability analysis on modular discrete-event systems using binary decision diagrams

Efficient reachability analysis on modular discrete-event sy...

引用

international workshop on Discrete Event Systems, WODES

作者： M. Byrod B. Lennartson A. Vahidi K. Akesson Automation Research Group Department of Signals and Systems Chalmers University of Technology Goteborg Sweden

A well known strategy for handling the exponential complexity of modular discrete event systems is to represent the state space symbolically, using binary decision diagrams (BBDs). In this paper, key success factors in the design of efficient BDD-based reachability algorithms for synthesis and verification are discussed. It is also shown how the modular structure of a discrete event system (DES) can be utilized by taking advantage of the process communication graph and partitioning techniques. A reachability algorithm based on these principles is discussed and a proof of correctness for the algorithm is given

关键词： Reachability analysis Discrete event systems data structures Boolean functions Partitioning algorithms Binary decision diagrams State-space methods Algorithm design and analysis Automata Space exploration

来源：评论

学校读者我要写书评

暂无评论

Symbolic Synthesis and Verification of Hierarchical Interface-based Supervisory Control

Symbolic Synthesis and Verification of Hierarchical Interfac...

引用

international workshop on Discrete Event Systems, WODES

作者： Raoguang Song R.J. Leduc Department of Computing and Software McMaster University Canada

Hierarchical interface-based supervisory control (HISC) decomposes a discrete-event system (DES) into a high-level subsystem which communicates with n ges 1 low-level subsystems, through separate interfaces which restrict the interaction of the subsystems. It provides a set of local conditions that can be used to verify global conditions such as nonblocking and controllability. the current HISC verification and synthesis algorithms are based upon explicit state and transition listings which limit the size of a given level to about 10 7 states when 1GB of memory is used. In this paper, we extend the HISC approach by introducing a set of predicate based fixed point operators that allow us to do a per level synthesis to construct for each level a maximally permissive supervisor that satisfies the corresponding HISC conditions. We prove that these fixpoint operators compute the required level-wise supremal languages. We then present algorithms that implement the fixpoint operators. Based on these algorithms, a symbolic implementation is briefly discussed which can be implemented using binary decision diagrams. We also discuss a method to implement our synthesized supervisors in a more compact manner. A large manufacturing system example (worst case state space on the order of 10 30 ) extended from the ALP example is briefly discussed. the example showed that we can now handle a given level with a statespace as large as 10 15 states, using less than 160MB of memory. this represents a significant improvement in the size of systems that can be handled by the HISC approach. A software tool for synthesis and verification of HISC systems using our approach was also developed

关键词： Supervisory control Binary decision diagrams Control system synthesis Discrete event systems State-space methods Computer interfaces data structures Boolean functions Control systems Explosions

来源：评论

学校读者我要写书评

暂无评论

Optimal worst-case operations for implicit cache-oblivious search trees

引用

8th international workshop on algorithms and data structures (wads 2003)

作者： Franceschini, G Grossi, R Univ Pisa Dipartimento Informat I-56127 Pisa Italy

ISBN: (纸本)3540405453

We close an open issue on dictionaries dating back to the sixthies. An array of n keys can be sorted so that searching takes 0(log n) time. Alternatively, it can be organized as a heap so that inserting and deleting keys take O(log n) time. We show that these bounds can be simultaneously achieved in the worst case for searching and updating by suitably maintaining a permutation of the n keys in the array. the resulting data structure is called implicit as it uses just 0(l) extra memory cells beside the n cells for the array. the data structure is also cacheoblivious, attaining O(log(B) n) block transfers in the worst case for any (unknown) value of the block size B, without wasting any single cell of memory at any level of the memory hierarchy.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：