Dissertationen: „Methods“

1

Kleditzsch, Stefan, und Birgit Awiszus. „Modeling of Cylindrical Flow Forming Processes with Numerical and Elementary Methods“. Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-97124.

Der volle Inhalt der Quelle

Annotation:

With flow forming – an incremental forming process – the final geometry of a component is achieved by a multitude of minor sequential forming steps. Due to this incremental characteristic associated with the variable application of the tools and kinematic shape forming, it is mainly suitable for small and medium quantities. For the extensive use of the process it is necessary to have appropriate simulation tools. While the Finite-Element-Analysis (FEA) is an acknowledged simulation tool for the modeling and optimization of forming technology, the use of FEA for the incremental forming processes is associated with very long computation times. For this reason a simulation method called FloSim, based on the upper bound method, was developed for cylindrical flow forming processes at the Chair of Virtual Production Engineering, which allows the simulation of the process within a few minutes. This method was improved by the work presented with the possibility of geometry computation during the process.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Of, Günther, Gregory J. Rodin, Olaf Steinbach und Matthias Taus. „Coupling Methods for Interior Penalty Discontinuous Galerkin Finite Element Methods and Boundary Element Methods“. Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-96885.

Der volle Inhalt der Quelle

Annotation:

This paper presents three new coupling methods for interior penalty discontinuous Galerkin finite element methods and boundary element methods. The new methods allow one to use discontinuous basis functions on the interface between the subdomains represented by the finite element and boundary element methods. This feature is particularly important when discontinuous Galerkin finite element methods are used. Error and stability analysis is presented for some of the methods. Numerical examples suggest that all three methods exhibit very similar convergence properties, consistent with available theoretical results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Ganti, Satyakala. „DEVELOPMENT OF HPLC METHODS FOR PHARMACEUTICALLY RELEVANT MOLECULES; METHOD TRANSFER TO UPLC: COMPARING METHODS STATISTICALLY FOR EQUIVALENCE“. Diss., Temple University Libraries, 2011. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/118587.

Der volle Inhalt der Quelle

Annotation:

Chemistry
Ph.D.
High Pressure Liquid Chromatography (HPLC) is a well-known and widely used analytical technique which is prevalent throughout the pharmaceutical industry as a research tool. Despite its prominence HPLC possesses some disadvantages, most notably slow analysis time and large consumption of organic solvents. Ultra Pressure Liquid Chromatography (UPLC) is a relatively new technique which offers the same separation capabilities of HPLC with the added benefits of reduced run time and lower solvent consumption. One of the key developments which facilitate the new UPLC technology is sub 2-µm particles used as column packing material. These particles allow for higher operating pressures and increased flow rates while still providing strong separation. Although UPLC technology has been available since early 2000, few laboratories have embraced the new technology as an alternative to HPLC. Besides the resistance to investing in new capital, another major roadblock is converting existing HPLC methodology to UPLC without disruption. This research provides a framework for converting existing HPLC methods to UPLC. An existing HPLC method for analysis of Galantamine hydrobromide was converted to UPLC and validated according to ICH guidelines. A series of statistical evaluations on the validation data were performed to prove the equivalency between the original HPLC and the new UPLC method. This research presents this novel statistical strategy which can be applied to any two methodologies to determine parity.
Temple University--Theses

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Money, James H. „Variational methods for image deblurring and discretized Picard's method“. Lexington, Ky. : [University of Kentucky Libraries], 2006. http://lib.uky.edu/ETD/ukymath2006d00415/DISSERT.PDF.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--University of Kentucky, 2006.
Title from document title page (viewed on May 31, 2006). Document formatted into pages; contains x, 97 p. : ill. (some col.). Includes abstract and vita. Includes bibliographical references (p. 90-96).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Hallgrímsson, Guðmundur. „The implementation, adaptation, and use of the Rational Unified Process at Volvo Information Technology : a case study“. Thesis, University of Skövde, Department of Computer Science, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-657.

Der volle Inhalt der Quelle

Annotation:

The use of systems development methods are, by many, seen as the way to solve development problems, decrease development time, and improve the quality of software systems. Despite this, little is known about how development methods are actually used in the software industry. The aim of this project is to investigate how a widespread development method is implemented and used in an organisational setting.

The result of this project is a case study description of how Volvo Information Technology implements, adapts, and uses the commercial development method Rational Unified Process® (RUP®) in combination with other methods. The implementation is centrally administered and done incrementally over several years in order to build competence in the organisation. RUP is also adapted to the specific situation of the organisation, each division, each development project, and even adapted by individual developers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Miller, Jean Anne. „Naturalism & Objectivity: Methods and Meta-methods“. Diss., Virginia Tech, 2008. http://hdl.handle.net/10919/28329.

Der volle Inhalt der Quelle

Annotation:

The error statistical account provides a basic account of evidence and inference. Formally, the approach is a re-interpretation of standard frequentist (Fisherian, Neyman-Pearson) statistics. Informally, it gives an account of inductive inference based on arguing from error, an analog of frequentist statistics, which keeps the concept of error probabilities central to the evaluation of inferences and evidence. Error statistical work at present tends to remain distinct from other approaches of naturalism and social epistemology in philosophy of science and, more generally, Science and Technology Studies (STS). My goal is to employ the error statistical program in order to address a number of problems to approaches in philosophy of science, which fall under two broad headings: (1) naturalistic philosophy of science and (2) social epistemology. The naturalistic approaches that I am interested in looking at seek to provide us with an account of scientific and meta-scientific methodologies that will avoid extreme skepticism, relativism and subjectivity and claim to teach us something about scientific inferences and evidence produced by experiments (broadly construed). I argue that these accounts fail to identify a satisfactory program for achieving those goals and; moreover, to the extent that they succeed it is by latching on to the more general principles and arguments from error statistics. In sum, I will apply the basic ideas from error statistics and use them to examine (and improve upon) an area to which they have not yet been applied, namely in assessing and pushing forward these interdisciplinary pursuits involving naturalistic philosophies of science that appeal to cognitive science, psychology, the scientific record and a variety of social epistemologies.
Ph. D.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Neuman, Arthur James III. „Regularization Methods for Ill-posed Problems“. Kent State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=kent1273611079.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Wistrand, Kai. „Method rationale revealed : communication of knowledge in systems development methods“. Doctoral thesis, Örebro universitet, Handelshögskolan vid Örebro universitet, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-6180.

Der volle Inhalt der Quelle

Annotation:

The practice of developing information systems with the support of information systems development methods is not new. A vast number of systems development methods have been suggested over the years in an attempt to solve the problems a development organisation might encounter. From early approaches like the Waterfall model to more modern monolithic methods such as the Rational Unified Process and the newest approaches exemplified in the Agile methods, the ambition has often been to find the silver bullet and the most effective ways to produce quality systems. Methods are prescriptive by nature as they suggest action and as such they represent rationale. Thus, one can speak of a method rationale as the dimension within methods that motivate their existence. Method rationale is understood as the goal and value rational relations between a method’s underlying philosophy and its proposed actions. During the methods’ evolution, the practice of systems development and the supporting systems development methods have been subjected to research from many perspectives. One possible way to understand the nature of the existing research is to separate it into two fields. The suggested fields have different strengths and weaknesses. The field of traditional research on information systems development (ISD) emphasise relevance in their studies but often overlook aspects of generalisation. The field of method engineering (ME) is highly formalistic and emphasise rigour but often miss aspects concerning relevance, such as the role methods play in peoples daily systems development efforts. In this dissertation, a polarisation of existing systems development method research is suggested in order to find a synthesis more capable of serving as a common ground for method research and for the understanding of the systems development method phenomenon. This is achieved through a proposed extension of the field of ME into the field of extended method engineering (EME). The foundation of the EME is found in the concept of method rationale and a method component concept design capable of carrying and expressing method rationale. The method component concept design is applied, evaluated, and re-designed in three different empirical settings in order to ascertain its practical potential and the benefits in explicating the dimension of method rationale.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Rothauge, Kai. „The discrete adjoint method for high-order time-stepping methods“. Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/60285.

Der volle Inhalt der Quelle

Annotation:

This thesis examines the derivation and implementation of the discrete adjoint method for several time-stepping methods. Our results are important for gradient-based numerical optimization in the context of large-scale model calibration problems that are constrained by nonlinear time-dependent PDEs. To this end, we discuss finding the gradient and the action of the Hessian of the data misfit function with respect to three sets of parameters: model parameters, source parameters and the initial condition. We also discuss the closely related topic of computing the action of the sensitivity matrix on a vector, which is required when performing a sensitivity analysis. The gradient and Hessian of the data misfit function with respect to these parameters requires the derivatives of the misfit with respect to the simulated data, and we give the procedures for computing these derivatives for several data misfit functions that are of use in seismic imaging and elsewhere. The methods we consider can be divided into two categories, linear multistep (LM) methods and Runge-Kutta (RK) methods, and several variants of these are discussed. Regular LM and RK methods can be used for ODE systems arising from the semi-discretization of general nonlinear time-dependent PDEs, whereas implicit-explicit and staggered variants can be applied when the PDE has a more specialized form. Exponential time-differencing RK methods are also discussed. The implementation of the associated adjoint time-stepping methods is discussed in detail. Our motivation is the application of the discrete adjoint method to high-order time-stepping methods, but the approach taken here does not exclude lower-order methods. All of the algorithms have been implemented in MATLAB using an object-oriented design and are written with extensibility in mind. For exponential RK methods it is illustrated numerically that the adjoint methods have the same order of accuracy as their corresponding forward methods, and for linear PDEs we give a simple proof that this must always be the case. The applicability of some of the methods developed here to pattern formation problems is demonstrated using the Swift-Hohenberg model.
Science, Faculty of
Mathematics, Department of
Graduate

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Hazelton, Martin Luke. „Method of density estimation with application to Monte Carlo methods“. Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334850.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Mabogo, Mbavhalelo. „Development of techniques using finite element and meshless methods for the simulation of piercing“. Thesis, [S.l. : s.n.], 2009. http://dk.cput.ac.za/cgi/viewcontent.cgi?article=1056&context=td_cput.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Bai, Yang, und 柏楊. „Statistical analysis for longitudinal data“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B42841756.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Chen, Ailian. „Combinatorial methods and probabilistic methods in graph theory“. Paris 11, 2008. http://www.theses.fr/2008PA112101.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Karelius, Fanny. „Stationary iterative methods : Five methods and illustrative examples“. Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-69711.

Der volle Inhalt der Quelle

Annotation:

Systems of large sparse linear equations frequently arise in engineering and science. Therefore, there is a great need for methods that can solve these systems. In this thesis we will present three of the earliest and simplest iterative methods and also look at two more sophisticated methods. We will study their rate of convergence and illustrate them with examples.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Asafu-Adjei, Joseph Kwaku. „Probabilistic Methods“. VCU Scholars Compass, 2007. http://hdl.handle.net/10156/1420.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Zozulia, I. Ye, und І. Є. Зозуля. „Methods and techniques used in Ukrainian language teaching interactive technologies (practical experience)“. Thesis, Leipzig University, 2018. http://ir.lib.vntu.edu.ua//handle/123456789/23179.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Yan, Shu. „Efficient numerical methods for capacitance extraction based on boundary element method“. Texas A&M University, 2005. http://hdl.handle.net/1969.1/3230.

Der volle Inhalt der Quelle

Annotation:

Fast and accurate solvers for capacitance extraction are needed by the VLSI industry in order to achieve good design quality in feasible time. With the development of technology, this demand is increasing dramatically. Three-dimensional capacitance extraction algorithms are desired due to their high accuracy. However, the present 3D algorithms are slow and thus their application is limited. In this dissertation, we present several novel techniques to significantly speed up capacitance extraction algorithms based on boundary element methods (BEM) and to compute the capacitance extraction in the presence of floating dummy conductors. We propose the PHiCap algorithm, which is based on a hierarchical refinement algorithm and the wavelet transform. Unlike traditional algorithms which result in dense linear systems, PHiCap converts the coefficient matrix in capacitance extraction problems to a sparse linear system. PHiCap solves the sparse linear system iteratively, with much faster convergence, using an efficient preconditioning technique. We also propose a variant of PHiCap in which the capacitances are solved for directly from a very small linear system. This small system is derived from the original large linear system by reordering the wavelet basis functions and computing an approximate LU factorization. We named the algorithm RedCap. To our knowledge, RedCap is the first capacitance extraction algorithm based on BEM that uses a direct method to solve a reduced linear system. In the presence of floating dummy conductors, the equivalent capacitances among regular conductors are required. For floating dummy conductors, the potential is unknown and the total charge is zero. We embed these requirements into the extraction linear system. Thus, the equivalent capacitance matrix is solved directly. The number of system solves needed is equal to the number of regular conductors. Based on a sensitivity analysis, we propose the selective coefficient enhancement method for increasing the accuracy of selected coupling or self-capacitances with only a small increase in the overall computation time. This method is desirable for applications, such as crosstalk and signal integrity analysis, where the coupling capacitances between some conductors needs high accuracy. We also propose the variable order multipole method which enhances the overall accuracy without raising the overall multipole expansion order. Finally, we apply the multigrid method to capacitance extraction to solve the linear system faster. We present experimental results to show that the techniques are significantly more efficient in comparison to existing techniques.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Breslavsky, D. V., V. O. Mietielov, O. K. Morachkovsky, S. O. Pashchenko und О. А. Tatarinova. „Asymptotic methods and finite element method in cyclic creep-damage problems“. Thesis, Львівський національний університет ім. І. Франка, 2015. http://repository.kpi.kharkov.ua/handle/KhPI-Press/19395.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

DI, RIENZO ANTONIO FABIO. „Mesoscopic Numerical Methods for Reactive Flows: Lattice Boltzmann Method and Beyond“. Doctoral thesis, Politecnico di Torino, 2012. http://hdl.handle.net/11583/2497051.

Der volle Inhalt der Quelle

Annotation:

Reactive flows are ubiquitous in several energy systems: internal combustion engines, industrial burners, gas turbine combustors. Numerical modeling of reactive flows is a key tool for the development of such systems. However, computational combustion is a challenging task per se. It generally includes different coupled physical and chemical processes. A single model can come to deal with simultaneous processes: turbulent mixing, multi-phase fluid-dynamics, radiative heat transfer, and chemical kinetics. It is required not only of mathematically representing these processes and coupling them to each other, but also of being numerical efficient. In some applications, the numerical model needs to be able to deal with different length scales. For instance, a continuum approach to reactive flows in porous media burners is not adequate: processes occurring at the pore-scale are not taken into account properly. It is therefore fundamental to have numerical methods able to capture phenomena at the microscopic scales and incorporate the effects in the macroscopic scale. The lattice Boltzmann method (LBM), a relatively new numerical method in computational fluid-dynamics (CFD), summarizes the requirements of numerical efficiency and potential to relate micro-and macro-scale. However, despite these features and the recent developments, application of LBM to combustion problems is limited and hence further improvements are required. In this thesis, we explore the suitability of LBM for combustion problems and extend its capabilities. The first key-issue in modeling reactive flows is represented by the fact that the model has to be able to handle the significant density and temperature changes that are tipically encountered in combustion. A recently proposed LBM model for compressible thermal flows is extended to simulate reactive flows at the low Mach number regime. This thermal model is coupled with the mass conservation equations of the chemical species. Also in this case a model able to deal with compressibility effects is derived. To this purpose, we propose a new scheme for solving the reaction-diffusion equations of chemical species where compressibility is accounted for by simply modifying the equilibrium distribution function and the relaxation frequency of models already available in the literature. This extension enables one to apply LBM to a wide range of combustion phenomena, which were not properly adressed so far. The effectiveness of this approach is proved by simulating combustion of hydrogen/air mixtures in a mesoscale channel. Validation against reference numerical solution in the continuum limit are also presented. An adequate treatment of thermal radiation is important to develop a mathematical model of combustion systems. In fact, combustion incorporates also radiation process, which tends to plays a significant role if high temperatures (and solid opaque particles) are involved. In the thesis a LBM model for radiation is presented. The scheme is derived from the radiative transfer equation for a participating medium, assuming isotropic scattering and radiative equilibrium condition. The azimuthal angle is discretized according to the lattice velocities on the computational plane, whereas an additional component of the discrete velocity normal to the plane is introduced to discretize the polar angle. The radiative LBM is used to solve a two-dimensional square enclosure bechmark problem. Validation of the model is carried out by investigating the effects of the spatial and angular discretizations and extinction coefficient on the solution. To this purpose, LBM results are compared against reference solutions obtained by means of standard Finite Volume Method (FVM). Extensive error analysis and the order of convergence of the scheme are also reported in the thesis. In order to extend the capabilities of LBM and make it more efficient in the simulation of reactive flows, in this thesis a new formulation is presented, referred to as Link-wise Artificial Compressibility Method (LW-ACM). The Artificial Compressibility Method (ACM) is (link-wise) formulated by a finite set of discrete directions (links) on a regular Cartesian grid, in analogy with LBM. The main advantage is the possibility of exploiting well established technologies originally developed for LBM and classical computational fluid dynamics, with special emphasis on finite differences, at the cost of minor changes. For instance, wall boundaries not aligned with the background Cartesian mesh can be taken into account by tracing the intersections of each link with the wall (analogously to LBM technology). LW-ACM requires no high-order moments beyond hydrodynamics (often referred to as ghost moments) and no kinetic expansion. Like finite difference schemes, only standard Taylor expansion is needed for analyzing consistency. Preliminary efforts towards optimal implementations have shown that LW-ACM is capable of similar computational speed as optimized (BGK-) LBM. In addition, the memory demand is significantly smaller than (BGK-) LBM. Two- and three-dimensional benchmarks are investigated, and an extensive comparative study between solutions obtained through FVM. Numerical evidences suggest that LW-ACM represents an excellent alternative in terms of simplicity, stability and accuracy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Ollonqvist, K. (Kalle). „Moving from traditional software development methods to agile methods“. Bachelor's thesis, University of Oulu, 2018. http://urn.fi/URN:NBN:fi:oulu-201806092553.

Der volle Inhalt der Quelle

Annotation:

In this literature review, using existing research and sources, benefits and challenges of agile software development methods were discussed. Agile methods were also compared to traditional software development methods. Agile was defined and its four points of value were listed. This provided a basis for discussing the benefits and challenges of agile compared to the traditional software development methods. Customer involvement was found to have a positive effect on customer satisfaction in agile. The development team that was using agile as their development method was able to deliver something of value for the customer faster. This was useful if the company had to race to market. However, a software project that was developed with waterfall was found to be more predictable, especially if the development team was experienced. This was in part due to the customer not being able to change the requirements of the product they had ordered, and in part of the progressive or onward-moving development process typical to waterfall. Also, planning is a big part of waterfall development and it affects the predictability and measurability of the project as well. One of the biggest challenges when moving to agile from a traditional development method was changing the fundamental mindset of the people working in the organization. Especially the management-style needed to change from command-and-control management to leadership-and-collaboration. One of the challenges was that customer involvement might become a burden if the customer is continuously changing the requirements. Moving to agile from a traditional development method is not easy and it could lead to adding more sprints to the software development process than was planned.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Al-Ogaili, Rasha, und Zaid Al-Ogaili. „A Study on the Transition of the Adaptive into Responsive Web Design Methods on Smart Devices“. Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-61204.

Der volle Inhalt der Quelle

Annotation:

In the fast-paced technological revolution, technology has formed itself differently to facilitate the way to users to get their needs. As a matter of fact, people nowadays rely to a great extent on the smart devices as one of the essential creations of technology. They tend to access any website or web-application(s) through these devices fast and easily. Thus, paying enough attention to the design of any website or web-application is a major issue. This thesis project discusses the Responsive and Adaptive Design Methods as two important methods in terms of Websites and Web-Design. The methods have been theoretically discussed and explained to present the essential differences between them. Moreover, MyMusiC website has been implemented to show the differences between these methods practically. The prominent difference between the Responsive and Adaptive de-signs of the website makes it easy for the users to figure out the difference between the two design methods in terms of accessibility and ease of navigation. The results showed that the Responsive design is more user-friendly and more preferred by the users than the Adaptive design, as the users tend to use their smart devices first when they want to access a website than the computers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Raden, Martin [Verfasser], und Rolf [Akademischer Betreuer] Backofen. „Computational Methods for Lattice Protein Models = Rechnerische Methoden für Gitterproteinmodelle“. Freiburg : Universität, 2011. http://d-nb.info/1114828939/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Mansour, Nabil S. „Inclusion of electron-plasmon interactions in ensemble Monte Carlo simulations of degerate GaAs“. Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/13862.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Synn, Sang-Youp. „Practical domain decomposition approaches for parallel finite element analysis“. Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/17032.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Zhdanova, Tetiana. „Methods of Teaching a Foreign Language in a High School“. Thesis, ХНМУ, 2016. http://repo.knmu.edu.ua/handle/123456789/13706.

Der volle Inhalt der Quelle

Annotation:

Pedagogical skills of teachers require not only knowledge of their subject, but also ability to apply methods and techniques of teaching. Methods of teaching foreign languages are associated with the level of development of society, science, technology and culture.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Schabert, Werner Ernst. „Adaptive multilevel methods for mortar edge element methods in R3“. [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980851807.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Madsen, Sabine. „Emerging methods : an interpretive study of ISD methods in practice /“. København, 2004. http://www.gbv.de/dms/zbw/476259614.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Mishchenko, Natalia. „Analysis of production methods and industril methods of streptomycin production“. Thesis, National Aviation University, 2021. https://er.nau.edu.ua/handle/NAU/50641.

Der volle Inhalt der Quelle

Annotation:

1. Wainwright M. Streptomycin: discovery and resultant controversy. Hist Philos Life Sci. 1991. Vol. 13 (1). P. 97–124. 2. World Health Organization. Critically important antimicrobials for human medicine, 6th revision. Geneva: World Health Organization. 2019. 45 p.
The purpose of the study: to analyze the methods of obtaining streptomycin. Relevance of the study: streptomycin is a drug that is widely used in industry, so it is advisable to analyze the production of streptomycin. Task: to analyze the methods of production and industrial methods of streptomycin production.
Актуальність дослідження: стрептоміцин - це препарат, який широко використовується в промисловості, тому доцільно аналізувати виробництво стрептоміцину. Завдання: Проаналізувати методи виробництва та промислових методів виробництва стрептоміцину.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Fritsch, Jon Eric. „Did Harriet Martineau's sociological methods influence Emile Durkheim's sociological methods?“ Thesis, Virginia Tech, 1995. http://hdl.handle.net/10919/42142.

Der volle Inhalt der Quelle

Annotation:

Harriet Martineau (1802-1876) published How to Observe Morals and Manners in 1838. The book was perhaps the first sociological methodology text. Emile Durkheim (1855-1917) published The Rules of Sociological Method (1895) 57 years later. Durkheim's book has traditionally been labeled as the first sociological methodology text, while Martineau's book has been virtually forgotten by modern day sociologists.

The author identifies significant similarities between the two texts and investigates the possibility that the work of Martineau influenced Durkheim. This work explores the life an important figure in nineteenth century European culture and argues that Martineau's name should be reinserted into the history of sociology. The ideas contained in, and the construction of, How to Observe Morals and Manners are discussed.

Master of Science

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Hamed, Maien Mohamed Osman. „On meshless methods : a novel interpolatory method and a GPU-accelerated implementation“. Thesis, Nelson Mandela Metropolitan University, 2013. http://hdl.handle.net/10948/d1018227.

Der volle Inhalt der Quelle

Annotation:

Meshless methods have been developed to avoid the numerical burden imposed by meshing in the Finite Element Method. Such methods are especially attrac- tive in problems that require repeated updates to the mesh, such as problems with discontinuities or large geometrical deformations. Although meshing is not required for solving problems with meshless methods, the use of meshless methods gives rise to different challenges. One of the main challenges associated with meshless methods is imposition of essential boundary conditions. If exact interpolants are used as shape functions in a meshless method, imposing essen- tial boundary conditions can be done in the same way as the Finite Element Method. Another attractive feature of meshless methods is that their use involves compu- tations that are largely independent from one another. This makes them suitable for implementation to run on highly parallel computing systems. Highly par- allel computing has become widely available with the introduction of software development tools that enable developing general-purpose programs that run on Graphics Processing Units. In the current work, the Moving Regularized Interpolation method has been de- veloped, which is a novel method of constructing meshless shape functions that achieve exact interpolation. The method is demonstrated in data interpolation and in partial differential equations. In addition, an implementation of the Element-Free Galerkin method has been written to run on a Graphics Processing Unit. The implementation is described and its performance is compared to that of a similar implementation that does not make use of the Graphics Processing Unit.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Rönkkö, Kari. „Making methods work in software engineering : method deployment - as a social achievement /“. Karlskrona : School of Engineering, Blekinge Institute of Technology, 2005. http://www.bth.se/fou/forskinfo.nsf/allfirst2/0878763dec04da60c125702000247cbf?OpenDocument.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Rönkkö, Kari. „Making Methods Work in Software Engineering : Method Deployment - as a Social Achievement“. Doctoral thesis, Ronneby : Blekinge Institute of Technology, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00264.

Der volle Inhalt der Quelle

Annotation:

The software engineering community is concerned with improvements in existing methods and development of new and better methods. The research approaches applied to take on this challenge have hitherto focused heavily on the formal and specifying aspect of the method. This has been done for good reasons, because formalizations are the means in software projects to predict, plan, and regulate the development efforts. As formalizations have been successfully developed new challenges have been recognized. The human and social role in software development has been identified as the next area that needs to be addressed. Organizational problems need to be solved if continued progress is to be made in the field. The social element is today a little explored area in software engineering. Following with the increased interest in the social element it has been identified a need of new research approaches suitable for the study of human behaviour. The one sided focus on formalizations has had the consequence that concepts and explanation models available in the community are one sided related in method discourses. Definition of method is little explored in the software engineering community. In relation to identified definitions of method the social appears to blurring. Today the software engineering community lacks powerful concepts and explanation models explaining the social element. This thesis approaches the understanding of the social element in software engineering by applying ethnomethodologically informed ethnography and ethnography. It is demonstrated how the ethnographic inquiry contributes to software engineering. Ethnography is also combined with an industrial cooperative method development approach. The results presented demonstrate how industrial external and internal socio political contingencies both hindered a method implementation, as well as solved what the method was targeted to do. It is also presented how project members’ method deployment - as a social achievement is played out in practice. In relation to this latter contribution it is provided a conceptual apparatus and explanation model borrowed from social science, The Documentary method of interpretation. This model addresses core features in the social element from a natural language point of view that is of importance in method engineering. This model provides a coherent complement to an existing method definition emphasizing formalizations. This explanation model has also constituted the underpinning in research methodology that made possible the concrete study results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Lee, Michael James. „Methods in Percolation“. Thesis, University of Canterbury. Physics and Astronomy, 2008. http://hdl.handle.net/10092/2365.

Der volle Inhalt der Quelle

Annotation:

Algorithms are presented for the computationally efficient manipulation of graphs. These are subsequently used as the basis of a Monte Carlo method for sampling from the microcanonical ensemble of lattice configurations of a percolation model within a neighbourhood of the critical point. This new method arbitrarily increments and decrements the number of occupied lattice sites, and is shown to be a generalisation of several earlier, purely incremental, methods. As demonstrations of capability, the method was used to construct a phase diagram for exciton transport on a disordered surface, and to study finite size effects upon the incipient spanning cluster. Application of the method to the classical site percolation model on the two-dimensional square lattice resulted in an exceptionally precise estimate of the critical threshold. Although this estimate is not in agreement with earlier results, its accuracy was established through an application specific test of randomness, which is also introduced here. The same test suggests that many earlier results have been systematically biased due to the use of deficient pseudorandom number generators. The estimate made here has since been independently confirmed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Nikazad, Touraj. „Algebraic Reconstruction Methods“. Doctoral thesis, Linköping : Linköpings universitet, Department of Mathematics Scientific Computing, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11670.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Shoilekova, Bilyana Todorova. „Graphical enumeration methods“. Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526538.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Lawton, Richard. „Exponential smoothing methods“. Thesis, University of Bath, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340928.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Boys, Richard James. „Predictive screening methods“. Thesis, University of Sheffield, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285045.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Sivia, Devinderjit Singh. „Phase extension methods“. Thesis, University of Cambridge, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.254215.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Dunne, G. V. „Methods of quantization“. Thesis, Imperial College London, 1988. http://hdl.handle.net/10044/1/47039.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Cao, Ruanmin. „Alternative portfolio methods“. Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/5807/.

Der volle Inhalt der Quelle

Annotation:

Portfolio optimization in an uncertain environment has great practical value in investment decision process. But this area is highly fragmented due to fast evolution of market structure and changing investor behavior. In this dissertation, four methods are investigated/designed to explore their efficiency under different circumstances. Parametric portfolio decomposes weights by set of factors whose coefficients are uniquely determined via maximizing utility function. A robust bootstrap method is proposed to assist factor selection. If investors exhibit asymmetric aversion of tail risk, pessimistic models on Choquet utility maximization and coherent risk measures acquire superiority. A new hybrid method that inherits advantage of parameterization and tail risk minimization is designed. Mean-variance, which is optimal with elliptical return distribution, should be employed in the case of capital allocation to trading strategies. Nonparametric classifiers may enhance homogeneity of inputs before feeding the optimizer. Traditional factor portfolio can be extended to functional settings by applying FPCA to return curves sorted by factors. Diversification is always achieved by mixing with detected nonlinear components. This research contributes to existing literature on portfolio choice in three-folds: strength and weakness of each method is clarified; new models that outperform traditional approaches are developed; empirical studies are used to facilitate comparison.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Ajdler, Arnaud 1975. „Iconic authentication methods“. Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/80621.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Rudd, Ralph. „Optimal tree methods“. Master's thesis, University of Cape Town, 2014. http://hdl.handle.net/11427/8567.

Der volle Inhalt der Quelle

Annotation:

Includes bibliographical references.
Although traditional tree methods are the simplest numerical methods for option pricing, much work remains to be done regarding their optimal parameterization and construction. This work examines the parameterization of traditional tree methods as well as the techniques commonly used to accelerate their convergence. The performance of selected, accelerated binomial and trinomial trees is then compared to an advanced tree method, Figlewski and Gao's Adaptive Mesh Model, when pricing an American put and a Down-And-Out barrier option.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Nishantha, Hewamarappulige Indunil. „Powder Diffraction Methods“. The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1222116031.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Olson, Kaila L. „Body Composition Methods“. The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555412102811725.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Hall, Katherine C. „Didactic Evaluation Methods“. Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etsu-works/8290.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Au, Kelly Thurston. „Inexact subgradient methods“. Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185857.

Der volle Inhalt der Quelle

Annotation:

In solving a mathematical program, the exact evaluation of the objective function and its subgradients can be computationally burdensome. For example, in a stochastic program, the objective function is typically defined through a multi-dimensional integration. Solution procedures for stochastic programs are usually based on functional approximation techniques, or statistical applications of subgradient methods. In this dissertation, we explore algorithms by combining functional approximation techniques with subgradient optimization methods. This class of algorithms is referred to as "inexact subgradient methods". First, we develop a basic inexact subgradient method and identify conditions under which this approach will lead to an optimal solution. We also offer an inexact subgradient algorithm by adaptively defining the steplengths via estimated bounds on the deviations from optimality. Second, we explore approaches in which functional approximation techniques can be combined with a primal-dual subgradient method. In these algorithms, the steplengths are defined via the primal and dual information. Hence suggestions to optimality can be reflected through the steplengths, as the iteration proceeds. We also incorporate space dilation operations, which stabilize the moving directions, within our basic inexact subgradient method. As an example of the applicability of these methods, we use statistically defined approximations, which are similar to those derived in Stochastic Decomposition, in some of our algorithms for the solutions of stochastic programs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Sutton, Oliver James. „Virtual Element Methods“. Thesis, University of Leicester, 2017. http://hdl.handle.net/2381/39955.

Der volle Inhalt der Quelle

Annotation:

In this thesis we study the Virtual Element Method, a recent generalisation of the standard conforming Finite Element Method offering high order approximation spaces on computational meshes consisting of general polygonal or polyhedral elements. Our particular focus is on developing the tools required to use the method as the foundation of mesh adaptive algorithms which are able to take advantage of the flexibility offered by such general meshes. We design virtual element discretisations of certain classes of linear second order elliptic and parabolic partial differential equations, and present a detailed exposition of their implementation aspects. An outcome of this is a concise and usable 50-line MATLAB implementation of a virtual element method for solving a model elliptic problem on general polygonal meshes, the code for which is included as an appendix. Optimal order convergence rates in the H1 and L2 norms are proven for the discretisation of elliptic problems. Alongside these, we derive fully computable residual-type a posteriori estimates of the error measured in the H1 and L2 norms for the methods we develop for elliptic problems, and in the L2(0; T;H1) and L∞(0; T;L2) norms for parabolic problems. In deriving the L∞(0; T;L2) error estimate, we introduce a new technique (which translates naturally back into the setting of conventional finite element methods) to produce estimates with effectivities which become constant for long time simulations. Mesh adaptive algorithms, designed around these methods and computable error estimates, are proposed and numerically assessed in a variety of challenging stationary and time-dependent scenarios. We further propose a virtual element discretisation and computable coarsening/refinement indicator for a system of semilinear parabolic partial differential equations which we apply to a Lotka-Volterra type model of interacting species. These components form the basis of an adaptive method which we use to reveal a variety of new pattern-forming mechanisms in the cyclic competition model.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Wood, David L. „Research Methods Overview“. Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etsu-works/5173.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Stuive, Ilse. „A comparison of confirmatory factor analysis methods: oblique multiple group method versus confirmatory common factor method“. [S.l. : Groningen : s.n. ; University Library of Groningen] [Host], 2007. http://irs.ub.rug.nl/ppn/305281992.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Simonis, Joseph P. „Inexact Newton methods applied to under-determined systems“. Link to electronic dissertation, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-050406-103442/.

Der volle Inhalt der Quelle

Annotation:

Dissertation (Ph.D.)--Worcester Polytechnic Institute.
Keywords: Periodic Solutions, Under-Determined Systems, Continuation, Nonlinear Eigenvalue, Inexact Newton Methods, Newton's Method, Trust Region Methods Includes bibliographical references (p.93-95).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema „Methods“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an