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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

152 篇 期刊文献
144 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

255 篇 工学
- 124 篇 计算机科学与技术...
- 79 篇 电气工程
- 46 篇 控制科学与工程
- 43 篇 信息与通信工程
- 22 篇 电子科学与技术（可...
- 22 篇 软件工程
- 21 篇 机械工程
- 11 篇 仪器科学与技术
- 10 篇 材料科学与工程（可...
- 10 篇 土木工程
- 9 篇 化学工程与技术
- 8 篇 交通运输工程
- 7 篇 石油与天然气工程
- 7 篇 环境科学与工程（可...
- 5 篇 动力工程及工程热...
- 5 篇 安全科学与工程
- 4 篇 测绘科学与技术
- 4 篇 船舶与海洋工程
- 4 篇 航空宇航科学与技...
- 4 篇 生物医学工程（可授...
57 篇 理学
- 20 篇 物理学
- 11 篇 数学
- 8 篇 生物学
- 7 篇 化学
- 5 篇 系统科学
- 4 篇 地球物理学
34 篇 管理学
- 31 篇 管理科学与工程(可...
- 4 篇 工商管理
17 篇 医学
- 13 篇 临床医学
4 篇 农学
3 篇 教育学
2 篇 哲学
2 篇 经济学
2 篇 法学
2 篇 军事学
1 篇 艺术学

主题

297 篇 algorithm optimi...
10 篇 algorithms
9 篇 deep learning
9 篇 machine learning
8 篇 feature extracti...
6 篇 genetic algorith...
6 篇 artificial intel...
5 篇 big data
5 篇 optimization
5 篇 genetic algorith...
5 篇 parallel computi...
5 篇 neural network
5 篇 cloud computing
5 篇 computer vision
4 篇 computational co...
4 篇 hybrid systems
4 篇 path planning
4 篇 manifolds
3 篇 internet of thin...
3 篇 ant colony optim...

机构

2 篇 east china norma...
2 篇 cent south univ ...
2 篇 jozef stefan ins...
2 篇 univ chinese aca...
2 篇 beijing jiaotong...
2 篇 shandong acad sc...
2 篇 huawei technol p...
2 篇 cent south univ ...
2 篇 tech univ munich...
2 篇 univ chinese aca...
2 篇 chinese acad sci...
2 篇 natl univ def te...
2 篇 chinese acad sci...
2 篇 chinese univ hon...
2 篇 college of commu...
1 篇 the state key la...
1 篇 universitas meth...
1 篇 netflix inc.
1 篇 csiro informatio...
1 篇 guangdong baiyun...

作者

3 篇 farzin taringoo
3 篇 peter e. caines
2 篇 sheng shuo
2 篇 ghidarcea mircea
2 篇 ning jingyi
2 篇 novak roman
2 篇 yang wuhao
2 篇 yan chungang
2 篇 liu xin
2 篇 wang zhihua
2 篇 jia panqi
2 篇 wang shuai
2 篇 liu ying
2 篇 zhang chun
2 篇 nasseri reza
2 篇 sha edwin hsing-...
2 篇 guan jing
2 篇 guo ruifeng
2 篇 popescu decebal
2 篇 jin xiaofeng

语言

277 篇 英文
11 篇 其他
7 篇 中文
3 篇 法文
2 篇 德文
1 篇 俄文

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

共 297 条记录，以下是221-230 订阅

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

详细简洁

排序：

Relational Joins on GPUs for In-memory Database Query Processing

Relational Joins on GPUs for In-memory Database Query Proces...

引用

作者： Rui, Ran University of South Florida

学位级别：Ph.D.

Relational join processing is one of the core functionalities in database management systems. Implementing join algorithms on parallel platforms, especially modern GPUs, has gain a lot of momentum in the past decade. This dissertation addresses the following issues on GPU join algorithms. First, we present empirical evaluations of a state-of-the-art work on GPU-based join processing. Since 2008, the compute capabilities of GPUs have increased following a pace faster than that of the multi-core CPUs. We run a comprehensive set of experiments to study how join operations can benefit from such rapid expansion of GPU capabilities. We also present improved GPU programs that take advantage of new GPU hardware/software features such as read-only data cache, large L2 cache, and shuffle instructions. Second, we report new design and implementation of join algorithms with high performance under today's GPGPU environment. In particular, we overhaul the popular radix hash join and redesign sort-merge join algorithms on GPUs by applying a series of novel techniques to utilize the hardware capacity of latest Nvidia GPU architecture and new features of the CUDA programming framework. Our algorithms take advantage of revised hardware arrangement, larger register file and shared memory, native atomic operation, dynamic parallelism, and CUDA Streams. Lastly, we explore how join processing would benefit from the adaptation of multiple GPUs. We identify the low rate and complex patterns of data transfer among the CPU and GPUs as the main challenges in designing efficient algorithms for large table joins, and we propose three distinctive designs of multi-GPU join algorithms, namely, the nested loop, global sort-merge and hybrid joins to overcome such challenges. Extensive experiments running on multiple databases and two different hardware configurations demonstrate high scalability of our algorithms over data size and significant performance boost brought by the use of multiple GPUs. F

关键词： algorithm Design algorithm optimization Emerging Hardware Parallel Computing Query Performance

来源：评论

学校读者我要写书评

暂无评论

Revolutionizing Loading Robot Perception: Advanced 3D Carriage Detection Technology 10

Revolutionizing Loading Robot Perception: Advanced 3D Carria...

引用

10th International Conference on Electrical Engineering, Control and Robotics (EECR)

作者： Huang, Qianping Xiao, Zhongmin Kong, Chuixin Wu, Wenqiang Chen, Chaozheng Ren, Zhiye Yu, Mingfeng Guangzhou Univ Sch Mech & Electrial Engn Guangzhou Peoples R China

ISBN: (纸本)9798350370010;9798350370003

In view of the problems of low efficiency and high cost of manual cloth loading,the introduction of loading robots has become a key strategy to improve the loading *** three-dimensional detection system was designed on the basis of the loading robot, and the hardware design and software demand analysis software were divided and designed. The system uses advanced 3D sensors as the core perception equipment, which is installed at the front end of the robot arm to realize the intelligent detection of environmental information in the truck compartment. Based on the TOF time-of-flight technology, high-quality point cloud data was obtained. In terms of point cloud processing, the normal estimation algorithm and the RANSAC circle fitting algorithm are proposed, which aim to optimize the quality of point cloud data, reduce noise, and accelerate the real-time processing *** can generate high-precision three-dimensional point cloud data, obtain the position and size of the detection carriage, and detect the loading status of the cloth, which can achieve higher speed and more accurate grasping and placing of the cloth, reduce the error, thereby significantly improving the overall loading efficiency and reducing labor costs.

关键词： loading robots three-dimensional inspection system spatial detection point cloud processing algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

SIMD-Based Multiple Sets Intersection with Dual-Scale Search algorithm 17

SIMD-Based Multiple Sets Intersection with Dual-Scale Search...

引用

ACM Conference on Information and Knowledge Management (CIKM)

作者： Song, Xingshen Yang, Yuexiang Li, Xiaoyong Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China Natl Univ Def Technol Acad Ocean Sci & Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781450349185

Conjunctive Boolean query is one fundamental operation for document retrieval in many information systems and databases. Various algorithms have been put up in terms of maximizing the query efficiency. In recent years, researchers began to exploit the parallel advantage of single-instruction-multiple-data (SIMD) instructions to accelerate the intersection procedure and achieved substantial gains over previous scalar algorithms. However, these works only focus on intersecting two sets at a time and ignore the scenario of multiple sets intersection. We present a flexible search algorithm which balances non-SIMD and SIMD comparisons in order to provide efficient and effective intersection.

关键词： Set Intersection algorithm optimization Vectorized Processing Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

Software optimizations of Multiple Sets Intersection via SIMD Instructions 24

Software Optimizations of Multiple Sets Intersection via SIM...

引用

24th Asia-Pacific Software Engineering Conference (APSEC)

作者： Song, Xingshen Jiang, Yu Yang, Yuexiang Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China Northwest Inst Nucl Technol Xian Shaanxi Peoples R China

ISBN: (纸本)9781538636817

Conjunctive Boolean query is one fundamental operation for document retrieval in many information systems and databases. In its most basic and popular form, a conjunctive query can be seen as the intersection problem of multiple sets of sorted integers. Various algorithms have been put up in terms of maximizing the query efficiency. In recent years, researchers began to exploit the parallel advantage of single-instruction multiple-data (SIMD) instructions to accelerate the intersection procedure and achieved substantial gains over previous scalar algorithms. However, these works only focus on intersecting two sets at a time and ignore the scenario of multiple sets intersection. Missing from the literature is a thorough study that explores the combination of traditional multiple sets intersection algorithms and SIMD instructions. This article discusses software optimizations for the intersection algorithms via AVX2 and AVX512 SIMD instructions of modern processor architectures. Through an experimental analysis we show that the proposed is able to reduce comparisons executed while improving instruction throughput, thus gaining performance enhancement over previous methods.

关键词： Set Intersection algorithm optimization Vectorized Processing Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

Gradient-Geodesic HMP algorithms for the optimization of Hybrid Systems Based on the Geometry of Switching Manifolds

Gradient-Geodesic HMP Algorithms for the Optimization of Hyb...

引用

2010 49th IEEE Conference on Decision and Control

作者： Farzin Taringoo Peter E. Caines Centre for Intelligent Machines (CIM) and the Department of Electrical and Computer Engineering McGill University Montreal Canada

ISBN: (纸本)9781424477456

This paper provides algorithms for the optimization of autonomous hybrid systems based on the geometrical properties of switching manifolds. The first and second sections of the paper introduce optimal hybrid control systems and the third section deals with the analysis of the Hybrid Maximum Principle (HMP) algorithm introduced in [8]. The HMP algorithm in [8] is then extended to a geometrical algorithm by employing the notion of geodesic curves on switching manifolds. The convergence analysis for the proposed algorithm is based on Lasalle Theory. To reduce the computational burden, a simplified version of the geodesic algorithm is formulated in the local coordinate system of the switching state. Simulation results show a significant improvement in terms of convergence rate and stability compared with the HMP algorithm.

关键词： hybrid systems Manifolds geometry Hybrid control systems algorithms algorithm optimization Local Coordinate System switching

来源：评论

学校读者我要写书评

暂无评论

optimization of Hardware-oblivious and Hardware-conscious Hash-join algorithms on KNL

Optimization of Hardware-oblivious and Hardware-conscious Ha...

引用

作者： Deyou Tang Yazhuo Zhang Qingmiao Zeng School of Software Engineering South China University of Technology

Investigation of hash join algorithm on multicore and many-core platforms showed that carefully tuned hash join implementations could outperform simple hash joins on most multi-core ***,hardware-oblivious hash join has shown competitive performance on many-core *** Landing（KNL） has received attention in the field of parallel computing for its massively data-parallel nature and high memory bandwidth,but both hardwareoblivious and hardware-conscious hash join algorithms have not been systematically discussed and evaluated for KNL’s characteristics（high bandwidth,cluster mode,etc.）.In this paper,we present the design and implementation of the stateof-the-art hardware-oblivious and hardware-conscious hash joins that are tuned to exploit various KNL hardware *** a thorough evaluation,we show that:1) Memory allocation strategies based on KNL’s architecture are effective for both hardware-oblivious and hardware-conscious hash join algorithms;2) In order to improve the efficiency of the hash join algorithms,hardware architecture features are still non-negligible factors.

