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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
Background:Tinnitus is a sound precepted without an external sound stimulus.Its background can be categorised into primary and secondary cases.The secondary cases include pathologies of the external,middle and inner e...Background:Tinnitus is a sound precepted without an external sound stimulus.Its background can be categorised into primary and secondary cases.The secondary cases include pathologies of the external,middle and inner ear.Tinnitus can be objective or subjective;the latter can only identified by the sufferer.Previous research results have shown that tinnitus significantly affects the quality of life and daily functioning.Objectives:To analyse the impact of tinnitus on the daily functioning and the possible influence of demographical data and tinnitus duration on it.Methods:630 patients(265 males and 365 females,25e85 years of age)suffering from primary tinnitus were enrolled.In the Hungarian language,these patients completed the Tinnitus Handicap Inventory(THI)questionnaire and underwent a complete otorhinolaryngological examination.IBM SPSS V24 software was used for data processing;correlation tests,the Mann-Whitney U and Kruskal-Wallis nonparametric tests were used.Results:According to the THI questionnaires outcomes,most patients(62.5%)were presented with a mild handicap.Based on statistical analysis,no significant correlation was observed between the total THI points and the age of the patients,along with the duration and localisation of the symptoms.However,the total THI scores of male and female patients significantly differed,indicating higher THI values in the female group(p=0.00052*).Conclusions:The tinnitus severity was not affected by the duration,localisation of the symptoms and age but by gender,indicating higher values in the case of females.展开更多
In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.
正At the invitation of the Chinese Association for International Understanding (CAFIU), Deputy Speaker of the Hungarian National Assembly and Power Equipments Co., Ltd and Huawei Technologies Co., Ltd, and attended th...正At the invitation of the Chinese Association for International Understanding (CAFIU), Deputy Speaker of the Hungarian National Assembly and Power Equipments Co., Ltd and Huawei Technologies Co., Ltd, and attended the opening ceremony of the 8th China (Shenzhen)展开更多
传统蜂窝网络采用固定的频谱资源分配方式,导致频谱利用率低且无法满足用户高速和高质量通信需求。针对这种局限性提出了一种将分布式天线系统(Distributed Antenna System,DAS)与终端直通(Device to Device,D2D)通信技术相结合的策略...传统蜂窝网络采用固定的频谱资源分配方式,导致频谱利用率低且无法满足用户高速和高质量通信需求。针对这种局限性提出了一种将分布式天线系统(Distributed Antenna System,DAS)与终端直通(Device to Device,D2D)通信技术相结合的策略。首先,该方案提出协同上下行链路(Uplink and Downlink Collaboration,UADC)的资源分配算法,并构建了以最大化系统总效率为目标的非线性规划问题。然后,将该问题分为最佳功率选择和信道分配2个子问题,同时利用匈牙利算法为D2D对选择最佳信道。最后,在MATLAB仿真平台进行实验。仿真结果表明,相比于仅复用上行链路的和仅使用DAS系统的方法,所提方案的频谱效率更高。展开更多
基金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.
文摘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.
文摘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.
文摘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.
基金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.
文摘Background:Tinnitus is a sound precepted without an external sound stimulus.Its background can be categorised into primary and secondary cases.The secondary cases include pathologies of the external,middle and inner ear.Tinnitus can be objective or subjective;the latter can only identified by the sufferer.Previous research results have shown that tinnitus significantly affects the quality of life and daily functioning.Objectives:To analyse the impact of tinnitus on the daily functioning and the possible influence of demographical data and tinnitus duration on it.Methods:630 patients(265 males and 365 females,25e85 years of age)suffering from primary tinnitus were enrolled.In the Hungarian language,these patients completed the Tinnitus Handicap Inventory(THI)questionnaire and underwent a complete otorhinolaryngological examination.IBM SPSS V24 software was used for data processing;correlation tests,the Mann-Whitney U and Kruskal-Wallis nonparametric tests were used.Results:According to the THI questionnaires outcomes,most patients(62.5%)were presented with a mild handicap.Based on statistical analysis,no significant correlation was observed between the total THI points and the age of the patients,along with the duration and localisation of the symptoms.However,the total THI scores of male and female patients significantly differed,indicating higher THI values in the female group(p=0.00052*).Conclusions:The tinnitus severity was not affected by the duration,localisation of the symptoms and age but by gender,indicating higher values in the case of females.
文摘In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.
文摘正At the invitation of the Chinese Association for International Understanding (CAFIU), Deputy Speaker of the Hungarian National Assembly and Power Equipments Co., Ltd and Huawei Technologies Co., Ltd, and attended the opening ceremony of the 8th China (Shenzhen)
文摘传统蜂窝网络采用固定的频谱资源分配方式,导致频谱利用率低且无法满足用户高速和高质量通信需求。针对这种局限性提出了一种将分布式天线系统(Distributed Antenna System,DAS)与终端直通(Device to Device,D2D)通信技术相结合的策略。首先,该方案提出协同上下行链路(Uplink and Downlink Collaboration,UADC)的资源分配算法,并构建了以最大化系统总效率为目标的非线性规划问题。然后,将该问题分为最佳功率选择和信道分配2个子问题,同时利用匈牙利算法为D2D对选择最佳信道。最后,在MATLAB仿真平台进行实验。仿真结果表明,相比于仅复用上行链路的和仅使用DAS系统的方法,所提方案的频谱效率更高。