Gotowe bibliografie tematyczne / Universal Functions

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 „Universal Functions”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 1 lutego 2022

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 „Universal Functions”.

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 "Universal Functions"

1

Larson, Paul B., Arnold W. Miller, Juris Steprāns i William A. R. Weiss. "Universal functions". Fundamenta Mathematicae 227, nr 3 (2014): 197–245. http://dx.doi.org/10.4064/fm227-3-1.

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

Bonilla, A. "Universal harmonic functions". Quaestiones Mathematicae 25, nr 4 (grudzień 2002): 527–30. http://dx.doi.org/10.2989/16073600209486036.

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

Aron, Richard, i Dinesh Markose. "ON UNIVERSAL FUNCTIONS". Journal of the Korean Mathematical Society 41, nr 1 (1.01.2004): 65–76. http://dx.doi.org/10.4134/jkms.2004.41.1.065.

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

Chan, Kit C. "Universal meromorphic functions". Complex Variables, Theory and Application: An International Journal 46, nr 4 (listopad 2001): 307–14. http://dx.doi.org/10.1080/17476930108815418.

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

Bogmér, A., i A. Sövergjártó. "On universal functions". Acta Mathematica Hungarica 49, nr 1-2 (marzec 1987): 237–39. http://dx.doi.org/10.1007/bf01956327.

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

Al-Roomi, Ali R., i Mohamed E. El-Hawary. "Universal Functions Originator". Applied Soft Computing 94 (wrzesień 2020): 106417. http://dx.doi.org/10.1016/j.asoc.2020.106417.

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

Gorkin, Pamela, i Raymond Mortini. "Universal Singular Inner Functions". Canadian Mathematical Bulletin 47, nr 1 (1.03.2004): 17–21. http://dx.doi.org/10.4153/cmb-2004-003-0.

Pełny tekst źródła
Streszczenie:
AbstractWe show that there exists a singular inner function S which is universal for noneuclidean translates; that is one for which the set is locally uniformly dense in the set of all zero-free holomorphic functions in bounded by one.
Style APA, Harvard, Vancouver, ISO itp.
8

Khisamiev, A. N. "Universal Functions Over Trees". Algebra and Logic 54, nr 2 (maj 2015): 188–93. http://dx.doi.org/10.1007/s10469-015-9338-5.

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

Polyakov, E. A. "On R-Universal Functions". Mathematical Notes 78, nr 1-2 (lipiec 2005): 234–38. http://dx.doi.org/10.1007/s11006-005-0120-1.

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

Costakis, GG, V. Nestoridis i V. Vlachou. "Smooth univalent universal functions". Mathematical Proceedings of the Royal Irish Academy 107, nr 1 (1.01.2007): 101–14. http://dx.doi.org/10.3318/pria.2007.107.1.101.

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

Rozprawy doktorskie na temat "Universal Functions"

1

Ura, Hiroyuki. "Checking theory and grammatical functions in universal grammar /". New York [u.a.] : Oxford Univ. Press, 2000. http://www.loc.gov/catdir/enhancements/fy0605/99023232-d.html.

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

Beise, Hans-Peter [Verfasser], i Jürgen [Akademischer Betreuer] Müller. "Universal and Frequently Universal Functions of Exponential Type / Hans-Peter Beise ; Betreuer: Jürgen Müller". Trier : Universität Trier, 2011. http://d-nb.info/1197697012/34.

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

Pohl, Daniel [Verfasser], Oliver [Gutachter] Roth i Jürgen [Gutachter] Müller. "Universal Locally Univalent Functions and Universal Conformal Metrics / Daniel Pohl ; Gutachter: Oliver Roth, Jürgen Müller". Würzburg : Universität Würzburg, 2019. http://d-nb.info/1180286685/34.

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

Groft, Chad. "Isoperimetric functions on the universal covers of compact spaces /". May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

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

Abidin, Aysajan. "Weaknesses of Authentication inQuantum Cryptography and Strongly Universal Hash Functions". Licentiate thesis, Linköping University, Linköping University, Department of Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57290.