关键词： hash join Knights Landing algorithm optimization parallel computing

来源：评论

学校读者我要写书评

暂无评论

Application Research of Face Feature Extraction Based on DM642

Application Research of Face Feature Extraction Based on DM6...

引用

International Conference on Manufacturing Engineering and Automation

作者： Liu, Jinqing Fan, Qunzhen Cao, Dong Fujian Normal Univ Sch Phys & Optoelect Technol Fuzhou 350007 Fujian Peoples R China Guangzhou Univ Chinese Med Informat Technol Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9780878492268

With the safety awareness strengthened, identification authentication technology has been increasingly concerned. Face recognition is attractive in pattern recognition and artificial intelligence field, and face feature extraction is a very important part in face recognition. This paper first introduced preprocessing of face images, PCA and ICA algorithm. Considering PCA and ICA their respective strengths and weaknesses, then a novel face feature extraction method based on PCA and ICA is proposed. The NN classifier is select to face classification and recognition on the ORL face database. From the actual requirements, the paper analyses hardware platforms based on DM642, and finally use tool CCS software to optimize program and implementation base on DM642 to meet the real-time requirements. Experiments indicated that the modified method is superior to PCA and ICA algorithm.

关键词： Face recognition Feature extraction PCA ICA DM642 algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

An Automatic Assembly Technology for Perforated Discs Based on Contour Optimized Hough Circle Transform

