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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,548 篇 期刊文献
736 篇 会议
13 篇 学位论文
3 册 图书

馆藏范围

2,300 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,935 篇 工学
- 1,499 篇 计算机科学与技术...
- 538 篇 电气工程
- 303 篇 软件工程
- 147 篇 信息与通信工程
- 111 篇 控制科学与工程
- 62 篇 机械工程
- 57 篇 电子科学与技术（可...
- 53 篇 力学（可授工学、理...
- 37 篇 航空宇航科学与技...
- 30 篇 材料科学与工程（可...
- 28 篇 仪器科学与技术
- 25 篇 动力工程及工程热...
- 18 篇 土木工程
- 15 篇 测绘科学与技术
- 14 篇 化学工程与技术
- 14 篇 石油与天然气工程
- 10 篇 生物医学工程（可授...
- 10 篇 网络空间安全
707 篇 理学
- 511 篇 数学
- 121 篇 物理学
- 44 篇 化学
- 29 篇 地球物理学
- 26 篇 生物学
- 19 篇 系统科学
- 18 篇 统计学（可授理学、...
169 篇 管理学
- 156 篇 管理科学与工程(可...
- 10 篇 工商管理
- 10 篇 图书情报与档案管...
32 篇 医学
- 24 篇 临床医学
9 篇 经济学
- 8 篇 应用经济学
9 篇 农学
6 篇 法学
4 篇 教育学
2 篇 艺术学

主题

2,300 篇 parallel algorit...
97 篇 gpu
53 篇 cuda
50 篇 domain decomposi...
45 篇 image processing
42 篇 finite element
38 篇 mapreduce
35 篇 mpi
34 篇 parallel algorit...
30 篇 hypercube
27 篇 time complexity
26 篇 optimization
26 篇 navier-stokes eq...
25 篇 sorting
24 篇 data mining
23 篇 openmp
21 篇 graphics process...
20 篇 load balancing
20 篇 parallel computi...
20 篇 selection

机构

20 篇 southwest univ s...
13 篇 natl taiwan univ...
12 篇 guizhou normal u...
10 篇 georgia state un...
8 篇 hunan univ coll ...
7 篇 griffith univ sc...
7 篇 beihang univ sch...
6 篇 virginia tech de...
6 篇 beihang univ sta...
6 篇 suny coll new pa...
6 篇 china univ geosc...
5 篇 nanyang technol ...
5 篇 soochow univ sch...
5 篇 iowa state univ ...
5 篇 natl univ def te...
5 篇 guangxi teachers...
5 篇 univ texas dept ...
5 篇 natl taiwan univ...
5 篇 univ naples fede...
5 篇 natl univ def te...

作者

32 篇 shang yueqiang
22 篇 horng sj
16 篇 zheng bo
13 篇 li kenli
13 篇 shen h
12 篇 akl sg
12 篇 chung kl
11 篇 bahig hazem m.
10 篇 ito yasuaki
10 篇 pan y
10 篇 liu jie
10 篇 nakano koji
9 篇 mei gang
9 篇 tsai hr
8 篇 shi hc
7 篇 bozejko wojciech
7 篇 kao tw
7 篇 wang wei
7 篇 li keqin
7 篇 zapata el

语言

2,098 篇 英文
169 篇 其他
31 篇 中文
1 篇 法文
1 篇 俄文

检索条件"主题词=Parallel algorithm"

共 2300 条记录，以下是2121-2130 订阅

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

详细简洁

排序：

Retina identification based on moment invariant 122

Retina identification based on moment invariant

引用

2015 122nd ASEE Annual Conference and Exposition

作者： Kavianpour, Alireza Shoari, Simin Kavianpour, Behdad DeVry University PomonaCA United States University of California Gavin Herbert Eye Institute Irvine United States

This paper demonstrates the importance of topics in physics and mathematics courses such as matrix, eigenvectors, centroid, and moment of inertia in the pattern recognition applications. Teaching advance topics in physics and mathematics is not an easy task. Students always ask this question: What is the use? The best practice for teaching these topics is to combine them with a real industry application. For example, computer hard disk reading is based on the concept of derivatives and the change in the magnetic fields. To demonstrate this type of teaching, the use of three dimensional moments in the pattern recognition is explained. The three-dimensional moments may be used to detect different patterns in a digitally represented image. The combination of several moments for an object has an invariant property. The mathematical foundation of an invariant feature is related to the theory that images taken from different angles from the same object have the same set of moment invariants. Moments contain information of an image which can be used in calculating the location and orientation of an object. An algorithm for recognition of an individual identity based on a digitally represented image of the scanned retina is presented. The technology is based upon the fact that no two retinal patterns are alike. In this paper, the nine parameters of an ellipsoidal shape fitted into a retinal image such as coordinates of the center of the ellipsoid, the length of major, minor, intermediate axes, and the direction of three axes will be calculated. For each individual, these parameters are unique. © American Society for Engineering Education, 2015.

关键词： Ellipsoid Image processing parallel algorithm Pattern recognition Retina Three-dimensional moments

来源：评论

学校读者我要写书评

暂无评论

SR2C: A Structurally Redundant Short Reads Collapser for Optimizing DNA Data Compression 29

SR2C: A Structurally Redundant Short Reads Collapser for Opt...

引用

29th IEEE International Conference on parallel and Distributed Systems, ICPADS 2023

作者： Sun, Hui Ma, Huidong Zheng, Yingfeng Xie, Haonan Wang, Xiaofei Liu, Xiaoguang Wang, Gang Nankai University College of C.S. Nankai-Orange D.T. Joint Lab Nankai-Baidu Joint Lab ICIC TMCC SysNet DISSec GTIISC Tianjin300350 China Guangxi University School of Electrical Engineering Nanning530004 China

ISBN: (纸本)9798350330717

The current redundant sequence deduplication algorithms cannot remove structural repetitive DNA short reads such as mirror, reverse, paired, and complementary palindromes in high-throughput genomics sequencing data. Moreover, these methods also cannot construct indexes to recover the original sequences, thus failing to meet the requirements of lossless compression for downstream applications. To address these problems, we propose a data structure called Cycle-Hash-Linkage (CHL) and present a CPU parallelism optimization algorithm named SR2C (Structurally Redundant Short Reads Collapser) based on CHL to improve the compression ratio of DNA sequencing data. Experimental results on actual data from the NCBI database demonstrate that SR2C achieves an average residual sequence percentage improvement of 2.556% compared to the state-of-the-art redundant sequence deduplication algorithm, Minirmd. Furthermore, SR2C cascaded optimization improves the average compression ratios of compression algorithms Pigz, PBzip2, XZ, and 7Z by 92.345%, 78.999%, 10.132%, and 7.434%, respectively. By leveraging multi-core CPU parallel computation, SR2C effectively reduces time consumption, which achieves 2-5X deduplication and recovers *** same name Linux toolkit is freely available at https://***/fahaihi/SR2C. © 2023 IEEE.

关键词： data compression DNA sequencing data compression parallel algorithm redundancy deduplication rolling-hash algorithm structurally redundant reads

来源：评论

学校读者我要写书评

暂无评论

parallel Point Arithmetic for Jacobi Quartics Curve

Parallel Point Arithmetic for Jacobi Quartics Curve

引用

2011 IEEE International Conference on Information Theory and Information Security(ICITIS 2011)

作者： Xinchun Yin 1) 2) Ting Yang 1) 1) College of Information Engineering Yangzhou University Yangzhou Jiangsu China 2) State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu China

