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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

78,668 篇 会议
4,290 篇 期刊文献

馆藏范围

82,958 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17,626 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,761 篇 电气工程
- 2,980 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,477 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,416 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 83 篇 核科学与技术
- 69 篇 光学工程
1,906 篇 理学
- 955 篇 系统科学
- 515 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,750 篇 管理学
- 1,686 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
247 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,958 篇 algorithm design...
5,906 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,549 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,980 篇 convergence
3,964 篇 performance anal...
3,643 篇 data mining
3,580 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,987 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
71 篇 school of comput...
51 篇 department of el...
49 篇 state key labora...
49 篇 school of electr...
46 篇 tsinghua univers...
45 篇 institute for in...
45 篇 school of electr...
44 篇 school of comput...
42 篇 school of comput...
40 篇 school of inform...
38 篇 department of el...
38 篇 department of co...
36 篇 institute of inf...
35 篇 department of co...
35 篇 department of co...
33 篇 department of el...
33 篇 department of el...
32 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
57 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
37 篇 jing zhang
37 篇 li li
33 篇 wei wang
28 篇 qiang zhou
28 篇 slawomir koziel
27 篇 rui wang
26 篇 xi chen
25 篇 min huang
25 篇 wayne luk
23 篇 jie yang
22 篇 hisao ishibuchi
21 篇 feng liu
21 篇 ming chen

语言

81,760 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm Design And Analysis"

共 82958 条记录，以下是831-840 订阅

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

详细简洁

排序：

Half-Duplex Routing is NP-hard 55

Half-Duplex Routing is NP-hard

引用

55th Annual Allerton Conference on Communications, Control, and Computing (Allerton)

作者： Ezzeldin, Yahya H. Cardone, Martina Fragouli, Christina Tuninetti, Daniela UCLA Los Angeles CA 90095 USA Univ Illinois Chicago IL 60607 USA

ISBN: (纸本)9781538632666

Routing is a widespread approach to transfer information from a source node to a destination node in many deployed wireless ad-hoc networks. Today's implemented routing algorithms seek to efficiently find the path/route with the largest Full-Duplex (FD) capacity, which is given by the minimum among the point-to-point link capacities in the path. Such an approach may be suboptimal if then the nodes in the selected path are operated in Half-Duplex (HD) mode. Recently, the capacity (up to a constant gap that only depends on the number of nodes in the path) of an HD line network (i.e., a path) has been shown to be equal to half of the minimum of the harmonic means of the capacities of two consecutive links in the path. This paper asks the question of whether it is possible to design a polynomial-time algorithm that efficiently finds the path with the largest HD capacity in a relay network. The problem of finding such a path is shown to be NP-hard in general. However, if the number of cycles in the network is polynomial in the number of nodes, then a polynomial-time algorithm can indeed be designed.

关键词： High definition video Routing Ad hoc networks algorithm design and analysis Relays Approximation algorithms Schedules

来源：评论

学校读者我要写书评

暂无评论

CATERPILLAR: Coarse Grain Reconfigurable Architecture for Accelerating the Training of Deep Neural Networks 28

CATERPILLAR: Coarse Grain Reconfigurable Architecture for Ac...

引用

28th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)

作者： Li, Yuanfang Pedram, Ardavan Stanford Univ Stanford CA 94305 USA Cerebras Syst Los Altos CA USA

ISBN: (纸本)9781509048250

Accelerating the inference of a trained DNN is a well studied subject. In this paper we switch the focus to the training of DNNs. The training phase is compute intensive, demands complicated data communication, and contains multiple levels of data dependencies and parallelism. This paper presents an algorithm/architecture space exploration of efficient accelerators to achieve better network convergence rates and higher energy efficiency for training DNNs. We further demonstrate that an architecture with hierarchical support for collective communication semantics pro vi des flexibility in training various networks performing both stochastic and batched gradient descent based techniques. Our results suggest that smaller networks favor non-batched techniques while performance for larger networks is higher using batched operations. At 45nm technology, CATERPILLAR achieves performance efficiencies of 177 GFLOPS/W at over 80% utilization for SGD training on small networks and 211 GFLOPS/W at over 90% utilization for pipelined SGD/CP training on larger networks using a total area of 103.2 mm(2) and 178.9 mm(2) respectively.

