Tandem-MAG-hitsauksen soveltuvuus isojen levylakanoiden valmistamiseen

Diplomityön tavoitteena oli selvittää tandem-MAG-hitsausmenetelmän soveltuvuus isojen levylakanoiden valmistamiseen. Päätavoitteena oli selvittää suurimmat saavutettavat hitsausnopeudet sekä railonvalmistukselle asetettavat vaatimukset kahdella laivanrakennusteräksellä. Tutkimuksessa käytettiin omia hitsauskokeita ja liitokset testattiin luokitusseurojen vaatimusten mukaisesti. Selvitettiin myös syntyvät hitsausmuodonmuutokset sekä edut ja rajoitukset verrattuna laserhitsaukseen. Lisäksi laadittiin ei-synergiselle pulssihitsauslaitteistolle suuntaa-antava synergiakäyrä tätä sovellusta varten hitsauskokeiden perusteella. Tandem-MAG-hitsaus osoittautui erittäin kilpailukykyiseksi hitsausmenetelmäksi sovelluksessa. Magneettisen puhalluksen havaittiin olevan merkittävä häiriötekijä tällä menetelmällä hitsattaessa.

Sherali-Adams Relaxations and Indistinguishability in Counting Logics

Two graphs with adjacency matrices $\mathbf{A}$ and $\mathbf{B}$ are isomorphic if there exists a permutation matrix $\mathbf{P}$ for which the identity $\mathbf{P}^{\mathrm{T}} \mathbf{A} \mathbf{P} = \mathbf{B}$ holds. Multiplying through by $\mathbf{P}$ and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorphism. We show that the levels of the Sherali--Adams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a well-known color-refinement heuristic for graph isomorphism called the Weisfeiler--Lehman algorithm, or, equivalently, with the levels of indistinguishability in a logic with counting quantifiers and a bounded number of variables. This tight connection has quite striking consequences. For example, it follows immediately from a deep result of Grohe in the context of logics with counting quantifiers that a fixed number of levels of SA suffice to determine isomorphism of planar and minor-free graphs. We also offer applications in both finite model theory and polyhedral combinatorics. First, we show that certain properties of graphs, such as that of having a flow circulation of a prescribed value, are definable in the infinitary logic with counting with a bounded number of variables. Second, we exploit a lower bound construction due to Cai, Fürer, and Immerman in the context of counting logics to give simple explicit instances that show that the SA relaxations of the vertex-cover and cut polytopes do not reach their integer hulls for up to $\Omega(n)$ levels, where $n$ is the number of vertices in the graph.

Laajakaistaverkon topologian visualisointi

Viimeisten vuosien aikana laajakaistaoperaattoreiden laajakaistaverkot ovat nopeiden ja kiinteähintaisten laajakaistaliittymien johdosta kasvaneet suuriksi kokonaisuuksiksi. Kokonaisuuksia hallitaan erilaisilla verkonhallintatyökaluilla. Verkonhallintatyökalut sisältävät suuren määrän eri tasoista tietoa laitteista ja laitteiden välisistä suhteista. Kokonaisuuksien hahmottaminen ilman tiedoista rakennettua kuvaa on vaikeaa ja hidasta. Laajakaistaverkon topologian visualisoinnissa muodostetaan kuva laitteista ja niiden välisistä suhteista. Visualisoitua kuvaa voidaan käyttää osana verkonhallintatyökalua, jolloin käyttäjälle muodostuu nopeasti näkymä verkon laitteista ja rakenteesta eli topologiasta. Visualisoinnissa kuvan piirto-ongelma täytyy muuttaa graafin piirto-ongelmaksi. Graafin piirto-ongelmassa verkon rakennetta käsitellään graafina, joka mahdollistaa kuvan muodostamisen automaattisia piirtomenetelmiä hyväksikäyttäen. Halutunlainen ulkoasu kuvalle muodostetaan automaattisilla piirtomenetelmillä, joilla laitteiden ja laitteiden välisten suhteiden esitystapoja voidaan muuttaa. Esitystavoilla voidaan muuttaa esimerkiksi laitteiden muotoa, väriä ja kokoa. Esitystapojen lisäksi piirtomenetelmien tärkein tehtävä on laskea laitteiden sijaintien koordinaattien arvot, jotka loppujen lopuksi määräävät koko kuvan rakenteen. Koordinaattien arvot lasketaan piirtoalgoritmeilla, joista voimiin perustuvat algoritmit sopivat parhaiten laajakaistaverkkojen laitteiden sijaintien laskemiseen. Tämän diplomityön käytännön työssä toteutettiin laajakaistaverkon topologian visualisointityökalu.

