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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,666 篇 会议
4,557 篇 期刊文献

馆藏范围

83,223 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17,895 篇 工学
- 7,016 篇 电气工程
- 7,014 篇 计算机科学与技术...
- 3,033 篇 信息与通信工程
- 2,693 篇 控制科学与工程
- 2,492 篇 软件工程
- 1,633 篇 电子科学与技术（可...
- 1,504 篇 仪器科学与技术
- 1,417 篇 机械工程
- 269 篇 航空宇航科学与技...
- 242 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 199 篇 交通运输工程
- 142 篇 测绘科学与技术
- 131 篇 生物工程
- 96 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 85 篇 核科学与技术
- 69 篇 光学工程
1,955 篇 理学
- 956 篇 系统科学
- 555 篇 物理学
- 205 篇 数学
- 153 篇 生物学
- 81 篇 地球物理学
1,748 篇 管理学
- 1,684 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
251 篇 医学
- 182 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
56 篇 教育学
- 55 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

83,223 篇 algorithm design...
5,912 篇 clustering algor...
5,313 篇 heuristic algori...
5,279 篇 computer science
5,159 篇 optimization
4,706 篇 signal processin...
4,561 篇 hardware
4,075 篇 genetic algorith...
4,010 篇 computational mo...
4,004 篇 convergence
3,988 篇 performance anal...
3,652 篇 data mining
3,584 篇 mathematical mod...
3,412 篇 testing
3,260 篇 routing
2,994 篇 equations
2,991 篇 educational inst...
2,987 篇 robustness
2,969 篇 partitioning alg...
2,889 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
70 篇 school of comput...
52 篇 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...
33 篇 department of el...
33 篇 department of el...
33 篇 department of el...
33 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
57 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
38 篇 li li
37 篇 jing zhang
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,938 篇 英文
941 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

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

共 83223 条记录，以下是4951-4960 订阅

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

详细简洁

排序：

Learning with few examples: an empirical study on leading classifiers

Learning with few examples: an empirical study on leading cl...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Salperwyck, Christophe Lemaire, Vincent Orange Labs Grp Profiling & Datamining F-22300 Lannion France

ISBN: (纸本)9781424496365

Learning algorithms proved their ability to deal with large amount of data. Most of the statistical approaches use defined size learning sets and produce static models. However in specific situations: active or incremental learning, the learning task starts with only very few data. In that case, looking for algorithms able to produce models with only few examples becomes necessary. The literature's classifiers are generally evaluated with criterion such as: accuracy, ability to order data ( ranking) ... But this classifiers' taxonomy can dramatically change if the focus is on the ability to learn with just few examples. To our knowledge, just few studies were performed on this problem. The study presented in this paper aims to study a larger panel of both algorithms (9 different kinds) and data sets (17 UCI bases).

关键词： algorithm design and analysis Benchmark testing Decision trees Logistics Machine learning Support vector machines Training active learning incremental learning leading classifiers learning (artificial intelligence) learning algorithms pattern classification statistical analysis statistical approaches

来源：评论

学校读者我要写书评

暂无评论

On Dimensionality Reduction of Massive Graphs for Indexing and Retrieval

On Dimensionality Reduction of Massive Graphs for Indexing a...

引用

IEEE 27th International Conference on Data Engineering (ICDE 2011)

作者： Aggarwal, Charu C. Wang, Haixun IBM TJ Watson Res Ctr Hawthorne NY 10532 USA Microsoft Res Asia Beijing Peoples R China

ISBN: (纸本)9781424489589

