Elliptic Curve Cryptography (ECC), independently proposed by Miller [Mil86] and Koblitz [Kob87] in mid 80’s, is finding momentum to consolidate its status as the public-key system of choice in a wide range of applications and to further expand this position to settings traditionally occupied by RSA and DL-based systems. The non-existence of known subexponential attacks on this cryptosystem directly translates to shorter keylengths for a given security level and, consequently, has led to implementations with better bandwidth usage, reduced power and memory requirements, and higher speeds. Moreover, the dramatic entry of pairing-based cryptosystems defined on elliptic curves at the beginning of the new millennium has opened the possibility of a plethora of innovative applications, solving in some cases longstanding problems in cryptography. Nevertheless, public-key cryptography (PKC) is still relatively expensive in comparison with its symmetric-key counterpart and it remains an open challenge to reduce further the computing cost of the most time-consuming PKC primitives to guarantee their adoption for secure communication in commercial and Internet-based applications. The latter is especially true for pairing computations. Thus, it is of paramount importance to research methods which permit the efficient realization of Elliptic Curve and Pairing-based Cryptography on the several new platforms and applications. This thesis deals with efficient methods and explicit formulas for computing elliptic curve scalar multiplication and pairings over fields of large prime characteristic with the objective of enabling the realization of software implementations at very high speeds. To achieve this main goal in the case of elliptic curves, we accomplish the following tasks: identify the elliptic curve settings with the fastest arithmetic; accelerate the precomputation stage in the scalar multiplication; study number representations and scalar multiplication algorithms for speeding up the evaluation stage; identify most efficient field arithmetic algorithms and optimize them; analyze the architecture of the targeted platforms for maximizing the performance of ECC operations; identify most efficient coordinate systems and optimize explicit formulas; and realize implementations on x86-64 processors with an optimal algorithmic selection among all studied cases. In the case of pairings, the following tasks are accomplished: accelerate tower and curve arithmetic; identify most efficient tower and field arithmetic algorithms and optimize them; identify the curve setting with the fastest arithmetic and optimize it; identify state-of-the-art techniques for the Miller loop and final exponentiation; and realize an implementation on x86-64 processors with optimal algorithmic selection. The most outstanding contributions that have been achieved with the methodologies above in this thesis can be summarized as follows: • Two novel precomputation schemes are introduced and shown to achieve the lowest costs in the literature for different curve forms and scalar multiplication primitives. The detailed cost formulas of the schemes are derived for most relevant scenarios. • A new methodology based on the operation cost per bit to devise highly optimized and compact multibase algorithms is proposed. Derived multibase chains using bases {2,3} and {2,3,5} are shown to achieve the lowest theoretical costs for scalar multiplication on certain curve forms and for scenarios with and without precomputations. In addition, the zero and nonzero density formulas of the original (width-w) multibase NAF method are derived by using Markov chains. The application of “fractional” windows to the multibase method is described together with the derivation of the corresponding density formulas. • Incomplete reduction and branchless arithmetic techniques are optimally combined for devising high-performance field arithmetic. Efficient algorithms for “small” modular operations using suitably chosen pseudo-Mersenne primes are carefully analyzed and optimized for incomplete reduction. • Data dependencies between contiguous field operations are discovered to be a source of performance degradation on x86-64 processors. Three techniques for reducing the number of potential pipeline stalls due to these dependencies are proposed: field arithmetic scheduling, merging of point operations and merging of field operations. • Explicit formulas for two relevant cases, namely Weierstrass and Twisted Edwards curves over and , are carefully optimized employing incomplete reduction, minimal number of operations and reduced number of data dependencies between contiguous field operations. • Best algorithms for the field, point and scalar arithmetic, studied or proposed in this thesis, are brought together to realize four high-speed implementations on x86-64 processors at the 128-bit security level. Presented results set new speed records for elliptic curve scalar multiplication and introduce up to 34% of cost reduction in comparison with the best previous results in the literature. • A generalized lazy reduction technique that enables the elimination of up to 32% of modular reductions in the pairing computation is proposed. Further, a methodology that keeps intermediate results under Montgomery reduction boundaries maximizing operations without carry checks is introduced. Optimized formulas for the popular tower are explicitly stated and a detailed operation count that permits to determine the theoretical cost improvement attainable with the proposed method is carried out for the case of an optimal ate pairing on a Barreto-Naehrig (BN) curve at the 128-bit security level. • Best algorithms for the different stages of the pairing computation, including the proposed techniques and optimizations, are brought together to realize a high-speed implementation at the 128-bit security level. Presented results on x86-64 processors set new speed records for pairings, introducing up to 34% of cost reduction in comparison with the best published result. From a general viewpoint, the proposed methods and optimized formulas have a practical impact in the performance of cryptographic protocols based on elliptic curves and pairings in a wide range of applications. In particular, the introduced implementations represent a direct and significant improvement that may be exploited in performance-dominated applications such as high-demand Web servers in which millions of secure transactions need to be generated.