Pełny tekst źródła
Streszczenie:

Authentication is an indispensable part of Quantum Cryptography, which is an unconditionally secure key distribution technique based on the laws of nature. Without proper authentication, Quantum Cryptography is vulnerable to “man-in-the-middle” attacks. Therefore, to guarantee unconditional security of any Quantum Cryptographic protocols, the authentication used must also be unconditionally secure. The standard in Quantum Cryptography is to use theWegman-Carter authentication, which is unconditionally secure and is based on the idea of universal hashing.

In this thesis, we first investigate properties of a Strongly Universal hash function family to facilitate understanding the properties of (classical) authentication used in Quantum Cryptography. Then, we study vulnerabilities of a recently proposed authentication protocol intended to rule out a "man-in-the-middle" attack on Quantum Cryptography. Here, we point out that the proposed authentication primitive is not secure when used in a generic Quantum Cryptographic protocol. Lastly, we estimate the lifetime of authentication using encrypted tags when the encryption key is partially known. Under simplifying assumptions, we derive that the lifetime is linearly dependent on the length of the authentication key. Experimental results that support the theoretical results are also presented.

Style APA, Harvard, Vancouver, ISO itp.
6

Abidin, Aysajan. "Authentication in Quantum Key Distribution : Security Proof and Universal Hash Functions". Doctoral thesis, Linköpings universitet, Informationskodning, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-91265.

Pełny tekst źródła
Streszczenie:
Quantum Key Distribution (QKD) is a secret key agreement technique that consists of two parts: quantum transmission and measurement on a quantum channel, and classical post-processing on a public communication channel. It enjoys provable unconditional security provided that the public communication channel is immutable. Otherwise, QKD is vulnerable to a man-in-the-middle attack. Immutable public communication channels, however, do not exist in practice. So we need to use authentication that implements the properties of an immutable channel as well as possible. One scheme that serves this purpose well is the Wegman-Carter authentication (WCA), which is built upon Almost Strongly Universal2 (ASU2) hashing. This scheme uses a new key in each authentication attempt to select a hash function from an ASU2 family, which is then used to generate the authentication tag for a message. The main focus of this dissertation is on authentication in the context of QKD. We study ASU2 hash functions, security of QKD that employs a computationally secure authentication, and also security of authentication with a partially known key. Specifically, we study the following. First, Universal hash functions and their constructions are reviewed, and as well as a new construction of ASU2 hash functions is presented. Second, security of QKD that employs a specific computationally secure authentication is studied. We present detailed attacks on various practical implementations of QKD that employs this authentication. We also provide countermeasures and prove necessary and sufficient conditions for upgrading the security of the authentication to the level of unconditional security. Third, Universal hash function based multiple authentication is studied. This uses a fixed ASU2 hash function followed by one-time pad encryption, to keep the hash function secret. We show that the one-time pad is necessary in every round for the authentication to be unconditionally secure. Lastly, we study security of the WCA scheme, in the case of a partially known authentication key. Here we prove tight information-theoretic security bounds and also analyse security using witness indistinguishability as used in the Universal Composability framework.
ICG QC
Style APA, Harvard, Vancouver, ISO itp.
7

Abidin, Aysajan. "Weaknesses of Authentication in Quantum Cryptography and Strongly Universal Hash Functions". Licentiate thesis, Linköpings universitet, Tillämpad matematik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57290.

Pełny tekst źródła
Streszczenie:
Authentication is an indispensable part of Quantum Cryptography, which is an unconditionally secure key distribution technique based on the laws of nature. Without proper authentication, Quantum Cryptography is vulnerable to “man-in-the-middle” attacks. Therefore, to guarantee unconditional security of any Quantum Cryptographic protocols, the authentication used must also be unconditionally secure. The standard in Quantum Cryptography is to use theWegman-Carter authentication, which is unconditionally secure and is based on the idea of universal hashing. In this thesis, we first investigate properties of a Strongly Universal hash function family to facilitate understanding the properties of (classical) authentication used in Quantum Cryptography. Then, we study vulnerabilities of a recently proposed authentication protocol intended to rule out a "man-in-the-middle" attack on Quantum Cryptography. Here, we point out that the proposed authentication primitive is not secure when used in a generic Quantum Cryptographic protocol. Lastly, we estimate the lifetime of authentication using encrypted tags when the encryption key is partially known. Under simplifying assumptions, we derive that the lifetime is linearly dependent on the length of the authentication key. Experimental results that support the theoretical results are also presented.
ICG QC
Style APA, Harvard, Vancouver, ISO itp.
8

