京都大学 / 新制・課程博士 / 博士(情報学) / 甲第23397号 / 情博第766号 / 新制||情||131(附属図書館) / 京都大学大学院情報学研究科知能情報学専攻 / (主査)教授 阿久津 達也, 教授 山本 章博, 教授 鹿島 久嗣 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

This thesis is about semiautomatic network protocol diagnostics and creating protocol description from eavesdropped communication. Several network eavesdropping techniques  and some common programs for network analysis are introduced. Well-known network protocols are described, with focus on their communication messages. Some already existing methods for creating models from examples are mentioned and their characteristics defined. Next we design architecture of developed tool and some methods, that create protocol description. After that we explain implementation of this tool and finally the tool is tested and experimented with.

Orientador: Aluir Porfírio Dal Poz / Resumo: Neste trabalho foi proposta uma metodologia para a extração de contornos de telhados de edifícios no espaço-objeto, a partir da integração de um estéreo par de imagens aéreas de alta resolução e modelos 3D aproximados de telhado obtidos a partir de dados de varredura a LASER. Um modelo matemático considerando as propriedades radiométricas e geométricas dos telhados foi formulado a fim de representar o contorno do telhado no espaçoimagem, tendo como base o modelo de contorno ativo Snake. Esse modelo foi então adaptado para descrever os contornos no espaço-objeto considerando um estéreo par de imagens aéreas. Finalmente, o polígono ótimo que representa um dado contorno do telhado foi determinado a partir da otimização, via Programação Dinâmica, da função de energia criada. A solução obtida é uma representação mais acurada para o correspondente contorno do modelo 3D do telhado. O método desenvolvido apresenta também mecanismos para realizar a compensação automática de três tipos de problemas comuns em ambientes urbanos e que podem prejudicar a extração automática de telhados: obstruções perspectivas causadas por edifícios elevados, obstruções diretas causadas por vegetação que se eleva acima do telhado e sombras adjacentes aos telhados, as quais podem ser confundidas com as bordas do telhado. Os experimentos foram realizados utilizando imagens aéreas com GSD ≈ 0,10 m e nuvem de pontos LASER com densidade média de 6 pontos/m2. Os resultados mostraram que o método funciona adequad... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: In this work a methodology was proposed for extracting building roof contours in the object-space, by integration of a high-resolution aerial images stereo pair and 3D roof models reconstructed from LASER scanning data. A mathematical model considering the radiometric and geometric properties of roofs was developed in order to represent the roof contour in the image-space, based on the Snake active contour model. Then, the model was adapted to represent the contours in the object space considering a stereo pair of aerial images. Finally, the optimal polygon representing a selected roof contour was obtained by optimizing the proposed energy function using Dynamic Programming algorithm. The solution obtained, i.e., a polygon representing each 3D roof contour, will be a higher accurate representation for the correspondent contour of the 3D roof model. The proposed method also presents mechanisms to perform the compensation of three types of common problems in urban environment and which can disturb the automatic roof extraction: perspective occlusions caused by high buildings, occlusions caused by vegetation that covers the roof and shadows that are adjacent to the roofs which can be misinterpreted as roof edges. The experiments were performed using aerial images with GSD ≈ 0,10 m and LASER point cloud with average density of 6 points/m2. The results showed that the proposed method works properly in contour extraction of roofs with occlusion and shadows areas, presenting complet... (Complete abstract click electronic access below) / Doutor

Background: Reliable prediction of RNA–RNA binding energies is crucial, e.g. for the understanding on RNAi, microRNA–mRNA binding and antisense interactions. The thermodynamics of such RNA–RNA interactions can be understood as the sum of two energy contributions: (1) the energy necessary to ‘open’ the binding site and (2) the energy gained from hybridization. Methods: We present an extension of the standard partition function approach to RNA secondary structures that computes the probabilities Pu[i, j] that a sequence interval [i, j] is unpaired. Results: Comparison with experimental data shows that Pu[i, j] can be applied as a significant determinant of local target site accessibility for RNA interference (RNAi). Furthermore, these quantities can be used to rigorously determine binding free energies of short oligomers to large mRNA targets. The resource consumption is comparable with a single partition function computation for the large target molecule. We can show that RNAi efficiency correlates well with the binding energies of siRNAs to their respective mRNA target.

<p>This dissertation has three essays that are focused on understanding smallholder farmers’ choices in sub-Saharan Africa, particularly, Malawi. The first essay uses a clustered randomized control trial (RCT) to evaluate the impact of storage and commitment constraints on farmers’ legume storage bevavior. The second essay is motivated by the incomplete quality information problem within informal markets that undermines consumers’ demand for quality and lead to lemons market. In this essay, we use a clustered RCT along with the Becker DeGroote Marshack auctions amongst 1,098 farm households to evaluate whether providing food safety (aflatoxins) information increases consumers’ demand for grain quality and whether that demand for quality varies depending on food availability. The third essay uses stochastic dynamic programming to explore the role of market risk and expenditure shocks on smallholder farmers’ storage and marketing behavior.</p>