Diss. (sammanfattning) Stockholm : Karolinska institutet, 2007. / Härtill 4 uppsatser.

Diss. (sammanfattning) Uppsala : Uppsala universitet, 2007. / Härtill 4 uppsatser.

Cette thèse est consacrée à l'étude mathématique et numérique du modèle de Hartree-Fock-Bogoliubov (HFB) pour les systèmes quantiques attractifs, qui est abondamment utilisé en physique nucléaire. Après avoir présenté le modèle et ses principales caractéristiques, nous expliquons comment le discrétiser et nous montrons des résultats de convergence. Nous examinons tout particulièrement l'algorithme de point fixe (parfois appelé Roothaan) et montrons qu'il converge ou alors oscille entre deux états dont aucun n'est solution du problème. Ceci généralise au cadre HFB des résultats de Cancès et Le Bris pour le modèle plus simple de Hartree-Fock dans le cas répulsif. Suivant ces mêmes auteurs, nous proposons un algorithme basé sur la contrainte relachée et pour lequel la convergence est garantie. Dans dernière partie de la thèse, nous illustrons le comportement de ces algorithmes par des simulations numériques pour plusieurs modèles. Dans un premier temps nous considérons un système purement gravitationnel où les particules interagissent avec le potentiel de Newton. Nos simulations montrent que la matrice d'appariement est toujours non nulle, un fait qui n'a pas encore pu être démontré rigoureusement. Nous étudions ensuite un modèle très simplifié pour la description de protons et neutrons dans le noyau atomique. / This work is devoted to the theoretical and numerical study of Hartree-Fock-Bogoliubov (HFB) theory for attractive quantum systems, which is one of the main methods in nuclear physics. We first present the model and its main properties, and then explain how to discretize it. We prove some convergence results, in particular for the simple fixed point algorithm (sometimes called Roothaan). We show that it converges, or oscillates between two states, none of them being a solution. This generalizes to the HFB case previous results of Cancès and Le Bris for the simpler Hartree-Fock model in the repulsive case. Following these authors, we also propose a relaxed constraint algorithm for which convergence is guaranteed. In the last part of the thesis, we illustrate the behavior of these algorithms by some numerical experiments. We first consider a system where the particles only interact through the Newton potential. Our numerical results show that the pairing matrix never vanishes, a fact that has not yet been proved rigorously. We then study a very simplified model for protons and neutrons in a nucleus.

SPOP paired with multiple exemplar instruction has been shown to be effective with typically developing preschoolers in establishing the joint stimulus control required for the development of naming (Rosales et al., 2012). The purpose of the current investigation is to evaluate the effectiveness and efficiency of the stimulus pairing observation procedure in establishing speaker and listener responses with children with developmental disabilities. Participants were presented with pairings of an auditory and visual stimulus. Testing was conducted after the instructional phase to assess if the participant could tact the item when presented with the picture as well as select the object from an array when given the name of the object. If the participants did not meet mastery criteria during posttests, a multiple exemplar procedure (MEI) was implemented to examine its efficacy in establishing the joint stimulus control of the speaker and listener responses. Following multiple exemplar instruction, testing was conducted. The results of the current investigation show that the SPOP in combination with MEI was effective in establishing both the listener and tact relations for all three participants.