Gomes, Victor pereira. "Funções recursivas primitivas: caracterização e alguns resultados para esta classe de funções". Universidade Federal da Paraíba, 2016. http://tede.biblioteca.ufpb.br:8080/handle/tede/8514.

Pełny tekst źródła
Streszczenie:
Submitted by Maike Costa (maiksebas@gmail.com) on 2016-08-10T14:17:41Z No. of bitstreams: 1 arquivo total.pdf: 975005 bytes, checksum: 6f8194b9c0cb9c0bbd07b1d2b0ba4b9e (MD5)
Made available in DSpace on 2016-08-10T14:17:41Z (GMT). No. of bitstreams: 1 arquivo total.pdf: 975005 bytes, checksum: 6f8194b9c0cb9c0bbd07b1d2b0ba4b9e (MD5) Previous issue date: 2016-06-21
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
The class of primitive recursive functions is not a formal version to the class of algorithmic functions, we study this special class of numerical functions due to the fact of that many of the functions known as algorithmic are primitive recursive. The approach on the class of primitive recursive functions aims to explore this special class of functions and from that, present solutions for the following problems: (1) given the class of primitive recursive derivations, is there an algorithm, that is, a mechanical procedure for recognizing primitive recursive derivations? (2) Is there a universal function for the class of primitive recursive functions? If so, is this function primitive recursive? (3) Are all the algorithmic functions primitive recursive? To provide solutions to these issues, we base on the hypothetical-deductive method and argue based on the works of Davis (1982), Mendelson (2009), Dias e Weber (2010), Rogers (1987), Soare (1987), Cooper (2004), among others. We present the theory of Turing machines which is a formal version to the intuitive notion of algorithm, and after that the famous Church-Turing tesis which identifies the class of algorithmic functions with the class of Turing-computable functions. We display the class of primitive recursive functions and show that it is a subclass of Turing-computable functions. Having explored the class of primitive recursive functions we proved as results that there is a recognizer algorithm to the class of primitive recursive derivations; that there is a universal function to the class of primitive recursive functions which does not belong to this class; and that not every algorithmic function is primitive recursive.
A classe das funções recursivas primitivas não constitui uma versão formal para a classe das funções algorítmicas, estudamos esta classe especial de funções numéricas devido ao fato de que muitas das funções conhecidas como algorítmicas são recursivas primitivas. A abordagem acerca da classe das funções recursivas primitivas tem como objetivo explorar esta classe especial de funções e, a partir disto, apresentar soluções para os seguintes problemas: (1) dada a classe das derivações recursivas primitivas, há um algoritmo, ou seja, um procedimento mecânico, para reconhecer derivações recursivas primitivas? (2) Existe uma função universal para a classe das funções recursivas primitivas? Se sim, essa função é recursiva primitiva? (3) Toda função algorítmica é recursiva primitiva? Para apresentar soluções para estas questões, nos pautamos no método hipotético-dedutivo e argumentamos com base nos manuais de Davis (1982), Mendelson (2009), Dias e Weber (2010), Rogers (1987), Soare (1987), Cooper (2004), entre outros. Apresentamos a teoria das máquinas de Turing, que constitui uma versão formal para a noção intuitiva de algoritmo, e, em seguida, a famosa tese de Church-Turing, a qual identifica a classe das funções algorítmicas com a classe das funções Turing-computáveis. Exibimos a classe das funções recursivas primitivas, e mostramos que a mesma constitui uma subclasse das funções Turing-computáveis. Tendo explorado a classe das funções recursivas primitivas, como resultados, provamos que existe um algoritmo reconhecedor para a classe das derivações recursivas primitivas; que existe uma função universal para a classe das funções recursivas primitivas a qual não pertence a esta classe; e que nem toda função algorítmica é recursiva primitiva.
Style APA, Harvard, Vancouver, ISO itp.
9