An Automatic Assembly Technology for Perforated Discs Based ...

引用

4th International Conference on Applied Mechanics and Mechanical Engineering (ICAMME 2013)

作者： Shang, Ce Tao, Guoliang Zhejiang Univ State Key Lab Fluid Power Transmiss & Control Hangzhou 310027 Peoples R China

ISBN: (纸本)9783037859230

Aiming at the low efficiency of handwork and high labor intensity, an automatic solution for perforated discs assembly is developed based on computer vision. This technology consists of the processes of material feeding, parts handling, circle detecting and assembling. The mechatronic structure includes the pneumatic elements and electric actuators that controlled by PLC and stepper motor drivers. This method has solved the problem of the large cost of human force since this product has a big industrial production. Meanwhile, a contour optimized Hough circle transform (CHCT) is proposed. It can overcome the standard Hough circle transform (HCT)'s disadvantages, such as redundant calculation and probability of failures. It enhances the reliability in order to satisfy the demand of industrial automatic production. The image processing takes only about 60ms and reaches 100% success rate with a small detection error. This method also has the generality for the similar assembly system based on machine vision.

关键词： Automatic assembly Hough circle transform Computer vision algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

Optimized Electronic Cash Scheme with Fast Public Key algorithm

Optimized Electronic Cash Scheme with Fast Public Key Algori...

