No description available.

Thesis (M.S.)--University of Wisconsin--Madison, 1967. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Thesis (Ph. D.)--University of Chicago, Dept. of Physics, December 2000. / Includes bibliographical references. Also available on the Internet.

Thesis (M.S.)--Duquesne University, 2005. / Title from document title page. Abstract included in electronic submission form. Includes bibliographical references (p. 21) and index.

Thesis (M.S.)--University of Wisconsin--Madison, 1965. / eContent provider-neutral record in process. Description based on print version record. Bibliography: l. 76.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1980. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 94-95).

Ο στόχος της παρούσας διπλωματικής εργασίας είναι η ανάπτυξη μια java εφαρμογής μέσω της οποίας ο χρήστης θα έχει τη δυνατότητα να εισαγάγει συναρτήσεις Boole προκειμένου να πραγματοποιηθεί η ελαχιστοποίησή τους. Ο χρήστης έχει τη δυνατότητα να εισαγάγει συναρτήσεις έως και έξι μεταβλητών. Η εισαγωγή της συνάρτησης Boole μπορεί να πραγματοποιηθεί συμπληρώνοντας κατευθείαν τον χάρτη Karnaugh ή εισάγοντας τη συνάρτηση μέσω του πίνακα αληθείας ή εισάγοντας τους ελαχιστόρους, μεγιστόρους και αδιάφορους όρους της συνάρτησης και εισάγοντας τη συνάρτηση στην αλγεβρική της μορφή. Έπειτα ο χρήστης έχει δύο επιλογές, να εμφανίσει την ελαχιστοποιημένη συνάρτηση ως άθροισμα γινομένων ή ως γινόμενο αθροισμάτων. Η ελαχιστοποίηση πραγματοποιήθηκε με χρήση του αλγορίθμου της μεθόδου QuineMcCluskey (μέθοδος κατάταξης σε πίνακα). Στην εφαρμογή υπάρχει δυνατότητα επιλογής γλώσσας (ελληνική ή αγγλική). Επιπλέον, ο χρήστης μπορεί να αλλάξει τα ονόματα των μεταβλητών που χρησιμοποιούνται στις συναρτήσεις με ονόματα δικής του επιλογής. Τέλος, η εφαρμογή πληρεί αρκετές προϋποθέσεις ευχρηστίας, έτσι ώστε να μπορεί να χρησιμοποιηθεί με ευκολία από τους χρήστες. / The scope of this present diploma thesis is the development of a java application with which the user can import boolean functions in order to minimize them. The user has the possibility of importing functions up to six variables. The import of Boolean function could be achieved with filling the Karnaugh map or importing the function via the truth table or importing the minterms or importing the function as an algebra expression. Then the user has two choices, to present the minimized function as sum of products or as products of sum. The minimization was achieved using the method of classification in table, which is known as method QuineMcCluskey. At this application, the user has the possibility to choose the language, either Greek or English as well as to change th name of variables that they are used in the functions. Finally, the application fills enough conditions of usability, so it can be used easily from the users.

