Увійти

Готові списки джерел за темами / Discrete Sequences / Дисертації

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Discrete Sequences.

Дисертації з теми "Discrete Sequences"

Автор: Grafiati

Опубліковано: 30 листопада 2024

Оновлено: 19 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-46 дисертацій для дослідження на тему "Discrete Sequences".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Bastos, Antonio Josefran de Oliveira. "Convergent Sequences of Discrete Structures and Testability." Universidade Federal do CearÃ, 2012. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7654.

Повний текст джерела

Анотація:

FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico<br>In this work, we studied the recent theory of convergent graph sequences and its extensions to permutation and partially ordered sets with fix dimension. Weâve conjectured a lemma of weak regularity on intervals that, if this conjecture is true, we can extend this theory to ordered graphs, which are graphs such that there is a total order on its vertices. We show some interesting relations on permutation and partially ordered sets with ordered graphs. Then, we obtain another proof to the existence of limit objects for al

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Adams, David Bruce. "Optimization Frameworks for Discrete Composite Laminate Stacking Sequences." Diss., Virginia Tech, 2005. http://hdl.handle.net/10919/28631.

Повний текст джерела

Анотація:

Composite panel structure optimization is commonly decomposed into panel optimization subproblems, with specied local loads, resulting in manufacturing incompatibilities between adjacent panel designs. Using genetic algorithms to optimize local panel stacking sequences allows panel populations of stacking sequences to evolve in parallel and send migrants to adjacent panels, so as to blend the local panel designs globally. The blending process is accomplished using the edit distance between individuals of a population and the set of migrants from adjacent panels. The objective function evaluati

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Nickson, Thomas. "Pattern formations with discrete waves and broadcasting sequences." Thesis, University of Liverpool, 2013. http://livrepository.liverpool.ac.uk/9817/.

Повний текст джерела

Анотація:

This thesis defines the Broadcasting Automata model as an intuitive and complete method of distributed pattern formation, partitioning and distributed geometric computation. The system is examined within the context of Swarm Robotics whereby large numbers of minimally complex robots may be deployed in a variety of circumstances and settings with goals as diverse as from toxic spill containment to geological survey. Accomplishing these tasks with such simplistic machines is complex and has been deconstructed in to sub-problems considered to be signif- icant because, when composed, they are able

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Knight, James Robert. "Discrete pattern matching over sequences and interval sets." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186432.

Повний текст джерела

Анотація:

Finding matches, both exact and approximate, between a sequence of symbols A and a pattern P has long been an active area of research in algorithm design. Some of the more well-known byproducts from that research are the diffprogram and grep family of programs. These problems form a sub-domain of a larger area of problems called discrete pattern matching which has been developed recently to characterize the wide range of pattern matching problems. This dissertation presents new algorithms for discrete pattern matching over sequences and develops a new sub-domain of problems called discrete pat

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Spadaro, Santi Gruenhage Gary F. "Discrete sets, free sequences and cardinal properties of topological spaces." Auburn, Ala, 2009. http://hdl.handle.net/10415/1757.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Biyikoglu, Türker, Marc Hellmuth, and Josef Leydold. "Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2009. http://epub.wu.ac.at/390/1/document.pdf.

Повний текст джерела

Анотація:

We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence. We show that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.<br>Series: Research Report Series / Department of Statistics and Mathematics

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Hollander, Michael Israel. "Linear numeration systems, finite beta expansions, and discrete spectrum of substitution dynamical systems /." Thesis, Connect to this title online; UW restricted, 1996. http://hdl.handle.net/1773/5747.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Queiros, Julie. "Analyse des réseaux d'ordre supérieur consruits à partir de séquences historio-géographiques." Electronic Thesis or Diss., Nantes Université, 2024. http://www.theses.fr/2024NANU4018.

Повний текст джерела

Анотація:

L’analyse de réseaux permet d’extraire de l’information sur un système à partir des relations existantes entre ses entités. Ces relations peuvent correspondre à des flux tirés de séquences d’états (i.e. des trajectoires d’agents entre ces entités). La représentation de ces données sous la forme de graphes suppose généralement que ces trajectoires respectent la propriété de Markov ; seul l’état courant est suffisant pour déterminer l’état futur d’un agent. De nombreux travaux ont remis en cause cette hypothèse et proposé d’autres modèles permettant de passer outre : les réseaux d’ordre supérieu

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Alli, Idd Pazi. "Channel estimation in mobile wireless systems." Thesis, KTH, Signalbehandling, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-98754.

Повний текст джерела

Анотація:

The demands of multimedia services from mobile user equipment (UE) for achieving high data rate, high capacity and reliable communication in modern mobile wireless systems are continually ever-growing. As a consequence, several technologies, such as the Universal Mobile Telecommunications System (UMTS) and the 3rd Generation Partnership Project (3GPP), have been used to meet these challenges. However, due to the channel fading and the Doppler shifts caused by user mobility, a common problem in wireless systems, additional technologies are needed to combat multipath propagation fading and Doppl

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Antonini, Gianluca. "A discrete choice modeling framework for pedestrian walking behavior with application to human tracking in video sequences /." [S.l.] : [s.n.], 2006. http://library.epfl.ch/theses/?nr=3382.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Ozakin, Cigdem. "On The Expected Value Of The Linear Complexity Of Periodic Sequences." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605541/index.pdf.

Повний текст джерела

Анотація:

In cryptography, periodic sequences with terms in F2 are used almost everywhere. These sequences should have large linear complexity to be cryptographically strong. In fact, the linear complexity of a sequence should be close to its period. In this thesis, we study the expected value for N-periodic sequences with terms in the finite field Fq. This study is entirely devoted to W. Meidl and Harald Niederreiter&rsquo<br>s paper which is &ldquo<br>On the Expected Value of the Linear Complexity and the k-Error Linear Complexity of Periodic Sequences&rdquo<br>We only expand this paper, there is no i

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Castro, Fabiano José de. "Matemática discreta: tópicos de recorrências lineares e suas aplicações." Universidade Federal da Paraíba, 2016. http://tede.biblioteca.ufpb.br:8080/handle/tede/9339.

Повний текст джерела

Анотація:

Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-08-29T16:22:32Z No. of bitstreams: 1 arquivototal.pdf: 1866226 bytes, checksum: e3b8717f65b0ca3de6fc9c38cc41f7e2 (MD5)<br>Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2017-08-30T11:44:43Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 1866226 bytes, checksum: e3b8717f65b0ca3de6fc9c38cc41f7e2 (MD5)<br>Made available in DSpace on 2017-08-30T11:44:43Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 1866226 bytes, checksum: e3b8717f65b0ca3de6fc9c38cc41f7e2 (MD5) Previous issue date: 2

Стилі APA, Harvard, Vancouver, ISO та ін.

13

PICOZZI, MARTA ANNA ELENA. "Ordinal knowledge and spatial coding of continuous and discrete quantities in infancy." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2010. http://hdl.handle.net/10281/7794.

Повний текст джерела

Анотація:

An important issue in human cognition concerns the origins and nature of the capacity to represent number. A great deal of research has focused on infants’ comprehension of the cardinal properties of number but another essential component of the concept of number is ordinality, which refers to the inherent “greater than” or “less than” relationships between numbers. Until recently, the development of this aspect of human numerical cognition in infancy had received little attention. while little is know. The aim of the current series of studies was to investigate whether the ability to appreci

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Wang, Qianxue. "Création et évaluation statistique d'une nouvelle de générateurs pseudo-aléatoires chaotiques." Thesis, Besançon, 2012. http://www.theses.fr/2012BESA2031.

Повний текст джерела

Анотація:

Dans cette thèse, une nouvelle manière de générer des nombres pseudo-aléatoires est présentée.La proposition consiste à mixer deux générateurs exitants avec des itérations chaotiquesdiscrètes, qui satisfont à la définition de chaos proposée par Devaney. Un cadre rigoureux estintroduit, dans lequel les propriétés topologiques du générateur résultant sont données. Deuxréalisations pratiques d’un tel générateur sont ensuite présentées et évaluées. On montre que lespropriétés statistiques des générateurs fournis en entrée peuvent être grandement améliorées enprocédant ainsi. Ces deux propositions

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Profe, Jörn [Verfasser], Bernd [Akademischer Betreuer] Zolitschka, Bernd [Gutachter] Zolitschka, and Markus [Gutachter] Fuchs. "X-ray fluorescence scanning of discrete samples - a new tool for the geochemical characterization of loess-paleosol sequences / Jörn Profe ; Gutachter: Bernd Zolitschka, Markus Fuchs ; Betreuer: Bernd Zolitschka." Bremen : Staats- und Universitätsbibliothek Bremen, 2018. http://d-nb.info/1165772167/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Chrysostomou, Charalambos. "Characterisation and classification of protein sequences by using enhanced amino acid indices and signal processing-based methods." Thesis, De Montfort University, 2013. http://hdl.handle.net/2086/9895.

Повний текст джерела

Анотація:

Protein sequencing has produced overwhelming amount of protein sequences, especially in the last decade. Nevertheless, the majority of the proteins' functional and structural classes are still unknown, and experimental methods currently used to determine these properties are very expensive, laborious and time consuming. Therefore, automated computational methods are urgently required to accurately and reliably predict functional and structural classes of the proteins. Several bioinformatics methods have been developed to determine such properties of the proteins directly from their sequence in

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Ekvall, Linus. "Airborne Radar Ground Clutter Suppression Using Multitaper Spectrum Estimation : Comparison with Traditional Method." Thesis, Luleå tekniska universitet, Institutionen för system- och rymdteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-70934.

Повний текст джерела

Анотація:

During processing of data received by an airborne radar one of the issues is that the typical signal echo from the ground produces a large perturbation. Due to this perturbation it can be difficult to detect targets with low velocity or a low signal-to-noise ratio. Therefore, a filtering process is needed to separate the large perturbation from the target signal. The traditional method include a tapered Fourier transform that operates in parallel with a MTI filter to suppress the main spectral peak in order to produce a smoother spectral output. The difference between a typical signal echo pro

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Gudjonsen, Ludvik. "Combining Probabilistic and Discrete Methods for Sequence Modelling." Thesis, University of Skövde, Department of Computer Science, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-390.

Повний текст джерела

Анотація:

<p>Sequence modelling is used for analysing newly sequenced proteins, giving indication of the 3-D structure and functionality. Current approaches to the modelling of protein families are either based on discrete or probabilistic methods. Here we present an approach for combining these two approaches in a hybrid model, where discrete patterns are used to model conserved regions and probabilistic models are used for variable regions. When hidden Markov models are used to model the variable regions, the hybrid method gives increased classification accuracy, compared to pure discrete or probabili

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Temirkhanova, Ainur. "Estimates for Discrete Hardy-type Operators in Weighted Sequence Spaces." Doctoral thesis, Luleå tekniska universitet, Matematiska vetenskaper, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-18222.

Повний текст джерела

Анотація:

This PhD thesis consists of an introduction and eight papers, which deal with questions of the validity of some new discrete Hardy type inequalities in weighted spaces of sequences and on the cone of non-negative monotone sequences, and their applications. In the introduction we give an overview of the area that serves as a frame for the rest of the thesis. In particular, a short description of the development of Hardy type inequalities is given. In Paper 1 we find necessary and sufficient conditions on weighted sequences $\omega_i$, $i=1, 2,...,n-1$, $u$ and $v$, for which the operator $$ (S_

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Akhtar, Mahmood Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Genomic sequence processing: gene finding in eukaryotes." Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2008. http://handle.unsw.edu.au/1959.4/40912.

Повний текст джерела

Анотація:

Of the many existing eukaryotic gene finding software programs, none are able to guarantee accurate identification of genomic protein coding regions and other biological signals central to pathway from DNA to the protein. Eukaryotic gene finding is difficult mainly due to noncontiguous and non-continuous nature of genes. Existing approaches are heavily dependent on the compositional statistics of the sequences they learn from and are not equally suitable for all types of sequences. This thesis firstly develops efficient digital signal processing-based methods for the identification of genomic

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Olivieri, Julia. "Drawing DNA Sequence Networks." Oberlin College Honors Theses / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1466511242.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Said, Karim A. "Prolate Spheroidal Sequence Based Transceivers for Time-Frequency Dispersive Channels." Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/86594.

Повний текст джерела

Анотація:

Most existing transceivers are Fourier-centric where complex sinusoids play a central role in the internals of the core building blocks. From the channel perspective, complex sinusoids constitute the fundamental effects in the wireless baseband equivalent channel model; exemplified by the time-invariant and time-varying transfer functions in static and time-varying channel conditions respectively. In addition, complex sinusoids are used as signaling waveforms for data transmission through the channel. The dominant mode of transmission in modern communications is in the form of finite time d

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Matoug, Mahmoud M. "An investigation of misinformation and production control implementation sequence using discrete linear control." Thesis, Loughborough University, 1990. https://dspace.lboro.ac.uk/2134/19487.

Повний текст джерела

Анотація:

Discrete linear control theory is used in this research to examine the effects of system choice and data errors on the performance of production control systems. Two common information flow systems are modelled. These are the Reorder Cycle (ROC) and the Material Requirements Planning (MRP) systems. System choices include the choice of forecasting method, the choice of delivery policy, and the choice of inventory rule. The source of data errors include stock recording errors, delay in stock recording, incorrect bills of material. The other part of the research examines the sequence of implement

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Aitken, Victor C. (Victor Charles) Carleton University Dissertation Engineering Systems and Computer. "Sliding mode state estimation for nonlinear discrete-time systems; applications in image sequence analysis." Ottawa, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Riggle, Matthew. "Runs of Identical Outcomes in a Sequence of Bernoulli Trials." TopSCHOLAR®, 2018. https://digitalcommons.wku.edu/theses/2451.

Повний текст джерела

Анотація:

The Bernoulli distribution is a basic, well-studied distribution in probability. In this thesis, we will consider repeated Bernoulli trials in order to study runs of identical outcomes. More formally, for t ∈ N, we let Xt ∼ Bernoulli(p), where p is the probability of success, q = 1 − p is the probability of failure, and all Xt are independent. Then Xt gives the outcome of the tth trial, which is 1 for success or 0 for failure. For n, m ∈ N, we define Tn to be the number of trials needed to first observe n consecutive successes (where the nth success occurs on trial XTn ). Likewise, we define T

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Shinjo, Masato. "Studies on Non-autonomous Discrete Hungry Integrable Systems Associated with Some Eigenvalue Problems." Kyoto University, 2017. http://hdl.handle.net/2433/227662.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Lora, Roque. "Unmanned Aerial Vehicle Tracking System with Out-Of-Sequence Measurement in a Discrete Time-Delayed Extended Kalman Filter." DigitalCommons@USU, 2017. https://digitalcommons.usu.edu/etd/5441.

Повний текст джерела

Анотація:

The goal of this thesis is to extend the delayed Kalman filter so it can be used with non-linear systems and that it can handle randomized delays on the measurements. In the particular case of this study, the filter is used to estimates the states of an unmanned aerial system. The outputs of the filter are used to point an antenna and a camera towards a UAS. Different scenarios are simulated for the purpose of comparing the efficiency of this technique in various situations.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Fransson, Linnea. "Tribonacci Cat Map : A discrete chaotic mapping with Tribonacci matrix." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-104706.

Повний текст джерела

Анотація:

Based on the generating matrix to the Tribonacci sequence, the Tribonacci cat map is a discrete chaotic dynamical system, similar to Arnold's discrete cat map, but on three dimensional space. In this thesis, this new mapping is introduced and the properties of its matrix are presented. The main results of the investigation prove how the size of the domain of the map affects its period and explore the orbit lengths of non-trivial points. Different upper bounds to the map are studied and proved, and a conjecture based on numerical calculations is proposed. The Tribonacci cat map is used for appl

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Gicquel, Céline. "MIP models and exact methods for the Discrete Lot-sizing and Scheduling Problem with sequence-dependent changeover costs and times." Phd thesis, Ecole Centrale Paris, 2008. http://tel.archives-ouvertes.fr/tel-00375964.

Повний текст джерела

Анотація:

Le dimensionnement des lots de production est une des nombreuses activités survenant dans le cadre de la planification de production. Il a pour objet de déterminer quand et combien produire de façon à réaliser le meilleur compromis possible entre la minimisation des coûts liés à la production (coûts fixes de reconfiguration de la ressource, coûts de stockage...) et la satisfaction de la demande des clients Nous nous intéressons ici un problème de planification de production par lots connu sous le nom de "Discrete Lot-sizing and Scheduling Problem" ou "DLSP". Plus précisément, nous étudions plu

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Ngo, Thoi-Nhan. "Contrôle optimal en temps discret et en horizon infini." Thesis, Paris 1, 2016. http://www.theses.fr/2016PA01E062/document.

Повний текст джерела

Анотація:

Cette thèse contient des contributions originales à la théorie du Contrôle Optimal en temps discret et en horizon infini du point de vue de Pontryagin. Il y a 5 chapitres dans cette thèse. Dans le chapitre 1, nous rappelons des résultats préliminaires sur les espaces de suites à valeur dans et des résultats de Calcul Différentiel. Dans le chapitre 2, nous étudions le problème de Contrôle Optimal, en temps discret et en horizon infini avec la contrainte asymptotique et avec le système autonome. En utilisant la structure d'espace affine de Banach de l'ensemble des suites convergentes vers 0, et

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Meyer, Marie. "Polytopes Associated to Graph Laplacians." UKnowledge, 2018. https://uknowledge.uky.edu/math_etds/54.

Повний текст джерела

Анотація:

Graphs provide interesting ways to generate families of lattice polytopes. In particular, one can use matrices encoding the information of a finite graph to define vertices of a polytope. This dissertation initiates the study of the Laplacian simplex, PG, obtained from a finite graph G by taking the convex hull of the columns of the Laplacian matrix for G. The Laplacian simplex is extended through the use of a parallel construction with a finite digraph D to obtain the Laplacian polytope, PD. Basic properties of both families of simplices, PG and PD, are established using techniques from Ehrha

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Santana, Jailson Santos. "O ensino dos modelos probabilísticos discretos no ensino médio." Universidade Federal de Sergipe, 2016. https://ri.ufs.br/handle/riufs/6483.

Повний текст джерела

Анотація:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES<br>This work aims to support Basic Education teachers by providing a detailed materials for teaching Combinatorial Analysis, Probability and Probabilistic Models, taking into account aspects related to day-to- day using mathematical concepts in problem situations. We also propose a teaching sequence on the topics mentioned above for the Basic Education teachers to broaden and diversify their strategies education.<br>Este trabalho tem como objetivo dar suporte ao professor da Educação Básica fornecendo um material detalhado par

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Bitondi, Fernanda Rizzi. "Variabilidade comportamental e a seleção de uma sequência de baixa probabilidade inicial: comparando dois procedimentos." Pontifícia Universidade Católica de São Paulo, 2012. https://tede2.pucsp.br/handle/handle/16687.

Повний текст джерела

Анотація:

Made available in DSpace on 2016-04-29T13:17:45Z (GMT). No. of bitstreams: 1 Fernanda Rizzi Bitondi.pdf: 1390449 bytes, checksum: c3d88238b2946cc2655e04fd9337cc96 (MD5) Previous issue date: 2012-05-25<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>The aim of this study was to evaluate the effectiveness of two procedures, Discrete Trial (DT) and Discrete Trial with Interresponse Interval (DT/IRI), on the production of behavioral variability in different conditions (directly reinforced and induced) and determine what condition, in each procedure, would facilitate the selecti

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Lundberg, Mattias, and Johan Söderlund. "Flow simulation of Body In White : Optimization of the production sequence and identification of bottlenecks at Volvo Trucks plant in Umeå." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-136584.

Повний текст джерела

Анотація:

In this study, a discrete event model was created and used in combination with an optimization method to find the optimal production sequence at Volvo Group’s cab plant in Umeå. The optimization was performed with a heuristic approach combined with a genetic search algorithm. The result provides an optimized production sequence with an increased production performance. Potential improvements in the production flow were identified to significantly increase the throughput. Volvo Group Trucks Operations plant in Umeå is a part of Volvo Group AB and is one of the world’s largest manufacturers of h

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Grymel, Martin-Thomas. "Error control with binary cyclic codes." Thesis, University of Manchester, 2013. https://www.research.manchester.ac.uk/portal/en/theses/error-control-with-binary-cyclic-codes(a5750b4a-e4d6-49a8-915b-3e015387ad36).html.

Повний текст джерела

Анотація:

Error-control codes provide a mechanism to increase the reliability of digital data being processed, transmitted, or stored under noisy conditions. Cyclic codes constitute an important class of error-control code, offering powerful error detection and correction capabilities. They can easily be generated and verified in hardware, which makes them particularly well suited to the practical use as error detecting codes.A cyclic code is based on a generator polynomial which determines its properties including the specific error detection strength. The optimal choice of polynomial depends on many f

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Krejčí, Michal. "Komprese dat." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-217934.

Повний текст джерела

Анотація:

This thesis deals with lossless and losing methods of data compressions and their possible applications in the measurement engineering. In the first part of the thesis there is a theoretical elaboration which informs the reader about the basic terminology, the reasons of data compression, the usage of data compression in standard practice and the division of compression algorithms. The practical part of thesis deals with the realization of the compress algorithms in Matlab and LabWindows/CVI.

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Kornfeil, Vojtěch. "Soubor úloh pro kurs Sběr, analýza a zpracování dat." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217707.

Повний текст джерела

Анотація:

This thesis proposes tasks of exercises for mentioned course and design and creation of automated evaluation system for these exercises. This thesis focuses on discussion and exemplary solutions of possible tasks of each exercise and description of created automated evaluation system. For evaluation program are made tests with chosen special data sets, which will prove it’s functionality in general data sets.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Arulalan, M. R. "Some Applications Of Integer Sequences In Digital Signal Processing And Their Implications On Performance And Architecture." Thesis, 2011. https://etd.iisc.ac.in/handle/2005/2126.

Повний текст джерела

Анотація:

Contemporary research in digital signal processing (DSP) is focused on issues of computational complexity, very high data rate and large quantum of data. Thus, the success in newer applications and areas hinge on handling these issues. Conventional ways to address these challenges are to develop newer structures like Multirate signal processing, Multiple Input Multiple Output(MIMO), bandpass sampling, compressed domain sensing etc. In the implementation domain, the approach is to look at floating point over fixed point representation and / or longer wordlength etc., related to number represent

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Arulalan, M. R. "Some Applications Of Integer Sequences In Digital Signal Processing And Their Implications On Performance And Architecture." Thesis, 2011. http://etd.iisc.ernet.in/handle/2005/2126.

Повний текст джерела

Анотація:

Contemporary research in digital signal processing (DSP) is focused on issues of computational complexity, very high data rate and large quantum of data. Thus, the success in newer applications and areas hinge on handling these issues. Conventional ways to address these challenges are to develop newer structures like Multirate signal processing, Multiple Input Multiple Output(MIMO), bandpass sampling, compressed domain sensing etc. In the implementation domain, the approach is to look at floating point over fixed point representation and / or longer wordlength etc., related to number represent

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Vivek, Srinivas V. "On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem." Thesis, 2010. https://etd.iisc.ac.in/handle/2005/1996.

Повний текст джерела

Анотація:

There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard problems behind public-key cryptosystems has led to interesting problems in computational number theory. One such problem, called the cubic sieve congruence problem, arises in the context of the cubic sieve method for solving the discrete logarithm problem in prime fields. The cubic sieve method requires a nontrivial solution to the Cubic Sieve Congruence (CSC)x3 y2z (mod p), where p is a given prime. A nontrivial solutio

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Vivek, Srinivas V. "On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem." Thesis, 2010. http://etd.iisc.ernet.in/handle/2005/1996.

Повний текст джерела

Анотація:

There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard problems behind public-key cryptosystems has led to interesting problems in computational number theory. One such problem, called the cubic sieve congruence problem, arises in the context of the cubic sieve method for solving the discrete logarithm problem in prime fields. The cubic sieve method requires a nontrivial solution to the Cubic Sieve Congruence (CSC)x3 y2z (mod p), where p is a given prime. A nontrivial solution

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Chang, Chih-Yang, and 張智揚. "Digital Filter Design Using Discrete Prolate Spheroidal Sequence." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/x9735y.

Повний текст джерела

Анотація:

碩士<br>國立高雄第一科技大學<br>電子與資訊工程研究所<br>96<br>In many communication and signal processing applications, the discrete prolate spheroidal sequences are optimum waveforms that are time-limited sequences with maximum energy concentration in a finite frequency interval. In this thesis ,we use the characterization of discrete prolate spheroidal sequences to design all-pole IIR filter and discrete prolate spheroidal FIR filter. Moreover the discrete prolate spheroidal window is optimum window whose mainlobe has maximum energy concentration in the frequency domain and the mainlobe bandwidth can be adjustabl

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Talaei, Farnoosh. "Wireless channel estimation and channel prediction for MIMO communication systems." Thesis, 2017. https://dspace.library.uvic.ca//handle/1828/8923.

Повний текст джерела

Анотація:

In this dissertation, channel estimation and channel prediction are studied for wireless communication systems. Wireless communication for time-variant channels becomes more important by the fast development of intelligent transportation systems which motivates us to propose a reduced rank channel estimator for time-variant frequency-selective high-speed railway (HSR) systems and a reduced rank channel predictor for fast time-variant flat fading channels. Moreover, the potential availability of large bandwidth channels at mm-wave frequencies and the small wavelength of the mm-waves, offer the

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Ali, Akbarian Mohammad Sadegh. "Deep sequence learning for video anticipation: from discrete and deterministic to continuous and stochastic." Phd thesis, 2020. http://hdl.handle.net/1885/213305.

Повний текст джерела

Анотація:

Video anticipation is the task of predicting one/multiple future representation(s) given limited, partial observation. This is a challenging task due to the fact that given limited observation, the future representation can be highly ambiguous. Based on the nature of the task, video anticipation can be considered from two viewpoints: the level of details and the level of determinism in the predicted future. In this research, we start from anticipating a coarse representation of a deterministic future and then move towards predicting continuous and fine-grained future representations of a stoch

Стилі APA, Harvard, Vancouver, ISO та ін.

45

曾仁文. "A study of the discrete prolate spheroidal sequence and its applications in digital signal processing." Thesis, 1990. http://ndltd.ncl.edu.tw/handle/92327663155828354149.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Williams, Aaron Michael. "Shift gray codes." Thesis, 2009. http://hdl.handle.net/1828/1966.

Повний текст джерела

Анотація:

Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding to the balanced parentheses (()()). Given a string s = s1 s2 sn, the right-shift operation shift(s, i, j) replaces the substring si si+1..sj by si+1..sj si. In other words, si is right-shifted into position j by applying the permutation (j j−1 .. i) to the indices of s. Right-shifts include prefix-shifts (i = 1) and adjacent-transpositions (j = i+1). A fixed-content language is a set of strings that contain the same multiset of symbols. Given a f

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!