引用

International Conference on Information Technology for Manufacturing Systems

作者： Zhou, Xuanwu Command Coll Chinese Armed Police Force Tianjin 300171 Peoples R China

ISBN: (纸本)9780878492879

In the paper, we analyzed the system optimization algorithms in e-cash (electronic cash) by improving the efficiency of e-cash for software and hardware application. As for the fast asymmetric cryptography algorithms in e-cash scheme, we presented basic interactive protocols based on discrete logarithm cryptosystem. In the protocol, the interacting algorithms achieve authenticated encryption in secret transmission algorithms, the verification of signature and transmission of secret message can be fulfilled in a single algorithm, and therefore the complexity of authentication algorithms in e-cash scheme is greatly reduced. As a comparison with traditional e-cash schemes, we presented an optimized e-cash scheme based on ECC (Elliptic Curves Cryptosystem). The cryptography algorithms of the scheme make full use of the superiority of ECC fast algorithms, thus the optimized e-cash scheme effectively avoids illegal distribution of e-cash and generalized forgery attack on system parameters with less system overheads.

关键词： Fast asymmetric algorithm electronic cash illegal distribution algorithm optimization computational complexity

来源：评论

学校读者我要写书评

暂无评论

Efficient Data Sampling and Reduction Methods in Large-Scale Forensic Analysis

Efficient Data Sampling and Reduction Methods in Large-Scale...

引用

2024 OPJU International Technology Conference on Smart Computing for Innovation and Advancement in Industry 4.0, OTCON 2024

作者： Harika, Ala Sharma, Praveen Aravinda, K. Nagpal, Amandeep Praveen Albawi, Ali Institute of Aeronautical Engineering Hyderabad Dundigal India Ies Insititute of Technology and Management Ies University Department of Computer Science & Engineering M. P Bhopal India New Horizon College of Engineering Department of Electronics and Communication Engineering Bangalore India Lovely Professional University Phagwara India Lloyd Institute of Engineering & Technology Knowledge Park II Uttar Pradesh Greater Noida201306 India The Islamic University College of Medical Technology Radiology Techniques Department Najaf Iraq

ISBN: (纸本)9798350373783

In this era of enormous, continuously changing datasets, forensic analysis needs innovative approaches that can adapt to changing data characteristics while maintaining data security. To satisfy this demand, our recommended system includes all algorithms for large forensic investigations. The adaptive stratified sampling algorithm sets the scene. It adjusts strata and sample quantities based on data attributes. The Feature Weighting with Machine Learning algorithm improves selection by weighting features using machine learning. Based on them, the dynamic cluster-based sampling algorithm organizes data points dynamically. By determining how much information each data point has, the entropy-guided data reduction algorithm improves the framework. The Temporal Correlation Analysis algorithm finally allows you to view changing data. Tables3 and Tables4 indicate that our approach outperforms others in several key areas. The recommended technique outperforms others in accuracy, memory, F1 score, usability, stability, legal acceptability, ease of application, computing complexity, and freedom. The findings in Figures.6-10 indicate that the proposed framework can balance accuracy and memory, decrease data, and be highly usable, stable, and versatile. Finally, our technology represents a novel technique to conduct large-scale research. It is fast, adaptable, and data-safe. Machine learning, dynamic changes, and temporal variables make our platform robust and comprehensive for current forensic investigations. © 2024 IEEE.

关键词： Adaptive Stratified Sampling algorithm algorithm optimization Data Reduction Data Sampling Dynamic Cluster-based Sampling Entropy-guided Data Reduction Feature Weighting Forensic Analysis Machine Learning Temporal Correlation Analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共30页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：