A cryptographic protocol is a structured exchange of messages protected by means of cryptographic algorithms. Computer security in general relies heavily on these protocols and algorithms; in turn, these rely absolutely on smaller components called primitives. As technology advances, computers have reached a cost and a degree of miniaturisation conducive to their proliferation throughout society in the form of software-controlled network-enabled things. As these things find their way into environments where security is critical, their protection ultimately relies on primitives; if a primitive fails, all security solutions (protocols, policies, etc.) that are built on top of it are likely to offer no security at all. Lightweight symmetric-key primitives, in particular, will play a critical role.The security of protocols is frequently verified using formal and automated methods. Concerning algorithms and public-key primitives, formal proofs are often used, although they are somewhat error prone and current efforts aim to automate them. On the other hand, symmetric-key primitives are still currently analysed in a rather ad-hoc manner. Since their security is only guaranteed by the test-of-time, they traditionally have a built-in security margin. Despite being paramount to the security of embedded devices, lightweight primitives appear to have a smaller security margin and researchers would greatly benefit from automated tools in order to strengthen tests-of-time.In their seminal work back in 2000, Massacci and Marraro proposed to formulate primitives in propositional logic and to use SAT solvers to automatically verify their properties. At that time, SAT solvers were quite different from what they have become today; the continuous improvement of their performance makes them an even better choice for a verification back-end. The performance of SAT solvers improved so much that starting around 2006, some cryptanalysts started to use them, but mostly in order to speedup their attacks. This thesis introduces the framework CryptoSAT and shows its advantages for the purpose of verification. / La sécurité informatique repose en majeure partie sur des mécanismes cryptographiques, qui à leur tour dépendent de composants encore plus fondamentaux appelés primitives ;si une primitive échoue, toute la sécurité qui en dépend est vouée à l'échec. Les ordinateurs ont atteint un coût et un degré de miniaturisation propices à leur prolifération sous forme de systèmes embarqués (ou enfouis) qui offrent généralement peu de ressources calculatoires, notamment dans des environnements où la sécurité est primordiale. Leur sécurité repose donc lourdement sur les primitives dites à clé symétrique, puisque ce sont celles qui sont le mieux adaptées aux ressources limitées dont disposent les systèmes embarqués. Il n'est pas mathématiquement prouvé que les primitives à clé symétrique soient dépourvues de failles de sécurité, contrairement à tous les autres mécanismes cryptographiques :alors que la protection qu'offre la cryptographie peut, en général, être prouvée de façon formelle (dans un modèle limité) et parfois au moyen de méthodes automatisées qui laissent peu de place à l'erreur, la protection qu'offrent les primitives à clé symétrique n'est garantie que par “l'épreuve du temps”, c.-à-d. par la résistance (durable) de ces primitives face aux attaques conçues par la communauté des chercheurs en cryptologie. Pour compenser l'absence de garanties formelles, ces primitives sont traditionnellement pourvues d'une “marge de sécurité”, c.-à-d. de calculs supplémentaires, juste au cas où, dont le coût est difficile à justifier lorsque les ressources calculatoires sont rares.Afin de pallier à l'insuffisance de l'épreuve du temps et à la diminution des marges de sécurité, cette thèse revient sur les travaux de Massacci et Marraro qui, en 2000, avaient proposé de formuler les primitives en logique propositionnelle de sorte que leurs propriétés puissent être vérifiées automatiquement au moyen d'algorithmes SAT. A cette époque, les algorithmes SAT étaient très différents de ce qu'ils sont devenus aujourd'hui ;l'amélioration de leur performance, continuelle au fil des années, en fait un choix encore plus judicieux comme moteur de vérification. Dans le cadre de cette thèse, une méthode a été développée pour permettre à un cryptologue de facilement vérifier les propriétés d'une primitive à clé symétrique de façon formelle et automatique à l'aide d'algorithmes SAT, tout en lui permettant de faire abstraction de la logique propositionnelle. L'utilité de la méthode a ensuite été mise en évidence en obtenant des réponses formelles à des questions, posées dans la littérature en cryptanalyse, concernant des failles potentielles tant au niveau de la conception qu'au niveau de la mise en oeuvre de certaines primitives. / Doctorat en Sciences / info:eu-repo/semantics/nonPublished

Chemotherapy is commonly used in cancer treatments, however only 25% of cancers are responsive and a significant proportion develops resistance. The p53 tumour suppressor is crucial for cancer development and therapy, but has been less amenable to therapeutic applications due to the complexity of its action reflected in 67,000 papers describing its function. Here we provide a systematic approach to integrate this information by constructing large-scale logical models of the p53 interactome using extensive database and literature integration. Initially we generated models using manual curation to demonstrate the feasibility of the approach. This was followed by creation of the next generation models by automatic text mining results retrieval. Final model PKT205/G3 was generated by choosing the size of the interactome that could be analysed with current available computing power and by linking upstream nodes to input environmental signals such as DNA damage and downstream nodes to output signal such as apoptosis. This final version of the PKT205/G3 model contains 205 nodes representing genes or proteins, DNA damage input and apoptosis output, and 677 logical interactions. Predictions from in silico knock-outs and steady state model analysis were validated using literature searches and in vitro experiments. We identify an up regulation of Chk1, ATM and ATR pathways in p53 negative cells and 58 other predictions obtained by knockout tests mimicking mutations. The comparison of model simulations with microarray data demonstrated a significant rate of successful predictions ranging between 52 % and 71 % depending on the cancer type. Growth factors and receptors FGF2, IGF1R, PDGFRB and TGFA were identified as factors contributing selectively to the control of U2OS osteosarcoma and HCT116 colon cancer cell growth. In summary, we provide the proof of principle that this versatile and predictive model has vast potential for use in cancer treatment by identifying pathways in individual patients that contribute to tumour growth, defining a sub population of “high” responders and identification of shifts in pathways leading to chemotherapy resistance.

Philosophiae Doctor - PhD / Understanding the geometries of points in space has been attractive to mathematicians for ages. As a model, twelve years ago, Kurz and Meyer [32] considered point sets in the m-dimensional a ne space Fmq over a nite eld Fq with q = pr elements, p prime, where each squared Euclidean distance of two points is a square in Fq: The latter points are said to be at integral distance in Fmq , and the sets above are called integral point sets.