• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 479
  • 268
  • 38
  • 35
  • 30
  • 22
  • 12
  • 11
  • 10
  • 9
  • 7
  • 4
  • 3
  • 3
  • 3
  • Tagged with
  • 1076
  • 459
  • 409
  • 368
  • 367
  • 343
  • 129
  • 127
  • 123
  • 122
  • 108
  • 108
  • 106
  • 102
  • 101
  • 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.
291

Developing an administrator's manual for high school summer programs

Blinn, Lawrence H. 01 January 1989 (has links)
No description available.
292

Prepared oral presentations and accountable listening activities in accordance with the California English-Language arts framework

Hollihan, Thomas J. 01 January 1995 (has links)
No description available.
293

Skill analysis of throwing to improve feedback

Dyar, Monette Lacaze 01 January 1995 (has links)
No description available.
294

A unit on proportional relationships: A preparation for algebra

Pidgeon, Jennifer Virginie, Yule, Katherine Anne 01 January 1998 (has links)
No description available.
295

An investigation of the effects of an in-service workshop on arithmetic achievement in the middle grades of the Mt. Diablo Unified School District

Teel, Lloyd Sylvester 01 January 1959 (has links)
It is the purpose of this study to determine what effect a two week pre-school, inservice workshop in arithmetic for Mt. Diablo elementary school teachers have arithmetic achievement scores in the middle grades of that district.
296

DISTRIBUTED OPTIMIZATION FOR MACHINE LEARNING: GUARANTEES AND TRADEOFFS

Ye Tian (11166960) 01 September 2021 (has links)
<div>In the era of big data, the sheer volume and widespread spatial distribution of information has been promoting extensive research on distributed optimization over networks. Each computing unit has access only to a relatively small portion of the entire data and can only communicate with a relatively small number of neighbors. The goal of the system is to reach consensus on the optimal parametric model with respect to the entire data among all computing units. Existing work has provided various decentralized optimization algorithms for the purpose. However, some important questions remain unclear: (I) what is the intrinsic connection among different existing algorithms? (II) what is the min-max lower complexity bound for decentralized algorithms? Can one design an optimal decentralized algorithm in the sense that it achieves the lower complexity bound? and (III) in the presence of asynchrony and imperfect communications, can one design linearly convergent decentralized algorithms?</div><div><br></div><div> This thesis aims at addressing the above questions. (I) Abstracting from ad-hoc, specific solution methods, we propose a unified distributed algorithmic framework and analysis for a general class of optimization problems over networks. Our method encapsulates several existing first-order distributed algorithms. Distinguishing features of our scheme are: (a) When each of the agent’s functions is strongly convex, the algorithm converges at a linear rate, whose dependence on the agents’ functions and network topology is decoupled; (b) When the objective function is convex, but not strongly convex, similar decoupling as in (a) is established for the coefficient of the proved sublinear rate. This also reveals the role of function heterogeneity on the convergence rate; (c) The algorithm can adjust the ratio between the number of communications and computations to achieve a rate (in terms of computations) independent on the network connectivity; and (d) A by-product of our analysis is a tuning recommendation for several existing (non-accelerated) distributed algorithms, yielding provably faster (worst-case) convergence rate for the class of problems under consideration. (II) Referring to lower complexity bounds, the proposed novel family of algorithms, when equipped with acceleration, are proved to be optimal, that is, they achieve convergence rate lower bounds. (III) Finally, to make the proposed algorithms practical, we break the synchronism in the agents’ updates: agents wake up and update without any coordination, using information only from immediate neighbors with unknown, arbitrary but bounded delays. Quite remarkably, even in the presence of asynchrony, the proposed algorithmic framework is proved to converge at a linear rate (resp. sublinear rate) when applied to strongly convex (resp. non strongly convex) optimization problems.</div>
297

Návrh a realizace databáze informačního systému pro zpracování rizik obráběcích strojů / Design and implementation of database of information system for processing of machine-tool risks

Švoma, Stanislav Unknown Date (has links)
This thesis deals with analysis and design of a database structure for an information system, which is primary designed for processing of a machine-tool risk. The diploma thesis contains retrieval part, which describes concepts, approches and methods of development of information database systems. The thesis contains theoretical concept and practical realization of database system, which is crucial purpose of this thesis.
298

