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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是781-790 订阅

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

详细简洁

排序：

A Self-Balanced Min-Cut algorithm for Image Clustering 16

A Self-Balanced Min-Cut Algorithm for Image Clustering

引用

16th IEEE International Conference on Computer Vision (ICCV)

作者： Chen, Xiaojun Haung, Joshua Zhexue Nie, Feiping Chen, Renjie Wu, Qingyao Shenzhen Univ Coll Comp Sci & Software Shenzhen 518060 Peoples R China Northwestern Polytech Univ Sch Comp Sci Xian 710072 Shaanxi Peoples R China Northwestern Polytech Univ Ctr OPTIMAL Xian 710072 Shaanxi Peoples R China South China Univ Technol Sch Software Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538610329

Many spectral clustering algorithms have been proposed and successfully applied to image data analysis such as content based image retrieval, image annotation, and image indexing. Conventional spectral clustering algorithms usually involve a two-stage process: eigendecomposition of similarity matrix and clustering assignments from eigenvectors by k-means or spectral rotation. However, the final clustering assignments obtained by the two-stage process may deviate from the assignments by directly optimize the original objective function. Moreover, most of these methods usually have very high computational complexities. In this paper, we propose a new min-cut algorithm for image clustering, which scales linearly to the data size. In the new method, a self-balanced min-cut model is proposed in which the Exclusive Lasso is implicitly introduced as a balance regularizer in order to produce balanced partition. We propose an iterative algorithm to solve the new model, which has a time complexity of O(n) where n is the number of samples. Theoretical analysis reveals that the new method can simultaneously minimize the graph cut and balance the partition across all clusters. A series of experiments were conducted on both synthetic and benchmark data sets and the experimental results show the superior performance of the new method.

关键词： Clustering algorithms algorithm design and analysis Linear programming Laplace equations Software algorithms Partitioning algorithms Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Observer for a Distributed Linear System with a Changing Neighbor Graph 56

A Hybrid Observer for a Distributed Linear System with a Cha...

引用

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

作者： Wang, L. Morse, A. S. Fullmer, D. Liu, J. Yale Univ Dept Elect Engn New Haven CT 06520 USA SUNY Stony Brook Stony Brook NY 11794 USA

A hybrid observer is described for estimating the state of an m > 0 channel, n-dimensional, continuous-time, linear system of the form = Ax, y(i) = C(i)x, i is an element of {1, 2, ... , m}. The system's state... 详细信息

ISBN: (纸本)9781509028733

A hybrid observer is described for estimating the state of an m > 0 channel, n-dimensional, continuous-time, linear system of the form <(x)over dot> = Ax, y(i) = C(i)x, i is an element of {1, 2, ... , m}. The system's state x is simultaneously estimated by m agents assuming each agent i senses y(i) and receives appropriately defined data from each of its current neighbors. Neighbor relations are characterized by a time-varying directed graph N(t) whose vertices correspond to agents and whose arcs depict neighbor relations. Agent i updates its estimate x(i) of x at "event times" t(1), t(2), ... using a local continuous-time linear observer and a local parameter estimator which for each j >= 1, iterates q times during the time interval [t(j-1), t(j)) to obtain an estimate of x(t(j)). Subject to the assumptions that none of the C-i are zero, the neighbor graph N(t) is strongly connected for all time, and the system whose state is to be estimated is jointly observable, it is shown that for any number lambda > 0 it is possible to choose q and the local observer gains so that each estimate x(i) converges to x as fast as e(-lambda t) converges to zero.

关键词： Observers Linear systems Convergence Kernel algorithm design and analysis Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Parameter Optimization of Block Interleaver for Polar Coding with Bit-interleaved Coded Modulation 8

Parameter Optimization of Block Interleaver for Polar Coding...

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Choi, Yeon Joon Kim, Jong-Hwan Kim, Sang-Hyo Sungkunkwan Univ Coll Informat & Commun Engn Suwon South Korea

ISBN: (纸本)9781509040322

A parameter optimization scheme of block interleaver for polar coding with bit-interleaved coded modulation (BICM) is proposed in this paper. We analyze the characteristics of a random interleaver applied to polar codes with high-order modulation, which is ideal but infeasible to implement. Then we derive the parameter optimization algorithm of block interleaver for polar coding with BICM. The block interleaver optimized by our proposed scheme has a significant performance gain over the block interleaver with the modulation order as the width in 16-ary quadratic amplitude modulation (16-QAM) signaling. Moreover, it has the comparable performance with the random interleaver for 16-QAM.

