Gotowe bibliografie tematyczne / Optimal Sequence

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek
  5. Streszczenia konferencji
  6. Raporty organizacyjne

Gotowa bibliografia na temat „Optimal Sequence”

Autor: Grafiati
Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Optimal Sequence”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Optimal Sequence"

1

Shea, Koon-lam, Tai-man Tang i Ping-shu Tso. "Optimal investment sequence". Economic Theory 15, nr 1 (1.01.2000): 215–19. http://dx.doi.org/10.1007/s001990050008.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Ural, H., i K. Zhu. "Optimal length test sequence generation using distinguishing sequences". IEEE/ACM Transactions on Networking 1, nr 3 (czerwiec 1993): 358–71. http://dx.doi.org/10.1109/90.234857.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Navarro, Gonzalo, i Yakov Nekrich. "Optimal Dynamic Sequence Representations". SIAM Journal on Computing 43, nr 5 (styczeń 2014): 1781–806. http://dx.doi.org/10.1137/130908245.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Vingron, Martin. "Near-optimal sequence alignment". Current Opinion in Structural Biology 6, nr 3 (czerwiec 1996): 346–52. http://dx.doi.org/10.1016/s0959-440x(96)80054-6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Bahubalendruni, MVA Raju, i Bibhuti Bhusan Biswal. "An intelligent approach towards optimal assembly sequence generation". Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 232, nr 4 (20.12.2016): 531–41. http://dx.doi.org/10.1177/0954406216684159.

Pełny tekst źródła
Streszczenie:
In this paper, a novel and efficient method is developed and proposed to obtain all valid assembly sequences and optimized assembly sequence for a given assembled product. The working principle of methodology is clearly illustrated with different example products. Four basic predicates namely “liaison predicate, geometrical feasibility, mechanical feasibility, and stability” are considered to validate each sequence. The proposed method is effective and proven efficient in the resulting all set of feasible assembly sequences described. Tool/gripper changes, assembly orientation changes, and part trajectory distances are considered to state the optimality of a valid assembly sequence. Achieving optimized assembly sequence through the proposed method for user-defined objective function is briefly illustrated. The computational performance of the method in achieving all valid assembly sequences is illustrated for various dissimilar products.
Style APA, Harvard, Vancouver, ISO itp.
6

Torii, Hideyuki, Takahiro Matsumoto i Makoto Nakamura. "Optimal Polyphase Asymmetric ZCZ Sequence Sets Including Uncorrelated Sequences". Journal of Signal Processing 16, nr 6 (2012): 487–94. http://dx.doi.org/10.2299/jsp.16.487.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Wang, Lian, i Min Liu. "An Optimal Frequency Hopping Sequence Set Based on the Polynomial Theory". Applied Mechanics and Materials 490-491 (styczeń 2014): 872–78. http://dx.doi.org/10.4028/www.scientific.net/amm.490-491.872.

Pełny tekst źródła
Streszczenie:
A new class of cubic frequency hopping (FH) sequence set is proposed in this paper. The new cubic FH sequence set is proved to be optimal with respect to the average Hamming correlation bound. Furthermore an optimal FH sequence set based on polynomial theory that is optimal with respect to the Singleton bound on FH sequences is also constructed. In addition, the average Hamming correlation of the optimal polynomial frequency hopping sequence set is discussed in this paper. The analysis result shows that the new polynomial FH sequence set is also optimal with respect to the average Hamming correlation bound.
Style APA, Harvard, Vancouver, ISO itp.
8

Saitou, Kazuhiro, i Mark J. Jakiela. "Subassembly Generation via Mechanical Conformational Switches". Artificial Life 2, nr 4 (lipiec 1995): 377–416. http://dx.doi.org/10.1162/artl.1995.2.4.377.

Pełny tekst źródła
Streszczenie:
A question is posed on how a particular subassembly sequence is generated in randomized assembly. An extended design of mechanical conformational switches [16] is proposed that can encode several subassembly sequences. A particular subassembly sequence is generated due to conformational changes of parts during one-dimensional randomized assembly. The optimal subassembly sequence that maximizes the yield of a desired assembly can be found via genetic search over a space of parameterized conformational switch designs, rather than a space of subassembly sequences. The resulting switch design encodes the optimal subassembly sequence so that the desired assemblies are put together only in the optimal sequence. The results of genetic search and rate equation analyses reveal that the optimal subassembly sequence depends on the initial concentration of parts and the defect probabilities during randomized assembly. The results indicate that abundant parts and parts with high defect probabilities should be assembled earlier rather than later.
Style APA, Harvard, Vancouver, ISO itp.
9