Lossless Compression Methods for Multispectral Images: Development and Comparisons

Main purpose of this thesis is to introduce a new lossless compression algorithm for multispectral images. Proposed algorithm is based on reducing the band ordering problem to the problem of finding a minimum spanning tree in a weighted directed graph, where set of the graph vertices corresponds to multispectral image bands and the arcs’ weights have been computed using a newly invented adaptive linear prediction model. The adaptive prediction model is an extended unification of 2–and 4–neighbour pixel context linear prediction schemes. The algorithm provides individual prediction of each image band using the optimal prediction scheme, defined by the adaptive prediction model and the optimal predicting band suggested by minimum spanning tree. Its efficiency has been compared with respect to the best lossless compression algorithms for multispectral images. Three recently invented algorithms have been considered. Numerical results produced by these algorithms allow concluding that adaptive prediction based algorithm is the best one for lossless compression of multispectral images. Real multispectral data captured from an airplane have been used for the testing.

Social network extraction and analysis based on multimodal dyadic interaction

Social interactions are a very important component in people"s lives. Social network analysis has become a common technique used to model and quantify the properties of social interactions. In this paper, we propose an integrated framework to explore the characteristics of a social network extracted from multimodal dyadic interactions. For our study, we used a set of videos belonging to New York Times" Blogging Heads opinion blog. The Social Network is represented as an oriented graph, whose directed links are determined by the Influence Model. The links" weights are a measure of the"influence" a person has over the other. The states of the Influence Model encode automatically extracted audio/visual features from our videos using state-of-the art algorithms. Our results are reported in terms of accuracy of audio/visual data fusion for speaker segmentation and centrality measures used to characterize the extracted social network.

Intrahemispheric cortico-cortical connections of the human auditory cortex.

The human auditory cortex comprises the supratemporal plane and large parts of the temporal and parietal convexities. We have investigated the relevant intrahemispheric cortico-cortical connections using in vivo DSI tractography combined with landmark-based registration, automatic cortical parcellation and whole-brain structural connection matrices in 20 right-handed male subjects. On the supratemporal plane, the pattern of connectivity was related to the architectonically defined early-stage auditory areas. It revealed a three-tier architecture characterized by a cascade of connections from the primary auditory cortex to six adjacent non-primary areas and from there to the superior temporal gyrus. Graph theory-driven analysis confirmed the cascade-like connectivity pattern and demonstrated a strong degree of segregation and hierarchy within early-stage auditory areas. Putative higher-order areas on the temporal and parietal convexities had more widely spread local connectivity and long-range connections with the prefrontal cortex; analysis of optimal community structure revealed five distinct modules in each hemisphere. The pattern of temporo-parieto-frontal connectivity was partially asymmetrical. In conclusion, the human early-stage auditory cortical connectivity, as revealed by in vivo DSI tractography, has strong similarities with that of non-human primates. The modular architecture and hemispheric asymmetry in higher-order regions is compatible with segregated processing streams and lateralization of cognitive functions.

Spectral properties of the Laplacian of multiplex networks.

One of the more challenging tasks in the understanding of dynamical properties of models on top of complex networks is to capture the precise role of multiplex topologies. In a recent paper, Gómez et al. [ Phys. Rev. Lett. 110 028701 (2013)], some of the authors proposed a framework for the study of diffusion processes in such networks. Here, we extend the previous framework to deal with general configurations in several layers of networks and analyze the behavior of the spectrum of the Laplacian of the full multiplex. We derive an interesting decoupling of the problem that allow us to unravel the role played by the interconnections of the multiplex in the dynamical processes on top of them. Capitalizing on this decoupling we perform an asymptotic analysis that allow us to derive analytical expressions for the full spectrum of eigenvalues. This spectrum is used to gain insight into physical phenomena on top of multiplex, specifically, diffusion processes and synchronizability.

