- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 371 to 380 of 394 (0.021 seconds)| 371 |
Comparing the Effect of Pedagogical Approaches to Teaching Multiplication and Divison of FractionsDingus, Meggan Holli 06 May 2021 (has links)
No description available.
|
| 372 |
Bezpečnost skladování paliva ve vodním prostředí / Safety of the fuel stored in water poolMičian, Peter January 2018 (has links)
This diploma thesis deals with storing the spent nuclear fuel and reviewing its safety. The theoretical part analyzes the processes taking place while the fuel is being used, such as fission, isotopic changes, fission gas release, cracking, swelling and densification of fuel pellet. The thesis is also focused on handling the spent fuel and on the way it makes from the reactor, through the spent fuel pool, the transportation, various kinds of storing, till the reprocessing and final deep geological repository. Furthermore, this part of the thesis briefly discusses computing code MCNP, its main characteristics, input files and using. The practical part of the work is focused on creating the model of the spent fuel pool located next to the nuclear reactor WWER 440/V213. This type was chosen, because it is the most used type of nuclear reactor in Czech Republic and Slovakia. With the help of the code MCNP, the multiplication factor of the main configurations of the fuel in the pool was calculated, and then the required safety regulations to ensure sufficient subcriticality, so its safety, were checked. Next, several analysis were performed using this model. These analyses were concerning the temperature of coolant, fuel and the use of various nuclear data libraries. In the future this model can be used to realize new analyses with new kinds of fuels, materials and data libraries.
|
| 373 |
Implementace neuronové sítě bez operace násobení / Neural Network Implementation without MultiplicationSlouka, Lukáš January 2018 (has links)
The subject of this thesis is neural network acceleration with the goal of reducing the number of floating point multiplications. The theoretical part of the thesis surveys current trends and methods used in the field of neural network acceleration. However, the focus is on the binarization techniques which allow replacing multiplications with logical operators. The theoretical base is put into practice in two ways. First is the GPU implementation of crucial binary operators in the Tensorflow framework with a performance benchmark. Second is an application of these operators in simple image classifier. Results are certainly encouraging. Implemented operators achieve speed-up by a factor of 2.5 when compared to highly optimized cuBLAS operators. The last chapter compares accuracies achieved by binarized models and their full-precision counterparts on various architectures.
|
| 374 |
Stability Rates for Linear Ill-Posed Problems with Convolution and Multiplication OperatorsHofmann, B., Fleischer, G. 30 October 1998 (has links)
In this paper we deal with the `strength' of ill-posedness for ill-posed linear operator equations Ax = y in Hilbert spaces, where we distinguish according_to_M. Z. Nashed [15] the ill-posedness of type I if A is not compact, but we have R(A) 6= R(A) for the range R(A) of A; and the ill-posedness of type II for compact operators A: From our considerations it seems to follow that the problems with noncompact operators A are not in general `less' ill-posed than the problems with compact operators. We motivate this statement by comparing the approximation and stability behaviour of discrete least-squares solutions and the growth rate of Galerkin matrices in both cases. Ill-posedness measures for compact operators A as discussed in [10] are derived from the decay rate of the nonincreasing sequence of singular values of A. Since singular values do not exist for noncompact operators A; we introduce stability rates in order to have a common measure for the compact and noncompact cases. Properties of these rates are illustrated by means of convolution equations in the compact case and by means of equations with multiplication operators in the noncompact case. Moreover using increasing rearrangements of the multiplier functions specific measures of ill-posedness called ill-posedness rates are considered for the multiplication operators. In this context, the character of sufficient conditions providing convergence rates of Tikhonov regularization are compared for compact operators and multiplication operators.
|
| 375 |
Helping a Young Child Connect Fact Family Addition and Subtraction using ToolsKurz, Terri L., Yanik, H. Bahadir, Garcia, Jorge 04 May 2012 (has links)
In order to help children become effective at addition and subtraction, it is important to provide them with an opportunity to investigate and discover the interconnectedness of the two operations. Fact families are one method teachers use to try and help children develop and understand how the operations relate to one another. This paper documents a strategy that was used with a seven year old boy to help him connect addition to subtraction. The strategy incorporated flash card tools to help him create logical problems to discover the mathematical relationship of fact families. With just a few trials, the child was able to create and explain problems that demonstrated the interconnectedness of fact families through addition and subtraction. The model was successful in helping the child advance his understanding. Additionally, it can be extended to more complex addition and subtraction problems as well as multiplication and division
fact families.
|
| 376 |
Examining the Impact of Play on the Multiplication Fluency of Third GradersListerman, Kelsey E. 25 March 2019 (has links)
No description available.
|
| 377 |
Code Optimization on GPUsHong, Changwan 30 October 2019 (has links)
No description available.
|
| 378 |
The appropriation of African traditional healing by the Zionist Churches: a challenge to the mission churches in Gaborone ”Botswana”Matsepe, Shale Solomon 30 November 2004 (has links)
The Zionist type of churches under the African Independent Churches have proven to be a force to be reckoned with against the more organized ecclesiastical movements (in particular the Mission Churches). This can be seen in their emphasis around matters related to culture and its methods of healing. As s result this led to the migration of people from the mission churches to these churches and threatened their existence in Botswana. The mission churches have been experiencing the decline in their membership to the Zionist churches because of the lack of openness to the cultural and the value systems of Batswana in Botswana. Mission churches were left with an option of doing introspection and finally acknowledging their failures to contextualise their theology and Christianity among the people they serving. Mission churches ended up opening their doors to the needs of their members. / Christian Spirituality, Church History and Missiology / M.Th. (Church History)
|
| 379 |
Les fondations en Allemagne. Comparaisons avec la France / The foundations in Germany. Comparisons with FranceFrank, Horst 04 November 2011 (has links)
Le système des fondations en Allemagne et en France présente des différences. En France, la fondation se limite à la poursuite des fins d’utilité publique. En Allemagne, le droit de fondation requiert la création d’une organe indépendant de l’État. La France compte en 2010 un total de Fondations et Fonds de dotation de 2 264 unités, en Allemagne 18 162 fondations de droit privé étaient enregistrées. Favorisé par des privilèges fiscaux, l’Allemagne a connu dans la dernière décade de nombreuses créations de fondations privées. Il en résulte une multiplication des types de fondations qui entraîne une hétérogénéité du secteur. La question de la légitimité des fondations se pose. Les fondations doivent se considérer comme faisant partie de la société civile. En France, c’est l’État qui répond à la question de la légitimité des fondations. Les fonds de dotation apportent-ils une solution? / The system of foundations in Germany and France manifests obvious differences. In France a foundation is limited by definition to public charity, in Germany the legal status of a foundation is an independent body. In 2010 there are 2 264 foundations and fonds de dotation in France, while 18 162 foundations of private law were registered in Germany. Receiving a range of fiscal benefits, the creation of foundations of private law has boomed in Germany in the past decade, thus leading to a multiformity of the sector. The question of legitimacy of foundations will arise. Foundations should see themselves as part of the civil society. In France, the state will have to solve the question of trust of foundations. Will the institut of the fonds de dotation bring a solution?
|
| 380 |
Average case analysis of algorithms for the maximum subarray problemBashar, Mohammad Ehsanul January 2007 (has links)
Maximum Subarray Problem (MSP) is to find the consecutive array portion that maximizes the sum of array elements in it. The goal is to locate the most useful and informative array segment that associates two parameters involved in data in a 2D array. It's an efficient data mining method which gives us an accurate pattern or trend of data with respect to some associated parameters. Distance Matrix Multiplication (DMM) is at the core of MSP. Also DMM and MSP have the worst-case complexity of the same order. So if we improve the algorithm for DMM that would also trigger the improvement of MSP. The complexity of Conventional DMM is O(n³). In the average case, All Pairs Shortest Path (APSP) Problem can be modified as a fast engine for DMM and can be solved in O(n² log n) expected time. Using this result, MSP can be solved in O(n² log² n) expected time. MSP can be extended to K-MSP. To incorporate DMM into K-MSP, DMM needs to be extended to K-DMM as well. In this research we show how DMM can be extended to K-DMM using K-Tuple Approach to solve K-MSP in O(Kn² log² n log K) time complexity when K ≤ n/log n. We also present Tournament Approach which solves K-MSP in O(n² log² n + Kn²) time complexity and outperforms the K-Tuple
|
Page generated in 0.032 seconds