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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

17,615 篇 工学
- 6,923 篇 计算机科学与技术...
- 6,750 篇 电气工程
- 2,979 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,473 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,415 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 94 篇 材料科学与工程（可...
- 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,948 篇 algorithm design...
5,905 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,547 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,979 篇 convergence
3,963 篇 performance anal...
3,642 篇 data mining
3,579 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,986 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
72 篇 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,750 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm design and analysis"

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

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

详细简洁

排序：

Reachability and time-based path queries in temporal graphs

Reachability and time-based path queries in temporal graphs

引用

International Conference on Data Engineering

作者： Huanhuan Wu Yuzhen Huang James Cheng Jinfeng Li Yiping Ke Department of Computer Science and Engineering The Chinese University Hong Kong School of Computer Engineering Nanyang Technological University

A temporal graph is a graph in which vertices communicate with each other at specific time, e.g., A calls B at 11 a.m. and talks for 7 minutes, which is modeled by an edge from A to B with starting time “11 a.m.” and duration “7 mins”. Temporal graphs can be used to model many networks with time-related activities, but efficient algorithms for analyzing temporal graphs are severely inadequate. We study fundamental problems such as answering reachability and time-based path queries in a temporal graph, and propose an efficient indexing technique specifically designed for processing these queries in a temporal graph. Our results show that our method is efficient and scalable in both index construction and query processing.

关键词： Indexing algorithm design and analysis Electronic mail Query processing Labeling Social network services

来源：评论

学校读者我要写书评

暂无评论

Facility location and routing decisions for a food delivery network

Facility location and routing decisions for a food delivery ...

引用

IEEE International Conference on Industrial Engineering and Engineering Management

作者： Niraj Ramesh Dayama Mohan Krishnamoorthy Department of Mechanical and Aerospace Engineering Monash University Australia

ISBN: (纸本)9781509036660

This paper addresses the problem of designing efficient logistical arrangements for preparation and delivery of edible food (by a voluntary organization). The short shelf-life of edible, ready-to-eat food items complicates the provisioning and distribution networks. The design of the underlying logistical system constitutes an interesting combinatorial optimization problem. Our paper explains the problem background and rigorously defines the underlying mathematical problem. Thereafter, we develop a set of algorithms/techniques (exact and heuristic) to solve the problem faster. We blend the stronger lower bounds (obtained from an alternate MIP formulation) with better upper bounds (obtained using a fast and efficient heuristic approach) to develop a new exact technique. We report the detailed results from computational analysis of our new techniques.

关键词： Urban areas Organizations Upper bound Linear programming Routing Transportation algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Power balance control of Energy Storage Unit in Micro Grid based on distributed gradient algorithm

Power balance control of Energy Storage Unit in Micro Grid b...

引用

Chinese Control Conference (CCC)

作者： Xiaoliang Wang Jun Xie Dong Yue Jingbo Zhao Yichen Xiao Chi Cao College of Automation Nanjing University of Posts and Telecommunications Nanjing CN Electric Power Research Institute of Jiangsu Electric Power Company Nanjing China

A distributed control strategy for Energy Storage Unit (ESU) in MicroGrid is presented in this paper. In the presence of the stochasticity of renewable generation and load demand, the power balance for MicroGrid should be guaranteed by employing real-time control of the charging/discharging power of ESU. A distributed gradient algorithm is firstly employed to construct the distributed power balance control, which is used to balance the active power in MicroGrid. The objective of the proposed control is minimizing the total active power loss during the charging/discharging process, with the linear relationship among charging/discharging efficiency, charging/discharging rate and State of Charge (SOC) considered. The simulation results demonstrate the effectiveness of the proposed method.

关键词： Microgrids algorithm design and analysis Decentralized control Optimization State of charge Batteries

来源：评论

学校读者我要写书评

暂无评论

Functionally expanded streaming data as input to classification processes using ensembles of constructive neural networks

Functionally expanded streaming data as input to classificat...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Joao Roberto Bertini Maria do Carmo Nicoletti Universidade Federal de Sao Carlos Sao Carlos SP BR

