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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

76 篇 期刊文献
39 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

85 篇 工学
- 39 篇 计算机科学与技术...
- 33 篇 电气工程
- 12 篇 信息与通信工程
- 10 篇 软件工程
- 9 篇 机械工程
- 9 篇 控制科学与工程
- 8 篇 动力工程及工程热...
- 6 篇 力学（可授工学、理...
- 4 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
- 1 篇 地质资源与地质工...
- 1 篇 石油与天然气工程
- 1 篇 交通运输工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
44 篇 理学
- 21 篇 数学
- 10 篇 统计学（可授理学、...
- 7 篇 物理学
- 4 篇 系统科学
- 3 篇 地球物理学
- 3 篇 生物学
- 2 篇 化学
- 1 篇 地质学
11 篇 管理学
- 10 篇 管理科学与工程(可...
6 篇 经济学
- 6 篇 应用经济学
6 篇 医学
- 3 篇 临床医学
- 2 篇 公共卫生与预防医...
- 1 篇 基础医学(可授医学...

主题

116 篇 sequential algor...
8 篇 parallel algorit...
6 篇 algorithms
4 篇 parallel algorit...
3 篇 parallel process...
3 篇 recursive algori...
3 篇 parallel computi...
3 篇 instruction sets
3 篇 gpu
2 篇 power demand
2 篇 object detection
2 篇 parallel archite...
2 篇 coin-weighing pr...
2 篇 mimo radar
2 篇 approximation al...
2 篇 deep learning
2 篇 irregular shape
2 篇 computational co...
2 篇 telecommunicatio...
2 篇 target tracking

机构

3 篇 henan normal uni...
3 篇 feng chia univ d...
2 篇 univ calgary dep...
2 篇 univ michigan de...
2 篇 soonchunhyang un...
2 篇 natl kaohsiung u...
2 篇 univ surrey sch ...
2 篇 univ michigan de...
1 篇 univ tsukuba doc...
1 篇 wenzhou med univ...
1 篇 lmee f-91020 evr...
1 篇 cairo univ fac e...
1 篇 boston univ dept...
1 篇 australian natl ...
1 篇 umpc fac pierre ...
1 篇 queens univ belf...
1 篇 northeastern uni...
1 篇 univ london impe...
1 篇 china merchants ...
1 篇 virginia polytec...

作者

3 篇 wang chi-chang
3 篇 liu wen an
2 篇 yang ching-yu
2 篇 yang yang
2 篇 lachapelle g
2 篇 chamanbaz mohamm...
2 篇 bouffanais rolan...
2 篇 jaenicke a
2 篇 imani sadjad
2 篇 jeon cw
2 篇 mclauchlan pf
1 篇 murata n
1 篇 chevallier m.
1 篇 hyung wook noh
1 篇 yi zhi
1 篇 gao furong
1 篇 cho gi sung
1 篇 sooyeul lee
1 篇 hong donglin
1 篇 jose antonio uri...

语言

97 篇 英文
16 篇 其他
2 篇 中文
1 篇 土耳其文

检索条件"主题词=Sequential Algorithm"

共 116 条记录，以下是81-90 订阅

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

详细简洁

排序：

Geodetic Iterative Methods for Nonlinear Acoustic Sources Localization: Application to Cracks Effects Detected with Acoustic Emission 6

Geodetic Iterative Methods for Nonlinear Acoustic Sources Lo...

引用

6th International Workshop of NDT Experts on NDT in Progress

作者： Zavesky, Michal Kus, Vaclav Czech Tech Univ Fac Nucl Sci & Phys Engn Dept Math Trojanova 13 Prague 12000 EU Czech Republic

ISBN: (纸本)9788021443396

This paper is related to Acoustic Emission (AE) principle, which is a Nondestructive Testing method (NDT) for structural health monitoring and many other applications. We deal with the geodetic curve based localization of the defects on surfaces of solid bodies mathematically described as a conjunction of several simpler parametrized shapes like cylinders, toroids, spheres, cones,... with intersections. We demonstrate a numerical solution of geodesic equations by the algorithm NewtonRaphson method. For faster computations we propose a few improvements using sequential algorithm applied to bisected points of the intersections, which is compared with trivial Fundamental method. The whole algorithm for finding geodesics on combined surfaces is applied to virtual testing body which was designed according to the solid watering can.

关键词： Acoustic emission geodetic curve geodesic equations Newton-Raphson method sequential algorithm

来源：评论

学校读者我要写书评

暂无评论

A GPU Implementation of Parallel Constraint-based Local Search

A GPU Implementation of Parallel Constraint-based Local Sear...

引用

22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Arbelaez, Alejandro Codognet, Philippe Natl Univ Ireland Univ Coll Cork INSIGHT Ctr Data Analyt Corcaigh Ireland Univ Tokyo Dept Comp Sci UPMC JFLICNRS Tokyo 1138654 Japan

ISBN: (纸本)9781479927289

In this paper we study the performance of constraint-based local search solvers on a GPU. The massively parallel architecture of the GPU makes it possible to explore parallelism at two different levels inside the local search algorithm. First, by executing multiple copies of the algorithm in a multiwalk manner and, second, by evaluating large neighborhoods in parallel in a single-walk manner. Experiments on three well-known problem benchmarks indicate that the current GPU implementation is up to 17 times faster than a well-tuned sequential algorithm implemented on a desktop computer.

关键词： graphics processing units parallel architectures search problems GPU massively parallel architecture parallel constraint-based local search sequential algorithm Benchmark testing Graphics processing units Instruction sets Memory management Optimized production technology Random access memory Search problems CSP GPU Local Search

来源：评论

学校读者我要写书评

暂无评论

A Highly Parallel Reuse Distance Analysis algorithm on GPUs

A Highly Parallel Reuse Distance Analysis Algorithm on GPUs

引用

26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Cui, Huimin Yi, Qing Xue, Jingling Wang, Lei Yang, Yang Feng, Xiaobing Chinese Acad Sci SKL Comp Architecture Inst Comp Technol Beijing Peoples R China Univ Texas CAS Dept Comp Sci San Antonio TX USA Univ New South Wales Sch Comp Sci & Engn Sydney NSW Australia

ISBN: (纸本)9780769546759

Reuse distance analysis is a runtime approach that has been widely used to accurately model the memory system behavior of applications. However, traditional reuse distance analysis algorithms use tree-based data structures and are hard to parallelize, missing the tremendous computing power of modern architectures such as the emerging GPUs. This paper presents a highly-parallel reuse distance analysis algorithm (HP-RDA) to speedup the process using the SPMD execution model of GPUs. In particular, we propose a hybrid data structure of hash table and local arrays to flatten the traditional tree representation of memory access traces. Further, we use a probabilistic model to correct any loss of precision from a straightforward parallelization of the original sequential algorithm. Our experimental results show that using an NVIDIA GPU, our algorithm achieves a factor of 20 speedup over the traditional sequential algorithm with less than 1% loss in precision.

关键词： Reuse reuse modern architectures Data structures sequential algorithm Hash table Precision Probabilistic Model Runtime Speeding algorithms

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient control algorithms for switching fabrics 16

An energy-efficient control algorithms for switching fabrics

引用

16th International Telecommunications Network Strategy and Planning Symposium (Networks)

作者： Zal, Mariusz Wojtysiak, Przemyslaw Poznan Univ Tech Chair Commun & Comp Networks PL-64980 Poznan Poland

ISBN: (纸本)9781479965151

In this paper we present the way of saving electrical energy in high-tech telecommunication and computer networks. To achieve this aim, the work focuses on the description of the current state and the future trends of changes, as well as it analyses the possibility of energy-saving solutions based on the Clos switching network architectures used in switching networks. A simulation program has been implemented to estimate multi-stage switching system energy consumption. This program enabled to check the operating quality (how much energy was saved by the structure during packet forwarding or rejecting), routing algorithms (sequential algorithm, quasi-random algorithm and Benes algorithm) and their modifications that optimize the achieved results.

关键词： energy conservation energy consumption environmental factors multistage interconnection networks telecommunication network routing Benes? algorithm Clos switching network architecture computer network electrical energy energy-efficient control algorithm energy-saving solution high-tech telecommunication network multistage switching system quasirandom algorithm routing algorithm sequential algorithm switching fabrics Energy consumption Power demand Switches Telecommunications Turning energy consumption computer network sequential algorithm electrical energy multistage interconnection networks Routing algorithms Telecommunications Power demand telecommunication network routing Switches Turning Energy conservation Computer algorithms Textile fabrics fabric

来源：评论

学校读者我要写书评

暂无评论

Less is More: Video Trimming for Action Recognition

Less is More: Video Trimming for Action Recognition

引用

IEEE International Conference on Computer Vision (ICCV)

作者： Antic, Borislav Milbich, Timo Ommer, Bjoern Heidelberg Univ Heidelberg Collaboratory Image Proc D-69115 Heidelberg Germany

ISBN: (纸本)9781479930227

Action recognition is an important precursor for understanding human activities in videos. The current paradigm of action recognition is to classify a video sequence as a whole. However, actions usually occur only in part of a video sequence, rendering the rest of the video irrelevant for action recognition. In this paper, we propose a method for learning a subsequence classifier which can detect and classify part of a video that corresponds to the action. The subsequence classifier is trained from weakly labeled training videos whose subsequence labels are not provided, but need to be inferred during learning. We use the framework of multiple instance learning to solve two problems jointly: i) find the action subsequences in training videos, ii) train the subsequence classifier using the inferred action subsequences. To obtain a robust solution to the MIL problem, we propose a sequential algorithm that consecutively decreases the number of inferred action subsequences per video and trims their length until only one short subsequence is used as the action representative in each video. We evaluate the combination of the automatically trained subsequence classifier and the full sequence classifier on the very challenging Hollywood2 benchmark set and observe a significant gain in the performance over the baseline full sequence classifier. Moreover, a favorable performance of the subsequence classifier for temporal localization of actions in videos is evidenced on two categories of the Hollywood2 dataset.

