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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,158 篇 期刊文献
860 篇 会议
17 篇 学位论文
9 册 图书
1 篇 资讯

馆藏范围

3,045 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,769 篇 工学
- 850 篇 计算机科学与技术...
- 737 篇 电气工程
- 627 篇 航空宇航科学与技...
- 361 篇 机械工程
- 288 篇 仪器科学与技术
- 285 篇 石油与天然气工程
- 275 篇 控制科学与工程
- 262 篇 信息与通信工程
- 195 篇 动力工程及工程热...
- 185 篇 力学（可授工学、理...
- 138 篇 软件工程
- 130 篇 土木工程
- 123 篇 材料科学与工程（可...
- 103 篇 电子科学与技术（可...
- 75 篇 环境科学与工程（可...
- 66 篇 交通运输工程
- 60 篇 光学工程
- 57 篇 化学工程与技术
- 47 篇 水利工程
- 46 篇 建筑学
602 篇 理学
- 280 篇 物理学
- 140 篇 数学
- 69 篇 化学
- 65 篇 生物学
- 50 篇 地球物理学
427 篇 管理学
- 416 篇 管理科学与工程(可...
87 篇 医学
- 59 篇 临床医学
30 篇 农学
22 篇 经济学
9 篇 教育学
8 篇 法学
7 篇 艺术学
2 篇 文学
2 篇 军事学

主题

3,045 篇 optimization alg...
108 篇 genetic algorith...
93 篇 machine learning
82 篇 particle swarm o...
76 篇 optimization
62 篇 deep learning
55 篇 sensitivity anal...
45 篇 computational fl...
41 篇 structural optim...
41 篇 numerical simula...
40 篇 finite element a...
39 篇 evolutionary alg...
39 篇 artificial neura...
37 篇 surrogate model
37 篇 computing
35 篇 aerodynamic perf...
34 篇 earth
34 篇 feature selectio...
33 篇 reynolds average...
33 篇 numerical optimi...

机构

12 篇 univ chinese aca...
11 篇 natl univ def te...
9 篇 islamic azad uni...
9 篇 dongbei univ fin...
8 篇 shanghai univ sc...
8 篇 beijing inst tec...
7 篇 hebei univ engn ...
7 篇 dalian univ tech...
7 篇 northwestern pol...
7 篇 tsinghua univ sc...
6 篇 new jersey inst ...
6 篇 hunan univ coll ...
6 篇 northeastern uni...
6 篇 shandong univ sc...
6 篇 univ elect sci &...
6 篇 sun yat sen univ...
6 篇 tsinghua univ de...
6 篇 univ elect sci &...
6 篇 henan normal uni...
5 篇 natl chung cheng...

作者

21 篇 akhlaghi majid
11 篇 feng enmin
9 篇 acharya debasis
9 篇 emami farzin
9 篇 das dushmanta ku...
8 篇 li wei
7 篇 wang hui
7 篇 zhang zhenxing
7 篇 hannan m. a.
7 篇 xiu zhilong
7 篇 kaboli milad
7 篇 wang liying
7 篇 xiu xianchao
7 篇 zhao weiguo
7 篇 wang jianzhou
6 篇 liu wanquan
6 篇 liu yang
6 篇 jiang jianhua
6 篇 zhou mengchu
6 篇 mirjalili seyeda...

语言

2,818 篇 英文
177 篇 其他
38 篇 中文
4 篇 法文
3 篇 德文
2 篇 土耳其文
1 篇 葡萄牙文

检索条件"主题词=Optimization Algorithm"

共 3045 条记录，以下是221-230 订阅

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

详细简洁

排序：

An optimization algorithm based on stochastic sensitivity analysis for noisy objective landscapes

An optimization algorithm based on stochastic sensitivity an...

引用

3rd International Symposium on Sensitivity Analysis of Model output (SAMO 2001)

作者： Okano, H Koda, A Univ Tsukuba Inst Policy & Planning Sci Tsukuba Ibaraki 3058573 Japan IBM Res Corp Tokyo Res Lab Yamato Kanagawa 2428502 Japan

A function minimization algorithm that updates solutions based on approximated derivative information is proposed. The algorithm generates sample points with Gaussian white noise, and approximates derivatives based on stochastic sensitivity analysis. Unlike standard trust region methods which calculate gradients with n or more sample points, where n is the number of variables, the proposed algorithm allows the number of sample points M to be less than n. Furthermore, it ignores small amounts of noise within a trust region. This paper addresses the following two questions: how does the derivative approximation become worse when the number of sample points is small? Can the algorithm find good solutions with inexact derivative information when the objective landscape is noisy? Through intensive numerical experiments using quadratic functions, the algorithm is shown to be able to approximate derivatives when M is about n/10 or more. The experiments using a formulation of the traveling salesman problem show that the algorithm can find reasonably good solutions for noisy objective landscapes with inexact derivatives information. (C) 2002 Elsevier Science Ltd. All rights reserved.

关键词： optimization algorithm stochastic sensitivity gradient method traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Study on Modeling and Scheduling optimization algorithm of Mining-excavation Planning 9

Study on Modeling and Scheduling Optimization Algorithm of M...

引用

9th International Symposium on Computational Intelligence and Design (ISCID)

作者： Ming, Jian Hu, Nailian Sun, Jinhai Univ Sci & Technol Beijing Minist Educ State Key Lab High Efficient Min & Safety Met Min Beijing Peoples R China

ISBN: (纸本)9781509035588

The mining-excavation plan plays an important part in the operation management and business intelligence system construction of the mining enterprise and has great impact on decision-making of the mining enterprise. This paper takes the decision support system underground metal mine as the research object and studies its model and algorithm. Based on goals and constraints of ore blending operations, the ore blending model is established by using the theory and technology of multiobjective programming and the ore blending plan is optimized, which provides the theoretical basis and data support for the mining-excavation planning. Based on the experience and knowledge of domain experts and constraints of mining, the stope superseding and verification model is established by using the experts system and its inference mode, therefore the stoping sequence of ore blocks is worked out. In view of the cost characteristics of underground mining the mining-excavation planning model is established by using the time Petri net extended with price information, thus the minimum production cost and corresponding mining-excavation plan are worked out by using the above model.

关键词： mining-excavation planning mining process modeling and scheduling optimization algorithm multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Solving The Printed Circuit Board Drilling Problem By Ant Colony optimization algorithm

Solving The Printed Circuit Board Drilling Problem By Ant Co...

引用

World Congress on Engineering and Computer Science

作者： Eldos, Taisir Kanan, Aws Aljumah, Abdullah Salman Abdulaziz Univ Coll Comp Engn & Sci Dept Comp Engn Al Kharj 11942 Saudi Arabia

ISBN: (纸本)9789881925237

Printed Circuit Board (PCB) manufacturing depends on the holes drilling time, which is a function of the number of holes and the order in which they are drilled. A typical PCB may have hundreds of holes and optimizing the time to complete the drilling plays a role in the production rate. At an early stage of the manufacturing process, a numerically controlled drill has to move its bit over the holes one by one and must complete the job in minimal time. The order by which the holes are visited is of great significance in this case. Solving the TSP leads to minimizing the time to drill the holes on a PCB. Finding an optimal solution to the TSP maybe prohibitively large as the number of possibilities to evaluate in an exact search is (n-1)!/2 for n-hole PCB. There exist too many algorithms to solve the TSP in an engineering sense;semi-optimal solution, with good quality and cost tradeoff. Starting with Greedy algorithm which delivers a fast solution at the risk of being low in quality, to the evolutionary algorithms like Genetic algorithms, Simulated Annealing algorithms, Ant Colony, Swarm Particle optimization, and others which promise better solutions at the price of more search time. We propose an Ant Colony optimization (ACO) algorithm with problem-specific heuristics like making use of the dispersed locales, to guide the search for the next move. Hence, making smarter balance between the exploration and exploitation leading to better quality for the same cost or less cost for the same quality. This will also offer a better way of problem partitioning which leads to better parallelization when more processing power is to be used to deliver the solution even faster.

关键词： Ant Colony optimization algorithm Printed Circuits Board Drilling Traveling Salesman

来源：评论

学校读者我要写书评

暂无评论

Using Double Well Function as a Benchmark Function for optimization algorithm

Using Double Well Function as a Benchmark Function for Optim...

引用

IEEE Congress on Evolutionary Computation (IEEE CEC)

作者： Wang, Peng Yang, Guosong Southwest Minzu Univ Sch Comp Sci & Engn Chengdu Peoples R China Chinese Acad Sci Chengdu Inst Comp Applicat Chengdu Peoples R China Univ Chinese Acad Sci Beijing Peoples R China

ISBN: (纸本)9781728183923

The double well function (DWF) is an important theoretical model originating from quantum physics and has been used to describe the energy constraint problem in quantum mechanics and structural chemistry. Although its form may vary, the DWF has two different local minima in the one-dimensional case, and the number of local minima increases as its dimension grows. As a multi-stable function, the DWF is assumed to be a potential candidate for testing the performance of the heuristic optimization algorithm, which aims to seek the global minimum. To verify this idea, a typical DWF is employed in this paper, and a mathematical analysis is presented herein, and its properties as a benchmark function are discussed in different cases. In addition, we conducted a set of experiments utilizing a few optimization algorithms, such as the multi-scale quantum harmonic oscillator algorithm and covariance matrix adaptation evolution strategy;thus the analysis has been illustrated by the results of the numerical experiment. Moreover, to guide the design of an ideal DWF used as a benchmark function in experiment, different values of the decisive parameters were tested corresponding to our analysis, and some useful rules were given based on the discussion of the results.

关键词： double well double well function benchmark function optimization algorithm performance

来源：评论

学校读者我要写书评

暂无评论

SIMULATION OF REGIONAL WINTER WHEAT YIELD BY COMBINING EPIC MODEL AND REMOTELY SENSED LAI BASED ON GLOBAL optimization algorithm

SIMULATION OF REGIONAL WINTER WHEAT YIELD BY COMBINING EPIC ...

引用

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)