Ahmed, Istiaque, i s3119889@student rmit edu au. "Canonical and Perturbed Quantum Potential-Well Problems: A Universal Function Approach". RMIT University. Electrical and Computer Engineering, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080108.124715.

Pełny tekst źródła
Streszczenie:
The limits of the current micro-scale electronics technology have been approaching rapidly. At nano-scale, however, the physical phenomena involved are fundamentally different than in micro-scale. Classical and semi-classical physical principles are no longer powerful enough or even valid to describe the phenomena involved. The rich and powerful concepts in quantum mechanics have become indispensable. There are several commercial software packages already available for modeling and simulation of the electrical, magnetic, and mechanical characteristics and properties of the nano-scale devices. However, our objective here is to go one step further and create a physics-based problem-adapted solution methodology. We carry out computation for eigenfunctions of canonical and the associated perturbed quantum systems and utilize them as co-ordinate functions for solving more complex problems. We have profoundly worked with the infinite quantum potential-well problem, since they have closed-form solutions and therefore are analytically known eigenfunctions. Perturbation of the infinite quantum potential-well was done through a single box function, multiple box functions, and with a triangular function. The proposed solution concept utilizes the notion of
Style APA, Harvard, Vancouver, ISO itp.
10

Pinheiro, Leonardo V. "Chaotic Extensions for General Operators on a Hilbert Subspace". Bowling Green State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1399157158.

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

Książki na temat "Universal Functions"

1

Checking theory and grammatical functions in universal grammar. New York: Oxford University Press, 2000.

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

1975-, Teo Lee-Peng, red. Weil-Petersson metric on the universal Teichmüller space. Providence, R.I: American Mathematical Society, 2006.

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

Kalnins, E. G. Models of q-algebra representations. Hamilton, N.Z: University of Waikato, 1992.

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

Kalnins, E. G. Models of q-algebra representations. Hamilton, N.Z: University of Waikato, 1992.

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

Freese, Ralph. Commutator theory for congruence modular varieties. Cambridge: Cambridge University Press, 1987.

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

Foundations and functions of theology as a universal science: Theological method and apologetic praxis in Wolfhart Pannenberg and Karl Rahner. Frankfurt am Main: P. Lang, 1996.

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

Xu, Ding. Functional categories in Mandarin Chinese. The Hague: Holland Academic Graphics, 1997.

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

Function, selection, and innateness: The emergence of language universals. Oxford: Oxford University Press, 1999.

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

Vasanthi, T. Optimum Reliability Analysis of Mobile Adhoc Networks using Universal Generating Function under Limited Delivery Time and Cost. Redaktorzy Kokula Krishna Hari K i K. Saravanan. Tiruppur, Tamil Nadu, India: Association of Scientists, Developers and Faculties, 2016.

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

Herms, Ronald. An apocalypse for the church and for the world: The narrative function of universal language in the book of Revelation. Berlin: Walter de Gruyter, 2006.

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

Części książek na temat "Universal Functions"

1

Rudeanu, Sergiu. "Universal algebra". W Lattice Functions and Equations, 13–30. London: Springer London, 2001. http://dx.doi.org/10.1007/978-1-4471-0241-0_2.

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

Shen, A., i N. Vereshchagin. "Universal functions and undecidability". W The Student Mathematical Library, 11–18. Providence, Rhode Island: American Mathematical Society, 2002. http://dx.doi.org/10.1090/stml/019/02.

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

Abidin, Aysajan, i Jan-Åke Larsson. "New Universal Hash Functions". W Research in Cryptology, 99–108. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34159-5_7.

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

Korogodski, Leonid, i Yan Soibelman. "Quantized universal enveloping algebras". W Algebras of Functions on Quantum Groups: Part I, 57–94. Providence, Rhode Island: American Mathematical Society, 1998. http://dx.doi.org/10.1090/surv/056/03.

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

