Log in

Relevant bibliographies by topics / Multiplication of the loaves / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Multiplication of the loaves.

Dissertations / Theses on the topic 'Multiplication of the loaves'

Author: Grafiati

Published: 4 June 2021

Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Multiplication of the loaves.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Mantovani, José Pascoal. "OS SINAIS NO EVANGELHO DE JOÃO: EXEGESE DE JOÃO 6.1-15." Universidade Metodista de São Paulo, 2013. http://tede.metodista.br/jspui/handle/tede/285.

Full text

Abstract:

Made available in DSpace on 2016-08-03T12:19:32Z (GMT). No. of bitstreams: 1 JM.pdf: 805212 bytes, checksum: 90e146324ad59c947fe52a0627e2eaaf (MD5) Previous issue date: 2013-12-05<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>This tese will analyse the ocurrences of the word sign in the fourth gospel, having the exegesis of John 6. 1 - 15 as a paradigm - the multiplying of the loaves and fishes pericope. This pericope is in-serted within the Signs Book (chapters 1 - 12), which is marked by the ocurrance of seven signs, beign those: the Wedding at Cana (2. 1 - 11); the hea

APA, Harvard, Vancouver, ISO, and other styles

2

Erlebach, Christopher B. "Bubble heterogeneities in bread, caused by sheeting." Thesis, University of Cambridge, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.246474.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Akin, Ihsan Haluk. "Spectral Modular Multiplication." Phd thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12610463/index.pdf.

Full text

Abstract:

Spectral methods have been widely used in various fields of engineering and applied mathematics. In the field of computer arithmetic: data compression, polynomial multiplication and the spectral integer multiplication of Sch&uml<br>onhage and Strassen are among the most important successful utilization. Recent advancements in technology report the spectral methods may also be beneficial for modular operations heavily used in public key cryptosystems. In this study, we evaluate the use of spectral methods in modular multiplication. We carefully compare their timing performances with respect to

APA, Harvard, Vancouver, ISO, and other styles

4

Kaihara, Marcelo E., 直史高木, and Naofumi Takagi. "Bipartite Modular Multiplication." Springer, 2005. http://hdl.handle.net/2237/2751.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Malaty, George. "Isomorphic Visualization and Understanding of the Commutativity of Multiplication: from multiplication of whole numbers to multiplication of fractions." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-82868.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Thannoun, Abdullah M. "Iron Bioavailability of Meat:Bread Mixtures and Meat Loaves Fed to Anemic and Healthy Rats." DigitalCommons@USU, 1987. https://digitalcommons.usu.edu/etd/5345.

Full text

Abstract:

To study the effect of meat (beef) on dietary iron bioavailability from enriched white bread (EWB) or whole wheat bread (WWB), diets were prepared in which the ratios of beef iron to bread iron were 100:0, 75:25, 50:50, 25:75 or 0:100. Hemoglobin regeneration efficiency (HRE), apparent iron absorption, and dry matter absorption were determined using weanling anemic and healthy male rats. Meat iron was more available than EWB or WWB. Fortification iron in EWB was less available than the iron naturally present in WWB. At the iron dose given, HRE was similar for both anemic and healthy rats. Alth

APA, Harvard, Vancouver, ISO, and other styles

7

Blake, Christopher James. "Topics in complex multiplication." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Larsson, Kerstin. "Students' understandings of multiplication." Doctoral thesis, Stockholms universitet, Institutionen för matematikämnets och naturvetenskapsämnenas didaktik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-134768.

Full text

Abstract:

Multiplicative reasoning permeates many mathematical topics, for example fractions and functions. Hence there is consensus on the importance of acquiring multiplicative reasoning. Multiplication is typically introduced as repeated addition, but when it is extended to include multi-digits and decimals a more general view of multiplication is required. There are conflicting reports in previous research concerning students’ understandings of multiplication. For example, repeated addition has been suggested both to support students’ understanding of calculations and as a hindrance to students’ con

APA, Harvard, Vancouver, ISO, and other styles

9

Belhaj, Dahmane Bouthaina. "Jacobiennes à multiplication complexe." Paris 6, 2001. http://www.theses.fr/2001PA066267.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Zhe. "Hardware Accelerator of Matrix Multiplication on FPGAs : Hardware Accelerator of Matrix Multiplication on FPGAs." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-366815.

Full text

Abstract:

To solve the computational complexity and time-consuming problem of large matrix multiplication, this thesis design a hardware accelerator using parallel computation structure based on FPGA. After function simulation in ModelSim, matrix multiplication functional modules as a custom component used as a coprocessor in co-operation with Nios II CPU by Avalon bus interface. To analyze computation performance of the hardware accelerator, two software systems are designed for comparison. The results show that the hardware accelerator can improve the computational performance of matrix multiplication

APA, Harvard, Vancouver, ISO, and other styles

11

Yayla, Oguz. "Scalar Multiplication On Elliptic Curves." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607753/index.pdf.

Full text

Abstract:

Elliptic curve cryptography has gained much popularity in the past decade and has been challenging the dominant RSA/DSA systems today. This is mainly due to elliptic curves offer cryptographic systems with higher speed, less memory and smaller key sizes than older ones. Among the various arithmetic operations required in implementing public key cryptographic algorithms based on elliptic curves, the elliptic curve scalar multiplication has probably received the maximum attention from the research community in the past a few years. Many methods for efficient and secure implementation of scalar m

APA, Harvard, Vancouver, ISO, and other styles

12

Giguère, Pierre. "Some properties of complex multiplication." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61184.

Full text

Abstract:

This thesis presents various aspects of the general theory of arithmetic of elliptic curves and of complex multiplication. Special attention is given to curves with complex multiplication by a imaginary quadratic number field with class number two. The thesis concludes with some rank calculations, which take advantage of the properties of Q-curves.

APA, Harvard, Vancouver, ISO, and other styles

13

Wilson, Ley Catherine. "Q-Curves with Complex Multiplication." University of Sydney, 2010. http://hdl.handle.net/2123/6259.

Full text

Abstract:

Doctor of Philosophy<br>The Hecke character of an abelian variety A/F is an isogeny invariant and the Galois action is such that A is isogenous to its Galois conjugate A^σ if and only if the corresponding Hecke character is fixed by σ. The quadratic twist of A by an extension L/F corresponds to multiplication of the associated Hecke characters. This leads us to investigate the Galois groups of families of quadratic extensions L/F with restricted ramification which are normal over a given subfield k of F. Our most detailed results are given for the case where k is the field of rational num

APA, Harvard, Vancouver, ISO, and other styles

14

Ghita, Marius Mugurel. "Frequency Multiplication in Silicon Nanowires." PDXScholar, 2016. http://pdxscholar.library.pdx.edu/open_access_etds/3082.

Full text

Abstract:

Frequency multiplication is an effect that arises in electronic components that exhibit a non-linear response to electromagnetic stimuli. Barriers to achieving very high frequency response from electronic devices are the device capacitance and other parasitic effects such as resistances that arise from the device geometry and are in general a function of the size of the device. In general, smaller device geometries and features lead to a faster response to electromagnetic stimuli. It was posited that the small size of the silicon nanowires (SiNWs) would lead to small device capacitance and spr

APA, Harvard, Vancouver, ISO, and other styles

15

Quttineh, Nils-Hassan. "Computational Complexity of Finite Field Multiplication." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1968.

Full text

Abstract:

<p>The subject for this thesis is to find a basis which minimizes the number of bit operations involved in a finite field multiplication. The number of bases of a finite field increases quickly with the extension degree, and it is therefore important to find efficient search algorithms. Only fields of characteristic two are considered. </p><p>A complexity measure is introduced, in order to compare bases. Different methods and algorithms are tried out, limiting the search in order to explore larger fields. The concept of equivalent bases is introduced. </p><p>A comparison is also made between t

APA, Harvard, Vancouver, ISO, and other styles

16

Abrahamsson, Björn. "Architectures for Multiplication in Galois Rings." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2396.

Full text

Abstract:

<p>This thesis investigates architectures for multiplying elements in Galois rings of the size 4^m, where m is an integer. </p><p>The main question is whether known architectures for multiplying in Galois fields can be used for Galois rings also, with small modifications, and the answer to that question is that they can. </p><p>Different representations for elements in Galois rings are also explored, and the performance of multipliers for the different representations is investigated.</p>

APA, Harvard, Vancouver, ISO, and other styles

17

Stothers, Andrew James. "On the complexity of matrix multiplication." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4734.

Full text

Abstract:

The evaluation of the product of two matrices can be very computationally expensive. The multiplication of two n×n matrices, using the “default” algorithm can take O(n3) field operations in the underlying field k. It is therefore desirable to find algorithms to reduce the “cost” of multiplying two matrices together. If multiplication of two n × n matrices can be obtained in O(nα) operations, the least upper bound for α is called the exponent of matrix multiplication and is denoted by ω. A bound for ω < 3 was found in 1968 by Strassen in his algorithm. He found that multiplication of two 2 × 2

APA, Harvard, Vancouver, ISO, and other styles

18

Mekhallalati, Mejahed C. "Novel algorithms and architectures for multiplication." Thesis, University of Nottingham, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339554.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Benz, Sonja. "Fast multiplication of multiple-precision integers /." Online version of thesis, 1991. http://hdl.handle.net/1850/11000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Li, Zimu. "Fast Matrix Multiplication by Group Algebras." Digital WPI, 2018. https://digitalcommons.wpi.edu/etd-theses/131.

Full text

Abstract:

Based on Cohn and Umansâ€™ group-theoretic method, we embed matrix multiplication into several group algebras, including those of cyclic groups, dihedral groups, special linear groups and Frobenius groups. We prove that SL2(Fp) and PSL2(Fp) can realize the matrix tensor ⟨p, p, p⟩, i.e. it is possible to encode p Ã— p matrix multiplication in the group algebra of such a group. We also find the lower bound for the order of an abelian group realizing ⟨n, n, n⟩ is n3. For Frobenius groups of the form Cq Cp, where p and q are primes, we find that the smallest admissible value of q must be in the ra

APA, Harvard, Vancouver, ISO, and other styles

21

Helal, Belal M. 1971. "Techniques for low jitter clock multiplication." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44417.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>Includes bibliographical references (p. 115-121).<br>Phase realigning clock multipliers, such as Multiplying Delay-Locked Loops (MDLL), offer significantly reduced random jitter compared to typical Phase-Locked Loops (PLL). This is achieved by introducing the reference signal directly into their voltage controlled oscillators (VCO) to realign the phase to the clean reference. However, the typical cost of this benefit is a significant increase in deterministic jitter due to pat

APA, Harvard, Vancouver, ISO, and other styles

22

Greenwald, Scott Wilkins. "Matrix multiplication with Asynchronous Logic Automata." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62076.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 62-63).<br>A longstanding trend in supercomputing is that as supercomputers scale, they become more difficult to program in a way that fully utilizes their parallel processing capabilities. At the same time they become more power-hungry - today's largest supercomputers each consume as much power as a town of 5000 inhabitants in the United States. In this thesis I investigate an al

APA, Harvard, Vancouver, ISO, and other styles

23

LEFEUVRE, YANN. "Corps a multiplication complexe diedraux principaux." Caen, 1999. http://www.theses.fr/1999CAEN2030.

Full text

Abstract:

D'apres un theoreme d'a. M. Odlysko (1975), nous savons qu'il n'existe qu'un nombre fini de corps de nombres galoisiens a multiplication complexe principaux (c'est-a-dire de nombre de classes un). En 1994, k. Yamamura a determine la liste complete des corps abeliens a multiplication complexe principaux. Le but de cette these est de faire la meme chose pour le cas diedral (ou plus exactement de resoudre le probleme des corps diedraux a multiplication complexe de nombre de classes relatif un) et de completer ainsi les travaux anterieurs de s. Louboutin, r. Okazaki et m. Olivier. La partie algebr

APA, Harvard, Vancouver, ISO, and other styles

24

Gomez, Ayala Eugenio Jesus. "Bases normales d'entiers et multiplication complexe." Bordeaux 1, 1991. http://www.theses.fr/1991BOR10531.

Full text

Abstract:

Dans les trois articles qui composent cette these on s'interesse a la generalisation possible, dans le cadre de la multiplication complexe, du theoreme de leopoldt pour la structure galoisienne des anneaux d'entiers d'extensions de kummer, moderement ramifiees, de corps de nombres

APA, Harvard, Vancouver, ISO, and other styles

25

Orem, Hendrik. "Fast Matrix Multiplication via Group Actions." Scholarship @ Claremont, 2009. https://scholarship.claremont.edu/hmc_theses/221.

Full text

Abstract:

Recent work has shown that fast matrix multiplication algorithms can be constructed by embedding the two input matrices into a group algebra, applying a generalized discrete Fourier transform, and performing the multiplication in the Fourier basis. Developing an embedding that yields a matrix multiplication algorithm with running time faster than naive matrix multiplication leads to interesting combinatorial problems in group theory. The crux of such an embedding, after a group G has been chosen, lies in finding a triple of subsets of G that satisfy a certain algebraic relation. I show how the

APA, Harvard, Vancouver, ISO, and other styles

26

Ashari, Arash. "Sparse Matrix-Vector Multiplication on GPU." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1417770100.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Fleischer, G. "Multiplication operators and its ill-posedness properties." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199801292.

Full text

Abstract:

This paper deals with the characterization of multiplication operators, especially with its behavior in the ill-posed case. We want to classify the different types and degrees of ill-posedness. We give some connections between this classification and regularization methods.

APA, Harvard, Vancouver, ISO, and other styles

28

高木, 直史, and Naofumi Takagi. "A hardware algorithm for modular multiplication/division." IEEE, 2005. http://hdl.handle.net/2237/5293.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Flori, Jean-Pierre. "Fonctions booléennes, courbes algébriques et multiplication complexe." Phd thesis, Télécom ParisTech, 2012. http://pastel.archives-ouvertes.fr/pastel-00758378.

Full text

Abstract:

La première partie de cette thèse est dévolue à l'étude d'une conjecture combinatoire dont la validité assure l'existence de familles infinies de fonctions booléennes dotées de propriétés cryptographiques intéressantes. Quoique particulièrement innocente au premier abord, la validité de cette conjecture reste un problème ouvert. Néanmoins, l'auteur espère que les résultats théoriques et expérimentaux présentés ici permettront au lecteur d'acquérir un tant soit peu de familiarité avec la conjecture. Dans la seconde partie de ce manuscrit, des liens entre fonctions (hyper-)courbes -- une classe

APA, Harvard, Vancouver, ISO, and other styles

30

Peebles, John Lee Thompson Jr. "Hypergraph Capacity with Applications to Matrix Multiplication." Scholarship @ Claremont, 2013. http://scholarship.claremont.edu/hmc_theses/48.

Full text

Abstract:

The capacity of a directed hypergraph is a particular numerical quantity associated with a hypergraph. It is of interest because of certain important connections to longstanding conjectures in theoretical computer science related to fast matrix multiplication and perfect hashing as well as various longstanding conjectures in extremal combinatorics. We give an overview of the concept of the capacity of a hypergraph and survey a few basic results regarding this quantity. Furthermore, we discuss the Lovász number of an undirected graph, which is known to upper bound the capacity of the graph (and

APA, Harvard, Vancouver, ISO, and other styles

31

Taylor, Lawrence. "Noncommutative tori, real multiplication and line bundles." Thesis, University of Nottingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.437094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Ashur, Ahmed Said. "New efficient multiplication structures and their applications." Thesis, University of Nottingham, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Natalini, Roberto. "Multiplication de distributions et polarisation des singularités." Grenoble 2 : ANRT, 1986. http://catalogue.bnf.fr/ark:/12148/cb37599961x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bissell, Timothy R. "Church Multiplication Centers and indigenous church expansion." Theological Research Exchange Network (TREN), 2008. http://www.tren.com/search.cfm?p056-0078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Moore, Andrew C. "Generating just temperament with ideal rate multiplication /." Online version of thesis, 1991. http://hdl.handle.net/1850/11074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Pantawongdecha, Payut. "Autotuning divide-and-conquer matrix-vector multiplication." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105968.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 73-75).<br>Divide and conquer is an important concept in computer science. It is used ubiquitously to simplify and speed up programs. However, it needs to be optimized, with respect to parameter settings for example, in orde

APA, Harvard, Vancouver, ISO, and other styles

37

Miller, Jane S. "Molecular studies of potato leafroll luteovirus multiplication." Thesis, University of St Andrews, 1993. http://hdl.handle.net/10023/13943.

Full text

Abstract:

Potato leafroll luteovirus is an aphid-transmissible virus which has isometric particles and is confined to the phloem tissue of infected plants. Its multiplication was investigated by using plant protoplasts as a model system. In protoplasts, net accumulation of PLRV ceased at approximately 48 his post-inoculation. Virus-specific products were detectable 15 hrs or more post-inoculation and remained detectable at approximately 100 hrs postinoculation. The amount of PLRV accumulated depended on the conditions in which protoplasts were incubated. Incubation at 25°C rather than 20°C and i

APA, Harvard, Vancouver, ISO, and other styles

38

Didier, Laurent-Stéphane. "Division et multiplication modulaire en représentation modulaire." Aix-Marseille 1, 1998. http://www.theses.fr/1998AIX11011.

Full text

Abstract:

La representation modulaire permet de substituer les calculs sur de tres grands nombres par des operations sur de petites valeurs pour la determination de l'addition et de la multiplication. Ces operations peuvent etre effectuees tres rapidement en parallele. Toutefois la division et la multiplication modulaire sont plus difficiles a realiser. Nous presentons un etat de l'art sur la representation modulaire ou nous abordons differentes methodes de conversion et leurs implementations. Nous traiterons egalement de diverses architectures proposees dans la litterature scientifique pour le calcul d

APA, Harvard, Vancouver, ISO, and other styles

39

Natalini, Roberto. "Multiplication de distributions et polarisation des singularités." Bordeaux 1, 1986. http://www.theses.fr/1986BOR10618.

Full text

Abstract:

On etablit une condition necessaire et une condition suffisante pour la multiplication des distributions a valeurs dans l'espace complexe de dimension n en liaison avec l'analyse des fronts d'onde polarises. On generalise ainsi des resultats precedents de b. Hanouzet et j. L. Joly et, d'autre part, on retrouve la condition de multiplication de hoermander dans le cas ou n vaut 1

APA, Harvard, Vancouver, ISO, and other styles

40

Mebane, Palmer. "Uniquely Solvable Puzzles and Fast Matrix Multiplication." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/37.

Full text

Abstract:

In 2003 Cohn and Umans introduced a new group-theoretic framework for doing fast matrix multiplications, with several conjectures that would imply the matrix multiplication exponent $\omega$ is 2. Their methods have been used to match one of the fastest known algorithms by Coppersmith and Winograd, which runs in $O(n^{2.376})$ time and implies that $\omega \leq 2.376$. This thesis discusses the framework that Cohn and Umans came up with and presents some new results in constructing combinatorial objects called uniquely solvable puzzles that were introduced in a 2005 follow-up paper, and which

APA, Harvard, Vancouver, ISO, and other styles

41

GALA, Sadek. "Opérateurs de multiplication ponctuelle entre espace de Sobolev." Phd thesis, Université d'Evry-Val d'Essonne, 2005. http://tel.archives-ouvertes.fr/tel-00009577.

Full text

Abstract:

L'objectif de cette thèse est de donner les outils fondamentaux de la théorie des opérateurs de multiplications ponctuelle basés principalement sur la théorie des distributions et l'analyse de Fourier, et d'en donner des applications aux dérivées partielles. L'étude des opérateurs de multiplication ponctuelle examine à quelle conditions on a des inégalité de type capacitaire. Elle intervienne dans l'étude des opérateurs différentiels à coéfficients irréguliers. Le but principal de cette yhèse est de généraliser le théorème de Maz'ya - Verbitsky. Les outils utilisés sont la théorie des opérateu

APA, Harvard, Vancouver, ISO, and other styles

42

Cenk, Murat. "Results On Complexity Of Multiplication Over Finite Fields." Phd thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/3/12610363/index.pdf.

Full text

Abstract:

Let n and l be positive integers and f (x) be an irreducible polynomial over Fq such that ldeg( f (x)) &lt<br>2n - 1, where q is 2 or 3. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f (x)^l. This upper bound allows a better selection of the moduli when Chinese Remainder Theorem is used for polynomial multiplication over Fq. We give improved formulae to multiply polynomials of small degree over Fq. In particular we improve the best known multiplication complexities over Fq in the literature in some cases. Moreover, we present a method for mul

APA, Harvard, Vancouver, ISO, and other styles

43

McKiel, Vanessa. "Cytokine-induced alterations in human immunodeficiency virus multiplication." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=55512.

Full text

Abstract:

The ability of the human immunodeficiency virus (HIV) to replicate in T-cells and macrophages has been shown to be influenced by immunomodulatory cytokines; furthermore, HIV infection of these cells can alter the kinetics of cytokine transcription. We found that chronic HIV IIIB infection of myelomonoblastic PLB 985 cells resulted in an altered pattern of type 1 interferon (IFN) transcription. Paradoxically, despite the antiviral effects of IFN, HIV-induced dysregulation of IFN transcription may actually lead to the establishment of a cellular environment that supports a chronic infection.<br>

APA, Harvard, Vancouver, ISO, and other styles

44

Venkataraman, Mahalingam. "Improving accuracy in logarithmic multiplication using operand decomposition." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001140.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Plazas, Jorge. "Arithmetic structures on noncommutative tori with real multiplication." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=982902220.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Mabbott, Donald J. "Developmental change and individual differences in children's multiplication." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0002/NQ29066.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Sidahao, Nalin. "Multiple restricted multiplication for optimized FPGA-based arithmetic." Thesis, Imperial College London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.420639.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Shinn, Tong-Wook. "Combining Shortest Paths, Bottleneck Paths and Matrix Multiplication." Thesis, University of Canterbury. Computer Science and Software Engineering, 2014. http://hdl.handle.net/10092/9740.

Full text

Abstract:

We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of the SP problem, the BP problem, and matrix multiplication. For the topic of matrix multiplication we show that on an n-by-n two dimensional (2D) square mesh array, two n-by-n matrices can be multiplied

APA, Harvard, Vancouver, ISO, and other styles

49

Anghileri, Julia Elisabeth. "An investigation of young children's understanding of multiplication." Thesis, King's College London (University of London), 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.264939.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Plimmer, Stephen Anthony. "Avalanche multiplication in Alâ†xGaâ†1â†-â†xAs." Thesis, University of Sheffield, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286616.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!