Inadequate compaction of a soil subgrade can lead to detrimental outcomes that are not only costly but dangerous to the general public. To avoid this, quality control (QC) devices such as the nuclear density gauge (NDG) are currently being used to monitor the compaction and moisture content of soil subgrades. However, regulatory concerns associated with the NDG have encouraged federal and state agencies, as well as the heavy civil construction industry to consider non-nuclear devices for QC testing of compacted soils. One such non-nuclear device is the Soil Density Gauge (SDG), which utilizes electromagnetic wave propagation to obtain soil properties such as wet unit weight and moisture content. This research shows that through using soil-specific trend lines, the SDG has the capability of obtaining an equivalent NDG wet unit weight. Alongside the SDG, two dielectric moisture probes were also evaluated and through a calibration process on compacted soils, a general moisture content trend line was developed. This general moisture content trend line related outputted volumetric moisture contents from the moisture probes to gravimetric moisture contents. Field data were then plotted along with the general moisture content trend line to show that these devices have the potential of predicting gravimetric moisture contents. By combining the results of the SDG and moisture probe analyses, graphs were then developed that relate SDG wet unit weights to NDG dry unit weights using soil and moisture-specific trend lines.

Alors qu'initialement utilisés pour résoudre le Problème du Logarithme Discret (DLP) dans le groupe de points d'une courbe elliptique, les couplages sont très à la mode en cryptographie ces années car ils permettent de construire de nouveaux protocoles cryptographiques. Cependant, le calcul efficace du couplage dépend de l'arithmétique du modèle de courbe elliptique choisi et du corps sur lequel cette courbe est définie. Dans cette thèse, nous calculons le couplage sur deux modèles de Jacobi de courbes elliptiques puis nous introduisons et étudions l'arithmétique d'un nouveau modèle d'Ewards de courbe elliptique défini en toutes caractéristiques. Plus précisément, Nous utilisons l'interprétation géométrique de la loi de groupe sur l'intersection des quadriques de Jacobi pour obtenir pour la première fois dans la littérature, les formules explicites de la fonction de Miller pour le calcul du couplage de Tate sur cette courbe. Pour un calcul de couplage avec un degré de plongement pair, nous définissons la tordue quadratique pour obtenir des étapes de doublement et d'addition efficaces dans l'algorithme de Miller. Ensuite nous utilisons un isomorphisme entre la quartique spéciale de Jacobi Ed: Y²=dX⁴+Z⁴ et le modèle de Weierstrass pour obtenir la fonction de Miller nécessaire au calcul du couplage de Tate. Pour un degré de plongement divisible par 4, nous définissons la tordue d'ordre 4 de cette courbe pour obtenir un résultat meilleur du calcul du couplage de Tate par rapport aux courbes elliptiques sous forme de Weierstrass. Notre résultat améliore en même temps les derniers résultats obtenus sur cette courbe. Ce résultat est donc le meilleur connu à ce jour, à notre connaissance, pour le calcul du couplage de Tate sur les courbes possédant des tordues d'ordre 4. En 2006, Hess et al. introduisent le couplage Ate, qui est une version améliorée du couplage de Tate. Nous calculons ce couplage et ses variantes sur la même quartique. Nous y obtenons encore des résultats meilleurs. Notre troisième contribution est l'introduction d'un nouveau modèle d'Edwards de courbe elliptique d'équation 1+x²+y²+x²y²=Xxy. Ce modèle est ordinaire sur les corps de caractéristique 2 et nous montrons qu'il est birationnellement équivalent au modèle original d'Edwards x²+y²=c²(1+x²y²) en caractéristique différente de 2. Pour ce faire, nous utilisons la théorie des fonctions thêta et un modèle intermédiaire que nous appelons modèle thêta de niveau 4. Nous utilisons les relations de Riemann des fonctions thêta pour étudier l'arithmétique de ces deux courbes. Nous obtenons d'une part une loi de groupe complète, unifiée et en particulier compétitive en caractéristique 2 et d'autre part nous présentons les meilleures formules d'addition différentielle sur le modèle thêta de niveau 4.

