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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

216 篇 期刊文献
66 篇 会议
7 篇 学位论文

馆藏范围

289 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

213 篇 工学
- 101 篇 计算机科学与技术...
- 52 篇 电气工程
- 30 篇 控制科学与工程
- 27 篇 航空宇航科学与技...
- 21 篇 机械工程
- 17 篇 仪器科学与技术
- 17 篇 信息与通信工程
- 14 篇 交通运输工程
- 13 篇 软件工程
- 9 篇 石油与天然气工程
- 7 篇 土木工程
- 6 篇 力学（可授工学、理...
- 6 篇 化学工程与技术
- 5 篇 动力工程及工程热...
- 4 篇 环境科学与工程（可...
- 3 篇 水利工程
121 篇 管理学
- 118 篇 管理科学与工程(可...
- 19 篇 工商管理
79 篇 理学
- 64 篇 数学
- 6 篇 生物学
- 5 篇 系统科学
- 4 篇 物理学
- 4 篇 地理学
- 4 篇 生态学
- 3 篇 化学
- 3 篇 地球物理学
- 3 篇 地质学
- 3 篇 统计学（可授理学、...
29 篇 经济学
- 17 篇 应用经济学
- 13 篇 理论经济学
4 篇 医学
4 篇 军事学
2 篇 农学
1 篇 法学
1 篇 教育学

主题

289 篇 branch and bound...
15 篇 scheduling
10 篇 optimization
10 篇 global optimizat...
10 篇 genetic algorith...
9 篇 mixed integer li...
8 篇 feature selectio...
7 篇 linear programmi...
7 篇 integer programm...
6 篇 petri net
6 篇 cyclic schedulin...
6 篇 branch and bound...
6 篇 portfolio optimi...
5 篇 dimensionality r...
5 篇 combinatorial op...
5 篇 dynamic programm...
5 篇 nonlinear progra...
5 篇 greedy algorithm
4 篇 structural optim...
4 篇 no-wait

机构

5 篇 middle e tech un...
4 篇 korea adv inst s...
4 篇 northwestern pol...
4 篇 carnegie mellon ...
3 篇 northeastern uni...
3 篇 chung yuan chris...
3 篇 beijing jiaotong...
2 篇 indian inst tech...
2 篇 univ elect sci &...
2 篇 chinese univ hon...
2 篇 korea adv inst s...
2 篇 northwestern uni...
2 篇 university of ca...
2 篇 department of in...
2 篇 ain shams univ f...
2 篇 sichuan univ col...
2 篇 wayne state univ...
2 篇 vnit nagpur dept...
2 篇 iit kharagpur de...
2 篇 southeast univ n...

作者

9 篇 azizoglu meral
7 篇 nakariyakul song...
6 篇 yan pengyu
6 篇 kim hyun-jung
5 篇 konno h
5 篇 che ada
4 篇 chu chengbin
4 篇 rostami mohammad
4 篇 lee jun-ho
4 篇 bahig hatem m.
4 篇 yang naiding
4 篇 lee tae-eog
4 篇 kim yeong-dae
3 篇 haftka rt
3 篇 casasent david p...
3 篇 mishra sabyasach...
2 篇 ng wc
2 篇 telemeci yasin e...
2 篇 cai xiaoqiang
2 篇 shim sang-oh

语言

255 篇 英文
31 篇 其他
3 篇 中文

检索条件"主题词=branch and bound algorithm"

共 289 条记录，以下是231-240 订阅

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

详细简洁

排序：

Dynamic Power Adjustment and Resource Allocation Framework for LTE Networks 21

Dynamic Power Adjustment and Resource Allocation Framework f...

引用

21st IEEE International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)

作者： Secinti, Gokhan Ozcevik, Muge Erel Chowdhury, Kaushik R. Canberk, Berk Istanbul Tech Univ Dept Comp Engn Istanbul Turkey Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

ISBN: (纸本)9781509025589

In current LTE deployments, the unsupervised and unilateral installation of home or localized base stations, so called eNodeBs, may easily lead to excessive energy consumption and over-provisioning of network infrastructure. In this paper, we propose an energy efficient framework, which dynamically adjusts the power requirements of the system and performs Resource Block (RBs) allocation based on needs. It specifically optimizes power consumption of LTE networks consisting of under-utilized eNodeBs. The Energy Efficiency (EE) issue is formulated as an optimization problem, which trades off EE for SE without adversely impacting the downlink throughput. In order to solve this problem, we develop a heuristic approach called as Two Phase Enhanced branch and bound algorithm (TPEBB) [1]. End-to-end latency, modeled by Markov queues, is used as the main metric for QoS in this study [2]. Finally, we compare the proposed framework with various competing methods to show almost 70% improvement in EE and end-to-end latency.