Nevelsteen, Wim, i Bart Preneel. "Software Performance of Universal Hash Functions". W Advances in Cryptology — EUROCRYPT ’99, 24–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48910-x_3.

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

Mesiar, Radko, i Andrea Stupňanová. "Capacities, Survival Functions and Universal Integrals". W Advances in Intelligent Systems and Computing, 1–8. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59306-7_1.

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

Duval, Sébastien, i Gaëtan Leurent. "Lightweight MACs from Universal Hash Functions". W Smart Card Research and Advanced Applications, 195–215. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-42068-0_12.

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

Preneel, Bart. "Universal One-Way Hash Functions (UOWHF)". W Encyclopedia of Cryptography and Security, 1349–50. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_624.

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

Goldman, Leon. "Individual and Universal Eschatology in Zoroastrianism". W Eschatology in Antiquity: Forms and Functions, 34–48. London: Routledge, 2021. http://dx.doi.org/10.4324/9781315459486-2.

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

Schlage-Puchta, Jan-Christoph. "The Non-existence of Universal Carmichael Numbers". W From Arithmetic to Zeta-Functions, 435–53. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-28203-9_26.

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

Streszczenia konferencji na temat "Universal Functions"

1

Mussardo, Giuseppe, i G. Delfino. "Universal ratios and correlation functions". W Workshop on Integrable Theories, Solitons and Duality. Trieste, Italy: Sissa Medialab, 2002. http://dx.doi.org/10.22323/1.008.0007.

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

Robinson, Michael. "Universal factorizations of quasiperiodic functions". W 2015 International Conference on Sampling Theory and Applications (SampTA). IEEE, 2015. http://dx.doi.org/10.1109/sampta.2015.7148959.

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

Al-Roomi, Ali R., i Mohamed E. El-Hawary. "Universal Functions Originator—Part I: Design". W 2019 IEEE Canadian Conference of Electrical and Computer Engineering (CCECE). IEEE, 2019. http://dx.doi.org/10.1109/ccece.2019.8861880.

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

Al-Roomi, Ali R., i Mohamed E. El-Hawary. "Universal Functions Originator—Part II: Evaluation". W 2019 IEEE Canadian Conference of Electrical and Computer Engineering (CCECE). IEEE, 2019. http://dx.doi.org/10.1109/ccece.2019.8861890.

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

Thakur, Shashidhar, i D. F. Wong. "Universal logic modules for series-parallel functions". W the 1996 ACM fourth international symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/228370.228375.

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

Hovanov, N. V., V. V. Kornikov i I. A. Seregin. "Universal representation of fuzzy sets' membership functions". W Proceedings of 8th International Fuzzy Systems Conference. IEEE, 1999. http://dx.doi.org/10.1109/fuzzy.1999.793229.

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

Neydorf, Rudolf, Dean Vucinic i Ivan Chernogorov. "Universal generator of irregular multidimensional multiextremal functions". W 2017 IEEE East-West Design & Test Symposium (EWDTS). IEEE, 2017. http://dx.doi.org/10.1109/ewdts.2017.8110046.

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

Safdari, Mustafa. "Evolving universal hash functions using genetic algorithms". W the 11th annual conference companion. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1570256.1570396.

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

Colbert, Brendon K., i Matthew M. Peet. "Using SDP to Parameterize Universal Kernel Functions". W 2019 IEEE 58th Conference on Decision and Control (CDC). IEEE, 2019. http://dx.doi.org/10.1109/cdc40024.2019.9030084.

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

Ruslan, Vikhorev. "Universal logic cells to implement systems functions". W 2016 IEEE NW Russia Young Researchers in Electrical and Electronic Engineering Conference (EIConRusNW). IEEE, 2016. http://dx.doi.org/10.1109/eiconrusnw.2016.7448197.

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

Raporty organizacyjne na temat "Universal Functions"

1

