Дисертації з теми "Optimal Sequence"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Optimal Sequence".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Grossmann, Steffen. "Statistics of optimal sequence alignments." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=968907466.
Повний текст джерелаStarrett, Dean. "Optimal Alignment of Multiple Sequence Alignments." Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/194840.
Повний текст джерелаAmara-Korba, Enwer. "Optimal sequence and heat integration for multicomponent distillation trains." Thesis, University of Sheffield, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340894.
Повний текст джерелаMora, Castro Andrés Felipe. "Optimal switching sequence model predictive control for power electronics." Tesis, Universidad de Chile, 2019. http://repositorio.uchile.cl/handle/2250/170522.
Повний текст джерелаEn este proyecto de tesis, se propone una estrategia de control predictivo (MPC, por sus siglas en inglés) basada en el concepto de secuencia de conmutación óptima (OSS) recientemente introducido para convertidores de punto neutro enclavado de tres niveles (3L-NPC) conectados a la red eléctrica. La metodología de control propuesta, llamada OSS-MPC en cascada (C-OSS-MPC), considera explícitamente el modulador en su formulación junto con el modelo del sistema. Como se verificó a lo largo de esta tesis, la estrategia C-OSS-MPC está formulada para el control de la corriente o el control directo de la potencia activa/reactiva como variables primarias de control, mientras que el problema del equilibrio de voltaje del enlace CC se resuelve sin utilizar factores de ponderación en un bucle de control interno basado en una novedosa y sencilla estrategia de control MPC. Por lo tanto, la metodología de control propuesta controla de manera óptima tanto el objetivo de control primario como los voltajes de los condensadores de este convertidor de potencia. Bajo esta perspectiva, la dificultad de diseñar el factor de ponderación se evita en este trabajo y el rendimiento del sistema controlado no se ve afectado por un punto de operación particular del convertidor conectado a la red. La estrategia MPC resultante permite operar el convertidor con un espectro armónico predefinido, frecuencia de conmutación fija y una respuesta dinámica rápida y robusta en todo el rango operativo del convertidor de potencia, superando las estrategias MPC existentes en la literatura para los convertidores de potencia. Además, se ha propuesto un nuevo y eficiente algoritmo de optimización para encontrar rápidamente la solución óptima con el fin de hacer posible una implementación en tiempo real de la estrategia de control propuesta. Finalmente, se proporcionan resultados experimentales y de simulación para demostrar la efectividad y el rendimiento de alta calidad de la estrategia de control propuesta, lo que hace que este enfoque de control no solo sea adecuado para las aplicaciones de convertidor de potencia conectado a la red, sino que también para accionamientos eléctricos de alta potencia.
Fischer, Jörg [Verfasser]. "Optimal Sequence-Based Control of Networked Linear Systems / Jörg Fischer." Karlsruhe : KIT Scientific Publishing, 2015. http://www.ksp.kit.edu.
Повний текст джерелаIslas, Anguiano Jose Angel. "Optimal Strategies for Stopping Near the Top of a Sequence." Thesis, University of North Texas, 2015. https://digital.library.unt.edu/ark:/67531/metadc822812/.
Повний текст джерелаNagendra, Somanath. "Optimal stacking sequence design of stiffened composite panels with cutouts." Diss., This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-06062008-170635/.
Повний текст джерелаGermain, Florence. "Estimation du mouvement dans une sequence d'images, en contexte lineaire optimal." Grenoble INPG, 1995. http://www.theses.fr/1995INPG0030.
Повний текст джерелаHunziker, Angela. "Improving multiple sequence alignments using information from libraries of optimal pairwise alignments /." Zürich : ETH, Eidgenössische Technische Hochschule Zürich, [Departement für Informatik, Institut für Wissenschaftliches Rechnen], 2003. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=117.
Повний текст джерелаLuong, Dung Viet Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Optimal training sequence design for MIMO-OFDM in spatially correlated fading environments." Awarded by:University of New South Wales. Electrical Engineering & Telecommunications, 2009. http://handle.unsw.edu.au/1959.4/44513.
Повний текст джерелаEjenstam, Joakim. "Implementing a Time Optimal Task Sequence For Robot Assembly Using Constraint Programming." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-229581.
Повний текст джерелаHirschi, Joseph Christian. "A Dynamic Programming Approach to Identifying Optimal Mining Sequences for Continuous Miner Coal Production Systems." OpenSIUC, 2012. https://opensiuc.lib.siu.edu/dissertations/542.
Повний текст джерелаBarban, Nicola. "Essays on sequence analysis for life course trajectories." Doctoral thesis, Università degli studi di Padova, 2010. http://hdl.handle.net/11577/3421549.
Повний текст джерелаLa tesi è articolata in tre sezioni distinte in cui vengono afffrontati sia aspetti metodologici che analisi empiriche riguardanti l’analisi delle sequenze per lo studio del corso di vita. Nel primo capitolo, viene presentato un confronto tra due metodi olistici per lo studio del corso di vita. Usando dati simulati, si confronta la bontà di classificazione ottenuta con modelli di classi latenti e tecniche di analisi delle sequenze. Le simulazioni sono effettuate introducendo errori di tipo stocastico in gruppi omogenei di traiettorie. Nel secondo capitolo, si propone di studiare l’eterogeneità nei percorsi di vita familiare. Usando un approccio nonparametrico, viene valutata l’associazione tra le distanze ottenute tramite l’algoritmo di Optimal Matching ed un insieme di variabili categoriche. Usando i dati provenienti dall’indagine National Longitudinal Study of Adolescent Health (Add-Health), si studia l’eterogeneità nei percorsi di formazione familiare di un campione di giovani donne statunitensi. La metodologia statistica proposta è una generalizzazione dell’analisi della varianza (ANOVA) . Nell’ultimo capitolo, si presenta un’applicazione dell’analisi delle sequenze per dati longitudinali. Usando i dati sulla transizione alla famiglia dalla prima alla quarta rilevazione nell’indagine Add-Health, vengono studiate le associazioni tra transizioni familiari e diversi indicatori di salute. In particolare, viene studiato come alcune caratteristiche legate alle transizioni familiari (timing, quantum, sequencing) siano associate allo stato generale di salute, depressione e comportamenti a rischio. La selezione e l’effetto di variabili confondenti sono prese in considerazione nell’analisi.
Chen, Kanglin [Verfasser], Dirk [Akademischer Betreuer] Lorenz, and Peter [Akademischer Betreuer] Maaß. "Optimal Control based Image Sequence Interpolation / Kanglin Chen. Gutachter: Dirk Lorenz ; Peter Maaß. Betreuer: Dirk Lorenz." Bremen : Staats- und Universitätsbibliothek Bremen, 2011. http://d-nb.info/1071898078/34.
Повний текст джерелаArango, Nicolas(Nicolas S. ). "Sequence-phase optimal (SPO) [d̳e̳l̳t̳a̳]B₀ field control for lipid suppression and homogeneity for brain magnetic resonance spectroscopic imaging." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/128411.
Повний текст джерелаCataloged from PDF version of thesis. [d̳e̳l̳t̳a̳] in title on title page appears as upper case Greek letter.
Includes bibliographical references (pages 33-35).
This work develops sequence-phase optimal (SPO) [delta]B₀ shimming methods to reduce lipid contamination and improve brain metabolite spectra in proton spectroscopic imaging. A rapidly reconfigurable 32-channel, local-multi-coil-shim-array is used to enhance lipid suppression and narrow metabolite linewidth in magnetic resonance spectroscopic imaging (MRSI) of the brain. The array is optimally reconfigured dynamically during each MRSI repetition period, first during the lipid-suppression phase, by widening the spectral gap between spatially separate lipid and metabolite regions, and then to narrow metabolite linewidth during readout, by brain-only [delta]B₀ homogenization. This sequence-phase-optimal (SPO) shimming approach is demonstrated on four volunteer subjects using a commercial 3T MRI outfitted with a 32-channel integrated RF receive and local multi-coil shim array. This proposed sequence-phase-optimal shimming significantly improves brain-metabolite MRSI in vivo, as measured by lipid suppression, brain metabolite chemical shift, and line widths. The time required to compute patient specific SPO shims negligibly impacted scan time. Sequence-phase-optimal shimming reduced lipid energy in the brain volume across four subjects by 88%, improved NAA FWHM by 23%, and dramatically reduced lipid ringing artifacts in quantified NAA and Glutamate metabolites, without increasing scan time or SAR.
by Nicolas Arango.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
Ngo, Thoi-Nhan. "Contrôle optimal en temps discret et en horizon infini." Thesis, Paris 1, 2016. http://www.theses.fr/2016PA01E062/document.
Повний текст джерелаThis thesis contains original contributions to the optimal control theory in the discrete-time framework and in infinite horizon following the viewpoint of Pontryagin. There are 5 chapters in this thesis. In Chapter 1, we recall preliminary results on sequence spaces and on differential calculus in normed linear space. In Chapter 2, we study a single-objective optimal control problem in discrete-time framework and in infinite horizon with an asymptotic constraint and with autonomous system. We use an approach of functional analytic for this problem after translating it into the form of an optimization problem in Banach (sequence) spaces. Then a weak Pontyagin principle is established for this problem by using a classical multiplier rule in Banach spaces. In Chapter 3, we establish a strong Pontryagin principle for the problems considered in Chapter 2 using a result of Ioffe and Tihomirov. Chapter 4 is devoted to the problems of Optimal Control, in discrete time framework and in infinite horizon, which are more general with several different criteria. The used method is the reduction to finite-horizon initiated by J. Blot and H. Chebbi in 2000. The considered problems are governed by difference equations or difference inequations. A new weak Pontryagin principle is established using a recent result of J. Blot on the Fritz John multipliers. Chapter 5 deals with the multicriteria optimal control problems in discrete time framework and infinite horizon. New weak and strong Pontryagin principles are established, again using recent optimization results, under lighter assumptions than existing ones
Nishijima, Yoshinori. "Effects of single-site and multi-site ventricular pacing on left and right ventricular mechanics and synchrony is there an optimal pacing sequence? /." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1126717344.
Повний текст джерелаMahmud, Mohamed Taher Mustafa. "Optimal design and operation of multivessel batch distillation with fixed product demand. Modelling, simulation and optimisation of design and operation parameters in multivessel batch distillation under fixed product demand scenario and strict product specifications using simple dynamic model in gPROMS." Thesis, University of Bradford, 2010. http://hdl.handle.net/10454/4435.
Повний текст джерелаMishra, Vishal Vijayshankar. "Sequence-to-Sequence Learning using Deep Learning for Optical Character Recognition (OCR)." University of Toledo / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1513273051760905.
Повний текст джерелаYasar, Temel Kaya. "Optimal Pulse Sequences for Magnetic Resonance Elastography." Thesis, University of Illinois at Chicago, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3668654.
Повний текст джерелаMagnetic Resonance Elastography (MRE) is a non-invasive phase contrast MR imaging method that captures the three-dimensional harmonic wave propagation introduced into subject by external actuators. This wave propagation vector field is processed into stiffness maps of various kinds that are used to assess the pathological changes that cannot be detected otherwise with non-invasive imaging methods. As in all other MR imaging methods, long acquisition duration is one of the important limiting factors for MRE. There are different approaches to reduce the scan time, such as reduced motion encoding MRE or fractional multi-frequency MRE; however, these methods are all at the cost of the reduced signal to noise ratio (SNR) or reduced phase to noise ratio (PNR). Recently we have introduced two accelerated MRE methods, which do not compromise SNR or PNR while reducing the acquisition time by a factor of three compared to the conventional MRE methods. The first one is Selective Spectral Displacement Projection (SDP) MRE method that can encode a mechanical motion of multiple frequency components at once. The second one is SampLe Interval Modulation (SLIM) MRE which can encode the mono-frequency motion in multiple directions concurrently. In this dissertation, I propose a final optimal method that integrates the technique developed in SLIM MRE into SDP MRE, namely Unified sampLing Time Interval ModulATion (ULTIMATe) MRE. This method is the optimal MRE method in the sense that it can reach the limit of time efficiency without sacrificing SNR and PNR. A new mathematical framework was introduced to accommodate all three methods while preventing any ambiguity which might otherwise can occur with the existing MRE notation.
Andrews, Robert J. "Optical flow from color image sequences /." St. Lucia, Qld, 2004. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe17830.pdf.
Повний текст джерелаBrujordet, Anders. "Finding an Optimal Approach for Indexing DNA Sequences." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11974.
Повний текст джерелаFulton, John R. "Sensor orientation in image sequence analysis /." Connect to thesis, 2007. http://eprints.unimelb.edu.au/archive/00003510.
Повний текст джерелаGroussin, Mathieu. "Résurrection du passé à l’aide de modèles hétérogènes d’évolution des séquences protéiques." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10201/document.
Повний текст джерелаThe molecular reconstruction and resurrection of ancestral proteins is the major issue tackled in this thesis manuscript. While fossil molecular data are almost nonexistent, phylogenetic methods allow to estimate what were the most likely ancestral protein sequences along a phylogenetic tree describing the relationships between extant sequences. With these ancestral sequences, several biological hypotheses can be tested, from the evolution of protein function to the inference of ancient environments in which the ancestors were adatapted. These probabilistic estimations of ancestral sequences depend on substitution models giving the different probabilities of substitution between all pairs of amino acids. Classicaly, substitution models assume in a simplistic way that the evolutionary process remains homogeneous (constant) among sites of the multiple sequence alignment or between lineages. During the last decade, several methodological improvements were realised, with the description of substitution models allowing to account for the heterogeneity of the process among sites and in time. During my thesis, I developed new heterogeneous substitution models in Maximum Likelihood that were proved to better fit the data than any other homogeneous or heterogeneous models. I also demonstrated their better performance regarding the accuracy of ancestral sequence reconstruction. With the use of these models to reconstruct or resurrect ancestral proteins, my coworkers and I showed the adapation to temperature is a major determinant of evolutionary rates in Archaea. Furthermore, we also deciphed the nature of the phylogenetic signal informing substitution models to infer a non-parsimonious scenario for the adaptation to temperature during early Life on Earth, with a non-hyperthermophilic last universal common ancestor living at lower temperatures than its two descendants. Finally, we showed that the use of heterogeneous models allow to improve the functionality of resurrected proteins, opening the way to a better understanding of evolutionary mechanisms acting on biological sequences
Birger, Christopher. "Optimal Coherent Reconstruction of Unstructured Mesh Sequences with Evolving Topology." Thesis, Linköpings universitet, Medie- och Informationsteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-112095.
Повний текст джерелаMustofadee, Affan. "Classification of muscles from ultrasound image sequences." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-2391.
Повний текст джерелаThe analysis of the health condition in Rheumatoid Arthritis (RA) remains a qualitative process dependent on visual inspection by a clinician. Fully automatic techniques that can accurately classify the health of the muscle have yet to be developed. The intended purpose of this work is to develop a novel spatio-temporal technique to assist in a rehabilitation program framework, by identifying motion features inherited in the muscles in order to classify them as either healthy or diseased. Experiments are based on ultrasound image sequences during which the muscles were undergoing contraction. The proposed system uses an optical flow technique to estimate the velocity of contraction. Analyzing and manipulating the velocity vectors reveal valuable information which encourages the extraction of motion features to discriminate the healthy against the sick. Experimental results for classification prove helpful in essential developments of therapy processes and the performance of the system has been validated by the cross-validation technique “leave-one-out”. The method leads to an analytical description of both the global and local muscle’s features in a way which enables the derivation of an appropriate strategy for classification. To our knowledge this is the first reported spatio-temporal method developed and evaluated for RA assessment. In addition, the progress of physical therapy to improve strength of muscles in RA patients has also been evaluated by the features used for classification.
Lappas, Pelopidas. "Optimal motion estimation of features and objects in long image sequences." Thesis, University of Southampton, 2004. https://eprints.soton.ac.uk/265064/.
Повний текст джерелаVerlet, Jan Raf Rogier. "Controlling electronic and molecular dynamics using optical pulse sequences." Thesis, King's College London (University of London), 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397922.
Повний текст джерелаBuratto, Steven Keith Weitekamp Daniel P. "Time-sequenced optical nuclear magnetic resonance of gallium arsenide /." Diss., Pasadena, Calif. : California Institute of Technology, 1993. http://resolver.caltech.edu/CaltechETD:etd-11092004-164546.
Повний текст джерелаCho, Jin Woo. "Advanced optical receivers using cross layer optimization and maximum-likelihood sequence detection /." May be available electronically:, 2009. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерелаDunning, Alexander. "Coherent atomic manipulation and cooling using composite optical pulse sequences." Thesis, University of Southampton, 2014. https://eprints.soton.ac.uk/364735/.
Повний текст джерелаReysset, Aurelien. "Conception préliminaire d'actionneurs électromécaniques - outils d'aide à la spécification et à la génération de procédures de dimensionnement pour l'optimisation." Thesis, Toulouse, INSA, 2015. http://www.theses.fr/2015ISAT0003/document.
Повний текст джерелаThe aim of this thesis is to bring a package of software tools included in a whole methodology dealing with mechatronic systems design. It comes as an add-on to the work already carried out at the laboratory in the field of the new generation of aircraft actuation systems: electromechanical actuators (EMA). This technology triggers new problematics leading the engineers to modify their development process as early as the specification phase, when mission profiles have to be generated/transformed/analyzed in order to simplify the design and ensure the validation step. Thus a Simulink toolbox has been created to meet the need for an information translator working as an intermediate between airframer and system-supplier. As for all the embedded systems, the designer has to face some performance-lifetime-integration trade-off, which can be considered as an optimization problem described by a set of equations and constraints. Particular attention is paid here to the conditioning of those explicit equations in order to obtain a standardized calculation sequence adapted to many optimization algorithms. The method and implemented software, both based on the graph theory, interact with the designer to inform him on the possible singularity and algebraic loop issues, providing some leads for their resolution. Finally, some preliminary sizing studies of landing gear and primary flight control surfaces (aileron and spoiler) actuation systems are presented to highlight the possibilities brought out by this innovative approach: integrated design with complex kinematics, collaborative multi-partners design, use of response surfaces to speed up the optimization
Bir, Amarpreet Singh. "Optimum stacking sequence design of composite sandwich panel using genetic algorithms." California State University, Long Beach, 2013.
Знайти повний текст джерелаWeld, Andrew Mark. "Optical diffraction-based silicon sensors for the detection of DNA sequences." Thesis, University of Southampton, 2007. https://eprints.soton.ac.uk/47762/.
Повний текст джерелаLee, Rebekah Ann. "Assembly, Annotation and Optical Mapping of the A Subgenome of Avena." BYU ScholarsArchive, 2017. https://scholarsarchive.byu.edu/etd/7238.
Повний текст джерелаZapata, Iván R. "Detecting humans in video sequences using statistical color and shape models." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1058/ivan%5Fthesis2.pdf.
Повний текст джерелаTitle from first page of PDF file. Document formatted into pages; contains viii, 49 p.; also contains graphics. Vita. Includes bibliographical references (p. 47-48).
Wang, Yunmiao. "Microgap Structured Optical Sensor for Fast Label-free DNA Detection." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/32875.
Повний текст джерелаMaster of Science
Boukebeche, Djemaa. "Resultats limites presque surs optimaux des k-espacements pour une loi uniforme." Paris 6, 1988. http://www.theses.fr/1988PA066096.
Повний текст джерелаLuo, Ying. "Statistical semantic analysis of spatio-temporal image sequences /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/5884.
Повний текст джерелаCorvee, Etienne. "Investigating optical flow and tracking techniques for recovering motion within image sequences." Thesis, Kingston University, 2005. http://eprints.kingston.ac.uk/20293/.
Повний текст джерелаAnderson, Curtis James. "Estimating the Optimal Extrapolation Parameter for Extrapolated Iterative Methods When Solving Sequences of Linear Systems." University of Akron / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=akron1383826559.
Повний текст джерелаStanley, Michael Clare. "A quantitative estimation of the value of geoscience information in mineral exploration: Optimal search sequences." Diss., The University of Arizona, 1994. http://hdl.handle.net/10150/186863.
Повний текст джерелаAue, Volker. "Optimum linear single user detection in direct-sequence spread-spectrum multiple access systems." Thesis, Virginia Tech, 1995. http://hdl.handle.net/10919/43609.
Повний текст джерелаAfter Qualcomm's proposal of the IS-95 standard, code-division multiple access (CDMA) gained popularity as an alternative multiple-access scheme in cellular and personal communication systems (PCS). Besides the advantage of allowing asynchronous operation of the users, CDMA direct-sequence spread spectrum (DS-SS) offers resistance to frequency selective fading and graceful degradation of the performance as the number of users increases.
Orthogonality of the signals in time-division multiple access and frequency-division multiple access is inherent from the nature of the multiple access scheme. In a CDMA system, orthogonality of the signals is not guaranteed in general. Consequently, the performance of conventional correlation receivers suffers.
Sub-optimum receivers which use knowledge of the interfering signals have been investigated by other researchers. These receivers attempt to cancel the multi-user interference by despreading the interfering users. Hence, these receivers require knowledge about all the spreading codes, amplitude levels, and signal timing, and are, in general, computationally intensive.
In this thesis, a technique is presented for which a high degree of interference rejection can be obtained without the necessity of despreading each user. It is shown that exploiting spectral correlation can help mitigate the effects of the multiple-access interference. If code-on-pulse DS-SS modulation is used, a cyclic form of the Wiener filter provides substantial improvements in performance in terms of bit error rate and user capacity. Furthermore, it is shown, that a special error-criterion should be used to adapt the weights of the filter.
The computational complexity of the receiver is equivalent to that of conventional equalizers.
Master of Science
Jie, Cao, and Xie Qiu-cheng. "THE SEARCHING METHOD OF QUASI-OPTIMUM GROUP SYNC CODES ON THE SUBSET OF PN SEQUENCES." International Foundation for Telemetering, 1990. http://hdl.handle.net/10150/613438.
Повний текст джерелаAs the code length is increasing, the search of optimum group sync codes will be more and more difficult, even impossible. This paper gives the searching method of quasi-optimum group sync codes on the small subset of PN sequences -- CVT-TAIL SEARCHING METHOD and PREFIX-SUFFIX SEARCHING METHOD. We have searched out quasi-optimum group sync codes for their lengths N=32-63 by this method and compared them with corresponding optimum group sync codes for their lengths N=32-54. They are very approximative. The total searching time is only several seconds. This method may solves the problems among error sync probability, code length and searching time. So, it is a good and practicable searching method for long code.
Sergison, Darryl James. "Untangling the signals : investigating accretion and photometric variability in young stars." Thesis, University of Exeter, 2015. http://hdl.handle.net/10871/18720.
Повний текст джерелаCosta, Camila Ferreira. "Nearest Neighbors with Operating Time Constraints and Optimal Sequenced Route Queries in Time-Dependent Road Networks." reponame:Repositório Institucional da UFC, 2014. http://www.repositorio.ufc.br/handle/riufc/13358.
Повний текст джерелаSubmitted by Daniel Eduardo Alencar da Silva (dealencar.silva@gmail.com) on 2015-01-23T20:05:38Z No. of bitstreams: 1 2014_dis_cfcosta.pdf: 2126584 bytes, checksum: a2635ed2f82226579173a9e49d960c00 (MD5)
Approved for entry into archive by Rocilda Sales(rocilda@ufc.br) on 2015-09-23T16:29:29Z (GMT) No. of bitstreams: 1 2014_dis_cfcosta.pdf: 2126584 bytes, checksum: a2635ed2f82226579173a9e49d960c00 (MD5)
Made available in DSpace on 2015-09-23T16:29:29Z (GMT). No. of bitstreams: 1 2014_dis_cfcosta.pdf: 2126584 bytes, checksum: a2635ed2f82226579173a9e49d960c00 (MD5) Previous issue date: 2014
In this thesis we study the problems of processing a variation of nearest neighbors and of routing planning queries in time-dependent road networks, i.e., one where travel time along each edge is a function of the departure time. We first study the problem of finding the k points of interest (POIs), for example, museums or restaurants, in which a user can start to be served in the minimum amount of time, accounting for both the travel time to the POI and the waiting time there, if it is closed. Previous works have proposed solutions to answer k-nearest neighbor queries considering the time dependency of the network but not the operating times of the points of interest. We propose and discuss three solutions to this type of query which are based on the previously proposed incremental network expansion and use the A* search algorithm equipped with suitable heuristic functions. We also present experimental results comparing the number of disk access required in each solution with respect to a few different parameters. In the second query, we aim at finding the optimal route that connects a origin to a destination and passes through a number of POIs in a specific sequence imposed on the categories of the POIs. Previous works have addressed this problem, but they do not consider the time dependency of the network. We propose an optimal sequenced route query algorithm which performs an incremental network expansion adopting an A* search. Furthermore, as an OSR query on road network tends to re-expand an extremely large number of nodes, we propose a scheme to reduce the re-expansions. For comparison purposes, we also present a baseline solution which was obtained by extending the previously proposed progressive neighbor exploration algorithm to cope with the time-dependent problem. We performed experiments in synthetic networks comparing the proposed solutions according to the number of expanded vertices in the search and the processing time of the queries.
Nesta dissertação nós estudamos os problemas de processar uma variação de consulta de vizinhos mais próximos e de planejamento de rotas em redes viárias dependentes do tempo. Diferentemente de redes convencionais, onde o custo de deslocamento de um ponto a outro é geralmente dado pela distância física entre esses dois pontos, uma rede dependente do tempo representa de forma mais realista o custo de realizar esse deslocamento, considerando o histórico das condições de tráfego. Mais especificamente, o tempo que um objeto móvel leva para percorrer uma via em tal rede depende do tempo de partida. Por exemplo, o tempo para se deslocar de um ponto a outro em grandes centros durante os horários de pico, quando o tráfego é intenso e as ruas estão congestionadas, é muito maior do que em horários normais. Dentro do contexto apresentado, primeiramente nós estudamos o problema de encontrar k pontos de interesse, como por exemplo, museus ou restaurantes, nos quais um usuário pode começar a ser servido o mais rápido possível. Em outras palavras, nós buscamos minimizar a soma do tempo de viagem até um ponto de interesse mais o tempo de espera até que ele abra, caso esteja fechado. Trabalhos anteriores tratam do problema de encontrar os k vizinhos mais próximos em redes dependentes do tempo, porém, eles não levam em consideração o horário de funcionamento dos pontos de interesse. Desta forma, a consulta abordada nesses trabalhos pode retornar pontos de interesse que estão mais próximos do usuário, considerando um dado tempo de partida, mas que podem demorar para abrir, fazendo com que o usuário espere por muito tempo. Nós propomos e discutimos três soluções para essa consulta que são baseadas em um algoritmo de expansão incremental da rede previamente proposto na literatura e usam o algoritmo de busca A* equipado com funções heurísticas adequadas para cada solução. Com o uso do algoritmo A*, nós visamos reduzir o percentual da rede avaliado na busca, evitando expandir vértices que oferecem uma baixa probabilidade de alcançar nosso objetivo. Também apresentamos resultados experimentais que comparam o número de acessos ao disco exigido em cada solução em relação a alguns parâmetros diferentes e que indicam em que casos deve-se optar por cada solução. Na segunda consulta, nós visamos encontrar a rota ótima que conecta uma dada origem a um dado destino e que passa por uma série de pontos de interesse pertencentes a categorias determinadas pelo usuário em uma certa ordem também especificada pelo usuário. Esse tipo de consulta é conhecida como OSR, do inglês, Optimal Sequenced Route, na literatura. Como exemplo, considere que alguém está indo do trabalho para casa e no seu caminho deseja passar em um banco para sacar dinheiro e depois ir a um restaurante para jantar. Embora existam vários bancos e restaurantes em uma cidade, uma consulta OSR deve procurar pelo banco e pelo restaurante que minimizam o custo da viagem do trabalho para casa. Trabalhos anteriores propuseram soluções para consultas OSR em redes com arestas de custo fixo, mas nenhum deles considerou que esse custo pode variar de acordo com o tempo de partida. Nós propomos uma solução ótima para esse problema que, assim como as abordagens propostas para o problema anterior, expande a rede incrementalmente e usa o algoritmo A* para guiar essa expansão. Além disso, como uma consulta OSR em redes viárias tende a re-expandir um número muito grande de vértices, nós incorporamos à essa solução um esquema para reduzir o número de re-expansões. Nós também apresentamos resultados experimentais que mostram a eficiência dessa solução em comparação com uma solução de base que foi obtida a partir da estensão de um algoritmo anteriormente proposto na literatura. Todos os experimentos foram realizados em redes sintéticas.
Masi, Marco. "Modeling of sequences of Silicon micro-Resonators for On-Chip Optical Routing and Switching." Doctoral thesis, Università degli studi di Trento, 2011. https://hdl.handle.net/11572/369141.
Повний текст джерелаMasi, Marco. "Modeling of sequences of Silicon micro-Resonators for On-Chip Optical Routing and Switching." Doctoral thesis, University of Trento, 2011. http://eprints-phd.biblio.unitn.it/462/1/Tesi_finale.pdf.
Повний текст джерелаFeuillâtre, Hélène. "Détermination automatique de l'incidence optimale pour l'observation des lésions coronaires en imagerie rotationnelle R-X." Thesis, Rennes 1, 2016. http://www.theses.fr/2016REN1S039/document.
Повний текст джерелаThe thesis work deals with the planning of minimally invasive surgery of coronary artery lesions. The physician performs a coronarography following by a percutaneous transluminal angioplasty. The X-ray rotational angiography permits to visualize the lumen artery under different projection angles in several cardiac cycles. From these 2D projections, a 3D+T reconstruction of coronary arteries can be obtained. Our goal is to determine automatically from this 3D+T sequence, the optimal angiographic viewing angle of the stenotic segment. Several steps are proposed to compute the optimal angular position of the C-arm. Firstly, a mosaic-based tree matching algorithm of the 3D+T sequence is proposed to follow the stenotic lesion in the whole cardiac cycle. A pair-wise inexact tree matching is performed to build a tree union between successive trees. Next, these union trees are merged to obtain the mosaic tree which represents the most complete tree of the sequence. To take into account the non-rigid movement of coronary arteries during the cardiac cycle and their topology variations due to the 3D reconstruction or segmentation, similarity measures based on hierarchical and geometrical features are used. Artificial nodes are also inserted. With this global tree sequence matching, we propose secondly a new method to determine the optimal viewing angle of the stenotic lesion throughout the cardiac cycle. This 2D angiographic view which is proposed for three regions of interest (single segment, multiple segment or bifurcation) is computed from four criteria: the foreshortening, the external and internal overlap and the bifurcation opening angle rates. The optimal view shows the segment in its most extended and unobstructed dimension. This 2D view can be optimal either for the deployment of the stent or for the catheter guidance (from the root to the lesion). Our different algorithms are evaluated on real sequence (CT segmentation) and 41 simulated sequences
Karlsson, Fredrik. "Matting of Natural Image Sequences using Bayesian Statistics." Thesis, Linköping University, Department of Science and Technology, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2355.
Повний текст джерелаThe problem of separating a non-rectangular foreground image from a background image is a classical problem in image processing and analysis, known as matting or keying. A common example is a film frame where an actor is extracted from the background to later be placed on a different background. Compositing of these objects against a new background is one of the most common operations in the creation of visual effects. When the original background is of non-constant color the matting becomes an under determined problem, for which a unique solution cannot be found.
This thesis describes a framework for computing mattes from images with backgrounds of non-constant color, using Bayesian statistics. Foreground and background color distributions are modeled as oriented Gaussians and optimal color and opacity values are determined using a maximum a posteriori approach. Together with information from optical flow algorithms, the framework produces mattes for image sequences without needing user input for each frame.
The approach used in this thesis differs from previous research in a few areas. The optimal order of processing is determined in a different way and sampling of color values is changed to work more efficiently on high-resolution images. Finally a gradient-guided local smoothness constraint can optionally be used to improve results for cases where the normal technique produces poor results.