关键词： Power Adjustment Resource Allocation Co-tier Interference Energy Efficiency branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

GEMS, a Generic Engine for MDO Scenarios: Key Features In Application

GEMS, a Generic Engine for MDO Scenarios: Key Features In Ap...

引用

AIAA Aviation Forum and Exposition

作者： Gallard, F. Barjhoux, P. J. Olivanti, R. Gazaix, A. Inst Technol IRT St Exupery Syst Engn & Modeling Dept Toulouse France Inst Technol IRT St Exupery Toulouse France Univ Toulouse ICA F-31400 Toulouse France Airbus Operat SAS F-31060 Toulouse France Univ Toulouse ISAE SUPAERO F-31400 Toulouse France

ISBN: (数字)9781624105890

ISBN: (纸本)9781624105890

This paper illustrates the capabilities of the GEMS (a Generic Engine for MDO Scenarios) Multidisciplinary Design Optimization software library, on three MDO use cases. A range of aircraft MDO applications are covered, showing the versatility of GEMS, both in terms of problems that can be addressed, and type of users, from academic to industrial ones. The focus is made on how the framework concepts allow to set up the MDO processes in an automatic and versatile way. The first use case is a series of trade-offs and MDO processes for high-fidelity aerodynamics-structure-OAD (Overall Aircraft Design) industrial engine pylon design, which is the main application of the IRT Saint Exupery MDA-MDO project. The second use case, consists in two multi-level MDO formulations that are developed to address mixed categorical and continuous structural optimization problems. In the third use case, an algorithmic framework is developed to perform multi-fidelity adjoint-based aerodynamic shape optimization, aiming at decreasing the restitution time compared to mono-fidelity approaches.

关键词： Multidisciplinary Design Optimization Aerodynamic Shape Optimization Structural Optimization Aircraft Design branch and bound algorithm Structural Simulation Derivative Free Optimization Finite Element Modeling Nastran Application Programming Interface

来源：评论

学校读者我要写书评

暂无评论

algorithm and Application of a Kind of Quadratic Integer Programming Model

Algorithm and Application of a Kind of Quadratic Integer Pro...

引用

2nd International Conference on Business Intelligence and Financial Engineering

作者： Wang, Zhufang Liu, Yingjie Shenyang Univ Technol Sch Management Shenyang 110178 Peoples R China

ISBN: (纸本)9780769537054

In order to solve a kind of quadratic integer programming problem with unrestrained conditions and multi-objective function, improvements on the traditional branch and bound algorithm are carried out in this paper. By introducing response function, a practical branch and bound algorithm to solve the quadratic integer programming model is derived. The procedure of the proposed algorithm is explicated in this paper and an example with two manufactures is studied. Numerical results show that the proposed algorithm is more effective than the traditional branch and bound algorithm, and fit for more complex problems.

关键词： branch and bound algorithm quadratic integer programming response function cournot model

来源：评论

学校读者我要写书评

暂无评论

Optimal PMU placement for power system observability considering secondary voltage control

Optimal PMU placement for power system observability conside...

引用

Canadian Conference on Electrical and Computer Engineering

作者： Mohammadi-Ivatloo, B. Hosseini, S. H. Sharif Univ Technol Dept Elect Engn Tehran Iran

ISBN: (纸本)9781424416424

This paper presents an optimal phasor measurement units (PMUs) placement algorithm for the purpose of power system observability and also increasing the performance of secondary voltage control scheme. The optimal placement problem (OPP) is formulated such that to minimize the number of PMU installations subject to full network observability and monitoring pilot buses of the system to improve secondary voltage control performance. The branch and bound optimization method is adopted to solve the OPP problem which is suitable for problems with integer and boolean variables. Topology-based algorithm is used for observability analysis. Constraint functions considering adjacent zero-injection (ZI) buses are constructed using a novel hybrid topology transformation-nonlinear constraint method. The IEEE 14-bus, 30-bus, 57-bus and 118-bus standard test systems and New England 39-bus test system are used for simulation purposes.