Machine learning (ML) based applications that require data stream processing have become quite common over the past few years. To deal with continuous and massive streams of data, low computational and memory costs are required from the ML techniques employed; these requirements can be partially fulfilled by using constructive neural networks (CoNN) algorithms. The automatic definition of the Neural Network (NN) architecture, as well as its fast training, promote the high adaptability of such NNs, which allows to skip the conventional model selection phase during the learning process. However, such advantages usually come with the drawback of promoting lower accuracy rates, when compared to other learning approaches. The work described in this paper proposes an ensemble of CoNNs combined with functional expansion techniques to cope with data stream classification. The experiment results, followed by a comparative analysis, showed that CoNN accuracy performance along streaming data does improve with the use of functional expansion. Considering that to functionally expand the input data has a low computational cost, the obtained results turn CoNN algorithms an interesting approach to be considered in data stream classification.

关键词： Neurons Artificial neural networks Training Computer architecture algorithm design and analysis Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Path Planning Based on Simulated Annealing Ant Colony algorithm

Path Planning Based on Simulated Annealing Ant Colony Algori...

引用

International Symposium on Computational Intelligence and design, ISCID

作者： Kun Liu Mengxia Zhang YanKuang Group Information Center Zoucheng China China University of Mining and Technology Beijing Beijing China

ISBN: (纸本)9781509035595

In recent years, with the extensive application of the path planning technology, the development prospect of this technology is more and more broad, and the scientific research value of it is also more and more important. It is very necessary to apply it to the underground coal mine with complex terrain, and the algorithm is the core content of the research on path planning. We add simulated annealing algorithm into the process of ant colony algorithm formed simulated annealing ant colony algorithm in this paper, and apply it to the path planning, solve the local optimum problem caused by precocity in ant colony algorithm. For further ensure to find the optimal path, entropy increase strategy was used, that means using multiple update path to avoid algorithm premature, it's easier to find global optimal solution. Simulation result shows that the method presented in this paper obtains the optimization path and proves that the algorithm is efficient and reliable.

关键词： Path planning Simulated annealing Heuristic algorithms Coal mining Solids algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Using ABC and RRT algorithms to improve mobile robot path planning with danger degree

Using ABC and RRT algorithms to improve mobile robot path pl...

引用

International Conference on Future Generation Communication Technology (FGCT)

作者： Yue Tusi Hung-Yuan Chung Department of Electrical Engineering National Central University Taoyuan Taiwan R.O.C.

For mobile robots, being able to find a suitable route through an environment filled with varied obstacles, and to ensure that they can successfully reach their target point from the starting point in the most efficient manner is very important, and a necessary research topic. This article proposes a combination of Artificial Bee Colony algorithm (ABC) and Rapidly-Exploring Random Tree (RRT) to produce a novel algorithm to meet these navigation requirements. This algorithm is then compared with the traditional ABC for path planning. Unlike previous algorithms, this study uses the RRT algorithm to find several extend points, choose the best extend point to move the bees. Because the Artificial Bee Colony algorithm is simply structured, easy to operate and quickly converges, it is able to address the problems of slow convergence and easy entrapment in local optimal solutions encountered in previous path planning algorithms. Although RRT has excellent characteristics in terms of the search area which is unknown, it is unstable for each planning. Thus, this thesis combines the characteristics of the artificial bee colony algorithm with the RRT algorithms, and considers the problem of robot path simulation with obstacles.

关键词： Path planning algorithm design and analysis Mobile robots Heuristic algorithms Convergence Optimization

来源：评论

学校读者我要写书评

暂无评论

Data-mining a mechanism against cyber threats: A review

Data-mining a mechanism against cyber threats: A review

引用

International Conference on Innovation and Challenges in Cyber Security (ICICCS-INBUSH)

作者： Shipra Ravi Kumar J. S. Jassi Suman Avdhesh Yadav Ravi Sharma Computer Science &Engineering Mechanical Engineering Information Technology Information Tech.

ISBN: (纸本)9781509020850

