Dissertations / Theses on the topic 'Asynchronous'
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 'Asynchronous.'
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.
Manbo, Olof. "Asynchronous Wrapper for Globally Asynchronous Locally Synchronous Systems." Thesis, Linköping University, Department of Electrical Engineering, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1214.
Full textThis thesis is investigating the new globally asynchronous locally synchronous (GALS) technology for integrated circuits. Different types of asynchronous wrappers are tested and a new wrapper design is presented. It also investigates the possibility to use VHDL for asynchronous simulation and synthesis. The conclusions are that the GALS technology is possible to use but that it needs new synthesis tools, because todays tools are designed for synchronous technology.
Gajland, Phillip. "On Asynchronous Group Key Agreement : Tripartite Asynchronous Ratchet Trees." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-281322.
Full textÄmnet om säkra meddelanden har på senare tid skapat uppmärksamhet inom kryptografiska samfundet. För kommunikationer mellan två parter ger paradigmer såsom Double Ratchet, som används i Signal-protokollet, starka bevisbara säkerhetsgarantier som forward secrecy och post-compromise security. Variationer av Signal-protokollet används mycket i praktiken och är inbäddade i flera välkända meddelandetjänster såsom Signal, WhatsApp och Facebook Secret Conversations. Däremot är protokoll som erbjuder lika starka garantier och som skalar väl i gruppsituationer något mindre studerade och ofta eftersatta i praktiken. Detta motiverade behovet av arbetsgruppen IETF Messaging Layer Security (MLS). Det första kontinuerliga gruppnyckelprotokollet (CGKA) som föreslogs var Asynchronous Ratcheting Trees (ART) [Cohn-Gordon et al., 2018] och lade grunden för TreeKEM [Barnes et al., 2019], det CGKA-protokoll som för närvarande föreslagits för MLS. I detta examensarbete föreslår vi ett nytt asynkront gruppnyckelprotokoll baserat på en en-rundad Tripartite Diffie{Hellman [Joux, 2000]. Vidare visar vi att vårt protokoll kan generaliseras för n-ary träd med hjälp av ett en-rundat (n + 1)-väg Diffie-Hellman nyckelutbyte, baserat på en multilinjär mappning [Boneh and Silverberg, 2003]. Vi analyserar ART, TreeKEM och våra förslag ur ett teoretiskt perspektiv samt visar att våra förslag förbättrar kostnaden för uppdateringsoperationer. Slutligen presenterar vi några diskussioner och förbättringar av IETF MLS-standarden.
Prosser, Patrick. "Distributed asynchronous scheduling." Thesis, University of Strathclyde, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296921.
Full textDalrymple, David Allen. "Asynchronous logic automata." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44914.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 89-92).
Numerous applications, from high-performance scientific computing to large, high-resolution multi-touch interfaces to strong artificial intelligence, push the practical physical limits of modern computers. Typical computers attempt to hide the physics as much as possible, running software composed of a series of instructions drawn from an arbitrary set to be executed upon data that can be accessed uniformly. However, we submit that by exposing, rather than hiding, the density and velocity of information and the spatially concurrent, asynchronous nature of logic, scaling down in size and up in complexity becomes significantly easier. In particular, we introduce "asynchronous logic automata", which are a specialization of both asynchronous cellular automata and Petri nets, and include Boolean logic primitives in each cell. We also show some example algorithms, means to create circuits, potential hardware implementations, and comparisons to similar models in past practice.
by David Allen Dalrymple.
S.M.
Chatterjee, Sandeep. "Asynchronous event handing." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/28177.
Full textLieber, Thomas (Thomas Alan). "Understanding asynchronous code." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82411.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 61-64).
JavaScript on the web is difficult to debug due to its asynchronous and dynamic nature. Traditional debuggers are often little help because the language's idioms rely heavily on non-linear control flow via function pointers. The aim of this work is to create a debugging interface that helps users understand complicated control flow in languages like JavaScript. This thesis presents a programming editor extension called Theseus that uses program tracing to provide real-time in-editor feedback so that programmers can answer questions quickly as they write new code and interact with their application. Theseus augments the call graph with semantic edges that allow users to make intuitive leaps through program traces, such as from the start of an asynchronous network request to its response. Participants in lab and classroom studies found Theseus to be a usable replacement for traditional breakpoint and logging tools, though no significant difference was found in their ability to complete programming tasks.
by Thomas Lieber.
S.M.
Nedelchev, Ivailo Marinov. "Asynchronous VLSI design." Thesis, University of Surrey, 1995. http://epubs.surrey.ac.uk/844150/.
Full textJones, Philip William Carleton University Dissertation Engineering Electrical. "Asynchronous sampling wattmeter." Ottawa, 1992.
Find full textHeath, Michael Adam. "Asynchronous Database Drivers." BYU ScholarsArchive, 2010. https://scholarsarchive.byu.edu/etd/2387.
Full textKwan, Terry Tai-Wing. "Corridor asynchronous delta modulation." Thesis, University of Ottawa (Canada), 1989. http://hdl.handle.net/10393/5932.
Full textChevrou, Florent. "Formalisation of asynchronous interactions." Phd thesis, Toulouse, INPT, 2017. http://oatao.univ-toulouse.fr/19493/1/CHEVROU_Florent.pdf.
Full textShankaran, Rajan, University of Western Sydney, and School of Computing and Information Technology. "Asynchronous transfer mode security." THESIS_XXX_CIT_Shankaran_R.xml, 1999. http://handle.uws.edu.au:8081/1959.7/252.
Full textMaster of Science (Hons)
Aghdasi, Farhad. "Self-clocked asynchronous controllers." Thesis, University of Bristol, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.484279.
Full textCunningham, P. A. "Verification of asynchronous circuits." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.598222.
Full textWilcox, Stephen Paul. "Synthesis of asynchronous circuits." Thesis, University of Cambridge, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.624217.
Full textBednarczyk, M. A. "Categories of asynchronous systems." Thesis, University of Sussex, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381623.
Full textFawaz, Khodor Ahmad. "Dynamically reconfigurable asynchronous processor." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/9442.
Full textShankaran, Rajan. "Asynchronous transfer mode security." Thesis, View thesis, 1999. http://handle.uws.edu.au:8081/1959.7/252.
Full textShankaran, Rajan. "Asynchronous transfer mode security /." View thesis, 1999. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20030616.142410/index.html.
Full textThesis submitted in fulfilment of the requirements for the award of the degree Master of Science (Honors) from the University of Western Sydney, Nepean, School of Computing and Information Technology. Bibliography : p. 87-88.
Brockington, Mark Gordon. "Asynchronous parallel game-tree search." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ29023.pdf.
Full textAhmed, Jamil. "Asynchronous design in dynamic CMOS." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0011/MQ34126.pdf.
Full textBerks, Robert. "Performance analysis of asynchronous networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ32813.pdf.
Full textChatall, Kim, and Niklas Johansson. "An Analysis of Asynchronous Data." Thesis, KTH, Matematisk statistik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-122307.
Full textNär man mäter risk och vid finansiellt beslutfattande är det viktigt att det finns skattningar på dagens korrelation samt dess förväntade utveckling. Om en portfölj består av tillgångar som handlas på olika finansiella marknader finns det risk att korrelationen är underskattad. Detta beror på att det existerar en assynkronitet mellan tidsserierna i portföljen, det vill säga att dem handlas under olika tider på dygnet. Syftet med denna uppsats är tvåfaldig. Först anges en modifierad synkroniseringsmodell som antar en AR(1) process istället för en MA(1) som föreslogs av Burns, Engle och Mezrich (1998). Sedan studerar vi den dagliga betingande korrelations- samt varians-kovariansmatrisen med hjälp av en DCC modell. Utförandet av DCC modellen jämförs sedan med RiskMetrics EMWA. Analysen visar i ett konkret exempel att varians-kovariansmatrisen för DCC modellen är längre än för RiskMetrics EMWA modellen. Vår slutsats är att DCC modellen ger sken av att vara ett enkelt och kraftfullt verktyg för att mäta och få en god inblick i hur korrelationer sannolikt kommer att utvecklas på kort sikt.
Joty, Shafiq Rayhan. "Discourse analysis of asynchronous conversations." Thesis, University of British Columbia, 2013. http://hdl.handle.net/2429/45674.
Full textLloyd, David W. "Design methods for asynchronous circuits." Thesis, University of Nottingham, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282817.
Full textElston, Corrie John. "Hades - an asynchronous superscalar processor." Thesis, University of Hertfordshire, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361188.
Full textRose, Kyle R. (Kyle Robert) 1976. "Asynchronous generic key/value database." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86633.
Full textPrice, Michael Ph D. (Michael R. ). Massachusetts Institute of Technology. "Asynchronous data-dependent jitter compensation." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/52771.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 95-96).
Data-dependent jitter (DDJ) caused by lossy channels is a limiting factor in the bit rates that can be achieved reliably over serial links. This thesis explains the causes of DDJ and existing equalization techniques, then develops an asynchronous (clock-agnostic) architecture for DDJ compensation. The compensation circuit alters the transition times of a digital signal to cancel the expected channel-induced delays. It is designed for a 0.35 [mu]m BiCMOS process with a 240 x 140 ¹m footprint and typically consumes 3.4 mA, a small fraction of the current used in a typical transmitter. Extensive simulations demonstrate that the circuit has the potential to reduce channel-induced DDJ by at least 50% at bit rates of 6.25 Gb/s and 10 Gb/s.
by Michael Price.
M.Eng.
Yoneki, Eiko. "ECCO : data centric asynchronous communication." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.612757.
Full textSotiriou, Christos Panagiotis. "Design of an asynchronous processor." Thesis, University of Edinburgh, 2001. http://hdl.handle.net/1842/14458.
Full textLi, Yixin. "Asynchronous two-way relay networks." Thesis, University of Reading, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658033.
Full textMathew, Ajit. "Multicore Scalability Through Asynchronous Work." Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/104116.
Full textMaster of Science
Up until mid-2000s, Moore's law predicted that performance CPU doubled every two years. This is because improvement in transistor technology allowed smaller transistor which can switch at higher frequency leading to faster CPU clocks. But faster clock leads to higher heat dissipation and as chips reached their thermal limits, computer architects could no longer increase clock speeds. Hence they moved to multicore architecture, wherein a single die contains multiple CPUs, to allow higher performance. Now programmers are required to parallelize their code to take advangtage of all the CPUs in a chip which is a non trivial problem. The theoretical speedup achieved by a program on multicore architecture is dictated by Amdahl's law which describes the non parallelizable code in a program as the limiting factor for speedup. For example, a program with 99% parallelizable code can achieve speedup of 20 whereas a program with 50% parallelizable code can only achieve speedup of 2. Therefore to achieve high speedup, programmers need to reduce size of serial section in their program. One way to reduce sequential section in a program is to remove non-critical task from the sequential section and perform the tasks asynchronously using background thread. This thesis explores this technique in two systems. First, a synchronization mechanism which is used co-ordinate access to shared resource called Multi-Version Read-Log-Update (MV-RLU). MV-RLU achieves high performance by removing garbage collection from critical path and performing it asynchronously using background thread. Second, an index structure, Hydralist, which based on the insight that an index structure can be decomposed into two components, search layer and data layer, and decouples updates to both the layer which allows higher performance. Updates to search layer is done synchronously while updates to data layer is done asynchronously using background threads. Evaluation shows that both the systems perform better than state-of-the-art competitors in a variety of workloads.
Amaro, Da Costa Luz Carneiro Joao Paulo. "Asynchronous event-based 3d vision." Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066593/document.
Full textReproducing biological vision in a machine is a challenging problem for which scientists have just scratched the surface. Living organisms are able to per- form complex tasks in an awestruckly efficient manner. The stereovision is one of these complex mechanisms that computer scientists try to replicate with high resolution cameras. This thesis takes on the stereovision problem in a neuromorphic way by mean of a new generation of vision sensors also called ”silicon retinas”. These silicon retinas mimic biological retinas by cap- turing the visual information into the form of asynchronous stream of events that encode contrast change at high temporal precision. These sensors are used to study the importance of the precise timing and the scene temporal dynamics in solving the stereo correspondence problem. We propose one of the first 3D reconstruction methods which is able to produce 3Dmodelsinatrulyevent-basedandasynchronousmanner, fromevent-based visual information. Besides the novelty of proposing a truly temporal- based asynchronous event-driven approach of 3D reconstructions, this work is also able to preserve the native dynamic of the scene. Time as information medium is proven to have a critical role in stereovision. Time can supplement, compensate and even replace the usual luminance and spatial information. This work lays strong foundations for future research on high temporal and event-based dynamic stereo vision. It also opens new promisingperspectivesforsolvingtraditionalmachinevisionproblemsthanks to the use of the new asynchronous vision paradigm
Donaldson, Val. "Asynchronous pipeline analysis and scheduling /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1997. http://wwwlib.umi.com/cr/ucsd/fullcit?p9804026.
Full textWeld, Henry. "On categories of asynchronous circuits." Thesis, The University of Sydney, 1998. https://hdl.handle.net/2123/27575.
Full textWebb, Robert L. "ASYNCHRONOUS MIPS PROCESSORS: EDUCATIONAL SIMULATIONS." DigitalCommons@CalPoly, 2010. https://digitalcommons.calpoly.edu/theses/381.
Full textCorfman, Timothy D. "Creativity in Asynchronous Online Discussions." ScholarWorks, 2017. https://scholarworks.waldenu.edu/dissertations/4209.
Full textLeblond, Rémi. "Asynchronous optimization for machine learning." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEE057/document.
Full textThe impressive breakthroughs of the last two decades in the field of machine learning can be in large part attributed to the explosion of computing power and available data. These two limiting factors have been replaced by a new bottleneck: algorithms. The focus of this thesis is thus on introducing novel methods that can take advantage of high data quantity and computing power. We present two independent contributions. First, we develop and analyze novel fast optimization algorithms which take advantage of the advances in parallel computing architecture and can handle vast amounts of data. We introduce a new framework of analysis for asynchronous parallel incremental algorithms, which enable correct and simple proofs. We then demonstrate its usefulness by performing the convergence analysis for several methods, including two novel algorithms. Asaga is a sparse asynchronous parallel variant of the variance-reduced algorithm Saga which enjoys fast linear convergence rates on smooth and strongly convex objectives. We prove that it can be linearly faster than its sequential counterpart, even without sparsity assumptions. ProxAsaga is an extension of Asaga to the more general setting where the regularizer can be non-smooth. We prove that it can also achieve a linear speedup. We provide extensive experiments comparing our new algorithms to the current state-of-art. Second, we introduce new methods for complex structured prediction tasks. We focus on recurrent neural networks (RNNs), whose traditional training algorithm for RNNs – based on maximum likelihood estimation (MLE) – suffers from several issues. The associated surrogate training loss notably ignores the information contained in structured losses and introduces discrepancies between train and test times that may hurt performance. To alleviate these problems, we propose SeaRNN, a novel training algorithm for RNNs inspired by the “learning to search” approach to structured prediction. SeaRNN leverages test-alike search space exploration to introduce global-local losses that are closer to the test error than the MLE objective. We demonstrate improved performance over MLE on three challenging tasks, and provide several subsampling strategies to enable SeaRNN to scale to large-scale tasks, such as machine translation. Finally, after contrasting the behavior of SeaRNN models to MLE models, we conduct an in-depth comparison of our new approach to the related work
Laveau, Marie. "Asynchronous Self-Stabilizing Stable Marriage." Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG008.
Full textThe Stable Marriage Problem (SMP) is a matching problem where participants have preferences over their potential partners.The objective is to find a matching that is optimal (stable in certain sens) with regard to these preferences.This type of matching has a lot of widely used applications such as the assignment of children to schools, interns to hospitals, kidney transplant patients to donors, as well as taxi scheduling or content delivery on the Internet.Some applications can be solved in a centralized way while others, due to their distributed nature and their complex data, need a different treatment.For example, when applying this problem to the Cloud-Computing context, virtual machines are emulated by real machines located all over the world.A centralized algorithm would cause unbearable delays and be sensible to failures, which is inconceivable for a service meant to be available at any time.On the other hand, when humans are to be matched or involved in a matching, they have the right to keep their personal data private and in particular their list of preferences.Consequently, the preference lists should not be transmitted on the Internet, and even less gathered for a centralized treatment.This is why, distribution, fault-tolerance (by self-stabilization) and privacy are the three main keywords of this thesis.In order to handle these challenges, we provide two distributed self-stabilizing solutions.Such solutions tolerate transient (or short-lived) failures (e.g., memory or message corruptions) of any nodes.The privacy of the preference lists is guaranteed by the two proposed algorithms: lists are not shared, only some binary queries and responses are transmitted.One of the differences between the two algorithms is the communication model: the first algorithm uses the state model while the second algorithm uses the more general register model.In both models, executions proceed in atomic steps and a daemon (distributed unfair daemon) conveys the notion of asynchrony.Under this daemon, the stabilization time can be bounded in term of moves (local computations).This complexity metrics allows to evaluate the necessary computational power or the energy consumption of the algorithm's executions.This is not the case when the stabilization time is measured in rounds since an unbounded number of moves may be executed during a round.The first algorithm, based on the centralized method of Ackermann et al. (SICOMP' 2011), solves the problem in O(n⁴) moves.It also solves some variants of SMP such as the Stable Marriage with indifference, with unacceptable partners, etc.The starting point of the second algorithm is the local detection/global correction scheme of Awerbuch et al. (DA' 1994): a non-self-stabilizing algorithm (with initialization) that satisfies the property of local checkability can be combined with a detector and a reset algorithms.The result of this composition is a self-stabilizing version of the given algorithm.Unfortunately, local checkability definition of DA '1994 does not apply to our case (in particular due to the unfair daemon).Consequently, we propose a new definition.Furthermore, we design a distributed self-stabilizing asynchronous reset algorithm. Using it, the resulting composed algorithm solves SMP in θ(n)² moves in a self-stabilizing way
Gallaba, Keheliya. "Characterizing and refactoring asynchronous JavaScript callbacks." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/56290.
Full textApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
Schrader, U. "Convergence of Asynchronous Jacobi-Newton-Iterations." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199801324.
Full textYuan, Chengan. "Preference in Asynchronous Presentation of Stimuli." The University of Waikato, 2009. http://hdl.handle.net/10289/2795.
Full textBenko, Igor. "ECF processes and asynchronous circuit design." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0003/NQ44753.pdf.
Full textGong, Dah-Chuan. "A metalmodel of asynchronous material transport." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/32868.
Full textSaadallah, Nisrine. "High-speed low-power asynchronous circuits." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80140.
Full textIn Chapter two we present a new asynchronous pipeline logic family with improved latency and throughput compared to several other asynchronous pipeline circuits. The channels between pipeline stages use data encoding and a small set of minimum-delay timing constraints that permit modular design with few dependencies on technology and layout. We develop circuit blocks that implement linear pipelines as well as forking, joining and data-dependent decisions. An implementation in 0.18mum CMOS exhibits a latency of 56ps per pipeline stage and throughput of 4.8-giga data item per second (GDI/s) in Hspice simulation.
We also present the design of a low-control-overhead asynchronous microprocessor integrated with a high-speed sampling FIFO. This is an experiment in exploring the benefits of asynchronous design in high-speed embedded DSP applications. It reports on the design approach, implementation and performance, including a comparison with the synchronous version of the microprocessor.
Zhu, Junren 1965. "The design of asynchronous learning environment /." Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=31565.
Full textResearch results have found that success factors for asynchronous learning include whether students felt part of the online learning group, immediate feedback from instructors, automatic self-test, and indicating student's performance and progress in the course. These findings present basic requirement for the design of ALE. This paper explores all aspects of Asynchronous Learning Environment, including the architecture of ALE and complete database design. The modules of ALE include multimedia presentation, identity verification, intelligent agent, automatic test marking, computer conference, chat & whiteboard, and learning scheduling assistance. The purpose of this research is to make ALE a better way of education than traditional education. A database is designed to fully support these ALE functions.
Guidelines of designing ALE are provided with implementation examples of intelligent agents that providing automatic reminders and learning progress report. Conclusion and further works are discussed at the end of the paper.
The design described in this paper is intended for use by engineering courses. But it can be used by courses of other disciplines without much modification.
Beringer, Lennart. "Asynchronous queue machines with explicit forwarding." Thesis, University of Edinburgh, 2002. http://hdl.handle.net/1842/370.
Full textJohnston-Carey, Helen K. "Myogenesis Is Perturbed By Asynchronous Regeneration." Thesis, The George Washington University, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3631374.
Full textDuchenne muscular dystrophy (DMD) is a recessive genetic disease resulting from mutation in the dystrophin gene that causes loss of the dystrophin protein, which is known to be found in muscle and brain tissue. In muscle, dystrophin is located in the dystrophin-glycoprotein complex (DGC), which has been shown to aid in force transduction across the sarcolemma (Turrina et al, 2013). DMD patients suffer from a progressive degeneration of muscles leading to loss of ambulation, and a shortened lifespan. Dystrophic muscle is characterized by cycles of degenerating fibers, fibrosis, increased fat deposition, split fibers, and hyaline fibers. Glucocorticoids (GC) are the most effective treatment of DMD, but these drugs only slow the progression of the disease and are known for their severe adverse effects. Skeletal muscle regeneration has been shown to be a spatio-temporally regulated process. Our laboratory has developed the theory that the cause for the failure of regeneration in dystrophic muscle is the result of inappropriate cross-talk between areas that are at different stages of regeneration. Furthermore, we hypothesize that glucocorticoids are effective due to their ability to resynchronize gene expression. In order to test our theory, we have developed a model of asynchronous regeneration in healthy muscle by creating cross-talk using multiple injuries with myotoxins. We found that placing injuries 10 days apart produced muscle histology with many of the features of dystrophic muscle. In the future, we can use this model to test the effectiveness of glucocorticoid treatment in resynchronization. As glucocorticoids are also an endogenous hormone, we sought to determine if their secretion was inherently altered in mdx mice. We found that mdx mice have a significantly dampened circadian endogenous glucocorticoid rhythm of secretion compared to wildtype mice. We also found that administering glucocorticoids in line with circadian rhythm of the endogenous hormone improves muscle histology. In the future, we could use more animals in a longer trial to determine if a chronotherapeutic approach to treatment of dystrophin-deficiency improves efficacy and decreases side effects of glucocorticoids. As dystrophin is expressed in regions of the brain responsible for glucocorticoid regulation, it is possible that lack of dystrophin is directly responsible for the change in endogenous glucocorticoid secretion. This is an important novel hypothesis that should be examined in the future.
Lohith, Penmetsa Neela. "Monolithic 3D integration of asynchronous systems." Thesis, Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53113.
Full textWoodward, A. T. "The testing of asynchronous sequential machines." Thesis, Cardiff University, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.354749.
Full text