Relevant bibliographies by topics / Doubling algorithm

Academic literature on the topic 'Doubling algorithm'

Author: Grafiati
Published: 10 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Doubling algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Doubling algorithm"

1

Chawla, M. M., K. Passi, and R. A. Zalik. "A recursive doubling algorithm for inverting tridiagonal matrices." International Journal of Computer Mathematics 37, no. 3-4 (January 1990): 213–20. http://dx.doi.org/10.1080/00207169008803949.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

KIMURA, MORISHIGE. "Doubling algorithm for continuous-time algebraic Riccati equation." International Journal of Systems Science 20, no. 2 (February 1989): 191–202. http://dx.doi.org/10.1080/00207728908910119.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Poloni, Federico, and Timo Reis. "A structure-preserving doubling algorithm for Lur'e equations." Numerical Linear Algebra with Applications 23, no. 1 (October 14, 2015): 169–86. http://dx.doi.org/10.1002/nla.2019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Katsikopoulos, Konstantinos V., and Özgür Şimşek. "Optimal doubling strategy against a suboptimal opponent." Journal of Applied Probability 42, no. 3 (September 2005): 867–72. http://dx.doi.org/10.1239/jap/1127322034.

Full text
Abstract:
For two-person zero-sum games, where the probability of each player winning is a continuous function of time and is known to both players, the mutually optimal strategy for proposing and accepting a doubling of the game value is known. We present an algorithm for deriving the optimal doubling strategy of a player who is aware of the suboptimal strategy followed by the opponent. We also present numerical results about the magnitude of the benefits; the results support the claim that repeated application of the algorithm by both players leads to the mutually optimal strategy.
APA, Harvard, Vancouver, ISO, and other styles
5

Katsikopoulos, Konstantinos V., and Özgür Şimşek. "Optimal doubling strategy against a suboptimal opponent." Journal of Applied Probability 42, no. 03 (September 2005): 867–72. http://dx.doi.org/10.1017/s002190020000084x.

Full text
Abstract:
For two-person zero-sum games, where the probability of each player winning is a continuous function of time and is known to both players, the mutually optimal strategy for proposing and accepting a doubling of the game value is known. We present an algorithm for deriving the optimal doubling strategy of a player who is aware of the suboptimal strategy followed by the opponent. We also present numerical results about the magnitude of the benefits; the results support the claim that repeated application of the algorithm by both players leads to the mutually optimal strategy.
APA, Harvard, Vancouver, ISO, and other styles
6

Qu, Hui Yan, and Wei Zhao. "Fast Collision Detection Algorithm Based on Parallel Doubling Technology." Applied Mechanics and Materials 519-520 (February 2014): 824–27. http://dx.doi.org/10.4028/www.scientific.net/amm.519-520.824.

Full text
Abstract:
This paper presents a doubling technology of fast traverse of the list .When parallel call recursively, distance of the division between data gradually doubled after completion of the operation, it was completed the operation of all the data the distance of 2M after calculation of M times. The experiment results show that the proposed method has higher efficiency compared with the normal stand-alone computing and parallel computing so it achieved real-time of CD.
APA, Harvard, Vancouver, ISO, and other styles
7

Patel, Santosh C., David S. Friedman, Parna Varadkar, and Alan L. Robin. "Algorithm for interpreting the results of frequency doubling perimetry." American Journal of Ophthalmology 129, no. 3 (March 2000): 323–27. http://dx.doi.org/10.1016/s0002-9394(99)00399-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guo, Zhen-Chen, Eric King-Wah Chu, and Wen-Wei Lin. "Doubling algorithm for the discretized Bethe-Salpeter eigenvalue problem." Mathematics of Computation 88, no. 319 (January 9, 2019): 2325–50. http://dx.doi.org/10.1090/mcom/3398.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lainiotis, D. G., N. D. Assimakis, and S. K. Katsikas. "New doubling algorithm for the discrete periodic Riccati Equation." Applied Mathematics and Computation 60, no. 2-3 (February 1994): 265–83. http://dx.doi.org/10.1016/0096-3003(94)90109-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Stabrowski, Marek. "Parallel real-world LU decomposition: Gauss vs. Crout algorithm." Open Computer Science 8, no. 1 (December 1, 2018): 210–17. http://dx.doi.org/10.1515/comp-2018-0020.