In this paper, we will examine the problem of dimensionality reduction of massive disk-resident data sets. Graph mining has become important in recent years because of its numerous applications in community detection, social networking, and web mining. Many graph data sets are defined on massive node domains in which the number of nodes in the underlying domain is very large. As a result, it is often difficult to store and hold the information necessary in order to retrieve and index the data. Most known methods for dimensionality reduction are effective only for data sets defined on modest domains. Furthermore, while the problem of dimensionality reduction is most relevant to the problem of massive data sets, these algorithms are inherently not designed for the case of disk-resident data in terms of the order in which the data is accessed on disk. This is a serious limitation which restricts the applicability of current dimensionality reduction methods. Furthermore, since dimensionality reduction methods are typically designed for database applications such as indexing, it is important to design the underlying data reduction method, so that it can be effectively used for such applications. In this paper, we will examine the difficult problem of dimensionality reduction of graph data in the difficult case in which the underlying number of nodes are very large and the data set is disk-resident. We will propose an effective sampling algorithm for dimensionality reduction and show how to perform the dimensionality reduction in a limited number of passes on disk. We will also design the technique to be highly interpretable and friendly for indexing applications. We will illustrate the effectiveness and efficiency of the approach on a number of real data sets.

关键词： algorithm design and analysis Bridges Computational complexity Data mining Indexing Partitioning algorithms Social network services data mining data reduction method dimensionality reduction method disk-resident data sets graph indexing graph mining graph retrieval graph theory

来源：评论

学校读者我要写书评

暂无评论

Method Sequence Generation for Multiple Object States using Dynamic Symbolic Execution

Method Sequence Generation for Multiple Object States using ...

引用

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

作者： Takamatsu, Hiroki Sato, Haruhiko Oyama, Satoshi Kurihara, Masahito Hokkaido Univ Grad Sch Informat Sci & Technol Sapporo Hokkaido Japan

ISBN: (纸本)9781479938407

Software testing in object-oriented programming requires not only test input data, but also method sequences. Method sequences create new instances and change object states as desired. Method sequence generation to get desired object states is challenging. Seeker is one of the state-of-the-art implementation to generate test cases with method sequences. However, the technique generates method sequences to change a value of only a single variable. Therefore, it cannot cover the branches that need to modify values of multiple variables. In this paper, we extend the technique in order to cover branches which require multiple desired object states. The proposed approach detects all related variables in uncovered branches and uses a fitness function to give method sequences an evaluation value to reduce candidate methods. We applied Seeker and the proposed approach to four open source projects. The result shows a 1-5% improvememt of branch coverage over Seeker and also indicates that the effectiveness of the proposed approach varies depending on some specific features of projects.

关键词： object-oriented programming program testing Seeker branch coverage candidate methods dynamic symbolic execution fitness function method sequence generation multiple desired object states open source projects software testing algorithm design and analysis Conferences Explosions Heuristic algorithms Libraries Software testing

来源：评论

学校读者我要写书评

暂无评论

Adaptive and Compressive Target Tracking Based on Feature Point Matching 23

Adaptive and Compressive Target Tracking Based on Feature Po...

引用

23rd International Conference on Pattern Recognition (ICPR)

作者： Li, Fengjiao Zhang, Yuanyuan Yan, Wei Qi Klette, Reinhard Shandong Acad Sci Informat Res Inst Jinan Shandong Peoples R China Auckland Univ Technol Auckland New Zealand

ISBN: (纸本)9781509048472

In compressive tracking algorithms, a feature reduction projection matrix is constructed by using compressed sensing theory. Target and non-target objects are discriminated by using a naive Bayesian classifier. Such an algorithm may ensure accuracy of target tracking in real-time. But it is not adaptive for tracking with respect to scales and rotations. In this paper, we propose a novel adaptive algorithm based on feature point matching for tracking objects which appear with various changes. We combine weight-average and improved compressive tracking algorithms together for tracking objects, then calculate the corresponding feature points between two subsequent frames of the same object for obtaining the target changes related to various scales and rotations. Our experimental results show that the improved algorithm effectively improves the accuracy of target tracking and ensures adaptability of the tracking algorithm.

关键词： Target tracking Feature extraction algorithm design and analysis Computational modeling Object tracking Adaptation models Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Reachability analysis of dynamic programming based controlled systems: an extended algorithm

Reachability analysis of dynamic programming based controlle...

引用

IEEE Conference on Control Applications (CCA)

作者： da Silva, Jorge Estrela de Sousa, Joao Borges Pereira, Fernando Lobo Porto Univ DEEC FEUP Fac Engn Elect & Comp Engn Dept P-4200465 Oporto Portugal Polytech Inst Porto Sch Engn Dept Elect Engn P-4200072 Oporto Portugal