关键词： action recognition multiple instance learning video analysis Videotapes Classifiers Video sequences Action trimmings VIDEO ANALYSIS Training Videos Recognition (Psychology) sequential algorithm Robust solution

来源：评论

学校读者我要写书评

暂无评论

GPU-based Computing of Repeated Range Queries over Moving Objects

GPU-based Computing of Repeated Range Queries over Moving Ob...

引用

22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Silvestri, Claudio Lettich, Francesco Orlando, Salvatore Jensen, Christian S. Univ Ca Foscari Venice Italy Aarhus Univ DK-8000 Aarhus C Denmark

ISBN: (纸本)9781479927289

In this paper we investigate the use of GPUs to solve a data-intensive problem that involves huge amounts of moving objects. The scenario which we focus on regards objects that continuously move in a 2D space, where a large percentage of them also issues range queries. The processing of these queries entails a large quantity of objects falling into the range queries to be returned. In order to solve this problem by maintaining a suitable throughput, we partition the time into ticks, and defer the parallel processing of all the objects events (location updates and range queries) occurring in a given tick to the next tick, thus slightly delaying the overall computation. We process in parallel all the events of each tick by adopting an hybrid approach, based on the combined use of CPU and GPU, and show the suitability of the method by discussing performance results. The exploitation of a GPU allow us to achieve a speedup of more than 20x on several datasets with respect to the best sequential algorithm solving the same problem. More importantly, we show that the adoption of new bitmap-based intermediate data structure we propose to avoid memory access contention entails a 10x speedup with respect to naive GPU based solutions.

