Der U@bersetzungswissenschaftliche Status von Grundbegriffen des frnzo@sischen Verwaltungsrechts

Freitag, Brigitte [s.n.] 1978 국내박사

Entwicklung und Charakterisierung einer Laserstrahlquelle fu@r den interferometrischen Nachweis von Gravitationswellen

Freitag, Ingo Universita@t Hannover 1994 해외박사

The power which raised them from ruin and oppression : James Tod, historiography, and the Rajput ideal (India)

Freitag, Jason Paul Columbia University 2001 국내박사

Methoden zur modellbasierten Diagnose von Systemen mit komplexer Struktur und zeitabh¨angigem Verhalten

Freitag, Hartmut Univ. Hamburg 1993 국내박사

Die reichsgesetzliche Krankenversicherung in ihren Abweichungen vom bisherigen Rechte : Grundprinzipien, Lücken und Mängel des geltenden Rechtes

Freitag, Heinrich Buchdr. W. Sebald 1917 국내석사

MACHINE LEARNING FOR INFORMATION EXTRACTION IN INFORMAL DOMAINS (INDUCTIVE LOGIC)

FREITAG, DAYNE BRIAN CARNEGIE-MELLON UNIVERSITY 1999 해외박사(DDOD)

<italic>Information extraction</italic>, the problem of generating structured summaries of human-oriented text documents, has been studied for over a decade now, but the primary emphasis has been on document collections characterized by well-formed prose (e.g., newswire articles). Solutions have often involved the hand-tuning of general natural language processing systems to a particular domain. However, such solutions may be difficult to apply to “informal” domains, domains based on genres characterized by syntactically unparsable text and frequent out-of-lexicon terms. With the growth of the Internet, such genres, which include email messages, newsgroup posts, and Web pages, are particularly abundant, and there is no lack of potential information extraction applications. Examples include a program to extract names from personal home pages, or a system that monitors newsgroups where computers are offered for sale in search of one that matches a user's specifications. This thesis asks whether it is possible to design general-purpose <italic> machine learning</italic> algorithms for such domains. Rather than spend weeks or months manually adapting an information extraction system to a new domain, we would like a system we can train on some sample documents and expect to do a reasonable job of extracting information from new ones. This thesis poses the following questions: What sorts of machine learning algorithms are suitable for this problem? What kinds of information might a learner exploit in an informal domain? Is there a way to combine heterogeneous learners for improved performance?. This thesis presents four learners representative of a diverse set of machine learning paradigms—a rote learner (<bold>Rote</bold>), a statistical term-space learner based on the Naive Bayes algorithm (<bold>BayesIDF</bold>), a hybrid of <bold>BayesIDF</bold> and the grammatical inference algorithm Alergia (<bold>BayesGI</bold>), and a relational learner (<bold>SRV</bold>). It describes experiments testing these learners on three different document collections—electronic seminar announcements, newswire articles describing corporate acquisitions, and the home pages of courses and research projects at four large computer science departments. Finally, it describes a modular <italic> multistrategy</italic> approach which arbitrates among the individual learners, using regression to re-rank learners' predictions and achieve performance superior to that of the best individual learner on a problem.

Safe(r) queer spaces: A narrative inquirer's study of a school

Freitag, Mel B The University of Wisconsin - Madison 2013 해외박사(DDOD)

Bullying in schools may not be directed specifically to LGBTQ (lesbian, gay, bisexual, transgender, questioning) youth, but many times the reasons for bullying are not just about sexuality-identifiers. This study looked at one school in particular whose mission is to facilitate and create an anti-bullying, inclusive community. Using narrative inquiry, this study uses the students’ and teachers’ voices and stories to build a new definition of what means to be a safe(r) space, and questions if that is even possible. Using DeCerteau’s definition of place and space and Foucault’s heterotopias, it uses critical discourse analysis to analyze how and why these students define their own identities, why the students sought this “city of refuge”, and how the teachers facilitate, support, and listen to the students’ stories. Many of the students claimed that they did not define this as a school, simply because they perhaps felt more comfortable and unrestrained. The students’ bodies, behaviors, dress, language use, and other traits were and are different from the heteronormative structures in place. Therefore, although this school built on anti-bullying policies and practices may not be seen as extreme by those who reside in it and created it, it is necessary to continue to question and interrogate the existing heteronormative, and perhaps oppressive schools from where the students originally came.

Examining communication in college calculus through note taking

Freitag, Mark Alan University of Georgia 2000 해외박사(DDOD)

Decreasing student interest and perceived ability in college mathematics has created increased interest in improving college calculus instruction. Most pedagogical changes have revolved around improving classroom communication. Little is known, however, about the characteristics of communication in calculus and the factors that affect it. One way to study that communication is to examine the record found in the students' notes. This approach motivated the main research question of the study: What are characteristics of note taking in calculus, and what do they reveal about communication in the calculus classroom?. The study was conducted in the spring semester of 1999 at the University of Georgia. Two 3-hour sections of calculus were used and were chosen for the instructors teaching the sections. Seven students agreed to participate: three from one class and four from the other. The students differed in their mathematical experience, levels of ability, and majors. Four methods of data collection were used: instructor interviews, student interviews, document collection, and classroom activities. The classroom activities resulted in researcher notes of the content written on the board, field notes on the use of graphing calculators and the textbook, and audiotapes of the lectures. Data analysis focused on the interviews and documents. The findings revealed three majors areas of note taking: factors affecting note taking, content of notes, and uses of notes. Each category was subdivided into smaller categories. The factors affecting note taking included calculus factors, instructor factors, and student factors. The content in students' notes consisted of definitions, theorems, graphs, diagrams, and sample problems. The content was further divided into two types: content from the board and other content. The study also identified that students use their notes in four ways: as an in-class reference, as a homework aid, as a study aid, and as a reference to share. The findings were used to create a framework for studying communication that expresses the relationships between the major categories and their connection to classroom communication. Implications for research and teaching are given.

How to Provably Leverage Time in Cryptography

Freitag, Cody Cornell University ProQuest Dissertations & Theses 2023 해외박사(DDOD)

Certain fundamental tasks that are provably impossible under standard cryptographic assumptions-ones that are secure against arbitrary polynomial-time attackers-turn out to be possible under time-based assumptions-ones that can be broken in some polynomial, parallel time T but cannot be broken in parallel time T' < T. Most notably, this is the case for the task of generating trusted randomness among a group of parties over the internet, which has received immense renewed interest for its applications in the distributed settings of decentralized blockchains. The goal of this thesis is to build a stronger theoretical foundation for the use of time-based assumptions in cryptography.First, we give new protocols for generating trusted randomness and running sealed-bid auctions using time-lock puzzles-a timed analog of standard cryptographic commitments. To do so, we provide the first formal treatment of non-malleability for time-lock puzzles, which has been extensively studied for plain commitments. We show that fully concurrent non-malleability is impossible to achieve in the timed setting, so we introduce a weaker notion, which we call functional non-malleability, that is both achievable and suffices for our applications.Next, we introduce the notion of a continuous verifiable delay function (CVDF): a function g such that, for every t, the t-wise iteration g(t) of g is a (plain) verifiable delay function. This means that g(t) (on a random input) cannot be computed in parallel time less than t times the time to compute g, and the output of g(t) can be efficiently verified (in time essentially independent of t). We show that CVDFs imply public randomness beacons and hard-on-average instances for the complexity class PPAD (for which finding Nash equilibria is a complete problem). We construct CVDFs from the time-based repeated squaring assumption, and the soundness of the Fiat-Shamir heuristic for constant round proofs.Finally, we study tradeoffs in the complexity of proofs for the repeated squaring relation, which are one of the main tools used in practical time-based cryptographic applications. We consider non-interactive proofs for the relation y? = x2T mod N for an RSA modulus N, where the verifier has generic access to the input group elements x, y and at most k group elements sent by the prover. We show that any such (statistically sound) non-interactive proof of repeating squaring either (A) has verification time Ω(T/(k+1)) for a proof with k ≥ 0 group elements, or (B) leaks the factorization of N.

Stress evolution in molybdenum/silicon multilayer mirrors for extreme ultraviolet lithography

Freitag, James Mac Stanford University 2000 해외박사(DDOD)

The continued shrinking of microelectronic device size necessitates advances in lithography, including possibly using extreme ultraviolet (EUV) light. The Mo/Si multilayer system is a promising candidate for reflective optics at a wavelength of roughly 135 Å. However, these multilayers manifest high compressive stresses of approximately −350 MPa, which cause unacceptable distortion of the optical element. The goal of this project was to develop fundamental understanding of the origins of stress during growth of Mo/Si multilayers. A 40-bilayer structure deposited by DC-magnetron sputtering yielded a peak reflectivity of 65.7% at a wavelength of 136 Å. We collected the stress data during deposition by <italic>in situ</italic> substrate curvature measurements using a multiple parallel laser beam technique. We measured large tensile and compressive curvature transients during initial growth of Mo on Si and Si on Mo. However, by sputtering with Kr rather than conventional Ar, it is possible to suppress the compressive transient upon Si deposition and thereby redress the compressive stress. Evidence implies that intermixing and alloying at the Mo-Si interfaces by asymmetric Si diffusion cause the transients. Indeed, Mo/Si multilayers sputtered with Kr exhibit less intermixing and high EUV reflectivity. However, the roughness of the multilayer may limit reflectivity and we therefore compare the roughness of Kr- and Ar-sputtered multilayers. Roughness, which leads to nonspecular scattering is problematic for EUV imaging systems because it decreases the useful throughput of a lithography system. We used x-ray diffraction to characterize the evolution of roughness with increasing number of bilayers in Mo/Si multilayers sputtered by Ar and Kr. By fitting a self-affine model of roughness to the diffuse spectra, we extracted the roughness and in-plane correlation lengths. We find that the lateral length scale of the roughness increases with the number of bilayers; however, the magnitude of the roughness, approximately 2 Å or Ar- and Kr-sputtered samples, remains constant, contrary to the scaling law prediction. This discrepancy is ascribed to the smoothing effect of the amorphous interfaces which tends to flatten only the high-frequency components of roughness and preserves the conformal, layer to layer roughness replication.