The operation of groups of heavy-duty vehicles at small inter-vehicular distances, known as platoons, lowers the overall aerodynamic drag and, therefore, reduces fuel consumption and greenhouse gas emissions. Experimental tests conducted on a flat road and without traffic have shown that platooning has the potential to reduce the fuel consumption up to 10%. However, platoons are expected to drive on public highways with varying topography and traffic. Due to the large mass and limited engine power of heavy-duty vehicles, road slopes can have a significant impact on feasible and optimal speed profiles. Therefore, maintaining a short inter-vehicular distance without coordination can result in inefficient or even infeasible speed trajectories. Furthermore, external traffic can interfere by affecting fuel-efficiency and threatening the safety of the platooning vehicles. This thesis addresses the problem of safe and fuel-efficient control for heavy-duty vehicle platooning. We propose a hierarchical control architecture that splits this complex control problem into two layers. The layers are responsible for the fuel-optimal control based on look-ahead information on road topography and the real-time vehicle control, respectively. The top layer, denoted the platoon coordinator, relies on a dynamic programming framework that computes the fuel-optimal speed profile for the entire platoon. The bottom layer, denoted the vehicle control layer, uses a distributed model predictive controller to track the optimal speed profile and the desired inter-vehicular spacing policy. Within this layer, constraints on the vehicles' states guarantee the safety of the platoon. The effectiveness of the proposed controller is analyzed by means of simulations of several realistic scenarios. They suggest a possible fuel saving of up to 12% for the follower vehicles compared to the use of existing platoon controllers. Analysis of the simulation results shows how the majority of the fuel saving comes from a reduced usage of vehicles brakes. A second problem addressed in the thesis is model predictive control for obstacle avoidance and lane keeping for a passenger car. We propose a control framework that allows to control the nonlinear vehicle dynamics with linear model predictive control. The controller decouples the longitudinal and lateral vehicle dynamics into two successive stages. First, plausible braking and throttle profiles are generated. Second, for each profile, linear time-varying models of the lateral dynamics are derived and used to formulate a collection of linear model predictive control problems. Their solution provides the optimal control input for the steering and braking actuators. The performance of the proposed controller has been evaluated by means of simulations and real experiments. / <p>QC 20150911</p>

No description available.

No description available.

Les travaux de cette thèse s'inscrivent dans le contexte de la coordination des décisions de planification survenant dans une chaîne logistique à deux acteurs: un fournisseur et un producteur souhaitant chacun diminuer leur propre coût. Les décisions de planification prises de manière indépendante par chaque acteur peuvent amener à une mauvaise performance de la chaîne logistique en terme de coûts, d'où la nécessité d'une coordination. Nous étudions des mécanismes de partage de coûts entre des acteurs en définissant des stratégies de coordination entre les acteurs par la mise en place de contrats. Nous considérons le cas où le producteur (resp. fournisseur) peut imposer son plan de production optimal au fournisseur (resp. distributeur). Différentes hypothèses de partage de coûts, ainsi que la problématique d'asymétrie d'information sont prises en compte dans ces travaux. Nous effectuons également des analyses expérimentales mesurant la diminution du coût de la chaîne logistique obtenue quand les acteurs coopèrent. Ce contexte nous amène à étudier de nouveaux problèmes de lot-sizing pour lesquels nous proposons une analyse de complexité et des algorithmes de programmation dynamique pour les résoudre. Nous proposons également une étude théorique des problèmes de lot-sizing à deux niveaux avec une capacité de stockage limitée. / This thesis focus on the coordination of planning decisions in a two-level supply chain composed of one supplier and one retailer. Each actor wants to minimize his own cost. The planning decisions independently took by the actors can lead to a poor performance in terms of costs, hence the necessity of coordination. We study cost sharing mechanisms between the actors by designing contracts. In this work, we consider the case where the retailer (resp. supplier) can impose his optimal production plan to the supplier (resp. retailer). Different cost sharing hypothesis, as well as the asymmetric information problem are taking into account in this thesis. We also perform an experimental analysis in order to evaluate the decrease of the supply chain cost obtained when the actors cooperate. This context leads us to study new lot-sizing problems for which we propose a complexity analysis and dynamic programming algorithms in order to solve them. We also propose a theoritical study of two-level lot-sizing problems with inventory bounds.

Cette thèse contient deux parties: la simulation des événements rares et le rééchantillonnage non-intrusif stratifié pour la programmation dynamique. La première partie consiste à quantifier des statistiques liées aux événements très improbables mais dont les conséquences sont sévères. Nous proposons des transformations markoviennes sur l'espace des trajectoires et nous les combinons avec les systèmes de particules en interaction et l'ergodicité de chaîne de Markov, pour proposer des méthodes performantes et applicables en grande généralité. La deuxième partie consiste à résoudre numériquement le problème de programmation dynamique dans un contexte où nous avons à disposition seulement des données historiques en faible nombre et nous ne connaissons pas les valeurs des paramètres du modèle. Nous développons et analysons un nouveau schéma composé de stratification et rééchantillonnage / This thesis contains two parts: rare events simulation and non-intrusive stratified resampler for dynamic programming. The first part consists of quantifying statistics related to events which are unlikely to happen but which have serious consequences. We propose Markovian transformation on path spaces and combine them with the theories of interacting particle system and of Markov chain ergodicity to propose methods which apply very generally and have good performance. The second part consists of resolving dynamic programming problem numerically in a context where we only have historical observations of small size and we do not know the values of model parameters. We propose and analyze a new scheme with stratification and resampling techniques.