关键词： data structures graphics processing units parallel processing query processing 2D space GPU-based computing bitmap-based intermediate data structure data-intensive problem hybrid approach location updates moving objects objects events parallel processing query processing repeated range queries sequential algorithm Computer architecture Graphics processing units Indexes Instruction sets Microprocessors Pipelines Synchronization bitmap gpgpu gpu workload distribution lock-free data structures moving objects repeated range queries uniform grids

来源：评论

学校读者我要写书评

暂无评论

High Performance Online Key Performance Indicator's Calculations in Oil Refineries 23

High Performance Online Key Performance Indicator's Calculat...

引用

23nd Signal Processing and Communications Applications Conference (SIU)

作者： Bakir, Mustafa Sevilgen, Fatih Erdogan TUPRAS Genel Mudurluk Surec Gelistirme & Yazilim Mudurlugu Batman Merkez Batman Turkey Gebze Tekn Univ Bilgisayar Muhendisligi Gebze Turkey

ISBN: (纸本)9781467373869

It is critical in Oil Refineries to monitor the process online by several departments with respect to various perspectives. Key performance indicators generated by conversion of sensor - based measurements into meaningful data fulfill this requirement. However, the performance indicators must be provided to the users online. In this article, we discuss code optimization and parallelization of key performance indicator's calculation. By using these methods we obtained %696 improvement against the initial algorithm and %55 improvement against the optimal sequential algorithm in the performance of the system.

关键词： petroleum refinery performance indicators code optimization sequential algorithm parallelization Departments

来源：评论

学校读者我要写书评

暂无评论

Restructuring and Implementations of 2D Matrix Transpose algorithm Using SSE4 Vector Instructions 1

Restructuring and Implementations of 2D Matrix Transpose Alg...

引用

International Conference on Applied Research in Computer Science and Engineering (ICAR)

作者： Zekri, Ahmed S. Beirut Arab Univ Fac Sci Dept Math & Comp Sci Beirut Lebanon

ISBN: (纸本)9781467385435

