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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,291 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

17,627 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,762 篇 电气工程
- 2,981 篇 信息与通信工程
- 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,959 篇 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,761 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

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

共 82959 条记录，以下是641-650 订阅

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

详细简洁

排序：

Experimental Ripple Suppression Performance of a Virtual Infinite Capacitor 22

Experimental Ripple Suppression Performance of a Virtual Inf...

引用

International Conference on Applied Electronics (AE)

作者： Lin, Shuyue Qi, Pengyuan Lin, Jun Zhao, Xiaowei Weiss, George Ran, Li Univ Warwick Sch Engn Coventry W Midlands England Tel Aviv Univ Sch Elect Engn IL-69978 Ramat Aviv Israel

ISBN: (纸本)9788026106425

We experimentally show the performance of a Virtual Infinite Capacitor (VIC) in suppressing the voltage ripple. VIC mainly uses a bi-directional DC-DC converter with only two small capacitors inside to mimic the filtering process of a large capacitor by applying suitable control algorithms. It was firstly proposed in [1], [2] and then improved in [3] in both control algorithms and circuit designs. Based on VIC's control algorithm in [3], we injected the DC voltage together with a 50Hz, 85V (peak-to-peak) sinusoidal ripple to the VIC, and we achieved outstanding filtering performance in both the simulation and experiment. The 85V voltage ripple is eliminated and the DC voltage is extracted with no visible 50Hz ripples.

关键词： Capacitors Integrated circuit modeling Resistors Power electronics algorithm design and analysis Voltage control Switches

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-evolutionary Multi-Agent System for Multi-objective Layout Optimization of Satellite Module

A Cooperative Co-evolutionary Multi-Agent System for Multi-o...

引用

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

作者： Zhang, Zihui Sun, Xueyan Hou, Luyang Chen, Wang Shi, Yanjun Cao, Xuyang Dalian Univ Technol Dalian Peoples R China Concordia Univ Montreal PQ Canada

ISBN: (纸本)9781538616451

we herein propose a new collaborative framework, called cooperative co-evolutionary multi-agent system(CCEMAS), for solving multi-objective layout optimization problems. Every agent in CCEMAS is encoded as a multi-objective cooperative co-evolutionary strategy, including an algorithm and its setting. In the iterative procedure, the strategies will evolve along with the evolution of the agent team, and use different algorithms and settings during different stages of problem solving. A multi-objective optimization of satellite module is solved to validate the method and obtain the Pareto optimal solutions. Finally, the evolution process of multi-objective cooperative co-evolutionary strategies in agents is analyzed for constructing new multi-objective cooperative co-evolutionary algorithms for this problem in the future.

关键词： Satellites Collaboration Layout Pareto optimization Multi-agent systems algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Backtracking and Dynamic Bit-shield Anti-Collision algorithm in RFID System 2

Backtracking and Dynamic Bit-shield Anti-Collision Algorithm...

引用

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

作者： Mo Lei Chen HuaLi Fang MengXu Ren Ju Chengdu Aeronautic Polytechnic The Innovation Base of School-Enterprise Cooperation Aviation Electronic Technology in Sichuan SiChuan TOP IT Vocational Institute

In a radio frequency identification system, The lower identification efficiency problem of system brought by multi tags collision has become the bottleneck problem of the application of RFID technolog

ISBN: (纸本)9781467389808

关键词： Heuristic algorithms Radiofrequency identification algorithm design and analysis Satellite broadcasting Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Segregated Targeting for Resource Allocation Networks with Dedicated Sources 6

Segregated Targeting for Resource Allocation Networks with D...

引用

6th International Symposium on Advanced Control of Industrial Processes (AdCONIP)

作者： Jain, Sheetal Bandyopadhyay, Santanu Indian Inst Technol Dept Energy Sci & Engn Bombay 400076 Maharashtra India

ISBN: (纸本)9781509043972

Segregated targeting problems consist of a set of sources called internal sources and multiple sets of demands called zones. Each zone consists of a set of demands and a unique resource. Internal sources are allocated to different zones such that the total resource requirement for the overall problem is minimized. In this paper, the problem definition is extended to include dedicated sources in each zone. These dedicated internal sources are specific to a zone in which they are present and are not shared with other zones. The primary objective of this paper is to develop an algorithm to determine the minimum resource requirement for the segregated problem with dedicated sources. Using rigorous mathematical arguments, a non-dimensional number is determined that dictates the allocation of an internal source to a zone for overall resource optimality. The applicability of the proposed algorithm is demonstrated through an illustrative example of carbon constrained energy sector planning.