关键词： Modulation Encoding Decoding Optimization algorithm design and analysis 3GPP Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Sizing Optimization of a Steel Girder Bridge with a Simple Target-Driven approach

Multiobjective Sizing Optimization of a Steel Girder Bridge ...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Marchi, Mariapia Rizzian, Luca Costanzo, Stefano ESTECO SpA AREA Sci PkLoc Padriciano 99 I-34149 Trieste Italy Univ Trieste Dept Engn & Architecture Trieste Italy

ISBN: (纸本)9781509046010

We present a simple strategy for multiobjective target-driven optimization and apply it to the sizing optimization of a steel girder bridge. Users or decision makers are asked to express their preferences (based on their previous experience) in terms of desired target objective values to drive the optimization towards the most preferred regions of the Pareto front. This can lead to a more efficient exploration of specific regions of the objective space and reduce the computational cost of finding desirable solutions. This strategy combines a-priori with interactive preference-handling approaches. These methods have recently received more attention in the evolutionary multiobjective optimization community. The proposed algorithm is described in detail and compared with existing methods. Benchmarks on standard mathematical test functions as well as on a realistic structural engineering sizing optimization problem are provided.

关键词： Optimization Search problems Linear programming algorithm design and analysis Genetic algorithms Standards Steel

来源：评论

学校读者我要写书评

暂无评论

Efficient Plant Leaf Representations: A Comparative Study

Efficient Plant Leaf Representations: A Comparative Study

引用

IEEE Region 10 Conference (TENCON)

作者： Prasad, Shitala Peddoju, Sateesh K. Ghosh, Debashis Nanyang Technol Univ Biometr & Forens Lab Singapore Singapore IIT Roorkee Dept CSE HPC Lab Roorkee Uttar Pradesh India IIT Roorkee Dept ECE SP Lab Roorkee Uttar Pradesh India

ISBN: (纸本)9781509011346

This paper studies various different ways of representing plant leaves in different feature space to recognize them accurately and efficiently in changing scenario and dimension. Here, leaves are represented as: (i) statistical features - relative sub-image sparse coefficient (RSSC), (ii) shape features - angle view projection (AVP), (iii) multi-resolution features - Gabor Wavelet transform combined with gray level co-occurrence matrix (GWT-GLCM), (iv) deep features - convolutional neural network (CNN) and (v) hand-crafted ResNet features. It is experimentally found that all the above proposed algorithms outperform the state-of-the-arts and the hand-crafted GaborResNet feature space among them is the superior approach. This study also help researchers in analyzing the pattern distributions of the same object in different feature spaces.

关键词： Shape Image color analysis Feature extraction Image resolution Biometrics (access control) Transforms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An Efficient algorithm for Estimating Carrier Frequency Offset of APSK Signal 2

An Efficient Algorithm for Estimating Carrier Frequency Offs...

引用

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

作者： Li Dongbo Ou Yangxi Information Engineering University

This paper presents an effective algorithm for estimating carrier frequency offset of APSK modulated signal. The data of the signal is obtained after the process of timing synchronization. The algorit

ISBN: (纸本)9781467389808

关键词： Frequency estimation Synchronization Estimation algorithm design and analysis Frequency modulation

来源：评论

学校读者我要写书评

暂无评论

Learning Proximal Operators: Using Denoising Networks for Regularizing Inverse Imaging Problems 16

Learning Proximal Operators: Using Denoising Networks for Re...

引用

16th IEEE International Conference on Computer Vision (ICCV)

作者： Meinhardt, Tim Moeller, Michael Hazirbas, Caner Cremers, Daniel Tech Univ Munich Munich Germany Univ Siegen Siegen Germany

ISBN: (纸本)9781538610329

