Literatura científica selecionada sobre o tema "Idempotence"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Idempotence".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Idempotence"
Sheng, Yuqiu, e Hanyu Zhang. "Maps Preserving Idempotence on Matrix Spaces". Journal of Mathematics 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/428203.
Texto completo da fonteSurbatovich, Milijana, Naomi Spargo, Limin Jia e Brandon Lucia. "A Type System for Safe Intermittent Computing". Proceedings of the ACM on Programming Languages 7, PLDI (6 de junho de 2023): 736–60. http://dx.doi.org/10.1145/3591250.
Texto completo da fonteLee, Sang-Gu, e Jin-Woo Park. "Sign idempotent sign pattern matrices that allow idempotence". Linear Algebra and its Applications 487 (dezembro de 2015): 232–41. http://dx.doi.org/10.1016/j.laa.2015.09.020.
Texto completo da fonteKuzma, B. "Additive idempotence preservers". Linear Algebra and its Applications 355, n.º 1-3 (novembro de 2002): 103–17. http://dx.doi.org/10.1016/s0024-3795(02)00340-3.
Texto completo da fonteHUMBERSTONE, LLOYD. "AGGREGATION AND IDEMPOTENCE". Review of Symbolic Logic 6, n.º 4 (7 de agosto de 2013): 680–708. http://dx.doi.org/10.1017/s175502031300021x.
Texto completo da fonteRamalingam, Ganesan, e Kapil Vaswani. "Fault tolerance via idempotence". ACM SIGPLAN Notices 48, n.º 1 (23 de janeiro de 2013): 249–62. http://dx.doi.org/10.1145/2480359.2429100.
Texto completo da fonteTeply, Mark L. "On the idempotence and stability of kernel functors". Glasgow Mathematical Journal 37, n.º 1 (janeiro de 1995): 37–43. http://dx.doi.org/10.1017/s0017089500030366.
Texto completo da fonteEschenbach, Carolyn. "Idempotence for sign-pattern matrices". Linear Algebra and its Applications 180 (fevereiro de 1993): 153–65. http://dx.doi.org/10.1016/0024-3795(93)90529-w.
Texto completo da fonteKala, Vítězslav, e Miroslav Korbelář. "Idempotence of finitely generated commutative semifields". Forum Mathematicum 30, n.º 6 (1 de novembro de 2018): 1461–74. http://dx.doi.org/10.1515/forum-2017-0098.
Texto completo da fonteHelland, Pat. "Idempotence is not a medical condition". Communications of the ACM 55, n.º 5 (maio de 2012): 56–65. http://dx.doi.org/10.1145/2160718.2160734.
Texto completo da fonteTeses / dissertações sobre o assunto "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.
Texto completo da fonteMereology 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.
Texto completo da fonteIn 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.
Texto completo da fonteBlomgren, Martin. "Fibrations and Idempotent Functors". Doctoral thesis, KTH, Matematik (Avd.), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-66740.
Texto completo da fonteQC 20120127
Yang, Dandan. "Free idempotent generated semigroups". Thesis, University of York, 2014. http://etheses.whiterose.ac.uk/5948/.
Texto completo da fonteLeupold, Klaus-Peter. "Languages Generated by Iterated Idempotencies". Doctoral thesis, Universitat Rovira i Virgili, 2006. http://hdl.handle.net/10803/8791.
Texto completo da fonteOur 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.
Texto completo da fonteSezinando, Helena Maria da Encarnação. "Formal languages and idempotent semigroups". Thesis, University of St Andrews, 1991. http://hdl.handle.net/10023/13724.
Texto completo da fonteGarcia, 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/.
Texto completo da fonteOur 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.
Texto completo da fonteLivros sobre o assunto "Idempotence"
Jeremy, Gunawardena, e Isaac Newton Institute for Mathematical Sciences., eds. Idempotency. Cambridge, U.K: Cambridge University Press, 1998.
Encontre o texto completo da fonteGunawardena, Jeremy. An introduction to idempotency. Bristol [England]: Hewlett Packard, 1996.
Encontre o texto completo da fonteMaslov, V., e S. Samborskiĭ, eds. Idempotent Analysis. Providence, Rhode Island: American Mathematical Society, 1992. http://dx.doi.org/10.1090/advsov/013.
Texto completo da fonteP, Maslov V., e Samborski S. N, eds. Idempotent analysis. Providence, R.I: American Mathematical Society, 1992.
Encontre o texto completo da fonteLitvinov, G. L., e S. N. Sergeev, eds. Tropical and Idempotent Mathematics. Providence, Rhode Island: American Mathematical Society, 2009. http://dx.doi.org/10.1090/conm/495.
Texto completo da fonteKolokoltsov, Vassili N., e Victor P. Maslov. Idempotent Analysis and Its Applications. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8901-7.
Texto completo da fonteLitvinov, G. L., e V. P. Maslov, eds. Idempotent Mathematics and Mathematical Physics. Providence, Rhode Island: American Mathematical Society, 2005. http://dx.doi.org/10.1090/conm/377.
Texto completo da fonteDudek, Józef. Polynomials in idempotent commutative groupoids. Warszawa: Państwowe Wydawn. Nauk., 1989.
Encontre o texto completo da fonteKolokoltsov, Vassili N. Idempotent Analysis and Its Applications. Dordrecht: Springer Netherlands, 1997.
Encontre o texto completo da fonteKolokolʹt͡sov, V. N. Idempotent analysis and its applications. Boston, Mass: Kluwer Academic Publishers, 1997.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Idempotence"
Hummer, Waldemar, Florian Rosenberg, Fábio Oliveira e Tamar Eilam. "Testing Idempotence for Infrastructure as Code". In Middleware 2013, 368–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45065-5_19.
Texto completo da fonteRohwer, Carl. "LULU-Intervals, Noise and Co-idempotence". In International Series of Numerical Mathematics, 31–41. Basel: Birkhäuser Basel, 2005. http://dx.doi.org/10.1007/3-7643-7382-2_4.
Texto completo da fonteAceto, Luca, Arnar Birgisson, Anna Ingolfsdottir, MohammadReza Mousavi e Michel A. Reniers. "Rule Formats for Determinism and Idempotence". In Fundamentals of Software Engineering, 146–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11623-0_8.
Texto completo da fonteDe Baets, Bernard. "Generalized Idempotence in Fuzzy Mathematical Morphology". In Fuzzy Techniques in Image Processing, 58–75. Heidelberg: Physica-Verlag HD, 2000. http://dx.doi.org/10.1007/978-3-7908-1847-5_2.
Texto completo da fonteFontana, Marco, Evan Houston e Mi Hee Park. "Idempotence and Divisoriality in Prüfer-Like Domains". In Springer Proceedings in Mathematics & Statistics, 169–82. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43416-8_9.
Texto completo da fonteEslick, Ian, André DeHon e Thomas Knight. "Guaranteeing idempotence for tightly-coupled, fault-tolerant networks". In Parallel Computer Routing and Communication, 215–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58429-3_39.
Texto completo da fonteIkeshita, Katsuhiko, Fuyuki Ishikawa e Shinichi Honiden. "Test Suite Reduction in Idempotence Testing of Infrastructure as Code". In Tests and Proofs, 98–115. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61467-0_6.
Texto completo da fontePuig, Lluís. "Lifting Idempotents". In Springer Monographs in Mathematics, 7–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-11256-4_2.
Texto completo da fonteKolokoltsov, Vassili N., e Victor P. Maslov. "Idempotent Analysis". In Idempotent Analysis and Its Applications, 1–44. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8901-7_1.
Texto completo da fonteHarville, David A. "Idempotent Matrices". In 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.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Idempotence"
Ramalingam, Ganesan, e Kapil Vaswani. "Fault tolerance via idempotence". In the 40th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2429069.2429100.
Texto completo da fonteCharif-Chefchaouni, Mohammed A., e Dan Schonfeld. "Generalized morphological center: idempotence". In Visual Communications and Image Processing '94, editado por Aggelos K. Katsaggelos. SPIE, 1994. http://dx.doi.org/10.1117/12.185871.
Texto completo da fonteArya, Sunil, Theocharis Malamatos e David M. Mount. "On the importance of idempotence". In the thirty-eighth annual ACM symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1132516.1132598.
Texto completo da fonteBuzzi, J., e F. Guichard. "Idempotence and automatic linear contrast enhancements". In rnational Conference on Image Processing. IEEE, 2005. http://dx.doi.org/10.1109/icip.2005.1530170.
Texto completo da fonteHurd, Lyman, e Jose G. Rosiles. "Achieving idempotence in near-lossless JPEG-LS". In Electronic Imaging, editado por Bhaskaran Vasudev, T. Russell Hsing, Andrew G. Tescher e Robert L. Stevenson. SPIE, 2000. http://dx.doi.org/10.1117/12.383004.
Texto completo da fontePan, Zhihong, Baopu Li, Dongliang He, Mingde Yao, Wenhao Wu, Tianwei Lin, Xin Li e Errui Ding. "Towards Bidirectional Arbitrary Image Rescaling: Joint Optimization and Cycle Idempotence". In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2022. http://dx.doi.org/10.1109/cvpr52688.2022.01687.
Texto completo da fonteRicci, Roberto Ghiselli. "Asymptotic Idempotency". In 2007 IEEE International Fuzzy Systems Conference. IEEE, 2007. http://dx.doi.org/10.1109/fuzzy.2007.4295598.
Texto completo da fonteKim, Seon Wook, Chong-liang Ooi, Rudolf Eigenmann, Babak Falsafi e T. N. Vijaykumar. "Reference idempotency analysis". In the eighth ACM SIGPLAN symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/379539.379547.
Texto completo da fonteNeergaard, Peter Møller, e Harry G. Mairson. "Types, potency, and idempotency". In the ninth ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1016850.1016871.
Texto completo da fonteFagin, Barry. "Idempotent Factorizations". In ITiCSE '19: Innovation and Technology in Computer Science Education. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3304221.3325557.
Texto completo da fonteRelatórios de organizações sobre o assunto "Idempotence"
McEneaney, William M. Idempotent Methods for Control and Games. Fort Belvoir, VA: Defense Technical Information Center, setembro de 2013. http://dx.doi.org/10.21236/ada590145.
Texto completo da fonteKnight, Tom. Idempotent Vector Design for Standard Assembly of Biobricks. Fort Belvoir, VA: Defense Technical Information Center, janeiro de 2003. http://dx.doi.org/10.21236/ada457791.
Texto completo da fonteFitzpatrick, Ben G. Idempotent Methods for Continuous Time Nonlinear Stochastic Control. Fort Belvoir, VA: Defense Technical Information Center, setembro de 2012. http://dx.doi.org/10.21236/ada580394.
Texto completo da fonteBaader, Franz, Pavlos Marantidis e Alexander Okhotin. Approximately Solving Set Equations. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.227.
Texto completo da fonte