关键词： Minimization Planning Industries Hydrogen algorithm design and analysis Resource management Carbon

来源：评论

学校读者我要写书评

暂无评论

Unbiased Sparse Subspace Clustering By Selective Pursuit 14

Unbiased Sparse Subspace Clustering By Selective Pursuit

引用

14th Conference on Computer and Robot Vision (CRV)

作者： Ackermann, Hanno Rosenhahn, Bodo Yang, Michael Ying Leibniz Univ Hannover Inst Informat Proc Hannover Germany Univ Twente Scene Understanding Grp Enschede Netherlands

ISBN: (纸本)9781538628188

Sparse subspace clustering (SSC) is an elegant approach for unsupervised segmentation if the data points of each cluster are located in linear subspaces. This model applies, for instance, in motion segmentation if some restrictions on the camera model hold. SSC requires that problems based on the l(1)-norm are solved to infer which points belong to the same subspace. If these unknown subspaces are well-separated this algorithm is guaranteed to succeed. The question how the distribution of points on the same subspace effects their clustering has received less attention. One case has been reported in which points of the same model are erroneously classified to belong to different subspaces. In this work, it will be theoretically shown when and why such spurious clusters occur. This claim is further substantiated by experimental evidence. Two algorithms based on the Dantzig selector and subspace selector are proposed to overcome this problem, and good results are reported.

关键词： Sparse matrices Clustering algorithms Motion segmentation Computer vision Data models algorithm design and analysis Distributed databases

来源：评论

学校读者我要写书评

暂无评论

Automatically design Distance Functions for Graph-based Semi-Supervised Learning 16

Automatically Design Distance Functions for Graph-based Semi...

引用

16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications / The 11th IEEE International Conference on Big Data Science and Engineering / The 14th IEEE International Conference on Embedded Software and Systems

作者： Miquilini, Patricia Rossi, Rafael G. Quiles, Marcos G. de Melo, Vinicius V. Basgalupp, Marcio P. Univ Fed Sao Paulo Inst Sci & Technol Sao Paulo Brazil Univ Fed Mato Grosso do Sul Campo Grande MS Brazil

ISBN: (纸本)9781509049066

Automatic data classification is often performed by supervised learning algorithms, producing a model to classify new instances. Reflecting that labeled instances are expensive, semi supervised learning (SSL) methods prove to be an alternative to performing data classification, once the learning demands only a few labeled instances. There are many SSL algorithms, and graph-based ones have significant features. In particular, graph-based models grant to identify classes of different distributions without prior knowledge of statistical model parameters. However, a drawback that might influence their classification performance relays on the construction of the graph, which requires the measurement of distances (or similarities) between instances. Since a particular distance function can enhance the performance for some data sets and decrease to others, here, we introduce a novel approach, called GEAD, a Grammatical Evolution for Automatically designing Distance functions for Graph-based semi-supervised learning. We perform extensive experiments with 100 public data sets to assess the performance of our approach, and we compare it with traditional distance functions in the literature. Results show that GEAD is capable of designing distance functions that significantly outperform the baseline manually-designed ones regarding different predictive measures, such as Micro-F-1, and Macro-F-1.

关键词： Semisupervised learning algorithm design and analysis Supervised learning Classification algorithms Euclidean distance Data models

来源：评论

学校读者我要写书评

暂无评论

Novel Clique Enumeration Heuristic for Detecting Overlapping Clusters

Novel Clique Enumeration Heuristic for Detecting Overlapping...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Schmitt, Rafael Ramos, Pedro Santiago, Rafael Lamb, Luis Univ Vale Itajai Lab Appl Intelligence Itajai Brazil Univ Fed Rio Grande do Sul Inst Informat Porto Alegre RS Brazil

ISBN: (纸本)9781509046010