Carlson, Joseph, Richard Furnstahl, Mihai Horoi, Rusty Lusk, Witold Nazarewicz, Esmond Ng, Ian Thompson i James Vary. Universal Nuclear Energy Density Functional. Office of Scientific and Technical Information (OSTI), grudzień 2012. http://dx.doi.org/10.2172/1157042.

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

Zinenko, Olena. THE SPECIFICITY OF INTERACTION OF JOURNALISTS WITH THE PUBLIC IN COVERAGE OF PUBLIC EVENTS ON SOCIAL TOPICS. Ivan Franko National University of Lviv, luty 2021. http://dx.doi.org/10.30970/vjo.2021.49.11056.

Pełny tekst źródła
Streszczenie:
Consideration of aspects of the functioning of mass media in society requires a comprehensive approach based on universal media theory. The article presents an attempt to consider public events in terms of a functional approach to understanding the media, proposed by media theorist Dennis McQuayl in the theory of mass communication. Public events are analyzed, on the one hand, as a complex object of journalistic reflection and, on the other hand, as a situational media that examines the relationship of agents of the social and media fields in the space of communication interaction. Taking into account philosophical approaches to the interpretation of the concept of event, considering its semantic spectrum, specificity of use and synonyms in the Ukrainian language, a working definition of the concept of public event is given. Based on case-analysis of public events, In accordance with the functions of the media the functions of public events are outlined. This is is promising for the development of study on typology of public events in the context of mass communication theory. The realization of the functions of public events as situational media is illustrated with such vivid examples of cultural events as «Gogolfest» and «Book Forum in Lviv». The author shows that a functional approach to understanding public events in society and their place in the space of mass communication, opens prospects for studying the role of media in reflecting the phenomena of social reality, clarifying the presence and quality of communication between media producers and media consumers.
Style APA, Harvard, Vancouver, ISO itp.
3

Lin, Daw-Tung, i Judith E. Dayhoff. Network Unfolding Algorithm and Universal Spatiotemporal Function Approximation. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1994. http://dx.doi.org/10.21236/ada453011.

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

de Leeuw, Gerrit. Toward a Universal Sea Spray Source Function (UNISOURCE). Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2003. http://dx.doi.org/10.21236/ada630210.

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

Carlson, Joe A., Dick Furnstahl, Mihai Horoi, Rusty Lust, Witek Nazaewicc, Esmond Ng, Ian Thompson i James Vary. Building a Universal Nuclear Energy Density Functional. Office of Scientific and Technical Information (OSTI), grudzień 2012. http://dx.doi.org/10.2172/1163477.

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

Bertulani, Carlos A. Building a Universal Nuclear Energy Density Functional. Office of Scientific and Technical Information (OSTI), wrzesień 2014. http://dx.doi.org/10.2172/1155011.

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

Nazarewicz, Witold. Building a universal nuclear energy density functional (UNEDF). Office of Scientific and Technical Information (OSTI), lipiec 2012. http://dx.doi.org/10.2172/1116134.

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

Joe Carlson, Dick Furnstahl, Mihai Horoi, Rusty Lusk, Witek Nazarewicz, Esmond Ng, Ian Thompson i James Vary. Building A Universal Nuclear Energy Density Functional (UNEDF). Office of Scientific and Technical Information (OSTI), wrzesień 2012. http://dx.doi.org/10.2172/1060545.

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

Vary, James P., Joe Carlson, Dick Furnstahl, Mihai Horoi, Rusty Lusk, Witek Nazarewicz, Esmond Ng i Ian Thompson. Building a Universal Nuclear Energy Density Functional (UNEDF). SciDAC-2 Project. Office of Scientific and Technical Information (OSTI), wrzesień 2012. http://dx.doi.org/10.2172/1168663.

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

Carlson, Joe, Dick Furnstahl, Rusty Lusk, Witek Nazarewicz, Esmond Ng, Ian Thompson i James Vary. Building a Universal Nuclear Energy Density Functional (UNEDF): SciDAC-2 Project. Office of Scientific and Technical Information (OSTI), czerwiec 2012. http://dx.doi.org/10.2172/1150654.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Universal Functions” 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