ISBN: (纸本)9781479974092

This paper extends the algorithm proposed in [1]. In [1], the numerical approximation of the solution of dynamic programming problems is used as a candidate Lyapunov function V-L (x), in order to prove convergence of the closed loop system to a given target. That is done in the framework of sampled data systems. The described algorithm provides only a sufficient condition, which in many cases is not verified due to the deviations introduced by the approximations. In this paper, the previous algorithm is extended in order to compute the decrease in the candidate Lyapunov over multiple sampling periods, i. e., V-L (x (k + n)) - V-L (x (k)), with n is an element of N. Thus, it is expected that the verification procedure becomes more robust with respect to the deviations introduced by the numerical approximation of the control law and candidate Lyapunov function. The core of the algorithm is based on linear programming with polytopic convex constraints.

关键词： algorithm design and analysis Approximation algorithms Approximation methods Dynamic programming Heuristic algorithms Silicon Trajectory dynamic programming algorithm design and analysis Approximation method Heuristic algorithms Approximation algorithms trajectory reachability analysis Silicon Verification routine numerical approximation control law

来源：评论

学校读者我要写书评

暂无评论

Object Recognition and Path-Drawing for a Mobile Robot

Object Recognition and Path-Drawing for a Mobile Robot

引用

24th International Conference on Electronics, Communications and Computers (CONIELECOMP)

作者： Maldonado, Ruben Flores-Pulido, Leticia Hernandez Cuamatzi, Patrick Sanchez Perez, Carolina Rocio Autonomous Univ Tlaxcala Sch Technol & Engn Apizaco Tlaxcala Mexico

ISBN: (纸本)9781479934683

In this paper we propose a vision algorithm to object recognition during a mobile robot's journey in a controlled environment. Furthermore, another algorithm was used to drawing the path of the robot, which is based on the evaluation of a vision algorithm to provide results. The first algorithm uses color processing techniques to achieve an image thresholding and a Harris corner detector to recognize objects in a scene. A graphical user interface has been developed to perform the image analysis and the path-drawing in real time. These algorithms, working together, provided 97% as recognition rate.

关键词： edge detection graphical user interfaces image colour analysis image segmentation mobile robots object recognition path planning robot vision Harris corner detector color processing techniques controlled environment graphical user interface image analysis image thresholding mobile robot journey object recognition path-drawing vision algorithm algorithm design and analysis Cameras Detectors Image color analysis Mobile robots Robot vision systems

来源：评论

学校读者我要写书评

暂无评论

Stabilization of Three-link Acrobot via Hierarchical Linearization 54

Stabilization of Three-link Acrobot via Hierarchical Lineari...

引用

54th IEEE Conference on Decision and Control (CDC)

作者： Sekiguchi, Kazuma Tokyo City Univ Dept Mech Syst Engn Setagayaku Ku 1-28-1 Tamazutsumi Tokyo 1588557 Japan

ISBN: (纸本)9781479978861

Novel approach to linearize a multi-input non-linear system is introduced and applied to control a three-link acrobot. The proposed linearizing method, referred as hierarchical linearization, consists of two ideas;directional decoupling and autonomization. Using these ideas, subsystems and the control inputs for these subsystems are constructed hierarchically. In this paper, the hierarchical linearization is applied to a three-link acrobot and linearizes the system partially. Owing to the proposed method, stable zero dynamics is designed. In numerical simulation, the validity of the controller designed by the proposed method is verified.

关键词： Actuators algorithm design and analysis Dynamics Mechanical systems Nonlinear dynamical systems Numerical simulation Time-varying systems

来源：评论

学校读者我要写书评

暂无评论

algorithms for iterative phase noise estimation based on a truncated DCT expansion

Algorithms for iterative phase noise estimation based on a t...

引用

12th IEEE International Workshop on Signal Processing Advances in Wireless Communications

作者： Bhatti, Jabran Noels, Nele Moeneclaey, Marc Univ Ghent Dept Telecommun & Informat Proc Ghent Belgium

