Dissertations / Theses on the topic 'Programs with pointers'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Programs with pointers.'
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.
Liang, Donglin. "Developing practical program analyses for programs with pointers." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/8203.
Full textTafat, Asma. "Preuves par raffinement de programmes avec pointeurs." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00874679.
Full textMuehlberg, Jan Tobias. "Model checking pointer safety in compiled programs." Thesis, University of York, 2009. http://etheses.whiterose.ac.uk/841/.
Full textLuo, Chenguang. "Verification of pointer-based programs with partial information." Thesis, Durham University, 2011. http://etheses.dur.ac.uk/578/.
Full textSălcianu, Alexandru D. (Alexandru Doru) 1975. "Pointer analysis and its applications for Java programs." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86781.
Full textIncludes bibliographical references (p. 135-137).
by Alexandru D. Sălcianu.
S.M.
Wang, Jian. "Pointer analysis in Java programs using execution path information /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20WANG.
Full textSălcianu, Alexandru D. (Alexandru Doru) 1975. "Pointer analysis for Java programs : novel techniques and applications." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/38311.
Full textIncludes bibliographical references (p. 193-200).
This dissertation presents a pointer analysis for Java programs, together with several practical analysis applications. For each program point, the analysis is able to construct a points-to graph that describes how local variables and object fields point to objects. Each points-to graph also contains escape information that identifies the objects that are reachable from outside the analysis scope. Our pointer analysis can extract correct information by analyzing only parts of a whole program. First, our analysis analyzes a method without requiring information about its calling context. Instead, our analysis computes parameterized results that are later instantiated for each relevant call site. Second, our analysis correctly handles calls to unanalyzable methods (e.g., native methods). Hence, our analysis can trade precision for speed without sacrificing correctness: if the analysis of a call to a specific callee requires too much time, the analysis can treat that callee as unanalyzable. The results of our analysis enable standard program optimizations like the stack allocation of local objects. More interestingly, this dissertation explains how to extend the analysis to detect pure methods.
(cont.) Our analysis supports a flexible definition of method purity: a method is pure if it does not mutate any object that exists in the program state before the start of the method. Therefore, our analysis allows pure methods to allocate and mutate temporary objects (e.g., iterators) and/or construct complex object structures and return them as a result.
by Alexandru D. Sălcianu.
Ph.D.
Rieger, Stefan Verfasser], and Joost-Pieter [Akademischer Betreuer] [Katoen. "Verification of pointer programs / Stefan Rieger ; Betreuer: Joost-Pieter Katoen." Aachen : Universitätsbibliothek der RWTH Aachen, 2009. http://d-nb.info/1128316080/34.
Full textRieger, Stefan [Verfasser], and Joost-Pieter [Akademischer Betreuer] Katoen. "Verification of pointer programs / Stefan Rieger ; Betreuer: Joost-Pieter Katoen." Aachen : Universitätsbibliothek der RWTH Aachen, 2009. http://d-nb.info/1128316080/34.
Full textSimacek, Jiri. "Vérification de programmes avec structures de données complexes." Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00805794.
Full textZhang, Kun. "Dynamic pointer tracking and its applications." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33936.
Full textXi, Chenchen. "Separation of concerns in concurrent programs using fine grained join points." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/separation-of-concerns-in-concurrent-programs-using-fine-grained-join-points(28778e4f-49db-4713-a37c-01cfa1053280).html.
Full textWirthlin, Joseph Robert 1970. "Identifying enterprise leverage points in Defense Acquisition Program performance." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54850.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 218-223).
Large, complex systems development programs in the Department of Defense are finding it more difficult to deliver desired capabilities to the end user on time and on budget than ever before. Evidence exists that almost all developmental programs on record are over cost and schedule, costing the Department and ultimately the U.S. taxpayer billions of dollars more than anticipated. Numerous studies over many decades have addressed various aspects of the problems plaguing these efforts with many recommendations. Unfortunately, most of these recommendations have been ignored or poorly implemented with limited success. This work embodies an exploratory systems approach to characterize the system of acquiring large, complex, socio-technological systems for the Department of Defense. Through a series of qualitative studies and in-depth interviews with individuals working in the Joint Capabilities Integration Development System (JCIDS), the Planning, Programming, Budgeting, and Execution (PPBE) process, and the Acquisition system, a model of the larger "enterprise of acquisition" or Acquisition System was developed. The model has a scope ranging from the very early beginnings of any program through the conclusion of developmental activities. The methodology used consisted of stringing together the individual pieces of the system defined by probabilistic distributions of time and corresponding probabilistic decision points into a model ideal for discrete-event simulation. An extensive program of verification and validation of the model was carried out to increase confidence in the model and its simulation outcomes.
(cont.) Experimental system interventions, designed to mimic potential policy interventions and/or system changes, were introduced into the model and the corresponding outcomes analyzed. Results show several interventions have varying degrees of influence and suggest no single antidote exists for solving the problems related to Acquisition. Furthermore, many of the outcomes of the system can be described as emergent behaviors versus problems stemming from poor program management, program risk management, or requirements management.
by Joseph Robert Wirthlin.
Ph.D.
Bardou, Romain. "Verification de programmes avec pointeurs a l'aide de regions et de permissions." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00647331.
Full textBardou, Romain. "Vérification de programmes avec pointeurs à l'aide de régions et de permissions." Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112220/document.
Full textDeductive verification consists in annotating programs by a specification, i.e. logic formulas which describe the behavior of the program, and prove that programs verify their specification. Tools such as the Why platform take a program and its specification as input and compute logic formulas such that, if they are valid, the program verifies its specification. These logic formulas can be proven automatically or using proof assistants.When a program is written in a language supporting pointer aliasing, i.e. if several variables may denote the same memory cell, then reasoning about the program becomes particularly tricky. It is necessary to specify which pointers may or may not be equal. Invariants of data structures, in particular, are harder to maintain.This thesis proposes a type system which allows to structure the heap in a modular fashion in order to control pointer aliases and data invariants. It is based on the notions of region and permission. Programs are then translated to Why such that pointers are separated as best as possible, to facilitate reasoning. This thesis also proposes an inference mechanism to alleviate the need to write region operations introduced by the language. A model is introduced to describe the semantics of the language and prove its safety. In particular, it is proven that if the type of a pointer tells that its invariant holds, then this invariant indeed holds in the model. This work has been implemented as a tool named Capucine. Several examples have been written to illustrate the language, and where verified using Capucine
Sangnier, Arnaud. "Vérification de systèmes avec compteurs et pointeurs." Cachan, Ecole normale supérieure, 2008. http://www.theses.fr/2008DENS0051.
Full textIn the past years, formal methods have shown to be a succesfull approach to ensure that the behavior of an informatic system will respect some properties. Among the different existing techniques, model-checking have been recently studied and successfully applied to a lot of models like counter systems, lossy channel systems, pushdown automata, timed automata, etc. In this thesis, we consider two different models to verify programs which manipulate integer variables and pointer variables. In a first part, we deal with counter systems. We define the model and the different restrictions which have been proposed. We then introduce a restricted class of counter systems, called the reversal-bounded counter machines, for which many reachability problems are decidable. We show that this class can be extended keeping the decidability results and we prove that we can decide whether a Vector Addition System with States is reversal-bounded or not, which is not possible for general counter systems. We then study the problem of model-checking counter systems with different temporal logics. The temporal logics we consider allow to speak about the data manipulated by the system. In particular, we show that the model-checking of deterministic one-counter automata with formulae of LTL with registers is decidable, and becomes undecidable when considering non deterministic one-counter automata and two counter automata. In a second part, we introduce the model of pointer systems, which is used to represent programs manipulating single linked lists. We propose an algorithm to translate any pointer system into a bisimilar counter system. This allows us to reuse existing techniques over counter systems to analyze these programs. We then propose an extension of CTL* to verify temporal properties for such programs, and we study the decidability of the model-checking problem for this new logic. Finally we present the tool TOPICS (Translation of Programs Into Counter Systems) which translates a C-like program with pointers and integer variables into a counter system
Mensi, Amira. "Analyse des pointeurs pour le langage C." Phd thesis, Ecole Nationale Supérieure des Mines de Paris, 2013. http://pastel.archives-ouvertes.fr/pastel-00944703.
Full textŠimáček, Jiří. "Verifikace Programů se složitými datovými strukturami." Doctoral thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-261270.
Full textFuredi, Andrew Leo. "Determining Leverage Points: A Program Design for a University/K12 Partnership." Digital Commons at Loyola Marymount University and Loyola Law School, 2009. https://digitalcommons.lmu.edu/etd/551.
Full textAurstad, Tore. "Interactive removal of outlier points in latent variable models using virtual reality." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9159.
Full textThis report investigates different methods in computer graphics and virtual reality that can be applied to develop a system that provides analysis for the changes that occur when removing outlier points in plots for principal component analysis. The main results of the report show that the use of animation gives a better understanding for the movement of individual points in the plots, before and after removal.
Rautela, Himanshu. "Integrating collection-and-delivery points in the strategic design of last-mile e-commerce distribution networks." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122256.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 72-75).
The rapid growth in e-commerce volumes, coupled with customer expectations of faster, flexible and cheaper parcel deliveries is increasing the pressure on retailers to design the most efficient delivery network. Collection-and-delivery points (CDPs) allow for the aggregation of demand and enable reductions in travel time and costs. CDPs also help minimize additional tours arising due to failed deliveries or failed pickups for returns. We formulate an optimization model that integrates CDPs in the design of the overall distribution network, including the location of upstream transshipment facilities. The model accounts for changes in demand density due to the placement of CDPs. It considers demand aggregation at the CDP for both forward and return flows, and the impact of failed deliveries and failed return pickups on the routing cost. The model considers multiple different route options and solves them using extended routing cost approximation formulae thus allowing the implementation of the model on large-scale problems. We then apply the model to solve a real-world case study on the last-mile distribution network of a major Brazilian e-commerce retailer. The results demonstrate that failed deliveries and failed return pickups increase both the last-mile cost and the overall cost of distribution, and CDPs effectively reduce these costs by aggregating the demand and minimizing travel time.
by Himanshu Rautela.
M. Eng. in Supply Chain Management
M.Eng.inSupplyChainManagement Massachusetts Institute of Technology, Supply Chain Management Program
Jansen, Christina Verfasser], Joost-Pieter [Akademischer Betreuer] [Katoen, Marieke [Akademischer Betreuer] Huisman, and Thomas [Akademischer Betreuer] Noll. "Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic / Christina Jansen ; Joost-Pieter Katoen, Marieke Huisman, Thomas Noll." Aachen : Universitätsbibliothek der RWTH Aachen, 2017. http://d-nb.info/1161809023/34.
Full textJansen, Christina [Verfasser], Joost-Pieter [Akademischer Betreuer] Katoen, Marieke [Akademischer Betreuer] Huisman, and Thomas [Akademischer Betreuer] Noll. "Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic / Christina Jansen ; Joost-Pieter Katoen, Marieke Huisman, Thomas Noll." Aachen : Universitätsbibliothek der RWTH Aachen, 2017. http://d-nb.info/1161809023/34.
Full textLugo, Melissa. "The Intersection of Developmental and Life-Course (DLC) Perspectives and Corrections: Viewing the Prison Experience as a Turning Point." University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1613748135844868.
Full textGaugne, Ronan. "Techniques d'analyse statique pour l'aide a la mise au point de programmes avec manipulation explicite de pointeurs." Rennes 1, 1997. http://www.theses.fr/1997REN10133.
Full textMüller, Fabian. "Effective divisors on moduli spaces of pointed stable curves." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://dx.doi.org/10.18452/16866.
Full textThis thesis investigates various questions concerning the birational geometry of the moduli spaces $\Mbar_g$ and $\Mbar_{g,n}$, with a focus on the computation of effective divisor classes. In Chapter 2 we define, for any $n$-tuple $\d$ of integers summing up to $g-1$, a geometrically meaningful divisor on $\Mbar_{g,n}$ that is essentially the pullback of the theta divisor on a universal Jacobian variety under an Abel-Jacobi map. It is a generalization of various kinds of divisors used in the literature, for example by Logan to show that $\Mbar_{g,n}$ is of general type for all $g \geq 4$ as soon as $n$ is big enough. We compute the class of this divisor and show that for certain choices of $\d$ it is irreducible and extremal in the effective cone of $\Mbar_{g,n}$. Chapter 3 deals with a birational model $X_6$ of $\Mbar_6$ that is obtained by taking quadric hyperplane sections of the degree $5$ del Pezzo surface. We compute the class of the big divisor inducing the birational map $\Mbar_6 \dashrightarrow X_6$ and use it to derive an upper bound on the moving slope of $\Mbar_6$. Furthermore we show that $X_6$ is the final non-trivial space in the log minimal model program for $\Mbar_6$. We also give a few results on the unirationality of Weierstraß loci on $\Mbar_{g,1}$, which for $g = 6$ are related to the del Pezzo construction used to construct the model $X_6$. Finally, Chapter 4 focuses on the case $g = 0$. Castravet and Tevelev introduced combinatorially defined hypertree divisors on $\Mbar_{0,n}$ that for $n = 6$ generate the effective cone together with boundary divisors. We compute the class of the hypertree divisor on $\Mbar_{0,7}$, which is unique up to permutation of the marked points. We also give a geometric characterization of it that is analogous to the one given by Keel and Vermeire in the $n = 6$ case.
Seghir, Rachid Mongenet Catherine Loechner Vincent. "Méthodes de dénombrement de points entiers de polyèdres et applications à l'optimisation de programmes." Strasbourg : Université Louis Pasteur, 2007. http://eprints-scd-ulp.u-strasbg.fr:8080/713/01/seghir2006.pdf.
Full textSeghir, Rachid. "Méthodes de dénombrement de points entiers de polyèdres et applications à l'optimisation de programmes." Université Louis Pasteur (Strasbourg) (1971-2008), 2006. https://publication-theses.unistra.fr/public/theses_doctorat/2006/SEGHIR_Rachid_2006.pdf.
Full textThe polyhedral model is a well-known framework in the field of automatic program optimization. Iterations and array references in affine loop nests are represented by integer points in bounded polyhedra, or (parametric) Z-polytopes. In this thesis, three new counting algorithms have been developed: counting integer points in a parametric Z-polytope, in a union of parametric Z-polytopes and in their images by affine functions. The result of such a counting is given by one or many multivariate polynomials in which the coefficients may be periodic numbers. These polynomials, known as Ehrhart quasipolynomials, are defined on sub-sets of the parameter values called validity domains or chambers. Many affine loop nest analysis and optimization methods require such counting algorithms. We applied them in array linearization which achieves memory compression and improves spatial locality of accessed data. Besides program optimization, the proposed algorithms have many other applications, as in mathematics and economics
Pinto, Alexandre Miguel dos Santos Martins. "Every normal logic program has a 2-valued semantics: theory, extensions, applications, implementations." Doctoral thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/6097.
Full textAfter a very brief introduction to the general subject of Knowledge Representation and Reasoning with Logic Programs we analyse the syntactic structure of a logic program and how it can influence the semantics. We outline the important properties of a 2-valued semantics for Normal Logic Programs, proceed to define the new Minimal Hypotheses semantics with those properties and explore how it can be used to benefit some knowledge representation and reasoning mechanisms. The main original contributions of this work, whose connections will be detailed in the sequel, are: • The Layering for generic graphs which we then apply to NLPs yielding the Rule Layering and Atom Layering — a generalization of the stratification notion; • The Full shifting transformation of Disjunctive Logic Programs into (highly nonstratified)NLPs; • The Layer Support — a generalization of the classical notion of support; • The Brave Relevance and Brave Cautious Monotony properties of a 2-valued semantics; • The notions of Relevant Partial Knowledge Answer to a Query and Locally Consistent Relevant Partial Knowledge Answer to a Query; • The Layer-Decomposable Semantics family — the family of semantics that reflect the above mentioned Layerings; • The Approved Models argumentation approach to semantics; • The Minimal Hypotheses 2-valued semantics for NLP — a member of the Layer-Decomposable Semantics family rooted on a minimization of positive hypotheses assumption approach; • The definition and implementation of the Answer Completion mechanism in XSB Prolog — an essential component to ensure XSB’s WAM full compliance with the Well-Founded Semantics; • The definition of the Inspection Points mechanism for Abductive Logic Programs;• An implementation of the Inspection Points workings within the Abdual system [21] We recommend reading the chapters in this thesis in the sequence they appear. However, if the reader is not interested in all the subjects, or is more keen on some topics rather than others, we provide alternative reading paths as shown below. 1-2-3-4-5-6-7-8-9-12 Definition of the Layer-Decomposable Semantics family and the Minimal Hypotheses semantics (1 and 2 are optional) 3-6-7-8-10-11-12 All main contributions – assumes the reader is familiarized with logic programming topics 3-4-5-10-11-12 Focus on abductive reasoning and applications.
FCT-MCTES (Fundação para a Ciência e Tecnologia do Ministério da Ciência,Tecnologia e Ensino Superior)- (no. SFRH/BD/28761/2006)
McCaine, Gina. "Halo orbit design and optimization." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FMcCaine.pdf.
Full textThesis advisor(s): I. Michael Ross, Don Danielson. Includes bibliographical references (p. 39-40). Also available online.
Belleval, Christophe. "Le Pilotage des grands projets de haute technologie dans une organisation centrée sur ses compétences de base : le cas des programmes spatiaux, application à la ligne de produits microsatellites "Myriade" du CNES." Université Louis Pasteur (Strasbourg) (1971-2008), 2001. http://www.theses.fr/2001STR1EC10.
Full textQuinn, Mallory J. "An Evaluation of the POINTE Program to Guide Dance Instructors to use Behavioral Coaching Procedures with their Dance Students." Scholar Commons, 2017. http://scholarcommons.usf.edu/etd/6932.
Full textFinon, Dominique. "Les Etats face à la grande technologie dans le domaine civil : le cas des programmes surgénérateurs." Grenoble 2, 1988. http://www.theses.fr/1988GRE21004.
Full textThis thesis is an analysis of "political economy" about the promotion of large civilian technological projectts by the states in industrial countries. It is founded on an comparative study of fast breeder reactor programmes. The focus is put on the way the economic rationale is distorted in the decision-making process. The economic assessment has always been too optimistic, ignoring the magnitude of economic and commercial uncertainties on the numerous parameters. Presently, a fair assessment would lead to the conclusion that the breeder is economically non-viable. The symbiotic and triangular relationships between technological agencies, major industrial firms and electric utilities are analysed in the five major countries. The analysis shows a common characteristic : the autonomy of nuclear agencies which must be considered as independent economic and political agents, although they are usually considered as subordinate instruments of states. One principal conclusion is the need for market forces' greater influence in technological programs. An other aspect of this question is the reshaping of the technological agencies, when their initial objectives are achieved. An another conclusion is the necessity of political control of great technological and industrial choices, with the opening up of elitist decision-making processes and the competition of economic expertises
Henderson, Tasha Marie. "Analysis of the Community Collaboration Model for School Improvement at Different Time-Points." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555506659058286.
Full textLiu, Jinyan. "Élicitation des préférences pour un rangement multicritère basé sur les points de référence." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLC007.
Full textThe inference of preference model from holistic statements provided by the decision maker (DM), namely, Preference Elicitation (PE), is fundamental to Multi-Criteria Decision Aid (MCDA). In order to conduct plausible, constructive and convincing recommendations, the decision analyst should always take the DM’s preference system into account. However, PE might be tricky, as it involves setting appropriately a series of parameter values of the considered model. Various aspects should be considered. Since the preference models are becoming more and more complicated, PE usually relies on sophisticated algorithms, whereas this brings additionally the computational aspect into consideration.This PhD thesis aims at developing new elicitation algorithms dealing with (possibly inconsistent) pairwise comparisons and processing with (relatively) large input datasets. In particular, a recently introduced multi-criteria ranking method making use of a certain number of reference points is considered. It is known as RMP method as abbreviated for Ranking with Multiple reference Points. More specifically, we are interested in one of its Simplified version, namely S-RMP method. Our contributions are divided into three parts. From the theoretical perspective, we are concerned about (1) the interpretation of reference points in such models and (2) the discriminability of S-RMP model. From the algorithmic perspective, we propose firstly (3) a new linear programming formulation for eliciting S-RMP models from inconsistent pairwise comparisons and also (4) an improved robust elicitation algorithm; besides, (5) a metaheuristic for learning S-RMP models from massive data. (6) Numerical analyses are then performed. (7) The development of two web services is also included. From the practical perspective, (8) we present a realistic case study
Lasnier, Mélissa. "Évaluation de l'implantation et des objectifs collectifs d'un programme d'éducation sexuelle : les points de vue des enseignantes et d'observatrices externes." Master's thesis, Université Laval, 2005. http://hdl.handle.net/20.500.11794/43459.
Full textMenin, Aline. "eSTIMe : un environnement de visualisation pour l'analyse multi-points de vue des mobilités quotidiennes." Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALS010.
Full textThe research field of urban mobility aims at the observation and design of human trips within an urban environment, which information supports decision-making and problem solving within public policies. In this context, there are many experts -- not necessarily transportation specialists -- that need to handle more or less standardized urban data to extract synthetic and easily exploitable knowledge. Hence, public transportation agencies commonly conduct trip-based surveys to collect information about day-to-day travel of the population within a particular territory (i.e. where and when we travel), resulting in large and complex datasets which analysis requires crossing spatial, temporal, thematic and socioeconomic dimensions to enable discoveries of daily urban mobility patterns. This way, information visualization is a suitable approach to support the analysis of urban mobility data, since analysts do not have to learn sophisticated methods to interpret the data visualizations that come to reinforce their cognition and enable the discovery of unstructured insights within the data.Thereby, we propose a visualization framework to assist the analysis of urban mobility through indicators describing complementary objects of interest within the data that allow to address three categories of questions underlying the urban mobility phenomenon. A first question seeks to understand the daily traveling routine of a population and the resulting processes of exchange between places, which can be studied through the exploration of amounts, modalities, direction, and variation of travel flows and trips according to different socioeconomic aspects of individuals and land types. A second questioning concerns the temporal variation of population presence throughout a territory, which allows to understand the use of distinct locations by taking into account the socioeconomic characteristics of the people visiting it and the activities they carry out there. The third question seeks to explain the individuals' need of traveling by studying the temporal ordering of trips and activities of individuals (i.e. daily trajectories) within the spatial context of the territory.Our framework supports the derivation and visual exploration of indicators describing the territory, travel flows and trips, and daily trajectories, over multiple spatio-temporal resolutions and thematic attributes. Our visualization interface allows to disperse visual representations over multiple analytical displays, enabling users to customize the spatial arrangement of visualizations and indicators in meaningful ways according to the ongoing analysis. Furthermore, we propose a movement-based interaction based on the tilting of a tablet that allows to explore the temporal variation of indicators leveraging tactile and tangible input. The conception of our visualization approach followed an interactive evaluation process that consists of successive user-based evaluations aiming to refine a prototype in order to achieve user performance and satisfaction
Pretorius, Luzaan. "A critical analysis of the employees' tax implications of loyalty points awarded to employees in South Africa." Diss., University of Pretoria, 2010. http://hdl.handle.net/2263/26507.
Full textDissertation (MCom)--University of Pretoria, 2010.
Taxation
unrestricted
Peyton, Justin Tyler. "Methods for the Analysis of Developmental Respiration Patterns." Digital Commons @ East Tennessee State University, 2008. https://dc.etsu.edu/etd/1931.
Full textGirard, Pierre. "Formalisation et mise en œuvre d'une analyse statique de code en vue de la vérification d'applications sécurisées." Toulouse, ENSAE, 1996. http://www.theses.fr/1996ESAE0010.
Full textHeuberger, Liana. "Deux points de vue sur les variétés de Fano : géométrie du diviseur anticanonique et classification des surfaces à singularités 1/3(1,1)." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066129/document.
Full textThis thesis concerns Fano varieties, which are central objects within the classification of algebraic varieties.The first problem we discuss involves smooth Fano varieties of dimension four. We study the potential singularities of an anticanonical divisor and determine their explicit local expression. As an intermediate step, we show that they are terminal points, that is the singularities which are closest to the smooth case from the point of view of birational geometry. We then show that the latter result generalizes in arbitrary dimension if we suppose that a nonvanishing conjecture of Kawamata holds.The second approach is to examine Fano varieties of smaller dimensions which admit singularities. The objects we consider are log del Pezzo surfaces with 1/3(1,1) points. This is the simplest example of a rigid singularity, that is it remains unchanged under Q-Gorenstein deformations. We give a complete classification of these surfaces, finding 29 families. We also provide a table describing almost all of them as complete intersections in toric varieties. This work belongs to an overarching project that aims at studying mirror symmetry for del Pezzo surfaces with cyclic quotient singularities
Aguirre, John David Gómez. "Consequences of a dynamical gluon mass." reponame:Repositório Institucional da UFABC, 2017.
Find full textTese (doutorado) - Universidade Federal do ABC, Programa de Pós-Graduação em Física, 2017.
Na literatura encontramos argumentos tanto fenomenológicos quanto teóricos que favorecem o congelamento da constante de acoplamento da QCD a valores moderados no regime infravermelho. O acoplamento pode ser parametrizado em termos de uma massa efetiva para o gluon (mg) obtida dinamicamente através das equações de Schwinger- Dyson, cuja soluções são compatíveis com as simulações da QCD na rede. Primeiro nós consideramos o processo de aniquilação elétron-pósitron em hádrons Re+e- até O(3s) e adotamos o método de smearing sugerido por Poggio, Quinn e Weinberg para confrontar os dados experimentais com a teoria. Nós vamos usar como modelo teórico a QCD com uma constante de acoplamento finita no regime de baixas energias. Para encontrar o melhor fit entre os dados experimentais e teóricos, nós realizamos um test de 2, que dentro das incertezas do modelo , tem um valor mínimo quando mg=QCD está entre 1.2 - 1.4. Esses valores concordam com outras determinações fenomenológicas da razão mg=QCD e levam a uma carga efetiva s(0) 0.7. Nós comentamos como essas cargas efetivas poderiam afetar a escala de massa da dualidade global, a qual indica a fronteira entre a física perturbativa e não perturbativa. Calculamos tanto o potencial efetivo aprimorado no caso da QED escalar e da QCD com um escalar sem cor, como também a evolução do acoplamento escalar do Higgs () no Modelo Padrão. Em ambos os casos consideramos pontos fixos. No caso da QCD com o escalar sem carga de cor tanto a barreira associada ao polo de Landau quanto o mínimo do potencial mudam. Por outro lado, encontramos que a existência dos pontos fixos não perturbativos no infravermelho movem a evolução do acoplamento escalar na direcção da estabilidade. Para certos valores da constante de acoplamento da QCD no infravermelho, o potencial do Modelo Padrão pode ficar estável até a escala de Planck.
Several phenomenological and theoretical arguments favor a freezing of the Quantum Chromodynamics (QCD) coupling constant in the infrared region at one moderate value. This coupling can be parameterized in terms of an effective dynamical gluon mass (mg) which is determined through Schwinger-Dyson equations, whose solutions are compatible with QCD lattice simulations. First we consider the electron-positron annihilation process into hadrons Re+e- up to O(3s) and we adopt the smearing method suggest by Poggio, Quinn and Weinberg to confront the experimental data with theory. As a theoretical model we use the aforementioned QCD coupling constant frozen in the low energy regime. In order to find the best fit between experimental data and theory we perform a 2 study, that, within the uncertainties of the approach, has a minimum value when mg=QCD is in the range 1.2 - 1.4. These values are in agreement with other phenomenological determinations of this ratio and lead to an infrared effective charge s(0) 0.7. We comment how this effective charge may affect the global duality mass scale that indicates the frontier between perturbative and nonperturbative physics. We also compute the improved effective potential in the case of scalar QED and QCD with a colorless scalar and compute the Standard Model scalar boson Higgs coupling () evolution. In both cases we consider fixed points. In the case of QCD with a colorless scalar not only the barrier associated to the Landau pole is changed but the local minimum of the potential is also changed. On the other hand we find that the existence of such nonperturbative infrared fixed point moves the evolution towards stability. For the phenomenological preferred IR value of the QCD coupling constant the standard model Higgs potential may be stable up to the Planck scale.
Korčián, Stanislav. "Systémy řízení skladových operací." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-217747.
Full textGhestem, Murielle. "Quelles propriétés racinaires et quelles espèces-outils pour la stabilisation des points chauds de dégradation en Chine du Sud ?" Phd thesis, AgroParisTech, 2012. http://pastel.archives-ouvertes.fr/pastel-00855792.
Full textMalík, Viktor. "Abstrakce dynamických datových struktur s využitím šablon." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363894.
Full textCronin, Patrick M. "Will a conflict resolution training program for deacons at Friendly Avenue Baptist Church of Greensboro, North Carolina, coupled with case studies, enable these leaders to understand their role as mediators in conflict resolution as pointed out by Christopher W. Moore, James E. White and Robert L. Sheffield?" Online full text .pdf document, available to Fuller patrons only, 2000. http://www.tren.com.
Full textHellberg, Kristina. "Elever på ett anpassat individuellt gymnasieprogram : skolvardag och vändpunkter." Doctoral thesis, Linköpings universitet, Avdelningen för pedagogik i utbildning och skola (PiUS), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11126.
Full textЖужгов, А. И., and A. I. Zhuzhgov. "Разработка web-приложения решения задачи оптимизации затрат на перевозку продукции : магистерская диссертация." Master's thesis, б. и, 2021. http://hdl.handle.net/10995/99886.
Full textThe object of the research is the process of transportation. The subject of the research is points of consumption and points of production, automation of the system for calculating the optimal cost of transportation. Assigned tasks: 1. Possibility of entering, adjusting and saving options for the calculation of optimization. 2. Displaying the calculation results in a graphical form on the user form. The purpose of this work is to create an information Web-application that will allow you to calculate the optimal cost of transportation of products, provide the user with the results of the calculation in a graphical form. The scientific novelty of the results obtained in the work lies in the application of a new method of effective organization and maintenance of specialized algorithmic and software solutions for the optimization of the cost of transportation of products, focused on improving the efficiency of management of cargo transportation processes using modern information processing methods: the use of flexible development methodology (Agile) and the Atlassian JIRA task tracker for project management, interaction with the customer during development, tracking errors, visual display of tasks and monitoring the process of their implementation; functional modeling of processes for the implementation of a web-application for solving the problem of optimizing the costs of transportation of products based on the IDEF0 methodology and Ramus Educational tools; using the method of collective ownership of the program code based on the service (remote repository) Atlassian Bitbucket. The practical significance of the results lies in the fact that the developed software will allow: to calculate the optimal cost of transportation for any number of points of production; for specialists of the transport and logistics operations department, to reduce the time for the formation of reporting documents, to reduce the time to search for the necessary actual reporting information due to the implementation of an ergonomic web interface; for specialists of the information systems support department, it provides conditions for reducing labor costs for maintaining, improving and developing the system, taking into account the wishes of users. The results of the work can also be used in the educational process for training bachelors and undergraduates in the direction "Information systems and technologies".
MAIA, Tania Maria Lacerda. "Planejamento e gestão estratégica para o restaurante universitário da UFC em um cenário de expansão do número de alunos." http://www.teses.ufc, 2008. http://www.repositorio.ufc.br/handle/riufc/2857.
Full textSubmitted by moises gomes (celtinha_malvado@hotmail.com) on 2012-06-25T13:46:33Z No. of bitstreams: 1 2008_dis_TMLMaia.pdf: 344236 bytes, checksum: 714acc538d28b6ec2c8671ff2a52d5cd (MD5)
Approved for entry into archive by Maria Josineide Góis(josineide@ufc.br) on 2012-06-25T14:23:35Z (GMT) No. of bitstreams: 1 2008_dis_TMLMaia.pdf: 344236 bytes, checksum: 714acc538d28b6ec2c8671ff2a52d5cd (MD5)
Made available in DSpace on 2012-06-25T14:23:35Z (GMT). No. of bitstreams: 1 2008_dis_TMLMaia.pdf: 344236 bytes, checksum: 714acc538d28b6ec2c8671ff2a52d5cd (MD5) Previous issue date: 2008
The present work focuses on the analysis of the impacts of the Federal University of Ceará affiliation proposal to the Reuni, concerning attendance to the University Restaurant on a result of the increasing demand, in the perspective of strategic planning and management, based on the actions carried out from 2003 to 2008. For such end, the postulates of Strategic administration and of Learning School have been adopted, having as a reference the present and future scenario and the strategic diagnosis based on the SWOT analysis. The present research (study) adopted the bibliographical, documental and action-research methods. The research shows that the foreseen expansion in the number of meals per day, from 3000 to 6000, will have an impact on the quality of the services delivered to the users, due to the present limitations in infra-structure, equipments, qualified personnel, and, above all, the need for implementing a pattern of management aimed at results. For this new scenario the following measures have been suggested, including a Strategic Plan for 2009-2020, a Tatic Plan for 2009-2012, a performance marker matrix focused on the Balanced scorecard method, besides management pattern guidelines, oriented towards results and users in the specific context of the University restaurant. The actions and management patterns proposed in the strategic plans, when adopted , will allow the University restaurant to have operational infra-structure, staff support and management excellence to assure and contribute to the approval in the service quality from the present percentage of 60.3% aiming to reach the concepts of good and excellent.
Neste trabalho, analisam-se os impactos da Proposta de Adesão da UFC ao REUNI no atendimento do Restaurante Universitário, decorrentes do grande aumento na demanda, sob o prisma do planejamento e da gestão estratégica, focando-se nas ações realizadas no período de 2003 a 2008. Para tanto, utilizam-se como suporte teórico-empírico os postulados da Administração Estratégica e da Escola de Aprendizado, tendo como referencial o cenário atual e futuro e o diagnóstico estratégico formulado com base na análise SWOT. Foram utilizados os métodos de pesquisa bibliográfica, documental e pesquisa-ação. O estudo mostra que a expansão prevista de 3.000 para 6.000 refeições/dia afetará a qualidade dos serviços e do atendimento aos usuários em função das limitações atuais de infra-estrutura física, de equipamentos, de pessoal qualificado e, sobretudo, da necessidade de implantação de um modelo da gestão focada em resultados. Para esse novo cenário, sugere-se um Plano Estratégico para o período 2009-2020, um Plano Tático 2009-2012, uma matriz de indicadores de desempenho focada no método do Balanced scorecard, além das diretrizes do modelo da gestão orientado para resultados e aderentes às peculiaridades do Restaurante Universitário da UFC. As propostas de ação e do modelo de gerenciamento contidos nos planos estratégicos, quando adotadas, darão ao RU condições objetivas de infra-estrutura operacional, suporte de pessoal e excelência da gestão para assegurar e até aumentar a aprovação da qualidade dos serviços que hoje é 60,3% para os atributos Bom e Ótimo.
Salcianu, Alexandru, and Martin Rinard. "A Combined Pointer and Purity Analysis for Java Programs." 2004. http://hdl.handle.net/1721.1/30470.
Full text