Dans un contexte où les coordinations productives gagnent constamment en complexité, la question du fonctionnement de l’organisation réseau et son impact sur les performances des entreprises devient aujourd'hui un enjeu majeur aussi bien pour les entreprises que pour la recherche en sciences économiques. Cela nous a amené, à proposer, dans une première étape, une méthode d'analyse des transformations et de la gestion de l’entreprise réseau. On adhère à l’hypothèse selon laquelle la réussite et la cohésion de cette organisation contemporaine repose sur la mobilisation des différents modes de coordination. Dans une deuxième étape, nous cherchons à contribuer à une meilleure compréhension théorique de l’entreprise réseau. Nous montrons que, si les approches des contrats et les approches des compétences offrent de nouvelles formes analytiques par rapport à la théorie classique, elles sont encore incapables de prendre en compte la complexité de l’entreprise réseau. Nous suggérons, par ailleurs, que l’approche des connaissances apporte une synthèse novatrice et satisfaisante. Dans une troisième étape, nous étudions, sur un plan micro-Économétrique et en se basant sur la méthode de matching, la causalité entre l’organisation réseau caractérisée par l’implantation des innovations organisationnelles et la performance des entreprises. Les données disponibles sont issues des données appariées de l’enquête COI et de la base des données DIANE. Nous montrons que la mise en œuvre des innovations organisationnelles induit des effets négatifs sur la valeur ajoutée et la rentabilité du capital financier et n’induit aucun effet sur le chiffre d’affaires et la productivité du travail. / In a context where productive coordination is constantly becoming complex, the issue of the function of the network organization and its impact on business performance is now becoming a major issue for both: companies and Economic researches. This led us to propose, as a first step, a method for analyzing the transformations and the management of this network company. We adhere to the hypothesis that success and cohesion of this contemporary organization are based on the mobilization of different modes of coordination. In a second step , we will seek to contribute to a better theoretical understanding of a network company . We will show that if approaches of contact and approaches that are based on skills offer new analytical forms compared to the classical theory, they are still unable to take into account the complexity of a company network. We suggest, moreover, that the approach of knowledge brings an innovative and satisfying synthesis. In a third step, we will study from a micro- econometric point of view and based on the method of matching, the causality between a network organization characterized by the implementation of certain organizational innovations and the performance of companies. The available data are from matched survey data IOC 2006 and based DIANE data. We will show that the application of new management practices induce negative effects on the value added and profitability of financial capital and induce no effect on turnover and labor productivity.

Diploma thesis is concerned with foreign exchange risk management in terms of international trade. It deals with types of foreign exchange rate risk (transaction exposure, economic exposure, translation exposure) and their influence on business activity. Diploma thesis also focuses on the possibility of future foreign exchange rate's prediction. The main part of the thesis is devoted to various methods of foreign exchange rate risk management. These methods are analysed under two main groups, internal methods and external methods. Under internal methods, following techniques are analysed: netting, matching, leading and lagging, currency diversification, choice of invoicing currency and pricing policy. External methods focus on the use of financial derivatives, specifically currency forwards, currency futures, currency option and currency swaps. Analysis of exchange rate risk management using financial derivatives is supported with illustrative examples.

Identication of cartridge is very essential in the field of forensics, military or people who collect ammunitions. The cartridges can beidentied by their headstamps.This thesis presents work on identification and matching of cartridge headstamp from the image. The Libor Masek's open source iris recognition algorithm is considered for the identification of cartridge pattern from the image.The dataset is devoleped with the cartridge headstamp patterns and matching of cartridge headstamp patterns is implemented. For matching of the cartridge pattern the Hamming distance is considered as the metric to differentiate interclass and intraclass comparisons. Variance is used as a criteria to discard the unwanted areas of the cartridge headstamp pattern.Four distinct cartridge headstamp patterns are considered. Three cartridges of each headstamp pattern are considered for intra class comparisons. The validation of the method is performed.

Previous research implementing stratification on the propensity score has generally relied on using five strata, based on prior theoretical groundwork and minimal empirical evidence as to the suitability of quintiles to adequately reduce bias in all cases and across all sample sizes. This study investigates bias reduction across varying number of strata and sample sizes via a large-scale simulation to determine the adequacy of quintiles for bias reduction under all conditions. Sample sizes ranged from 100 to 50,000 and strata from 3 to 20. Both the percentage of bias reduction and the standardized selection bias were examined. The results show that while the particular covariates in the simulation met certain criteria with five strata that greater bias reduction could be achieved by increasing the number of strata, especially with larger sample sizes. Simulation code written in R is included.