Full text
Abstract:
Abstract This paper presents numerical experiments with assorted versions of parallel LU matrix decomposition algorithms (Gauss and Crout algorithm). The tests have been carried out on the hardware platform with fourcore Skylake processor featuring hyperthreading technology doubling virtually core number. Parallelization algorithms have been implemented with the aid of classic POSIX threads library. Experiments have shown that basic 4-thread acceleration of all parallel implementations is almost equal to the number of threads/processors. Both algorithms are worth considering in real-world applications (Florida University collection). Gauss algorithm is a better performer, with respect to timing, in the case of matrices with lower density of nonzeros, as opposed to higher density matrices. The latter are processed more efficiently with the aid of Crout algorithm implementation.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Doubling algorithm"

1

Macoosh, Asnat. "An implicit doubling algorithm for squaring matrices /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63171.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dai, Yan. "A NEW IMPLEMENTATION OF CLUSTERING ALGORITHM AND ITS APPLICATION IN NET-TREE CONSTRUCTION ALGORITHM." Miami University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=miami1237496109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hammami, Manel <1987&gt. "Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amsdottorato.unibo.it/8426/7/Final_thesis_Manel_Hammami_03april2018.pdf.

Full text
Abstract:
The implementation of ripple correlation control (RCC) algorithms for maximum power point tracking (MPPT) schemes in PV generation systems is presented and discussed in this PhD thesis in order to improve static and dynamic performances. Improvements in RCC are introduced first, considering fast irradiance transients and a hybrid RCC scheme is proposed. Power quality of the PV generation system is improved by multilevel inverter implemented by level doubling network (LDN), reducing output voltage and current harmonics. Reference is made to single-phase single-stage multilevel PV generation systems, when the inverter input variables, actually PV voltage and PV current, have multiple low-frequency (ripple) harmonics. The harmonic analysis is carried out with reference to a multilevel configuration consisting in H-bridge inverter and level doubling network (LDN) cell, leading to a multilevel inverter having the double of output voltage levels compared to the basic H-bridge inverter topology (i.e., five levels vs. three levels). The LDN cell is basically a half-bridge fed by a floating capacitor, with self-balancing voltage capability. The multilevel configuration introduces additional PV voltage and current low-frequency harmonics, perturbing the basic implementation of the RCC scheme (based on the 100 Hz component in case of 50 Hz fundamental), leading to malfunctioning. The proposed RCC algorithm employs the PV current and voltage harmonics at a specific frequency for the estimation of the voltage derivative of the power dP/dV (or dI/dV), driving the PV operating point toward the MPP in a more precise and faster manner. The steady-state and transient performances of the proposed RCC-MPPT schemes have been tested and compared by MATLAB/ Simulink. Results have been verified by experimental tests considering the whole single-phase multilevel PV generation system, including real PV modules, multilevel IBGTs inverter, and utility grid.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Huimin. "Algorithmes rapides et matrices de toeplitz." Paris, ENST, 1989. http://www.theses.fr/1989ENST0008.

Full text
Abstract:
Cette these concerne l'etude des algorithmes rapides fondes sur des matrices de toeplitz, dans le contexte des methodes d'analyse spectrale haute-resolution. Apres une analyse des proprietes et structures des matrices de correlation estimees par des methodes classiques, nous etudions dans la premiere partie de cette these, une matrice de toeplitz particuliere la matrice d'ouamri. Cette matrice est la seule matrice de correlation a la structure de toeplitz qui permette d'obtenir une estimation asymptotiquement sans biais des frequences sinusoidales. A l'aide de cette matrice, nous developpons un algorithme de burg modifie pour la modelisation ar, qui est superieur a l'algorithme initial en ce qui concerne le biais d'estimation des frequences, tout en ayant une complexite de calcul comparable. Le developpement d'algorithmes rapides fondes sur des matrices de toeplitz pour des applications dans le domaine de l'analyse spectrale fait l'objet de la deuxieme partie de la these. Deux principaux sujets ont ete abordes: la decomposition en elements propres de la matrice et la resolution des equations de yule-walker. Notre accent se porte sur le deuxieme. D'abord, nous effectuons une comparaison des algorithmes classiques pour la resolution des equations de yule-walker (algorithme de levinson, de schur, de berlekamp-massey, et de euclide). Ces algorithmes sont lies par leur interpretation comme algorithmes de calcul des approximants de pade. En les classant dans les deux categories suivantes: algorithme a un passage et algorithme a deux passages, nous montrons que l'ensemble des algorithmes classiques connus n'est pas complet, et nous proposons les variantes manquantes. Ensuite, d'une facon generale, nous etudions l'application de la strategie de doubling de levinson/schur, qui est le plus efficace parmi les algorithmes doubling possibles. Nous l'avons implante de deux manieres differentes, en utilisant d'une pa
APA, Harvard, Vancouver, ISO, and other styles
5

