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

A robust sperm cell tracking algorithm using uneven lighting image fixing and improved branch and bound algorithm

IET IMAGE PROCESSING 2021年第9期15卷 2068-2079页

作者： Alhaj Alabdulla, Ahmad Hasiloglu, Abdulsamet Hicazi Aksu, Emrah Ataturk Univ Fac Engn Dept Comp Engn Erzurum Turkey Ataturk Univ Fac Vet Med Dept Reprod & Artificial Inseminat Erzurum Turkey

An accurate and robust sperm cells tracking algorithm that is able to detect and track sperm cells in videos with high accuracy and efficiency is presented. It is fast enough to process approximately 30 frames per second. It can find the correct path and measure motility parameters for each sperm. It can also adapt with different types of images coming from different cameras and bad recording conditions. Specifically, a new way is offered to optimize uneven lighting images to improve sperm cells detection which gives us the ability to get more accurate tracking results. The shape of each detected object is used to specify collided sperms and utilized dynamic gates which become bigger and smaller according to the sperm cell's speed. For assigning tracks to the detected sperm cells positions an improved version of branch and bound algorithm which is faster than the normal one is offered. This sperm cells tracking algorithm outperforms many of the previous algorithms as it has lower error rate in both sperm detection and tracking. It is compared with six other algorithms, and it gives lower tracking error rates. This method will allow doctors and researchers to obtain sperm motility data instantly and accurately.

关键词： sperm cells detection tracking cell motility collided sperms Patient diagnostic methods and instrumentation biomedical optical imaging Optical and laser radiation (medical uses) cellular biophysics robust sperm cell tracking algorithm sperm motility data Biology and medical computing Computer vision and image processing techniques assigning tracks cellular and subcellular transmembrane physics Other topics in statistics Biological transport target tracking Optical, image and video signal processing measure motility parameters image segmentation object tracking uneven lighting images bound algorithm robust sperm cells correct path object detection detected sperm cells positions accurate sperm cells medical image processing improved branch sperm detection approximately 30 frames uneven lighting image fixing lower tracking error rates accurate tracking results

来源：评论

学校读者我要写书评

暂无评论

EVALUATION OF THE BRANCH AND bound algorithm FOR FEATURE-SELECTION

引用

PATTERN RECOGNITION LETTERS 1990年第7期11卷 453-456页

作者： HAMAMOTO, Y UCHIMURA, S MATSUURA, Y KANAOKA, T TOMITA, S OSHIMA NATL COLL MARITIME TECHNOL OSHIMA 74221 JAPAN

Narendra and Fukunaga show that the branch and bound algorithm guarantees the optimal feature subset without evaluating all possible feature subsets, if the criterion function used satisfies the ‘monotonicity’ property. In this paper, we show that the algorithm works well in terms of the recognition rate, even if the property is not satisfied.

关键词： bound algorithm branch exhaustive search algorithm Feature selection recognition rate

来源：评论

学校读者我要写书评

暂无评论

A Branch and bound algorithm for Three-Machine Flow Shop with Overlapping Waiting Time Constraints

引用

IFAC-PapersOnLine 2017年第1期50卷 1101-1105页

作者： Kim H.-J. Lee J.-H. Department of Systems Management Engineering Sungkyunkwan University Suwon 16419 South Korea School of Business Konkuk University Seoul 05029 South Korea

This paper focuses on a three-machine flow shop scheduling problem with overlapping waiting time constraints for makespan minimization. In the problem, waiting times of each job between the first two machines and between the first and third machines are constrained by two distinctive time limits, respectively. Such overlapping waiting time constraints are one of the common scheduling requirements in semiconductor manufacturing since up to 20% of whole process steps are controlled with waiting time limits for better quality. For example, wafers completed with chemical treatment on a diffusion machine must be cleaned on a cleaning machine and then should be processed on another diffusion machine. In this case, two waiting time limits are independently applied between diffusion and cleaning machines and between two diffusion machines, respectively. We first identify several dominance properties of the problem and develop a branch and bound algorithm using the properties. We use heuristic algorithms to obtain a good initial solution and derive five different lower bounds. Computational tests are performed for evaluating the performance of the algorithm. © 2017

关键词： bound algorithm branch flow shop optimality waiting time constraint

来源：评论

学校读者我要写书评

暂无评论

Integer Linear Programming Model for Profit Maximization using Branch and bound algorithm in Retail Companies: Case of a Peruvian Company