Bahubalendruni, M. V. A. Raju, B. B. V. L. Deepak i Bibhuti Bhusan Biswal. "An advanced immune based strategy to obtain an optimal feasible assembly sequence". Assembly Automation 36, nr 2 (4.04.2016): 127–37. http://dx.doi.org/10.1108/aa-10-2015-086.

Pełny tekst źródła
Streszczenie:
Purpose The purpose of this study is to develop an intelligent methodology to find out an optimal feasible assembly sequence while considering the assembly predicates. Design/methodology/approach This proposed study is carried out by using two artificial immune system-based models, namely, Bone Marrow Model and Negative Selection Algorithms, to achieve the following objectives: to obtain the possible number of assembly sequences; to obtain the feasible assembly sequences while considering different assembly predicates; and to obtain an optimal feasible assembly sequence. Findings Proposed bone-marrow model determines the possible assembly sequences to ease the intricacy of the problem formulation. Further evaluation has been carried out through negative-selection censoring and monitoring models. These developed models reduce the overall computational time to determine the optimal feasible assembly sequence. Originality/value In this paper, the novel and efficient strategies based on artificial immune system have been developed and proposed to obtain all valid assembly sequences and optimized assembly sequence for a given assembled product using assembly attributes. The introduced methodology has proven its effectiveness in achieving optimal assembly sequence with less computational time.
Style APA, Harvard, Vancouver, ISO itp.
10

Aguilera, Francisco, Daniel Cárdenas-Morales i Pedro Garrancho. "Optimal Simultaneous Approximation via𝒜-Summability". Abstract and Applied Analysis 2013 (2013): 1–5. http://dx.doi.org/10.1155/2013/824058.

Pełny tekst źródła
Streszczenie:
We present optimal convergence results for themth derivative of a function by sequences of linear operators. The usual convergence is replaced by𝒜-summability, with𝒜being a sequence of infinite matrices with nonnegative real entries, and the operators are assumed to bem-convex. Saturation results for nonconvergent but almost convergent sequences of operators are stated as corollaries.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Optimal Sequence"

1