作者： Ren, Jianqiang Chen, Zhongxin Tang, Huajun Yu, Fushui Huang, Qing Minist Agr Key Lab Resources Remote Sensing & Digital Agr Beijing 10081 Peoples R China

ISBN: (纸本)9781457710056

In recent years, combining spatial and timely remote sensing data and crop growth model is an important way to improve accuracy of crop growth simulation and crop growth monitoring. In this paper, global optimization algorithm SCE-UA (Shuffled Complex Evolution method - University of Arizona) was used to integrate remotely sensed leaf area index (LAI) with EPIC crop growth model to simulate regional winter wheat yield and other field management information such as sowing date, plant density and net nitrogen fertilizer application rate in Huanghuaihai Plain in China. Final results showed that average relative error of estimated winter wheat yield was 1.81% and RMSE was 0.208 t/ha. Compared with the actual observation data, average relative error of simulated plant density and net nitrogen fertilization application rate was -7.95% and -8.88% respectively and absolute error of simulated sowing date was only 1 day. These above accuracy of simulated results could meet requirements of crop monitoring at regional scale. It was proved that integrating remotely sensed LAI with EPIC model based on SCE-UA for simulation of crop growth condition and crop yield was feasible.

关键词： Data assimilation crop growth model yield estimation remote sensing LAI optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive Bayesian optimization algorithm for Unpredictable Business Environments. 24