关键词： Training Parallel processing Acceleration Computer architecture algorithm design and analysis Neural networks Convergence

来源：评论

学校读者我要写书评

暂无评论

Obstacle Avoidance Strategy of AGV Formation based on Time Efficiency First 2

Obstacle Avoidance Strategy of AGV Formation based on Time E...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Huichao Wu Yuan Luo Qianneng Zhou Junjie Li College of Optoelectronic Engineering Chongqing University of Posts and Telecommunications Research Center of Intelligent System and Robot Chongqing University of Posts and Telecommunications

To overcome the high time consumption, unreasonable rotation and poor environment adaptability in obstacle avoidance of wheeled robots formation, a strategy combining heuristic path planning function

ISBN: (纸本)9781467389808

To overcome the high time consumption, unreasonable rotation and poor environment adaptability in obstacle avoidance of wheeled robots formation, a strategy combining heuristic path planning function

关键词： Collision avoidance Robots Path planning Wheels algorithm design and analysis Simulation Shape

来源：评论

学校读者我要写书评

暂无评论

Subspace Learning in The Presence of Sparse Structured Outliers and Noise 50

Subspace Learning in The Presence of Sparse Structured Outli...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Minaee, Shervin Wang, Yao NYU Elect Engn Dept New York NY 10003 USA

ISBN: (纸本)9781467368537

Subspace learning is an important problem, which has many applications in image and video processing. It can be used to find a low-dimensional representation of signals and images. But in many applications, the desired signal is heavily distorted by outliers and noise, which negatively affect the learned subspace. In this work, we present a novel algorithm for learning a subspace for signal representation, in the presence of structured outliers and noise. The proposed algorithm tries to jointly detect the outliers and learn the subspace for images. We present an alternating optimization algorithm for solving this problem, which iterates between learning the subspace and finding the outliers. This algorithm has been trained on a large number of image patches, and the learned subspace is used for image segmentation, and is shown to achieve better segmentation results than prior methods, including least absolute deviation fitting, k-means clustering based segmentation in DjVu, and shape primitive extraction and coding algorithm.

关键词： Image segmentation Clustering algorithms Optimization algorithm design and analysis Robustness Distortion Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

3D Point Cloud Registration for Localization using a Deep Neural Network Auto-Encoder 30

3D Point Cloud Registration for Localization using a Deep Ne...

引用

30th IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Elbaz, Gil Avraham, Tamar Fischer, Anath Technion Israel Inst Technol Haifa Israel

ISBN: (纸本)9781538604571

We present an algorithm for registration between a large-scale point cloud and a close-proximity scanned point cloud, providing a localization solution that is fully independent of prior information about the initial positions of the two point cloud coordinate systems. The algorithm, denoted LORAX, selects super-points-local subsets of points-and describes the geometric structure of each with a low-dimensional descriptor. These descriptors are then used to infer potential matching regions for an efficient coarse registration process, followed by a fine-tuning stage. The set of super-points is selected by covering the point clouds with overlapping spheres, and then filtering out those of low-quality or nonsalient regions. The descriptors are computed using state-of-the-art unsupervised machine learning, utilizing the technology of deep neural network based auto-encoders. This novel framework provides a strong alternative to the common practice of using manually designed key-point descriptors for coarse point cloud registration. Utilizing super-points instead of key-points allows the available geometrical data to be better exploited to find the correct transformation. Encoding local 3D geometric structures using a deep neural network auto-encoder instead of traditional descriptors continues the trend seen in other computer vision applications and indeed leads to superior results. The algorithm is tested on challenging point cloud registration datasets, and its advantages over previous approaches as well as its robustness to density changes, noise and missing data are shown.