Grossmann, Steffen. "Statistics of optimal sequence alignments". [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=968907466.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Starrett, Dean. "Optimal Alignment of Multiple Sequence Alignments". Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/194840.

Pełny tekst źródła
Streszczenie:
An essential tool in biology is the alignment of multiple sequences. Biologists use multiple sequence alignments for tasks such as predicting protein structure and function, reconstructing phylogenetic trees, and finding motifs. Constructing high-quality multiple alignments is computationally hard, both in theory and in practice, and is typically done using heuristic methods. The majority of state-of-the-art multiple alignment programs employ a form and polish strategy, where in the construction phase, an initial multiple alignment is formed by progressively merging smaller alignments, starting with single sequences. Then in a local-search phase, the resulting alignment is polished by repeatedly splitting it into smaller alignments and re-merging. This merging of alignments, the basic computational problem in the construction and local-search phases of the best multiple alignment heuristics, is called the Aligning Alignments Problem. Under the sum-of-pairs objective for scoring multiple alignments, this problem may seem to be a simple extension of two-sequence alignment. It is proven here, however, that with affine gap costs (which are recognized as necessary to get biologically-informative alignments) the problem is NP-complete when gaps are counted exactly. Interestingly, this form of multiple alignment is polynomial-time solvable when we relax the exact count, showing that exact gap counts themselves are inherently hard in multiple sequence alignment. Unlike general multiple alignment however, we show that Aligning Alignments with affine gap costs and exact counts is tractable in practice, by demonstrating an effective algorithm and a fast implementation. Our software AlignAlign is both time- and space-efficient on biological data. Computational experiments on biological data show instances derived from standard benchmark suites can be optimally aligned with surprising efficiency, and experiments on simulated data show the time and space both scale well.
Style APA, Harvard, Vancouver, ISO itp.
3

Amara-Korba, Enwer. "Optimal sequence and heat integration for multicomponent distillation trains". Thesis, University of Sheffield, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340894.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Mora, Castro Andrés Felipe. "Optimal switching sequence model predictive control for power electronics". Tesis, Universidad de Chile, 2019. http://repositorio.uchile.cl/handle/2250/170522.

Pełny tekst źródła
Streszczenie:
Tesis para optar al grado de Doctor en Ingeniería Eléctrica
En este proyecto de tesis, se propone una estrategia de control predictivo (MPC, por sus siglas en inglés) basada en el concepto de secuencia de conmutación óptima (OSS) recientemente introducido para convertidores de punto neutro enclavado de tres niveles (3L-NPC) conectados a la red eléctrica. La metodología de control propuesta, llamada OSS-MPC en cascada (C-OSS-MPC), considera explícitamente el modulador en su formulación junto con el modelo del sistema. Como se verificó a lo largo de esta tesis, la estrategia C-OSS-MPC está formulada para el control de la corriente o el control directo de la potencia activa/reactiva como variables primarias de control, mientras que el problema del equilibrio de voltaje del enlace CC se resuelve sin utilizar factores de ponderación en un bucle de control interno basado en una novedosa y sencilla estrategia de control MPC. Por lo tanto, la metodología de control propuesta controla de manera óptima tanto el objetivo de control primario como los voltajes de los condensadores de este convertidor de potencia. Bajo esta perspectiva, la dificultad de diseñar el factor de ponderación se evita en este trabajo y el rendimiento del sistema controlado no se ve afectado por un punto de operación particular del convertidor conectado a la red. La estrategia MPC resultante permite operar el convertidor con un espectro armónico predefinido, frecuencia de conmutación fija y una respuesta dinámica rápida y robusta en todo el rango operativo del convertidor de potencia, superando las estrategias MPC existentes en la literatura para los convertidores de potencia. Además, se ha propuesto un nuevo y eficiente algoritmo de optimización para encontrar rápidamente la solución óptima con el fin de hacer posible una implementación en tiempo real de la estrategia de control propuesta. Finalmente, se proporcionan resultados experimentales y de simulación para demostrar la efectividad y el rendimiento de alta calidad de la estrategia de control propuesta, lo que hace que este enfoque de control no solo sea adecuado para las aplicaciones de convertidor de potencia conectado a la red, sino que también para accionamientos eléctricos de alta potencia.
Style APA, Harvard, Vancouver, ISO itp.
5

Fischer, Jörg [Verfasser]. "Optimal Sequence-Based Control of Networked Linear Systems / Jörg Fischer". Karlsruhe : KIT Scientific Publishing, 2015. http://www.ksp.kit.edu.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Islas, Anguiano Jose Angel. "Optimal Strategies for Stopping Near the Top of a Sequence". Thesis, University of North Texas, 2015. https://digital.library.unt.edu/ark:/67531/metadc822812/.

Pełny tekst źródła
Streszczenie:
In Chapter 1 the classical secretary problem is introduced. Chapters 2 and 3 are variations of this problem. Chapter 2, discusses the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter p and finite time horizon n. The optimal strategy (continue or stop) depends on a sequence of threshold values (critical probabilities) which has an oscillating pattern. Several properties of this sequence have been proved by Dr. Allaart. Further properties have been recently proved. In Chapter 3, a gambler will observe a finite sequence of continuous random variables. After he observes a value he must decide to stop or continue taking observations. He can play two different games A) Win at the maximum or B) Win within a proportion of the maximum. In the first section the sequence to be observed is independent. It is shown that for each n>1, theoptimal win probability in game A is bounded below by (1-1/n)^{n-1}. It is accomplished by reducing the problem to that of choosing the maximum of a special sequence of two-valued random variables and applying the sum-the-odds theorem of Bruss (2000). Secondly, it is assumed the sequence is i.i.d. The best lower bounds are provided for the winning probabilities in game B given any continuous distribution. These bounds are the optimal win probabilities of a game A which was examined by Gilbert and Mosteller (1966).
Style APA, Harvard, Vancouver, ISO itp.
7

Nagendra, Somanath. "Optimal stacking sequence design of stiffened composite panels with cutouts". Diss., This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-06062008-170635/.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Germain, Florence. "Estimation du mouvement dans une sequence d'images, en contexte lineaire optimal". Grenoble INPG, 1995. http://www.theses.fr/1995INPG0030.

Pełny tekst źródła
Streszczenie:
La perception du mouvement dans une sequence d'images est un element cle de la comprehension d'une scene dynamique. L'information de mouvement est partiellement observable grace aux variations spatio-temporelles de l'intensite lumineuse. Le caractere partiel de cette observation, ainsi que la presence de frontieres de mouvement, constituent deux des principales difficultes majeures liees a l'estimation du champ des vitesses. Dans la grande majorite des approches existantes, la fusion des observations est effectuee spatialement, a un instant donne. Le plus souvent, le champ de vecteurs estime est alors seulement reconduit d'un instant a l'autre. Peu de travaux exploitent la demarche duale, consistant a fusionner temporellement l'information observable. Cette demarche, particulierement seduisante en ce qu'elle permet d'assimiler le probleme des frontieres de mouvement a la detection d'instationnarites fortes sur l'etat d'un systeme dynamique, constitue la base de notre approche. Nous proposons un estimateur sequentiel du mouvement image, base sur le filtre de kalman. Le vecteur vitesse image est estime independamment en chacun des pixels de l'image, en fonction du temps. La detection des frontieres de mouvement repose sur une analyse en ligne des statistiques du signal d'innovation. Cette approche est reprise dans le cas ou l'on ne dispose que de deux images. On derive alors un estimateur recursif, obtenu par approximation de l'estimateur recursif optimal, possedant de bonnes proprietes de convergence et de stabilite. Le comportement assymptotique de l'un et l'autre de ces estimateurs est evalue sur la base de sequences de synthese et de sequences reelles. Dans le cas d'un deplacement de faible amplitude, la nature lineaire de l'observation garantit l'optimalite de l'estimation par le filtre de kalman. Afin d'etendre l'estimation au cas des grands deplacements, caracterises par une observation non lineaire, on definit une variante sous-optimale a iterations locales du filtre de kalman etendu. On retrouve la une formulation en contexte optimal de l'approche multi-resolution de type descendant, classique en vision par ordinateur
Style APA, Harvard, Vancouver, ISO itp.
9

Hunziker, Angela. "Improving multiple sequence alignments using information from libraries of optimal pairwise alignments /". Zürich : ETH, Eidgenössische Technische Hochschule Zürich, [Departement für Informatik, Institut für Wissenschaftliches Rechnen], 2003. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=117.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Luong, Dung Viet Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Optimal training sequence design for MIMO-OFDM in spatially correlated fading environments". Awarded by:University of New South Wales. Electrical Engineering & Telecommunications, 2009. http://handle.unsw.edu.au/1959.4/44513.

Pełny tekst źródła
Streszczenie:
Multiple Input Multiple Output with Orthogonal Frequency Division Multiplexing (MIMOOFDM) has been widely adopted as one of the most promising air interface solutions for future broadband wireless communication systems due to its high rate transmission capability and robustness against multipath fading. However, these MIMO-OFDM advantages cannot be achieved unless the channel state information (CSI) can be obtained accurately and promptly at the receiver to assist coherent detection of data symbols. Channel estimation and training sequence design are, therefore, still open challenges of great interest. In this work, we investigate the Linear Minimum Mean Square Error (LMMSE) channel estimation and design nearly optimal training sequences for MIMO-OFDM systems in spatially correlated fading. We, first, review the LMMSE channel estimation model for MIMO-OFDM in spatially correlated fading channels. We, then, derive a tight theoretical lower bound of the channel estimation Mean Square Error (MSE). By exploiting the information on channel correlation matrices which is available at the transmitter, we design a practical and nearly optimal training sequence for MIMO-OFDM systems . The optimal transmit power allocation for training sequences is found using the Iterative Bisection Procedure (IBP). We also propose an approximate transmit power allocation algorithm which is computationally more efficient than the IBP while maintaining a similar MSE performance. The proposed training sequence design method is also applied to MIMO-OFDM systems where Cyclic Prefixing OFDM (CP-OFDM) is replaced by Zero Padding OFDM - OverLap-Add method (ZP-OFDM-OLA). The simulation results show that the performance of the proposed training sequence is superior to that of all existing training sequences and almost achieves the MSE theoretical lower bound.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Optimal Sequence"

1

Chand, Suresh. Determination of optimal due dates and sequence. [Urbana, Ill.]: College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Kuri, Joy. On the optimal allocation of customers that must depart in sequence. Bangalore: Dept. of Electrical Communication Engineering, Indian Institute of Science, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Laan, Dinard van der. The structure and performance of optimal routing sequences. Leiden: Universiteit Leiden, 2003.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Piunovskiy, A. B. Optimal Control of Random Sequences in Problems with Constraints. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-011-5508-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Piunovskiy, A. B. Optimal Control of Random Sequences in Problems with Constraints. Dordrecht: Springer Netherlands, 1997.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Piunovskiy, A. B. Optimal control of random sequences in problems with constraints. Dordrecht: Kluwer, 1997.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Halpin, Brendan. Class careers as sequences: An optimal matching analysis of work-life histories. Colchester: ESRC Research Centre on Micro-social Change, 1996.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Zhuravlev, P. V. Spektroradiometricheskie pribory distant︠s︡ionnogo zondirovanii︠a︡ na osnove preobrazovanii︠a︡ Adamara. Novosibirsk: Konstruktorsko-tekhnologicheskiĭ institut prikladnoĭ mikroėlektroniki SO RAN, 2003.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Georghiades, Costas N. On the synchronizability and detectability of random PPM sequences. [Washington, DC: National Aeronautics and Space Administration, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

ISBRA 2010 (2010 Storrs, Conn.). Bioinformatics research and applications: 6th international symposium, ISBRA 2010, Storrs, CT, USA, May 23-26, 2010 : proceedings. Berlin: Springer, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Optimal Sequence"

1

Coppersmith, Don, i Markus Jakobsson. "Almost Optimal Hash Sequence Traversal". W Financial Cryptography, 102–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36504-4_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Mwaniki, Njagi Moses, i Nadia Pisanti. "Optimal Sequence Alignment to ED-Strings". W Bioinformatics Research and Applications, 204–16. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-23198-8_19.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Du, Zhihua, Zhen ji i Feng Lin. "Parallel Computing for Optimal Genomic Sequence Alignment". W Fuzzy Systems and Knowledge Discovery, 532–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11881599_61.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Pearson, William R. "Searching Protein Sequence Databases — Is Optimal Best?" W Computational Methods in Genome Research, 111–20. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2451-9_9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Ivanov, Pesho, Benjamin Bichsel, Harun Mustafa, André Kahles, Gunnar Rätsch i Martin Vechev. "AStarix: Fast and Optimal Sequence-to-Graph Alignment". W Lecture Notes in Computer Science, 104–19. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45257-5_7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Łubniewski, Paweł J., i Wojciech S. Mokrzycki. "Choosing an Optimal Bracketing Sequence for HDR Imaging". W Computer Vision and Graphics, 300–307. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00692-1_26.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Bala Murali, Gunji, Anuj Jariwalab, Samarth Savaliac, Vrushabh Kadamd, G. S. Mahapatra i Amruta Rout. "Optimal Disassembly Sequence Generation Using Tool Information Matrix". W Lecture Notes in Mechanical Engineering, 155–64. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-1665-8_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Çela, Arben, Mongi Ben Gaid, Xu-Guang Li i Silviu-Iulian Niculescu. "Optimization of the Hyper-Sampling Sequence for DCESs". W Optimal Design of Distributed Control and Embedded Systems, 207–21. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-02729-6_11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Memeti, Suejb, Sabri Pllana i Joanna Kołodziej. "Optimal Worksharing of DNA Sequence Analysis on Accelerated Platforms". W Computer Communications and Networks, 279–309. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44881-7_14.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

López, Juan Camilo, Pedro P. Vergara, Marcos J. Rider i Luiz C. P. da Silva. "Optimal Restoration of Electrical Distribution Systems Considering Switching Sequence". W Energy Systems, 273–91. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-36115-0_9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Optimal Sequence"

1

Ghiasi, Soheil, i Majid Sarrafzadeh. "Optimal reconfiguration sequence management". W the 2003 conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/1119772.1119843.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Navarro, Gonzalo, i Yakov Nekrich. "Optimal Dynamic Sequence Representations". W Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.62.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Loukides, Grigorios, i Robert Gwadera. "Optimal event sequence sanitization". W Proceedings of the 2015 SIAM International Conference on Data Mining. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974010.87.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Enomoto, Atsuko, Yasushi Aoyama, Yuta Yamauchi i Noriaki Yamamoto. "Near optimal assembly sequence generation". W 2016 IEEE/SICE International Symposium on System Integration (SII). IEEE, 2016. http://dx.doi.org/10.1109/sii.2016.7843981.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Minh Ngoc Nguyen i J. C. Rajapakse. "Optimal approach to sequence-to-sequence prediction: applications in bioinformatics". W 9th International Conference on Neural Information Processing. IEEE, 2002. http://dx.doi.org/10.1109/iconip.2002.1201894.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Sarin, S. C., i C. J. Desai. "An Integrated Approach to the Optimal Sequencing of Robot Operations in a Workcell". W ASME 1988 Design Technology Conferences. American Society of Mechanical Engineers, 1988. http://dx.doi.org/10.1115/detc1988-0058.

Pełny tekst źródła
Streszczenie:
Abstract In this paper we develop an integrated approach to optimally sequence robot operation in a workcell. The workcell represents a flowshop containing multiple robots with known inverse kinematic solution that are used to transport jobs among machines. The objeotive is to determine the sequence of robot operations so as to minimize the total time needed to complete all jobs (known as makespan). The integrated approach consists of determining optimal robot task sequences using a branch and bound procedure, and a graphical simulation procedure to display robot motion during the performance of transport operations. The graphical simulation is used to detect interference among robots which is hard to be incorporated in the branch and bound procedure. Infeasible robot sequences are discarded and other solutions from the branch and bound procedure are displayed using the graphical simulation procedure to determine a near optimal and feasible sequence. The integrated approach is implemented on a prototype system.
Style APA, Harvard, Vancouver, ISO itp.
7

Krishna, Vangipuram Radha, i P. V. Kumar. "Optimal pattern search for sequence databases". W 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icacte.2010.5579518.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Maksimov, Aleksey, i Vladislav Sergeyev. "Optimal fusing of video sequence images". W 2020 International Conference on Information Technology and Nanotechnology (ITNT). IEEE, 2020. http://dx.doi.org/10.1109/itnt49337.2020.9253202.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Adhau, Saurabh, Shubhangi Shinde, Taufiq Monghal i Varsha Hole. "GlobeTrotter: An Optimal Travel Sequence Generator". W 2018 Second International Conference on Electronics, Communication and Aerospace Technology (ICECA). IEEE, 2018. http://dx.doi.org/10.1109/iceca.2018.8474589.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Ying-Ding, Zhao, i Qiao Xian-Xia. "Research on optimal Multiple Sequence Alignment". W 2010 International Conference on E-Business and E-Government (ICEE). IEEE, 2010. http://dx.doi.org/10.1109/icee.2010.1377.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Optimal Sequence"

1

Lu, John Q. On The Linear Span of A Binary Sequence Family with Optimal Correlation Properties. Fort Belvoir, VA: Defense Technical Information Center, listopad 2009. http://dx.doi.org/10.21236/ada520449.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Yee, M. L., i D. C. Craft. Fast DNA sequence alignment using optical computing. Office of Scientific and Technical Information (OSTI), listopad 1996. http://dx.doi.org/10.2172/414348.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Xiong, Yalin, i Steven A. Shafer. Dense Structure from a Dense Optical Flow Sequence. Fort Belvoir, VA: Defense Technical Information Center, kwiecień 1995. http://dx.doi.org/10.21236/ada311290.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Tao, Yang, Amos Mizrach, Victor Alchanatis, Nachshon Shamir i Tom Porter. Automated imaging broiler chicksexing for gender-specific and efficient production. United States Department of Agriculture, grudzień 2014. http://dx.doi.org/10.32747/2014.7594391.bard.

Pełny tekst źródła
Streszczenie:
Extending the previous two years of research results (Mizarch, et al, 2012, Tao, 2011, 2012), the third year’s efforts in both Maryland and Israel were directed towards the engineering of the system. The activities included the robust chick handling and its conveyor system development, optical system improvement, online dynamic motion imaging of chicks, multi-image sequence optimal feather extraction and detection, and pattern recognition. Mechanical System Engineering The third model of the mechanical chick handling system with high-speed imaging system was built as shown in Fig. 1. This system has the improved chick holding cups and motion mechanisms that enable chicks to open wings through the view section. The mechanical system has achieved the speed of 4 chicks per second which exceeds the design specs of 3 chicks per second. In the center of the conveyor, a high-speed camera with UV sensitive optical system, shown in Fig.2, was installed that captures chick images at multiple frames (45 images and system selectable) when the chick passing through the view area. Through intensive discussions and efforts, the PIs of Maryland and ARO have created the protocol of joint hardware and software that uses sequential images of chick in its fall motion to capture opening wings and extract the optimal opening positions. This approached enables the reliable feather feature extraction in dynamic motion and pattern recognition. Improving of Chick Wing Deployment The mechanical system for chick conveying and especially the section that cause chicks to deploy their wings wide open under the fast video camera and the UV light was investigated along the third study year. As a natural behavior, chicks tend to deploy their wings as a mean of balancing their body when a sudden change in the vertical movement was applied. In the latest two years, this was achieved by causing the chicks to move in a free fall, in the earth gravity (g) along short vertical distance. The chicks have always tended to deploy their wing but not always in wide horizontal open situation. Such position is requested in order to get successful image under the video camera. Besides, the cells with checks bumped suddenly at the end of the free falling path. That caused the chicks legs to collapse inside the cells and the image of wing become bluer. For improving the movement and preventing the chick legs from collapsing, a slowing down mechanism was design and tested. This was done by installing of plastic block, that was printed in a predesign variable slope (Fig. 3) at the end of the path of falling cells (Fig.4). The cells are moving down in variable velocity according the block slope and achieve zero velocity at the end of the path. The slop was design in a way that the deacceleration become 0.8g instead the free fall gravity (g) without presence of the block. The tests showed better deployment and wider chick's wing opening as well as better balance along the movement. Design of additional sizes of block slops is under investigation. Slops that create accelerations of 0.7g, 0.9g, and variable accelerations are designed for improving movement path and images.
Style APA, Harvard, Vancouver, ISO itp.
5

Montville, Thomas J., i Roni Shapira. Molecular Engineering of Pediocin A to Establish Structure/Function Relationships for Mechanistic Control of Foodborne Pathogens. United States Department of Agriculture, sierpień 1993. http://dx.doi.org/10.32747/1993.7568088.bard.

Pełny tekst źródła
Streszczenie:
This project relates the structure of the bacteriocin molecule (which is genetically determined) to its antimicrobial function. We have sequenced the 19,542 bp pediocin plasmid pMD136 and developed a genetic transfer system for pediococci. The pediocin A operon is complex, containing putative structural, immunity, processing, and transport genes. The deduced sequence of the pediocin A molecule contains 44 amino acids and has a predicted PI of 9.45. Mechanistic studies compared the interaction of pediocin PA-1 and nisin with Listeria monocytgenes cells and model lipid systems. While significant nisin-induced intracellular ATP depletion is caused by efflux, pediocin-induced depletion is caused exclusively by hydrolysis. Liposomes derived from L. monocytogenes phospholipids were used to study the physical chemistry of pediocin and nisin interactions with lipids. Their different pH optima are the results of different specific ionizable amino acids. We generated a predicted 3-D structural model for pediocin PA-1 and used a variety of mutant pediocins to demonstrate that the "positive patch" at residues 11 and 12 (and not the YGNGV consensus sequence) is responsible for the binding step of pediocin action. This structure/function understanding gained here provides necessary prerequisites to the more efficacious use of bacteriocins to control foodborne pathogens.
Style APA, Harvard, Vancouver, ISO itp.
6

Firon, Nurit, Prem Chourey, Etan Pressman, Allen Hartwell i Kenneth J. Boote. Molecular Identification and Characterization of Heat-Stress-Responsive Microgametogenesis Genes in Tomato and Sorghum - A Feasibility Study. United States Department of Agriculture, październik 2007. http://dx.doi.org/10.32747/2007.7591741.bard.

Pełny tekst źródła
Streszczenie:
Exposure to higher than optimal temperatures - heat-stress (HS) - is becoming increasingly common to all crop plants worldwide. Heat stress coinciding with microgametogenesis, especially during the post-meiotic phase that is marked by starch biosynthesis, is often associated with starch-deficient pollen and male sterility and ultimately, greatly reduced crop yields. The molecular basis for the high sensitivity of developing pollen grains, on one hand, and factors involved in pollen heat-tolerance, on the other, is poorly understood. The long-term goal of this project is to provide a better understanding of the genes that control pollen quality under heat-stress conditions. The specific objectives of this project were: (1) Determination of the threshold heat stress temperature(s) that affects tomato and sorghum pollen quality whether: a) Chronic mild heat stress conditions (CMHS), or b) Acute heat stress (AHS). (2) Isolation of heat-responsive, microgametogenesis-specific sequences. During our one-year feasibility project, we have accomplished the proposed objectives as follows: Objectrive 1: We have determined the threshold HS conditions in tomato and sorghum. This was essential for achieving the 2nd objective, since our accumulated experience (both Israeli and US labs) indicate that when temperature is raised too high above "threshold HS levels" it may cause massive death of the developing pollen grains. Above-threshold conditions have additional major disadvantages including the "noise" caused by induced expression of genes involved in cell death and masking of the differences between heatsensitive and heat-tolerant pollen grains. Two different types of HS conditions were determined: a) Season-long CMHS conditions: 32/26°C day/night temperatures confirmed in tomato and 36/26°C day maximum/night minimum temperatures in sorghum. b) Short-term AHS: In tomato, 2 hour exposure to 42-45°C (at 7 to 3 days before anthesis) followed by transfer to 28/22±2oC day/night temperatures until flower opening and pollen maturation, caused 50% reduced germinating pollen in the heat-sensitive 3017 cv.. In sorghum, 36/26°C day/night temperatures 10 to 5 days prior to panicle emergence, occurring at 35 days after sowing (DAS) in cv. DeKalb28E, produced starch-deficient and sterile pollen. Objective 2: We have established protocols for the high throughput transcriptomic approach, cDNA-AFLP, for identifying and isolating genes exhibiting differential expression in developing microspores exposed to either ambient or HS conditions and created a databank of HS-responsivemicrogametogenesis-expressed genes. A subset of differentially displayed Transcript-Derived Fragments (TDFs) that were cloned and sequenced (35 & 23 TDFs in tomato and sorghum, respectively) show close sequence similarities with metabolic genes, genes involved in regulation of carbohydrate metabolism, genes implicated in thermotolerance (heat shock proteins), genes involved in long chain fatty acids elongation, genes involved in proteolysis, in oxidation-reduction, vesicle-mediated transport, cell division and transcription factors. T-DNA-tagged Arabidopsis mutants for part of these genes were obtained to be used for their functional analysis. These studies are planned for a continuation project. Following functional analyses of these genes under HS – a valuable resource of genes, engaged in the HS-response of developing pollen grains, that could be modulated for the improvement of pollen quality under HS in both dicots and monocots and/or used to look for natural variability of such genes for selecting heat-tolerant germplasm - is expected.
Style APA, Harvard, Vancouver, ISO itp.
7

Mbani, Benson, Valentin Buck i Jens Greinert. Megabenthic Fauna Detection with Faster R-CNN (FaunD-Fast) Short description of the research software. GEOMAR, 2023. http://dx.doi.org/10.3289/sw_1_2023.

Pełny tekst źródła
Streszczenie:
This is an A.I. - based workflow for detecting megabenthic fauna from a sequence of underwater optical images. The workflow (semi) automatically generates weak annotations through the analysis of superpixels, and uses these (refined and semantically labeled) annotations to train a Faster R-CNN model. Currently, the workflow has been tested with images of the Clarion-Clipperton Zone in the Pacific Ocean
Style APA, Harvard, Vancouver, ISO itp.
8

Shoseyov, Oded, Steven A. Weinbaum, Raphael Goren i Abhaya M. Dandekar. Biological Thinning of Fruit Set by RNAase in Deciduous Fruit Trees. United States Department of Agriculture, sierpień 1993. http://dx.doi.org/10.32747/1993.7568110.bard.

Pełny tekst źródła
Streszczenie:
Fruit thinning is a common and necessary practice for commercial fruit production in many deciduous tree fruit species. Fruit thinning in apple may be accomplished with a variety of chemical thinning agents, but the use of these chemicals is a subject of environmental concern. It has been shown recently that RNase enzyme, secreted from the stigma and the style, inhibits pollen germination and pollen tube elongation. In this study we have been able to show that Aspergillus niger B-1 RNase can effectively inhibit peach and apple pollen germination, and tube elongation in-vitro, as well as thin fruit in peach and apple, and reduce the number of seeds in citrus. The objectives of the research were to detrmine the conditions for effective thinning of (USA and Israel), develop fermentation process for cost effective production of RNase from A. niger. (Israel), and clone apple S-RNase cDNA (USA). All the objectives of the research were addressed. We have determined the optimal fermentation conditions for cost effective production of the A. niger at a 20,000 liters scale. TheA. niger B1 RNase was isolated to homogeneity and its kinetic and biochemical properties including its N-terminal sequence were fully characterized. The field test results both in Israel and California have shown variability in effectiveness and more work is needed to define the RNase concentration necessary to completely inhibit pollen development. Plant transformation vectors expressing anti-sense apple S-RNase genes were constructed (USA) with an attempt to produce self compatible transgenic apple trees. Bovine S-Protein cDNA was cloned and successfully expressed in E. coli (Israel). Plant transformation vector expressing the S-Protein gene was constructed (USA) with an attempt to produce transgenic plants expressing S-protein in the style. Exogenous application of S-peptide to these plants will result in active RNase and consequently prevention of fertilization.
Style APA, Harvard, Vancouver, ISO itp.
9

Schwartz, David C. Microbial genome program report: Optical approaches for physical mapping and sequence assembly of the Deinococcus radiodurans chromosome. Office of Scientific and Technical Information (OSTI), listopad 1999. http://dx.doi.org/10.2172/758845.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Pillai, R. S., i A. K. Rathi. MAXBAND Version 3.1: Heuristic and optimal approach for setting the left turn phase sequences in signalized networks. Office of Scientific and Technical Information (OSTI), luty 1995. http://dx.doi.org/10.2172/34378.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Optimal Sequence” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii