Thèses sur le sujet « Hardne »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Hardne ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
RESTA, FEDERICA. « Integrated Read-out Front-end for High-Energy Physics Experiments ». Doctoral thesis, Università degli Studi di Milano-Bicocca, 2017. http://hdl.handle.net/10281/158121.
Texte intégralPhysic researches and discoveries depend heavily from efficient and reliability of the High-Energy Physics (HEP) experiments. The main goal is to study the fundamental constituents of the matter in terms of elementary charge particles, their interactions and their secondary products. The Large Hadron Collider (LHC) at the CERN works every day to discover details on new charged particles as neutrinos and Higgs Bosons. Charges are generated and accelerated from beam collisions inside the LHC. Different detectors are organized in shell structures and are designed to detect few particles topology. Typically, the parameters useful to identify a charged particle are momentum, electrical charge, energy, time of flight and distance. Detectors design is important but it is enhanced from proper electronic readout systems. In the last years, electronics parts are more and more efficient and compact. CMOS integrated solution are preferred to discrete one allowing major reliability, cost reduction and performance improvement. The design is not trivial but not impossible. Some characteristics depend on the electronic designer and his capability to manage the external parasitic effects, as the parasitic capacitance of the connected detector. Unfortunately, phenomena as radiation effects on electronics must be taken in account but they are not completely eliminated. CMOS technology influences strongly the integrated circuit performance and radiation hardness. In this scenario, 3 readout frontend circuits for HEP experiments have been designed, integrated and measured. 2 of them represent 2 different prototypes realized in IBM 130nm technology for ATLAS experiment at CERN laboratory with Max-Plank Institute for Physics collaboration. They include an analog chain in cascade with a digital one. Input charges (up to 100fC) are detected and converted into voltage signals. Their amplitude are proportional to the input and are sent to the following digital part. The digital part provides information about arrival time and amount of the input charge. When the discriminator switches, an event is detected and the Wilkinson ADC starts the voltage-to-time conversion. The full chips have a JTAG section to manage all programmable parameters (i.e. thresholds, hysteresis, deadtime, etc.) The second prototype is designed improving the previous version in terms of supply rejection noise, deadtime range and hysteresis management. The third circuit presented in this thesis is the first readout frontend for Pixel detectors in 28nm technology. The channel includes a charge sensitive preamplifier with an inverter switched based comparator. Reduced supply voltage and 28nm technology imply some difficult in the design with a major tolerance to the radiations, a lower area occupancy and a lower power consumption. The circuits are been designed for 2 different scenarios in terms of detector parasitic capacitance, detectable input charges, supply voltage, threshold voltage, power consumption and noise. In overall cases, the integrated systems provide information about amount of detected input charge and arrival time within 25ns. This aspect is very important and allows avoiding mistakes. Successive collisions lead to spurious signals presence and a single detection could have information about two different events. Maintaining the processing time within 25ns, consecutive collisions are detected as different events. This work is organized as follows. Part I includes a brief summary of the entire work in order to fix the goals of my activities. Then, the Part II is dedicated on a simplified description of the application field and the next target of the future experiments. In particular, some details on the effects induced by the radiation to integrated electronic component are provided. Part III and Part IV represent the core, including 3 readout frontend circuits design and measurements. Finally, there are correlated publications and conclusions.
Riceputi, Elisa (ORCID:0000-0002-0542-553X). « Design and Test of Imaging and Particle Detection Microelectronic System for Frontier Research Applications ». Doctoral thesis, Università degli studi di Bergamo, 2018. http://hdl.handle.net/10446/105286.
Texte intégralCAGLIERO, ROBERTO. « Macro instrumented indentation test for structural materials : experimental and numerical methods ». Doctoral thesis, Politecnico di Torino, 2016. http://hdl.handle.net/11583/2641542.
Texte intégralGedin, Emanuel. « Hardness of showing hardness of the minimum circuit size problem ». Thesis, KTH, Teoretisk datalogi, TCS, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232218.
Texte intégralProblemet att finna den minsta storleken på en krets som beräknar en given boolesk funktion, ofta kallat minimum circuit size problem (MCSP), har studerats i många år men det är fortfarande okänt om problemet är NP-svårt eller inte. Med detta i åtankte studerar vi egenskaper hos potentiella reduktioner till det här problemet. Vi fokuserar på naturliga lokala reduktioner som är vanliga i många bevis av NP-svårighet. Vi presenterar en method som visar att det finns en algorithm för att lösa varje problem som har en lokal naturlig reduktion till MCSP. Vi visar att om beslutsproblemet att skilja satisfierbara instanser av 3-SAT från de där som mest 7/8 + o(1) av klausulerna går att satisfiera har en reduktion till MCSP där en godtycklig bit av utdata kan beräknas i O(n1 - ε) tid för varje ε > 0 då kan k-SAT lösas av en krets med djup 3 och storlek 2o(n).
Budík, Tomáš. « Zakružovačka na Hardox ». Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2014. http://www.nusl.cz/ntk/nusl-231242.
Texte intégralClick, Sally Evelyn. « Melvene Draheim Hardee music maker and dreamer of dreams / ». Bowling Green, Ohio : Bowling Green State University, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=bgsu1237838404.
Texte intégralArana, Miranda Rodrigo, Ward Adrian Benavides, Takamura Ricardo Andrés Jiménez, Mori Willy Roosevelt Vásquez et Rodríguez Pamela Carolina Vital. « Harina de grillo - Crickie ». Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2020. http://hdl.handle.net/10757/652248.
Texte intégralJahnke, Carsten. « Das Silber des Meeres : Fang und Vertrieb von Ostseehering zwischen Norwegen und Italien (12.-16.Jahrhundert) / ». Köln ; Weimar ; Wien : Böhlau, 2000. http://catalogue.bnf.fr/ark:/12148/cb388275261.
Texte intégralMamani, Choque Claudia. « Obtención de harina de tarwi ». Universidad Mayor de San Andrés. Programa Cybertesis BOLIVIA, 2009. http://www.cybertesis.umsa.bo:8080/umsa/2009/mamani_cc/html/index-frames.html.
Texte intégralHarder, Michael [Verfasser]. « Exchangeability of copulas / Michael Harder ». Ulm : Universität Ulm, 2016. http://d-nb.info/1106329910/34.
Texte intégralBohman, Jerker. « En kritik av Hardins livbåtsetik ». Thesis, Uppsala universitet, Filosofiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-350226.
Texte intégralBruasse, Laurent. « Stabilité et filtration de Harder-Narasimhan ». Phd thesis, Université de Provence - Aix-Marseille I, 2001. http://tel.archives-ouvertes.fr/tel-00004129.
Texte intégralDeniz, Tansel. « Ballistic Penetration Of Hardened Steel Plates ». Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613534/index.pdf.
Texte intégralthere is an increasing interest on simulation studies to cutoff these aforementioned costs. This study deals with the numerical modeling of ballistic impact phenomena, regarding the ballistic penetration of hardened steel plates by 7.62 mm AP (Armor Piercing) projectile. Penetration processes of AP projectiles are reviewed. Then, a survey on analytical models is given. After the introduction of fun- damentals of numerical analysis, an intensive numerical study is conducted in 2D and 3D. Johnson Cook strength models for the four different heat treatments of AISI 4340 steel were constructed based on the dynamic material data taken from the literature. It was found that 2D numerical simulations gave plausible results in terms of residual projectile velocities, con- sidering the literature review. Then, 3D numerical simulations were performed based on the material properties that were selected in 2D studies. Good agreement was obtained between the numerical and test results in terms of residual projectile velocities and ballistic limit thick- nesses. It was seen that the ballistic protection efficiency of the armor plates increases with the increasing hardness, in the examined range. This study is a part of T¨
ubitak project 106M211 of MAG.
Evans, Paul Done. « The hardness and abrasion of polymers ». Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38305.
Texte intégralBaldie, Keith David. « Crack growth in hardened cement paste ». Thesis, Imperial College London, 1986. http://hdl.handle.net/10044/1/37934.
Texte intégralBreckel, Daniel W. « The process of hardness of heart ». Theological Research Exchange Network (TREN), 1991. http://www.tren.com.
Texte intégralBorsub, Jatesada. « Hardened Registration Process for Participatory Sensing ». Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-247886.
Texte intégralDeltagande avkännings system behöver samlas från ett stort antal aktörer.Systems öppenhet är dock en dubbelsidigt värd: Genom att låta alla praktiskaanvändare deltagit, kan system utnyttja en av angripare som introducera ett stortantal virtuella enheter. I det här arbetet föreslå en härda registreringsprocess fördeltagare att identifiera höjning av ribban: registrering screenas genom ett antaldefensiva åtgärders, för att avvisa falska registreringar som inte motsvara aktuellaenheter. Detta berövar en motståndare från en relativt lätt övertagande och gersamtidigt en flexibel och öppen registreringsprocess. De defensiva åtgärdernainförlivas i deltagande avkännings applikation.
Persu, Elena-Mădălina. « Tensors, sparse problems and conditional hardness ». Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120418.
Texte intégralCataloged from PDF version of thesis.
Includes bibliographical references (pages 101-108).
In this thesis we study the interplay between theoretical computer science and machine learning in three different directions. First, we make a connection between two ubiquitous sparse problems: Sparse Principal Component Analysis (SPCA) and Sparse Linear Regression (SLR). We show how to efficiently transform a blackbox solver for SLR into an algorithm for SPCA. Assuming the SLR solver satisfies prediction error guarantees achieved by existing efficient algorithms such as those based on the Lasso, we show that the SPCA algorithm derived from it achieves state of the art performance, matching guarantees for testing and for support recovery under the single spiked covariance model as obtained by the current best polynomial-time algorithms. Second, we push forward the study of linear algebra properties of tensors by giving a tensor rank detection gadget for tensors in the smoothed model. Tensors have had a tremendous impact and have been extensively applied over the past few years to a wide range of machine learning problems for example in developing estimators for latent variable models, in independent component analysis or blind source separation. Unfortunately, their theoretical properties are still not well understood. We make a step in that direction. Third, we show that many recent conditional lower bounds for a wide variety of problems in combinatorial pattern matching, graph algorithms, data structures and machine learning, including gradient computation in average case neural networks, are true under significantly weaker assumptions. This highlights that the intuition from theoretical computer science can not only help us develop faster practical algorithms but also give us a better understanding of why faster algorithms may not exist.
by Elena-Mădălina Persu.
Ph. D.
Faulstich, Raymond J., Lawrence W. Jr Burke et William P. D’Amico. « HARDENED SUBMINIATURE TELEMETRY AND SENSOR SYSTEM ». International Foundation for Telemetering, 1996. http://hdl.handle.net/10150/607637.
Texte intégralThe Army development and test community must demonstrate the functionality and reliability of gun-launched projectiles and munitions systems, especially newer smart munitions. The best method to satisfy this requirement is to combine existing optical and tracking systems data with internal data measured with on-board instrumentation (i.e. spin, pitch, and yaw measurements for standard items and terminal sensor, signal processor, and guidance/navigation system monitoring for smart munitions). Acquisition of internal data is usually limited by available space, harsh launch environments, and high associated costs. A technology development and demonstration effort is underway to provide a new generation of products for use in this high-g arena. This paper describes the goals, objectives, and progress of the Hardened Subminiature Telemetry and Sensor System (HSTSS) program.
Caldas, Miguel. « Characterization of Hardly e-Open functions ». Pontificia Universidad Católica del Perú, 2012. http://repositorio.pucp.edu.pe/index/handle/123456789/97022.
Texte intégralKohlhöfer, Walter. « Dynamic hardness testing challenges conventional tests ». Master's thesis, University of Cape Town, 1993. http://hdl.handle.net/11427/15981.
Texte intégralThe design and use of a portable dynamic hardness tester is described. The thesis begins with a description of the more common static hardness tests and the usefulness of such tests in industry. It shows a correlation between the different types of hardness and also between hardness and other material parameters such as tensile strength. A thorough investigation of the principles involved in the indentation processes using conical and spherical indenters under static and dynamic loading is given so that the reasons for the correlations may be more clearly understood. A series of test specimens tested by conventional static hardness tests (Brinell, Vickers and Rockwell) are used as calibration specimens for the dynamic tester. Both a spherical and conical tip are used. The results of these tests are compared and analyzed. The dynamic tester may then be programmed so that it correlates with the results of the static tests. A set of guidelines for the use of such a portable tester is then given.
Smith, Michael Reed. « An empirical study of instance hardness / ». Diss., CLICK HERE for online access, 2010. http://contentdm.lib.byu.edu/ETD/image/etd3239.pdf.
Texte intégralSmith, Michael Reed. « An Empirical Study of Instance Hardness ». BYU ScholarsArchive, 2009. https://scholarsarchive.byu.edu/etd/2012.
Texte intégralZure, Marina [Verfasser], Jens [Akademischer Betreuer] Harder et Ramsay [Akademischer Betreuer] Paul. « Biogeography of Rhodopirellula in European coastal sediments / Marina Zure. Betreuer : Jens Harder. Gutachter : Jens Harder ; Ramsay Paul ». Bremen : Staats- und Universitätsbibliothek Bremen, 2015. http://d-nb.info/1082343269/34.
Texte intégralPahl, Jürgen [Verfasser], Sjoerd [Akademischer Betreuer] Harder et Sjoerd [Gutachter] Harder. « Lewis Acidic Magnesium Complexes : Development, Synthesis, Characterization and Reactivity / Jürgen Pahl ; Gutachter : Sjoerd Harder ; Betreuer : Sjoerd Harder ». Erlangen : Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2019. http://d-nb.info/1182034713/34.
Texte intégralFischer, Tanja [Verfasser], Jens [Akademischer Betreuer] Harder, Jens [Gutachter] Harder et Rudolf [Gutachter] Amann. « Surface structures and taxonomy of marine Flavobacteriia / Tanja Fischer ; Gutachter : Jens Harder, Rudolf Amann ; Betreuer : Jens Harder ». Bremen : Staats- und Universitätsbibliothek Bremen, 2018. http://d-nb.info/1169299016/34.
Texte intégralElsen, Holger [Verfasser], Sjoerd [Akademischer Betreuer] Harder, Sjoerd [Gutachter] Harder et Ralph [Gutachter] Puchta. « Imine Reduction with Main Group Metal Catalysts / Holger Elsen ; Gutachter : Sjoerd Harder, Ralph Puchta ; Betreuer : Sjoerd Harder ». Erlangen : Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2021. http://d-nb.info/1229194193/34.
Texte intégralHart, Alan D. « THE APPLICATION OF HARDENED CRYSTAL REFERENCE OSCILLATORS INTO THE HARDENED SUBMINIATURE TELEMETRY AND SENSOR SYSTEM (HSTSS) PROGRAM ». International Foundation for Telemetering, 1999. http://hdl.handle.net/10150/608741.
Texte intégralThis paper briefly reports on concepts for hardening (physically toughening) crystal reference oscillators for the highly integrated program known as HSTSS. Within the HSTSS program is the L & S band transmitter development contract. The harshest requirements for this contract are surviving and functioning, to within 20 ppm of its center frequency, 30 ms after sustaining a shock pulse of 100,000 (g) for 0.5 ms on any axis. Additional requirements call for the transmitter to be no larger than 0.2 in3, and to operate within a 20 ppm frequency stability throughout the temperature range of -400 to +850 centigrade and during centrifugal spins of up to 300 Hz or 25,000 (g). Fundamentally the question is, is it feasible for any telemetry system to be capable of withstanding such harsh conditions and, to be practical on all DoD Test Ranges, still adhere to the stability tolerance guidelines set forth by the Range Commanders Council on Telemetry Standards - IRIG 106-96? Under "normal" conditions, stability requirements for "Range" transmitters are easily satisfied through the use of off-the-shelf crystal reference oscillators which provide the reference frequencies required within a transmitter’s phase lock loop circuitry. Unfortunately, the oscillator is also the most vulnerable part of a transmitter to the conditions listed and is the key to this problem. The oscillator’s weak points are in its resonator’s fragile quartz structure (the blank) and support mechanism. The challenge is to invent and adapt this area to these newer harsher conditions and to do it in the smallest space ever required.
Martin, Johannes [Verfasser], Sjoerd [Akademischer Betreuer] Harder, Sjoerd [Gutachter] Harder et Ralph [Gutachter] Puchta. « Alkene Activation and Hydrogenation with Alkaline Earth Metals / Johannes Martin ; Gutachter : Sjoerd Harder, Ralph Puchta ; Betreuer : Sjoerd Harder ». Erlangen : Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2021. http://d-nb.info/1233867474/34.
Texte intégralZhang, JingYing. « Process Optimization for Machining of Hardened Steels ». Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7248.
Texte intégralPang, Thiam-Sun [Verfasser], et Stefan [Akademischer Betreuer] Kebekus. « The Harder-Narasimhan filtrations and rational contractions ». Freiburg : Universität, 2015. http://d-nb.info/1119328241/34.
Texte intégralSchlapobersky, Paul Harry 1966. « Hardness in motion : retrieving Johannesburg after Apartheid ». Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/70353.
Texte intégralIncludes bibliographical references (p. 91-92).
This thesis seeks to engage with the city of Johannesburg on terms that break decisively with the linear-historical methods that have been used to both catalogue and decipher the city up to the present. The city is, itself, in its second incarnation - that of the post-apartheid, post-gold mining metropolis - and the fact of this historic overturning demands reappraisal of what Johannesburg is, and more importantly, what it can become. Its complexities stand in stark opposition to an apparent banality that arises from the ease with which it is visually apprehended. Words form a core of this thesis, used not only in their capacity to reveal through what they say, but through the possibilities created in the spaces between unrelated and related texts (what they do not say). The thesis has thus been concerned with the juxtaposition of words - fiction and non· fiction - as well as their mapping and diagramming, in order to foster new conceptualizations of a city whose blatancy is simultaneously its lifeblood and its problem. The generative words in this context have been those of the thirteen fictions written specifically for the thesis. These stand as a representation of the creative act that is here seen as being fundamental to the re-imagining of Johannesburg; to get beyond the image/face of the city in order to view the human substrata. Additionally, two architectural "provocations" are offered as vehicles for ways in which the city can begin to be re ·imagined . Both of these projects engage with the idea of "absorption" (removal from contingency, to focus on transcendental endeavors), and the notion of the architectural project as a generator, not specifically for what it is, but for what it represents. These architectural projects are, within the context of t he thesis, Brecht's "fragile instruments".
by Paul Harry Schlapobersky.
S.M.
Degwekar, Akshay (Akshay Dhananjai). « Structure vs. hardness through the obfuscation lens ». Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105578.
Texte intégralThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 71-[77]).
Cryptography relies on the computational hardness of structured problems. While one-way functions, the most basic cryptographic object, does not seem to require much structure, as we advance up the ranks into public-key cryptography and beyond, we seem to require that certain structured problems are hard. For example, factoring, quadratic residuosity, discrete logarithms, and approximate shortest and closest vectors in lattices all have considerable algebraic structure. This structure, on the one hand, enables useful applications such as public-key and homomorphic encryption, but on the other, also puts their hardness in question. Their structure is exactly what puts them in low complexity classes such as SZK or NP [set-theoretic intersection symbol] coNP, and is in fact the reason behind (sub-exponential or quantum) algorithms for these problems. The question is whether such structure is inherent in different cryptographic primitives, deeming them inherently easier. We study the relationship between two structured complexity classes, statistical zero-knowledge (SZK) and NP [set-theoretic intersection symbol] coNP, and cryptography. To frame the question in a meaningful way, we rely on the language of black-box constructions and separations. Our results are the following: -- Cryptography vs. Structured Hardness: Our two main results show that there are no black-box constructions of hard problems in SZK or NP [set-theoretic intersection symbol] coNP starting from one of a wide variety of cryptographic primitives such as one-way and trapdoor functions, one-way and trapdoor permutations (in the case of SZK), public-key encryption, oblivious transfer, deniable encryption, functional encryption, and even indistinguishability obfuscation; -- Complexity-theoretic Implications: As a corollary of our result, we show a separation between SZK and NP[set-theoretic intersection symbol]coNP and the class PPAD that captures the complexity of computing Nash Equilibria; and -- Positive Results: We construct collision-resistant hashing from a strong form of SZK-hardness and indistinguishability obfuscation. It was previously known that indistinguishability obfuscation by itself does not imply collision-resistant hashing in a black-box way; we show that it does if one adds SZK-hardness as a "catalyst". Our black-box separations are derived using indistinguishability obfuscation as a "gateway", by first showing a (separation) result for indistinguishability obfuscation and then leveraging on the fact that indistinguishability obfuscation can be used to construct the above variety of cryptographic primitives and hard PPAD instances in a black-box manner.
by Akshay Degwekar.
S.M.
Fretwell, Daniel. « Level p paramodular congruences of Harder type ». Thesis, University of Sheffield, 2015. http://etheses.whiterose.ac.uk/9683/.
Texte intégralHarding, Affeld Martín Ignacio [Verfasser]. « Essays in Macroeconomics / Martín Ignacio Harding Affeld ». Berlin : Freie Universität Berlin, 2020. http://d-nb.info/1215571984/34.
Texte intégralCaldwell, Anita M. « Hard Times Hit Elderly Harder Than Most ». College of Agriculture, University of Arizona (Tucson, AZ), 1993. http://hdl.handle.net/10150/295717.
Texte intégralDanaki, Paraskevi. « Radiation hardness of thin film solar cells ». Thesis, Uppsala universitet, Molekyl- och kondenserade materiens fysik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-386054.
Texte intégralHardee, Bailey Alice Anne. « Effects of Stereotype Threat on Females in Math and Science Fields : An Investigation of Possible Mediators and Moderators of the Threat-Performance Relationship ». Diss., Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-11162004-111432/unrestricted/hardee-bailey%5Falice%5Fa%5F200412%5Fphd.pdf.
Texte intégralAmy Bruckman, Committee Member ; Jack Feldman, Committee Chair ; Dianne Leader, Committee Member ; Larry James, Committee Member ; Ruth Kanfer, Committee Member. Includes bibliographical references.
Frank, Carsten S. [Verfasser], Jens [Akademischer Betreuer] Harder et Rudolf [Akademischer Betreuer] Amann. « Polyphasische Taxonomie, Kerngenom und Lebenszyklus von Rhodopirellula-Stämmen / Carsten S. Frank. Gutachter : Jens Harder ; Rudolf Amann. Betreuer : Jens Harder ». Bremen : Staats- und Universitätsbibliothek Bremen, 2011. http://d-nb.info/1071897888/34.
Texte intégralGentner, Thomas [Verfasser], Sjoerd [Akademischer Betreuer] Harder et Sjoerd [Gutachter] Harder. « Novel Strongly Donating and Superbulky Ligands in s-Block Metal Chemistry / Thomas Gentner ; Gutachter : Sjoerd Harder ; Betreuer : Sjoerd Harder ». Erlangen : Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2019. http://d-nb.info/119199399X/34.
Texte intégralKizina, Jana [Verfasser], Jens [Akademischer Betreuer] [Gutachter] Harder et Rudolf [Gutachter] Amann. « Insights into the biology of Candidate Division OP3 LiM populations / Jana Kizina ; Gutachter : Jens Harder, Rudolf Amann ; Betreuer : Jens Harder ». Bremen : Staats- und Universitätsbibliothek Bremen, 2017. http://d-nb.info/1142314294/34.
Texte intégralPuentes, Cala Edinson Andres [Verfasser], Jens [Akademischer Betreuer] Harder, Jens [Gutachter] Harder et Michael [Gutachter] Friedrich. « The anaerobic monoterpene metabolism in Castellaniella defragrans 65Phen / Edinson Andres Puentes Cala ; Gutachter : Jens Harder, Michael Friedrich ; Betreuer : Jens Harder ». Bremen : Staats- und Universitätsbibliothek Bremen, 2018. http://d-nb.info/1159699895/34.
Texte intégralGuntermann, Bernd [Verfasser], Frank [Akademischer Betreuer] Hardtke, Frank [Gutachter] Hardtke et Olaf [Gutachter] Hohmann. « Das wirtschaftsstrafrechtliche Mandat unter der Strafrechtsschutzversicherung für Unternehmen und Manager / Bernd Guntermann ; Gutachter : Frank Hardtke, Olaf Hohmann ; Betreuer : Frank Hardtke ». Greifswald : Universität Greifswald, 2021. http://d-nb.info/1236693728/34.
Texte intégralTukuta, Marian. « An evaluation of impact of co-operative societies on poverty alleviation among the urban poor in Harare, Zimbabwe during the period 2008-2010 ». Thesis, University of Fort Hare, 2011. http://hdl.handle.net/10353/506.
Texte intégralKuivinen, Fredrik. « Algorithms and Hardness Results for Some Valued CSPs ». Doctoral thesis, Linköpings universitet, TCSLAB - Laboratoriet för teoretisk datalogi, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-51687.
Texte intégralI ett villkorsprogrammeringsproblem är uppgiften att tilldela värden till variabler så att en given mängd villkor blir uppfyllda. Många praktiska problem, så som schemaläggning och planering, kan formuleras som villkorsprogrammeringsproblem och det är därför önskvärt att ha effektiva algoritmer för att hitta lösningar till denna typ av problem. De generella varianterna av dessa problem är NP-svåra att lösa. Detta innebär att det antagligen inte finns effektiva algoritmer för problemen (om inte P = NP vilket anses vara mycket osannolikt). Av denna anledning förenklar vi problemet genom att studera restriktioner av det och ibland nöjer vi oss med approximativa lösningar. I den här avhandlingen studeras två varianter av villkorsprogrammeringsproblemet där man inte bara ska hitta en lösning utan hitta en så bra lösning som möjligt. I den första varianten är målet att hitta en tilldelning där samtliga villkor uppfylls och att en viktad summa av variablerna maximeras. Detta problem kan ses som en generalisering av det välkända linjära heltalsprogrammeringsproblemet. I den andra varianten är målet att hitta en tilldelning som uppfyller så många villkor som möjligt. Då det gäller den första varianten, då man ska hitta en lösning som uppfyller samtliga villkor som också maximerar summan av variablerna, presenteras nya resultat för ett antal specialfall. De så kallade maximala villkorsmängderna studeras och komplexiteten för ett antal av dessa bestäms. Vi studerar också en variant av problemet över den Boolska domänen då antal variabelförekomster är begränsat. I detta fall ger vi en partiell klassifikation över vilka villkorsmängder som är hanterbara och vilka som inte kan lösas effektivt. För den andra varianten, då man ska uppfylla så många villkor som möjligt, presenteras några nya effektiva algoritmer för vissa restriktioner. I dessa algoritmer löses det mer generella problemet av minimering av submodulära funktioner över vissa ändliga latticar. Vi bevisar också ett resultat som beskriver exakt när det finns effektiva algoritmer då man endast har tillgång till en typ av villkor.
Howe, Lisa A. « Spirited Pioneer : The Life of Emma Hardinge Britten ». FIU Digital Commons, 2015. http://digitalcommons.fiu.edu/etd/2292.
Texte intégralZhaojiang, Li. « Hardness characteristics in electrodeposited Cu/Ni multilayer systems ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0020/MQ52687.pdf.
Texte intégralMarcum, Frank. « Analysis of a test technique for hardness surveillance ». Ohio : Ohio University, 1988. http://www.ohiolink.edu/etd/view.cgi?ohiou1182866116.
Texte intégralRaghavan, Satyanarayanan. « Laser-based hybrid process for machining hardened steels ». Thesis, Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/47550.
Texte intégralRichardson, I. G. « The microstructure and composition of hardened cement pastes ». Thesis, University of Oxford, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302868.
Texte intégral