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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,389 篇 会议
132 篇 期刊文献
76 册 图书

馆藏范围

3,595 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

2,398 篇 工学
- 1,896 篇 计算机科学与技术...
- 1,152 篇 软件工程
- 418 篇 电气工程
- 269 篇 控制科学与工程
- 199 篇 信息与通信工程
- 127 篇 机械工程
- 72 篇 石油与天然气工程
- 64 篇 生物医学工程（可授...
- 59 篇 电子科学与技术（可...
- 56 篇 材料科学与工程（可...
- 56 篇 交通运输工程
- 51 篇 生物工程
- 44 篇 化学工程与技术
- 40 篇 动力工程及工程热...
- 38 篇 土木工程
- 35 篇 仪器科学与技术
- 34 篇 冶金工程
672 篇 理学
- 482 篇 数学
- 106 篇 物理学
- 85 篇 系统科学
- 80 篇 统计学（可授理学、...
- 73 篇 生物学
- 51 篇 化学
402 篇 管理学
- 337 篇 管理科学与工程(可...
- 148 篇 工商管理
- 81 篇 图书情报与档案管...
105 篇 教育学
- 103 篇 教育学
70 篇 医学
- 46 篇 临床医学
- 35 篇 基础医学(可授医学...
64 篇 经济学
- 64 篇 应用经济学
40 篇 法学
22 篇 文学
12 篇 农学
9 篇 艺术学
3 篇 军事学

主题

309 篇 linear programmi...
251 篇 programming
187 篇 dynamic programm...
142 篇 computer program...
118 篇 integer programm...
116 篇 optimization
109 篇 logic programmin...
86 篇 genetic programm...
82 篇 functional progr...
73 篇 computational mo...
68 篇 object oriented ...
66 篇 programming prof...
65 篇 parallel program...
56 篇 software enginee...
54 篇 costs
49 篇 mathematical mod...
48 篇 computer program...
46 篇 heuristic algori...
42 篇 artificial intel...
41 篇 computer science

机构

9 篇 univ london impe...
7 篇 inesc tec porto
6 篇 feup porto
6 篇 russian acad sci...
5 篇 c mast ubi covil...
4 篇 univ leicester l...
4 篇 vienna univ tech...
4 篇 institute of fun...
4 篇 chinese acad sci...
4 篇 university of am...
4 篇 univ nottingham ...
4 篇 beijing universi...
3 篇 weizmann inst sc...
3 篇 univ nottingham ...
3 篇 delft center for...
3 篇 international is...
3 篇 international bu...
3 篇 department of co...
3 篇 school of comput...
3 篇 univ cyprus dept...

作者

8 篇 catalao joao p. ...
6 篇 musirin ismail
5 篇 weiss gera
5 篇 marron assaf
4 篇 hirschfeld rober...
4 篇 ghani n
4 篇 katz guy
4 篇 saraswat vijay
4 篇 xiong rui
4 篇 funabiki nobuo
4 篇 fitiwi desta z.
4 篇 shi yong
4 篇 boercsoek josef
4 篇 jagadeesan radha
4 篇 gupta vineet
4 篇 michael n. young
4 篇 pesant gilles
4 篇 harel david
3 篇 muggleton stephe...
3 篇 faisal a. aldo

语言

3,513 篇 英文
56 篇 其他
26 篇 中文
5 篇 葡萄牙文
2 篇 俄文
1 篇 西班牙文

检索条件"任意字段=7th International Conference on Functional Programming"

共 3597 条记录，以下是841-850 订阅

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

详细简洁

排序：

Maintenance Scheduling for Cloud Infrastructure with Timing Constraints of Live Migration 7

Maintenance Scheduling for Cloud Infrastructure with Timing ...

引用

7th IEEE international conference on Cloud Engineering (IEEE IC2E)

作者： Okuno, Shingo Iikura, Fumi Watanabe, Yukihiro Fujitsu Labs Ltd Kawasaki Kanagawa Japan

ISBN: (纸本)9781728102184

In this paper, we propose an implementation of a maintenance scheduler for cloud infrastructures. Live migration associated with maintenance work is important to ensure service continuity for all virtual machines in an infrastructure. However, executing the migration process when the machines are under heavy load negatively affects cloud users' businesses, such as by degrading performance and extending downtime. We can avoid this by finding an appropriate time period for live migration and performing the migration then. this idea is convenient for cloud users but inconvenient for cloud providers, that is, maintenance work should be completed as soon as possible for security reasons. To satisfy both the users' convenience and providers' requirements, we designed a maintenance scheduling problem to find the appropriate time period and to shorten the maintenance work period. Since it is a large-scale combinatorial optimization problem with complex constraints on maintenance requirements, we described the constraints by using answer set programming and implemented a maintenance scheduler on the basis of a divide-and-conquer approach to reduce the computational complexity exponentially. We evaluated our scheduler by using information on a real configuration of a commercial cloud infrastructure. While a naive approach to solving the maintenance scheduling problem could not find any feasible solutions within a realistic amount of time and memory, our implementation generated the best maintenance schedule for 1032 physical machines and 14208 virtual machines in 206 s with a memory usage of 1086 MB.

关键词： cloud computing infrastructure as a service (IaaS) maintenance scheduling live migration answer set programming divide-and-conquer approach

来源：评论

学校读者我要写书评

暂无评论

An intelligent functional diagnostics of wireless sensor network 7

An intelligent functional diagnostics of wireless sensor net...

引用

7th international conference on Future Internet of things and Cloud Workshops, FiCloudW 2019

作者： Krivulya, Gennady Skarga-Bandurova, Inna Tatarchenko, Zakhar Seredina, Olena Shcherbakova, Maryna Shcherbakov, Eugene Kharkiv National University of Radio Electronics Design Automation Department Kharkiv Ukraine V. Dahl East Ukrainian National University Computer Science and Engineering Department Severodonetsk Ukraine V. Dahl East Ukrainian National University International Cooperation Department Severodonetsk Ukraine

ISBN: (纸本)9781728144115

An overview of the fault detection strategies, faults and failures related to Wireless Sensor Network (WSN) levels is provided. the recent research contributions to functional diagnostics of WSN were summarized. An adaptive neuro-fuzzy inference system ANFIS for intelligence diagnostics of WSN is proposed. the solution of the task of functional diagnostics is realized by the expert system with a knowledge base in the form of a neuron-fuzzy network. Neural-fuzzy network has been applied to the sensor nodes. Employing proposed techniques in WSN showed that ANFIS algorithm enables to improve the efficiency and accuracy of sensor node diagnosis. © 2019 IEEE.

关键词： Fuzzy neural networks

来源：评论

学校读者我要写书评

暂无评论

Interpretation of computational thinking evaluation results for enrollment prediction 19

Interpretation of computational thinking evaluation results ...

引用

7th international conference on Technological Ecosystems for Enhancing Multiculturality (TEEM)

作者： Rojas-Lopez, Arturo Garcia-Penalvo, Francisco J. Technol Univ Puebla Informat Technol Div Puebla Mexico Univ Salamanca Res Inst Educ Sci GRIAL Res Grp Salamanca Spain

ISBN: (纸本)9781450371919

During two generations (2016 and 2017) the computational thinking evaluation has been carried out in order to establish learning scenarios for new students, such interventions have been made in the programming methodology course, it belonging to the career of Information Technology at the Technological University of Puebla in Mexico. the results have led a personalized education for students, recognizing previous skills as well as trying to correct those missing, so that it acquires the competences respective, credit the course and improve the retention percentage of the first quarter. In this sense, when detecting possible skill gaps, is it possible to predict what will be the impact to maintain or decrease enrollment during and the end of quarter? the present work aims to answer the question by the results interpretation obtained from the computational thinking evaluation to 242 new students, generation 2018. Initially, it was stablished which would be the student's situation during and the end of four months from September to December based on the correct assessment reagents;three categories were determined: 1. Sure desertion, 2. Safe permanence, 3. Variable permanence. Later, 50 students who enrolled the next quarter (January-April 2019) were revised if they had been predicted properly;using a survey, the familiarity of key concepts of the subject programming methodology was obtained with the aim of determining a correspondence with the evaluation of computational thinking skills, as well as the established situation, consequently, establishing the validity of predicting the enrollment.

关键词： Computational thinking Problem solving Higher education programming teaching programming Learning

来源：评论

学校读者我要写书评

暂无评论

Statistically significant performance testing of Julia scientific programming language 7

Statistically significant performance testing of Julia scien...

引用

7th international conference on Problems of Mathematical Physics and Mathematical Modelling

作者： Gevorkyan, M. N. Demidova, A. V. Korolkova, A. V. Kulyabov, D. S. Peoples Friendship Univ Russia RUDN Univ Dept Appl Probabil & Informat 6 Miklukho Maklaya Str Moscow 117198 Russia Joint Inst Nucl Res Lab Informat Technol 6 Joliot Curie Dubna 141980 Moscow Region Russia

In this article, we compare the support for SIMD instructions for Julia and Fortran. the comparison is carried out according to the methodology described in work of T. Kalibera, R. E. Jones. the first part of the article gives a brief description of this technique. We emphasize on the practical implementation using Python, NumPy and SciPy. the second part of the article briefly discusses the syntactic capabilities of Fortran and Julia to work with SIMD processor extensions. Specific code snippets are given. Next, the performance of Julia and Fortran is compared for arithmetic operations on arrays of small length. the results are presented in tabular and graphical form.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

On-policy Approximate Dynamic programming for Optimal Control of non-linear systems

On-policy Approximate Dynamic Programming for Optimal Contro...

引用

international conference on Control, Decision and Information Technologies (CoDIT)

作者： Shalini K D. Vrushabh K. Shalini Veermata Jijabai Technological Institute Mumbai India

ISBN: (数字)9781728159539

ISBN: (纸本)9781728159546

Optimal control theory deals with finding the policy that minimizes the discounted infinite horizon quadratic cost function. For finding the optimal control policy, the solution of the Hamilton-Jacobi-Bellman (HJB) equation must be found i.e. the value function which satisfies the Bellman equation. However, the HJB is a partial differential equation that is difficult to solve for a nonlinear system. the paper employs the approximate dynamic programming method to solve the HJB equation for the deterministic nonlinear discrete-time systems in continuous state and action space. the approximate solution of the HJB is found by the policy iteration algorithm which has the framework of actor-critic architecture. the control policy and value function are approximated using function approximators such as neural network represented in the form of linearly independent basis function. the gradient descent optimization algorithm is employed to tune the weights of the actor and critic network. the control algorithm is implemented for cart pole inverted pendulum system, the effectiveness of this approach is provided in simulations.

关键词： Heuristic algorithms Optimal control Mathematical model Approximation algorithms Neural networks Indexes Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Operations Administration and Maintenance Constraints in Fiber Cables Network Design 7th

Operations Administration and Maintenance Constraints in Fib...

引用

7th international conference on Operations Research and Enterprise Systems, ICORES 2018

作者： Angilella, Vincent Chardy, Matthieu Ben-Ameur, Walid Orange Labs 44 avenue de la République Chatillon92320 France SAMOVAR Télécom SudParis CNRS Université Paris-Saclay 9 rue Charles Fourier Evry Cedex91011 France

ISBN: (纸本)9783030160340

We introduce two specific design problems of optical fiber cable networks that differ by a practical maintenance constraint. An integer programming based method including valid inequalities is introduced for the unconstrained problem. We propose two exact solution methods to tackle the constrained problem: the first one is based on mixed integer programming including valid inequalities while the second one is built on dynamic programming. We then provide a fully polynomial time approximation scheme for the constrained problem. the theoretical complexities of both problems in several cases are proven and compared. Numerical results assess the efficiency of both methods in different contexts including real-life instances, and evaluate the effect of the maintenance constraint on the solution quality. © 2019, Springer Nature Switzerland AG.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Optimal Trajectories Synthesis of a Mobile Robots Group Using Cartesian Genetic programming*

Optimal Trajectories Synthesis of a Mobile Robots Group Usin...

引用

international conference on Control, Decision and Information Technologies (CoDIT)

作者： Askhat Diveev Galina Balandina Federal Research Center "Computer Science and Control" of Russian Academy of Sciences Moscow Russian Federation Peoples Friendship University of Russia (RUDN University) Moscow Russian Federation

ISBN: (数字)9781728159539

ISBN: (纸本)9781728159546

the paper is devoted to application of Cartesian Genetic programming (CGP) for generating optimal trajectories of a mobile robots group. the problem of a control system synthesis for a mobile robots group is solved. the proposed algorithm uses numerical approach from the class of symbolic regression methods to which Cartesian Genetic programming belonging. It allows to receive a control function in the form of a mathematical expression. We consider several stages to get optimal trajectories for mobile robots group moving along which the robots wouldn't collide with each other and obstacles. Initially, we solve the problem of synthesis for each robot in order to get the stabilized robot control system relative some point in the state space. At the second stage, spatial trajectories are found along which robots move from the current state to the obtained equilibrium points without collisions. It was proposed to improve an initial algorithm by using the principal of small variation of basic solution. there is considered a group of three robots and the control system for them with phase constraints in the paper.

关键词： Robots Optimal control Mathematical model Genetic programming Collision avoidance Trajectory Aerospace electronics

来源：评论

学校读者我要写书评

暂无评论

the Vehicle Routing Problem with Split Delivery and Heterogeneous Trucks and Commodities: A Case Study

The Vehicle Routing Problem with Split Delivery and Heteroge...

引用

international conference on Industrial Engineering and Applications (ICIEA)

作者： Sherif A. Fahmy The American University in Cairo (AUC) Cairo Egypt

ISBN: (数字)9781728167855

ISBN: (纸本)9781728167862

the vehicle routing problem (VRP) is that of finding the optimal routes for a number of vehicles (trucks) to serve a set of customers, with the goal of minimizing the total transportation cost. Due to the different sizes and nature of customer orders and different capacities of trucks, an order might be split onto more than one truck. the problem then becomes not only of finding the optimal routes, but further of how to divide the orders between trucks. In this paper, the VRP with split strategy, considering heterogeneous fleet and orders is approached. the problem was first formulated as a mixed integer programming model (MILP) with a total transportation cost minimization objective. Due to the complexity of the problem, a two-phase solution algorithm was further proposed to solve the problem. the algorithm first constructs the routes sequentially based on the savings function, then it employs a 2-opt algorithm to improve the routes. the algorithm was applied to solve the problem for a fast moving consumer goods (FMCG) distribution company. Results indicated that the algorithm is able to minimize the number of required trucks and satisfy all customer orders, while minimizing the transportation cost.

关键词： Companies Transportation Load modeling Heuristic algorithms Solid modeling Vehicle routing Linear programming

来源：评论

学校读者我要写书评

暂无评论

An Object Oriented Approach Towards Simulating Physical Systems with Fluids and Rigid Bodies Based on the Physolator Simulation Framework 7th

An Object Oriented Approach Towards Simulating Physical Syst...

引用

7th international conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017

作者： Eisenbiegler, Dirk Rose, Waldemar University of Furtwangen Furtwangen Im Schwarzwald Germany

ISBN: (纸本)9783030014698

this article is about computer based simulations applied to physical systems that consists both of fluids and rigid bodies. It explains how to build such simulations in a systematic manner applying object oriented programming techniques. this work is based on the Physolator simulation framework. Physolator supports a modular design style. this article shows, how the Physolator framework can be used to build mixed fluid and rigid body simulations in a systematic manner by first building a set of reusable components and then building different kinds of physical systems by assembling these components. © 2019, Springer Nature Switzerland AG.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Application the Facility Location Model for Setting Ready-Mix Concrete Plant: Case Study at Rayong Province, thailand

Application the Facility Location Model for Setting Ready-Mi...

引用

international conference on Industrial Engineering and Applications (ICIEA)

作者： Satawat Doungpan School of Management Science Sukhothai Thammathirat Open University Nonthaburi Thailand

ISBN: (数字)9781728167855

ISBN: (纸本)9781728167862

the economic growth in thailand has occurred in many areas, there are the infrastructure and megaprojects are produced by the government and the private sector. Although, the construction project favors to use the ready-mixed concrete for main structures work. But the facility's location of the ready-mix concrete plant exists in the area is not suitably distributed for responding service at the demand point. However, it caused damage to the business because there was not a good plan for setting up the ready- mixed concrete plant facilities. the objective of this paper is to find the least number of the ready-mix concrete plant and it can be suitably the facility location that covers all expected demand nodes. the method used for searching locations of this work is the optimization modeling by using mixed integer programming with a set covering problem (LSCP) approach. Besides, we applicated this problem in Rayong province, thailand, which is cased our study. the results indicate that setting ready-mix concrete plants at Mueang Rayong district and Klaeng district can sufficiently service the whole Rayong province.

关键词： Concrete Transportation Mathematical model Linear programming Investment Economics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共360页 << < 81 82 83 84 85 86 87 88 89 90 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：