Movement training modulates the excitability in several cortical and subcortical areas. Compared to training with a single arm, movement training with both arms yields a greater increase in motor related cortical regions. A short-term session of bimanual training (BMT) enhances cortical activity of motor preparation and execution areas in both hemispheres. The underlying neural mechanisms for this increased activation with BMT are unclear, but may involve interhemispheric connections between homologous primary motor cortex (M1) representations and input from motor preparatory areas (i.e. dorsal premotor cortex (PMd)). Also, it is unclear how selective up-regulation or down-regulation of specific motor-related areas may contribute to changes in M1 excitability when combined with BMT. The work in this thesis investigated modulation of M1 excitability in terms of in-phase versus anti-phase BMT (Study #1), potentially up-regulating the left dorsal premotor cortex (lPMd) via iTBS before BMT (Study #2), theoretically down-regulating contralateral (right) M1 homologous representation before BMT (Study #3), and finally the potential intracortical and interhemispheric cortical adaptations in M1 bilaterally due to the same interventions as Study #2 (Study #4). For Study #1, it was hypothesized that in-phase BMT would lead to an increased excitability in M1. For Studies #2-4, it was hypothesized that modulation of motor-related areas would cause an increase in the excitability of left M1, and this modulation would be greater when combined with BMT. Study #1 found that in-phase, and not anti-phase BMT, lead to increase M1 excitability. Study #2 found that iTBS to lPMd followed by BMT caused a unique increase in M1 excitability, in terms of increased spatial extent and global MEP amplitude. Study #3 found that the combination of cTBS to right M1 with BMT caused greater excitability enhancements than either intervention alone. Finally, Study #4 found distinct modulations of cortical excitability within and across M1 bilaterally due to BMT, iTBS to lPMd and the combination of these interventions that involved long-interval inhibitory circuitry asymmetrically. Overall, this current work found that the modulation of remote cortical areas to M1 (i.e. lPMd and contralateral M1) in combination with movement training led to unique, and at times greater, excitability enhancements of M1 which could be advantageous in enhancing short-term plasticity in damaged M1.

Dans cette thèse, nous considérons plusieurs paramètres des hypergraphes et nous étudions si les restrictions aux sous-classes des hypergraphes permettent d’obtenir des propriétés combinatoires et algorithmiques souhaitables. La plupart des paramètres que nous prenons en compte sont des instances spéciales des packings et transversals des hypergraphes.Dans la première partie, nous allons nous concentrer sur les line graphs des graphes subcubiques sans triangle et nous allons démontrer que pour tous ces graphes il y a un independent set de taille au moins 3|V(G)|/10 et cette borne est optimale. Conséquence immédiate: nous obtenons une borne inférieure optimale pour la taille d’un couplage maximum dans les graphes subcubiques sans triangle. De plus, nous montrons plusieurs résultats algorithmiques liés au FEEDBACK VERTEX SET, HAMILTONIAN CYCLE et HAMILTONIAN PATH quand restreints aux line graphs des graphes subcubiques sans triangle.Puis nous examinons trois hypergraphes ayant la propriété d’Erdős-Pósa et nous cherchons à déterminer les fonctions limites optimales. Tout d’abord, nous apportons une fonction theta-bounding pour la classe des graphes subcubiques et nous étudions CLIQUE COVER: en répondant à une question de Cerioli et al., nous montrons qu’il admet un PTAS pour les graphes planaires. Par la suite, nous nous intéressons à la Conjecture de Tuza et nous montrons que la constante 2 peut être améliorée pour les graphes avec arêtes contenues dans au maximum quatre triangles et pour les graphes sans certains odd-wheels. Enfin, nous nous concentrons sur la Conjecture de Jones: nous la démontrons dans le cas des graphes sans griffes avec degré maximal 4 et nous faisons quelques observations dans le cas des graphes subcubiques.Nous étudions ensuite la VC-dimension de certains hypergraphes résultants des graphes. En particulier, nous considérons l’hypergraphe sur l’ensemble des sommets d’un certain graphe qui est induit par la famille de ses sous-graphes k-connexes. En généralisant les résultats de Kranakis et al., nous fournissons des bornes supérieures et inférieures optimales pour la VC-dimension et nous montrons que son calcul est NP-complet, pour chacun k > 0. Enfin, nous démontrons que ce problème (dans le cas k = 1) et le problème étroitement lié CONNECTED DOMINATING SET sont soit solvables en temps polynomial ou NP-complet, quand restreints aux classes de graphes obtenues en interdisant un seul sous-graphe induit.Dans la partie finale de cette thèse, nous nous attaquons aux meta-questions suivantes: Quand est-ce qu’un certain problème “difficile” de graphe devient “facile”?; Existe-t-il des frontières séparant des instances “faciles” et “difficiles”? Afin de répondre à ces questions, dans le cas des classes héréditaires, Alekseev a introduit la notion de boundary class pour un problème NP-difficile et a montré qu’un problème Pi est NP-difficile pour une classe héréditaire X finiment défini si et seulement si X contient un boundary class pour Pi. Nouscontinuons la recherche des boundary classes pour les problèmes suivants: HAMILTONIAN CYCLE THROUGH SPECIFIED EDGE, HAMILTONIAN PATH, FEEDBACK VERTEX SET, CONNECTED DOMINATING SET and CONNECTED VERTEX COVER. / In this thesis, we consider several hypergraph parameters and study whether restrictions to subclasses of hypergraphs allow to obtain desirable combinatorial or algorithmic properties. Most of the parameters we consider are special instances of packings and transversals of hypergraphs.In the first part, we focus on line graphs of subcubic triangle-free graphs and show that any such graph G has an independent set of size at least 3|V(G)|/10, the bound being sharp. As an immediate consequence, we obtain a tight lower bound for the matching number of subcubic triangle-free graphs. Moreover, we prove several algorithmic results related to FEEDBACK VERTEX SET, HAMILTONIAN CYCLE and HAMILTONIAN PATH when restricted to line graphs of subcubic triangle-free graphs.Then we consider three hypergraphs having the Erdős-Pósa Property and we seek to determine the optimal bounding functions. First, we provide an optimal theta-bounding function for the class of subcubic graphs and we study CLIQUE COVER: answering a question by Cerioli et al., we show it admits a PTAS for planar graphs. Then we focus on Tuza’s Conjecture and show that the constant 2 in the statement can be improved for graphs whose edges are contained in at most four triangles and graphs obtained by forbidding certain odd-wheels. Finally, we concentrate on Jones’ Conjecture: we prove it in the case of claw-free graphs with maximum degree at most 4 and we make some observations in the case of subcubic graphs.Then we study the VC-dimension of certain set systems arising from graphs. In particular, we consider the set system on the vertex set of some graph which is induced by the family of its k-connected subgraphs. Generalizing results by Kranakis et al., we provide tight upper and lower bounds for the VC-dimension and we show that its computation is NP-complete, for each k > 0. Finally, we show that this problem (in the case k = 1) and the closely related CONNECTED DOMINATING SET are either NP-complete or polynomial-time solvable when restricted to classes of graphs obtained by forbidding a single induced subgraph.In the final part of the thesis, we consider the following meta-questions: When does a certain “hard” graph problem become “easy”?; Is there any “boundary” separating “easy” and “hard” instances? In order to answer these questions in the case of hereditary classes, Alekseev introduced the notion of a boundary class for an NP-hard problem and showed that a problem Pi is NP-hard for a finitely defined (hereditary) class X if and only if X contains a boundary class for Pi. We continue the search of boundary classes for the following problems: HAMILTONIAN CYCLE THROUGH SPECIFIED EDGE, HAMILTONIAN PATH, FEEDBACK VERTEX SET, CONNECTED DOMINATING SET and CONNECTED VERTEX COVER.

No description available.

This report covers an investigation of the methods and algorithms required to plan and perform semi-autonomous photo missions on Apple iPad devices using data exported from Google Earth. Flight time was to be minimized, taking wind velocity and aircraft performance into account. Google Earth was used both to define what photos to take, and to define the allowable mission area for the aircraft. A benchmark mission was created containing 30 photo operations in a 250 by 500 m area containing several no-fly-areas. The report demonstrates that photos taken in Google Earth can be reproduced in reality with good visual resemblance. High quality paths between all possible photo operation pairs in the benchmark mission could be found in seconds using the Theta* algorithm in a 3D grid representation with six-edge connectivity (Up, Down, North, South, East, West). Smoothing the path in a post-processing step was shown to further increase the quality of the path at a very low computational cost. An optimal route between the operations in the benchmark mission, using the paths found by Theta*, could be found in less than half a minute using a Branch-and-Bound algorithm. It was however also found that prematurely terminating the algorithm after five seconds yielded a route that was close enough to optimal not to warrant running the algorithm to completion.

Le logarithme discret sur les courbes elliptiques fournit la panoplie standard de la cryptographie à clé publique: chiffrement asymétrique, signature, authentification. Son extension à des courbes hyperelliptiques de genre supérieur se heurte à la difficulté de construire de telles courbes qui soient sécurisées. Dans cette thèse nous utilisons la théorie des fonctions thêta développée par Mumford pour construire des algorithmes efficaces pour manipuler les variétés abéliennes. En particulier nous donnons une généralisation complète des formules de Vélu sur les courbes elliptiques pour le calcul d'isogénie sur des variétés abéliennes. Nous donnons également un nouvel algorithme pour le calcul efficace de couplage sur les variétés abéliennes en utilisant les coordonnées thêta. Enfin, nous présentons une méthode de compression des coordonnées pour améliorer l'arithmétique sur les coordonnées thêta de grand niveau. Ces applications découlent d'une analyse fine des formules d'addition sur les fonctions thêta. Si les résultats de cette thèse sont valables pour toute variété abélienne, pour les applications nous nous concentrons surtout sur les jacobienne de courbes hyperelliptiques de genre~$2$, qui est le cas le plus significatif cryptographiquement. / The discrete logarithm on elliptic curves give the standard protocols in public key cryptography: asymmetric encryption, signatures, ero-knowledge authentification. To extends the discrete logarithm to hyperelliptic curves of higher genus we need efficient methods to generate secure curves. The aim of this thesis is to give new algorithms to compute with abelian varieties. For this we use the theory of algebraic theta functions in the framework of Mumford. In particular, we give a full generalization of Vélu's formulas for the computation of isogenies on abelian varieties. We also give a new algorithm for the computation of pairings using theta coordinates. Finally we present a point compression method to manipulate These applications follow from the analysis of Riemann relations on theta functions for the addition law. If the results of this thesis are valid for any abelian variety, for the applications a special emphasis is given to Jacobians of hyperelliptic genus~$2$ curves, since they are the most significantly relevant case in cryptography.

<div><div><div><div>Mass spectrometry is a widely used tool for efficient chemical characterization and identification. The development of electrospray ionization as a soft ionization method enables mass spectrometry for large biomolecule investigation. Protein as one of the most important classes of biomolecules, its structural changes including folding, unfolding, aggregation, degradation and post-translational modification all influence protein bioactivity. Protein characterization and identification are important for protein behavior mechanism understanding, which may further contribute to disease treatment development. Protein conformation changes are normally very fast, and the initial stages, which significantly influence the conformation changing pathway, normally occur in milliseconds or shorter time scale. Such a fast structural change is hard to be monitored using traditional bulk solution manipulations, and fast sample preparation methods are required. </div><div><br></div><div>In this thesis project, theta tips are applied as a microreactor and nESI-MS emitter to perform fast protein manipulation immediately before MS analysis. Theta tips can be operated in two modes. The first mode is for submillisecond time scale reactions. Proteins and reagents are loaded into different channels and directly sprayed out simultaneously. Proteins and reagents mix and react in the Taylor cone and subsequent droplets for submillisecond time scale. Through this method, pH induced protein folding is investigated and protein folding intermediates were captured. The second mode is for milliseconds or longer reactions. Differential voltages can be applied to each channel before ionization and spray. The electric field between the two channels induces in-tip electroosmosis, which lead to an in-tip mixing and reaction. In this mode, the reaction time is not limited by the droplet lifetime as in the first mode, but is controlled by electroosmosis time. By changing the electroosmosis square wave frequency and cycles, the mixing time can be elongated to milliseconds or longer, which is suitable for slower reaction study. </div><div>Joule heating is discovered during theta tip electroosmosis when samples are dissolved in buffer. The Joule heating effect is high enough to heat up the aqueous solution to at least 75 oC based on Raman thermometry measurement, while the actual peak temperature could be higher. The Joule heating effect in theta tip electroosmosis can be easily controlled by electroosmosis voltage, time, buffer concentration etc.. Proteins are thermally denatured by the Joule heating effect, and the denaturation extent correlates with Joule heating parameters. </div><div>With this results in hand, we are developing a protein melting temperature measurement method using theta tip Joule heating effect and mass spectrometry. This new melting temperature measurement method measures changes in protein mass and charge state distributions. Therefore, it could sensitively detect ligand loss and protein tertiary structural changes, which is an important compensation to current protein melting temperature measurement techniques like CD or DSC. Since the heating time is short and protein concentration for MS is low, protein aggregation and thermal fragmentation are highly avoided so a complete protein thermal unfolding process is monitored. Theta tip electroosmosis combining MS characterized protein thermal denaturation behavior from a new aspect.</div><div><br></div><div>Besides single protein folding and unfolding, protein identification and post-translational modification are important for proteomics study. The traditional bottom-up, top-down and middle-down methods are not able to both preserve intact protein mass and efficiently generate enough fragment peaks easily without performing gas phase dissociation. In this thesis, we also developed a new way to identify proteins combining limited trypsin digestion and mass spectrometry. Intact protein mass was preserved for protein size and PTM identification. Enough tryptic peptides were also generated for protein identification through database search.</div></div></div></div><div><br></div>

京都大学 / 新制・課程博士 / 博士(人間健康科学) / 甲第23128号 / 人健博第90号 / 新制||人健||6(附属図書館) / 京都大学大学院医学研究科人間健康科学系専攻 / (主査)教授 稲富 宏之, 教授 精山 明敏, 教授 村井 俊哉 / 学位規則第4条第1項該当 / Doctor of Human Health Sciences / Kyoto University / DFAM

This report studies polynomial equations and how one solves them using only the coefficients of the polynomial. It examines why it is impossible to solve equations of degree greater than four using only radicals and how instead one can solve them using elliptic functions. Although the quintic equation is the main area of our investigation, we also present parts of the history of algebraic equations, Galois theory, and elliptic functions.