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

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Discrete Sequences"

Автор: Grafiati

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

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

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

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

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Discrete Sequences".

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

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

Статті в журналах з теми "Discrete Sequences"

Nikolov, Nikolai, and Mladen Savov. "Properties and Conjectures Regarding Discrete Renewal Sequences." Mathematics and Informatics 67, no. 2 (2024): 111–18. https://doi.org/10.53656/math2024-2-1-pro.

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

Анотація:

In this work we review and derive some elementary properties of the discrete renewal sequences based on a positive, finite and integervalued random variable. Our results consider these sequences as dependent on the probability masses of the underlying random variable. In particular we study the minima and the maxima of these sequences and prove that they are attained for indices of the sequences smaller or equal than the support of the underlying random variable. Noting that the minimum itself is a minimum of multi-variate polynomials we conjecture that one universal polynomial envelopes the m

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

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

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

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

Wang, Larry X. W., and 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.

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

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

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

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

Анотація:

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 та ін.

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

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

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

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

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

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

Xie, Pan, Qipeng Zhang, Peng Taiying, Hao Tang, Yao Du, and Zexian Li. "G2P-DDM: Generating Sign Pose Sequence from Gloss Sequence with Discrete Diffusion Model." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 6 (2024): 6234–42. http://dx.doi.org/10.1609/aaai.v38i6.28441.

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

Анотація:

The Sign Language Production (SLP) project aims to automatically translate spoken languages into sign sequences. Our approach focuses on the transformation of sign gloss sequences into their corresponding sign pose sequences (G2P). In this paper, we present a novel solution for this task by converting the continuous pose space generation problem into a discrete sequence generation problem. We introduce the Pose-VQVAE framework, which combines Variational Autoencoders (VAEs) with vector quantization to produce a discrete latent representation for continuous pose sequences. Additionally, we prop

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

Gupal, N. A. "Methods of Numeration of Discrete Sequences." Cybernetics and Computer Technologies, no. 2 (June 30, 2021): 63–67. http://dx.doi.org/10.34229/2707-451x.21.2.6.

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

Анотація:

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 f

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

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

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

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

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

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

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

Більше джерел

Дисертації з теми "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.

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

Анотація:

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 та ін.

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 та ін.

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 та ін.

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 та ін.

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 та ін.

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 та ін.

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 та ін.

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 та ін.

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 та ін.

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 та ін.

Більше джерел

Книги з теми "Discrete Sequences"

Charalambides, Ch A. Discrete q-distributions. John Wiley & Sons, 2016.

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

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

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

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

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

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

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

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

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

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

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

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

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

Bozhko, Arkadiy. Modeling of products and processes in CAAP systems. INFRA-M Academic Publishing LLC., 2024. https://doi.org/10.12737/2137603.

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

Анотація:

Assembly of industrial products is one of the most difficult and responsible stages of modern discrete manufacturing. Many modern products consist of a large number of parts and are characterized by high structural complexity. The development of technological processes for the assembly of such machines or devices is impossible without the use of modern information technologies. The monograph is devoted to the mathematical support of computer-aided design systems for assembly processes. Modeling of structural and geometric properties of complex technical systems is discussed in detail. The meth

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

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

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

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

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

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

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

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

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

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

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

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

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

Більше джерел

Частини книг з теми "Discrete Sequences"

Levin, Oscar. "Sequences." In Discrete Mathematics, 4th ed. Chapman and Hall/CRC, 2025. https://doi.org/10.1201/9781003589907-5.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Gries, David, and Fred B. Schneider. "A Theory of Sequences." In A Logical Approach to Discrete Math. Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4757-3837-7_14.

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

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

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

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

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

Valtr, Pavel. "Generalizations of Davenport-Schinzel sequences." In Contemporary Trends in Discrete Mathematics. American Mathematical Society, 1999. http://dx.doi.org/10.1090/dimacs/049/25.

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

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

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

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

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

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

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

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

Тези доповідей конференцій з теми "Discrete Sequences"

Christou, Martha, and Christoforos N. Hadjicostis. "Enforcing Detectability in Discrete Event Systems via Adaptive Control Sequences of Minimum Total Length." In 2024 IEEE 63rd Conference on Decision and Control (CDC). IEEE, 2024. https://doi.org/10.1109/cdc56724.2024.10886486.

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

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

Banerjee, Nikita, Pratyush Swain, Ayush Kumar Behera, and Pankaj Kumar Sa. "DNA Sequence Similarity Using Discrete Wavelet Transform." In 2024 International Conference on Big Data Analytics in Bioinformatics (DABCon). IEEE, 2024. https://doi.org/10.1109/dabcon63472.2024.10919379.

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

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

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.

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

Анотація:

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 та ін.

Saadat, Samaneh, and 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.

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

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

Mazel, D. S., and 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.

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

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

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

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

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

Qiao, Jie, Ruichu Cai, Siyu Wu, Yu Xiang, Keli Zhang, and 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}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/633.

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

Анотація:

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

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

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

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

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

Xylogiannopoulos, Konstantinos F., and 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.

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

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

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

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

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

Звіти організацій з теми "Discrete Sequences"

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

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

Анотація:

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 tec

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

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

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

Анотація:

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 b

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

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

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

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

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

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

Abbott, Albert G., Doron Holland, Douglas Bielenberg, and 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, 2009. http://dx.doi.org/10.32747/2009.7591742.bard.

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

Анотація:

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 chilli

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

Weinberg, Zwi G., Adegbola Adesogan, Itzhak Mizrahi, Shlomo Sela, Kwnag Jeong, and 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, 2014. http://dx.doi.org/10.32747/2014.7598162.bard.

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

Анотація:

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

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

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