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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Local congestion and blockage aware routability analysis using adaptive flexible modeling

Local congestion and blockage aware routability analysis usi...

引用

IEEE International Conference on Electronics, Circuits and Systems (ICECS)

作者： Zhonghua Zhou Peter Hallschmid Andre Ivanov School of Electrical and Computer Engineering University of British Columbia Vancouver Canada Blackcomb Design Automation Inc. Vancouver Canada

ISBN: (纸本)9781509061143

Routing congestion is a significant challenge in integrated circuit design due to their ever-growing number of metal layers, the expanding set of design rules and exponential growth in complexity. This increases the need for an accurate congestion estimation methodology - this estimation approach must be fast such that it can be used within tight loops of other algorithms such as placement. An accurate modeling metric is presented in this paper which has the ability to take into account local congestion, design blockages, as well as the impact of routing due to the application progression. Results show that the congestion map is well predicted and matched with that of post-routing. Blockages are avoided in a similar way to that of a typical detailed router.

关键词： Routing Estimation algorithm design and analysis Pins design automation Electronic mail Optimization

来源：评论

学校读者我要写书评

暂无评论

Solar Power Prediction for Smart Community Microgrid

Solar Power Prediction for Smart Community Microgrid

引用

International Conference on Smart Computing (SMARTCOMP)

作者： Wellington Cabrera Driss Benhaddou Carlos Ordonez Dept. of Computer Science University of Houston Houston TX USA Engineering Technology University of Houston Houston TX USA

ISBN: (纸本)9781509008995

Urban areas host more than 50% of the world's populations, are responsible for 75% of energy consumption in the world, and they emit almost 80% of global carbon dioxide. There is an urgent need to develop "low carbon" cities that are smart and efficient and use renewable energy to foster the growth of the green economy. Smart grids are being developed to tackle these challenges through integration of renewable and green energy as well as energy efficiency. They are moving toward a concept of networked microgrids. Microgrids will enable the integration of distributed renewable energy such as roof top solar panels within smart city communities. For these microgrids to operate reliably and efficiently, prediction algorithms are a significant because of the fluctuation of solar energy and its dependence on weather. Prediction of energy is a component of microgrids energy management systems to optimize their operation. This paper presents a machine learning based algorithm, which learns a regression tree model with time of the day and humidity as main parameters. The regression tree model presents a promising accuracy. This work shows that solar panel prediction in Houston is heavily dependent on humidity of the region.

关键词： Microgrids Meteorology Regression tree analysis Prediction algorithms Autoregressive processes algorithm design and analysis Solar energy

来源：评论

学校读者我要写书评

暂无评论

Multiplatform HDL-description of the fast fourier transform module

Multiplatform HDL-description of the fast fourier transform ...

引用

IEEE NW Russia Young Researchers in Electrical and Electronic Engineering Conference (EIConRusNW)

作者： Yu. Savchenko A. Silantiev D. Kaleev A. Pereverzev Russian Federation National Research University of Electronic Technology Moscow

Characteristics of the known FFT module IP-cores as well as its basic building blocks were analyzed. The problem of creating a multiplatform HDL-description of the FFT-module for FPGA-based, semicustom or custom integrated circuits was identified. The approach to develop a universal HDL-description based on platform independent control unit and adopted to the platform main structural blocks was proposed.

关键词： Transforms Hardware Field programmable gate arrays Digital signal processing IP networks Hardware design languages algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Sungjin Im Shi Li Electrical Engineering and Computer Science University of California Merced CA USA Department of Computer Science and Engineering University at Buffalo Buffalo NY USA

ISBN: (纸本)9781509039340

In this paper we consider the classic scheduling problem of minimizing total weighted completion time on unrelated machines when jobs have release times, i.e, R|r ij | Σ j w j C j using the three-field notation. For this problem, a 2-approximation is known based on a novel convex programming (J. ACM 2001 by Skutella). It has been a long standing open problem if one can improve upon this 2-approximation (Open Problem 8 in J. of Sched. 1999 by Schuurman and Woeginger). We answer this question in the affirmative by giving a 1.8786-approximation. We achieve this via a surprisingly simple linear programming, but a novel rounding algorithm and analysis. A key ingredient of our algorithm is the use of random offsets sampled from non-uniform distributions. We also consider the preemptive version of the problem, i.e, R|r ij , pmtn|Σ j w j C j . We again use the idea of sampling offsets from non-uniform distributions to give the first better than 2-approximation for this problem. This improvement also requires use of a configuration LP with variables for each job's complete schedules along with more careful analysis. For both non-preemptive and preemptive versions, we break the approximation barrier of 2 for the first time.

关键词： Schedules Programming algorithm design and analysis Approximation algorithms Processor scheduling Optimal scheduling

来源：评论

学校读者我要写书评

暂无评论

A failure remember-driven differential evolution

A failure remember-driven differential evolution

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Xinchao Zhao Dongyue Liu Huiping Liu Wenbo Ai School of Science BUPT Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781509040940

Differential evolution (DE) is one of the most efficient and powerful algorithms for global optimization problems and exhibits remarkable performance in scientific and engineering fields. In the past few years, various improved variants have been studied by many researchers. However, the neighborhood and direction information is not completely utilized in exploration and exploitation stages. In this paper, a failure remember-driven self-adaptive differential evolution algorithm, ATBDE, is proposed, which uses “Top-Bottom” strategy with optional archive and a parameter self-adapting strategy driven by “Failure Remember” operation. Experimental comparisons indicate that ATBDE has a competitive performance when comparing with other DE algorithms.