Esquistossomose é uma doença crônica e debilitante. Schistosoma representa a única classe de trematódeos com vida dióica. Um contínuo pareamento com o macho é essencial para a maturação sexual do sexo feminino. Fêmeas adultas provenientes de infecções uni-sexuadas são subdesenvolvidas, apresentam atrofia do tamanho e um sistema reprodutivo imaturo. Para estudar os mecanismos envolvidos no pareamento de vermes adultos foram utilizadas duas plataformas de microarranjos distintas: uma composta por 4 mil sondas de cDNA dupla fita produzida pelo nosso grupo de pesquisas e outra composta por 44 mil sondas de oligonucleotideos desenhadas pelo nosso grupo e produzida pela empresa Agilent Technologies. Com a plataforma de 4 mil sondas detectamos 113 transcritos diferencialmente expressos em fêmeas adultas mantidas separadas de seus respectivos pares durante 24 horas de cultivo in vitro quando comparadas com fêmeas adultas pareadas; para 10 destes genes obtivemos uma confirmação adicional da expressão diferencial por transcrição reversa fita específica seguida de PCR em Tempo Real. Observamos também os efeitos do pareamento no perfil de expressão gênica de machos adultos mantidos separados de seus respectivos pares durante 24 horas de cultivo in vitro; foram encontrados 152 transcritos diferencialmente expressos. Com a plataforma de 44 mil sondas foi detectada a expressão de 5.798 genes transcricionalmente ativos em verme adulto, em um conjunto de 19.907 genes únicos representados nesta plataforma. A análise do conjunto de genes \"no match\" mostrou que em 156 genes ocorria expressão senso e anti-senso; para 6 destes transcritos obtivemos uma confirmação adicional da expressão nas duas fitas por transcrição reversa fita específica seguida de PCR em Tempo Real. Adicionalmente foram identificados 2717 transcritos diferencialmente expressos em fêmeas separadas de seus respectivos pares durante 13 dias de cultivo in vitro, quando comparadas com fêmeas mantidas pareadas. Para as análises com machos separados durante 13 dias foram encontrados 243 transcritos diferencialmente expressos. Por fim, realizamos estudos com o objetivo de observar os genes que podem estar correlacionados com o contato físico do pareamento (macho e fêmea) e genes que podem ser regulados pela possível difusão de proteínas e hormônios secretados no meio, para os quais a mudança do nível de expressão não dependa da necessidade de contato entre o macho e a fêmea. Sabe-se que o contato direto da fêmea com o macho é necessário para manter a atividade reprodutiva feminina e observamos que o re-pareamento pode restabelecer o perfil de expressão gênica de fêmeas ou machos separados. Além disso, observamos que fêmeas separadas e depois mantidas na presença do macho, porém sem re-pareamento, apresentam uma expressão gênica diferente das fêmeas separadas e depois mantidas na ausência de machos, sugerindo que algum fator secretado pelo macho no meio regula a expressão. Este trabalho representa uma importante contribuição no entendimento da relação macho-fêmea em nível molecular. / Schistosomiasis is a chronic and debilitating disease. Schistosoma represents the only class of trematodes with a dioecious life. A continuous pairing with the male is essential for female sexual maturation. Adult females from uni-sexual infections are underdeveloped, have body atrophy and an immature reproductive system. To study the mechanisms involved in pairing of adult worms two microarray platforms were used: one comprised by 4000 cDNA probes and printed by our research group and another comprised by 44 000 oligonucleotide probes designed by our group and printed by Agilent Technologies Company. With the 4000-probes platform we detected 113 transcripts differentially expressed in adult females kept separated from their mates during 24 hours in vitro when compared with paired adult females; for 10 of these genes we obtained additional confirmation of differential expression by Real Time RT-PCR. We also observed the effects of pairing on the gene expression profile of adult males kept separate from their mates during 24 hours in vitro, where we found 152 differentially expressed transcripts. With the 44 000-probes platform we detected the expression of 5798 genes in adult worms, out of a set of 19 907 unique genes represented on this platform. Analysis of the \"no match\" genes showed that 156 have transcription from the sense and anti-sense strands; for 6 of them we obtained additional confirmation of expression by strand specific Real Time RT-PCR. Additionally, we identified 2717 differentially expressed transcripts in females separated from their mates during 13 days in vitro when compared to females that remained paired. In the analysis of males separated for 13 days we found 243 differentially expressed transcripts. Finally, we performed a study aimed at observing genes which might be correlated to physical contact pairing (male and female) and compared to genes that might be regulated by the possible diffusion of secreted proteins and hormones in the medium, for which the change of expression level does not depend on physical contact between male and female. It is known that direct female-male contact is needed to keep the female reproductively activity and we observed that repairing can restore the gene expression profile of females or males that were kept separated. Furthermore, we observed that females separated and then maintained in the presence of male, but without re-pairing, have a different gene expression from the separated females kept without males, suggesting that some male secreted factors might be involved in gene regulation. This work represents an important contribution to the understanding of male-female relation at the molecular level