Ingeniero Civil Eléctrico / El sueño es un tema que ha tomado mucha fuerza en los últimos años sobre todo por su función neurofisiológica y reparadora. Dentro de los fenómenos fisiológicos más importantes del sueño se encuentra una actividad eléctrica registrada en el EEG (electroencefalograma) llamada Huso Sigma. Este patrón eléctrico se ha asociado por una parte a procesos involucrados en la consolidación de la memoria y por otra a desórdenes tales como retardo mental, hiperkinesia, desarrollo cognitivo, entre otros. Por lo tanto pesquisar y caracterizar este patrón es de suma importancia en el área de la medicina. El objetivo de esta tesis consiste en construir características morfológicas con el fin de caracterizar Husos Sigma y posteriormente detectarlos a través de un sistema de detección automático. Los Husos Sigmas corresponden a trenes de ondas distinguibles de la actividad de fondo del EEG, principalmente notorios en las derivaciones centrales, que comienzan con una baja amplitud, llegan a un máximo y luego decaen, teniendo duraciones típicas entre 0,5 a 2 [s]. El problema de detección consiste en lograr separar entre Husos Sigmas, correspondientes a trozos de señales marcadas por expertos que a su juicio consideran que son Husos Sigmas, de otras marcas hechas por un pre-detector y que no corresponden a Husos Sigmas. Para resolver el problema propuesto se propone un esquema: Descomposición Modal Empírica (EMD por Empirical Mode Decomposition en inglés) - detector de zonas - Matching Pursuit (MP). La EMD permite aislar la componente fusiforme que se busca caracterizar mediante MP en las zonas detectadas por el detector de zonas. El algoritmo MP se encuentra equipado con un diccionario de wavelets Morlet, cuya función es describir de manera sucinta cuando se trata de HS y de manera más compleja cuando se trata de no-HS. La creación del diccionario se hace en base a características extraídas del detector de zonas aplicado previamente. Luego de aplicar el método propuesto se extraen características basadas en el comportamiento morfológico de la componente seleccionada. Tras generar estas características se entrena una Máquina de Soporte Vectorial (SVM por Support Vector Machine en inglés) empleando un kernel Gaussiano. Los SVM se calibran para cada experimento realizado. El funcionamiento del sistema, considerando un largo mínimo del detector de zonas de 0,3 [s], es revisado en el punto de operación TVP=80% y FPR=30%. TVP significa tasa de verdaderos positivos y FPR tasa de falsos positivos. De este análisis se concluye que la aproximación morfológica es buena, sin embargo el método opera de manera similar en varios HS y no-HS. Realizando un análisis entre las características basado en información mutua se concluye que gran parte de la información se encuentra contenida en 3 características; sin embargo el desempeño de ocupar estas tres características en algunos puntos de operación se diferencia bastante con respecto al desempeño de un sistema que emplea todas las características creadas. Finalmente se sugieren nuevos pasos a seguir con el fin de mejorar el sistema propuesto.

Um emparelhamento em um grafo é um conjunto de arestas duas a duas não adjacentes. Dado um grafo G com pesos em suas arestas, o problema do emparelhamento de peso é máximo é encontrar um emparelhamento cuja soma dos pesos de suas arestas é máxima. Neste trabalho estudamos diferentes soluções para esse problema. Estudamos algoritmos combinatórios que resolvem o problema no caso em que G é bipartido e no caso geral. O algoritmo de Edmonds é um algoritmo polinomial cuja complexidade de tempo é O(n^4), onde n é o número de vértices do grafo G. Discutimos nesse trabalho nossa implementação desse algoritmo. Num trabalho de 1985, Grötschel e Holland propuseram o uso de ferramentas de programação linear para resolver o mesmo problema. O método chamado de planos-de-corte baseia-se em um resultado de Padberg e Rao de que o problema da separação associado ao poliedro dos emparelhamentos pode ser resolvido em tempo polinomial. Neste trabalho fizemos implementações dos dois métodos e os utilizamos para resolver diversos tipos de instâncias do problema. Nossa conclusão é que o método poliédrico, apesar de utilizar ferramentas genéricas, é bastante eficiente na prática. / A matching in a graph G is a set of pairwise disjoint edges of G. Given a graph G with edge weights, we define the maximum weight matching problem as that of finding a matching which maximizes the sum of its weights. In this thesis we study different solutions to this problem. We studied combinatorial algorithms that solve this problem in the case where G is bipartite and also in the general case. Edmonds algorithm [Edm65a] is a polynomial time algorithm with complexity O(n4 ), where n is the number of vertices in the graph G. We discuss in this document our implementation of this algorithm. In a paper from 1985, Gr tschel & Holland [GH85] discussed the use of linear programming o tools for solving the maximum weight matching problem. This so called cut-plane method relies on a result by Padberg & Rao [PR82] that proves that the separation problem associated with matching polyhedron is solvable in polinomial time. In this work we implemented both methods and used then to solve different instances of the problem. Our conclusion is that the polyhedral method, although using generical tools is very efficient in practice.

