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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

458 篇 会议
24 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

323 篇 工学
- 254 篇 计算机科学与技术...
- 142 篇 软件工程
- 52 篇 电气工程
- 44 篇 信息与通信工程
- 34 篇 土木工程
- 20 篇 生物医学工程（可授...
- 17 篇 建筑学
- 16 篇 材料科学与工程（可...
- 15 篇 控制科学与工程
- 13 篇 仪器科学与技术
- 12 篇 机械工程
- 11 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 测绘科学与技术
- 10 篇 生物工程
- 6 篇 化学工程与技术
113 篇 理学
- 68 篇 数学
- 22 篇 物理学
- 20 篇 生物学
- 13 篇 统计学（可授理学、...
- 9 篇 化学
- 7 篇 地质学
- 7 篇 系统科学
- 6 篇 地球物理学
43 篇 管理学
- 23 篇 图书情报与档案管...
- 22 篇 管理科学与工程(可...
- 10 篇 工商管理
23 篇 医学
- 18 篇 临床医学
- 9 篇 特种医学
- 7 篇 医学技术（可授医学...
4 篇 农学
3 篇 经济学
3 篇 法学
3 篇 教育学
3 篇 文学

主题

98 篇 data structures
36 篇 data mining
22 篇 computer science
17 篇 clustering algor...
12 篇 algorithms
12 篇 internet
12 篇 algorithm design...
10 篇 structural healt...
10 篇 classification a...
10 篇 data models
9 篇 computer archite...
9 篇 image segmentati...
9 篇 protocols
9 篇 hardware
9 篇 partitioning alg...
8 篇 databases
7 篇 scalability
7 篇 deep learning
7 篇 costs
7 篇 machine learning

机构

5 篇 fujian prov univ...
5 篇 hubei univ techn...
4 篇 microsoft resear...
3 篇 chandigarh unive...
3 篇 wuhan fiberhome ...
2 篇 univ michigan an...
2 篇 institute of aer...
2 篇 engineer dxc tec...
2 篇 fermilab natl ac...
2 篇 southwest jiaoto...
2 篇 department of co...
2 篇 lovely professio...
2 篇 univ maryland de...
2 篇 int hellen univ ...
2 篇 aeronautics-tech...
2 篇 peking univ ctr ...
2 篇 lloyd institute ...
2 篇 nci frederick ca...
2 篇 college of engin...
2 篇 heriot watt univ...

作者

5 篇 ye zhiwei
3 篇 lehner wolfgang
2 篇 shatsky maxim
2 篇 monaco ernesto
2 篇 montenegro manue...
2 篇 catthoor francky
2 篇 scholz sven-bodo
2 篇 napoli amedeo
2 篇 tjortjis christo...
2 篇 chen chen
2 篇 thiele maik
2 篇 weifeng lv
2 篇 fischer ulrike
2 篇 yan lingyu
2 篇 praveen
2 篇 saxena sanjeev
2 篇 dror oranit
2 篇 tongyu zhu
2 篇 wolfson haim j.
2 篇 ouyang cheng

语言

476 篇 英文
4 篇 其他
2 篇 俄文
2 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Workshop on Algorithms and Data Structures"

共 485 条记录，以下是391-400 订阅

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

详细简洁

排序：

Combinatorial algorithms for data migration to minimize average completion time

引用

9th international workshop on Approximation algorithms for Combinatorial Optimization Problems/10th international workshop on Randomization and Computation

作者： Gandhi, Rajiv Mestre, Julian Rutgers State Univ Dept Comp Sci Camden NJ 08102 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA

ISBN: (纸本)3540380442

the data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, where vertices represent the storage devices, and the edges represent the data transfers required between pairs of devices. Each vertex has a non-negative weight, and each edge has unit processing time. A vertex completes when all the edges incident on it complete;the constraint is that two edges incident on the same vertex cannot be processed simultaneously. the objective is to minimize the sum of weighted completion times of all vertices. Kim (Journal of algorithms, 55:42-57, 2005) gave an LP-rounding 3-approximation algorithm. We give a more efficient primal-dual algorithm that achieves the same approximation guarantee, which can be extended to yield a 5.83-approximation for arbitrary processing times. We also study a variant of the open shop scheduling problem. this is a special case of the data migration problem in which the transfer graph is bipartite and the objective is to minimize the completion times of edges. We present a simple algorithm that achieves an approximation ratio of root 2 approximate to 1.414, thus improving the 1.796-approximation given by Gandhi et al.(ACM Transaction on algorithms, 2(1):116-129, 2006). We show that the analysis of our algorithm is almost tight.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Algorithm theory - SWAT 2006: 10th Scandinavian workshop on Algorithm theory, Proceedings

Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on ...

引用

10th Scandinavian workshop on Algorithm theory, SWAT 2006

ISBN: (纸本)354035753X

the proceedings contain 38 papers. the topics discussed include: top-down analysis of path compression: deriving the inverse-Ackermann bound naturally (and easily);results and problems on self-adjusting search trees and related data structures;multiplexing packets with arbitrary deadlines in bounded buffers;variable sized online interval coloring with bandwidth;a simpler linear-time recognition of circular-arc graphs;dynamic matching markets and voting paths;sorting by merging or merging by sorting?;finding the position of the k-mismatch and approximate tandem repeats;exponential time algorithms for the minimum dominating set problem on some graph classes;exact computation of maximum induced forest;on the approximation hardness of some generalizations of TSP;reoptimization of minimum and maximum traveling salesman's tours;and the node-weighted Steiner problem in graphs of restricted node weights.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Network overlays for efficient control of large scale dynamic groups 06

Network overlays for efficient control of large scale dynami...

引用

10th IEEE international Symposium on Distributed Simulation and Real-Time Applications

作者： Popescu, George V. Liu, Zhen *** ***

ISBN: (纸本)0769526977

Scalable data distribution in large-scale dynamic collaborative siwtems requires efficient, low overhead communication control. We propose here efficient algorithms fir clustering network nodes dynamically based on their communication interest. Several group communication architecture have been proposed to date without considering the constraints imposed by the communicution infrastructure. Among these, distributed hash tables are scalable and resilient data structures used for data dissemination control. However DHTs are not optimized for high dynamics of network node interest and real-time end-to-end performance requirements. this paper proposes efficient control algorithms for large-scale collaborative systems optimized for scalability as well as end-to-end data dissemination. Network node communication interest is modeled as a multi-dimensional attribute space partitioned into interest cells mapped to multicast communication groups. the proposed control algorithms use proximity based clustering of network nodes and hierarchical communication interest aggregation. We show that network overlay control algorithms achieve scalability and low, overhead with a controlled degradation of end-to-end data path performance.

关键词： Large-scale systems Communication system control Clustering algorithms Multicast algorithms Partitioning algorithms Collaboration Control systems Scalability data structures Multicast communication

来源：评论

学校读者我要写书评

暂无评论

Estimating structures of business process models from execution logs

Estimating structures of business process models from execut...

引用

10th IEEE international Enterprise Distributed Object Computing Conference (EDOC)

作者： Ogasawara, Shiro Tayama, Kenichi Yamamura, Tetsuya NTT Access Network Service Systems Laboratories NTT Corporation Japan

ISBN: (纸本)076952558X

Business Process Management (BPM) has been recognized to be important for Business Processes (BP) and enterprise information systems to continuously bring their benefits. Understanding actual BP models is a key step in BPM because predefined models are different from actual ones, which analysis and decision-making should stand on. However, it depends on costly interviews anal observations. In this paper, we propose a method of estimating actual BP model structures from execution logs in information systems for effortless BPM. this method can utilize practical execution logs and appropriately estimate structures compared with previously proposed methods. It can also reveal how each work order was transacted and routed so that exceptional situations can be investigated in detail. We apply it to a synthetic execution log and a real-world execution log, then demonstrate its validity in terms of algorithms and its usefulness in BPM. Our method makes it possible to attain continuous BPM.

关键词： Financial data processing

来源：评论

学校读者我要写书评

暂无评论

Damage detection algorithms and sensor systems for laminate composite beams

Damage detection algorithms and sensor systems for laminate ...

引用

Earth and Space 2006 - 10th Biennial international Conference on Engineering, Construction, and Operations in Challenging Environments

作者： Qiao, Pizhong Lestari, Wahyu Shah, Mitali G. Wang, Jialai Department of Civil Engineering University of Akron Akron OH 44325-3905 United States Integrated Smart Structures Inc. 2601 Twin Creek Dr. Copley OH 44321-1770 United States Department of Civil Engineering North Dakota State University Fargo ND 58105 United States

ISBN: (纸本)0784408300

In this paper, the experimentally measured data of two sensor systems (i.e., a surface-bonded piezoelectric sensor system and a non-contact scanning laser vibrometer (SLV) system) are studied, and three dynamics-based damage detection algorithms are evaluated. the curvature mode shapes are selected as a parameter to locate damage due to its sensitivity. the piezoelectric sensors directly acquire the curvature mode shapes of the structures, while the SLV measures the displacement mode shapes. the beam specimens are made of E-glass/epoxy composites, and several different types of damages are introduced in the beams (i.e., delaminations, impact and saw cut damage). this study provides a thorough assessment of the two sensor systems to damage detection of laminated composite beams and verify the validity of dynamics-based damage detection methodology for locating the local defects in composite structures. Copyright ASCE 2006.

关键词： Composite beams and girders

来源：评论

学校读者我要写书评

暂无评论

Top-down analysis of path compression: Deriving the inverse-Ackermann bound naturally (and easily)

Top-down analysis of path compression: Deriving the inverse-...

引用

10th Scandinavian workshop on Algorithm theory (SWAT 2006)

作者： Seidel, Raimund Univ Saarland Fachrichtung Informat D-66123 Saarbrucken Germany

ISBN: (纸本)354035753X

Path compression is used in a number of algorithms, most notably in various very natural solutions to the so-called Union-Find problem. this problem is basic and important enough to be covered in most introductory courses and textbooks on algorithms and data structures. However the performance analysis of the solutions is more often than not at best incomplete if not omitted altogether. Already the definition of the function a, the interesting constituent of the time bound, as a quasi inverse of the Ackermann function is complicated and not easy to understand. All the previous analyses of path compression proceed in a bottom-up fashion, employing rather intricate charging schemes, sometimes cloaked in the language of potential functions for amortized analysis, and they need to introduce the Ackermann function beforehand in order to be properly formulated. I will present a new [1], rather easy way of analyzing the running times of union-find algorithms. It is based on a relatively simple top-down approach and naturally leads by itself to this famous "Inverse Ackermann" function without ever having to talk about the Ackermann function itself. I will discuss how this top-down approach can also be made to work for related procedures such as path compaction. Finally I will consider the case of moderately sized instances and will derive some explicit, rather small upper bounds on the number of pointer changes. © Springer-Verlag Berlin Heidelberg 2006.

关键词： data compression

来源：评论

学校读者我要写书评

暂无评论

ProFusion2 - towards a modular, robust and reliable fusion architecture for automotive environment perception

ProFusion2 - towards a modular, robust and reliable fusion a...

引用

10th international Forum on Advanced Microsystems for Automotive Applications

作者： Tatschke, T. Park, S. -B. Amditis, A. Scheunert, U. Aycard, O. Univ Passau FORWISS D-94036 Passau Germany

ISBN: (纸本)3540334092

this publication focuses on a modular architecture for sensor data fusion regarding to research work of common interest related to sensors and sensor data fusion. this architecture will be based on an extended environment model and representation, consisting of a set of common data structures for sensor, object and situation refinement data and algorithms as well as the corresponding models. the aim of such research is to contribute to a measurable enhancement of the output performance provided by multi-sensor systems in terms of actual availability, reliability, accuracy and precision of the perception results. In this connection, investigations towards fusion concepts and paradigms, such as 'redundant' and 'complementary', as well as 'early' and track-based sensor data fusion approaches, are conducted, in order to significantly enhance the overall performance of the perception system.

关键词： sensor data fusion environment perception fusion framework environment modelling early fusion multi level fusion grid-based fusion track-based fusion fusion feedback ProFusion2

来源：评论

学校读者我要写书评

暂无评论

引用

10th international Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006

作者： Jiyuan, An Chen, Yi-Ping Phoebe School of Information Technology Deakin University Vic. 3125 Australia Australian Research Council Centre in Bioinformatics Australia

ISBN: (纸本)3540465375

Accurate prediction of protein structures is very important for many applications such as drug discovery and biotechnology. Building side chains is an essential to get any reliable prediction of the protein structure for any given a protein main chain conformation. Most of the methods that predict side chain conformations use statistically generated data from known protein structures. It is a computationally intractable problem to search suitable side chains from all possible rotamers simultaneously using information of known protein structures. Reducing the number of possibility is a main issue to predict side chain conformation. this paper proposes an enumeration based similarity search algorithm to predict side chain conformations. By introducing "beam search" technique, a significant number of unrelated side chain rotamers can easily be eliminated. As a result, we can search for suitable residue side chains from all possible side chain conformations. © Springer-Verlag Berlin Heidelberg 2006.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

A Pattern Classification Method Based on a Space-Variant CNN Template

A Pattern Classification Method Based on a Space-Variant CNN...

引用

IEEE international workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： G. Costantini D. Casali M. Carota Department of Electronic Engineering University of Roma Tor Vergata Rome Italy

A novel algorithm for unsupervised classification of datasets made up of integer valued patterns by means of cellular neural network (CNN) is proposed. the algorithm is suited both for linearly separable and nonlinearly separable data sets. the adopted CNN is n-dimensional and is based on a space-variant template - neighborhood order 1 - to cluster n-dimensional datasets. the choice of a CNN architecture allows a straightforward hardware implementation, particularly suited for bi-dimensional patterns

关键词： Pattern classification Cellular neural networks Clustering algorithms Hardware data engineering Electronic mail Density functional theory Classification algorithms Neural networks Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Color Processing in Wearable Bionic Eyeglass

Color Processing in Wearable Bionic Eyeglass

引用

IEEE international workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： Robert Wagner Mihaly Szuhaj Pázmány Péter Catholic University Hungary Hungarian National Association of Blind and Visually Impaired People Budapest Hungary

this paper presents color processing tasks of the bionic eyeglass project, which helps blind people to gather chromatic information. A color recognition method is presented, which specifies the colors of the objects on the scene. the method adapts to varying illumination and smooth shadow on the objects. It performs local adaptation on the intensity and global chromatic adaptation. Another method is also shown that improves the extraction of display data based on chromatic information

关键词： Color Displays data mining Computer architecture Cellular neural networks Layout Retina Cellular networks Clustering algorithms Lighting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 36 37 38 39 40 41 42 43 44 45 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：