The master thesis works measures of phenotypic traits and unique data of pairing of wild living grey partridges. The secondary sexual traits and theirs variability is described. Especially the relationship between the ornamental traits and the pairing success was researched. The results proved the greater pairing success of males with the larger melanin breast patch and the greater quality of the mate in females with the larger breast patch. The strategy of male floaters, which are realatively well ornamented is discussed.

Apesar da rápida expansão das aplicações da cromatografia líquida acoplada à espectrometria de massas em química clínica, a análise de metabólitos de baixo peso molecular e alta polaridade em matrizes biológicas ainda permanece como um grande desafio analítico. Dentre os compostos de grande importância no diagnóstico de doenças metabólicas que ainda carecem de melhores alternativas bioanalíticas destacam-se os aminoácidos. O presente estudo descreve o desenvolvimento e a validação de um novo método para a quantificação de 24 aminoácidos em plasma explorando a cromatografia líquida acoplada a espectrômetros de massas em tandem. Foi construído um método de detecção baseado em SRM (múltiplas reações selecionadas) com duas transições de massas para cada um dos 24 aminoácidos e os 19 padrões internos marcados com isótopos estáveis. Foram avaliadas três estratégias de separação cromatográfica e o melhor desempenho foi obtido com fase reversa com octadecilsilano (C18) com pareamento iônico com o ácido perfluoropentanoico. O método cromatográfico final permitiu a separação dos 24 aminoácidos, com resolução completa dos isômeros: leucina, isoleucina e allo-isoleucina, em 11 minutos incluindo o tempo de re-estabilização da coluna cromatográfica. Os limites de quantificação variaram em 113 fmol a 6 pmol injetados na coluna cromatográfica. A imprecisão obtida nos níveis testados para todos os aminoácidos foi inferior a 14%. O método apresentou linearidade para os intervalos testados chegando a 1,5 mmol.L-1 para vários compostos. Os ensaios de arraste mostraram que os limites máximos obtidos na linearidade não geram nenhuma interferência subsequente. A exatidão do método foi avaliada com amostras provenientes do programa de referência interlaboratorial European Research Network for evaluation and improvement of screening, Diagnosis and treatment of Inherited disorders of Metabolism (ERNDIM) e com o material de referência certificado do National Institute of Standards and Technology (NIST). Todos os analitos mostraram equivalência estatística com o método desenvolvido. / Despite the widespread use of liquid chromatography coupled to mass spectrometry applications in clinical chemistry, the analysis of low molecular weight and high polar metabolites in biological matrices remains as a major analytical challenge. Notwithstanding the key role played by amino acids in the diagnosis of metabolic diseases, there is still need for improvements in bioanalytical process of these analytes. The present study describes the development and validation of a new method for quantification of 24 amino acids in plasma based on liquid chromatography coupled to tandem mass spectrometry. Detection and quantification were achieved building a selected reaction monitoring method two mass transitions for each 24 amino acids and 19 stable isotope internal standards. Three chromatographic strategies for separation were evaluated, and best performance was achieved using reversed-phase octadecylsilane with perfluropentanoic acid as ion pairing agent. The separation method allowed separation of 24 amino acids with full resolution for isomers leucine, isoleucine and alloisoleucine in 11 minutes, including column equilibration time. The limits of quantification ranged from 113 fmol to 6 pmol (on column injection). Imprecisions for all evaluated levels and amino acids were less than 14%. The method is linear in all clinical intervals and extending up to 1.5 mmol.L-1. Carryover evaluation demonstrated absence of interference in the following injection throughout the analytical interval. Method accuracy was evaluated analyzing reference samples from European Research Network for evaluation and improvement of screening, Diagnosis and treatment of Inherited disorders of Metabolism (ERNDIM) and National Institute of Standards and Technology (NIST). Statistical equivalence was demonstrated for all analytes using the present method.

No description available.

This diploma thesis deals with the optimization of the process of matching the bearing components. The work contains a description of Codesys programming environment, its structure, usable languages and some examples of usage. The main part of the thesis describes a series of algorithms that provide the necessary actions for one of two processed pairing approaches. These algorithms are subsequently implemented as subprograms in the Codesys environment. The necessary inputs and outputs are part of the proposed algorithms as well as processed subroutines.