关键词： observability phasor measurement unit (PMU) secondary voltage control branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal EV Charging Network Design: When Users Have Choices 11

Optimal EV Charging Network Design: When Users Have Choices

引用

11th IEEE International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Chen, Yuchen Qin, Zhida Gan, Xiaoying Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9781728135557

The penetration rate of Electric Vehicles is increasing as expected. To meet the charging needs, numerous charging stations are built, which are small because of space and grid limitation in city. Such a high density distribution of charging stations offers EV users more choices when seeking for charging service. In order to offer users better choices with global knowledge, recommendation systems are developed. However, the cost generated from recommendation system is not considered when designing the charging network, which result in an increase of overall system cost. Therefore, this paper mainly focuses on the charging network design problem under generalized recommendation systems to find a better co-working solution. We first formulate the EV charging network design as a cost minimization problem, considering construction cost, incentive cost for users' to transfer in the charging network, and cost for the loss of users leaving the system, which is a nonlinear mixed-integer optimization problem. In order to solve such problem, we propose a branch and bound algorithm. By combining local search heuristic and cutting plane process, the exact optimal solution can be obtained efficiently. To demonstrate the superiority of the scheme proposed by us, simulation are conducted.

关键词： Electric Vehicles Charging Network Nonlinear Mixed-Integer Programming branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Geospatial Ontology-based Mission Assignment in Wireless Sensor Networks

Geospatial Ontology-based Mission Assignment in Wireless Sen...

引用

2015 International Conference on Recent Advances in Internet of Things (RIoT)

作者： Ibrahim, Alia Carrez, Francois Moessner, Klaus Univ Surrey Inst Commun Syst Guildford Surrey England

ISBN: (纸本)9781479983254

Wireless Sensor Networks (WSNs) have been a focus for research in recent years. They enable data gathering across a wide range of domains and areas of interest from health service to environment monitoring, security, etc. Sensors are becoming cheaper, and as a result are being deployed in high density, at the same time;users' requirements of the network are changing frequently, they can even exceed the capabilities of the sensors in the network sometimes. The network is expected to operate for a long period of time with many nodes operating on batteries. These challenges have raised the attention to the problem of mission assignment in WSNs. Mission assignment aims at allocating tasks to specific sensors in the network -according to their capabilities-to answer users requirements while at the same time preserving the energy of the network. This paper approaches the problem of mission assignment from a geospatial perspective: because sensors' readings and data are associated with spatial properties of the sensors like their location and sensing range;spatial reasoning is an important aspect of mission assignment. However, spatial reasoning is still very limited in WSNs and has not received much attention because of the lack of standardized modelling of space. In the center of our approach an integration of two ontologies;the W3C semantic sensor network ontology (SSN) which describes sensor nodes in the network and GeoSPARQL (the OGC standard for modelling and reasoning about spatial data). We present Geospatial Sensor Mission Assignment algorithm (GeoSMA);a branch and bound algorithm based on the spatial functions and relations between tasks' and sensors' spatial properties. The aim is to find the most appropriate set of nodes to answer various missions required by the users.

关键词： branch and bound algorithm Geospatial analysis Ontology Wireless Sensor Networks, Mission assignment

来源：评论

学校读者我要写书评

暂无评论

Single Machine Scheduling with Precedence Constrains, Release and Delivery Times 40th

Single Machine Scheduling with Precedence Constrains, Releas...

引用

40th Anniversary International Conference on Information Systems Architecture and Technology (ISAT)

作者： Grigoreva, Natalia St Petersburg State Univ Univ Nab 7-9 St Petersburg 199034 Russia

ISBN: (纸本)9783030304430;9783030304423

The goal of this paper is to propose algorithms for scheduling problem, where set of jobs performed on a single processor. Each job has a release time, when it becomes available for processing, a processing time and a delivery time. We study the case in which there exist precedence constrains among jobs and preemption is not allowed. The objective is to minimize the time, by which all jobs are delivered. The single machine scheduling problem is one of the classic NP-hard optimization problems, and it is useful in solving flowshop and jobshop scheduling problems. We develop branch and bound algorithm for the problem. We propose an approximation algorithm to find an upper bound, solve the preemptive version of the problem to provide a lower bound and use a binary branching rule, where at each branch node, a complete schedule is generated. To illustrate the effectiveness of our algorithms we tested them on randomly generated set of jobs.