Development and evaluation of a framework for an engine of innovation in complex adaptive systems

Malik, Pravir January 2017 (has links)
The emerging, multi-disciplinary field of Complex Adaptive Systems (CAS) is an alternative to linear, reductionist thinking. It is based on the observations that real-world systems, regardless of scale, are emergent, complex, adaptive, and evolutionary. In this research the scale of CAS examined range from distances of Planck’s constant to Gigaparsecs. CAS has also heavily leveraged the interpretations of several recent Nobel Laureates and assumes too that the world is random, indeterministic, and chaotic. But randomness, chaos, and indeterminism can hardly create the progressive, increasingly harmonious world that we are a part of. At the heart of this issue lies confusion around what innovation in CAS really is. The essential approach to arriving at a mathematical basis of innovation for CAS here has been to view systems from the outside-in as opposed to from the inside-out and the bottom-up. In this approach innovation is conceptualized as existing in every single space-time point-instant in a system. There is a process of precipitation by which this innovation may express itself through a series of quaternary-based architectural forces that are the prime sources of innovation. These series or arrays of forces may further precipitate by informing organizational signatures. Organizations can be thought of as formations with a unique signature at their center, and can vary in complexity and scale. The unique signature for each organization is usually hidden though by common surface dynamics, and “to innovate” is to work through and change the habitual and common patterns in order to allow the deeper founts of innovation to become active at the surface level. When this happens, it is then that innovation occurs. Once that is more clearly seen then the erected probabilistic and uncertainty functions assumed to be true of the fundamental layers of nature, will be relegated to their place as interim devices in model building. The nature of innovation can be progressively elaborated through inductive reasoning to arrive at a mathematical framework for innovation in CAS. Rather than assume a chaotic, random, indeterministic world as a starting point, this framework can be built assuming a purposeful, ordered world characterized by qualified determinism. Equations to provide insight into the inherent innovation bias of our system, the nature of each point in the system, the broad architectural forces behind the development of organizations, the inherent uniqueness of each organization, the way to think about varying cultures or organizations, and the inherent dynamism of our system, form the edifice of this framework. The resulting model can then be used deductively to reinforce observations, and predictively to suggest directions and / or steps to emerging trends. This research hence, through deriving mathematical equations, and by further applying these to various domains ranging from the quantum, to the atomic, to the cellular, to the astrophysical, has been able to provide mathematical contributions to the theory of CAS and to various CAS application areas. With respect to the theory of CAS, mathematical contributions have been made to understanding the underlying directional bias of CAS activity, understanding the nature of each point in any CAS, and creating mathematical sets for architectural forces that are posited to be behind the development of any CAS. Further, mathematical contributions have been made to understanding the inherent dynamics in any CAS, the dynamics of stagnation and growth in CAS, and the balance of randomness and determinism of any CAS. Mathematical contributions also extend to framing complexity in CAS, understanding what can drive sustainability of CAS, and arriving at a general set of mathematical operators true of any CAS. In terms of application areas in the organizational space, mathematical contributions have been made to understanding uniqueness of organizations, the emergence of uniqueness in organizations, and what constitutes varying culture of organizations. Further, existing work done by Nobel Laureate Ilya Prigogine and Alan Turing have been leveraged to further frame organizational transitions, and to frame and model shifts in innovations, respectively. Further mathematical contributions have been made in a range of CAS areas at different scale and level of complexity. Hence, a series of equations have been derived for the electromagnetic spectrum. Quantum, atomic, and cellular wave equations have been derived building off Schrodinger’s existing Wave Equation. Further qualifications have been derived for Heisenberg’s Uncertainty Principle and an equation has been derived for the integration of different layers of CAS also using Heisenberg’s Uncertainty Principle. Equations for space and time alteration as per Einstein’s Theory of Relativity have also been derived. Additionally, equations for the architectures of quantum particles, periodic table elements, and molecular plans at the cellular level have also been derived. Finally, equations for dark matter and dark energy, non-probabilistic quantum states in quantum computing, and the emergence of CAS in the universe have been derived. In all over 225 equations in 25 different areas have been derived in this dissertation. In fact, as suggested by the CAS equation derived for a unified field, everything, from unseen energy fields, to quantum particles, to atoms, to molecules, to cells, and therefore to all animate and even inanimate and even unseen objects, and therefore even any CAS system regardless of scale would have a high-degree of quaternary intelligence embedded in it and exist simultaneously. Quoting Schrodinger: “What we observe as material bodies and forces are nothing but shapes and variations in the structure of space. Particles are just schaumkommen (appearances). The world is given to me only once, not one existing and one perceived. Subject and object are only one. The barrier between them cannot be said to have broken down as a result of recent experience in the physical sciences, for this barrier does not exist.” This implicit quaternary-based intelligence likely sheds new light on properties such as distributed control, uncertainty, paradox, co-evolution, emergence, amongst others, seen as fundamental to CAS. Thinking about CAS as purposeful, and animated by a mathematically-framed engine of innovation, allows existence to potentially be considered as a unified field. Further, it allows insight and additional solutions to a host of complex problems regardless of scale – at the quantum, cellular, human, organizational, sociotechnical, market, economical, political, and social levels - to be conceptualized, designed, elaborated, and managed differently. / Thesis (PhD)--University of Pretoria, 2017. / Graduate School of Technology Management (GSTM) / PhD / Unrestricted
299

Building consumer mobile money adoption and trust in conditions where infrastructures are unreliable

Unyolo, Thokozani 09 March 2013 (has links)
Mobile money is gaining momentum in emerging markets as the solution to bank those who were previously unbanked. The number of people in Africa who have mobile phones is 644 million subscribers and has for a long time exceeded those who have bank accounts and access to formal financial services (Cobert, Helms,&Parker, 2012). About 2.5 billion adults, just over half of world’s adult population, do not use formal financial services to save or borrow, of this number 2.2 billion of these unserved adults live in Africa, Asia, Latin America, and the Middle East (Chaia et al., 2009). This study sought to explore factors that will determine adoption of mobile money by adapting Venkatesh, Thong and Xu’s (2012) Unified Theory of Acceptance and Technology Use (UTAUT 2) research model to assess the drivers of behavioural intention. The model was extended by incorporating two additional constructs; trust and infrastructure reliability, which have been excluded in previous studies that have been done in developed countries. Further to this, the findings of this study will make a significant contribution to Information Systems (IS) research by identifying factors that influence technology adoption in a developing market context.This main aim of this quantitative research was to empirically discover the deeper motivations that affect the consumer behavioural intention and usage behaviour to use mobile money in Malawi. The value of this paper lies in the use of interviews to unveil new determinants of the Unified Theory of Acceptance and Technology use in the adoption of mobile money in a developing market that influence behavioural intention and usage behaviour. The seven factors examined in this study are performance expectancy (PE), effort expectancy (EE), social influence (SI), facilitating conditions (FC), price value (PV), infrastructure reliability (IR), and trust (T) moderated by gender and age impact on technology adoption. The study sample consists of 508 respondents with a response rate of 84%.The findings indicate that performance expectancy, effort expectancy, facilitating conditions, trust, and price value were positively associated with consumer behavioural intention to use mobile money in Malawi. In addition, infrastructure reliability and social influence were found to have an insignificant effect on consumer behavioural intention to use mobile money.The research adds value on existing studies on technology adoption as it contributes to understanding disruptive technology from a consumer perspective in a developing market which has been excluded in previous research papers. Another value of this paper lies in the use of UTAUT 2 to identify a new construct, trust, as a determinant of mobile money adoption in a consumer perspective which is applicable in Malawi. In addition to this it enables us to contribute to current literature on the emerging mobile money market in Malawi, which is largely under researched. / Dissertation (MBA)--University of Pretoria, 2012. / Gordon Institute of Business Science (GIBS) / unrestricted
300

Entwurf und Implementierung einer neuen Architektur für TESSI

Toschev, Jöran 27 August 2003 (has links)
Das Projekt TESSI beschäftigt sich mit der Entwicklung eines Verfahrens und eines CASE-Werkzeugs zur Analyse von Anforderungstexten und dem parallelen Entwurf eines objektorientierten Modells. Veränderte Anforderungen und geplante Erweiterungen machten eine Überarbeitung der Version 1.1 des Programms TESSI notwendig. Diese Diplomarbeit beschreibt das Reengineering der Altsoftware und den Entwurf sowie die Implementierung der neuen Version 2.0 von TESSI.

Page generated in 0.0362 seconds