There are several known methods for detecting overlapping communities in graphs, each one having their advantages and limitations. The Clique Percolation Method (CPM) is one such method. CPM works by joining highly connected subgraphs (cliques) and using it to find the graph communities. However, the clique enumeration problem is NP-Hard, taking exponential time to be solved. This makes its use impractical in large real-world networks and applications. The aim of this paper is to present an efficient heuristic to enumerate cliques. This enables the Clique Percolation Method to detect overlapping communities in networks containing thousands of nodes. The analyses showed that our novel heuristic is competitive with other known methods regarding solution quality and we also make the CPM more scalable.

关键词： Heuristic algorithms Clustering algorithms Binary trees Electronic mail Context Random access memory algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

[Research Paper] Formalizing Interruptible algorithms for Human over-the-loop Analytics 5

[Research Paper] Formalizing Interruptible Algorithms for Hu...

引用

IEEE International Conference on Big Data (IEEE Big Data)

作者： Graham, Austin Liang, Yan Gruenwald, Le Grant, Christan Univ Oklahoma Sch Comp Sci Norman OK 73071 USA

ISBN: (纸本)9781538627150

Traditional data mining algorithms are exceptional at seeing patterns in data that humans cannot, but are often confused by details that are obvious to the organic eye. algorithms that include humans "in-the-loop" have proved beneficial for accuracy by allowing a user to provide direction in these situations, but the slowness of human interactions causes execution times to increase exponentially. Thus, we seek to formalize frameworks that include humans "over-the-loop", giving the user an option to intervene when they deem it necessary while not having user feedback be an execution requirement. With this strategy, we hope to increase the accuracy of solutions with minimal losses in execution time. This paper describes our vision of this strategy and associated problems.

关键词： algorithm design and analysis Clustering algorithms Indexes Complexity theory Data mining Computer science

来源：评论

学校读者我要写书评

暂无评论

Demo Abstract: RPiaaS: A Raspberry Pi Testbed for Validation of Cloud Resource Management Strategies

Demo Abstract: RPiaaS: A Raspberry Pi Testbed for Validation...

引用

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Maenhaut, Pieter-Jan Volckaert, Bruno Ongenae, Veerle De Turck, Filip Univ Ghent Fac Engn & Architecture Dept Informat Technol Valentin Vaerwyckweg 1 B-9000 Ghent Belgium Univ Ghent IDLab Dept Informat Technol Imec iGent Technol Pk Zwijnaarde 15 B-9052 Ghent Belgium

ISBN: (纸本)9781538627846

With cloud computing, efficient resource management is of great importance, as it has a direct impact on the scalability of the cloud application, and can result in significant energy and cost reductions. In recent years, a lot of research has been done regarding the management of cloud resources, resulting in multiple novel resource allocation strategies. Validation of these strategies however is often only based on simulations, as large experiments using real cloud infrastructure are both expensive and time-consuming. In this demo we present RPiaaS, a low-cost and energy-efficient cloud testbed built using Raspberry Pi's. The testbed provides an easy-to-use environment for the initial evaluation of novel cloud resource management strategies, and is designed to facilitate the step from simulations towards experimental evaluations on larger cloud testbeds.

关键词： Cloud computing Resource management Hardware Computational modeling algorithm design and analysis Noise measurement Monitoring

来源：评论

学校读者我要写书评

暂无评论

Maximal Clique Enumeration with Data-Parallel Primitives 7

Maximal Clique Enumeration with Data-Parallel Primitives

引用

IEEE 7th Symposium on Large Data analysis and Visualization (LDAV)

作者： Lessley, Brenton Perciano, Talita Mathai, Manish Childs, Hank Bethel, E. Wes Univ Oregon Eugene OR 97403 USA Lawrence Berkeley Natl Lab Berkeley CA USA

ISBN: (纸本)9781538606179

The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in several research areas. We consider maximal clique enumeration on shared-memory, multi-core architectures and introduce an approach consisting entirely of data-parallel operations, in an effort to achieve efficient and portable performance across different architectures. We study the performance of the algorithm via experiments varying over benchmark graphs and architectures. Overall, we observe that our algorithm achieves up to a 33-time speedup and 9-time speedup over state-of-the-art distributed and serial algorithms, respectively, for graphs with higher ratios of maximal cliques to total cliques. Further, we attain additional speedups on a GPU architecture, demonstrating the portable performance of our data-parallel design.

关键词： Arrays algorithm design and analysis Vegetation Data visualization Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 61 62 63 64 65 66 67 68 69 70 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：