Chang, Chih-Peng, and 張志鵬. "A Structure-Preserving Doubling Algorithm for Nonsymmetric Algebraic Riccati Equation." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/70367263068604887527.

Full text
Abstract:
碩士
國立清華大學
數學系
93
In this paper we consider the nonsymmetric algebraic Riccati equation (NARE) for which the four coefficient matrices form an M-matrix. Nonsymmetric algebraic Riccati equations of this type appear in applied probability and transport theory. The minimal nonnegative solution of these equations can be found by a structure-preserving doubling algorithm (SDA).
APA, Harvard, Vancouver, ISO, and other styles
6

Yang, Shih-Yuan, and 楊詩元. "Structured doubling Algorithm for solving a class of Singular Riccati equations." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/55790403051381799224.

Full text
Abstract:
碩士
國立清華大學
數學系
96
First of all, we summarize the square-root algorithm (SQR) for singular discretetime Riccati difference equation (DRDE). And we will discuss the structure-preserving doubling algorithms (SDAs) for the symmetric positive semidefinite solution to singular version of the discrete-time algebraic Riccati equation (DARE). Recently, doubling algorithms have been revived for DARE because of their nice numerical behavior, and we will compare the numerical behavior of SDA algorithm with SQR in some examples.
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, Guan-Ju, and 吳冠儒. "Structured Doubling Algorithm for the Band Structure of Photonics Crystals Using Green’s Function Approach." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/29058853194028989634.

Full text
Abstract:
碩士
國立臺灣師範大學
數學系
100
Full band gap structure is the most distinguished feature of photonic crystal and attracts extensive studies in its properties and applications. Our basic goal in this paper is to use an efficient way to illustrate the band structure of our problem and find the band gap as we can. First, we have a 2-D photonic crystals model in TM mode. After discretization, we can reduce our problem into an infinite general eigenvalue problem (GEP). Using Green’ s function approach, we can transform the infinite GEP into a finite order non-linear matrix equation (NME), whose solution can be used to illustrate the band structure figure. Next, we apply the structure-preserving doubling algorithm to solve this NME and get the solution with a nice efficiency by the special form of our matrices. Finally, we can successfully get the band structure figure and present an advanced way in the research of photonic crystals.
APA, Harvard, Vancouver, ISO, and other styles
8

Addis, Elena. "Elementwise accurate algorithms for nonsymmetric algebraic Riccati equations associated with M-matrices." Doctoral thesis, 2022. http://hdl.handle.net/2158/1275470.

Full text
Abstract:
We present an elementwise accurate algorithm which incorporates the shift technique for the computation of the minimal non negative solution of a nonsymmetric algebraic Riccati equation associated to M, when M is an irreducible singular M-matrix. We propose the idea of delayed shift and some results that guarantees the applicability and the convergence of structured doubling algorithm based only on the properties of the matrix of the initial setup of doubling algorithm instead of matrix M. We provide a componentwise error analysis for the algorithm and we also show some numerical experiments that illustrate the advantage in terms of accuracy and convergence speed.
APA, Harvard, Vancouver, ISO, and other styles
9

Chiang, Chun-Yueh, and 蔣俊岳. "Convergence Analysis of the Structure-Preserving Doubling Algorithms for Nonlinear Matrix Equations." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/27554203420264824203.

