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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,944 篇 期刊文献
1,324 篇 会议
33 篇 学位论文

馆藏范围

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

日期分布

学科分类号

2,287 篇 工学
- 736 篇 计算机科学与技术...
- 708 篇 电气工程
- 433 篇 石油与天然气工程
- 270 篇 动力工程及工程热...
- 220 篇 机械工程
- 212 篇 控制科学与工程
- 189 篇 化学工程与技术
- 179 篇 信息与通信工程
- 126 篇 交通运输工程
- 118 篇 航空宇航科学与技...
- 85 篇 土木工程
- 76 篇 环境科学与工程（可...
- 74 篇 软件工程
- 63 篇 仪器科学与技术
- 43 篇 力学（可授工学、理...
- 35 篇 电子科学与技术（可...
- 28 篇 建筑学
- 21 篇 生物工程
- 19 篇 材料科学与工程（可...
- 16 篇 水利工程
780 篇 管理学
- 763 篇 管理科学与工程(可...
- 127 篇 工商管理
471 篇 理学
- 341 篇 数学
- 38 篇 物理学
- 34 篇 系统科学
- 30 篇 生物学
- 23 篇 化学
- 13 篇 统计学（可授理学、...
182 篇 经济学
- 130 篇 应用经济学
- 50 篇 理论经济学
25 篇 农学
19 篇 医学
9 篇 法学
5 篇 教育学
4 篇 军事学
3 篇 文学
2 篇 艺术学
1 篇 哲学

主题

3,301 篇 mixed integer li...
339 篇 optimization
167 篇 costs
143 篇 linear programmi...
124 篇 scheduling
90 篇 uncertainty
87 篇 planning
87 篇 computational mo...
81 篇 routing
63 篇 genetic algorith...
62 篇 unit commitment
61 篇 renewable energy...
59 篇 integer programm...
56 篇 transportation
55 篇 resource managem...
54 篇 energy consumpti...
54 篇 production
53 篇 mathematical mod...
51 篇 demand response
50 篇 heuristic algori...

机构

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 篇 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 篇 northwestern pol...
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...

语言

2,995 篇 英文
265 篇 其他
29 篇 中文
5 篇 德文
5 篇 法文
5 篇 土耳其文
2 篇 葡萄牙文

检索条件"主题词=Mixed integer linear programming"

共 3301 条记录，以下是3241-3250 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Partial Context-Sensitive Pointer Integrity for Real-time Embedded Systems

Partial Context-Sensitive Pointer Integrity for Real-time Em...

引用

Real-Time Systems Symposium (RTSS)

作者： Yujie Wang Cailani Lemieux-Mack Thidapat Chantem Sanjoy Baruah Ning Zhang Bryan C. Ward Washington University in St. Louis Vanderbilt University Virginia Tech

ISBN: (数字)9798331540265

ISBN: (纸本)9798331540272

Safety- and mission-critical cyber-physical systems (CPSs) require temporal correctness to ensure safe physical behavior. This manifests as strict timing requirements, which cannot be missed at runtime. Counter-intuitively, this implies that real-time tasks can be delayed so long as they remain guaranteed to meet their deadlines. This paper explores how extra time in a schedule can be analytically recapitalized for the purpose of applying stronger security protection within individual tasks at compile time. This is achieved through the development of a partial context-sensitive pointer-integrity framework (ParCSPI). In this framework, more fine-grained policies can be enforced, with greater runtime overheads, where so doing does not violate real-time constraints. A whole-system optimization framework based upon a mixed-integer linear programming approach to fixed-priority response-time analysis is used to identify precisely which contexts can be checked within the available system-wide time while maximizing system-wide security. ParCSPI leverages Arm pointer authentication (PA) to encode context-based equivalence classes into the modifiers of the pointer signature and is implemented using a customized program analyzer and LLVM compiler passes. An evaluation of ParCSPI is presented that includes per-task and system-wide overhead and security tradeoffs, as well as a demonstration on a real-world CPS. Empirical results are presented showing that ParCSPI achieves up to 62% pointer-integrity protection with only 10% worst-case execution time (WCET) overhead, and can find optimal security trade-offs in complex real-time task sets as well as approximate them in reasonable time.

关键词： Schedules Runtime Program processors Prototypes Real-time systems Timing mixed integer linear programming Security Protection Optimization

来源：评论

学校读者我要写书评

暂无评论

Constraint-Aware Resource Management for Cyber-Physical Systems

Constraint-Aware Resource Management for Cyber-Physical Syst...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Justin McGowen Ismet Dagli Neil T. Dantam Mehmet E. Belviranli Computer Science Department Colorado School of Mines

ISBN: (数字)9783981926385

ISBN: (纸本)9798350348606

Cyber-physical systems (CPS) such as robots and self-driving cars pose strict physical requirements to avoid failure. Scheduling choices impact these requirements. This presents a challenge: how do we find efficient schedules for CPS with heterogeneous processing units, such that the schedules are resource-bounded to meet the physical requirements? We propose the creation of a structured system, the Constrained Autonomous Workload Scheduler, which determines scheduling decisions with direct relations to the environment. By using a representation language (AuWL), Timed Petri nets, and mixed-integer linear programming, our scheme offers novel capabilities to represent and schedule many types of CPS workloads, real world constraints, and optimization criteria.

关键词： Schedules Processor scheduling Petri nets Cyber-physical systems mixed integer linear programming Autonomous automobiles Resource management

来源：评论

学校读者我要写书评

暂无评论

Combined optimal Location of FACTS controllers and loadability enhancement in competitive electricity markets using MILP

Combined optimal Location of FACTS controllers and loadabili...

引用

IEEE General Meeting Power& Energy Society

作者： A. Sharma S. Chanana S. Parida Department of Electrical Engineering National Institute of Technology Kurukshetra India Electrical Engineering Department Indian Institute of Technology Kanpur India

In this paper, a new methodology for combined location of thyristor controlled phase angle regulator (TCPAR) and thyristor controlled series compensator (TCSC) has been proposed using a mixed integer linear programming approach in the deregulated electricity environment. The methodology is based on DC load flow equations taking constraints on generation, line flow, TCPAR and TCSC parameters, power angle, and number of FACTS controllers. The system loadability has been determined without and with the combined optimal location of FACTS controllers for a pool model and hybrid model using secure bilateral transaction matrix. The results have been compared for a pool model and hybrid model with and without individual optimal location of FACTS controllers. The proposed technique has been demonstrated on IEEE 24 bus reliability test system.

关键词： Optimal control Electricity supply industry Thyristors Power system modeling Power capacitors Regulators mixed integer linear programming Electricity supply industry deregulation Load flow Equations

来源：评论

学校读者我要写书评

暂无评论

Efficient synthesis of array intensive computations onto FPGA based accelerators

Efficient synthesis of array intensive computations onto FPG...

引用

International Conference on VLSI Design

作者： N. Shenoy P. Banerjee A. Choudhary M. Kandemir Electrical and Computer Engineering Northwestern University Evanston IL USA

ISBN: (纸本)0769508316

Array intensive computations are characterized by processing of large arrays stored in external memory in multiple loops. Synthesizing these computations onto FPGAs involves automatic translation of the behavioral description into state machines controlled by a clock such that the execution time of the program as a whole is the minimum and area requirement does not exceed a predefined limit. The synthesis algorithm also needs to efficiently sequence the array, accesses taking into account memory access requirements such as pipelining. In this paper we present two algorithms each with a specific emphasis to handle this synthesis problem. Our heuristic algorithm generates good solutions in a very short time (less than a second), while our mixed integer linear programming (MILP) based algorithm can generate optimal solution given sufficient time. Both try to minimize execution time and area. Our algorithms not only look at individual loops to exploit parallelism but also consider them together while deciding the clock. The overall execution time is minimized and not just the number of cycles or the cycle time. They also efficiently synthesize memory accesses to fully exploit the memory pipelining. We compare these two algorithms in terms of their relative strengths.

关键词： Field programmable gate arrays Acceleration Clocks Automatic control Parallel processing Flow graphs Data flow computing Pipeline processing Heuristic algorithms mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Building hybrid industrial process model mixed with rules

Building hybrid industrial process model mixed with rules

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Liyan Zhang Longhua Ma Yongling Zheng Jixin Qian National Laboratory of Industrial Control Technology Institute of Systems Engineering University of Zhejiang Hangzhou China

ISBN: (纸本)0780379527

In process control fields it is hard to build precise model due to complexity and nonlinear of industrial process. To solve this problem, this paper proposes a framework for modeling and controlling systems integrating continuous variable linear model and rules. A predictive control scheme is proposed which is able to stabilize this framework on desired reference trajectories. This problem can be solved as mixed-integer linear programming/ Constraint programming (MILP/CP). We use MILP to optimize and find partial solutions and CP to check feasibility and produce complete solutions. An example demonstrates how problems can be modeled and solved using this framework.

关键词： Electrical equipment industry Predictive control integer linear programming Industrial control Predictive models Process control mixed integer linear programming Artificial neural networks Equations Laboratories

来源：评论

学校读者我要写书评

暂无评论

Design for shape control of tensegrities

Design for shape control of tensegrities

引用

American Control Conference (ACC)

作者： B. de Jager Department of Mechanical Engineering Technische Universiteit Eindhoven Eindhoven Netherlands

This paper proposes and demonstrates procedures to optimally design tensegrity structures actuation, based on closed loop shape control requirements, while at the same time a feasible path for realizing a desired shape is synthesized. The procedures are employing different optimization based formulations of a set of requirements needed for shape control. The specific procedure demonstrated is based on a mixed integer linear programming formulation, one of the simplest possible. It is possible to formulate the design problem more generally, but then the computations become more involved, inhibiting a real time implementation of the procedure. The demonstration is for a simple planar tensegrity, but the procedures can be applied to more general structures without modification

关键词： Shape control Tendons Bars Actuators mixed integer linear programming Art Biological cells Biological system modeling Force control Mechanical engineering

来源：评论

学校读者我要写书评

暂无评论

Flexibility Provision by Smart Homes in Integrated Energy Management Systems

Flexibility Provision by Smart Homes in Integrated Energy Ma...

引用

International Conference on Environment and Electrical Engineering (EEEIC)

作者： Mohammad Sadegh Javadi Ali Esmaeel Nezhad Pedro H.J. Nardelli Subham Sahoo Institute for Systems and Computer Engineering Technology and Science (INESC TEC) Porto Portugal Department of Electrical Engineering School of Energy Systems LUT University Lappeenranta Finland Department of Energy Technology Aalborg University Aalborg Denmark

ISBN: (数字)9781665485371

ISBN: (纸本)9781665485388

This paper presents a mathematical problem formulation for energy management systems for smart homes. The flexibility can be provided by a home energy management system (HEMS) in a local energy community. The main concept is to model the flexibility provision and flexibility procurement within the energy community that can be provided to the aggregator from active consumers. The integrated energy management model is coded as a standard mixed-integer linear programming (MILP) model which can be solved by open-source tools like the PuLP package developed in Python. The simulation results confirm the performance of the proposed model in terms of flexibility provided by the centralized integrated energy system introduced in this paper.

关键词： Home appliances Costs Simulation Smart homes Mathematical models mixed integer linear programming Energy management systems

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Branch-and-Cut Method with Shared Cutting Plane Information: A Case Study on Optimizing Garbage Collection

Multiobjective Branch-and-Cut Method with Shared Cutting Pla...

引用

International Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Tomoki Kaho Kazutoshi Sakakibara Mikiharu Arimura Shinya Watanabe The Graduate School of Engineering Muroran Institute of Technology Muroran Japan Department of Data Science Faculty of Information Engineering Toyama Prefectural University Toyama Japan Department of Engineering Muroran Institute of Technology Muroran Japan Department of Sciences and Informatics Muroran Institute of Technology Muroran Japan

ISBN: (数字)9798350373332

ISBN: (纸本)9798350373349

This paper presents an application of the Multi-Objective Branch-and-Bound based on Decomposition (MOBB/D) method for Branch-and-Cut, combining branch-and-bound and cutting-plane methods. Traditionally, multi-objective branch-and-bound methods for multi-objective mixed-integer linear programming problems struggle with the large number of Pareto-optimal solutions. MOBB/D addresses this by decomposing multi-objective problems into single-objective subproblems using weight vectors and applying branch-and-bound to each, with information sharing between nearby subproblems. In this paper, we customize the MOBB/D method for Branch-and-Cut to achieve an efficient search by sharing cutting plane information in MOBB/D. We demonstrate our approach with a case study on garbage collection planning in Muroran City, Hokkaido, Japan. This case study combines facility location and route optimization within a multi-objective framework, balancing the burdens on residents and garbage collection workers. Numerical experiments compare execution times and solutions with and without cutting plane sharing, and visualize the impact of different objective balance preferences on route optimization. The results show substantial efficiency gains and provide practical insights for multi-objective optimization in urban planning.

关键词： Visualization Scalability Roads Urban planning Vectors Real-time systems Planning mixed integer linear programming Computational efficiency Optimization

来源：评论

学校读者我要写书评

暂无评论

Exploring Non-linear programming Formulations in QuantumCircuitOpt for Optimal Circuit Design

Exploring Non-Linear Programming Formulations in QuantumCirc...

引用

Quantum Computing Software (QCS), IEEE/ACM International Workshop on

作者： Elena R. Henderson Harsha Nagarajan Carleton Coffrin Information Systems and Modeling Los Alamos National Laboratory Los Alamos NM USA Applied Math. and Plasma Physics (T-5) Los Alamos National Laboratory Los Alamos NM USA Advanced Network Science Initiative Los Alamos National Laboratory Los Alamos NM USA

ISBN: (纸本)9781665475372

Given the limitations of current hardware, the theoretical gains promised by quantum computing remain unre-alized across practical applications. But the gap between theory and hardware is closing, assisted by developments in quantum algorithmic modeling. One such recent development is Quan-tumCircuitOpt (QCOpt), an open-source software framework that leverages state-of-the-art optimization-based solvers to find provably optimal compact circuit decompositions, which are exact up to global phase and machine precision. The quantum circuit design problem can be modeled using non-linear, non-convex constraints. However, QCOpt reformulates these non-linear constraints using well-known linearization techniques such that the resulting design problem is solved as a mixed-integer linear programming model. In this work, we instead explore whether the QCOpt's model could also be effective with a continuous Non-linear programming (NLP) model obtained via relaxation of the integer variables in the non-linear constraints. We are able to present not only multiple significant enhancements to QCOpt, with up to 11.3x speed up in run times on an average, but also opportunities for more generally exploring the behavior of gradient-based NLP solvers.

关键词： Conferences Software algorithms Quantum mechanics linearization techniques programming Hardware mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共331页 << < 321 322 323 324 325 326 327 328 329 330 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：