引用

Procedia Computer Science 2024年 238卷 1054-1061页

作者： John Diego Chancahuana Castillo Willy Noe Parisuaña Yucra Mario Ninaquispe Soto Sonia Castro Ynfantes Universidad Nacional Mayor de San Marcos Lima Perú Universidad Privada del Norte Lima Peru

This article presents an inventory management model for profit maximization in a Peruvian retail company (FIDEL) using linear programming techniques and the Branch and bound algorithm. To introduce this paper we refute, through a review of previous studies in the same field, the use of this approach for its effectiveness in business decision-making. Gathering data on costs, demand and the available capital for the company’s different product lines was done through the use of interviews. The proposed model aims to maximize revenue based on the quantities of goods purchased, while considering minimum demand and capital constraints. Validation was performed with Lingo software to confirm the consistency and feasibility of the model. The resulting values revealed a significant increase in projected profits compared to actual data.

关键词： Integer Linear Programming Simplex method Branch bound algorithm Operational optimization

来源：评论

学校读者我要写书评

暂无评论

A Problem-Specific Branch-and-bound algorithm for the Protected Shortest Simple Path Problem with Must-Pass Nodes

引用

IFAC-PapersOnLine 2022年第10期55卷 572-577页

作者： Yuri Ogorodnikov Roman Rudakov Daniil Khachai Michael Khachay Krasovsky Institute of Mathematics and Mechanics Ekaterinburg Russia Ural State Federal University Ekaterinburg Russia Kedge Business School Bordeaux France

An instance of the Protected Shortest Simple Path Problem with Must-Pass Nodes (PSSPP-MPN) is specified by an edge-weighted directed graph with dedicated source, destination, and additional must-pass nodes. The goal is to find two vertex-disjoint paths, such that the former one is simple, visits all the must-pass nodes, and has the minimum transportation cost. In this paper, we show that the PSSPP-MPN is strongly NP-hard even for subsets of must-pass nodes of arbitrary fixed size and propose a novel problem-specific branch-and-bound algorithm for this problem. Results of competitive numerical evaluation against the public dataset ’Rome99’ from the 9th DIMACS Implementation Challenge show that the proposed algorithm notably outperforms the state-of-the-art MIP-optimizer Gurobi both by accuracy and execution time.

关键词： Protected Shortest Simple Path Problem with Must-Pass Nodes Branch bound algorithm MILP models

来源：评论

学校读者我要写书评

暂无评论

Virtual Servers Co-Migration for Mobile Accesses: Online versus Off-Line

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2015年第12期14卷 2576-2589页

作者： Wang, Yang Shi, Wei Hu, Menglan Univ New Brunswick Fac Comp Sci Fredericton BC E3B 5A3 Canada Univ Ontario Inst Technol Fac Business & IT Toronto ON H1L 7K4 Canada Huazhong Univ Sci & Technol Sch Elect Informat & Commun Wuhan 430074 Peoples R China

In this paper, we study the problem of co-migrating a set of service replicas residing on one or more redundant virtual servers in clouds in order to satisfy a sequence of mobile batch-request demands in a cost effective way. With such a migration, we can not only reduce the service access latency for end users but also minimize the network costs for service providers. The co-migration can be achieved at the cost of bulk-data transfer and increases the overall monetary costs for the service providers. To gain the benefits of service migration while minimizing the overall costs, we propose a co-migration algorithm Migk for multiple servers, each hosting a service replicas. Migk is a randomized algorithm with a competitive cost of O(gamma log n/min{1/k), mu/lambda+mu}) to migrate k services in a static n-node network where gamma is the maximal ratio of the migration costs between any pair of neighbor nodes in the network, and where lambda and mu represent the maximum wired transmission cost and the wireless link cost respectively. For comparison, we also study this problem in its static off-line form by proposing a parallel dynamic programming (hereafter DP) based algorithm that integrates the branch&bound strategy with sampling techniques in order to approximate the optimal DP results. We validate the advantage of the proposed algorithms via extensive simulation studies using various requests patterns and cloud network topologies. Our simulation results show that the proposed algorithms can effectively adapt to mobile access patterns to satisfy the service request sequences in a cost-effective way.

关键词： VM co-migration service migration mobile access branch bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Power Allocation and User Pairing Based Beam Reuse in a NOMA System 20

Power Allocation and User Pairing Based Beam Reuse in a NOMA...