Exploring Compositional Data with the CoDa-Dendrogram

Within the special geometry of the simplex, the sample space of compositional data, compositional orthonormal coordinates allow the application of any multivariate statistical approach. The search for meaningful coordinates has suggested balances (between two groups of parts)—based on a sequential binary partition of a D-part composition—and a representation in form of a CoDa-dendrogram. Projected samples are represented in a dendrogram-like graph showing: (a) the way of grouping parts; (b) the explanatory role of subcompositions generated in the partition process; (c) the decomposition of the variance; (d) the center and quantiles of each balance. The representation is useful for the interpretation of balances and to describe the sample in a single diagram independently of the number of parts. Also, samples of two or more populations, as well as several samples from the same population, can be represented in the same graph, as long as they have the same parts registered. The approach is illustrated with an example of food consumption in Europe

A novel approach to analysing the regimes of temporary streams in relation to their controls on the composition and structure of aquatic biota

Temporary streams are those water courses that undergo the recurrent cessation of flow or the complete drying of their channel. The structure and composition of biological communities in temporary stream reaches are strongly dependent on the temporal changes of the aquatic habitats determined by the hydrological conditions. Therefore, the structural and functional characteristics of aquatic fauna to assess the ecological quality of a temporary stream reach cannot be used without taking into account the controls imposed by the hydrological regime. This paper develops methods for analysing temporary streams' aquatic regimes, based on the definition of six aquatic states that summarize the transient sets of mesohabitats occurring on a given reach at a particular moment, depending on the hydrological conditions: Hyperrheic, Eurheic, Oligorheic, Arheic, Hyporheic and Edaphic. When the hydrological conditions lead to a change in the aquatic state, the structure and composition of the aquatic community changes according to the new set of available habitats. We used the water discharge records from gauging stations or simulations with rainfall-runoff models to infer the temporal patterns of occurrence of these states in the Aquatic States Frequency Graph we developed. The visual analysis of this graph is complemented by the development of two metrics which describe the permanence of flow and the seasonal predictability of zero flow periods. Finally, a classification of temporary streams in four aquatic regimes in terms of their influence over the development of aquatic life is updated from the existing classifications, with stream aquatic regimes defined as Permanent, Temporary-pools, Temporary-dry and Episodic. While aquatic regimes describe the long-term overall variability of the hydrological conditions of the river section and have been used for many years by hydrologists and ecologists, aquatic states describe the availability of mesohabitats in given periods that determine the presence of different biotic assemblages. This novel concept links hydrological and ecological conditions in a unique way. All these methods were implemented with data from eight temporary streams around the Mediterranean within the MIRAGE project. Their application was a precondition to assessing the ecological quality of these streams.

An affected core drives network integration deficits of the structural connectome in 22q11.2 deletion syndrome.

Chromosome 22q11.2 deletion syndrome (22q11DS) is a genetic disease known to lead to cerebral structural alterations, which we study using the framework of the macroscopic white-matter connectome. We create weighted connectomes of 44 patients with 22q11DS and 44 healthy controls using diffusion tensor magnetic resonance imaging, and perform a weighted graph theoretical analysis. After confirming global network integration deficits in 22q11DS (previously identified using binary connectomes), we identify the spatial distribution of regions responsible for global deficits. Next, we further characterize the dysconnectivity of the deficient regions in terms of sub-network properties, and investigate their relevance with respect to clinical profiles. We define the subset of regions with decreased nodal integration (evaluated using the closeness centrality measure) as the affected core (A-core) of the 22q11DS structural connectome. A-core regions are broadly bilaterally symmetric and consist of numerous network hubs - chiefly parietal and frontal cortical, as well as subcortical regions. Using a simulated lesion approach, we demonstrate that these core regions and their connections are particularly important to efficient network communication. Moreover, these regions are generally densely connected, but less so in 22q11DS. These specific disturbances are associated to a rerouting of shortest network paths that circumvent the A-core in 22q11DS, "de-centralizing" the network. Finally, the efficiency and mean connectivity strength of an orbito-frontal/cingulate circuit, included in the affected regions, correlate negatively with the extent of negative symptoms in 22q11DS patients, revealing the clinical relevance of present findings. The identified A-core overlaps numerous regions previously identified as affected in 22q11DS as well as in schizophrenia, which approximately 30-40% of 22q11DS patients develop.