关键词： algorithm design and analysis Sociology Statistics Thyristors Benchmark testing Telecommunications Optimization

来源：评论

学校读者我要写书评

暂无评论

A novel approach based on the minimum spanning tree to discover communities in social networks

A novel approach based on the minimum spanning tree to disco...

引用

International Conference on Wireless Networks and Mobile Communications (WINCOM)

作者： Khawla Asmi Dounia Lotfi Mohamed El Marraki LRIT MOHAMMED V UNIVERSITY IN RABAT Rabat Morocco

ISBN: (纸本)9781509039388

During the last decade, the social networks have known a huge popularity due to their ease of connecting people. The community detection has been in the center of attention in the analysis of this kind of networks. However, this area is still a very active field of research; the majority of methods involving this problem suffers from the accuracy in the determination of meaningful modules or the computational complexity of the used algorithm. In this paper, our contribution is to propose a new method that reveals the communities in social networks based on an excellent similarity measure and the minimum spanning tree. Our approach guaranties both accuracy and efficiency of the resulted partitions when compared with the existing methods and considering five real world social networks with a very promising computational complexity.

关键词： Social network services Time complexity Electronic mail algorithm design and analysis Complex networks Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Connectivity for routing persistent connections

Connectivity for routing persistent connections

引用

International Symposium on Electronics and Telecommunications (ISETC)

作者： Stefano-Niko Orzen Mircea Stratulat Sorin Babii Constantin Cosovan Dept. of Computers “Politehnica” University of Timisoara

ISBN: (纸本)9781509037490

This paper is focused on the connectivity feature for routing persistent connections. Real-time session communications are presented with their elements and performances, the requirements to generate and maintain connections as being active, as long as these are needed. The routing phenomenon has connection persistence as an availability feature for routing data through interconnected networks, being an issue analyzed at network overload levels. The article proposes an analytical method for attenuating the routing distribution stresses that exist in interconnected network transmissions, handling through performance elements, the necessary real-time communication process.

关键词： Protocols Routing Real-time systems Synchronization Delays algorithm design and analysis Computer networks

来源：评论

学校读者我要写书评

暂无评论

Consumption Structure Optimization Research Based on Intelligent Computing

Consumption Structure Optimization Research Based on Intelli...

引用

International Conference on Smart City and Systems Engineering (ICSCSE)

作者： Guicai Dong Mingxia Wang Anhui University of Finance and Economics Bengbu China

ISBN: (纸本)9781509055319

Consumption is an important research topic in the national economy and the people's livelihood is an important part of developing countries since the reform and opening up to the outside world. How to use reasonable method to analyze the resident consumption level has gradually become the hot problem. K-means algorithm is improved based on modified artificial fish swarm algorithm. The improved K-means algorithm is used to analyze the consumption structure of urban resident. The experiment results can provide reference for economic development planning and policy formulation.

关键词： Clustering algorithms Economics Particle swarm optimization Convergence algorithm design and analysis Classification algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

Message-aggregation enhanced iterative hard-decision decoders

Message-aggregation enhanced iterative hard-decision decoder...

引用

Information Theory and Applications Workshop, ITA

作者： Srdan Brkic Predrag Ivanis Bane Vasić David Declercq School of Electrical Engineering University of Belgrade Department of ECE University of Arizona ENSEA University Cergy-Pontoise

We present an iterative decoding algorithm for annihilating trapping sets in low-density parity-check codes. In addition to classic messages, subsets of variable nodes communicate directly. We show that by allowing variable nodes to collect information from a larger part of a graph, significant improvement can be achieved in the error-floor region, compared to the classic hard decision decoders. We also propose a new hybrid hard-decision decoding algorithm which employs described strategy and the Gallager B decoders as its components. Our decoder outperforms all known hard-decision decoders of same or higher complexity.

关键词： Decoding Iterative decoding Complexity theory algorithm design and analysis Error correction Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Implementation of features detection and matching algorithms on FPGA using Nios II

Implementation of features detection and matching algorithms...

引用

International Conference on Modelling, Identification and Control (ICMIC)

作者： Abdelhai Lati Zohir Irki Samir Sakhi Abdelkrim Nemra Mustapha Hamerlain Laboratoire des Systèmes Numériques Ecole Militaire Polytechnique Algiers Algeria Centre du Développement des Techniques Avancées CDTA Baba H'sen

ISBN: (纸本)9781509015948

The detection and matching of point features play an important role in most of the computer vision algorithms, such as; for 3-D reconstruction and robotics navigation, localization and mapping. Over the last years various detectors and descriptors have been proposed and successfully applied to the different applications. However, the developed detectors are based on computationally intensive algorithms, so it is desirable to implement them in hardware platform based on high performance reconfigurable systems. Nowadays, due to the flexible structure of Field Programmable Gate Array (FPGA) device, the latter can be involved in such complex algorithms of image processing. In this paper, some related works concerning implementation of features detection and matching algorithms on FPGA will be discussed in the state of the art, then we will illustrate a general framework for implementing two common features extraction detectors and two features matching algorithms on FPGA-Nios II system.

关键词： Feature extraction Field programmable gate arrays Detectors Hardware Program processors Correlation algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 470 471 472 473 474 475 476 477 478 479 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：