In this paper,we present new formulae of point doubling,addition and tripling on Jacobi Quartics Curve in projective *** efficiency of new paralleled formulae increased 41%-49%.Simple power analysis is the most devastating attack to the security of elliptic curve scalar multiplication and can retrieve the secret key in some *** avoid this attack,a fast and secure side channel atomic parallel scalar multiplication algorithm is put *** with the previous methods,the new algorithm is more *** 192 bit scalar using NAF recoding,the efficiency of the new algorithm is increased by about 4.4%～56% if S/M=0.8 or 4.4%-61% if S/M=0.6.

关键词： Elliptic Curve Cryptosystem Scalar Multiplication parallel algorithm Side Channel Attack

来源：评论

学校读者我要写书评

暂无评论

Asynchronous parallel Evolutionary algorithms for Optimizations

Asynchronous Parallel Evolutionary Algorithms for Optimizati...

引用

2001 International Symposium on Distributed Computing and Applications to Business, Engineering and Science

作者： Hugo de Garis Starlab Brain Builder Group

Recently we proposed a Robust Evolutionary algorithm for solving nonlinear programming(NLP) problems[4].It is an extension of Guo's algorithm[1],which possesses enhanced capabilities for solving NLP *** capabilities include:a) advancing the variable subspace,b) adding a search process over subspaces and normalized constraints,c) using an adaptive penalty function,and d) adding the ability to deal with integer NLP problems.0-1 NLP problems,and mixed-integer NLP problems which have equality *** this paper an asynchronous parallel evolutionary algorithm with scalable granularities for MIMD machines is designed by parallelizing the Robust Evolutionary algorithm.A challenge NLP problem is chosen as the test *** experiments show that the new algorithm is very efficient and effective.