Etude observationnelle prospective comparant un analyseur automatique non-operateur dépendant de la VOP avec la pression de pouls, dans l'évaluation de la rigidité artérielle en hémodialye

L'insuffisance rénale chronique (IRC) accélère le durcissement vasculaire lié à l'âge. La rigidité artérielle peut être évaluée en mesurant la vitesse de l'onde du pouls (VOP) carotide-fémorale ou plus simplement, comme le recommandent les lignes directrices du KDOQI, en surveillant la pression du pouls (PP). Les deux mesures sont en corrélation avec la survie et l'incidence des maladies cardio-vasculaires. La VOP peut également être évaluée au niveau de l'artère brachiale avec l'aide d'un Mobil-O-Graph ; un dispositif automatique non-opérateur dépendant. Le but de l'étude était de vérifier si, dans une population de dialysés, la VOP obtenue par Mobil-O-Graph (MogVOP) est plus sensible que la PP pour détecter le vieillissement vasculaire. Un groupe de 143 patients de 4 unités de dialyse a été suivi en mesurant la MogVOP et la PP tous les 3 à 6 mois. Les résultants ont été comparés avec un groupe de contrôle qui avait les même facteurs de risque mais une eGFR > 30 ml/min. La MogVOP, contrairement à la PP, arrive à discriminer la population des dialysés du groupe de contrôle. La différence moyenne, traduite en âge, entre les deux populations était de 8.4 ans. L'augmentation de la MogVOP, en fonction de l'âge, était plus rapide dans le groupe de dialyse. 13.3% des patients dialysés, mais seulement 3.0% du groupe de contrôle, était des "outliers" pour la MogVOP. Le taux de mortalité (16 sur 143) était similaire chez les "outliers" et les "inliers" (7.4 contre 8.0% par ans). En stratifiant les patients selon la MogVOP on a pu observer une différence significative de la survie. Une valeur haute de parathormone (PTH) et le fait d'être dialysé pour une néphropathie hypertensive ont été associés à un niveau de base de MogVOP supérieur. Évaluer la VOP sur l'artère brachiale, en utilisant un Mobil-O-Graph, est une alternative valide et simple, laquelle, auprès de la population des dialysés, se révèle plus sensible au vieillissement vasculaire que la PP. Comme démontré dans des études antérieures la VOP est corrélée à la mortalité. Parmi les facteurs de risque spécifiques de l'IRC seulement la PTH est associée à une VOP de base plus haute.

A Social Network Analysis of Twitter: Mapping the Digital Humanities Community

Defining digital humanities might be an endless debate if we stick to the discussion about the boundaries of this concept as an academic "discipline". In an attempt to concretely identify this field and its actors, this paper shows that it is possible to analyse them through Twitter, a social media widely used by this "community of practice". Based on a network analysis of 2,500 users identified as members of this movement, the visualisation of the "who's following who?" graph allows us to highlight the structure of the network's relationships, and identify users whose position is particular. Specifically, we show that linguistic groups are key factors to explain clustering within a network whose characteristics look similar to a small world.

Anonymizing Graphs: Measuring Quality for Clustering

Peer-reviewed

Computing the diameter of Coxeter groups

This thesis addresses the problem of computing the minimal and maximal diameter of the Cayley graph of Coxeter groups. We first present and assert relevant parts of polytope theory and related Coxeter theory. After this, a method of contracting the orthogonal projections of a polytope from Rd onto R2 and R3, d ¸ 3 is presented. This method is the Equality Set Projection algorithm that requires a constant number of linearprogramming problems per facet of the projection in the absence of degeneracy. The ESP algorithm allows us to compute also projected geometric diameters of high-dimensional polytopes. A representation set of projected polytopes is presented to illustrate the methods adopted in this thesis.