Zuordnungsproblem auf Hypergraphen

Diese Arbeit beschäftigt sich mit dem Hypergraph Assignment Problem (Abkürzung "HAP", dt.: Zuordnungsproblem auf Hypergraphen), einem Mengenzerlegungsproblem auf einem speziellen Typ von Hypergraphen. Das HAP verallgemeinert das Zuordnungsproblem von bipartiten Graphen auf eine Struktur, die wir bipartite Hypergraphen nennen, und ist durch eine Anwendung in der Umlaufplanung im Schienenverkehr motiviert. Die Hauptresultate betreffen die Komplexität, polyedrische Ergebnisse, die Analyse von Zufallsinstanzen sowie primale Methoden für das HAP. Wir beweisen, dass das HAP NP-schwer und APX-schwer ist, sogar wenn wir uns auf kleine Hyperkantengrößen und Hypergraphen mit einer speziellen, partitionierten Struktur beschränken. Darüber hinaus untersuchen wir die Komplexität der Mengenpackungs- sowie Mengenüberdeckungsrelaxierung und geben für bestimmte Fälle Approximations- und exakte Algorithmen mit einer polynomiellen Laufzeit an. Für das Polytop des Zuordnungsproblems ist eine vollständige lineare Beschreibung bekannt. Wir untersuchen daher auch das HAP-Polytop. Dafür ist die Anzahl der Facettenungleichungen schon für sehr kleine Problemgrößen sehr groß. Wir beschreiben eine Methode zur Aufteilung der Ungleichungen in Äquivalenzklassen, die ohne die Verwendung von Normalformen auskommt. Die Facetten in jeder Klasse können durch Symmetrien ineinander überführt werden. Es genügt, einen Repräsentanten aus jeder Klasse anzugeben, um ein vollständiges Bild der Polytopstruktur zu erhalten. Wir beschreiben den Algorithmus "HUHFA", der diese Klassifikation nicht nur für das HAP, sondern für beliebige kombinatorische Optimierungsprobleme, die Symmetrien enthalten, durchführt. Die größtmögliche HAP-Instanz, für die wir die vollständige lineare Beschreibung berechnen konnten, hat 14049 Facetten, die in 30 Symmetrieklassen aufgeteilt werden können. Wir können 16 dieser Klassen kombinatorisch interpretieren. Dafür verallgemeinern wir Odd-Set-Ungleichungen für das Matchingproblem unter Verwendung von Cliquen. Die Ungleichungen, die wir erhalten, sind gültig für Mengenpackungsprobleme in beliebigen Hypergraphen und haben eine klare kombinatorische Bedeutung. Die Analyse von Zufallsinstanzen erlaubt einen besseren Einblick in die Struktur von Hyperzuordnungen. Eine solche ausführliche Analyse wurde in der Literatur theoretisch und praktisch bereits für das Zuordnungsproblem durchgeführt. Als eine Verallgemeinerung dieser Ergebnisse für das HAP beweisen wir Schranken für den Erwartungswert einer Hyperzuordnung mit minimalen Kosten, die genau die Hälfte der maximal möglichen Anzahl an Hyperkanten, die keine Kanten sind, benutzt. In einem sog. vollständigen partitionierten Hypergraphen G2,2n mit Hyperkantenkosten, die durch unabhängig identisch exponentiell verteilte Zufallsvariablen mit Erwartungswert 1 bestimmt sind, liegt dieser Wert zwischen 0.3718 und 1.8310, wenn die Knotenanzahl gegen unendlich strebt. Schließlich entwickeln wir eine exakte kombinatorische Lösungsmethode für das HAP, die drei Ansätze kombiniert: Eine Nachbarschaftssuche mit Nachbarschaften exponentieller Größe, die Composite-Columns-Methode für das Mengenzerlegungsproblem sowie den Netzwerksimplexalgorithmus.This thesis deals with the hypergraph assignment problem (HAP), a set partitioning problem in a special type of hypergraph. The HAP generalizes the assignment problem from bipartite graphs to what we call bipartite hypergraphs, and is motivated by applications in railway vehicle rotation planning. The main contributions of this thesis concern complexity, polyhedral results, analyses of random instances, and primal methods for the HAP. We prove that the HAP is NP-hard and APX-hard even for small hyperedge sizes and hypergraphs with a special partitioned structure. We also study the complexity of the set packing and covering relaxations of the HAP, and present for certain cases polynomial exact or approximation algorithms. A complete linear description is known for the assignment problem. We therefore also study the HAP polytope. There, we have a huge number of facet-defining inequalities already for a very small problem size. We describe a method for dividing the inequalities into equivalence classes without resorting to a normal form. Within each class, facets are related by certain symmetries and it is sufficient to list one representative of each class to give a complete picture of the structural properties of the polytope. We propose the algorithm "HUHFA" for the classification that is applicable not only to the HAP but combinatorial optimization problems involving symmetries in general. In the largest possible HAP instance for which we could calculate the complete linear description, we have 14049 facets, which can be divided into 30 symmetry classes. We can combinatorially interpret 16 of these classes. This is possible by employing cliques to generalize the odd set inequalities for the matching problem. The resulting inequalities are valid for the polytope associated with the set packing problem in arbitrary hypergraphs and have a clear combinatorial meaning. An analysis of random instances provides a better insight into the structure of hyperassignments. Previous work has extensively analyzed random instances for the assignment problem theoretically and practically. As a generalization of these results for the HAP, we prove bounds on the expected value of a minimum cost hyperassignment that uses half of the maximum possible number of hyperedges that are not edges. In a certain complete partitioned hypergraph G2,2n with i. i. d. exponential random variables with mean 1 as hyperedge costs it lies between 0.3718 and 1.8310 if the vertex number tends to infinity. Finally, we develop an exact combinatorial solution algorithm for the HAP that combines three methods: A very large-scale neighborhood search, the composite columns method for the set partitioning problem, and the network simplex algorithm

