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

International Conference on Information Communication and Embedded Systems (ICICES)

作者： Rajalakshmi, T. Minu, R. I. Jerusalem Coll Engn Dept Comp Sci & Engg Madras Tamil Nadu India

ISBN: (纸本)9781479938346

Content-Based Image Retrieval (CBIR) refers to techniques that retrieve images based on their content, as opposed to based on metadata. A CBIR system performs indexing and retrieval tasks using features like color, texture and shape computed from images as opposed to using the whole images. In the medical field, content based image retrieval is used to aid radiologist to retrieve of images with similar contents. CBIR methods are usually developed for specific features of images, so that those methods are not readily applicable across different kinds of medical images. Content-Based Medical Image Retrieval (CBMIR) refers to techniques that retrieve images from medical image databases. A CBMIR system using the medical image features like Haralick features, Zernike moments, histogram intensity features and run-length features. In this study, CBMIR system With improved feature selection method is developed using a hybrid approach of "branch and bound algorithm" and "artificial bee colony algorithm" using the breast cancer, Brain tumor and thyroid images and classification is performed using Fuzzy based Relevance Vector Machine (FRVM) to form groups of relevant image features The Euclidean distance measurement is used to assess the similarity between query images and database images. A Relevance feedback method using diverse density algorithm is used to improve the performance of content-based medical image Retrieval. An improved feature selection method is used to reduces the existing system dimensionality curse problem and improve the performance of the system.

关键词： CBMIR Haralick feature Histogram intensity Run-length features Zernike moments branch and bound algorithm Artificial colony algorithm Fuzzy relevance vector machine classifier Diverse density algorithm

来源：评论

学校读者我要写书评

暂无评论

An Exact Method For The Multi-Vehicle Static Demand Responsive Transport Problem Based on Service Quality: the case of One-to-One

An Exact Method For The Multi-Vehicle Static Demand Responsi...

引用

International Conference on Advanced Logistics and Transport (ICALT)

作者： Ayadi, Manel Chabchoub, Habib Yassine, Adnan Univ Sfax Unite Logist Gest Ind & Qual Sfax Tunisia Univ Sfax Management & Ingn decis Organisat Sfax Tunisia Univ Havre Laboratoire Math Appliques Havre Le Havre France

ISBN: (纸本)9781479948390

Over the last years, various extensions of Vehicle Routing Problem, Considering the pick - up and delivery vehicle routing problem have been studied. In this work we tackle the pickup and delivery of passengers namely Demand Responsive Transport. Its idea is to group a number of passengers in the same vehicle with the respecting of the capacity of each vehicle in order to reduce operational cost with the maintaining of high quality service. This paper presents an exact Method which is the branch and bound algorithm to solve a new variant of Demand Responsive Transport which is based on service quality but not as an option it is an obligation. The Multi-Vehicle Demand Responsive Transport Problem Based on Service Quality in the case of One-to-One(MVSDRTPBSQ1-t-1) under study presented the following characteristics: Users specify transportation requests between origins and destinations, each customer have his own origin and own destination, they may provide a time window on their desired departure or arrival time. All demands are knows before the pacification of vehicles tours and the transportation is supplied by a fleet of vehicle based at a common depot. The aim of this paper is to find the best routing scheduled of all receipt requests with the respecting of hard Time Windows of each customer, its mean that the most important is the service quality of each customer. The novelty of our paper is presented in the new manner of algorithm application. However, we will trying to take the general architecture of branch & bound algorithm and using valuation rules in a different way which can adapted for such problem to find an optimal solution.

关键词： Demand Responsive Transport Problem Exact Method one-to-one transportation branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A Dynamic branch and bound Approach for Robotic Rescheduling with Randomly Arriving Jobs

A Dynamic Branch and Bound Approach for Robotic Rescheduling...

引用

10th IEEE International Conference on Networking, Sensing and Control (ICNSC)

作者： Yan, Pengyu Cai, Xiaoqiang Zhou, Zhen Tang, Xiaowo Univ Elect Sci & Technol China Sch Management & Econ Chengdu 610054 Peoples R China Chinese Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Hong Kong Peoples R China Northwestern Polytech Univ Sch Management Xian Peoples R China

ISBN: (纸本)9781467352000;9781467351980

This paper addresses a rescheduling problem in a robotic cell where a material handling robot is responsible to transport parts from one workstation to another and the different jobs (parts) arrive at the cell randomly. Our objective is to minimize the total completion time of all the jobs by dynamically changing the current schedule. Following a robotic rescheduling framework to find a new schedule, the problem is reduced to resolving a local deterministic robotic scheduling problem to minimize the total completion time. After that the local problem is formulated, according to the processing recipes of the jobs and the state of the robotic cell. We propose a branch and bound algorithm with a dynamic enumeration mechanism to solve the localized problem. Our proposed algorithm is evaluated by a numerical example.

关键词： Real-time scheduling robotic cell branch and bound algorithm dynamic enumeration

来源：评论

学校读者我要写书评

暂无评论

Low latency and energy efficient routing tree for wireless sensor networks with multiple mobile sinks

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2013年第1期36卷 156-166页

