In the second half of the 9th century,the Hungarians migrated to the plains of the Eastern Europe from the steppes of the Inner Asia.The earliest records about the Hungarians by the Western Europeans were mainly centr...In the second half of the 9th century,the Hungarians migrated to the plains of the Eastern Europe from the steppes of the Inner Asia.The earliest records about the Hungarians by the Western Europeans were mainly centralized in theFrankish sourceswhich representatively reflected the Western Europeans'initial cognition and the position of"alien race"about the Hungarians.In response to that position,the Hungarians havealso strengthened their nomadic characteristics to show intentionally or unintentionally that they are different from the Europeans,especially the Western Europeans.The position of "alien race"about the Hungarians has profoundly affected the development of the relationship between the Western Europe and Hungary since the Middle Ages in Europe,and finally prompted the"Christian Shield"Hungary to become the dividing line between the Eastern and the Western civilizations.展开更多
China is the worlds secondlargest consumer and largest importer of beef.With the promotion of the Belt and Road Initiative and the continuous optimization of the business environment under the framework of China-CEEC ...China is the worlds secondlargest consumer and largest importer of beef.With the promotion of the Belt and Road Initiative and the continuous optimization of the business environment under the framework of China-CEEC cooperation,European beef exporters have gradually opened the Chinese market.As a major agricultural country in Europe,Hungary's working with China in beef export and import is not only in line with its policy of"Eastern opening"and reducing its dependence on the Western European market,but also meets the demand for building astrong and resilient industrial chain amid global uncertainty,and helps promote the high-quality development of its agricultural trade.展开更多
The long-term goal of my research has been to systematize and compare by musical criteria the folk songs of Turkic groups and ethnicities living around them. Here I rarely touch on instrumental folk music, the reperto...The long-term goal of my research has been to systematize and compare by musical criteria the folk songs of Turkic groups and ethnicities living around them. Here I rarely touch on instrumental folk music, the repertoire of professional or semi-professional performers, the most recent strata, seldom or just occasionally discuss art music and the cultural, social and anthropological implications of music are only sporadically considered, too. There are close connections between the languages of Turkic groups but their musical stocks are fundamentally different. Actually, that is not surprising, because these people are, at least in part, Turkified, and through their substrata （that is people absorbed by them） they are in genetic and cultural relations with several non-Turkic peoples. My research therefore has repercussions; apart from the Turkic-speaking peoples tied by culture, language and history, upon their neighbors and partly absorbed other peoples, creating the foundation for an even broader future comparative ethnomusicological research of Eurasian groups. This paper is aimed to provide a very short summary about the findings of my field researches into the folk music of different Turkic-speaking people between 1987 and 2015. I introduce the sources, the collecting work and the methods of processing and analyzing the songs. 1 also give an analytical introduction to the folksong of Anatolian Turks, Azeris, Turkmens, Uzbeks （and Tajiks）, Karachay-Balkars, Kazakhs, Kyrgyzs, a Sufi Turkish community in Thrace and the area of the Volga-Kama-Belaya region. Finally comes a conclusion, a musical map and a list of tasks waiting for us.展开更多
This paper, that has been introduced at the annual meeting of the Renaissance Society of America （Washington, March 22, 2012）, is a little part of a wider research about migration and movements of people between Wes...This paper, that has been introduced at the annual meeting of the Renaissance Society of America （Washington, March 22, 2012）, is a little part of a wider research about migration and movements of people between Western and Eastern Europe （and vice versa） that, started one year ago, is still in progress. Despite a common thought that had considered, still in 15th century, Hungarians as unculturished and violent people, the town of Ferrara, ruled by the Estes, had welcomed many of them during the 15-16th centuries. They were, above all, and as the sources testify, literati and students. This paper tries to show and analyze the cultural reasons and the background that have determined Hungarians＇ presence in Ferrara during the Renaissance, with the consciousness that if many sources have been studied, many others must be展开更多
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 females,m...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.展开更多
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.展开更多
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.展开更多
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 results showed an increased tracking accuracy with the proposed methods by 50%.The study results confirmed the relevance of the topic and the effectiveness of the implemented methods and tools.展开更多
With the development of remote sensing technology and computing science,remote sensing data present typical big data characteristics.The rapid development of remote sensing big data has brought a large number of data ...With the development of remote sensing technology and computing science,remote sensing data present typical big data characteristics.The rapid development of remote sensing big data has brought a large number of data processing tasks,which bring huge challenges to computing.Distributed computing is the primary means to process remote sensing big data,and task scheduling plays a key role in this process.This study analyzes the characteristics of batch processing of remote sensing big data.This paper uses the Hungarian algorithm as a basis for proposing a novel strategy for task assignment optimization of remote sensing big data batch workflow,called optimal sequence dynamic assignment algorithm,which is applicable to heterogeneously distributed computing environments.This strategy has two core contents:the improved Hungarian algorithm model and the multi-level optimal assignment task queue mechanism.Moreover,the strategy solves the dependency,mismatch,and computational resource idleness problems in the optimal scheduling of remote sensing batch processing tasks.The proposed strategy likewise effectively improves data processing efficiency without increasing computer hardware resources and without optimizing the computational algorithm.We experimented with the aerosol optical depth retrieval algorithm workflow using this strategy.Compared with the processing before optimization,the makespan of the proposed method was shortened by at least 20%.Compared with popular scheduling algorithm,the proposed method has evident competitiveness in acceleration effect and large-scale task scheduling.展开更多
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.展开更多
基金the National Social Science Fund of China,“A study on the System of‘Megye'and the Pattern of the National Governance in Hungary in the 1lth-13thCenturies”(No.20CSS005).
文摘In the second half of the 9th century,the Hungarians migrated to the plains of the Eastern Europe from the steppes of the Inner Asia.The earliest records about the Hungarians by the Western Europeans were mainly centralized in theFrankish sourceswhich representatively reflected the Western Europeans'initial cognition and the position of"alien race"about the Hungarians.In response to that position,the Hungarians havealso strengthened their nomadic characteristics to show intentionally or unintentionally that they are different from the Europeans,especially the Western Europeans.The position of "alien race"about the Hungarians has profoundly affected the development of the relationship between the Western Europe and Hungary since the Middle Ages in Europe,and finally prompted the"Christian Shield"Hungary to become the dividing line between the Eastern and the Western civilizations.
文摘China is the worlds secondlargest consumer and largest importer of beef.With the promotion of the Belt and Road Initiative and the continuous optimization of the business environment under the framework of China-CEEC cooperation,European beef exporters have gradually opened the Chinese market.As a major agricultural country in Europe,Hungary's working with China in beef export and import is not only in line with its policy of"Eastern opening"and reducing its dependence on the Western European market,but also meets the demand for building astrong and resilient industrial chain amid global uncertainty,and helps promote the high-quality development of its agricultural trade.
文摘属性散射中心是合成孔径雷达(Synthetic Aperture Radar,SAR)图像的一个重要特征。该文提出了一种属性散射中心匹配方法并将其运用于SAR目标识别中。该方法首先基于属性散射中心模型提取待识别SAR图像和模板SAR图像的属性散射中心,进而采用Hungarian算法实现散射中心的匹配。在建立的匹配关系的基础上,设计了一种稳健的散射中心匹配度度量方法计算待识别散射中心与各类模板散射中心的匹配度。该匹配度准则充分考虑了单个散射中心强弱、匹配对强弱以及漏警、虚警带来的影响,对于散射中心集的匹配度的评价更为全面。基于Moving and Stationary Target Acquisition and Recognition(MSTAR)数据集的实验验证了方法的有效性。
文摘The long-term goal of my research has been to systematize and compare by musical criteria the folk songs of Turkic groups and ethnicities living around them. Here I rarely touch on instrumental folk music, the repertoire of professional or semi-professional performers, the most recent strata, seldom or just occasionally discuss art music and the cultural, social and anthropological implications of music are only sporadically considered, too. There are close connections between the languages of Turkic groups but their musical stocks are fundamentally different. Actually, that is not surprising, because these people are, at least in part, Turkified, and through their substrata （that is people absorbed by them） they are in genetic and cultural relations with several non-Turkic peoples. My research therefore has repercussions; apart from the Turkic-speaking peoples tied by culture, language and history, upon their neighbors and partly absorbed other peoples, creating the foundation for an even broader future comparative ethnomusicological research of Eurasian groups. This paper is aimed to provide a very short summary about the findings of my field researches into the folk music of different Turkic-speaking people between 1987 and 2015. I introduce the sources, the collecting work and the methods of processing and analyzing the songs. 1 also give an analytical introduction to the folksong of Anatolian Turks, Azeris, Turkmens, Uzbeks （and Tajiks）, Karachay-Balkars, Kazakhs, Kyrgyzs, a Sufi Turkish community in Thrace and the area of the Volga-Kama-Belaya region. Finally comes a conclusion, a musical map and a list of tasks waiting for us.
文摘This paper, that has been introduced at the annual meeting of the Renaissance Society of America （Washington, March 22, 2012）, is a little part of a wider research about migration and movements of people between Western and Eastern Europe （and vice versa） that, started one year ago, is still in progress. Despite a common thought that had considered, still in 15th century, Hungarians as unculturished and violent people, the town of Ferrara, ruled by the Estes, had welcomed many of them during the 15-16th centuries. They were, above all, and as the sources testify, literati and students. This paper tries to show and analyze the cultural reasons and the background that have determined Hungarians＇ presence in Ferrara during the Renaissance, with the consciousness that if many sources have been studied, many others must be
基金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.
基金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.
文摘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.
文摘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 results showed an increased tracking accuracy with the proposed methods by 50%.The study results confirmed the relevance of the topic and the effectiveness of the implemented methods and tools.
基金supported by the National Natural Science Foundation of China(NSFC)under grant No.[42275147].
文摘With the development of remote sensing technology and computing science,remote sensing data present typical big data characteristics.The rapid development of remote sensing big data has brought a large number of data processing tasks,which bring huge challenges to computing.Distributed computing is the primary means to process remote sensing big data,and task scheduling plays a key role in this process.This study analyzes the characteristics of batch processing of remote sensing big data.This paper uses the Hungarian algorithm as a basis for proposing a novel strategy for task assignment optimization of remote sensing big data batch workflow,called optimal sequence dynamic assignment algorithm,which is applicable to heterogeneously distributed computing environments.This strategy has two core contents:the improved Hungarian algorithm model and the multi-level optimal assignment task queue mechanism.Moreover,the strategy solves the dependency,mismatch,and computational resource idleness problems in the optimal scheduling of remote sensing batch processing tasks.The proposed strategy likewise effectively improves data processing efficiency without increasing computer hardware resources and without optimizing the computational algorithm.We experimented with the aerosol optical depth retrieval algorithm workflow using this strategy.Compared with the processing before optimization,the makespan of the proposed method was shortened by at least 20%.Compared with popular scheduling algorithm,the proposed method has evident competitiveness in acceleration effect and large-scale task scheduling.
文摘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.