关键词： Three-dimensional displays Neural networks algorithm design and analysis Two dimensional displays Iterative closest point algorithm Computer vision Robustness

来源：评论

学校读者我要写书评

暂无评论

Algebraic Particle Swarm Optimization for the Permutations Search Space

Algebraic Particle Swarm Optimization for the Permutations S...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Baioletti, Marco Milani, Alfredo Santucci, Valentino Univ Perugia Dept Math & Comp Sci Perugia Italy

ISBN: (纸本)9781509046010

Particle Swarm Optimization (PSO), though being originally introduced for continuous search spaces, has been increasingly applied to combinatorial optimization problems. In particular, we focus on the PSO applications to permutation problems. As far as we know, the most popular PSO variants that produce permutation solutions are those based on random key techniques. In this paper, after highlighting the main criticalities of the random key approach, we introduce a totally discrete PSO variant for permutation-based optimization problems. The proposed algorithm, namely Algebraic PSO (APSO), simulates the original PSO design in permutations search space. APSO directly represents the particle positions and velocities as permutations. The APSO search scheme is based on a general algebraic framework for combinatorial optimization previously, and successfully, introduced in the context of discrete differential evolution schemes. The particularities of the PSO design scheme arouse new challenges for the algebraic framework: the non-commutativity of the velocity terms, and the rationale behind the PSO inertial move. design solutions have been proposed for both the issues, and two APSO variants are provided. Experiments have been held to compare the performances of the APSO schemes with respect to the random key based PSO schemes in literature. Widely adopted benchmark instances of four popular permutation problems have been considered. The experimental results clearly show, with high statistical evidence, that APSO outperforms its competitors.

关键词： Decoding Particle swarm optimization Optimization algorithm design and analysis Sociology Statistics Topology

来源：评论

学校读者我要写书评

暂无评论

Efficiency Based Comparative analysis of Selected Classical MPPT Methods

Efficiency Based Comparative Analysis of Selected Classical ...

引用

IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC)

作者： Canchola Zamora, A. Vazquez, G. Sosa, J. M. Martinez-Rodriguez, P. R. Juarez, M. A. ITESI Lab Elect & Power Elect Km 12-5 Carr Irapuato Silao Guanajuato 36821 Mexico UASLP Sch Sci San Luis Potosi 78290 Slp Mexico

ISBN: (纸本)9781538608197

The control system block in a photovoltaic (PV) system includes the algorithm which makes possible the PV system operation under adequate conditions to extract the maximum electrical power available from the PV array, this algorithm is commonly called Maximum Power Point Tracker (MPPT). In the literature, different algorithms that researchers have developed, some more efficient, more easily to implement, more robust and faster than others, have been reported. Therefore, in this paper a comparative analysis between frequently used MPPT methods is presented. The methods considered in this analysis correspond to the classical Hill Climbing method, Perturb and Observe (P&O) method and the Incremental Conductance (INC) technique. The analysis has been oriented to measure the efficiency of each method being this parameter one of the most important to determine their performance. The simulated results permit to analyze the MPPT algorithms between them, in such a way the reader can discern the most appropriate method for his own application.

关键词： Maximum power point trackers Radiation effects Voltage measurement algorithm design and analysis Short-circuit currents Oscillators Generators

来源：评论

学校读者我要写书评

暂无评论

Methods for Order Reduction of Zonotopes 56

Methods for Order Reduction of Zonotopes

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Kopetzki, Anna-Kathrin Schuermann, Bastian Althoff, Matthias Tech Univ Munich Fac Comp Sci Robot & Embedded Syst D-85748 Garching Germany

ISBN: (纸本)9781509028733