ISBN: (纸本)9781424493326

We present two phase noise estimation algorithms for single-carrier burst communications. The first and second estimation techniques (denoted as PEA1 and PEA2 respectively) are based on a truncated discrete cosine transform (DCT) basis expansion of the phase noise and of the corresponding phasor, respectively and do not require any knowledge of the phase noise statistics. An initial pilot-based estimate is iteratively improved by means of the expectation-maximization algorithm, yielding a soft-decision-directed phase noise estimate. The performances of PEA1 and PEA2 are compared in terms of the mean-square phase error and bit-error rate. Numerical results show that PEA2 out performs PEA1 for practical values of the signal-to-noise ratio.

关键词： algorithm design and analysis Bit error rate Discrete cosine transforms Estimation Phase estimation Phase noise Signal processing algorithms bit-error rate channel estimation discrete cosine transforms error statistics expectation-maximisation algorithm expectation-maximization algorithm iterative phase noise estimation algorithm phase noise signal-to-noise ratio single-carrier burst communications telecommunication networks truncated DCT expansion truncated discrete cosine transform

来源：评论

学校读者我要写书评

暂无评论

Meta-optimization method for wavelet-based damage identification in composite structures

Meta-optimization method for wavelet-based damage identifica...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Katunin, Andrzej Przystalka, Piotr Silesian Tech Univ Inst Fundamentals Machniery Design PL-44100 Gliwice Poland

ISBN: (纸本)9788360810583

The damage identification problem is one of crucial problems during operation of machines' elements made of polymeric composites. Therefore the appropriate non-destructive techniques should be developed in order to detect and identify the damages with the best possible accuracy. Moreover, such methods should be applicable in various testing conditions. One of the intensively developed directions in non-destructive damage assessment is a class of methods based on wavelet analysis of modal shapes of vibration applied for a tested structure. The effectiveness of an algorithm is strongly dependent on the type of applied wavelet and its parameters. The proposed approach uses a combination of the wavelet-based damage identification algorithm with multi-objective meta-optimization in order to select optimal parameters of applied wavelets and determine a front of optimal non-dominated solutions. Based on these solutions the operator can choose the desired accuracy of damage identification with respect to the suitable computation time.

关键词： Accuracy algorithm design and analysis Discrete wavelet transforms Optimization Signal processing algorithms damage assessment algorithm design and analysis discrete wavelet transform Signal processing algorithms composite structures MODAL SHAPE

来源：评论

学校读者我要写书评

暂无评论

Graph Compaction in Analyzing Large Scale Online Social Networks

Graph Compaction in Analyzing Large Scale Online Social Netw...

引用

IEEE International Conference on Communications (ICC) / Wireless Communications Symposium / 3rd Workshop on Optical Wireless Communications (OWC)

作者： Das, Sima Leopold, Jennifer Ghosh, Susmita Das, Sajal K. Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA Jadavpur Univ Dept Comp Sci & Engn Kolkata India

ISBN: (纸本)9781467389990

The real-world large scale networks motivate the need for parallel and distributed evaluation of network analysis and computational tasks for computational efficiency and application effectiveness. One of the essential tasks for parallel and distributed evaluation, is to have partitions over the underlying network graph. Over these partitions the computational or network analysis tasks are in turn processed in a distributed or parallel manner. It is interesting to use intrinsic communities of social networks as partitions, to be used as basic components in parallel and distributed computation. We propose two novel graph compaction algorithms that generate the desired compact graph of communities as a preprocessing stage to the parallel and distributed evaluation of computational tasks. To comply with heterogeneity in community structure and size, we use a flexible limit on them. We evaluate the structure and quality of our algorithms and hence its resulting communities over two distinct application networks. We show that the generated community structure, reasonably complies with the modular structure of the network. We evaluate the quality of the partitions, relative to the partitions generated using existing state-of-the-art approach, and compare the approaches to show better quality of our partitions in terms of number of graph cuts.

关键词： Compaction Partitioning algorithms Social network services algorithm design and analysis Indexes Upper bound Computer science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：