Thematische Bibliographien / Discrete Sequences

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Discrete Sequences“

Autor: Grafiati

Veröffentlicht am 30. November 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Discrete Sequences" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Discrete Sequences"

Pétermann, Y. F. S., Jean-Luc Rémy und Ilan Vardi. „Discrete Derivatives of Sequences“. Advances in Applied Mathematics 27, Nr. 2-3 (August 2001): 562–84. http://dx.doi.org/10.1006/aama.2001.0750.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Larry X. W., und Eve Y. Y. Yang. „Laguerre inequalities for discrete sequences“. Advances in Applied Mathematics 139 (August 2022): 102357. http://dx.doi.org/10.1016/j.aam.2022.102357.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Thom, Andreas. „Convergent Sequences in Discrete Groups“. Canadian Mathematical Bulletin 56, Nr. 2 (01.06.2013): 424–33. http://dx.doi.org/10.4153/cmb-2011-155-3.

Der volle Inhalt der Quelle

Annotation:

AbstractWe prove that a finitely generated group contains a sequence of non-trivial elements that converge to the identity in every compact homomorphic image if and only if the group is not virtually abelian. As a consequence of the methods used, we show that a finitely generated group satisfies Chu duality if and only if it is virtually abelian.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ivanov, V. A., und G. I. Ivchenko. „Frequency tests for discrete sequences“. Journal of Soviet Mathematics 39, Nr. 4 (November 1987): 2846–56. http://dx.doi.org/10.1007/bf01092335.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

He, Tian-Xiao. „A-sequences, Z-sequence, and B-sequences of Riordan matrices“. Discrete Mathematics 343, Nr. 3 (März 2020): 111718. http://dx.doi.org/10.1016/j.disc.2019.111718.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gupal, N. A. „Methods of Numeration of Discrete Sequences“. Cybernetics and Computer Technologies, Nr. 2 (30.06.2021): 63–67. http://dx.doi.org/10.34229/2707-451x.21.2.6.

Der volle Inhalt der Quelle

Annotation:

Introduction. Numeration, or code, discrete sequences act fundamental part in the theory of recognition and estimation. By the code get codes or indexes of the programs and calculated functions. It is set that the universal programs are that programs which will realize all other programs. This one of basic results in the theory of estimation. On the basis of numeration of discrete sequences of Godel proved a famous theorem about incompleteness of arithmetic. Purpose of the article. To develop synonymous numerations by the natural numbers of eventual discrete sequences programs and calculable functions mutually. Results. On the basis of numerations of eventual discrete sequences numerations are built for four commands of machine with unlimited registers (MUR) in the natural numbers of type of 4u, 4u +1, 4u+2, 4u+3 accordingly. Every program consists of complete list of commands. On the basis of bijection for four commands of MUR certainly mutually synonymous numerations for all programs of MUR. Thus, on the basis of the set program it is possible effectively to find its code number, and vice versa, on the basis of the set number it is possible effectively to find the program. Conclusions. Synonymous numerations by the natural numbers of complete discrete sequences are developed mutually, programs for MUR and calculable functions. Leaning against numeration of the programs it is set in the theory of calculable functions, that the universal programs are, that programs which will realize all other programs. By application of the calculated functions and s-m-n theorem are got to operation on the calculated functions: combination φx and φy, giving work φxφy, operation of conversion of functions, effective operation of recursion. Thus, the index of function φxφy is on the indexes of x and y [2]. Keywords: numeration, Godel code number, diagonal method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Belov, Yurii, Tesfa Y. Mengestie und Kristian Seip. „Discrete Hilbert transforms on sparse sequences“. Proceedings of the London Mathematical Society 103, Nr. 1 (27.01.2011): 73–105. http://dx.doi.org/10.1112/plms/pdq053.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pereira, J. S., und H. J. A. da Silva. „Orthogonal perfect discrete Fourier transform sequences“. IET Signal Processing 6, Nr. 2 (2012): 107. http://dx.doi.org/10.1049/iet-spr.2010.0195.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Weigand, Hans-Georg. „Sequences—Basic elements for discrete mathematics“. Zentralblatt für Didaktik der Mathematik 36, Nr. 3 (Juni 2004): 91–97. http://dx.doi.org/10.1007/bf02652776.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

MacCluer, Barbara D. „Uniformly discrete sequences in the ball“. Journal of Mathematical Analysis and Applications 318, Nr. 1 (Juni 2006): 37–42. http://dx.doi.org/10.1016/j.jmaa.2005.05.029.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Discrete Sequences"

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.

Der volle Inhalt der Quelle

Annotation:

FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico
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 all convergent permutation sequences. We also proved that all hereditary property of either permutation or ordered graph is testable.
Neste trabalho, estudamos a teoria recente de convergÃncia de sequÃncias de grafos e suas extensÃes para permutaÃÃes e ordens parciais de dimensÃo fixa. Conjecturamos um lema de regularidade fraca de grafos em intervalos que, se for verdadeira, nos possibilita estender essa teoria para grafos ordenados, que sÃo grafos tais que existe uma ordem total entre os vÃrtices. Mostramos algumas relaÃÃes interessantes de permutaÃÃes e ordens parciais com grafos ordenados. Com isso, conseguimos uma prova alternativa para a existÃncia de objetos limites de qualquer sequÃncia convergente de permutaÃÃes. Provamos tambÃm que toda propriedade hereditÃria de permutaÃÃes ou grafos ordenados Ã testÃvel.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 evaluating the tness of designs is modied according to the severity of mismatches detected between neighboring populations. This lays the ground work for natural evolution to a blended global solution without leaving the paradigm of genetic algorithms. An additional method applied here for constructing globally blended panel designs uses a parallel decomposition antithetical to that of earlier work. Rather than performing concurrent panel genetic optimizations, a single genetic optimization is conducted for the entire structure with the parallelism solely within the tness evaluations. A guide based genetic algorithm approach is introduced to exclusively generate and evaluate valid globally blended designs, utilizing a simple masterslave parallel implementation, implicitly reducing the size of the problem design space and increasing the quality of discovered local optima.
Ph. D.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 to solve much more complex tasks. Sub-problems have been identified, and studied as pattern formation, leader elec- tion, aggregation, chain formation, hole avoidance, foraging, path formation, etc. The Broadcasting Automata draws inspiration from a variety of sources such as Ad-Hoc radio networks, cellular automata, neighbourhood sequences and nature, employing many of the same pattern forming methods that can be seen in the superposition of waves and resonance. To this end the thesis gives an in depth analysis of the primitive tools of the Broadcasting Automata model, nodal patterns, where waves from a variety of transmitters can in linear time construct partitions and patterns with results per- taining to the numbers of different patterns and partitions, along with the number of those that differ, are given. Using these primitives of the model a variety of algorithms are given including leader election, through the location of the centre of a discrete disc, and a solution to the Firing Squad Synchronisation problem. These problems are solved linearly.An exploration of the ability to vary the broadcasting radius of each node leads to results of categorisations of digital discs, their form, composition, encodings and generation. Results pertaining to the nodal patterns generated by arbitrary transmission radii on the plane are explored with a connection to broadcasting sequences and approximation of discrete metrics of which results are given for the approximation of astroids, a previously unachievable concave metric, through a novel application of the aggregation of waves via a number of explored functions. Broadcasting Automata aims to place itself as a robust and complete linear time and large scale system for the construction of patterns, partitions and geometric computation. Algorithms and methodologies are given for the solution of problems within Swarm Robotics and an extension to neighbourhood sequences. It is also hoped that it opens up a new area of research that can expand many older and more mature works.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 pattern matching over interval sets. The problems and algorithms presented here are characterized by three common features: (1) a "computable scoring function" which defines the quality of matches; (2) a graph based, dynamic programming framework which captures the structure of the algorithmic solutions; and (3) an interdisciplinary aspect to the research, particularly between computer science and molecular biology, not found in other topics in computer science. The first half of the dissertation considers discrete pattern matching over sequences. It develops the alignment-graph/dynamic-programming framework for the algorithms in the sub-domain and then presents several new algorithms for regular expression and extended regular expression pattern matching. The second half of the dissertation develops the sub-domain of discrete pattern matching over interval sets, also called super-pattern matching. In this sub-domain, the input consists of sets of typed intervals, defined over a finite range, and a pattern expression of the interval types. A match between the interval sets and the pattern consists of a sequence of consecutive intervals, taken from the interval sets, such that their corresponding sequence of types matches the pattern. The name super-pattern matching comes from those problems where the interval sets corresponds to the sets of substrings reported by various pattern matching problems over a common input sequence. The pattern for the super-pattern matching problem, then, represents a "pattern of patterns," or super-pattern, and the sequences of intervals matching the super-pattern correspond to the substring of the original sequence which match that larger "pattern."

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Biyikoglu, Türker, Marc Hellmuth und 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.

Der volle Inhalt der Quelle

Annotation:

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.
Series: Research Report Series / Department of Statistics and Mathematics

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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érieur ou HON. Dans les HON, un état peut être représenté par différents nœuds-mémoires encodant les états précédemment visités avant d’aboutir à l’état courant. Une première problématique traitée dans cette thèse est la construction des HON, qui est un problème de modélisation statistique : on cherche un bon compromis entre taille et qualité du modèle. Nous proposons un modèle de réseaux d’ordre variable plus parcimonieux que les modèles existants. Une deuxième problématique est l’analyse des HON. Un avantage souvent mis en avant est que les algorithmes classiques de graphes peuvent être utilisés avec peu de modifications. Nous montrons, dans le cas de mesures de centralité ou de clustering de graphes, que ce n’est pas le cas. Nous affirmons qu’il faut au contraire adapter les algorithmes aux modèles
Network analysis extracts information about a system from the relationships between its actors. These relationships can correspond to flows drawn from sequences of states (i.e. agent trajectories between these entities). Representing these data as graphs generally assumes that these trajectories respect the Markov property; only the current state is sufficient to determine an agent’s future state. Numerous studies have challenged this assumption and proposed other models that allow us to overcome it: higher-order networks or HON. In it, a state can be represented by different memory nodes encoding the states previously visited before arriving at the current state. A first problem addressed in this thesis is the construction of HON, which is a statistical modeling problem: finding a good compromise between model size and quality. We propose here a model of variable-order networks that is more parsimonious than ex- isting models. A second problem is the analysis of HON. An advantage often put forward is that classical graph algorithms can be used with few modifications. We show, in the case of centrality measures or graph clustering, that this is not the case and argue that algorithms should be adapted to models

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 Doppler shifts. Time-variant channel estimation is one such crucial technique used to improve the performance of the modern wireless systems with Doppler spread and multipath spread. One of vital parts of the mobile wireless channel is channel estimation, which is a method used to significantly improve the performance of the system, especially for 4G and Long Term Evolution (LTE) systems. Channel estimation is done by estimating the time-varying channel frequency response for the OFDM symbols. Time-variant channel estimation using Discrete Prolate Spheroidal Sequences (DPSS) technique is a useful channel estimation technique in mobile wireless communication for accurately estimating transmitted information. The main advantage of DPSS or Slepian basis expansion is allowing more accurate representation of high mobility mobile wireless channels with low complexity. Systems such as the fourth generation cellular wireless standards (4G), which was recently introduced in Sweden and other countries together with the Long Term Evolution, can use channel estimation techniques for providing the high data rate in modern mobile wireless communication systems. The main goal of this thesis is to test the recently proposed method, time-variant channel estimation using Discrete Prolate Spheroidal Sequences (DPSS) to model the WINNER phase II channel model. The time-variant sub-carrier coefficients are expanded in terms of orthogonal DPS sequences, referred to as Slepian basis expansions. Both Slepian basis expansions and DPS sequences span the low-dimensional subspace of time-limited and band-limited sequences as Slepian showed. Testing is done by using just two system parameters, the maximum Doppler frequency Dmax v and K, the number of basis functions of length N = 256. The main focus of this thesis is to investigate the Power spectrum and channel gain caused by Doppler spread of the WINNER II channel model together with linear fitting of curves for both the Slepian and Fourier basis expansion models. In addition, it investigates the Mean Square Error (MSE) using the Least Squares (LS) method. The investigation was carried out by simulation in Matlab, which shows that the spectrum of the maximum velocity of the user in mobile wireless channel is upper bounded by the maximum normalized one-sided Doppler frequency. Matlab simulations support the values of the results. The value of maximum Doppler bandwidth vDmax of the WINNER model is exactly the same value as DPS sequences. In addition to the Power spectrum of the WINNER model, the fitting of Slepian basis expansion performs better in the WINNER model than that of the Fourier basis expansion.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Discrete Sequences"

Charalambides, Ch A. Discrete q-distributions. Hoboken, New Jersey: John Wiley & Sons, 2016.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hemmings, Dan B. Arbitrage valuation of financial sequences in discrete time. Sheffield: Sheffield UniversityManagement School, 1991.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jonathan, Jedwab, und SpringerLink (Online service), Hrsg. Sequences and Their Applications – SETA 2012: 7th International Conference, Waterloo, ON, Canada, June 4-8, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Guna, Seetharaman, Rao, T. R. N. 1933- und United States. National Aeronautics and Space Administration., Hrsg. Data compression of discrete sequence: A tree based approach using dynamic programming. [Washington, DC: National Aeronautics and Space Administration, 1994.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ideal shrinking and expansion of discrete sequences. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Charalambides, Charalambos A. Discrete Q-Distributions. Wiley & Sons, Incorporated, John, 2016.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Charalambides, Charalambos A. Discrete Q-Distributions. Wiley & Sons, Incorporated, John, 2016.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Charalambides, Charalambos A. Discrete Q-Distributions. Wiley & Sons, Limited, John, 2016.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Helleseth, T. Sequences And Their Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science). Springer, 2001.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Discrete Sequences"

Aggarwal, Charu C. „Mining Discrete Sequences“. In Data Mining, 493–529. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14142-8_15.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aggarwal, Charu C. „Outlier Detection in Discrete Sequences“. In Outlier Analysis, 311–44. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-47578-3_10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aggarwal, Charu C. „Outlier Detection in Discrete Sequences“. In Outlier Analysis, 267–312. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-6396-2_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nickson, Thomas, und Igor Potapov. „Discrete Discs and Broadcasting Sequences“. In Unconventional Computation and Natural Computation, 235. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32894-7_23.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gries, David, und Fred B. Schneider. „A Theory of Sequences“. In A Logical Approach to Discrete Math, 251–64. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4757-3837-7_14.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Normand, Nicolas, Robin Strand und Pierre Evenou. „Digital Distances and Integer Sequences“. In Discrete Geometry for Computer Imagery, 169–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37067-0_15.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Valtr, Pavel. „Generalizations of Davenport-Schinzel sequences“. In Contemporary Trends in Discrete Mathematics, 349–89. Providence, Rhode Island: American Mathematical Society, 1999. http://dx.doi.org/10.1090/dimacs/049/25.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Diaconis, Persi, Susan Holmes, Svante Janson, Steven P. Lalley und Robin Pemantle. „Metrics on Compositions and Coincidences among Renewal Sequences“. In Random Discrete Structures, 81–101. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0719-1_6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jerri, Abdul J. „Sequences and Difference Operators“. In Linear Difference Equations with Discrete Transform Methods, 1–40. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-5657-9_1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bhansali, Anil, und Steven Skiena. „Analyzing integer sequences“. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1–16. Providence, Rhode Island: American Mathematical Society, 1994. http://dx.doi.org/10.1090/dimacs/015/01.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Discrete Sequences"

Zhan, Jun, Junqi Dai, Jiasheng Ye, Yunhua Zhou, Dong Zhang, Zhigeng Liu, Xin Zhang et al. „AnyGPT: Unified Multimodal LLM with Discrete Sequence Modeling“. In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 9637–62. Stroudsburg, PA, USA: Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.acl-long.521.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gasparyan, Armenak Sokratovich. „Combinatorial identities over recurrent sequences“. In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-45.

Der volle Inhalt der Quelle

Annotation:

The article presents several general identities, special cases which are many well-known identities such as, for example, Cassini, Catalan, Taguiri identities for Fibonacci numbers, their analogues and generalizations to other Fibonacci-type numbers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Saadat, Samaneh, und Gita Sukthankar. „Explaining Differences in Classes of Discrete Sequences“. In 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT). IEEE, 2020. http://dx.doi.org/10.1109/wiiat50758.2020.00022.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mazel, D. S., und M. H. Hayes. „Hidden-variable fractal interpolation of discrete sequences“. In [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1991. http://dx.doi.org/10.1109/icassp.1991.150182.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pettie, Seth. „Sharp Bounds on Formation-free Sequences“. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973730.40.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Qiao, Jie, Ruichu Cai, Siyu Wu, Yu Xiang, Keli Zhang und Zhifeng Hao. „Structural Hawkes Processes for Learning Causal Structure from Discrete-Time Event Sequences“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/633.

Der volle Inhalt der Quelle

Annotation:

Learning causal structure among event types from discrete-time event sequences is a particularly important but challenging task. Existing methods, such as the multivariate Hawkes processes based methods, mostly boil down to learning the so-called Granger causality which assumes that the cause event happens strictly prior to its effect event. Such an assumption is often untenable beyond applications, especially when dealing with discrete-time event sequences in low-resolution; and typical discrete Hawkes processes mainly suffer from identifiability issues raised by the instantaneous effect, i.e., the causal relationship that occurred simultaneously due to the low-resolution data will not be captured by Granger causality. In this work, we propose Structure Hawkes Processes (SHPs) that leverage the instantaneous effect for learning the causal structure among events type in discrete-time event sequence. The proposed method is featured with the Expectation-Maximization of the likelihood function and a sparse optimization scheme. Theoretical results show that the instantaneous effect is a blessing rather than a curse, and the causal structure is identifiable under the existence of the instantaneous effect. Experiments on synthetic and real-world data verify the effectiveness of the proposed method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Giordano, Pola,. „Sequences of Discrete Abstractions for Piecewise Affine Systems“. In Analysis and Design of Hybrid Systems, herausgegeben von Heemels, Maurice, chair Giua, Alessandro und Heemels, Maurice. IFAC, Elsevier, 2012. http://dx.doi.org/10.3182/20120606-3-nl-3011.00024.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xylogiannopoulos, Konstantinos F., und Panagiotis Karampelas. „Visualization of Repeated Patterns in Multivariate Discrete Sequences“. In 2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 2020. http://dx.doi.org/10.1109/asonam49781.2020.9381316.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Makeev, Sergey Danilovich. „Hardly describable almost polynomial classes of requrrent sequences“. In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-36.

Der volle Inhalt der Quelle

Annotation:

In this report, we will describe the problem of "hard to describe" classes return sequences, that is, such that the prediction behavior of such sequences is an algorithmically undecidable task. Integer classes will be considered sequences whose generating functions are composed compositions of polynomials (with integer coefficients) and some functions f. The main question under consideration is what should be this f, so that the resulting class is hard to describe. Such functions f we called border. Evidence will be presented that several wide families of functions are boundary. All this evidence stem from one "central" theorem, for proof of which Minsky machine simulations are used sequences, i.e. it is constructively proved that from the system functions "polynomials plus f" (for each of the considered f) it is possible to "build" a universal computing device.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ouaknine, Joël, und James Worrell. „Positivity Problems for Low-Order Linear Recurrence Sequences“. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973402.27.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Discrete Sequences"

Kozmina, Jelena, und Alytis Gruodis. Tool QUATTRO-20 for Examining of the Recurrent Sequencies Generated by Discrete Analogue of the Verhulst Equation. Publishing House - Vilnius Business College, Juni 2023. http://dx.doi.org/10.57005/ab.2023.1.3.

Der volle Inhalt der Quelle

Annotation:

QUATTRO-20 as advanced tool for estimation of the recurrent sequences was created and tested. Discrete analogue of Verhulst equation x(t+1)=F(x(t)), F(x)=rx(1-x), t=0, 1, 2, ..., was selected as the model of recurrent sequence. Related mathematical material is presented in user-friendly form: convergence conditions, Lyapunov index, behaviour of the sequencies generated by second, third, fourth compositions of function F(x). QUATTRO-20 contains several visualization methods such as xy plot, Bifurcation diagram, distribution of Lyapunov index, CobWeb plot, graphical solution. Novel graphical technique of realization of the sequence convergence was presented.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Amengual, Dante, Xinyue Bei, Marine Carrasco und Enrique Sentana. Score-type tests for normal mixtures. CIRANO, Januar 2023. http://dx.doi.org/10.54932/uxsg1990.

Der volle Inhalt der Quelle

Annotation:

Testing normality against discrete normal mixtures is complex because some parameters turn increasingly underidentified along alternative ways of approaching the null, others are inequality constrained, and several higher-order derivatives become identically 0. These problems make the maximum of the alternative model log-likelihood function numerically unreliable. We propose score-type tests asymptotically equivalent to the likelihood ratio as the largest of two simple intuitive statistics that only require estimation under the null. One novelty of our approach is that we treat symmetrically both ways of writing the null hypothesis without excluding any region of the parameter space. We derive the asymptotic distribution of our tests under the null and sequences of local alternatives. We also show that their asymptotic distribution is the same whether applied to observations or standardized residuals from heteroskedastic regression models. Finally, we study their power in simulations and apply them to the residuals of Mincer earnings functions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Remington, Roger W., Shu-Chieh Wu und Harold Pashler. Human Resource Scheduling in Performing a Sequence of Discrete Responses. Fort Belvoir, VA: Defense Technical Information Center, Februar 2009. http://dx.doi.org/10.21236/ada502763.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Abbott, Albert G., Doron Holland, Douglas Bielenberg und Gregory Reighard. Structural and Functional Genomic Approaches for Marking and Identifying Genes that Control Chilling Requirement in Apricot and Peach Trees. United States Department of Agriculture, September 2009. http://dx.doi.org/10.32747/2009.7591742.bard.

Der volle Inhalt der Quelle

Annotation:

Structural and functional genomic approaches for marking and identifying genes that control chilling requirement in apricot and peach trees. Specific aims: 1) Identify and characterize the genetic nature of chilling requirement for flowering and dormancy break of vegetative shoots in Prunusgermplasm through the utilization of existing apricot (NeweYa'ar Research Center, ARO) and peach (Clemson University) genetic mapping populations; 2) Use molecular genetic mapping techniques to identify markers flanking genomic regions controlling chilling; 3) Comparatively map the regions controlling chilling requirement in apricot and peach and locate important genomic regions influencing chilling requirement on the Prunus functional genomic database as an initial step for identification of candidate genes; 4) Develop from the functional genomics database a set of markers facilitating the development of cultivars with optimized chilling requirements for improved and sustained fruit production in warm-winter environments. Dormant apricot (prunus armeniaca L.) and peach [Prunus persica (L.) Batsch] trees require sustained exposure to low, near freezing, temperatures before vigorous floral and vegetative bud break is possible after the resumption of warm temperatures in the spring. The duration of chilling required (the chilling requirement, CR) is determined by the climatic adaptation of the particular cultivar, thus limiting its geographic distribution. This limitation is particularly evident when attempting to introduce superior cultivars to regions with very warm winter temperatures, such as Israel and the coastal southern United States. The physiological mechanism of CR is not understood and although breeding programs deliberately manipulate CR in apricot and peach crosses, robust closely associated markers to the trait are currently not available. We used segregating populations of apricot (100 Fl individuals, NeweYa'ar Research Center, ARO) and peach (378 F2 individuals, Clemson University) to discover several discreet genomic loci that regulate CR and blooming date. We used the extensive genomic/genetic resources available for Prunus to successfully combine our apricot and peach genetic data and identify five QTL with strong effects that are conserved between species as well as several QTL that are unique to each species. We have identified markers in the key major QTL regions for testing in breeding programs which we are carrying out currently; we have identified an initial set of candidate genes using the peach physical/transcriptome map and whole peach genome sequences and we are testing these currently to identify key target genes for manipulation in breeding programs. Our collaborative work to date has demonstrated the following: 1) CR in peach and apricot is predominantly controlled by a limited number ofQTL loci, seven detected in a peach F2 derived map comprising 65% of the character and 12 in an apricot Fl map comprising 71.6% and 55.6% of the trait in the Perfection and A. 1740 parental maps, respectively and that peach and apricot appear in our initial maps to share five genomic intervals containing potentially common QTL. 2) Application of common anchor markers of the Prunus/peach, physical/genetic map resources has allowed us not only to identify the shared intervals but also to have immediately available some putative candidate gene information from these intervals, the EVG region on LG1 in peach the TALY 1 region in apricot on LG2 in peach; and several others involved in vernalization pathways (LGI and LG7). 3) Mapped BACcontigs are easily defined from the complete physical map resources in peach through the common SSR markers that anchor our CR maps in the two species, 4) Sequences of BACs in these regions can be easily mined for additional polymorphic markers to use in MAS applications.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Weinberg, Zwi G., Adegbola Adesogan, Itzhak Mizrahi, Shlomo Sela, Kwnag Jeong und Diwakar Vyas. effect of selected lactic acid bacteria on the microbial composition and on the survival of pathogens in the rumen in context with their probiotic effects on ruminants. United States Department of Agriculture, Januar 2014. http://dx.doi.org/10.32747/2014.7598162.bard.

Der volle Inhalt der Quelle

Annotation:

This research project was performed in context of the apparent probiotic effect of selected lactic acid bacteria (LAB) silage inoculants on the performance of ruminants (improved feed intake, faster live-weight gain, higher milk yields and improved feed efficiency). The overall objective was to find out how LAB affect ruminant performance. The project included several “chapters” as follows: 1. The effect of LAB silage inoculants on the survival of detrimental bacteria in rumen fluid, in vitro study (Weinberg et al., The Volcani Center). An in vitro model was developed to study the interaction between selected LAB and an E. coli strain tagged with green fluorescence protein (GFP) in buffered RF. Results indicated that both LAB inoculants and E. coli survived in the RF for several days; both LAB inoculants and LAB-treated silages did not affect survival of E. coli in rumen fluid in vitro. The effect of feeding baled wheat silages treated with or without three selected LAB silage inoculants on the performance of high-lactating cows (Weinberg et al., The Volcani Center). Treatments included control (no additive), Lacobacillusbuchneri40788 (LB), Lactobacillus plantarumMTD1 40027 (LP) and Pediococcuspentosaceus30168 (PP), each applied at 10⁶ cfu/g FM. The silages were included in the TMR of 32 high milking Holstein cows in a controlled feeding experiment. All baled silages were of good quality. The LB silage had the numerically highest acetic acid and were the most stable upon aerobic exposure. The cows fed the LB silages had the highest daily milk yields, percent milk fat and protein. The microbiome of baled wheat silages and changes during ensiling of wheat and corn (Sela et al., The Volcani Center). Bacterial community of the baled silages was dominated mainly of two genera in total, dominated by Lactobacillus and Clostridium_sensu_stricto_12 with 300 other genera at very low abundance. Fungal community was composed mainly of two genera in total, dominated by Candida and Monascuswith 20 other genera at very low abundance. In addition, changes in the microbiome during ensiling of wheat and corn with and without addition of L. plantarumMTD1 was studied in mini-silos. Overall 236 bacterial genera were identified in the fresh corn but after 3 months Lactobacillus outnumbered all other species by acquiring 95% of relative abundance. The wheat silage samples are still under analysis. The effect of applying LAB inoculants at ensiling on survival of E. coli O157:H7 in alfalfa and corn silages(Adesogan et al., University of Florida). E. coli (10⁵ cfu/g) was applied to fresh alfalfa and corn at ensiling with or without L. plantarumor L. buchneri. The pathogen was added again after about 3 moths at the beginning of an aerobic exposure period. The inoculants resulted in faster decrease in pH as compared with the control (no additives) or E. coli alone and therefore, the pathogen was eliminated faster from these silages. After aerobic exposure the pathogen was not detected in the LAB treated silages, whereas it was still present in the E. coli alone samples. 5. The effect of feeding corn silage treated with or without L. buchnerion shedding of E. coli O157:H7 by dairy cows (Adesogan et al., UFL). BARD Report - Project 4704 Page 2 of 12 Five hundred cows from the dairy herd of the University of Florida were screened for E. coli shedding, out of which 14 low and 13 high shedders were selected. These cows were fed a total mixed ration (TMR) which was inoculated with E. coli O157:H7 for 21 days. The TMR included corn silage treated with or without L. buchneri. The inoculated silages were more stable upon aerobic exposure than the control silages; the silage inoculant had no significant effect on any milk or cow blood parameters. However, the silage inoculant tended to reduce shedding of E. coli regardless of high or low shedders (p = 0.06). 6. The effect of feeding baled wheat silages treated with or without three selected LAB silage inoculants on the rumen microbiome (Mizrahi et al., BGU). Rumen fluid was sampled throughout the feeding experiment in which inoculated wheat silages were included in the rations. Microbial DNA was subsequently purified from each sample and the 16S rRNA was sequenced, thus obtaining an overview of the microbiome and its dynamic changes for each experimental treatment. We observed an increase in OTU richness in the group which received the baled silage inoculated with Lactobacillus Plantarum(LP). In contrast the group fed Lactobacillus buchneri(LB) inoculated silage resulted in a significant decrease in richness. Lower OTU richness was recently associated in lactating cows with higher performance (Ben Shabatet al., 2016). No significant clustering could be observed between the different inoculation treatments and the control in non metric multi-dimentional scaling, suggesting that the effect of the treatments is not the result of an overall modulation of the microbiome composition but possibly the result of more discrete interactions. Significant phylum level changes in composition also indicates that no broad changes in taxa identity and composition occurred under any treatment A more discrete modulation could be observed in the fold change of several taxonomic groups (genus level analysis), unique to each treatment, before and after the treatment. Of particular interest is the LB treated group, in which several taxa significantly decreased in abundance. BARD Report - Project 4704 Page 3 of 12

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!