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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,955 篇 期刊文献
1,330 篇 会议
33 篇 学位论文

馆藏范围

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

日期分布

学科分类号

2,294 篇 工学
- 738 篇 计算机科学与技术...
- 707 篇 电气工程
- 434 篇 石油与天然气工程
- 270 篇 动力工程及工程热...
- 222 篇 机械工程
- 212 篇 控制科学与工程
- 190 篇 化学工程与技术
- 178 篇 信息与通信工程
- 129 篇 交通运输工程
- 117 篇 航空宇航科学与技...
- 85 篇 土木工程
- 76 篇 环境科学与工程（可...
- 75 篇 软件工程
- 63 篇 仪器科学与技术
- 43 篇 力学（可授工学、理...
- 34 篇 电子科学与技术（可...
- 28 篇 建筑学
- 21 篇 生物工程
- 17 篇 材料科学与工程（可...
- 16 篇 水利工程
785 篇 管理学
- 768 篇 管理科学与工程(可...
- 128 篇 工商管理
473 篇 理学
- 344 篇 数学
- 36 篇 物理学
- 34 篇 系统科学
- 30 篇 生物学
- 23 篇 化学
- 14 篇 统计学（可授理学、...
183 篇 经济学
- 131 篇 应用经济学
- 50 篇 理论经济学
25 篇 农学
19 篇 医学
9 篇 法学
5 篇 教育学
4 篇 军事学
3 篇 文学
2 篇 艺术学
1 篇 哲学

主题

3,318 篇 mixed integer li...
342 篇 optimization
168 篇 costs
144 篇 linear programmi...
125 篇 scheduling
90 篇 uncertainty
89 篇 planning
89 篇 computational mo...
81 篇 routing
63 篇 genetic algorith...
62 篇 unit commitment
62 篇 renewable energy...
59 篇 integer programm...
57 篇 transportation
55 篇 resource managem...
55 篇 production
54 篇 energy consumpti...
54 篇 mathematical mod...
51 篇 demand response
50 篇 energy storage

机构

12 篇 carnegie mellon ...
10 篇 huazhong univ sc...
8 篇 dalian univ tech...
8 篇 nanyang technol ...
8 篇 beijing jiaotong...
7 篇 aristotle univ t...
7 篇 liaocheng univ s...
6 篇 northwestern pol...
6 篇 univ lisbon inst...
6 篇 department of el...
6 篇 shiraz univ tech...
6 篇 georgia inst tec...
6 篇 universidade est...
5 篇 univ liege dept ...
5 篇 tongji univ sch ...
5 篇 korea adv inst s...
5 篇 shanghai univ sc...
5 篇 jet propulsion l...
5 篇 univ hong kong d...
5 篇 huazhong univ sc...

作者

17 篇 papageorgiou laz...
11 篇 biskas pandelis ...
11 篇 montemanni rober...
11 篇 rider marcos j.
10 篇 ho koki
9 篇 d'amore federico
9 篇 bezzo fabrizio
9 篇 artigues christi...
8 篇 meng leilei
8 篇 koltsaklis nikol...
8 篇 magatao leandro
8 篇 marechal francoi...
8 篇 ahn jaemyung
8 篇 zhang chaoyong
8 篇 tuncer t. engin
8 篇 bakirtzis anasta...
8 篇 barbosa-povoa an...
7 篇 tan raymond r.
7 篇 cheng chuntian
7 篇 grossmann ignaci...

语言

3,002 篇 英文
263 篇 其他
29 篇 中文
5 篇 土耳其文
2 篇 葡萄牙文

检索条件"主题词=mixed integer Linear programming"

共 3318 条记录，以下是3191-3200 订阅

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

详细简洁

排序：

Modeling of driver's collision avoidance behavior based on piecewise linear model

Modeling of driver's collision avoidance behavior based on p...

引用

IEEE Conference on Decision and Control

作者： Jong-Hae Kim S. Hayakawa T. Suzuki K. Hayashi S. Okuma N. Tsuchida M. Shimizu S. Kido Department of Electronics and Information Engineering Graduate School of Engineering University of Nagoya Nagoya Japan Toyota Technological Institute Nagoya Japan Department of Electronics Mechanical Engineering Graduate School of Engineering University of Nagoya Nagoya Japan Toyota Motor Corporation Toyota Japan

ISBN: (纸本)0780386825

This paper presents the development of the modeling strategy of the human driving behavior based on the expression as piecewise linear (PWL) model focusing on the driver's collision avoidance behavior. The driving data are collected by using the three-dimensional driving simulator based on CAVE, which provides stereoscopic immersive vision. In our modeling, the relationship between the driver's sensory information and the operation of the driver such as braking and/or steering amount is expressed by PWL model, which is a class of hybrid dynamical system (HDS). The identification problem for the PWL model is formulated as the mixed integer linear programming (MILP) by transforming the switching conditions into binary variables. From the obtained results, it is found that the driver appropriately switches the 'control low' according to the sensory information. These results enable us to capture not only the physical meaning of the driving skill, but also the decision-making aspect (switching conditions) in the driver's collision avoidance behavior.

关键词： Collision avoidance Piecewise linear techniques Decision making Humans mixed integer linear programming Switches Automatic control Neural networks Fuzzy systems Difference equations

来源：评论

学校读者我要写书评

暂无评论

Hardware-software co-synthesis of bus architecture embedded devices

Hardware-software co-synthesis of bus architecture embedded ...

引用

Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： J. Levman G. Khan J. Alirezaie Department of Electrical and Computer Engineering Ryerson University Toronto ONT Canada

Embedded systems permeate our society. Current estimates indicate that over 90 percent of worldwide computers are embedded systems. Embedded devices are found in the home, in medical instrumentation, air traffic control systems and more. Due to rapid advances in available technologies, the embedded systems of the future need to be designed using advanced tools that can help produce devices that meet performance, reliability and cost requirements. Hardware-software co-synthesis is the automatic generation of an embedded system's architecture. In this paper, we present an approach to hardware-software co-synthesis targeting bus architecture embedded systems. This approach employs exhaustive searching coupled with heuristic techniques while targeting multiple processor bus architecture pipelined heterogeneous systems. A substantive case study is provided demonstrating the tool's ability to analyze a variety of design trade-offs.

关键词： Computer architecture Embedded system Iterative methods Partitioning algorithms Hardware Pipeline processing mixed integer linear programming Iterative algorithms Jacobian matrices Java

来源：评论

学校读者我要写书评

暂无评论

Optimization methods for minimum power multicasting in wireless networks with sectored antennas

Optimization methods for minimum power multicasting in wirel...

引用

IEEE Conference on Wireless Communications and Networking

作者： A.K. Das R.J. Marks M. El-Sharkawi P. Arabshahi A. Gray Department of Electrical Engineering University of Washington Seattle WA USA School of Engineering and Computer Science Baylor University Waco TX USA Jet Propulsion Laboratory Pasadena CA USA

In this paper the problem of minimum power multicasting in wireless networks with sectored antennas is considered. For omnidirectional antenna systems, a transmission from node i to node j will also reach all nodes which are closer to i than j. Depending on the network geometry, this strategy can be highly power efficient In ideal sectored antenna systems, however, this phenomenon is sector specific; i.e., only those nodes which are located in the same sector as j will receive the transmission implicitly. Though this might seem an apparent disadvantage, the higher gains associated with directional antennas (as opposed to omni-directional antennas) allow for reduced transmission powers without sacrificing the signal-to-interference ratio at the receiver. In this paper, we first develop a mixed integer linear programming model for optimal solution of the minimum power multicast problem with sectored antennas. Subsequently, we discuss a biologically inspired algorithm for solving the problem to near-optimality at a very reasonable computation time. Experiments on randomly generated 10, 20 and 30-node networks indicate that near-optimal solutions can be obtained using the proposed algorithm.

关键词： Optimization methods Wireless networks Transmitting antennas Receiving antennas Multicast algorithms Geometry Directional antennas Directive antennas mixed integer linear programming Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

Event-driven optimal control of continuous Petri nets

Event-driven optimal control of continuous Petri nets

引用

IEEE Conference on Decision and Control

作者： J. Julvez A. Bemporad L. Recalde M. Silva Department Informática e Ingeniería de Sistemas Centro Politécnico Superior de Ingenieros Universidad de Zaragoza Zaragoza Spain Dipartimento Ingegneria dellInformazione Università di Siena Siena Italy

Optimally controlling a hybrid system is a challenging problem for which mainly continuous-time and discrete-time methods have been suggested. In this paper, the problem of optimal control is addressed in the framework of continuous Petri nets, a kind of hybrid systems whose state evolution is piecewise linear. The proposed approach consists of transforming the continuous Petri net into an equivalent hybrid system whose evolution is described by means of discrete-event steps. In particular, each step coincides with the occurrence of an event in the continuous Petri net. Thus, the number of steps required to know the behavior of the Petri net is minimum, while the accuracy is completely preserved. It is shown how to design a mixed integer linear programming problem in order to compute the optimal control solution of different performance criteria.

关键词： Optimal control Petri nets Sampling methods Switches Control systems Piecewise linear techniques mixed integer linear programming Continuous time systems Discrete event systems Equations

来源：评论

学校读者我要写书评

暂无评论

Improving ad hoc network performance with backbone topology control

Improving ad hoc network performance with backbone topology ...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： R. Meraihi G. Le Grand N. Puech M. Riguidel S. Tohme Computer Science and Networks Department LTCI-UMR 5141 CNRS GET/Télécom Paris Paris France GET/Télécom Paris (ENST) Computer Science and Networks Department Paris Cedex France CNRS-PRiSM Lab University of Versailles Versailles France

An important means to provide connectivity in areas where no access point is directly available is ad hoc networking. However, situations may occur where the connectivity of a set of nodes cannot be guaranteed (if they are too far apart); moreover, no QoS can be offered since the number of hops and the signal quality (thus the throughput) cannot be controlled. Therefore, we propose to deploy a controlled backbone in the ad hoc environment using movable mobile routers. This paper concentrates on two fundamental problems: on the one hand, global connectivity of the network is investigated, and on the other hand, we elaborate mechanisms that allow QoS support by setting an upper bound on the number of wireless hops. We describe the mixed integer linear programming (MILP) models for these deployment policies with respect to the constraints within these environments. Our approach suggested for backbone topology control allows one to achieve an efficient usage of resources.

关键词： Ad hoc networks Spine Network topology Quality of service Communication system control mixed integer linear programming Routing Centralized control Wireless sensor networks Computer science

来源：评论

学校读者我要写书评

暂无评论

Decentralized cooperative conflict resolution among multiple autonomous mobile agents

Decentralized cooperative conflict resolution among multiple...

引用

IEEE Conference on Decision and Control

作者： L. Pallottino V.G. Scordio A. Bicchi Interdepartmental Research Center E Piaggio University of Pisa Pisa Italy

In this paper we consider policies for cooperative, decentralized traffic management among a number of autonomous mobile agents. The conflict resolution problem is addressed considering realistic restrictions on possible maneuvers. We formulate this problem as one in mixed integer linear programming (MILP). The method, which proves successful in a centralized implementation with a large number of cooperating agents, is also extended to a decentralized setting. Conditions for the existence of conflict avoidance maneuvers for a system of 5 autonomous agents with a transitive information structure are provided, along with the explicit policy to be applied by each agent.

关键词： Mobile agents Safety Robot sensing systems mixed integer linear programming Autonomous agents Distributed control Path planning Motion control Multiagent systems Surveillance

来源：评论

学校读者我要写书评

暂无评论

Minimum-energy multicast routing in static wireless ad hoc networks

Minimum-energy multicast routing in static wireless ad hoc n...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Song Guo O.W. Yang School of Information Technology and Engineering University of Ottawa Ottawa ONT Canada

Wireless mobile ad hoc stations have limited battery capacity. One major performance metric used to evaluate broadcast and multicast trees is the lowest total energy consumption. We extend our previous work by presenting a more general study from the broadcast to multicast case, since the multicast tree obtained by pruning some broadcast tree does not give good performance once the multicast group sizes are small. We present a constraint formulation in terms of MILP (mixed integer linear programming), which can be used for an optimal solution of the minimum-energy multicast (MEM) problem in wireless ad hoc networks with omnidirectional antennas. Experimental results show that an optimal solution of the MEM problem using our MILP model can always be obtained in a timely manner for moderately sized networks, typically with 50 nodes.

关键词： Routing Intelligent networks Ad hoc networks Broadcasting mixed integer linear programming Mobile ad hoc networks Information technology Power engineering and energy Batteries Energy consumption

来源：评论

学校读者我要写书评

暂无评论

A time-path scheduling problem (TPSP) for aggregating large data files from distributed databases using an optical burst-switched network

A time-path scheduling problem (TPSP) for aggregating large ...

引用

IEEE International Conference on Communications (ICC)

作者： A. Banerjee N. Singhal J. Zhang D. Ghosal Chen-Nee Chuah B. Mukherjee University of California Davis CA USA

The problem of aggregating large data files from distributed databases and address the corresponding challenges involved from a network architecture perspective is considered. We model this problem as one of identifying a time-path schedule (TPS) in a graph representation of the network. We prove that the TPS problem (TPSP) is NP-complete. We then propose a mixed integer linear programming (MILP)-based approach and three heuristics longest-file-first (LFF), disjoint-paths (DP), and most-distant-file-first (MDFF) - to solve TPSP.

关键词： Distributed databases Optical fiber networks Data warehouses Supercomputers Biomedical optical imaging Optical network units Joining processes Optical fiber communication mixed integer linear programming Protocols

来源：评论

学校读者我要写书评

暂无评论

Study on the location of distribution center: a genetic algorithm combining mechanism of simulated annealing

Study on the location of distribution center: a genetic algo...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Guang-Bin Cui Yi-Jun Li School of Management Harbin Institute of Technology China

ISBN: (纸本)0780384032

The location of distribution center (DC) is one of the most important decision issues for logistics managers. In this paper, 0-1 mixed integer linear programming model of location of distribution center of two-stage logistics chain network is given. The design tasks of this problem involve the choice of distribution center to be opened and the optimal assignment of product flow between suppliers and customers via distribution centers to meet the demand with minimum cost As the solution method, a genetic algorithm combining mechanism of simulated annealing that is proved effective in dealing with the NP-hard problem is proposed.

关键词： Genetic algorithms Simulated annealing Logistics Transportation mixed integer linear programming Technology management Cost function Art Supply chains Production

来源：评论

学校读者我要写书评

暂无评论

Minimizing total tardiness on a single machine with sequence-dependent setup times

Minimizing total tardiness on a single machine with sequence...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： A. Souissi I. Kacem C. Chu ISTIT-OSI Université de Technologie de Troyes France

In this paper, we study the single machine scheduling problem with setup times for minimizing total tardiness. Such a problem is NP-hard and presents many difficulties to be solved. To reduce these difficulties, we propose a branch and bound algorithm. Our method is based on a new lower bound and is compared with Ragatz lower bound. New dominance rule and original exploration strategy are also proposed. Preliminary numerical simulations are encouraging and promising.

关键词： Single machine scheduling Job shop scheduling Simulated annealing Equations integer linear programming Numerical simulation Genetic algorithms mixed integer linear programming Scheduling algorithm Upper bound

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共332页 << < 316 317 318 319 320 321 322 323 324 325 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：