Gotowa bibliografia na temat „Idempotence”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Idempotence”.
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 "Idempotence"
Sheng, Yuqiu, i Hanyu Zhang. "Maps Preserving Idempotence on Matrix Spaces". Journal of Mathematics 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/428203.
Pełny tekst źródłaSurbatovich, Milijana, Naomi Spargo, Limin Jia i Brandon Lucia. "A Type System for Safe Intermittent Computing". Proceedings of the ACM on Programming Languages 7, PLDI (6.06.2023): 736–60. http://dx.doi.org/10.1145/3591250.
Pełny tekst źródłaLee, Sang-Gu, i Jin-Woo Park. "Sign idempotent sign pattern matrices that allow idempotence". Linear Algebra and its Applications 487 (grudzień 2015): 232–41. http://dx.doi.org/10.1016/j.laa.2015.09.020.
Pełny tekst źródłaKuzma, B. "Additive idempotence preservers". Linear Algebra and its Applications 355, nr 1-3 (listopad 2002): 103–17. http://dx.doi.org/10.1016/s0024-3795(02)00340-3.
Pełny tekst źródłaHUMBERSTONE, LLOYD. "AGGREGATION AND IDEMPOTENCE". Review of Symbolic Logic 6, nr 4 (7.08.2013): 680–708. http://dx.doi.org/10.1017/s175502031300021x.
Pełny tekst źródłaRamalingam, Ganesan, i Kapil Vaswani. "Fault tolerance via idempotence". ACM SIGPLAN Notices 48, nr 1 (23.01.2013): 249–62. http://dx.doi.org/10.1145/2480359.2429100.
Pełny tekst źródłaTeply, Mark L. "On the idempotence and stability of kernel functors". Glasgow Mathematical Journal 37, nr 1 (styczeń 1995): 37–43. http://dx.doi.org/10.1017/s0017089500030366.
Pełny tekst źródłaEschenbach, Carolyn. "Idempotence for sign-pattern matrices". Linear Algebra and its Applications 180 (luty 1993): 153–65. http://dx.doi.org/10.1016/0024-3795(93)90529-w.
Pełny tekst źródłaKala, Vítězslav, i Miroslav Korbelář. "Idempotence of finitely generated commutative semifields". Forum Mathematicum 30, nr 6 (1.11.2018): 1461–74. http://dx.doi.org/10.1515/forum-2017-0098.
Pełny tekst źródłaHelland, Pat. "Idempotence is not a medical condition". Communications of the ACM 55, nr 5 (maj 2012): 56–65. http://dx.doi.org/10.1145/2160718.2160734.
Pełny tekst źródłaRozprawy doktorskie na temat "Idempotence"
Tarbouriech, Cédric. "Avoir une partie 2 × 2 = 4 fois : vers une méréologie des slots". Electronic Thesis or Diss., Toulouse 3, 2023. http://www.theses.fr/2023TOU30316.
Pełny tekst źródłaMereology is the discipline concerned with the relationships between a part and its whole and between parts within a whole. According to the most commonly used theory, "classical extensional mereology", an entity can only be part of another one once. For example, your heart is part once of your body. Some earlier works have challenged this principle. Indeed, it is impossible to describe the mereological structure of certain entities, such as structural universals or word types, within the framework of classical extensional mereology. These entities may have the same part several times over. For example, the universal of water molecule (H2O) has as part the universal of hydrogen atom (H) twice, while a particular water molecule has two distinct hydrogen atoms as parts. In this work, we follow the track opened by Karen Bennett in 2013. Bennett sketched out a new mereology to represent the mereological structure of these entities. In her theory, to be a part of an entity is to fill a "slot" of that entity. Thus, in the word "potato", the letter "o" is part of the word twice because it occupies two "slots" of that word: the second and the sixth. Bennett's proposal is innovative in offering a general framework that is not restricted to one entity type. However, the theory has several problems. Firstly, it is limited: many notions of classical mereology have no equivalent, such as mereological sum or extensionality. Secondly, the theory's axiomatics give rise to counting problems. For example, the electron universal is only part of the methane universal seven times instead of the expected ten times. We have proposed a solution based on the principle that slots must be duplicated as often as necessary to obtain a correct count. This duplication is achieved through a mechanism called "contextualisation", which allows slots to be copied by adding context. In this way, we have established a theory for representing entities that may have the same part multiple times while avoiding counting problems. We have developed a mereology of slots based on this theory, which is a theory representing mereological relationships between slots. In this way, we have developed the various notions present in classical mereology, such as supplementation, extensionality, mereological sum and fusion. This proposal provides a very expressive and logically sound mereology that will enable future work to explore complex issues raised in the scientific literature. Indeed, some entities cannot be differentiated by their mereological structures alone but require the representation of additional relationships between their parts. Our mereological theory offers tools and avenues to explore such questions
Vial, Pierre. "Opérateurs de typage non-idempotents, au delà du lambda-calcul". Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCC038/document.
Pełny tekst źródłaIn this dissertation, we extend the methods of non-idempotent intersection type theory, pioneered by Gardner and de Carvalho, to some calculi beyond the lambda-calculus.- We first present a characterization of head and strong normalization in the lambda-mu calculus (classical natural deduction) by introducing non-idempotent union types. As in the intuitionistic case, non-idempotency allows us to extract quantitative information from the typing derivations and we obtain proofs of termination that are far more elementary than those in the idempotent case. These results leads us to define a small-step variant of the lambda-mu calculus, in which strong normalization is also characterized by means of quantitative methods.- In the second part of the dissertation, we extend the characterization of weak normalization in the pure lambda-calculus to an infinitary lambda-calculus narrowly related to Böhm trees, which was introduced by Klop et al. This gives a positive answer to a question known as Klop's problem. In that purpose, it is necessary to simultaneously introduce a system (system S) featuring infinite types and resorting to an intersection operator that we call sequential, and a validity criterion in order to discard unsound proofs that coinductive grammars give rise to. This also allows us to give a solution to TLCA problem #20 (type-theoretic characterization of hereditary permutations). It is to be noted that those two problem do not have a solution in the finite case (Tatsuta, 2007).- Finally, we study the expressive power of coinductive type grammars, without any validity criterion. We must once more resort to system S and we show that every term is typable in a non-trivial way with infinite types and that one can extract semantical information from those typings e.g. the order (arity) of any lambda-term. This leads us to introduce a method that allows typing totally unproductive terms (the so-called mute terms), which is inspired from first order logic. This result establishes that, in the coinductive extension of the relational model, every term has a non-empty interpretation. Using a similar method, we also prove that system S surjectively collapses on the set of points of this model
Marais, Magdaleen Suzanne. "Idempotente voortbringers van matriksalgebras". Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/677.
Pełny tekst źródłaBlomgren, Martin. "Fibrations and Idempotent Functors". Doctoral thesis, KTH, Matematik (Avd.), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-66740.
Pełny tekst źródłaQC 20120127
Yang, Dandan. "Free idempotent generated semigroups". Thesis, University of York, 2014. http://etheses.whiterose.ac.uk/5948/.
Pełny tekst źródłaLeupold, Klaus-Peter. "Languages Generated by Iterated Idempotencies". Doctoral thesis, Universitat Rovira i Virgili, 2006. http://hdl.handle.net/10803/8791.
Pełny tekst źródłaOur investigations about idempotency relations and languages start out from the case of a uniform length bound. For these relations =kW~ the conditions for confluence are characterized completely. Also the question of regularity is -k n answered for aH the languages w- D
For a generallength bound, i.e."for the relations :"::kW~, confluence does not hold so frequently. This complicatedness of the relations results also in more complicated languages, which are often non-regular, as for example the languages W<;kD
The concept of root in Formal Language ·Theory is frequently used to describe the reduction of a word to another one, which is in sorne sense elementary.
For example, there are primitive roots, periodicity roots, etc. Elementary in connection with duplication are square-free words, Le., words that do not contain any repetition. Thus we define the duplication root of w to consist of aH the square-free words, from which w can be reached via the relation w~.
Besides sorne general observations we prove the decidability of the question, whether the duplication root of a language is finite.
Then we devise acode, which is robust under duplication of its code words.
This would keep the result of a computation from being destroyed by dupli cations in the code words. We determine the exact conditions, under which infinite such codes exist: over an alphabet of two letters they exist for a length bound of 2, over three letters already for a length bound of 1.
Also we apply duplication to entire languages rather than to single words; then it is interesting to determine, whether regular and context-free languages are closed under this operation. We show that the regular languages are closed under uniformly bounded duplication, while they are not closed under duplication with a generallength bound. The context-free languages are closed under both operations.
The thesis concludes with a list of open problems related with the thesis' topics.
Lelièvre, Hubert. "Espaces bmo et multiplicateurs idempotents". Paris 6, 1995. http://www.theses.fr/1995PA066372.
Pełny tekst źródłaSezinando, Helena Maria da Encarnação. "Formal languages and idempotent semigroups". Thesis, University of St Andrews, 1991. http://hdl.handle.net/10023/13724.
Pełny tekst źródłaGarcia, Vitor Araujo. "Idempotentes centrais primitivos em algumas álgebras de grupos". Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-05102015-225032/.
Pełny tekst źródłaOur goal in this project is to present some results about group rings and its applications, as presented in books and articles about this subject. First of all we are going to establish some basic fact about group rings, which can be found mainly in [5], and then we will present the main results, which are more recent, and have been studied in two different articles. In [4], the authors presented a way of evaluating the number of simple components of some finite group algebras, as well presented a way of evaluating idempotent generators of some minimal abelian codes, their dimension and their weights. In [2] there is a complete description of all the primitive central idempotents of the rational group algebra of finite nilpotent groups.
Krautzberger, Peter [Verfasser]. "Idempotent filters and ultrafilters / Peter Krautzberger". Berlin : Freie Universität Berlin, 2009. http://d-nb.info/1023817063/34.
Pełny tekst źródłaKsiążki na temat "Idempotence"
Jeremy, Gunawardena, i Isaac Newton Institute for Mathematical Sciences., red. Idempotency. Cambridge, U.K: Cambridge University Press, 1998.
Znajdź pełny tekst źródłaGunawardena, Jeremy. An introduction to idempotency. Bristol [England]: Hewlett Packard, 1996.
Znajdź pełny tekst źródłaMaslov, V., i S. Samborskiĭ, red. Idempotent Analysis. Providence, Rhode Island: American Mathematical Society, 1992. http://dx.doi.org/10.1090/advsov/013.
Pełny tekst źródłaP, Maslov V., i Samborski S. N, red. Idempotent analysis. Providence, R.I: American Mathematical Society, 1992.
Znajdź pełny tekst źródłaLitvinov, G. L., i S. N. Sergeev, red. Tropical and Idempotent Mathematics. Providence, Rhode Island: American Mathematical Society, 2009. http://dx.doi.org/10.1090/conm/495.
Pełny tekst źródłaKolokoltsov, Vassili N., i Victor P. Maslov. Idempotent Analysis and Its Applications. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8901-7.
Pełny tekst źródłaLitvinov, G. L., i V. P. Maslov, red. Idempotent Mathematics and Mathematical Physics. Providence, Rhode Island: American Mathematical Society, 2005. http://dx.doi.org/10.1090/conm/377.
Pełny tekst źródłaDudek, Józef. Polynomials in idempotent commutative groupoids. Warszawa: Państwowe Wydawn. Nauk., 1989.
Znajdź pełny tekst źródłaKolokoltsov, Vassili N. Idempotent Analysis and Its Applications. Dordrecht: Springer Netherlands, 1997.
Znajdź pełny tekst źródłaKolokolʹt͡sov, V. N. Idempotent analysis and its applications. Boston, Mass: Kluwer Academic Publishers, 1997.
Znajdź pełny tekst źródłaCzęści książek na temat "Idempotence"
Hummer, Waldemar, Florian Rosenberg, Fábio Oliveira i Tamar Eilam. "Testing Idempotence for Infrastructure as Code". W Middleware 2013, 368–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45065-5_19.
Pełny tekst źródłaRohwer, Carl. "LULU-Intervals, Noise and Co-idempotence". W International Series of Numerical Mathematics, 31–41. Basel: Birkhäuser Basel, 2005. http://dx.doi.org/10.1007/3-7643-7382-2_4.
Pełny tekst źródłaAceto, Luca, Arnar Birgisson, Anna Ingolfsdottir, MohammadReza Mousavi i Michel A. Reniers. "Rule Formats for Determinism and Idempotence". W Fundamentals of Software Engineering, 146–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11623-0_8.
Pełny tekst źródłaDe Baets, Bernard. "Generalized Idempotence in Fuzzy Mathematical Morphology". W Fuzzy Techniques in Image Processing, 58–75. Heidelberg: Physica-Verlag HD, 2000. http://dx.doi.org/10.1007/978-3-7908-1847-5_2.
Pełny tekst źródłaFontana, Marco, Evan Houston i Mi Hee Park. "Idempotence and Divisoriality in Prüfer-Like Domains". W Springer Proceedings in Mathematics & Statistics, 169–82. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43416-8_9.
Pełny tekst źródłaEslick, Ian, André DeHon i Thomas Knight. "Guaranteeing idempotence for tightly-coupled, fault-tolerant networks". W Parallel Computer Routing and Communication, 215–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58429-3_39.
Pełny tekst źródłaIkeshita, Katsuhiko, Fuyuki Ishikawa i Shinichi Honiden. "Test Suite Reduction in Idempotence Testing of Infrastructure as Code". W Tests and Proofs, 98–115. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61467-0_6.
Pełny tekst źródłaPuig, Lluís. "Lifting Idempotents". W Springer Monographs in Mathematics, 7–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-11256-4_2.
Pełny tekst źródłaKolokoltsov, Vassili N., i Victor P. Maslov. "Idempotent Analysis". W Idempotent Analysis and Its Applications, 1–44. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8901-7_1.
Pełny tekst źródłaHarville, David A. "Idempotent Matrices". W Matrix Algebra From a Statistician’s Perspective, 133–38. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/0-387-22677-x_10.
Pełny tekst źródłaStreszczenia konferencji na temat "Idempotence"
Ramalingam, Ganesan, i Kapil Vaswani. "Fault tolerance via idempotence". W the 40th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2429069.2429100.
Pełny tekst źródłaCharif-Chefchaouni, Mohammed A., i Dan Schonfeld. "Generalized morphological center: idempotence". W Visual Communications and Image Processing '94, redaktor Aggelos K. Katsaggelos. SPIE, 1994. http://dx.doi.org/10.1117/12.185871.
Pełny tekst źródłaArya, Sunil, Theocharis Malamatos i David M. Mount. "On the importance of idempotence". W the thirty-eighth annual ACM symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1132516.1132598.
Pełny tekst źródłaBuzzi, J., i F. Guichard. "Idempotence and automatic linear contrast enhancements". W rnational Conference on Image Processing. IEEE, 2005. http://dx.doi.org/10.1109/icip.2005.1530170.
Pełny tekst źródłaHurd, Lyman, i Jose G. Rosiles. "Achieving idempotence in near-lossless JPEG-LS". W Electronic Imaging, redaktorzy Bhaskaran Vasudev, T. Russell Hsing, Andrew G. Tescher i Robert L. Stevenson. SPIE, 2000. http://dx.doi.org/10.1117/12.383004.
Pełny tekst źródłaPan, Zhihong, Baopu Li, Dongliang He, Mingde Yao, Wenhao Wu, Tianwei Lin, Xin Li i Errui Ding. "Towards Bidirectional Arbitrary Image Rescaling: Joint Optimization and Cycle Idempotence". W 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2022. http://dx.doi.org/10.1109/cvpr52688.2022.01687.
Pełny tekst źródłaRicci, Roberto Ghiselli. "Asymptotic Idempotency". W 2007 IEEE International Fuzzy Systems Conference. IEEE, 2007. http://dx.doi.org/10.1109/fuzzy.2007.4295598.
Pełny tekst źródłaKim, Seon Wook, Chong-liang Ooi, Rudolf Eigenmann, Babak Falsafi i T. N. Vijaykumar. "Reference idempotency analysis". W the eighth ACM SIGPLAN symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/379539.379547.
Pełny tekst źródłaNeergaard, Peter Møller, i Harry G. Mairson. "Types, potency, and idempotency". W the ninth ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1016850.1016871.
Pełny tekst źródłaFagin, Barry. "Idempotent Factorizations". W ITiCSE '19: Innovation and Technology in Computer Science Education. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3304221.3325557.
Pełny tekst źródłaRaporty organizacyjne na temat "Idempotence"
McEneaney, William M. Idempotent Methods for Control and Games. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2013. http://dx.doi.org/10.21236/ada590145.
Pełny tekst źródłaKnight, Tom. Idempotent Vector Design for Standard Assembly of Biobricks. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2003. http://dx.doi.org/10.21236/ada457791.
Pełny tekst źródłaFitzpatrick, Ben G. Idempotent Methods for Continuous Time Nonlinear Stochastic Control. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2012. http://dx.doi.org/10.21236/ada580394.
Pełny tekst źródłaBaader, Franz, Pavlos Marantidis i Alexander Okhotin. Approximately Solving Set Equations. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.227.
Pełny tekst źródła