Alpha matting is one of the key techniques in image processing and is used to extract accurate foreground from a still image or video sequences. Chroma keying is a special case of alpha matting with a solid background color. Color spill is one of the difficulties in chroma keying, and it has not been effectively solved by current methods. Sometimes, an image contains both reflected regions and transparent regions. When the foreground in such images is chroma keyed, reflection on the foreground is often falsely treated as transparency and causes unreal foreground extraction and composition. This problem is called color spill. Color spill suppression aims to extract the opaque foreground with the correct transparency descriptor (i.e. alpha value) and remove the reflected background color on it. When the background color presented on the foreground is simultaneously caused by reflection and transparency, color spill suppression becomes extremely challenging. It is because that the reflection removal and the actual transparency estimation is a dilemma. Our proposed method for color spill suppression is to separate reflected regions from transparent regions, and process reflected regions as foreground while keeping transparency unchanged at the same time. In this thesis, we propose a novel method for color spill suppression for chroma keying. The quality of the estimated alpha matte could be significantly improved. In our approach, we suppress color spill by using the polarization and the optical flow algorithm based on disparity estimation. Specifically, we make the assumption that reflection changes more than transparency when the scene is captured by a binocular camera with a polaroid filter. Based on this assumption, we took stereo images with polarization filter, registered stereo images by optical flow and conducted the variance analysis on histograms of input images to separate transparency and reflection. Our experiments show that the opaque foreground with background color spill can be reliably extracted while the real transparency can be kept.

In this thesis the Hidden Markov Model (HMM) is used in the process of map matching to investigate the accuracy for road segment map matching. A few HMM algorithms using a Global Navigation Satellite System (GNSS) receiver, odometer and gyroscope sensors are presented. The HMM algorithms are evaluated on four accuracy metrics. Two of these metrics have been seen in previous literature and captures road map match accuracy. The other have not been seen before and captures road segment accuracy. In the evaluation process a dataset is created by simulation to achieve positional ground truth for each sensor measurement. The accuracy distribution for different parts of the map matched trajectory is also evaluated. The result shows that HMM algorithms presented in previous literature, falls short to capture the accuracy for road segment map matching. The results further shows that by using less noisy sensors, as odometer and gyroscope, the accuracy for road segment map matching can be increased.

Pulmonary diseases are frequently associated with changes in lung anatomy. These diseases may change the airway, vessel and lung tissue properties. In order to evaluate the lung in a longitudinal study, a stable reference system is required to identify corresponding parts of the lung. The structure of the airway tree can be used to repeatedly identify the regions of interest. In this study, an improved method for matching of intra-patient airway trees was proposed and evaluated. The association graph method proposed by Pelillo et al. matches free and rooted trees by detecting the maximal sub-tree isomorphism. Tschirren et al. implemented this approach for labeling and matching of human airway trees and reported 92.9% matching accuracy which is the highest among existing methods. However we recognized a few shortcomings of this method. When we tested it on seven normal human cases, we observed that successful matching relies heavily on the accurate labeling of main branchpoints in the trees. Incorrect labeling of main branch points or failure in labeling results in failure to match that branch point. Such matching errors may eventually propagate to sub-trees. On our seven data samples, matching accuracy was found to be as low as 65%. To improve the matching performance, we propose to make matching independent of labeling as well as improve association graph by adding constraint of path-length along with the existing constraints. Furthermore, we would like to redefine the incorrect matches as those matches which are mismatched as well as those that are missed by the matching algorithm. Our results for a total of 27 cases show a significant improvement in accuracy. The accuracy calculated as per the convention without accounting for the branchpoint pairs missed by the algorithm is 92.19% whereas the accuracy calculated as per our definition is 73.98%, with runtime in the range of 0.01-262.81 sec (average runtime is 25.14 sec). We thus propose an improved association graph method which is efficient in matching intra-patient airway trees with good accuracy and within a reasonable time.

京都大学 / 0048 / 新制・課程博士 / 博士(経済学) / 甲第22227号 / 経博第615号 / 新制||経||293(附属図書館) / 京都大学大学院経済学研究科経済学専攻 / (主査)教授 関口 格, 教授 原 千秋, 准教授 NEWTON Jonathan Charles Scott / 学位規則第4条第1項該当 / Doctor of Economics / Kyoto University / DGAM