Data mining is the process in that analyzing of data from different perspective and summarizes that data into some useful information which can be used to enhance the revenue generation, cost cutting etc. In data mining, cluster formation plays a vital role which is data can be divided into different groups. Clustering is the technique in which grouping is based on similar type of data relevant to different attributes. WEKA is the most important tool of data mining which is used to allocate and clustering of data with use of various machine learning algorithms. The purpose of this paper is to compare different algorithms of machine learning on the subject of types of data set, their size, number of clusters and cyber privacy platform. We also discuss different types of cyber threats in computing world.

关键词： Data mining Clustering algorithms Computer security Machine learning algorithms algorithm design and analysis Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A high-level synthesis algorithm for FPGA designs optimizing critical path with interconnection-delay and clock-skew consideration

A high-level synthesis algorithm for FPGA designs optimizing...

引用

International Symposium on VLSI design, Automation and Test

作者： Koichi Fujiwara Kazushi Kawamura Masao Yanagisawa Nozomu Togawa Department of Computer Science and Communications Engineering Waseda University

ISBN: (纸本)9781467394994

High-level synthesis for FPGA designs (FPGA-HLS) is recently required in various applications. Since wire delays are becoming a design bottleneck in FPGA, we need to handle interconnection delays and clock skews in FPGA-HLS flow. In this paper, we propose an FPGA-HLS algorithm optimizing critical path with interconnection-delay and clock-skew consideration. By utilizing HDR architecture, we floorplan circuit modules in HLS flow and, based on the result, estimate interconnection delays and clock skews. To reduce the critical-path delay(s) of a circuit, we propose two novel methods for FPGA-HLS. Experimental results demonstrate that our algorithm can improve circuit performance by up to 24% compared with conventional approaches.

关键词： Delays Clocks Integrated circuit interconnections Field programmable gate arrays Registers Wires algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

RFID sensor placement algorithm in ubiquitous computing

RFID sensor placement algorithm in ubiquitous computing

引用

IEEE International Conference on Control Science and Systems Engineering (CCSSE)

作者： Jetendra Joshi Munnangi Sri Harsha Urijit Kurulkar Avinash Reddy Dandamudi Akhil Abhinav Goel Byreddy Nikhil Reddy Amrit Bagga Department of Computer Science and Engineering NIIT University Rajasthan India NIIT University Jaipur Rajasthan IN

ISBN: (纸本)9781467398732

RFID applications are used in the Internet of Things (IoTs) which uses multiple readers to read the IDs of multiple tags and form the RFID network. In such a network, unguarded reader deployment may generate over-crowded readers, cause interferences. The deployment is crucial for RFID system performance Radio Frequency Identification (or RFID) tags have seen its wide range of applications in the recent years and has a very promising future. In the present scenario, Ubiquitous computing plays an important role in our daily lives and has a vast range of applications in many fields. In this paper we have proposed a system which uses RFID tags for guidance of tourists. The system uses RFID tags to guide and inform the tourists about a given location and surrounding. We have proposed an algorithm which describes the system's implementation even for densely populated RFID Reader based geographical area. The system requires multiple readers and it collaborates to read the RFID tag data.

关键词： RFID tags algorithm design and analysis Genetic algorithms Hardware Gallium arsenide Conferences

来源：评论

学校读者我要写书评

暂无评论

Biomarker discovery based on BBHA and AdaboostM1 on microarray data for cancer classification

Biomarker discovery based on BBHA and AdaboostM1 on microarr...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Elnaz Pashaei Mustafa Ozen Nizamettin Aydin Department of Computer Engineering Yildiz Technical University Istanbul Turkey Department of Molecular Biology and Genetics Biruni University Istanbul Turkey

In this paper, a new approach based on Binary Black Hole algorithm (BBHA) and Adaptive Boosting version Ml (AdaboostM1) is proposed for finding genes that can classify the group of cancers correctly. In this approach, BBHA is used to perform gene selection and AdaboostM1 with 10-fold cross validation is adopted as the classifier. Also, to find the relation between the biomarkers for biological point of view, decision tree algorithm (C4.5) is utilized. The proposed approach is tested on three benchmark microarrays. The experimental results show that our proposed method can select the most informative gene subsets by reducing the dimension of the data set and improve classification accuracy as compared to several recent studies.

关键词： Classification algorithms Cancer Colon Tumors Decision trees algorithm design and analysis Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：