作者： Han, Seung-Wan Jeong, In-Seon Kang, Seung-Ho Natl Inst Math Sci Div Fus & Convergence Math Sci KT Daedeok Res Ctr 2 Taejon 305811 South Korea Elect & Telecommun Res Inst Cyber Secur Convergence Res Lab Taejon 305700 South Korea Natl Acad Agr Sci Genom Div Suwon 441707 South Korea

We propose the minimum Wiener index spanning tree (MWST) as a routing topology that is suitable for sensor networks with multiple mobile base nodes. However, it was proved that finding a spanning tree with the minimum Wiener index from a weighted graph is NP-hard. To address this problem and analyze the effectiveness of the MWST as the routing tree on sensor networks with multiple mobile base nodes, we designed two algorithms: a branch and bound algorithm for small-scale wireless sensor networks and a simulated annealing algorithm for large-scale wireless sensor networks. The simulation results show that MWST outperforms the minimum spanning tree (MST), one of the representative spanning trees used in many routing protocols for sensor networks, in terms of energy efficiency and packet delay. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Wireless sensor networks Mobile sink Routing tree Wiener index branch and bound algorithm Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Multiphase Mixed-Integer Optimal Control Approach to Aircraft Trajectory Optimization

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2013年第5期36卷 1267-1277页

作者： Bonami, Pierre Olivares, Alberto Soler, Manuel Staffetti, Ernesto Aix Marseille Univ CNRS F-13288 Marseille 9 France Univ Rey Juan Carlos Madrid 28943 Spain

In this paper, an approach to aircraft trajectory optimization is presented in which integer and continuous variables are considered. Integer variables model decision-making processes, and continuous variables describe the state of the aircraft, which evolves according to differential-algebraic equations. The problem is formulated as a multiphase mixed-integer optimal control problem. It is transcribed into a mixed-integer nonlinear programming problem by applying a fifth degree Gauss-Lobatto direct collocation method and is then solved using a nonlinear-programming-based branch-and-bound algorithm. The approach is applied to the following en route flight planning problem: Given an aircraft point mass model, a wind forecast, an airspace structure, and the relevant flying information regions with their associated overflying costs, find the control inputs that steer the aircraft from the initial fix to the final fix, following a route of waypoints while minimizing the fuel consumption and overflying costs during the flight. The decision-making process arises in determining the optimal sequence of waypoints. The optimal times at which the waypoints are to be overflown are also to be determined. Numerical results are presented and discussed, showing the effectiveness of the approach.

关键词： Trajectory Optimization Nonlinear Programming branch and bound algorithm North Atlantic Airspace Aircraft Operations Fuel Consumption Collocation Method Air Traffic Management System Commercial Aircraft Aerodynamic Force

来源：评论

学校读者我要写书评

暂无评论

Efficient derivation of numerical dependencies

引用

INFORMATION SYSTEMS 2013年第3期38卷 410-429页

作者： Ciaccia, Paolo Golfarelli, Matteo Rizzi, Stefano Univ Bologna DISI I-40126 Bologna Italy

Numerical dependencies (NDs) are database constraints that limit the number of distinct Y-values that can appear together with any X-value, where both X and Y are sets of attributes in a relation schema. While it is known that NDs are not finitely axiomatizable, there is no study on how to efficiently derive NDs using a set of sound (yet necessarily incomplete) rules. In this paper, after proving that solving the entailment problem for NDs using the chase procedure has exponential space complexity, we show that, given a set of inference rules similar to those used for functional dependencies, the membership problem for NDs is NP-hard. We then provide a graph-based characterization of NDs, which is exploited to design an efficient branch & bound algorithm for ND derivation. Our algorithm adopts several optimization strategies that provide considerable speed-up over a naive approach, as confirmed by the results of extensive tests we made for efficiency and effectiveness using six different datasets. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Numerical dependency Membership problem branch and bound algorithm Projection cardinality estimation

来源：评论

学校读者我要写书评

暂无评论

Optimization of Time-Open Constrained Lambert Rendezvous Using Interval Analysis

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2013年第1期36卷 175-184页

作者： Chen, Tong van Kampen, E. Yu, H. Chu, Q. P. Beihang Univ Sch Astronaut Dept Guidance Nav & Control Beijing 100191 Peoples R China Delft Univ Technol Fac Aerosp Engn Sect Control & Simulat NL-2600 GB Delft Netherlands

By defining a parking time and a transfer time, a time-open constrained Lambert rendezvous problem is proposed in this paper. The purpose of optimization is to minimize the velocity increment for the orbital rendezvous. The interval branch and bound optimization algorithm is introduced for solving a rendezvous optimization problem with strong nonlinearity and nonconvexity. A numerical example is undertaken to validate the interval optimization algorithm. The results indicate that although the global optimal solution for the time-open constrained Lambert rendezvous problem can't be found by using only the interval algorithm in the restricted hardware environment because of the inevitable influence of interval dependency and the complex calculation for the cost function, the interval algorithm can narrow the search space and split the feasible space into many small subspaces. Combining the gradient-based optimization method, an improved interval algorithm is used to find the minimal velocity increment for orbital rendezvous, which is better than the optimal solution using the genetic algorithm.