引用

20th IEEE International Wireless Communications and Mobile Computing (IEEE IWCMC) - Green and Intelligent Communications

作者： Ni, Xuenan Zhao, Jianing Xia, Xinping Zhartgl, Xiaoying Zhou, Jianyi Yang, Weikang Southeast Univ Natl Mobile Commun Res Lab Nanjing Peoples R China Southeast Univ State Key Lab Millimeter Waves Nanjing Peoples R China Purple Mt Labs Nanjing Peoples R China

ISBN: (纸本)9798350361261;9798350361278

In this paper, the non-orthogonal multiple access (NOMA) principle is applied to reuse existing beams to serve additional far users, in the premise of a multi-antenna BS has designed the precoding for near users in an existing space division multiple access (SDMA) network. Specifically, the same beam serves three users, including the existing near user and two far users to be selected. In order to maximize the sum capacity of far users while ensuring the near user's rate requirements, a power allocation optimization problem is formulated and successfully solved by applying the branch-and-bound (BB) algorithm. Furthermore, for the far users pairing, three user pairing strategies: random user pairing (RP), most distinctive user pairing (MDP), and top two user pairing (TTP), are adopted. The results show that the same beam can serve two additional far users, which is more suitable in scenarios where the number of BS antennas is not significantly large. Additionally, the TTP strategy proves to be more advantageous in this scenario.

关键词： non-orthogonal multiple access power allocation user pairing branch-and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

MINIMIZING TOTAL TARDINESS ON PARALLEL MACHINES SUBJECT TO FLEXIBLE MAINTENANCE

引用

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE 2018年第4期25卷 472-489页

作者： Lee, Ju-Yong Kim, Yeong-Dae Lee, Tae-Eog Samsung Elect Semicond Business Smart IT Team Hwaseong South Korea Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Daejeon South Korea

This paper considers a scheduling problem on parallel machines for the objective of minimizing total tardiness. Each of the machines needs preventive maintenance tasks that should be started within a given cumulative working time limit after the previous maintenance. The starting time of a maintenance task is not fixed but flexible. That is, a maintenance task can be started at any time unless the cumulative working time after the end of the previous maintenance exceeds the given limit. Dominance properties and lower bounding schemes for the problem are proposed, and a branch and bound algorithm is presented. Computational tests on 3600 randomly generated instances are performed to evaluate the branch and bound algorithm, and the results show that the algorithm finds optimal solutions for problems with up to 20 jobs.

关键词： scheduling identical parallel machines flexible maintenance total tardiness branch bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An Exact Solution Approach to the Type-II Transfer Line Balancing Problem

引用

IFAC-PapersOnLine 2022年第10期55卷 442-447页

作者： Yasin Ersin Telemeci Meral Azizoğlu Dept of Ind. Eng. Middle East Technical University Ankara 06800 Turkey

In this study, we consider Type II Transfer Line Balancing problem that assigns the operations to the blocks and blocks to the workstations to minimize the cycle time. A mixed integer programming model is developed, and a branch and bound algorithm is proposed for the exact solutions. The efficiency of the branch and bound algorithm is enhanced by lower and upper bounding procedures. The computational results have revealed the satisfactory behavior of the model and branch and bound algorithm on moderate size problem instances.

关键词： Transfer Lines Type-II Transfer Line Balancing Mathematical Model Branch bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Maximizing pleasure in day tours: Utility theory approach

引用

INTERNATIONAL JOURNAL OF TOURISM RESEARCH 2021年第4期23卷 532-541页

作者： Jana, Rabin K. Mitra, Subrata K. Indian Inst Management Raipur Operat & Quantitat Methods Area Raipur 493661 Chhattisgarh India Inst Management Technol Finance Area Nagpur Maharashtra India

A personalized day tour planning problem is studied to maximize the total pleasure gained from the tour. The concept of utility theory is employed for this purpose. Considering the uniform and diminishing marginal pleasure intensities, two zero-one mixed integer nonlinear programming models are proposed. Both the models can accommodate preferred time slots, visits to specific spots, and spots diversity. A branch-and-bound algorithm is used to solve the proposed models. Finally, they are applied to solve the day tour problem for Delhi, India. The tour plan obtained using the diminishing marginal pleasure intensity offers an improved value of total pleasure.

关键词： branch‐ and‐ bound algorithm diminishing marginal pleasure intensity personalized day tour planning utility theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：