a

Evaluation of an image-based algorithm for quantitativ

Periodic and Quasi-Periodic Compensation Strategies of Extreme Outages caused by Polarization Mode Dispersion and Amplifier Noise

Effect of birefringent disorder on the Bit Error Rate (BER) in an optical fiber telecommunication system subject to amplifier noise may lead to extreme outages, related to anomalously large values of BER. We analyze the Probability Distribution Function (PDF) of BER for various strategies of Polarization Mode Dispersion (PMD) compensation. A compensation method is proposed that is capable of more efficient extreme outages suppression, which leads to substantial improvement of the fiber system performance.Comment: 3 pages, 1 figure, Submitted to IEEE Photonics Letter

Disentangled Latent Speech Representation for Automatic Pathological Intelligibility Assessment

Speech intelligibility assessment plays an important role in the therapy of patients suffering from pathological speech disorders. Automatic and objective measures are desirable to assist therapists in their traditionally subjective and labor-intensive assessments. In this work, we investigate a novel approach for obtaining such a measure using the divergence in disentangled latent speech representations of a parallel utterance pair, obtained from a healthy reference and a pathological speaker. Experiments on an English database of Cerebral Palsy patients, using all available utterances per speaker, show high and significant correlation values (R = -0.9) with subjective intelligibility measures, while having only minimal deviation (+-0.01) across four different reference speaker pairs. We also demonstrate the robustness of the proposed method (R = -0.89 deviating +-0.02 over 1000 iterations) by considering a significantly smaller amount of utterances per speaker. Our results are among the first to show that disentangled speech representations can be used for automatic pathological speech intelligibility assessment, resulting in a reference speaker pair invariant method, applicable in scenarios with only few utterances available.Comment: Submitted to INTERSPEECH202

Управление подбором менеджеров среднего звена в организации (на материале деятельности ООО "ИНКОМ АВТО")

Цель исследования - разработать рекомендации по организации подбора менеджеров среднего звена в ООО "ИНКОМ АВТО". Объект - управление персоналом в ООО "ИНКОМ АВТО". В результате исследования были рассмотрены теоретические основы организации подбора и отбора персонала, рассмотрен подбор персонала как функция управления и область влияния на деятельность компании.The purpose of the research is to develop recommendations on the organization of selection of mid-level managers in INCOM AUTO LLC. Object - personnel management in OOO INCOM AUTO. As a result of the research, the theoretical foundations of the organization of recruitment and selection of personnel were considered, the selection of personnel as a function of management and the scope of influence on the company's activities were considered

