Gotowa bibliografia na temat „Generalised weight polynomials”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Generalised weight polynomials”.
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 "Generalised weight polynomials"
Blower, Gordon, i Yang Chen. "On Determinant Expansions for Hankel Operators". Concrete Operators 7, nr 1 (4.02.2020): 13–44. http://dx.doi.org/10.1515/conop-2020-0002.
Pełny tekst źródłaFtorek, Branislav, i Mariana Marˇcokov´A. "Markov type polynomial inequality for some generalized Hermite weight". Tatra Mountains Mathematical Publications 49, nr 1 (1.12.2011): 111–18. http://dx.doi.org/10.2478/v10127-011-0030-4.
Pełny tekst źródłaCzyżycki, Tomasz, Jiří Hrivnák i Jiří Patera. "Generating Functions for Orthogonal Polynomials of A2, C2 and G2". Symmetry 10, nr 8 (20.08.2018): 354. http://dx.doi.org/10.3390/sym10080354.
Pełny tekst źródłaKang, J. Y. "Some Properties of Multiple Generalizedq-Genocchi Polynomials with Weight and Weak Weight". International Journal of Mathematics and Mathematical Sciences 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/179385.
Pełny tekst źródłaDella Vecchia, B., G. Mastroianni i J. Szabados. "Generalized Bernstein polynomials with Pollaczek weight". Journal of Approximation Theory 159, nr 2 (sierpień 2009): 180–96. http://dx.doi.org/10.1016/j.jat.2009.02.008.
Pełny tekst źródłaHrivnák, Jiří, Jiří Patera i Marzena Szajewska. "Discrete Orthogonality of Bivariate Polynomials of A2, C2 and G2". Symmetry 11, nr 6 (3.06.2019): 751. http://dx.doi.org/10.3390/sym11060751.
Pełny tekst źródłaZaheer, Neyamat, i Aijaz A. Khan. "Some theorems on generalized polars with arbitrary weight". International Journal of Mathematics and Mathematical Sciences 10, nr 4 (1987): 757–76. http://dx.doi.org/10.1155/s0161171287000851.
Pełny tekst źródłaGao, Rugao, Keping Zhou i Yun Lin. "A Flexible Polynomial Expansion Method for Response Analysis with Random Parameters". Complexity 2018 (3.12.2018): 1–14. http://dx.doi.org/10.1155/2018/7471460.
Pełny tekst źródłaKasuga, T., i R. Sakai. "Orthonormal polynomials with generalized Freud-type weights". Journal of Approximation Theory 121, nr 1 (marzec 2003): 13–53. http://dx.doi.org/10.1016/s0021-9045(02)00041-2.
Pełny tekst źródłaBrackx, Fred, Nele De Schepper i Frank Sommen. "Clifford algebra-valued orthogonal polynomials in the open unit ball of Euclidean space". International Journal of Mathematics and Mathematical Sciences 2004, nr 52 (2004): 2761–72. http://dx.doi.org/10.1155/s0161171204401045.
Pełny tekst źródłaRozprawy doktorskie na temat "Generalised weight polynomials"
Griffiths, Wayne Bradley. "On a posteriori probability decoding of linear block codes over discrete channels". University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0156.
Pełny tekst źródłaChung, Jaewook. "Issues in Implementation of Public Key Cryptosystems". Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2853.
Pełny tekst źródłaNew three, four and five-way squaring formulae based on the Toom-Cook multiplication algorithm are presented. All previously known squaring algorithms are symmetric in the sense that the point-wise multiplication step involves only squarings. However, our squaring algorithms are asymmetric and use at least one multiplication in the point-wise multiplication step. Since squaring can be performed faster than multiplication, our asymmetric squaring algorithms are not expected to be faster than other symmetric squaring algorithms for large operand sizes. However, our algorithms have much less overhead and do not require any nontrivial divisions. Hence, for moderately small and medium size operands, our algorithms can potentially be faster than other squaring algorithms. Experimental results confirm that one of our three-way squaring algorithms outperforms the squaring function in GNU multiprecision library (GMP) v4. 2. 1 for certain range of input size. Moreover, for degree-two squaring in Z[x], our algorithms are much faster than any other squaring algorithms for small operands.
We present a side channel attack on XTR cryptosystems. We analyze the statistical behavior of simultaneous XTR double exponentiation algorithm and determine what information to gather to reconstruct the two input exponents. Our analysis and experimental results show that it takes U1. 25 tries, where U = max(a,b) on average to find the correct exponent pair (a,b). Using this result, we conclude that an adversary is expected to make U0. 625 tries on average until he/she finds the correct secret key used in XTR single exponentiation algorithm, which is based on the simultaneous XTR double exponentiation algorithm.
Ackermann, Maria Helena. "Mixture models based on power means and generalised Q-fractions". Diss., 2011. http://hdl.handle.net/2263/27481.
Pełny tekst źródłaDissertation (MSc)--University of Pretoria, 2011.
Chemical Engineering
unrestricted
Części książek na temat "Generalised weight polynomials"
Johnsen, Trygve, i Hugues Verdure. "Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes". W Coding Theory and Applications, 207–16. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66278-7_17.
Pełny tekst źródłade Graaf, J. "Riesz Bases of Special Polynomials in Weighted Sobolev Spaces of Analytic Functions". W Generalized Functions and Their Applications, 61–85. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4899-1591-7_7.
Pełny tekst źródłaVértesi, P. "Asymptotics of derivatives of orthogonal polynomials based on generalized Jacobi weights. Some new theorems and applications". W New Developments in Approximation Theory, 329–39. Basel: Birkhäuser Basel, 1999. http://dx.doi.org/10.1007/978-3-0348-8696-3_20.
Pełny tekst źródłaMarks II, Robert J. "Generalizations of the Sampling Theorem". W Handbook of Fourier Analysis & Its Applications. Oxford University Press, 2009. http://dx.doi.org/10.1093/oso/9780195335927.003.0011.
Pełny tekst źródłaStreszczenia konferencji na temat "Generalised weight polynomials"
Francès, Guillem, Augusto B. Corrêa, Cedric Geissmann i Florian Pommerening. "Generalized Potential Heuristics for Classical Planning". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/771.
Pełny tekst źródła"Output end-point weighted generalized predictive control-a polynomial approach". W Proceedings of the 1999 American Control Conference. IEEE, 1999. http://dx.doi.org/10.1109/acc.1999.783179.
Pełny tekst źródłaGriffiths, Wayne, Hans-Jurgen Zepernick i Manora Caldera. "APP decoding of non-binary block codes on Gilbert-Elliott channels using generalized weight polynomials". W 2008 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2008. http://dx.doi.org/10.1109/isita.2008.4895567.
Pełny tekst źródłaDeguchi, Tetsuo. "Generalized Drinfeld Polynomials for Highest Weight Vectors of the Borel Subalgebra of the sl2 Loop Algebra". W Proceedings of the 23rd International Conference of Differential Geometric Methods in Theoretical Physics. WORLD SCIENTIFIC, 2006. http://dx.doi.org/10.1142/9789812772527_0011.
Pełny tekst źródłaChalfoun, Joe, Catherine Bidard, Delphine Keller i Yann Perrot. "Long Reach Articulated Carrier: Geometric and Elastic Error Calibration of the Flexible Model Followed by Nonlinear Generalized Error Calibration With Ordinary Polynomials". W ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35221.
Pełny tekst źródłaShiau, Ting Nung, i Jer Rong Chang. "Multiobjective Optimization of Rotor-Bearing System With Critical Speeds Constraints". W ASME 1991 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/91-gt-117.
Pełny tekst źródłaShiau, T. N., H. J. Lee i Y. J. Tsai. "Multilevel Optimization of Rotor Bearing System With Dynamic Behavior Constraints". W ASME Turbo Expo 2000: Power for Land, Sea, and Air. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/2000-gt-0392.
Pełny tekst źródłaShiau, Ting Nung, Chun Pao Kuo i Jiunn Rong Hwang. "Multiobjective Optimization of a Flexible Rotor in Magnetic Bearings With Critical Speeds and Control Current Constraints". W ASME 1994 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/94-gt-297.
Pełny tekst źródła