While variational methods have been among the most powerful tools for solving linear inverse problems in imaging, deep (convolutional) neural networks have recently taken the lead in many challenging benchmarks. A remaining drawback of deep learning approaches is their requirement for an expensive retraining whenever the specific problem, the noise level, noise type, or desired measure of fidelity changes. On the contrary, variational methods have a plug-and-play nature as they usually consist of separate data fidelity and regularization terms. In this paper we study the possibility of replacing the proximal operator of the regularization used in many convex energy minimization algorithms by a denoising neural network. The latter therefore serves as an implicit natural image prior, while the data term can still be chosen independently. Using a fixed denoising neural network in exemplary problems of image deconvolution with different blur kernels and image demosaicking, we obtain state-of-the-art reconstruction results. These indicate the high generalizability of our approach and a reduction of the need for problem-specific training. Additionally, we discuss novel results on the analysis of possible optimization algorithms to incorporate the network into, as well as the choices of algorithm parameters and their relation to the noise level the neural network is trained on.

关键词： Noise reduction Mathematical model Neural networks Hafnium Gold Training algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

design-for-Test and Test Time Optimization for 3D SOCs 48

Design-for-Test and Test Time Optimization for 3D SOCs

引用

IEEE International Test Conference (ITC)

作者： Roy, Surajit Kumar Giri, Chandan Indian Inst Engn Sci & Technol Dept Informat Technol Sibpur 711103 Howrah India

ISBN: (纸本)9781538634134

Three dimensional (3D) integration based on through-Silicon-Via (TSV) is currently evolving as an area of great interest in modern semiconductor industry. 3D integration provides higher performance, bandwidth and lower power consumption. But due to scaling in technology features these chips are more complex. Hence, testing of these 3D integrated circuits (ICs) is a challenging task. Effective test architecture design and optimization techniques are essential to minimize the manufacturing test cost. This paper addresses test architecture optimization and design-for-Test (DfT) for 3D ICs. We design test wrapper for 3D SOC using minimum number of TSVs. Heuristic algorithms are proposed to minimize test time for 3D SOC. Also, TSVs for test access is limited due to small chip area. To address this issue, algorithms are proposed to minimize overall test time considering all possible partial stacks and complete stack for 3D IC with hard dies under TSV constraint. We next describe strategies to identify faulty TSVs in reduced test time. Finally, we present techniques for recovery of those faulty TSVs in 3D IC.

关键词： Through-silicon vias Three-dimensional displays Testing Optimization algorithm design and analysis Two dimensional displays

来源：评论

学校读者我要写书评

暂无评论

Research on Mining Global Maximal Frequent Itemsets for Health Big Data 3rd

Research on Mining Global Maximal Frequent Itemsets for Heal...

引用

2017 IEEE 第3届信息技术与机电一体化工程国际学术会议(ITOEC 2017)

作者： Bo He Jianhui Pei School of Computer Science and Engineering ChongQing University of Technology Key Laboratory of Statistical information technology and data mining State Statistics BureauChengDu University of Information Technology Guizhou Key Laboratory of Power Big Data Guizhou Institute of Technology

Traditional mining algorithms did not suit mining of global maximal frequent ***,a new mining algorithm of global maximal frequent itemsets for health big data,namely,NMAGMFI algorithm

ISBN: (纸本)9781509053643;9781509053636

Traditional mining algorithms did not suit mining of global maximal frequent ***,a new mining algorithm of global maximal frequent itemsets for health big data,namely,NMAGMFI algorithm

关键词： Itemsets Data mining Frequency modulation Big Data algorithm design and analysis Information technology

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Endmember Extraction for Hyperspectral Images

Multi-objective Endmember Extraction for Hyperspectral Image...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Li, Hao Ma, Jingjing Liu, Jia Gong, Maoguo Zhang, Mingyang Xidian Univ Minist Educ Key Lab Intelligent Percept & Image Understanding 2 South Taibai Rd Xian 710071 Shaanxi Peoples R China

ISBN: (纸本)9781509046010

Endmember extraction is a critical step of spectral unmixing. In this paper, a novel endmember extraction algorithm based on evolutionary multi-objective optimization is proposed for hyperspectral remote sensing images. In the proposed method, endmember extraction is modeled as a multi-objective optimization problem. Then the root mean square error between the original image and its remixed image and the number of endmembers are chosen as two conflicting objective functions, which are simultaneously optimized by particle swarm optimization algorithm to find the best tradeoff solutions. In order to promote diversity and speed up the convergence of the algorithm, a new particle status updating strategy and a novel method for selecting leaders are designed. The experimental results on both simulated and real hyperspectral remote sensing images confirm the performance of the proposed approach over some existing methods.

关键词： Hyperspectral imaging algorithm design and analysis Indexes Pareto optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 75 76 77 78 79 80 81 82 83 84 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：