Full text
Abstract:
博士
國立清華大學
數學系
96
在本篇論文中,我們回顧了兩種型式的保結構算法, 我們只利用了一些基本的矩陣定理跟技術, 去分析這兩種保結構算法在4大類非線性矩陣方程的收斂行為, 特別在某種奇異的條件下, 我們證明了保結構算法的收斂行為是速率至少1/2的線性收斂. 跟以往的方法比較, 我們的結果更為廣泛、 限制條件更少、以及證明手法更為簡單; 透過數值實驗更可看出保結構算法比其他方法更有效率, 以及更合適的應用在這些矩陣方程。
APA, Harvard, Vancouver, ISO, and other styles
10

Vu, Tung Anh. "Algorithms for Low Highway Dimension Graphs." Master's thesis, 2021. http://www.nusl.cz/ntk/nusl-448270.

Full text
Abstract:
In this work we develop algorithms for the k-Supplier with Outliers problem. In a network, we are given a set of suppliers and a set of clients. The goal is to choose k suppliers so that the distance between every served client and its nearest supplier is minimized. Clients that are not served are called outliers and the number of allowed outliers is given on input. As k-Supplier with Outliers has numerous applications in logistics, we focus on parameters which are suitable for transportation networks. We study graphs with low highway dimension, which was proposed by Abraham et al. [SODA 2010], and low doubling dimension. It is known that unless P = NP, k-Supplier with Outliers does not admit a (3 − ε)-approximation algorithm for any constant ε > 0. The k-Supplier with Outliers problem is W[1]-hard on graphs of constant doubling dimension for parame- ters k and highway dimension. We overcome both of these barriers through the paradigm of parameterized approximation algorithms. In the case of highway dimension, we develop a (1 + ε)-approximation algorithm for any ε > 0 with running time f(k, p, h, ε) · nO(1) where p is the number of allowed outliers, h is the highway dimension of the input graph, and f is some computable function. In the case of doubling dimension, we develop a (1 + ε)-approximation...
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Doubling algorithm"

1

Hammami, Manel. Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10492-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hammami, Manel. Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems. Springer, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Huang, Tsung-Ming, Ren-Cang Li, and Wen-Wei Lin. Structure-Preserving Doubling Algorithms for Nonlinear Matrix Equations. Society for Industrial and Applied Mathematics, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Doubling algorithm"

1

Hammami, Manel. "Improvement of Output Power Quality by Level Doubling Network (LDN)." In Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems, 27–43. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10492-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ding, Hu, Tan Chen, Fan Yang, and Mingyue Wang. "A Data-Dependent Algorithm for Querying Earth Mover's Distance with Low Doubling Dimensions." In Proceedings of the 2021 SIAM International Conference on Data Mining (SDM), 630–38. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2021. http://dx.doi.org/10.1137/1.9781611976700.71.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hammami, Manel. "General Introduction." In Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems, 1–7. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10492-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hammami, Manel. "Basic RCC-MPPT Scheme in Single-Phase H-Bridge Grid-Connected PV Systems." In Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems, 9–26. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10492-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hammami, Manel. "Analysis of DC-Link Current and Voltage Ripple: Single-Phase Configuration." In Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems, 45–65. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10492-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hammami, Manel. "Analysis of DC-Link Current and Voltage Ripple: Three-Phase Configuration." In Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems, 67–87. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10492-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hammami, Manel. "Improvement of RCC-MPPT in Case of Multiple DC-Link Voltage Harmonics." In Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems, 89–109. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10492-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hammami, Manel. "Conclusion and Perspectives." In Level Doubling Network and Ripple Correlation Control MPPT Algorithm for Grid-Connected Photovoltaic Systems, 111–12. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10492-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Neiman, Ofer. "Low Dimensional Embeddings of Doubling Metrics." In Approximation and Online Algorithms, 12–23. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08001-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cygan, Marek, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, and Piotr Sankowski. "Fast Approximation in Subspaces by Doubling Metric Decomposition." In Algorithms – ESA 2010, 72–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15775-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Doubling algorithm"

1