关键词： parallel algorithm Evolutionary Computation function optimization

来源：评论

学校读者我要写书评

暂无评论

parallel Search for Costas Arrays

Parallel Search for Costas Arrays

引用

2006年国际电子、工程及科学领域的分布式计算和应用学术研讨会

作者： Xinchun Yin,Tao Liu Department of Computer Science and Engineering,Yangzhou University Yangzhou,Jiangsu 225009,China

Costas arrays,special permutation matrices,have been applied to many fields such as signal processing and ***,so far the basic problem—the counting problem remains *** all costas arrays of order n from n! permutation matrices has been of long standing *** an effective parallel search algorithm is *** algorithm adopts the classical master-slave *** processor is in charge of allocating search subspace to slave *** slave processor quests for costas arrays in assigned search *** processors do not communicate with each *** amount of communication between master and slave processors is *** the speedup of this algorithm approaches total number of used processors.

关键词： Costas Arrays Counting Problem parallel algorithm and Master-slave Technique Search

来源：评论

学校读者我要写书评

暂无评论

The Non-eye Typhoon Center Locating with parallel Computing

The Non-eye Typhoon Center Locating with Parallel Computing

引用

The Fourth International Conference on parallel and Distributed Computing, Applications and Technologies

作者： Zhengguang Liu Bing Wu Juntao Xue Huanzhu Liu School of Engineering Electrical and Automation Tianjin University National Meteorological Center

A new mathematical morphology-based algorithm is proposed to achieve automatic center location of non-eye *** center of a non-eye typhoon is near the geometric center of the cloud system and has higher *** each infrared satellite cloud image,the locating procedures are as follows:a) noises filtering,b) main cloud systems segmenting,c) center locating and d) multispectral image *** algorithms are based on operations of mathematical morphology,and designed in IBM SP2 massively parallel *** experiment results show that the algorithm locates the centers of most non-eye typhoons successfully and achieves faster,more precise and non-human interactive non-eye typhoon center positioning.

关键词： Satellite cloud image Non-eye typhoon locating parallel algorithm Mathematical morphology

来源：评论

学校读者我要写书评

暂无评论

parallel Beamforming Design in Full Duplex Systems with Per-Antenna Power Constraints

Parallel Beamforming Design in Full Duplex Systems with Per-...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Ruijin Sun Ying Wang Runcong Su Yuanfei Liu State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781538646595

We investigate the max-min weighted downlink signal- to-interference ratio (SINR) problem under uplink SINR constraints and practical per-antenna constraints in full- duplex systems. The successive convex approximation (SCA) method is adopted to iteratively deal with this non-convex problem. Within each SCA iteration, to lower the complexity, a parallel beamforming algorithm based on alternating direction method of multipliers (ADMM) is proposed. Specifically, local variables are introduced to decompose the problem to multiple independent subproblems with closed-form solutions. Numerical results show that our proposed algorithm can achieve the similar performance with existing algorithms, but runs much faster especially in large-scale systems.

关键词： Full-duplex ADMM parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel Encoding Method of XML User Query Patterns

A Parallel Encoding Method of XML User Query Patterns

引用

IIAI International Congress on Advanced Applied Informatics

作者： Tsui-Ping Chang Department of Information Technology Ling Tung University

ISBN: (纸本)9781467389860

Providing efficient encoding approaches for mining XML query patterns is crucial, as many applications use XML to share data in their disciplines over the Internet. These encoded XML query patterns can be used to design an index mechanism or cached and thus enhance XML query performance. Several XML query pattern mining algorithms have been proposed to record user queries in the system and thus discover the frequent XML query patterns. By using the frequent XML query patterns, the query performance of XML data is improved. However, to find out the frequent XML query patterns from big XML data over the Internet, these existing algorithms are time-consuming and thus are not suitable. Map Reduce is a software framework for writing parallel programs and can be used to enhance the performance to encode XML query patterns. In this paper, Map Reduce-based algorithms to parallel encode XML queries, report experimental results of the prototype implementation on Hadoop system, and a popular implementation of Map Reduce framework are proposed.

关键词： Encoding XML XML queries Map Reduce parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel Weighted Multiselection

Optimal Parallel Weighted Multiselection

引用

2002年IEEE十区计算机、通信、控制和电机工程会议

作者： Hong Shen Graduate School of Information Science Japan Advanced Institute of Science and Technology 1-1 Asahidai, Tatsunokuchi, Ishikawa 923-1292, Japan

Weighted multiselection requires to select r elementsfrom a given set of n elements, each associated witha weight, such that each element selected is on apre-specified weighted-rank, where an element is onweighted-rank k if it is the smallest element such thatthe aggregated weight of all elements not greater than itin the set is not smaller than *** paper pressents ef-ficient algorithms for solving this problem both sequen-tially and in parallel on EREW PRAM. Our sequentialalgorithm solves this problem in time O（nlogr） whichis optimal. Our parallel algorithm runs in O（T log r）time on an EREW PRAM with 1

关键词： EREW PRAM multiselection parallel algorithm selection weight selection sorting

来源：评论

学校读者我要写书评

暂无评论

Performance of Population Control Techniques in Monte Carlo Reactor Criticality Simulations

Performance of Population Control Techniques in Monte Carlo ...

引用

2022 International Conference on Physics of Reactors, PHYSOR 2022

作者： Variansyah, Ilham McClarren, Ryan G. University of Notre Dame Department of Aerospace and Mechanical Engineering 365 Fitzpatrick Hall Notre DameIN46556 United States

ISBN: (纸本)9780894487873

In Monte Carlo (MC) criticality simulation, fission neutrons accumulated in a generation needs to be properly handled before they can be used as the source particles in the successive generation. There are two well-known methods for handling the so-called fission bank. In the first method, particle weights are normalized to a specified value, say M. In the second method, a population control technique (PCT) is applied so that M particles are sampled from the fission bank. Five distinct PCTs are identified from the literature: simple sampling, splitting-roulette, combing, modified combing, and duplicate-discard. Some of these PCTs have been almost exclusively applied for time-dependent MC simulation. These different methods/techniques have been traditionally seen as mere options to choose from-whether there is a considerable significance on the choices has never been critically investigated. These six methods (weight normalization and 5 PCTs) are implemented to the open-source code OpenMC with streamlined abstraction compatible with the existing parallel fission bank algorithm. Their relative performances are assessed by solving a reactor critcality problem. It is found that techniques that introduce larger uncertainties to particle population produce higher neutron flux tally variances. The significance of the limited parallel scalabilities of some of the techniques are also demonstrated and discussed. © 2022 Proceedings of the International Conference on Physics of Reactors, PHYSOR 2022. All Rights Reserved.

关键词： criticality Monte Carlo neutron transport parallel algorithm population control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共230页 << < 209 210 211 212 213 214 215 216 217 218 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：