Thèses sur le sujet « Calculatoare »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Calculatoare ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Gosse, Paul W. « Future mathematics in a TI-83 graphing calculator environment ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0004/MQ42385.pdf.
Texte intégralVanier, Pascal. « Pavages : périodicité et complexité calculatoire ». Thesis, Aix-Marseille, 2012. http://www.theses.fr/2012AIXM4813/document.
Texte intégralThis thesis is dedicated to the study of subshifts of finite type (SFTs) : sets of colorings of the discrete plane which respect some local constraints given by a set of forbidden patterns. We study the links between SFTs and computation. SFTs being specific effectively closed classes, we fist study their Turing degree structure, comparing it to the one of effectively closed classes in general: for any effectively closed class, there exist an SFT having the same Turing degrees except maybe 0, the degree of recursive sets. Furthermore, SFTs containing no recursive member have a particular structure: they always contain a cone of Turing degrees, ie. a Turing degree and all degrees above it. We then study the sets of periods of SFTs, for different notions of periodicity, reaching characterizations by means of computational complexity classes or computability classes for each notion introduced. Finally we look at the computable hardness of the factorization and conjugacy problems, the right notions of simulation and equivalence for SFTs
Adabor, James Kofi. « An Investigation into Elementary School Teachers' and High School Mathematics Teachers' Attitudes Towards the Use of Calculators in Mathematics Instruction and Learning : A Study of Selected Schools in Ghana ». Ohio : Ohio University, 2008. http://www.ohiolink.edu/etd/view.cgi?ohiou1210367584.
Texte intégralThimbleby, Will. « Drawing from calculators ». Thesis, Swansea University, 2010. https://cronfa.swan.ac.uk/Record/cronfa43088.
Texte intégralOverall, Theresa Lynne. « One-to-one technology and mathematics achievement for eighth grade girls and boys in the state of Maine ». Thesis, University of North Texas, 2007. https://digital.library.unt.edu/ark:/67531/metadc3632/.
Texte intégralKoutsos, Adrien. « Preuves symboliques de propriétés d’indistinguabilité calculatoire ». Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLN029/document.
Texte intégralOur society extensively relies on communications systems. Because such systems are used to exchange sensitive information and are pervasive, they need to be secured. Cryptographic protocols are what allow us to have secure communications. It is crucial that such protocols do not fail in providing the security properties they claim, as failures have dire consequences. Unfortunately, designing cryptographic protocols is notoriously hard, and major protocols are regularly and successfully attacked. We argue that formal verification is the best way to get a strong confidence in a protocol security. Basically, the goal is to mathematically prove that a protocol satisfies some security property.Our objective is to develop techniques to formally verify equivalence properties of cryptographic protocols, using a method that provides strong security guarantees while being amenable to automated deduction techniques. In this thesis, we argue that the Bana-Comon model for equivalence properties meets these goals. We support our claim through three different contributions.First, we design axioms for the usual functions used in security protocols, and for several cryptographic hypothesis. Second, we illustrate the usefulness of these axioms and of the model by completing case studies of concrete protocols: we study two RFID protocols, KCL et LAK, as well as the 5G-AKA authentication protocol used in mobile communication systems. For each of these protocols, we show existing or new attacks against current versions, propose fixes, and prove that the fixed versions are secure. Finally, we study the problem of proof automation in the Bana-Comon model, by showing the decidability of a set of inference rules which is a sound, though incomplete, axiomatization of computational indistinguishability when using an IND-CCA2 encryption scheme. From a cryptographer's point of view, this can be seen as the decidability of a fixed set of cryptographic game transformations
Mäkivierikko, Aram. « CTG Carbon Calculator ». Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-101181.
Texte intégralA carbon dioxide emission calculator for buildings created by the U.S.-based company CTG Energetics, Inc. and based on a Excel file has been converted to a ASP.NET / SQL Server web application. Carbon dioxide emissions are calculated using data given by the user (i.e. floor area, workdays per year) in combination with statistical data used in user-selectable presets (i.e. building type, climate zone, type of water-using fixtures). In most cases a custom value can be inserted instead of using a preset. Emissions attributable both directly and indirectly to the building such as building energy use, domestic water use, landscape/irrigation, transportation, materials used for the building/parking lot and the disposal of solid waste are calculated. The emissions can be compared with a national average and/or emissions from alternate scenarios created for the same building. The web application contains some upgrades and extra functionality that would not have been possible in Excel such as user handling.
Berg, Eirik. « Relative Motion Calculator ». Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for marin teknikk, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-19200.
Texte intégralStiles, Nancy L. Hathway Robert G. « Graphing calculators and calculus ». Normal, Ill. Illinois State University, 1994. http://wwwlib.umi.com/cr/ilstu/fullcit?p9510432.
Texte intégralTitle from title page screen, viewed March 31, 2006. Dissertation Committee: Robert G. Hathway (chair), Lynn H. Brown, John A. Dossey, Arnold J. Insel, Patricia H. Klass. Includes bibliographical references (leaves 33-34) and abstract. Also available in print.
Taveneaux, Antoine. « Puissance logique et calculatoire de l'aléa algorithmique ». Paris 7, 2013. http://www.theses.fr/2013PA077217.
Texte intégralTheory of algorithmic randomness theory studies the Jack of structure that characterizes random objects Kolmogorov complexity is a fimdamental tool of this theory and we study the characteristic properties of this fonction. In a second step we investigate the possibility of extending the study of the biased random bit sequences wondering if precise knowledge of using or not changes the quality of randomness we describe, We then focus on the logic power of the random object: What can be inferred from the fact (non provable) that a sequence has no structure? Finally we look a the possibility of calculating a completion of arithmetic from an randomized algorithm
Helander, Hugo, et Linus Tegelmo. « Homo Colossus Energy Calculator ». Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-279566.
Texte intégralDenna uppsats handlar om skapandet av en samling frågor som har syftet att uppskatta mängden energi som en individ använder över ett år. Dessa frågor är designade för en kiosk i en utställningsmiljö, och kommer att användas för ett projekt som kallas för ‘Homo Colossus’ som kommer att presenteras på diverse utställningar. Huvudkällan för energivärdena i denna uppsats kommer ifrån David JC MacKay. Huvudfrågan som denna uppsats täcker är hur vi kan, med så få frågor som möjligt, ge en uppskattning av någons årliga energikonsumtion. För att uppnå detta, så intervjuade vi personer med relevant erfarenhet och skapade ett frågeformulär för att testa frågorna. Resultatet från testet ledde till små förändringar i strukturen av frågeformuläret.
Toma, Johannes, et Sirak Ghebreamlak. « Num2Braille : A braille calculator ». Thesis, KTH, Skolan för industriell teknik och management (ITM), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-264437.
Texte intégralRapporten försöker svara på hur en miniräknare som enbart använder blindskrift can byggas och vad som bör tänkas på. Ett försök till att konstruera en sådan apparat har gjorts. Den bakomliggande anledningen till detta är det tunna utbudet av blindskrifts-apparater på marknaden. Läskunnigheten av blindskrift är väldigt låg och utvecklandet av apparater som aktivt använder blindskrift kan uppmuntra lärandet av språket. En ny design till en braille skärm, som blir skärmen till miniräknaren, föreslås och en prototyp har konstruerats för att testas. Den första prototypen är lovande, även om den är ganska opraktisk och stor. Den fungerar som en miniräknare men kräver manuell kalibrering vid uppstart för att nollställa läget hos braille-hjulen.
Forest, Simon. « Descriptions calculatoires de catégories supérieures ». Thesis, Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAX003.
Texte intégralHigher categories are algebraic structures consisting of cells of various dimensions equipped with notions of composition, which have found many applications in mathematics (algebraic topology in particular) and theoretical computer science. They are notably complicated structures whose manipulation is technical and error-prone. The purpose of this thesis is to introduce several computational tools for strict and semi-strict variants of higher categories that ease the study of these objects. In order to represent higher categories as finite data, so that they can be given as input to a program, we use the structure of polygraph, initially introduced by Street and Burroni for strict categories and then generalized by Batanin to any algebraic theory of higher category, which allows presenting higher categories by means of systems of generators. The first problem tackled by this thesis is then the one of the word problem on strict categories, which consists in deciding whether two formal composites of cells of strict categories represent the same cell. We give an implementable and relatively efficient solution for it by improving the decidability procedure initially given by Makkai. Then, we turn to pasting diagram formalisms for strict categories, which enable to efficiently represent cells of strict categories using set-like structures and for which a reliable implementation is desirable. We consider the three main formalisms which have been introduced until now, namely Street's parity complexes, Johnson's pasting schemes and Steiner's augmented directed complexes. Our study reveals that the axiomatics of the first two ones are defective, which motivates the introduction of a new structure, called torsion-free complexes, whose axioms have nice properties and generalize those of the three other formalisms. We also show that they are amenable to concrete computation, by providing an implementation of those. Finally, we consider the problem of coherence of presentations of algebraic structures expressed in 3-dimensional weak categories, the latter being known to be equivalent to Gray categories. Taking inspiration from a celebrated result given by Squier in the context of monoids, we adapt the classical tools from rewriting theory to the setting of Gray categories and relate the coherence of presentations of Gray categories to the confluence of the critical branchings of an associated rewriting system. From this result, we deduce a semi-automated procedure to find coherent presentations of Gray categories that we apply on several examples
Dumais, Paul. « Hypothèses calculatoires en cryptographie quantique ». [Montréal] : Université de Montréal, 2002. http://wwwlib.umi.com/cr/umontreal/fullcit?pNQ75912.
Texte intégral"NQ-75912." "Thèse présentée à la faculté des études supérieures en vue de l'obtention du grade de philosophiae doctor (Ph. D.) en informatique." Version électronique également disponible sur Internet.
Sweeney, Sharon Shriver. « Attitudes and beliefs of parents of middle school children about calculators in school mathematics ». Connect to this title online, 2004. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1095709423.
Texte intégralTitle from first page of PDF file. Document formatted into pages; contains xiii, 245 p.; also includes graphics. Includes bibliographical references (p. 210-217).
LaCour, Mark S. « When Calculators Lie| An Examination of How Calculators Affect Student's Engagement in Mathematical Problem Solving ». Thesis, University of Louisiana at Lafayette, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10248623.
Texte intégralQuantitative reasoning is an important skill set that educators work tirelessly to develop, yet evidence is beginning to show a downward trend in performance among university students over the past few decades. The rise of technology in everyday life has undoubtedly affected the cognition of younger generations of students. Of particular interest is the increasing availability of calculators (e.g., on cell phones). In this experiment, we programmed a calculator to lie to students in certain conditions as well as alter the presentation of problems. We also collected numeracy scores. The effects of these variables on reports of suspicion towards the calculator and overall accuracy on problems were analyzed to see whether students tended to be disengaged from math problems while using a calculator (Disengagement Hypothesis) or whether calculators do not substantially affect how students engage in problems and variation in performance is more attributable to general numeracy (Engagement Hypothesis). The Engagement Hypothesis was supported.
Jeandel, Emmanuel. « Propriétés structurelles et calculatoires des pavages ». Habilitation à diriger des recherches, Université Montpellier II - Sciences et Techniques du Languedoc, 2011. http://tel.archives-ouvertes.fr/tel-00653343.
Texte intégralChandwani, Somil. « Biosecurity risk and impact calculator ». Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/934.
Texte intégralLeong, Colin D. « Whole-Lake Primary Production Calculator ». Wright State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=wright1452795206.
Texte intégralMummidisetti, Karthik. « Development of My Footprint Calculator ». VCU Scholars Compass, 2017. http://scholarscompass.vcu.edu/etd/4887.
Texte intégralAndron, Inès. « Oxydes et fluorures photochromiques inorganiques : approches expérimentale et calculatoire ». Thesis, Bordeaux, 2020. http://www.theses.fr/2020BORD0104.
Texte intégralIn the quest for ideal and advanced photochromic inorganic compounds, this PhD work is focused on the study of oxidation number switch as a result of photo-redox processes generated by UV-light irradiation in both inorganic fluoride and oxide matrices. The photo-redox reactions involve transition metal (Mo5+/Mo6+) or rare-earth (Ce3+/Ce4+) doping cations used as chromophores or luminescent species inducing the photochromic properties in these materials, respectively.First, deep structural and optical characterizations have allowed the full understanding of the photo-chromo-luminescent properties taking place in several elpasolite compositions (deriving from a double-perovskite structural-type). These materials exhibit a bistable photochromism. Actually, these Ce-doped matrices are characterized by an initial blue broad band emission, ascribed to the Ce3+ luminescent ion. A new luminescent species (In+) is created by redox reaction between Ce3+ and In3+ after long-time UV irradiation. A yellow to red range emission attributed to the occurrence of In+ species is then observed. The photochromism is reversible with a long-time exposure under shorter UV wavelength. The features of both indium or cerium emission bands depend on the composition of the matrix due to a change in the chemical bonds iono-covalent character in link with the crystal field. A quantum chemical modelling based on DFT calculations involving Cerium-doped systems has been performed to identify the prevalent defect chemistry and corresponding global/local geometry incidences of cation substitution. Substitution energies were systematically investigated allowing to propose some specific models of Cerium incorporation as being the most likely to occur. In an attempt to define less costly (In-free) compounds, a study of the photochromic properties of Pr or Ce-doped CaSnF6 matrix (double ReO3 structure) has been achieved. A less intense photochromic phenomenon was observed due to photo-oxidation of the rare-earth ion, the reverse process requiring to maintain the compound during long-times under dark conditions.Secondly, a study of the reversible photo-induced colour change of intimate mixtures of ZnO and MoO3 powders has been performed. Under UV irradiation (with an energy over the ZnO gap) a colouring process is observed due to the intervalence charge transfers (Mo5+→Mo6+) inside the MoO3 compound. It was clearly demonstrated that the creation of reduced Mo5+ ions occurred thanks to the electrons provided by the zinc oxide conduction band which are created in link with the UV excitation, through the material interfaces acting as a Schottky barrier. The bleaching process occurs without any stimulus into dark conditions. From soft chemistry routes, the morphology, the chemical composition (Al-doping, cation/oxygen ratio modulation) of the ZnO and MoO3 compounds, along with the mixture composition (ZnO/MoO3 ratio) were optimized to enhance the photochromic contrast
Routier, Jean-Christophe. « Terminaison, satisfiabilité, puissance calculatoire d'une clause de Horn binaire ». Lille 1, 1994. http://www.theses.fr/1994LIL10024.
Texte intégralCadé, David. « Implémentations de protocoles cryptographiques prouvées dans le modèle calculatoire ». Paris 7, 2013. http://www.theses.fr/2013PA077202.
Texte intégralThe goal of this work is to obtain implementations of cryptographie protocols proved in the computational model. We have implemented a compiler that takes a specification of the protocol in the input language of the computational protocc verifier CryptoVerif and translates it into an OCaml implementation. We have proved the secrecy of exchanged keys and the authentication of the server in the key exchange of the SSH (Secure Shell) protocol, and we applied our compiler on it. Also, we have proved that this compiler preserves security properties: if an adversary has probability p of breaking a security property in the generated code, then there exists an adversary that breaks the property with the same probability in the CryptoVerif specification. Therefore, if the protocol specification is proved secure in the computational model by CryptoVerif, then the generated implementation is also secure
Ekici, Burak. « Certification de programmes avec des effets calculatoires ». Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAM070/document.
Texte intégralIn this thesis, we aim to formalize the effects of a computation. Indeed, most used programming languages involve different sorts of effects: state change, exceptions, input/output, non-determinism, etc. They may bring ease and flexibility to the coding process. However, the problem is to take into account the effects when proving the properties of programs. The major difficulty in such kind of reasoning is the mismatch between the syntax of operations with effects and their interpretation. Typically, a piece of program with arguments in X that returns a value in Y is not interpreted as a function from X to Y , due to the effects. The best-known algebraic approach to the problem interprets programs including effects with the use of monads: the interpretation is a function from X to T(Y) where T is a monad. This approach has been extendedto Lawvere theories and algebraic handlers. Another approach called, the decorated logic, provides a sort of equational semantics for reasoning about programs with effects. We specialize the approach of decorated logic to the state and the exceptions effects by defining the decorated logic for states (L_st) and the decorated logic for exceptions (L_exc), respectively. This enables us to prove properties of programs involving such effects. Then, we formalize these logics in Coq and certify the related proofs. These logics are built so as to be sound. In addition, we introduce a relative notion of syntactic completeness of a theory in a given logic with respect to a sublogic. We prove that the decorated theory for the global states as well as two decorated theories for exceptions are syntactically complete relatively to their pure sublogics. These proofs are certified in Coq as applications of ourgeneric frameworks
McKinley, Samuel Andrew. « Towards a Neighborhood-Scale Carbon Calculator ». University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1243197959.
Texte intégralEmrich, Lee. « Evaluation of a sexual risk calculator ». Connect to resource, 2009. http://hdl.handle.net/1811/37103.
Texte intégralVaux, Lionel. « λ-calcul différentiel et logique classique : interactions calculatoires ». Phd thesis, Université de la Méditerranée - Aix-Marseille II, 2007. http://tel.archives-ouvertes.fr/tel-00194149.
Texte intégralDans une première partie, on définit un cadre commun pour ces extensions, dans le formalisme des réseaux d'interaction de Lafont, et on y rappelle des résultats de la littérature ou du folklore. On donne en particulier la traduction du λμ-calcul et du λ-barre-μ-calcul dans les réseaux polarisés de Laurent et celle du fragment finitaire du λ-calcul différentiel dans les réseaux différentiels d'Ehrhard et Regnier.
Dans la deuxième partie, on introduit les réseaux différentiels polarisés (RDP), comme l'extension par une polarisation à la Laurent des réseaux différentiels. La pertinence des règles de réduction nouvelles est soulignée par l'étude d'un modèle dénotationnel commun aux réseaux différentiels et aux réseaux polarisés.
Enfin, on présente trois calculs de termes, chacun pouvant être considéré comme une lecture en arrière de tout ou partie des interactions définies par les RDP : un λμ-calcul différentiel, qui correspond à la réunion des réseaux différentiels et des réseaux polarisés ; un λ-barre-μ-calcul avec produit de convolution sur les piles, qui fait intervenir la structure de bigèbre des types polarisés introduite dans les RDP, mais pas la dérivée ; enfin, un λ-barre-μ-calcul différentiel qui développe toute l'expressivité des RDP.
Baudet, Mathieu. « Sécurité des protocoles cryptographiques : aspects logiques et calculatoires ». Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2007. http://tel.archives-ouvertes.fr/tel-00140916.
Texte intégralDans une première partie, nous abordons la sécurité des protocoles dans le cadre logique (formel). Nous montrons comment spécifier différentes propriétés de sécurité des protocoles (secret, authentification,
résistance aux attaques par dictionnaire) au moyen d'un langage de processus et comment les analyser de manière automatique pour un nombre borné de sessions.
La seconde partie traite de la justification cryptographique des modèles logiques. Nous nous intéressons ici à la notion d'équivalence statique, appliquée en particulier au chiffrement et aux données vulnérables aux attaques par dictionnaire (par ex. des mots de passe). Dans ce cadre, nous montrons que sous certaines conditions simples, toute preuve logique d'équivalence statique implique d'indistinguibilité cryptographique des données modélisées.
Köseoğlu, Seda, et Hasan Parlak. « Capacity calculator of rotary draw tube bending ». Thesis, Linnéuniversitetet, Institutionen för teknik, TEK, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-19807.
Texte intégralVincent, Hubert John. « Towards a conjectural calculator for proportional reasoning ». Thesis, University College London (University of London), 1988. http://discovery.ucl.ac.uk/10019687/.
Texte intégralMa, Huiyuan. « A web based compression spring design calculator / ». Compression spring design calculator, 2001. http://wwweng.uwyo.edu/commend/Csdc.
Texte intégralDuclos, Mathilde. « Méthodes pour la vérification des protocoles cryptographiques dans le modèle calculatoire ». Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM002/document.
Texte intégralCritical and private information are exchanged on public environment. To protect it from dishonest users, we use cryptographic tools. Unfortunately, bad conception, poorly written security properties and required security hypothesis lead to attacks, and it may take years before one discover the attack and fix the security schemes involved. In this context, provable security provides formal definitions for security objectives and implied mathematical proofs that these objectives are fullfilled. On another hand, complexity and variety of cryptographic systems are increasing, and proofs by hand are too complicated to write and to verify (Bellare& Rogaway 2004, Shoup 2004, Halevi 2005). Thus, we need computer-assisted verification methods for cryptographic systems. The aim of this thesis is to progress in this direction. More precisely we want significant progress over formal proofs on cryptographic protocols. To verify cryptographic protocols we need to develop a theoritical framework providing: - a precise modelisation for cryptographic protocols and security properties we want to prove in the computationnal model, - designing tactics to automate proofs, - taking into account realistic models for adversary (side-channels...). By the end of the thesis we have enhanced a theoretical framework and computing tools helping verifying cryptographic protocols
Fortier-Dubois, Louis. « De la sécurité calculatoire des protocoles cryptographiques devant la menace quantique ». Master's thesis, Université Laval, 2019. http://hdl.handle.net/20.500.11794/34907.
Texte intégralLetierce, François. « Approche calculatoire pour la déconvolution en aveugle : application à l'imagerie SIMS ». Thesis, Evry-Val d'Essonne, 2007. http://www.theses.fr/2007EVRY0038.
Texte intégralSecondary Ion Mass Spectrometry (SIMS) creates images of atomic distributions on a sample's surface. The point spread function (PSF) is unknown. Blind deconvolution is used to remove the associated blur. This ill-conditionned problem is solved by constraining its solution (regularization). The optimum degree of regularization depends on a parameter to be determined. This parameter is found, as well as those of the PSF, by the generalized cross validation method. A calibration phase reduces the search space for the PSF parameters. The gaussian model used for the PSF is exploited to accelerate the computations. The image is deconvolved by solving a large linear system with the conjugate gradient method. A preconditionner making use of the PSF separability (isotropic or anisotropic) speeds up convergence
Letierce, François Delosme Jean-Marc. « Approche calculatoire pour la déconvolution en aveugle application à l'imagerie SIMS / ». S. l. : Evry-Val d'Essonne, 2007. http://www.biblio.univ-evry.fr/theses/2007/interne/2007EVRY0038.pdf.
Texte intégralMaldonado, Aldo Rene. « Conversations with Hypatia : the use of computers and graphing calculators in the formulation of mathematical arguments in college calculus / ». Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.
Texte intégralShore, Mark A. « The effect of graphing calculators on college students' ability to solve procedural and conceptual problems in developmental algebra ». Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1024.
Texte intégralTitle from document title page. Document formatted into pages; contains v, 136 p. Vita. Includes abstract. Includes bibliographical references (p. 86-93).
Callegari, Pascal. « Aspects conceptuels, expérimentaux et calculatoires de la qualité olfactive ». Dijon, 1998. http://www.theses.fr/1998DIJOS021.
Texte intégralNobel, Lisa. « Creation of a personalized stroke risk index calculator ». Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=95089.
Texte intégralLa connaissance des facteurs propres à l'individu permettrait de réduire le risque de développer un AVC (accident vasculaire cérébral). Cette recherche a pour objectif d'estimer le risque du premier AVC pour des combinaisons de facteurs psychologiques et d'autres liés à la santé et aux styles de vie. Basé sur un modèle de Cox, l'équation de régression donne des estimations individuelles sur 10 ans des risques d'avoir un AVC pour toutes les combinaisons de facteurs de risque, menant à la création d'un calculateur de risque, appelé PSRIC. Sur 17805 personnes suivies dans des banques de données administratives pendant 11 ans en moyenne, 358 ont vécu un AVC. Pour une femme de 60 ans inactive et diabétique qui consomme beaucoup de tabac et d'alcool, le risque de développer un ACV (0,7%) est sept fois supérieur à celui d'une femme de 60 ans en bonne santé. Des recherches ultérieures consisteraient à évaluer l'exactitude et l'impact de la PSRIC.
Tuska, Agnes. « Students errors in graphing calculator-based precalculus classes ». The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu1347032797.
Texte intégralSpitzer, Sandy Margaret. « The role of graphing calculators in students' algebraic thinking ». Access to citation, abstract and download form provided by ProQuest Information and Learning Company ; downloadable PDF file, 135 p, 2008. http://proquest.umi.com/pqdweb?did=1601234511&sid=4&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Texte intégralSheryn, Sarah Louise. « Investigating the appropriation of graphical calculators by mathematics students ». Thesis, University of Leeds, 2006. http://etheses.whiterose.ac.uk/4417/.
Texte intégralCortier, Véronique. « Analyse des protocoles cryptographiques : des modèles symboliques aux modèles calculatoires ». Habilitation à diriger des recherches, Institut National Polytechnique de Lorraine - INPL, 2009. http://tel.archives-ouvertes.fr/tel-00578816.
Texte intégralFidai, Muhammad Hassan. « Implementation of DC Supervisory Control : Optimal Power Flow Calculator ». Thesis, KTH, Industriella informations- och styrsystem, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-155824.
Texte intégralStouris, Konstantinos. « The WeCycle Project – Carbon Calculator development for IT equipment ». Thesis, KTH, Hållbar utveckling, miljövetenskap och teknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-233582.
Texte intégralNär globala utsläpp av mänskliga aktiviteter stiger, försöker globala institutioner och myndigheter att införa nya regler för att minska koldioxidutsläppen. För att företagen ska vara mer effektiva när det gäller minskade koldioxidutsläpp, inte bara från sina produkter men också med sina värdekedjor och produktportföljer, är det viktigt att förstå och kvantifiera dem. För att uppnå detta, har verktyg som kan mäta koldioxidavtrycket av olika företagsverksamheter (kolkalkylatorer) ökat i popularitet de senaste åren. En sektor i vilken företag kan förbättra sin miljöpåverkan är deras IT-utrustning. WeCycle, ett projekt som utvecklats av Greener Scandinavia AB (partner för detta projekt), är en plattform som underlättar återförsäljning av gammal IT-utrustning medan den siktar på att minska miljöpåverkan. Projektet, i samarbete med WeCycle, syftar till att utveckla ett mjukvaruverktyg som beräknar miljöfördelar (kg CO2-ekv.) vid återanvändning av gammal IT-utrustning. Detta kan hjälpa kunder att uppskatta denna fördel, samtidigt som de ger ett CSR-incitament. Projektets resultat var till hjälp för att förstå de potentiella fördelarna med att återanvända IT-utrustning, men också för att identifiera "hotspot" -stadierna i en elektronisk apparats livscykel. Även om det märktes variationer beroende på enhetens typ (t.ex. smartphones jämfört med stationära datorer) är det uppenbart att utsläpp som uppstår under produktionsfasen är av stor betydelse (rankad antingen viktigaste eller näst viktigaste fasen) och därför ger återanvändning relativt stor miljönytta. Förhoppningsvis, genom att kvantifiera dessa fördelar med ett lättanvänt verktyg, kan detta projekt motivera både en beteendemässig förändring i branschen och forskare att vidareutveckla verktyget till att omfatta alla industrisektorer och hushållens konsumtion.
Aguilar, Darla Jean. « Calculator Use In Developmental Mathematics in a Community College ». Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/194530.
Texte intégralBrumberg, Marsha. « A study of the impact graphing calculators have on the achievement in high school pre calculus / ». Full text available online, 2007. http://www.lib.rowan.edu/find/theses.
Texte intégralRagan, Gay A. « Teachers' perceptions and practices regarding the use of calculators in one district over a twenty-year period / ». free to MU campus, to others for purchase, 2000. http://wwwlib.umi.com/cr/mo/fullcit?p9998503.
Texte intégralOnur, Yurdagul. « Effects Of Graphing Calculators On Eighth Grade Students' ». Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12609488/index.pdf.
Texte intégral#8217
ACHIEVEMENT IN GRAPHS OF LINEAR EQUATIONS AND CONCEPT OF SLOPE Ö
nü
r, Yurdagü
l M.S., Department of Elementary Science and Mathematics Education Supervisor: Assist. Prof. Dr. Ayhan Kü
rSat ERBAS May 2008, 76 pages The purpose of this study was to investigate the effects of graphing calculators on eight grade students&
#8217
achievement in graphing linear equations and concept of slope. Pretest-posttest experimental-control group design was utilized in the study. While the students in experimental group (EG) received instruction about graphs of linear equations and concept of slope with graphing calculators, the students in control group (CG) was taught the same topics without using graphing calculators. There were 27 students (13 girls and 14 boys) in each group. Students in both EG and CG was administered an achievement test (i.e., MAT) consisting of questions related to graphing linear equations and slope concept before and after the instruction. Additionally, the teacher and six students from the EG were interviewed. The data obtained from students&
#8217
post test scores of MAT were analyzed by Analysis of Variance (ANOVA). A statistically significant difference was found between the achievements of students in experimental and control groups. However, gender had no statistically significant effect on students&
#8217
post test scores of MAT. Additionally, students&
#8217
pre-test scores of MAT and their mathematics grades of the second semester of the seventh grade (MGS) were analysed by independent samples t-test. The results showed no statistically significant difference. On the other hand, the analysis of interview data revealed that graphing calculators affected students&
#8217
attitudes towards mathematics in a positive way. Students had no considerable difficulty while using graphing calculators and they found studying with graphing calculators enjoyable. In summary, the results of the study showed that when graphing calculators used at elementary school level, they had positive effects on students&
#8217
achievement and in some respects to their attitude. Consequently, integration of graphing calculators to elementary mathematics curriculum may be beneficial for students and teachers.
Karadeniz, Ilyas. « UCSMP Teachers’ Perspectives when Using Graphing Calculators in Advanced Mathematics ». Scholar Commons, 2015. http://scholarcommons.usf.edu/etd/5712.
Texte intégral