Arap, Omer, Martin Swany, Geoffrey Brown, and Bryce Himebaugh. "Adaptive Recursive Doubling Algorithm for Collective Communication." In 2015 IEEE International Parallel and Distributed Processing Symposium Workshop (IPDPSW). IEEE, 2015. http://dx.doi.org/10.1109/ipdpsw.2015.82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Seal, Sudip K. "An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems." In 2014 IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2014. http://dx.doi.org/10.1109/ipdps.2014.107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Othman, M., E. M. Abulkhirat, M. R. M. Said, R. Johari, and Z. M. Ali. "An improvement of LUC2 cryptosystem algorithm using Doubling with Remainder." In Informatics (ICOCI). IEEE, 2006. http://dx.doi.org/10.1109/icoci.2006.5276541.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tyler, David W., and John G. McInerney. "Pumped-cavity frequency-doubling of semiconductor laser radiation." In Nonlinear Optics. Washington, D.C.: Optica Publishing Group, 1992. http://dx.doi.org/10.1364/nlo.1992.we2.

Full text
Abstract:
One demonstrated scheme for doubling AlGaAs and InGaAs laser radiation to the blue (.400-.500 pm) is pumped-cavity secondharmonic generation (PC-SHG) [1]. In this scheme, an optically nonlinear medium is placed in a cavity pumped by an external source. We show that optimization of this process is a nonlinear problem and have developed a simple algorithm for selection of optimal parameters.
APA, Harvard, Vancouver, ISO, and other styles
5

Assimakis, Nicholas, and Maria Adam. "Fast Doubling Algorithm for the Solution of the Riccati Equation Using Cyclic Reduction Method." In 2020 International Conference on Mathematics and Computers in Science and Engineering (MACISE). IEEE, 2020. http://dx.doi.org/10.1109/macise49704.2020.00007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vincely, Vinoin Devpaul, and Karthik Vishwanath. "Lateral light losses in integrating sphere measurements: comparison of Monte-Carlo with inverse adding-doubling algorithm." In Design and Quality for Biomedical Technologies XIII, edited by T. Joshua Pfefer, Jeeseong Hwang, and Gracie Vargas. SPIE, 2020. http://dx.doi.org/10.1117/12.2546265.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Moncet, J. L., and S. A. Clough. "Retrieval of Effective Cloud Radiative Properties from Ground Based Spectral Measurements." In Optical Remote Sensing of the Atmosphere. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/orsa.1997.othc.4.

Full text
Abstract:
A fast and numerically accurate model for monochromatic radiative transfer in scattering atmospheres has been developed to extend the capabilities of the existing LBLRTM line-by-line model [Clough et al., 1992] to the treatment of clouds and aerosols. The algorithm is based on the adding-doubling method and is specifically designed to perform radiance calculations in both the thermal and solar regimes using any specified number of computational streams. The efficient implementation of the adding-doubling scheme makes it possible to use the multiple-scattering algorithm in retrieval applications, an essential requirement for the intended use of the algorithm in atmospheric validation studies. The algorithm is applied to daytime observations of water clouds from the ground-based high spectral resolution Atmospheric Emitted Radiance Interferometer (AERI) [Smith et al., 1995]. Cloud particle size and density, and cloud fraction are retrieved from the spectral measurements in the 520-1500 cm-1 and 1800-3020 cm-1 bands. An initial assessment is made of the spectral information content of the AERI measurements for water cloud properties, and of the quality of the spectral fits obtainable with those three free parameters in the two bands.
APA, Harvard, Vancouver, ISO, and other styles
8

Noel, Peter, and Marek Klemes. "Doubling the through-put of a Digital Microwave Radio system by the implementation of a cross-polarization interference cancellation algorithm." In 2012 IEEE Radio and Wireless Symposium (RWS). IEEE, 2012. http://dx.doi.org/10.1109/rws.2012.6175360.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yongliang, Tan, He Lesheng, Jin Haonan, and Kong Qingyang. "Fast Implementation of Elliptic Curve Cryptographic Algorithm on GF(3M) Based on FPGA." In 5th International Conference on Computer Science and Information Technology (COMIT 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111709.