关键词： Single processor branch and bound algorithm Release and delivery time Precedence constrains

来源：评论

学校读者我要写书评

暂无评论

Multi-user Detection Techniques for DS-CDMA UWB System

Multi-user Detection Techniques for DS-CDMA UWB System

引用

International Conference on Industry, Information System and Material Engineering

作者： Liu, Nanping Song, Xiangbo Xia, Kewen Shi, Yuan Hebei Univ Technol Sch Informat Engn Tianjin 300401 Peoples R China

ISBN: (纸本)9783037850275

Ultra-wideband(UWB) is currently one of three new technologies of wireless communication. Multi-user detection technique is mainly used to eliminate multiple access interference(MAI)in DS-CDMA UWB communication systems. Linear multi-user detection algorithm for multi-access interference suppression or even elimination has certain results. But for a fixed decision threshold is set to 0, the detection performance of linear multi-user detection algorithm will be decreased significantly. Therefore a kind of multi-user detection with pre-processing has been researched. Through the pre-processing, we set dynamic threshold to direct decision the user's data bit information so as to solve the problem the linear multi-user detector's decision threshold which is fixed impact the detection performance. We may get the global optimal solution though pre-processing of using the thought of the branch and bound algorithm and forcing rules. Then the original problem changes into a smaller multi-user detection problem, in order to get the aim of reducing MAT, increasing the probability of a correct decision and reducing the bit error rate. From the simulation experiment results, it is shown that it has a significant effect in system detection, because after pre-processing the probability of a correct decision has increased, and the bit error rate has been reduced.

关键词： Ultra-wideband(UWB) DS-CDMA Multi-User Detector Multiple access interference(MAI) branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Automatic Segmentation of Cell Candidate Regions in Microscopy Images Based on an Optimization algorithm 16

Automatic Segmentation of Cell Candidate Regions in Microsco...

引用

16th International Conference on Control, Automation and Systems (ICCAS)

作者： Tsuji, Kouki Tan, Joo Kooi Kim, Hyoungseop Yoneda, Kazue Tanaka, Fumihiro Kyushu Inst Technol Grad Sch Engn 1-1 Sensui Cho Kitakyushu Fukuoka 8048550 Japan Univ Occupat & Environm Hlth Sch Med Dept Surg 2 Kitakyushu Fukuoka Japan

ISBN: (纸本)9788993215120

Circulating tumor cells (CTCs) is an informative biomarker which assists pathologists in early diagnosis and evaluating therapeutic effects of patients with malignant tumors. The blood from a cancer patient is analyzed by a microscope and a large number of pictures including many cells are generated for each case. Thus, analyzing them is timeconsuming work for pathologists, and misdiagnosis may happen since the diagnosis of CTCs tends to depend on the individual skill of pathologist. In this paper, we propose a method which detects cell candidate regions in microscopy images automatically to make quantitative analysis possible by computer. Our proposed method consists of three steps. In the first step, we extract initial cell candidate regions in microscopy images based on the saliency map. In the second step, we choose nonsingle cell regions from the initial candidates based on the SVM algorithm. In the third step, we separate connected regions into single cell regions based on the branch and bound algorithm. We demonstrated the effectiveness of our proposed method using 540 microscopy images and we achieved a true positive rate of 99.04[%] and a false positive rate of 3.95[%].

关键词： Circulating tumor cell Segmentation Computer aided diagnosis Saliency map branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A Solution of a Mathematical Model Which Simulates Football Game as a Logistics Network 7

A Solution of a Mathematical Model Which Simulates Football ...

引用

7th International Conference on Sport Sciences Research and Technology Support (icSPORTS)

作者： Menguc, Kenan Beykent Univ Appl Sch Logist TR-34522 Istanbul Turkey

ISBN: (纸本)9789897583834

Routing is very important in team sports as well as in many parts of daily life. On 01.07.2018, in the World Cup tournament organized in Russia, Spain lost the match with a penalty shootout although it performed a higher number of passes. As a result of the elimination of Spain despite its very high ball possession, the nature of modern football doesn't necessarily require the multiplicity of passes. It is important to know where the passes are done, rather than high amounts of them. This study has simulated a mathematical model by bringing a different interpretation to the categorization of pass throws.

关键词： Transshipment Problem Optimization Spatio-temporal Data branch and bound algorithm Football Logistic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：