Zonotopes are a special subclass of polytopes, which have several favorable properties: They can be represented in a compact way and they are closed under the Minkowski sum as well as under linear transformations. Zonotopes are a popular set representation used e.g. for reachability analysis of dynamic systems, set-based observers and robust control. The complexity of algorithms that work on zonotopes strongly depends on their order (i.e. their number of generators and dimensions), which is often increased by operations like the Minkowski sum. Thus, to keep computations efficient, zonotopes of high orders are often over-approximated as tight as possible by zonotopes of smaller order. This paper has two main contributions: First, we propose new methods based on principle component analysis (PCA), clustering and constrained optimization for tight over-approximation of zonotopes. Second, we provide an overview of the most important known methods for order reduction and compare the performance of new and known methods in low-and high-dimensional spaces.

关键词： Generators algorithm design and analysis Covariance matrices Principal component analysis Reachability analysis Optimization Matrix decomposition

来源：评论

学校读者我要写书评

暂无评论

An Approach for Detecting Groundwater Runoff Connectivity using Cluster analysis

An Approach for Detecting Groundwater Runoff Connectivity us...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Kang, Xiaojun Zhao, Xuguang Guo, Caixia Ding, Junhua China Univ Geosci Sch Comp Sci Wuhan Hubei Peoples R China Wuhan Acad Agr Sci & Technol Wuhan Hubei Peoples R China East Carolina Univ Dept Comp Sci Greenville NC USA

ISBN: (纸本)9781538616451

Detecting the groundwater runoff connectivity is important for mining and environment protection. However, traditional physical and chemical experiments based approaches are neither efficient nor effective. Experimental results have shown the bacterial community in an isolated well contains unique DNA sequences, and the bacterial communities in connected wells have common DNA sequences that are not expected in two isolated communities. In this paper, we applied a variety of clustering methods to the bacterial data of groundwater that were acquired from a group of wells, to obtain the distribution of the bacterial communities among the wells based on DNA sequences. In addition, we conducted a serials of experiments to show the distribution of the bacterial communities can indicate the groundwater runoff connectivity. The clustering results are consistent to the experimental results of the traditional physical and chemical experiments. The research shows the cluster analysis of the distribution of bacterial communities is an efficient and effective approach for detecting the groundwater runoff connectivity.

关键词： Microorganisms Clustering algorithms DNA Chemicals Sequential analysis Partitioning algorithms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

OSCAR: Optimizing SCrAtchpad Reuse for Graph Processing

OSCAR: Optimizing SCrAtchpad Reuse for Graph Processing

引用

IEEE High Performance Extreme Computing Conference (HPEC)

作者： Singapura, Shreyas G. Srivastava, Ajitesh Kannan, Rajgopal Prasanna, Viktor K. Univ Southern Calif Los Angeles CA 90089 USA Army Res Lab West Los Angeles CA 90094 USA

ISBN: (纸本)9781538634721

Recently, architectures with scratchpad memory are gaining popularity. These architectures consist of low bandwidth, large capacity DRAM and high bandwidth, user addressable small capacity scratchpad. Existing algorithms must be redesigned to take advantage of the high bandwidth while overcoming the constraint on capacity of scratchpad. In this paper, we propose an optimized edge-centric graph processing algorithm for scratchpad based architectures. Our key contribution is significant reduction in (slower) DRAM accesses through intelligent reuse of scratchpad data. We trade off reduction in DRAM accesses for slightly higher scratchpad accesses. However, due to the much higher bandwidth of scratchpad, the total memory access cost (DRAM + scratchpad) is significantly reduced. We validate our analysis with experiments on real world graphs using a simulator which mimics the scratchpad based architecture using Single Source Shortest Path (SSSP) and Breadth First Search (BFS). Our experimental results demonstrate 1.7x to 2.7x reduction in DRAM accesses leading to an improvement of 1.4x to 2x in total memory (DRAM + scratchpad) accesses.

关键词： Random access memory Bandwidth Computer architecture algorithm design and analysis Three-dimensional displays System-on-chip Program processors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 80 81 82 83 84 85 86 87 88 89 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：