Full text
Abstract:
As quantum computing and the theory of bilinear pairings continue being studied in depth, elliptic curves on GF(3m ) are becoming of an increasing interest because they provide a higher security. What’s more, because hardware encryption is more efficient and secure than software encryption in today's IoT security environment, this article implements a scalar multiplication algorithm for the elliptic curve on GF(3m ) on the FPGA device platform. The arithmetic in finite fields is quickly implemented by bit-oriented operations, and then the computation speed of point doubling and point addition is improved by a modified Jacobia projection coordinate system. The final experimental results demonstrate that the structure consumes a total of 7518 slices, which is capable of computing approximately 3000 scalar multiplications per second at 124 Mhz. It has relative advantages in terms of performance and resource consumption, which can be applied to specific confidential communication scenarios as an IP core.
APA, Harvard, Vancouver, ISO, and other styles
10

Kozma, László, and Tobias Mömke. "Maximum Scatter TSP in Doubling Metrics." In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Doubling algorithm"

1

Joshipura, Muktaka, and Sudip Seal. Optimizing the Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems of Equations. Office of Scientific and Technical Information (OSTI), August 2020. http://dx.doi.org/10.2172/1648916.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fridman, Eyal, Jianming Yu, and Rivka Elbaum. Combining diversity within Sorghum bicolor for genomic and fine mapping of intra-allelic interactions underlying heterosis. United States Department of Agriculture, January 2012. http://dx.doi.org/10.32747/2012.7597925.bard.

Full text
Abstract:
Heterosis, the enigmatic phenomenon in which whole genome heterozygous hybrids demonstrate superior fitness compared to their homozygous parents, is the main cornerstone of modern crop plant breeding. One explanation for this non-additive inheritance of hybrids is interaction of alleles within the same locus. This proposal aims at screening, identifying and investigating heterosis trait loci (HTL) for different yield traits by implementing a novel integrated mapping approach in Sorghum bicolor as a model for other crop plants. Originally, the general goal of this research was to perform a genetic dissection of heterosis in a diallel built from a set of Sorghum bicolor inbred lines. This was conducted by implementing a novel computational algorithm which aims at associating between specific heterozygosity found among hybrids with heterotic variation for different agronomic traits. The initial goals of the research are: (i) Perform genotype by sequencing (GBS) of the founder lines (ii) To evaluate the heterotic variation found in the diallel by performing field trails and measurements in the field (iii) To perform QTL analysis for identifying heterotic trait loci (HTL) (iv) to validate candidate HTL by testing the quantitative mode of inheritance in F2 populations, and (v) To identify candidate HTL in NAM founder lines and fine map these loci by test-cross selected RIL derived from these founders. The genetic mapping was initially achieved with app. 100 SSR markers, and later the founder lines were genotyped by sequencing. In addition to the original proposed research we have added two additional populations that were utilized to further develop the HTL mapping approach; (1) A diallel of budding yeast (Saccharomyces cerevisiae) that was tested for heterosis of doubling time, and (2) a recombinant inbred line population of Sorghum bicolor that allowed testing in the field and in more depth the contribution of heterosis to plant height, as well as to achieve novel simulation for predicting dominant and additive effects in tightly linked loci on pseudooverdominance. There are several conclusions relevant to crop plants in general and to sorghum breeding and biology in particular: (i) heterosis for reproductive (1), vegetative (2) and metabolic phenotypes is predominantly achieved via dominance complementation. (ii) most loci that seems to be inherited as overdominant are in fact achieving superior phenotype of the heterozygous due to linkage in repulsion, namely by pseudooverdominant mechanism. Our computer simulations show that such repulsion linkage could influence QTL detection and estimation of effect in segregating populations. (iii) A new height QTL (qHT7.1) was identified near the genomic region harboring the known auxin transporter Dw3 in sorghum, and its genetic dissection in RIL population demonstrated that it affects both the upper and lower parts of the plant, whereas Dw3 affects only the part below the flag leaf. (iv) HTL mapping for grain nitrogen content in sorghum grains has identified several candidate genes that regulate this trait, including several putative nitrate transporters and a transcription factor belonging to the no-apical meristem (NAC)-like large gene family. This activity was combined with another BARD-funded project in which several de-novo mutants in this gene were identified for functional analysis.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Doubling algorithm' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography