As a key to improve the performance of the interbay automated material handling system （AMHS） in 300 mm semiconductor wafer fabrication system, the real- time overhead hoist transport （OHT） dispatching problem has...As a key to improve the performance of the interbay automated material handling system （AMHS） in 300 mm semiconductor wafer fabrication system, the real- time overhead hoist transport （OHT） dispatching problem has received much attention. This problem is first formu- lated as a special form of assignment problem and it is proved that more than one solution will be obtained by Hungarian algorithm simultaneously. Through proposing and strictly proving two propositions related to the char- acteristics of these solutions, a modified Hungarian algo- rithm is designed to distinguish these solutions. Finally, a new real-time OHT dispatching method is carefully designed by implementing the solution obtained by the modified Hungarian algorithm. The experimental results of discrete event simulations show that, compared with con- ventional Hungarian algorithm dispatching method, the proposed dispatching method that chooses the solution with the maximum variance respectively reduces on average 4 s of the average waiting time and average lead time of wafer lots, and its performance is rather stable in multiple dif- ferent scenarios of the interbay AMHS with different quantities of shortcuts. This research provides an efficient real-time OHT dispatching mechanism for the interbay AMHS with shortcuts and bypasses.展开更多
In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used t...In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.展开更多
A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood d...A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.展开更多
AIM To investigate the association of seven single nucleotide polymorphisms(SNPs) of the IL23 R gene with the clinical picture of ulcerative colitis(UC). METHODS Genomic DNA samples of 131 patients (66 males, 65 femal...AIM To investigate the association of seven single nucleotide polymorphisms(SNPs) of the IL23 R gene with the clinical picture of ulcerative colitis(UC). METHODS Genomic DNA samples of 131 patients (66 males, 65 females, mean age 55.4 ± 15.8 years) with Caucasian origin, diagnosed with UC were investigated. The diagnosis of UC was based on the established clinical, endoscopic, radiological, and histopathological guidelines. DNA was extracted from peripheral blood leukocytes by routine salting out method. Polymerase chain reaction and restriction fragment length polymorphism were used to identify the alleles of seven SNPs of IL23 R gene(rs11209026, rs10889677, rs1004819, rs2201841, rs7517847, rs10489629, rs7530511).RESULTS Four out of seven analyzed SNPs had statistically significant influence on the clinical picture of UC. Two SNPs were associated with greater colonic extension(rs2201841 P = 0.0084; rs10489629 P = 0.0405). For two of the SNPs, there was more frequently need for operations (rs2201841 P = 0.0348, OR = 8.0; rs10889677 P = 0.0347, OR = 8.0). The rs2201841 showed to be a risk factor for the development of iron deficiency (P = 0.0388, OR = 6.1837). For patients with the rs10889677, a therapy with azathioprine was more frequently necessary(P = 0.0116, OR = 6.1707). Patients with rs10489629 SNP had a lower risk for weight loss(P = 0.0169, OR = 0.3394). Carriers of the heterozygous variant had a higher risk for an extended disease (P = 0.0284). The rs7517847 showed a protective character leading to mild bowel movements. Three SNPs demonstrated no statistically significant influence on any examined clinical features of UC.CONCLUSION We demonstrated susceptible or protective character of the investigated IL23 R SNPs on the phenotype of UC, confirming the genetic association.展开更多
A novel cooperative sensing method is proposed in this paper. The proposed scheme adopts sensing creditability degree to characterize the impact of the distance and the channel parameters on the sensing result,and con...A novel cooperative sensing method is proposed in this paper. The proposed scheme adopts sensing creditability degree to characterize the impact of the distance and the channel parameters on the sensing result,and considers that each user has different average SNR and different decision threshold,by using General Nash Bargaining Solution (GNBS) strategy in Cooperative Game Theory (CGT),the detection performance for two-user case are derived. For multi-user case,the sensing performance is obtained with Hungarian method. Compared with the traditional schemes such as Nash Bargaining Solution (NBS) and AND,the proposed scheme covers all the factors mentioned above,and enhances the sensing rationality and reliability. Simulation results show that the proposed scheme can further improve the sensing performance and creditability.展开更多
In this paper, we propose an algorithm for solving multi-objective assignment problem (MOAP) through Hungarian Algorithm, and this approach emphasizes on optimal solution of each objective function by minimizing the r...In this paper, we propose an algorithm for solving multi-objective assignment problem (MOAP) through Hungarian Algorithm, and this approach emphasizes on optimal solution of each objective function by minimizing the resource. To illustrate the algorithm a numerical example (Sec. 4;Table 1) is presented.展开更多
Recently, Yadaiah and Haragopal published in the American Journal of Operations Research a new approach to solving the unbalanced assignment problem. They also provide a numerical example which they solve with their a...Recently, Yadaiah and Haragopal published in the American Journal of Operations Research a new approach to solving the unbalanced assignment problem. They also provide a numerical example which they solve with their approach and get a cost of 1550 which they claim is optimum. This approach might be of interest;however, their approach does not guarantee the optimal solution. In this short paper, we will show that solving this same example from the Yadaiah and Haragopal paper by using a simple textbook formulation to balance the problem and then solve it with the classic Hungarian method of Kuhn yields the true optimal solution with a cost of 1520.展开更多
To improve the performance of an automated material handling system (AMHS) in 300 mm semiconductor fabrication plants (FABs), an overhead-hoist-transport (OHT) vehicle dispatching problem was described for semiconduct...To improve the performance of an automated material handling system (AMHS) in 300 mm semiconductor fabrication plants (FABs), an overhead-hoist-transport (OHT) vehicle dispatching problem was described for semiconductor FABs. An original wafer lot dispatching policy was proposed. To minimize costs due to transportation logic, a dispatching rule based on an adapted Hungarian algorithm was presented, and six factors were considered. In addition to the recurring parameters, two original parameters of the vehicles utilization and wafer lot priority were considered to evaluate system performance. To obtain a balanced efficiency regarding the FAB output factors, simulation and sensitive analysis were used to find the best weight parameters of the cost matrix. In particular, a high rate of priority wafer lots (greater than 20%) and vehicles utilization (greater than 75%) are obtained without penalizing the efficiency of the FABs. The results indicate that the proposed dispatching policy is valid and practical.展开更多
无线传感器网络栅栏被破坏后,重建栅栏是延长其生存周期的重要手段之一,因此提出一种低能耗的wsn栅栏重建方法BRMLE(Barrier Reconstruction Method with the Low Energy consumption),在充分利用静态节点的基础上,派遣可移动节点完成...无线传感器网络栅栏被破坏后,重建栅栏是延长其生存周期的重要手段之一,因此提出一种低能耗的wsn栅栏重建方法BRMLE(Barrier Reconstruction Method with the Low Energy consumption),在充分利用静态节点的基础上,派遣可移动节点完成栅栏的重建工作。首先在栅栏重建区域构建静态传感器节点的全连接拓扑图,然后计算拓扑图中每条边被感知范围完全覆盖所需的节点数量,接着利用KSP(Top-k-Shortest Path)算法寻找拓扑图中k条重建路径,最后利用匈牙利算法选择最佳重建路径并派遣可移动节点完成栅栏重建。BRMLE方法综合考虑了栅栏的重建路径和可移动节点的派遣优化,使得重建栅栏的能耗最低。仿真实验与Optimal方法对比,证明了BRMLE方法需要的可移动节点数量更少,节点的平均移动距离更短,消耗的能量更低。展开更多
Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems an...Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems and competition assignment problems. The kinds of competition assignment problem algorithms based on Hungarian method and the solutions of them were studied.展开更多
MIMO-OFDMA is a promising technique for future broadband wireless communication systems. In this paper, the problem of allocating subcarriers among different users to maximize the total capacity is addressed. The opti...MIMO-OFDMA is a promising technique for future broadband wireless communication systems. In this paper, the problem of allocating subcarriers among different users to maximize the total capacity is addressed. The optimal solution can be obtained by Hungarian method is proved, using two utility matrices, i.e. the Frobenius-norm matrix and the determinant matrix. Simulation results show that the proposed algorithm can achieve higher capacity than the existing algorithms, and it is globally optimal and easy to be implemented.展开更多
Assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management...Assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management and sector leaders alike. Hungarian algorithm has been the most successful tool for solving such problems. The authors have proposed a heuristic method for solving assignment problems with less computing time in comparison with Hungarian algorithm that gives comparable results with an added advantage of easy implementation. The proposed heuristic method is used to compute some bench mark problems.展开更多
In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.
In this paper,a novel WLAN system,Cognitive WLAN over Fiber (CWLANoF),is introduced in the first place.Moreover,when CWLANoF has more channels than STAs,a new channel allocation scheme is proposed using the Hungarian ...In this paper,a novel WLAN system,Cognitive WLAN over Fiber (CWLANoF),is introduced in the first place.Moreover,when CWLANoF has more channels than STAs,a new channel allocation scheme is proposed using the Hungarian algorithm,which is demonstrated to be the optimal one.Furthermore,when CWLANoF has fewer channels than STAs,it is possible for more than one STA to share the same channel simultaneously based on the new features of CWLANoF.And the power control scheme is proposed for this kind of sharing,considering efficiency and fairness.Finally,extensive simulation results illustrate the significant performance improvement of the proposed channel allocation scheme and power control scheme.展开更多
A literature analysis has shown that object search,recognition,and tracking systems are becoming increasingly popular.However,such systems do not achieve high practical results in analyzing small moving living objects...A literature analysis has shown that object search,recognition,and tracking systems are becoming increasingly popular.However,such systems do not achieve high practical results in analyzing small moving living objects ranging from 8 to 14 mm.This article examines methods and tools for recognizing and tracking the class of small moving objects,such as ants.To fulfill those aims,a customized You Only Look Once Ants Recognition(YOLO_AR)Convolutional Neural Network(CNN)has been trained to recognize Messor Structor ants in the laboratory using the LabelImg object marker tool.The proposed model is an extension of the You Only Look Once v4(Yolov4)512×512 model with an additional Self Regularized Non–Monotonic(Mish)activation function.Additionally,the scalable solution for continuous object recognizing and tracking was implemented.This solution is based on the OpenDatacam system,with extended Object Tracking modules that allow for tracking and counting objects that have crossed the custom boundary line.During the study,the methods of the alignment algorithm for finding the trajectory of moving objects were modified.I discovered that the Hungarian algorithm showed better results in tracking small objects than the K–D dimensional tree(k-d tree)matching algorithm used in OpenDataCam.Remarkably,such an algorithm showed better results with the implemented YOLO_AR model due to the lack of False Positives(FP).Therefore,I provided a new tracker module with a Hungarian matching algorithm verified on the Multiple Object Tracking(MOT)benchmark.Furthermore,additional customization parameters for object recognition and tracking results parsing and filtering were added,like boundary angle threshold(BAT)and past frames trajectory prediction(PFTP).Experimental tests confirmed the results of the study on a mobile device.During the experiment,parameters such as the quality of recognition and tracking of moving objects,the PFTP and BAT,and the configuration parameters of the neural network and boundary line model were analyzed.The res展开更多
Cell association is a significant research issue in future mobile communication systems due to the unacceptably large computational time of traditional schemes.This article proposes a polynomial-time cell association ...Cell association is a significant research issue in future mobile communication systems due to the unacceptably large computational time of traditional schemes.This article proposes a polynomial-time cell association scheme which not only completes the association in polynomial time but also fits for a generic optimization objective function.On the one hand,traditional cell association as a non-deterministic polynomial(NP)hard problem with a generic utility function is heuristically transformed into a 2-dimensional assignment optimization and solved by a certain polynomial-time algorithm,which significantly saves computational time.On the other hand,the scheme jointly considers utility maximization and load balancing among multiple base stations(BSs)by maintaining an experience pool storing a set of weighting factor values and their corresponding performances.When an association optimization is required,a suitable weighting factor value is taken from the pool to calculate a long square utility matrix and a certain polynomial-time algorithm will be applied for the association.Comparing with several representative schemes,the proposed scheme achieves large system capacity and high fairness within a relatively short computational time.展开更多
基金Supported by National Natural Science Foundation of China(Grant No.51275307)
文摘As a key to improve the performance of the interbay automated material handling system （AMHS） in 300 mm semiconductor wafer fabrication system, the real- time overhead hoist transport （OHT） dispatching problem has received much attention. This problem is first formu- lated as a special form of assignment problem and it is proved that more than one solution will be obtained by Hungarian algorithm simultaneously. Through proposing and strictly proving two propositions related to the char- acteristics of these solutions, a modified Hungarian algo- rithm is designed to distinguish these solutions. Finally, a new real-time OHT dispatching method is carefully designed by implementing the solution obtained by the modified Hungarian algorithm. The experimental results of discrete event simulations show that, compared with con- ventional Hungarian algorithm dispatching method, the proposed dispatching method that chooses the solution with the maximum variance respectively reduces on average 4 s of the average waiting time and average lead time of wafer lots, and its performance is rather stable in multiple dif- ferent scenarios of the interbay AMHS with different quantities of shortcuts. This research provides an efficient real-time OHT dispatching mechanism for the interbay AMHS with shortcuts and bypasses.
文摘In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.
基金This project was supported by the National Natural Science Foundation of China (60272024).
文摘A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.
基金Supportedby Hungarian Science Foundation(OTKA),No.K103983 and No.K119540
文摘AIM To investigate the association of seven single nucleotide polymorphisms(SNPs) of the IL23 R gene with the clinical picture of ulcerative colitis(UC). METHODS Genomic DNA samples of 131 patients (66 males, 65 females, mean age 55.4 ± 15.8 years) with Caucasian origin, diagnosed with UC were investigated. The diagnosis of UC was based on the established clinical, endoscopic, radiological, and histopathological guidelines. DNA was extracted from peripheral blood leukocytes by routine salting out method. Polymerase chain reaction and restriction fragment length polymorphism were used to identify the alleles of seven SNPs of IL23 R gene(rs11209026, rs10889677, rs1004819, rs2201841, rs7517847, rs10489629, rs7530511).RESULTS Four out of seven analyzed SNPs had statistically significant influence on the clinical picture of UC. Two SNPs were associated with greater colonic extension(rs2201841 P = 0.0084; rs10489629 P = 0.0405). For two of the SNPs, there was more frequently need for operations (rs2201841 P = 0.0348, OR = 8.0; rs10889677 P = 0.0347, OR = 8.0). The rs2201841 showed to be a risk factor for the development of iron deficiency (P = 0.0388, OR = 6.1837). For patients with the rs10889677, a therapy with azathioprine was more frequently necessary(P = 0.0116, OR = 6.1707). Patients with rs10489629 SNP had a lower risk for weight loss(P = 0.0169, OR = 0.3394). Carriers of the heterozygous variant had a higher risk for an extended disease (P = 0.0284). The rs7517847 showed a protective character leading to mild bowel movements. Three SNPs demonstrated no statistically significant influence on any examined clinical features of UC.CONCLUSION We demonstrated susceptible or protective character of the investigated IL23 R SNPs on the phenotype of UC, confirming the genetic association.
基金Supported by the National High Technology Research and Development Program of China (863 Program,No.2009AA01-Z241)the National Natural Science Foundation of China (No.60772062)
文摘A novel cooperative sensing method is proposed in this paper. The proposed scheme adopts sensing creditability degree to characterize the impact of the distance and the channel parameters on the sensing result,and considers that each user has different average SNR and different decision threshold,by using General Nash Bargaining Solution (GNBS) strategy in Cooperative Game Theory (CGT),the detection performance for two-user case are derived. For multi-user case,the sensing performance is obtained with Hungarian method. Compared with the traditional schemes such as Nash Bargaining Solution (NBS) and AND,the proposed scheme covers all the factors mentioned above,and enhances the sensing rationality and reliability. Simulation results show that the proposed scheme can further improve the sensing performance and creditability.
文摘In this paper, we propose an algorithm for solving multi-objective assignment problem (MOAP) through Hungarian Algorithm, and this approach emphasizes on optimal solution of each objective function by minimizing the resource. To illustrate the algorithm a numerical example (Sec. 4;Table 1) is presented.
文摘Recently, Yadaiah and Haragopal published in the American Journal of Operations Research a new approach to solving the unbalanced assignment problem. They also provide a numerical example which they solve with their approach and get a cost of 1550 which they claim is optimum. This approach might be of interest;however, their approach does not guarantee the optimal solution. In this short paper, we will show that solving this same example from the Yadaiah and Haragopal paper by using a simple textbook formulation to balance the problem and then solve it with the classic Hungarian method of Kuhn yields the true optimal solution with a cost of 1520.
基金National Natural Science Foundations of China ( No. 71071115,No. 61273035)National High-Tech R&D Program for CIMS,China ( No. 2009AA043000)
文摘To improve the performance of an automated material handling system (AMHS) in 300 mm semiconductor fabrication plants (FABs), an overhead-hoist-transport (OHT) vehicle dispatching problem was described for semiconductor FABs. An original wafer lot dispatching policy was proposed. To minimize costs due to transportation logic, a dispatching rule based on an adapted Hungarian algorithm was presented, and six factors were considered. In addition to the recurring parameters, two original parameters of the vehicles utilization and wafer lot priority were considered to evaluate system performance. To obtain a balanced efficiency regarding the FAB output factors, simulation and sensitive analysis were used to find the best weight parameters of the cost matrix. In particular, a high rate of priority wafer lots (greater than 20%) and vehicles utilization (greater than 75%) are obtained without penalizing the efficiency of the FABs. The results indicate that the proposed dispatching policy is valid and practical.
文摘无线传感器网络栅栏被破坏后,重建栅栏是延长其生存周期的重要手段之一,因此提出一种低能耗的wsn栅栏重建方法BRMLE(Barrier Reconstruction Method with the Low Energy consumption),在充分利用静态节点的基础上,派遣可移动节点完成栅栏的重建工作。首先在栅栏重建区域构建静态传感器节点的全连接拓扑图,然后计算拓扑图中每条边被感知范围完全覆盖所需的节点数量,接着利用KSP(Top-k-Shortest Path)算法寻找拓扑图中k条重建路径,最后利用匈牙利算法选择最佳重建路径并派遣可移动节点完成栅栏重建。BRMLE方法综合考虑了栅栏的重建路径和可移动节点的派遣优化,使得重建栅栏的能耗最低。仿真实验与Optimal方法对比,证明了BRMLE方法需要的可移动节点数量更少,节点的平均移动距离更短,消耗的能量更低。
文摘Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems and competition assignment problems. The kinds of competition assignment problem algorithms based on Hungarian method and the solutions of them were studied.
基金supported by the National Natural Science Foundation of China (Grant No.60572156)
文摘MIMO-OFDMA is a promising technique for future broadband wireless communication systems. In this paper, the problem of allocating subcarriers among different users to maximize the total capacity is addressed. The optimal solution can be obtained by Hungarian method is proved, using two utility matrices, i.e. the Frobenius-norm matrix and the determinant matrix. Simulation results show that the proposed algorithm can achieve higher capacity than the existing algorithms, and it is globally optimal and easy to be implemented.
文摘Assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management and sector leaders alike. Hungarian algorithm has been the most successful tool for solving such problems. The authors have proposed a heuristic method for solving assignment problems with less computing time in comparison with Hungarian algorithm that gives comparable results with an added advantage of easy implementation. The proposed heuristic method is used to compute some bench mark problems.
文摘In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.
基金Sponsored by the National Natural Science Foundation of China (Grant No.60832009 )Beijing Municipal Natural Science Foundation (Grant No.4102044)National Youth Science Foundation (Grant No.61001115)
文摘In this paper,a novel WLAN system,Cognitive WLAN over Fiber (CWLANoF),is introduced in the first place.Moreover,when CWLANoF has more channels than STAs,a new channel allocation scheme is proposed using the Hungarian algorithm,which is demonstrated to be the optimal one.Furthermore,when CWLANoF has fewer channels than STAs,it is possible for more than one STA to share the same channel simultaneously based on the new features of CWLANoF.And the power control scheme is proposed for this kind of sharing,considering efficiency and fairness.Finally,extensive simulation results illustrate the significant performance improvement of the proposed channel allocation scheme and power control scheme.
文摘A literature analysis has shown that object search,recognition,and tracking systems are becoming increasingly popular.However,such systems do not achieve high practical results in analyzing small moving living objects ranging from 8 to 14 mm.This article examines methods and tools for recognizing and tracking the class of small moving objects,such as ants.To fulfill those aims,a customized You Only Look Once Ants Recognition(YOLO_AR)Convolutional Neural Network(CNN)has been trained to recognize Messor Structor ants in the laboratory using the LabelImg object marker tool.The proposed model is an extension of the You Only Look Once v4(Yolov4)512×512 model with an additional Self Regularized Non–Monotonic(Mish)activation function.Additionally,the scalable solution for continuous object recognizing and tracking was implemented.This solution is based on the OpenDatacam system,with extended Object Tracking modules that allow for tracking and counting objects that have crossed the custom boundary line.During the study,the methods of the alignment algorithm for finding the trajectory of moving objects were modified.I discovered that the Hungarian algorithm showed better results in tracking small objects than the K–D dimensional tree(k-d tree)matching algorithm used in OpenDataCam.Remarkably,such an algorithm showed better results with the implemented YOLO_AR model due to the lack of False Positives(FP).Therefore,I provided a new tracker module with a Hungarian matching algorithm verified on the Multiple Object Tracking(MOT)benchmark.Furthermore,additional customization parameters for object recognition and tracking results parsing and filtering were added,like boundary angle threshold(BAT)and past frames trajectory prediction(PFTP).Experimental tests confirmed the results of the study on a mobile device.During the experiment,parameters such as the quality of recognition and tracking of moving objects,the PFTP and BAT,and the configuration parameters of the neural network and boundary line model were analyzed.The res
基金the results of the research project funded by the National Natural Science Foundation of China under Grant No.61971176in part by the Applied Basic Research Program of Wuhan City under grand 2017010201010117。
文摘Cell association is a significant research issue in future mobile communication systems due to the unacceptably large computational time of traditional schemes.This article proposes a polynomial-time cell association scheme which not only completes the association in polynomial time but also fits for a generic optimization objective function.On the one hand,traditional cell association as a non-deterministic polynomial(NP)hard problem with a generic utility function is heuristically transformed into a 2-dimensional assignment optimization and solved by a certain polynomial-time algorithm,which significantly saves computational time.On the other hand,the scheme jointly considers utility maximization and load balancing among multiple base stations(BSs)by maintaining an experience pool storing a set of weighting factor values and their corresponding performances.When an association optimization is required,a suitable weighting factor value is taken from the pool to calculate a long square utility matrix and a certain polynomial-time algorithm will be applied for the association.Comparing with several representative schemes,the proposed scheme achieves large system capacity and high fairness within a relatively short computational time.
