Emergency Money in Hungarian Pharmacies from World War l to the Hungarian Soviet Republic

All of the existing emergency notes of pharmacy in Hungary between 1914 and 1919 were collected, presented and studied. The concept of emergency money, the causes and circumstances leading to its development were defined. The historical backgrounds of these reasons were studied and presented in chronology order. The various issued emergency money of pharmacy was classified and demonstrated in pictures. When an economic crisis turns up in the life of mankind, special solutions will occur. World War I breaking out a hundred years ago and the Hungarian Soviet Republic created such a situation in Hungary. The official currency was replaced with a new one, the amount of which could not cover the daily purchase of people. The lack of change led to print numerous emergency notes in different fields of life. In this study, all of the so-far discovered pharmaceutical emergency money was collected and presented systematically. The paper is considered to be unique since in the field of the history of pharmacy similar ones have not been born recently. The released notes provide an instantaneous picture of the industry （art, typography, chemical industry etc.） of the given country as well. These pieces of paper are regarded to be valuable treasure among numismatics.

Study on the Hungarian algorithm for the maximum likelihood data association problem

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.

Improved Hungarian algorithm for assignment problems of serial-parallel systems

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.

Hungarian算法的推广

分析了非平衡分派问题的线性规划模型的性质和特点，在此基础上，将Hugarian算法推广到非平衡分派问题，利用该算法，可以直接求出非平衡分派问题．

Competition assignment problem algorithm based on Hungarian method

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.

Multi-Objective Optimization of Time-Cost-Quality Using Hungarian Algorithm

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.

Adaptive subcarrier allocation for MIMO-OFDMA wireless systems using Hungarian method

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.

Tinnitus characteristics and associated variables on Tinnitus Handicap Inventory among a Hungarian population

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.

Effect of special Hungarian probiotic kefir on faecal microflora

AIM： To investigate the effect of a four-week consumption of a special Hungarian probiotic agent （Biofir） on the faecal microflora in human healthy subjects.METHODS： The effect of Biofir with 10^6/cm^3 initial germs on the faecal microflora was studied in 120 healthy volunteers （71 females, 49 males）. The traditional Russian type kefir was used as control. The various germ groups and pH values were determined in wk 2, 4 and 6.RESULTS： The number of all microbes increased during the 4-week probiotic treatment. The number of microbes increased 4,3-fold in the control group and 6.8-fold in Biofir-treated group. The probiotic kefir caused multiplication of the probiotic flora, meanwhile the undesired bacteria multiplied in the control group. No significant change of pH values of the faeces was found in both groups.CONCLUSION： The Hungarian probiotic keflr （Biofir） is capable of promoting multiplication of probiotic bacterial flora in the large bowel.

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.

The Hungarian Community in Ferrara at the Estes Court （15-16th Centuries）

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

Enhance Under standing and Cooperation to Builda Bridge of China-Hungary Friendship——Hungarian World Bridge FoundationDelegation Visited China

正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)

激光雷达和相机的决策级融合目标检测方法

【目的】激光雷达与相机这两类传感器检测数据格式不统一、分辨率不同,且数据级和特征级的融合计算复杂度高,故提出一种决策级的目标融合检测方法。【方法】对激光雷达与相机的安装位置进行联合标定,实现这两类传感器检测结果的坐标系转换;利用匈牙利算法将激光雷达点云检测目标框和相机图像检测目标框进行匹配,设定目标框重合面积阈值,检测获得目标物的位置、类型等。【结果】实车测试结果表明,根据检测目标检测框长宽比选取不同交并比阈值的方法使得车辆和行人的目标识别准确率分别提升了3.3%和5.3%。利用公开数据集KITTI对所提融合方法进行验证,结果表明,在3种不同难度等级场景下,所提融合方法的检测精度分别达到了75.42%、69.71%、63.71%,与现有常用的融合方法相比,检测精度均有所提升。【结论】这两类传感器的检测目标框重合面积阈值对决策级融合检测结果影响较大,根据检测目标检测框长宽比选取不同阈值可有效提升车辆和行人的目标识别准确率。决策级融合方法能准确匹配雷达和相机的检测目标,有效提升目标检测精度。

协同上下行链路的频谱资源分配方案

传统蜂窝网络采用固定的频谱资源分配方式,导致频谱利用率低且无法满足用户高速和高质量通信需求。针对这种局限性提出了一种将分布式天线系统(Distributed Antenna System,DAS)与终端直通(Device to Device,D2D)通信技术相结合的策略。首先,该方案提出协同上下行链路(Uplink and Downlink Collaboration,UADC)的资源分配算法,并构建了以最大化系统总效率为目标的非线性规划问题。然后,将该问题分为最佳功率选择和信道分配2个子问题,同时利用匈牙利算法为D2D对选择最佳信道。最后,在MATLAB仿真平台进行实验。仿真结果表明,相比于仅复用上行链路的和仅使用DAS系统的方法,所提方案的频谱效率更高。

利用改进匈牙利算法求解旅行商问题

针对传统的匈牙利算法在求解旅行商问题(travelling salesman problem,TSP)时会导致多回路闭合的问题,提出了破环机制,设计了破环匈牙利算法。通过采用分配问题的描述方法对旅行商问题进行建模,并建立二者之间的转换关系,论证了TSP可行解的充分必要条件是对应分配问题的可行解与辅助边结合后仅包含一个环路,对6个标准旅行商进行测试和对比分析,验证算法的有效性。实验结果表明:在不同的数据集中,改进匈牙利算法能有效求出TSP问题的解。

基于视觉的交通场景目标检测与跟踪技术研究

针对通用目标检测算法在交通场景下检测多目标时存在的小目标漏检和误检问题,提出了一种适用于交通场景下的目标检测与跟踪算法。基于K-means++聚类算法计算出适合交通场景下目标检测的锚定框(Anchor Box)和深度可分离卷积的思想优化目标检测算法。其次,利用匈牙利匹配将卡尔曼滤波的预测值和目标检测的实际值相关联匹配,以实现目标跟踪。实验结果证明,改进后的目标检测与跟踪算法较原始算法在mAP方面提升了2.3%,达到了99.13%;速度提升了20%,达到了30帧/秒,对交通场景下的特定目标均实现了准确检测跟踪,保持了较好的实时性。

基于红外图像处理的移动目标识别跟踪算法

为解决红外热像仪在战场环境多变、背景复杂、目标运动速度过快等情况下难以对目标进行识别与跟踪的问题,本文提出了一种基于红外图像处理的移动目标识别跟踪算法。该算法主要分为移动目标的检测和跟踪两部分。首先采用高斯背景建模方法来提取运动目标,其次应用Kalman滤波来进行运动目标的定位与跟踪,最后通过匈牙利算法来判定目标点的归属。实验结果表明,在MOT基准挑战中的评价指标上,本文算法相比于Sort跟踪器将MOTA提升了1.4%,MT提升了11.9%,ML降低了6.5%,IDs降低了33.3%,FN降低了13.6%,提高了跟踪准确性,成功实现了对多个移动目标的跟踪。本文算法在军事领域具有广泛的应用前景。