关键词： Orbital Rendezvous Optimization algorithm Genetic algorithm Orbital Maneuvers Lambert's Problem Orbital Elements branch and bound algorithm Apogee Altitude Numerical Analysis Right Ascension

来源：评论

学校读者我要写书评

暂无评论

Preserving an aging transit fleet: An optimal resource allocation perspective based on service life and constrained budget

引用

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE 2013年第Jan.期47卷 111-123页

作者： Mishra, Sabyasachee Sharma, Sushant Khasnabis, Snehamay Mathew, Tom V. Univ Memphis Dept Civil Engn Memphis TN 38152 USA Purdue Univ Reg Univ Transportat Ctr NEXTRANS Ctr W Lafayette IN 47096 USA Wayne State Univ Dept Civil & Environm Engn Detroit MI 48202 USA Indian Inst Technol Dept Civil Engn Bombay 400076 Maharashtra India

Local, county and state level transit agencies with large fleets of buses and limited budgets seek a robust fund allocation mechanism to maintain service standards. However, equitable and optimal fund allocation for purchasing, operating and maintaining a transit fleet is a complex process. In this study, we develop an optimization model for allocation of funds among different fleet improvement programs within budget constraints over the planning period. This is achieved by minimizing the net present cost (NPC) of the investment within the constraint of a minimum level of fleet quality expressed as a surrogate of the remaining life of the fleet. Integer programming is used to solve the formulated optimization problem using branch and bound algorithm. The model formulation and application are demonstrated with a real world case study of transit agencies. It is observed that minimizing NPC provides a realistic way to allocate resources between different program options among different transit agencies while maintaining a desired quality level. The proposed model is generalized and can be used as a resource allocation tool for transit fleet management by any transit agency. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Transit fleet Net present cost Integer programming branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Greedy-Heuristic-Aided Mixed-Integer Linear Programming Approach for Arrival Scheduling

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2013年第7期10卷 323-336页

作者： Cao, Yi Rathinam, Sivakumar Sun, Dengfeng Purdue Univ Sch Aeronaut & Astronaut W Lafayette IN 47906 USA Texas A&M Univ College Stn TX 77843 USA

Scheduling arriving aircraft in terminal airspace can be formulated using mixed-integer linear programming and solved by a branch and bound algorithm. Given that the problem is intrinsically nondeterministic polynomial-time hard, success in solving the problem within a reasonable time is not always guaranteed. This paper proposes an efficient optimization approach that calculates the minimum total delay necessary for a conflict-free arrival sequence. Agreedy heuristic is developed to find a feasible solution quickly, which serves as a "hot start" so that the branch and bound algorithm can prune as many search tree nodes as it can. Unnecessary searching is thus saved. The greedy heuristic also provides an estimated upper bound for the maximum delay that guarantees a feasible solution for the mixed-integer linear programming. In addition, it identifies a group of aircraft associated with high delays, which are suspended in the first stage of scheduling and sequenced in the second stage based on available time slots. This tactic decreases the computational difficulty. The proposed approach is validated using arriving traffic in 40 major United States airports. Compared to a standalone mixed-integer linear programming, the greedy-heuristic-aided mixed-integer linear programming yields suboptimal solutions in a more efficient manner, and the compromise of optimality is limited.

关键词： Mixed Integer Linear Programming branch and bound algorithm Airspace Ronald Reagan Washington National Airport Estimated Time of Arrival Aircraft Situation Display to Industry Traffic Management Advisor Standard Terminal Arrival Route Center TRACON Automation System Wingtip Vortices

来源：评论

学校读者我要写书评

暂无评论

Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)

引用

ANNALS OF OPERATIONS RESEARCH 2013年第1期206卷 311-339页

作者： Pinto, Gaby Ben-Dov, Yariv T. Rabinowitz, Gad Jerusalem Coll Engn JCE Dept Ind Engn & Management IL-91035 Jerusalem Israel Ben Gurion Univ BGU Negev Dept Ind Engn & Management IL-84105 Beer Sheva Israel

The main motivation of this study is to provide, for the first time, a formulation and solution for a class of production scheduling problems (as in cluster tools) characterized mainly by resource collaboration to perform an operation and while allowing batches and considering alternative production methods. We develop a formulation for the new problem and term it a multiple mode per operation, resource collaboration, and constrained scheduling problem (MRCCSP). Some of the important new characteristics we consider are: multiple products (families);multiple orders (jobs) per family;precedence restrictions among the operations that constitute a job;alternative modes for the performance of an operation (each of which needs a set of collaborating resources) may be defined;complementary and exclusive restrictions between operation-modes;batch production is allowed;and setup times may depend on sequence and batch-size. The objective of the MRCCSP is to minimize makespan. We formulate the MRCCSP as a mixed integer linear programming model, and acknowledging the considerable size of the monolithic formulation required, we prescribe a specific method to achieve size reduction. Finally, a customized branch and bound algorithm for optimally solving this problem is proposed and examined experimentally.

关键词： Resource-sharing and scheduling problem Resource constrained scheduling problem Mixed integer linear programming branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：