Early Miocene tectono-sedimentary shift in the eastern North Alpine Foreland Basin and its relation to changes in tectonic style in the Eastern Alps

A striking difference along the Alpine Orogen is the style of collisional tectonics during the Oligo-Miocene, with the onset of escape tectonics in the Eastern Alps (Fig. 1A). The indentation of the Adriatic Plate into the Eastern Alpine Orogen resulted in the formation of conjugate dextral and sinistral strike-slip faults in the vicinity of the Tauern Window. Moreover, major changes occurred in the foreland of the Eastern and Southern Alps in the Early Miocene, with the cessation of the northern Alpine front propagation and the onset of thrusting along the Southern Alpine Front. In this study, we present new results from structural, stratigraphic and subsidence analyses of the eastern North Alpine Foreland Basin (NAFB; Fig. 1B) as part of the “Mountain Building in 4 Dimensions” project, German branch of the European AlpArray initiative, which aims at better understanding the deep crustal-mantle structures of the Alpine Orogen and their relation to surface processes. Our results show a first phase of onset of foreland sedimentation in the eastern NAFB between c. 33-28 Ma, followed by a strong tectonic-driven subsidence between c. 28-25 Ma ending by a phase of erosion and the formation of a basin-wide Northern Slope Unconformity (NSU; Fig. 1C & 1D). During this time period, the rift-related Mesozoic normal faults of the European platform were reactivated and are capped by the NSU (Fig. 1D). We interpret this phase as an increase in the flexure of the subducting European Plate under the growing Alpine Orogen. Between 25-19 Ma, the eastern NAFB remained in a deep-marine, underfilled state with a gently increase in subsidence. A major shift took place around 19-17 Ma with strong tectonic-driven uplift, ranging from 200 m (absolute minimum) to 1200 m depending on uncertainties on paleo-water depths, and rapid sedimentary infill of the basin (Fig. 1C & 1D). We discuss the possible causes for this major tectono-sedimentary shift in the eastern NAFB in relation to contemporaneous changes in collisional tectonics within the Eastern and Southern Alps, and with a potential Early Miocene slab break-off event beneath the Eastern Alps

A Comparison between Two Heterodyne Light Sources Using Different Electro-Optic Modulators for Optical Temperature Measurements at Visible Wavelengths

In this paper we have successfully demonstrated a z-propagating Zn-indiffused lithium niobate electro-optic modulator used for optical heterodyne interferometry. Compared to a commercial buck-type electro-optic modulator, the proposed waveguide-type modulator has a lower driving voltage and smaller phase variation while measuring visible wavelengths of 532 nm and 632.8 nm. We also demonstrate an optical temperature measurement system using a homemade modulator. The results show that the measurement sensitivities are almost the same values of 25 deg/°C for both the homemade and the buck-type modulators for a sensing light with a wavelength of 632.8 nm. Because photorefractive impacts are essential in the buck-type modulator at a wavelength of 532 nm, it is difficult to obtain reliable phase measurements, whereas the stable phase operation of the homemade one allows the measurement sensitivity to be improved up to 30 deg/°C with the best measurement resolution at about 0.07 °C for 532 nm

Automatic DGD and GVD compensation at 640 Gb/s based on scalar radio-frequency spectrum measurement

We demonstrate what we believe to be the first real-time impairment-cancellation system for groupvelocity dispersion (GVD) and differential group delay (DGD) for a 640 Gb/s single-channel signal. Simultaneous compensation of two independent parameters is demonstrated by feedback control of separate GVD and DGD compensators using an impairment monitor based on an integrated all-optical radio-frequency (RF) spectrum analyzer.We show that low-bandwidth measurement of only a single tone in the RF spectrum is sufficient for automatic compensation for multiple degrees of freedom using a multivariate optimization scheme

Accuracies of the synthesized monochromatic CT numbers and effective atomic numbers obtained with a rapid kVp switching dual energy CT scanner

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/98738/1/MPH002222.pd