Current general-purpose processors are augmented with vector instructions that can process many elements of matrices and vectors in parallel. Transposing a matrix in-place is a main kernel operation required by many scientific and engineering applications to shuttle data before, during, or after processing. This operation increases the traffic on the memory bus and hence clever techniques such as blocking are required to enhance the performance. In this paper, we present an enhanced version of a previously published algorithm for transposing a matrix on a two-dimensional processor arrays. We restructured this algorithm to fit the one-dimensional vector register architecture augmented to general-purpose CPUs. We implemented the new vector algorithm using Intel SSE4 vector instruction set and compare its performance with the standard sequential algorithm in addition to an already employed implementation of Ekhlundh's algorithm. We also studied the automatic compiler optimizations and their effect on the vectorization of the algorithm. The best of our implementations showed a maximum speedup of 1.6 compared with the sequential algorithm, and an almost equal performance compared with Eklundh's algorithm implementation.

关键词： instruction sets mathematics computing matrix algebra optimising compilers parallel processing 2D matrix transpose algorithm Ekhlundh algorithm Intel SSE4 vector instruction set automatic compiler optimization general-purpose CPU general-purpose processor memory bus one-dimensional vector register architecture standard sequential algorithm two-dimensional processor arrays Kernel Multicore processing Parallel processing Program processors Registers Signal processing algorithms Yttrium PARALLEL PROCESSING (COMPUTERS) instruction sets mathematics computing Program processors Signal processing algorithms Registers matrix algebra Rare earths yttrium sequential algorithm Kernel general processor

来源：评论

学校读者我要写书评

暂无评论

Policy-based access control framework for large networks

Policy-based access control framework for large networks

引用

8th IEEE International Conference on Networks (ICON 2000)

作者： Duan, HX Wu, JP Li, X Tsing Hua Univ Network Res Ctr Beijing Peoples R China

ISBN: (纸本)0769507778

Efforts of this paper focus on the issues about management and throughput of firewalls (or screening routers) applied in transit networks. On the one hand, manual configuration of large amount of firewalls distributed in many access points can not meet the global security requirements in the open and dynamic environment. On the other hand, the ordinal lookup of filtering rules in each individual firewall results in great decrease of throughput. Aimed at a typical transit network and its security policy requirements, a policy-based access control framework (PACF) is proposed in this paper. This framework is based on three levels of abstract access control policy: organizational access control policy (OACP), global access control policy (GACP) and local access control policy (LACP). The GACP, which comes from the results of IDSes and search engines according to OACP, is automatically and dynamically distributed to firewalls as LACPs. Each LACP is then enforced by an individual firewall. Some key algorithms for distribution of GACP and enforcement of LACP are described. A hash-based algorithm is proposed, for lookup of filtering rules in LACP. Under the environment with policy requirements described in this paper the new algorithm reduces the time complexity of lookup from O (N) of traditional sequential algorithm to O (1), which therefore increases largely the throughput of firewalls.

关键词： access control telecommunication network management telecommunication network routing authorisation cryptography table lookup computational complexity search engines telecommunication security policy based access control large networks firewalls management firewalls throughput screening routers transit networks global security requirements open environment dynamic environment ordinal lookup filtering rules security policy requirements policy-based access control framework organizational access control policy global access control policy local access control policy IDSes search engines key algorithms hash-based algorithm time complexity reduction sequential algorithm

来源：评论

学校读者我要写书评

暂无评论

sequential LOCAL FRI SAMPLING OF INFINITE STREAMS OF DIRACS

SEQUENTIAL LOCAL FRI SAMPLING OF INFINITE STREAMS OF DIRACS

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Jon Onativia Jose Antonio Uriguen Pier Luigi Dragotti Department of Electrical and Electronic Engineering Imperial College London

ISBN: (纸本)9781479903573

The theory of sampling signals with finite rate of innovation (FRI) has shown that it is possible to perfectly recover classes of non-bandlimited signals such as streams of Diracs from uniform samples. Most of previous papers, however, have to some extent only focused on the sampling of periodic or finite duration signals. In this paper we propose a novel method that is able to reconstruct infinite streams of Diracs, even in high noise scenarios. We sequentially process the discrete samples and output locations and amplitudes of the Diracs in real-time. We first establish conditions for perfect reconstruction in the noiseless case and then present the sequential algorithm for the noisy scenario. We also show that we can achieve a high reconstruction accuracy of 1000 Diracs for SNRs as low as 5dB.

关键词： Analog-to-digital conversion Finite rate of innovation Sampling theory Annihilating filter Analog-digital conversion streams Sampling sequential algorithm perfect reconstruction Paul Adrien Maurice Dirac rivers signals Noise

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共12页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：