Dissertations / Theses on the topic 'Time Flow'
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 'Time Flow.'
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.
Langkau, Katharina. "Flows over time with flow dependent transit times." [S.l.] : [s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=968912656.
Full textAssaf, Hamed. "Real-time flow forecasting." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/30815.
Full textApplied Science, Faculty of
Civil Engineering, Department of
Graduate
Liu, Kin-shing. "Improved analysis of flow time scheduling." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B36274379.
Full textLiu, Kin-shing, and 廖建誠. "Improved analysis of flow time scheduling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B36274379.
Full textCondrau, Marc Anton. "Time-resolved fluorescence measurement in flow cytometry /." [S.l.] : [s.n.], 1993. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=10267.
Full textOlsen, Robert. "Time-dependent boundary conditions for multiphase flow." Doctoral thesis, [Trondheim : Norges teknisk-naturvitenskapelige universitet, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-237.
Full textBenson, John D. "Transition to a time periodic flow in a through-flow lid-driven cavity." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/18179.
Full textYuh, Sung H. "Time-lapse seismic monitoring of subsurface fluid flow." [College Station, Tex. : Texas A&M University, 2004. http://hdl.handle.net/1969.1/430.
Full textChibber, Paramjit. "Overland flow time of concentration on flat terrains." Thesis, Texas A&M University, 2004. http://hdl.handle.net/1969.1/1293.
Full textNagy, Naya. "The maximum flow problem, a real time approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ55921.pdf.
Full textBenoit, Stephen M. "Monocular optical flow for real-time vision systems." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23862.
Full textRivest, Chantal. "Topographically forced waves in a time-dependent flow." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63184.
Full textMoore, J. M. "Fluid Flow characterisation using time-lapse electrical imaging." Thesis, University of Birmingham, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.514275.
Full textBrown, Nicholas. "Control-flow Integrity for Real-time Embedded Systems." Digital WPI, 2017. https://digitalcommons.wpi.edu/etd-theses/402.
Full textChao, Jackson Sheng-Kuang. "Analysis of variance impact on manufacturing flow time." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13339.
Full textIncludes bibliographical references (leaves 119-120).
by Jackson Sheng-Kuang Chao.
M.S.
Wisby, C. "Real-time digital imaging techniques for flow visualization." Thesis, University of Surrey, 1989. http://epubs.surrey.ac.uk/848586/.
Full textRaben, Samuel Gillooly. "Determination of Three Dimensional Time Varying Flow Structures." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/51818.
Full textPh. D.
Jones, Lawson Elliott. "A real-time aquifer management tool." Thesis, Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/20743.
Full textDahl, Valerie, and Mikael Davidsson. "Route flow estimation based on time-dependent route choice sets and historical travel times." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-130007.
Full textLangford, William P. "A space-time flow optimization model for neighborhood evacuation." Thesis, Monterey, California : Naval Postgraduate School, 2010. http://edocs.nps.edu/npspubs/scholarly/theses/2010/Mar/10Mar%5FLangford.pdf.
Full textThesis Advisor: Alderson, David L. Second Reader: Church, Richard L. "March 2010." Author(s) subject terms: Evacuation, Network, Flow Optimization, Space-Time network. Includes bibliographical references (p. 41-42). Also available in print.
Richter, Christoph. "Liner impedance modeling in the time domain with flow." Berlin Univ.-Verl. der TU, Univ.-Bibliothek, 2009. http://d-nb.info/999730800/04.
Full textRichter, Christoph. "Liner impedance modeling in the time domain with flow." Berlin Universitätsbibliothek Technische Universität Berlin, 2010. http://d-nb.info/999663321/34.
Full textCicatelli, Giancarlo. "Time warying wake flow characteristics behind turbine blade wakes." Doctoral thesis, Universite Libre de Bruxelles, 1998. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212070.
Full textSchiemanowski, Lothar [Verfasser]. "Long Time Behavior of the Spinor Flow / Lothar Schiemanowski." Kiel : Universitätsbibliothek Kiel, 2018. http://d-nb.info/1163603732/34.
Full textJacobsmeyer, Scott K. (Scott Kenneth). "Implementing flow time reduction using process mapping and innovation." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/12070.
Full textIncludes bibliographical references.
by Scott K. Jacobsmeyer.
M.S.
Al-Shaghdari, Mohammed A. "The evaluation of time-dependent flow in swirl burners." Thesis, University of South Wales, 1997. https://pure.southwales.ac.uk/en/studentthesis/the-evaluation-of-timedependent-flow-in-swirl-burners(e2caff50-bfda-4bc9-85f4-e91182d53bd7).html.
Full textLin, Hung-Yu. "REAL-TIME FLOW QUANTIFICATION TECHNIQUES IN CARDIOVASCULAR MRI APPLICATIONS." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1238594589.
Full textButsuntorn, Nawee. "Time spectral method for rotorcraft flow with vorticity confinement /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Full textGustafsson, Rasmus. "Time study and flow-simulation : Current and future analysis." Thesis, Högskolan i Skövde, Institutionen för ingenjörsvetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-17378.
Full textLettis, D. S. L. "The stability of time-dependent fluid flows." Thesis, University of Exeter, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.379463.
Full textKhajeh, Maryam. "Kinetic measurements using time-resolved NMR spectroscopy." Thesis, University of Manchester, 2010. https://www.research.manchester.ac.uk/portal/en/theses/kinetic-measurements-using-timeresolved-nmr-spectroscopy(aae85bb3-de19-450a-96ab-50e2dfd89da7).html.
Full textNeikter, Carl-Fredrik. "Cache Prediction and Execution Time Analysis on Real-Time MPSoC." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15394.
Full textReal-time systems do not only require that the logical operations are correct. Equally important is that the specified time constraints always are complied. This has successfully been studied before for mono-processor systems. However, as the hardware in the systems gets more complex, the previous approaches become invalidated. For example, multi-processor systems-on-chip (MPSoC) get more and more common every day, and together with a shared memory, the bus access time is unpredictable in nature. This has recently been resolved, but a safe and not too pessimistic cache analysis approach for MPSoC has not been investigated before. This thesis has resulted in designed and implemented algorithms for cache analysis on real-time MPSoC with a shared communication infrastructure. An additional advantage is that the algorithms include improvements compared to previous approaches for mono-processor systems. The verification of these algorithms has been performed with the help of data flow analysis theory. Furthermore, it is not known how different types of cache miss characteristic of a task influence the worst case execution time on MPSoC. Therefore, a program that generates randomized tasks, according to different parameters, has been constructed. The parameters can, for example, influence the complexity of the control flow graph and average distance between the cache misses.
Tomaro, Robert F. "An implicit higher-order spatially accurate scheme for solving time dependent flows on unstructured meshes." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/12264.
Full textJoy, Sijo. "Improving Flow Completion Time and Throughput in Data Center Networks." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32098.
Full textBatten, Douglas James. "Nonlinear time series modeling of some Canadian river flow data." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ54860.pdf.
Full textSchleyer, Marc. "Discrete time analysis of batch processes in material flow systems." Karlsruhe : Univ.-Verl. Karlsruhe, 2007. http://www.uvka.de/univerlag/volltexte/2007/243/.
Full textBurke, Nicholas Allan. "Travel time and flow characteristics of a small stream system." Thesis, Heriot-Watt University, 2002. http://hdl.handle.net/10399/426.
Full textDale, Jason Lee. "A real time implementation of a neuromorphic optic flow algorithm." Thesis, University College London (University of London), 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.400469.
Full textGanguly, Anurupa (Anurupa R. ). "Optical Flow Switching with time deadlines for high-performance applications." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53148.
Full textIncludes bibliographical references (p. 83-87).
This thesis focuses on the design and analysis of scheduling approaches for Optical Flow Switching (OFS) serving high performance applications with very stringent time deadline constraints. In particular, we attempt to meet setup times only slightly longer than one roundtrip time with networks at moderate to high loading. In this work, we propose three possible scheduling mechanisms for OFS connection setup in a WDM network: (i) a simple algorithm, which awards pre-emptive priority to applications requiring time deadline performance; (ii) a multi-path probing mechanism using only coarse average loading information (i.e., no detailed network state information) but without pre-emption; and (iii) a multi-path probing mechanism using periodically updated network state information and without pre-emption. The updating scheme calls for a slow control plane, which refreshes and broadcast network states only periodically on the order of seconds or longer. Our results show that for a low blocking probability, the update interval must be a fraction of the mean service time of transactions. We conclude that this algorithm, a combination of both slow centralized and fast distributed processes, delivers an efficient and scalable control design for a high-speed transport network of the future.
by Anurupa Ganguly.
M.Eng.
Lavrich, Philip Lewis. "Time resolved measurements of rotating stall in axial flow compressors." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14567.
Full textFerris, David S. M. (David Lee) Massachusetts Institute of Technology. "Time-optimal multi-waypoint mission planning in dynamic flow fields." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118662.
Full textThesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2018.
This 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 (pages 43-49).
This thesis demonstrates the use of exact equations to predict time-optimal mission plans for a marine vehicle that visits a number of locations in a given dynamic ocean current field. The missions demonstrated begin and end in the same location and visit a finite number of locations or waypoints in the minimal time; this problem bears close resemblance to that of the classic "traveling salesman," albeit with the added complexity of a continuously changing flow field. The paths, or "legs," between all goal waypoints are generated by numerically solving exact time-optimal path planning level-set differential equations. The equations grow a reachability front from the starting location in all directions. Whenever the front reaches a waypoint, a new reachability front is immediately started from that location. This process continues until one set of reachability fronts has reached all goal waypoints and has returned to the original location. The time-optimal path for the entire mission is then obtained by trajectory backtracking, going through the optimal set of reachability fields in reverse order. Due to the spatial and temporal dynamics, a varying start time results in different paths and durations for each leg and requires all permutations of travel to be calculated. Even though the method is very efficient and the optimal path can be computed serially in real-time for common naval operations, for additional computational speed, a high-performance computing cluster was used to solve the level set calculations in parallel. This method is first applied to several hypothetical missions. The method and distributed computational solver are then validated for naval applications using an operational multi-resolution ocean modeling system of real-world current fields for the complex Philippines Archipelago region. Because the method calculates the global optimum, it serves two purposes. It can be used in its present form to plan multi-waypoint missions offline in conjunction with a predictive ocean current modeling system, or it can be used as a litmus test for approximate future solutions to the traveling salesman problem in dynamic flow fields.
by David Ferris.
Nav. E.
S.M.
Da-qing, Huang. "A Programming Parallel Real-Time Process Data Flow Telemetry System." International Foundation for Telemetering, 1988. http://hdl.handle.net/10150/615239.
Full textIn this paper, a programming parallel real-time process data flow telemetry system is presented. What we developed recently is a advanced telemetry system which can process multi-data-flow of multi-target for mulit-user at the same time. It can be used in RPV, missile and others. Its main characteristics are as follows: Input radio frequency is S wave band (multi-dot frequencies). In telemetry front-end, the chip microprocessor is used to make demodulation and decode. Telemetry preprocessor consists of parallel distributed chip microprocessor mould plates (bus link). There are menu shope man-computer dialogue, figure display, intelligence display and intelligence self-diagnosis in this system. Now, we have developed data compress mould plate, floating-point arithmetic mould plate, derive calculation mould plate and signal process mould plate etc. The main computer is VAX-II.
Rattray, P. "Pulsed flow and time-resolved dielectric spectroscopy of electrorheological fluids." Thesis, Cranfield University, 1994. http://dspace.lib.cranfield.ac.uk/handle/1826/10508.
Full textSiqueira, Sunni Ann. "Calculation of Time-Dependent Heat Flow in a Thermoelectric Sample." ScholarWorks@UNO, 2012. http://scholarworks.uno.edu/honors_theses/24.
Full textSun, Ao Ph D. Massachusetts Institute of Technology. "Singular behaviour and long time behaviour of mean curvature flow." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/126938.
Full textCataloged from the official PDF of thesis.
Includes bibliographical references (pages 125-130).
In this thesis, we investigate two asymptotic behaviours of the mean curvature flow. The first one is the asymptotic behaviour of singularities of the mean curvature flow, and the asymptotic limit is modelled by the tangent flows. The second one is the asymptotic behaviour of the mean curvature flow as time goes to infinity. We will study several problems related to the asymptotic behaviours. The first problem is the partial regularity of the limit. The partial regularity of mean curvature flow without any curvature assumptions was first studied by Ilmanen. We will follow the idea of Ilmanen to study the partial regularity of other asymptotic limit. In particular, we introduce a generalization of Colding-Minicozzi's entropy in a closed manifold, which plays a significant role. The second problem is the genericity of the tangent flows of mean curvature flow. The generic mean curvature flow was introduced by Colding-Minicozzi. Furthermore, they introduced mean curvature flow entropy and use it to study the generic tangent flows of mean curvature flow. We study the multiplicity of the generic tangent flow. In particular, we prove that the generic compact tangent flow of mean curvature flow of surfaces has multiplicity 1. This result partially addresses the famous multiplicity 1 conjecture of Ilmanen. One key idea is defining a local version of Colding-Minicozzi's entropy. We also discuss some related results. These results include a joint work with Zhichao Wang and a joint work with Julius Baldauf.
by Ao Sun.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Mathematics
Glover, Angela. "Interrupting the flow : time-use preference and leader-member exchange." Diss., University of Pretoria, 2019. http://hdl.handle.net/2263/76040.
Full textMini Dissertation (MBA)--University of Pretoria, 2019.
pt2020
Gordon Institute of Business Science (GIBS)
MBA
Unrestricted
Chen, Chun-Ming. "Data Summarization for Large Time-varying Flow Visualization and Analysis." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1469141137.
Full textDembin, Barbara. "Percolation and first passage percolation : isoperimetric, time and flow constants." Thesis, Université de Paris (2019-....), 2020. http://www.theses.fr/2020UNIP7023.
Full textIn this thesis, we study the models of percolation and first passage percolation on the graph Zd, d≥2. In a first part, we study isoperimetric properties of the infinite cluster Cp of percolation of parameter p>pc. Conditioning on the event that 0 belongs to Cp, the anchored isoperimetric constant φp(n) corresponds to the infimum over all connected subgraph of Cp containing 0 of size at most nd, of the boundary size to volume ratio. We prove that n φp (n) converges when n goes to infinity towards a deterministic constant φp, which is the solution of an anisotropic isoperimetric problem in the continuous setting. We also study the behavior of the anchored isoperimetric constant at pc, and the regularity of the φp in p for p>pc. In a second part, we study a first interpretation of the first passage percolation model where to each edge of the graph, we assign independently a random passage time distributed according to a given law G. This interpretation of first passage percolation models propagation phenomenon such as the propagation of water in a porous medium. A law of large numbers is known: for any given direction x, we can define a time constant µG(x) that corresponds to the inverse of the asymptotic propagation speed in the direction x. We study the regularity properties of the µG in G. In particular, we study how the graph distance in Cp evolves with p. In a third part, we consider a second interpretation of the first passage percolation model where to each edge we assign independently a random capacity distributed according to a given law G. The capacity of G edge is the maximal amount of water that can cross the edge per second. For a given vector v of unit norm, a law of large numbers is known: we can define the flow constant in the direction v as the asymptotic maximal amount of water that can flow per second in the direction v per unit of surface. We prove a law of large numbers for the maximal flow from a compact convex source to infinity. The problem of maximal flow is dual to the problem of finding minimal cutset. A minimal cutset is a set of edges separating the sinks from the sources that limits the flow propagation by acting as a bottleneck: all its edges are saturated. In the special case where G({0})>1-pc, we prove a law of large numbers for the size of minimal cutsets associated with the maximal flow in a flat cylinder, where its top and bottom correspond respectively to the source and the sink
Massey, Barton Christopher. "Directions in planning : understanding the flow of time in planning /." view abstract or download file of text, 1999. http://wwwlib.umi.com/cr/uoregon/fullcit?p9940420.
Full textTypescript. Includes vita and abstract. Includes bibliographical references (leaves 147-151). Also available for download via the World Wide Web; free to University of Oregon users. Address:http://wwwlib.umi.com/cr/uoregon/fullcit?p9940420.
Singh, Jatinder. "Aerodynamics of nonrigid bodies undergoing large amplitude time-dependent motions." Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/12132.
Full text