Adaptive Bayesian Optimization Algorithm for Unpredictable B...

引用

8th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI)

作者： Maitra, Sarit Alliance Univ Alliance Business Sch Bengaluru India

ISBN: (纸本)9798400717291

This paper introduces an adaptive Bayesian optimization (BayesOpt) framework with dynamic conditioning and jitter mechanisms. The new framework enhances the adaptability and effectiveness of optimization in unpredictable business environments. The dynamic scaling in this framework dynamically modifies the mean objective function in each iteration, and adaptive conditioning functions. The adaptive acquisition jitter function enhances adaptability by adjusting the jitter of the acquisition function. The framework is tested using single-objective, multi-objective, and decoupled multiobjective functions. Statistical analyses which include t-statistics, p-values, and effect size measures (Cohen's d and Hedges g) reveal the superiority of the proposed framework over the original Bayes optimization. The primary contribution is developing a novel and effective optimization approach in stochastic environments, especially in the context of supply chain inventory management.

关键词： Adaptive conditioning Dynamic scaling Effect size optimization algorithm Probabilistic modeling Stochastic environments

来源：评论

学校读者我要写书评

暂无评论

Hybrid Artificial Glowworm Swarm optimization algorithm for Solving Multi-dimensional Knapsack Problem

Hybrid Artificial Glowworm Swarm Optimization Algorithm for ...

引用

International Conference on Advanced in Control Engineering and Information Science (CEIS)

作者： Gong, Qiaoqiao Zhou, Yongquan Luo, Qifang Guangxi Univ Nationalities Coll Math & Comp Sci Nanning 530006 Guangxi Peoples R China

In this paper, a hybrid artificially glowworm swarm optimization algorithm to solve multidimensional 0-1 knapsack problem is proposed. The algorithm utilizes two important strategies, how to select the item based on its unit volume value and the binary glowworm swarm optimization algorithm, 37 multidimensional 0-1 knapsack test instances are tested by the produced algorithm, The integrated performance of the produced algorithm is rather satisfied, and the hybrid glowworm swarm optimization algorithm is rather efficient for solving multidimensional 0-1 knapsack problem. (c) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of [CEIS 2011]

关键词： glowworm swarm optimization algorithm knapsack problem greedy algorithms binary code

来源：评论

学校读者我要写书评

暂无评论

Research on the optimization algorithm of Big Data Computing System 17

Research on the Optimization Algorithm of Big Data Computing...

引用

17th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC)

作者： Wu, Mengxuan Jiang, Jingjing Wang, Lijuan Sch China Agr Univ Beijing Peoples R China Dalian Univ Sci & Technol Sch Digital Technol Dalian Peoples R China

ISBN: (纸本)9781728186160

With the social progress and development, the scale of data continues to expand, in order to realize the processing and analysis of large-scale data, graph computing system came into being. At present, with the continuous maturity of graph computing system, graph computing has been widely used in various fields, such as social field, Internet of things field and neural network field. In recent years, different graph computing models have emerged, and some typical distributed graph computing models show good expansibility in the formulation of graph data for big data processing. However, in order to further expand the expansibility, many graph calculation models are studied by algorithms. At present, the SFA algorithm is mostly used in the graph calculation system. However, with the continuous development of graph calculation, many inadaptability of the SFA algorithm appear which restricts the further development of graph calculation. Therefore, it is an urgent problem to optimize the algorithm of graph computing system. On the basis of scholars' research, this paper firstly gives a simple overview of graph calculation and graph calculation model. On this basis, it analyzes the specific formula and significance of SFA algorithm, puts forward the specific scheme of algorithm optimization, and carries out experimental detection of optimization algorithm.

关键词： big data graph calculation system optimization algorithm SFA algorithm

来源：评论

学校读者我要写书评

暂无评论

Developing a Smart Hotel Management System based on Process Data Collection and optimization algorithm 6

Developing a Smart Hotel Management System based on Process ...

引用

6th International Conference on Trends in Electronics and Informatics (ICOEI)

作者： Liu, Fei Kang, Jiali Tianjin Univ Finance & Econ Pearl River Coll Xiangrui St Baodi Dist Tianjin 301811 Peoples R China

ISBN: (纸本)9781665483285;9781665483292

In view of the problems that traditional hotel management and service quality are easily affected by service personnel, and the check-in and check-out procedures are cumbersome, a smart hotel management system based on the combination of IoT and artificial intelligence technology is developed. First, process data collection is used to decompose it into relatively independent Sub-projects, and then use the design structure matrix to express the relationship between the sub-projects, and use the corresponding algorithm to identify the iterative relationship, which provides a feasible idea for project planning and process monitoring. Networking technology realizes centralized control and management of access control and hotel equipment, realizes unmanned service in the whole process from check-in to check-out, and improves efficiency by 7.8%.

关键词： Hotel Management Process Data Collection optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Microwave Wireless Power Transmission using optimization algorithm 16

Efficient Microwave Wireless Power Transmission using Optimi...

引用

16th European Conference on Antennas and Propagation (EuCAP)

作者： Kim, Ho Yeol Nam, Sangwook Seoul Natl Univ Sch Elect & Informat Engn Seoul South Korea

ISBN: (纸本)9788831299046

In this study, we developed an efficient microwave wireless power transmission (MPT) system for multiple receivers using an optimization (OPT) technique. The optimization algorithm finds the optimal transmission signal for transferring the desired power to multiple receivers with maximum power transfer efficiency (PTE). We designed a 5 x 5 rectangular patch array antenna and patch element antenna operating at 10 GHz as the transmitter and receiver, respectively. The operating process of the MPT system using the OPT technique is analyzed. Additionally, we compared the received power of each receiver and the PTE of the OPT technique with that of the multi-receiver time-reversal (MR-TR) technique considering various scenarios. The OPT algorithm generates a multibeam to charge multiple receiver simultaneously. We validated that the OPT technique can deliver power to receivers precisely at desired ratios with greater PTE than that of the MR-TR technique in an MPT system.

关键词： microwave wireless power transmission array antenna optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共305页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：