Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Informacje dla studentów (in Polish) (5)
- DSmT (2)
- Energetyka (2)
- AHP (1)
- Algebras over a monad (1)
-
- Bayes rule (1)
- Belief functions (1)
- Bitopologies (1)
- Coalgebra (1)
- Coalgebras (1)
- Conditioning (1)
- Consultancy (1)
- Cooperation (1)
- DST (1)
- Deconditioning (1)
- Discounting (1)
- Distributive lattices (1)
- Duality theory (1)
- Economy - Gospodarka (1)
- Emisja (1)
- Energy (1)
- Families (1)
- Heyting algebras (1)
- History-dependent Automata (1)
- Importance (1)
- Industry (1)
- Information fusion (1)
- Matrices (1)
- Named Sets (1)
- Neutrosophic Logic (1)
- Publication
- Publication Type
Articles 1 - 14 of 14
Full-Text Articles in Other Mathematics
Energetyka Niskoemisyjna, Wojciech M. Budzianowski
Energetyka Niskoemisyjna, Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache
Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …
Grafika Inżynierska Ćw., Wojciech M. Budzianowski
Grafika Inżynierska Ćw., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Projektowanie Procesów Biotechnologicznych Proj., Wojciech M. Budzianowski
Projektowanie Procesów Biotechnologicznych Proj., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Projektowanie I Optymalizacja Procesów Proj., Wojciech M. Budzianowski
Projektowanie I Optymalizacja Procesów Proj., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Metody Numeryczne Lab., Wojciech M. Budzianowski
Metody Numeryczne Lab., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Odnawialne Źródła Energii W., Wojciech M. Budzianowski
Odnawialne Źródła Energii W., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz
Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz
Engineering Faculty Articles and Research
We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …
On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan
On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan
Engineering Faculty Articles and Research
We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.
Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil
Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil
Engineering Faculty Articles and Research
We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.
Fusion Of Sources Of Evidence With Different Importances And Reliabilities, Florentin Smarandache, Jean Dezert, J.M. Tacnet
Fusion Of Sources Of Evidence With Different Importances And Reliabilities, Florentin Smarandache, Jean Dezert, J.M. Tacnet
Branch Mathematics and Statistics Faculty and Staff Publications
This paper presents a new approach for combining sources of evidences with different importances and reliabilities. Usually, the combination of sources of evidences with different reliabilities is done by the classical Shafer’s discounting approach. Therefore, to consider unequal importances of sources, if any, a similar reliability discounting process is generally used, making no difference between the notion of importance and reliability. In fact, in multicriteria decision context, these notions should be clearly distinguished. This paper shows how this can be done and we provide simple examples to show the differences between both solutions for managing importances and reliabilities of sources. …
Super Special Codes Using Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Super Special Codes Using Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes. This book has four chapters. In chapter one basic properties of codes and super matrices are given. A new type of super special vector space is constructed in chapter two of this book. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced in chapter three. Applications of these …
On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz
On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz
Engineering Faculty Articles and Research
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.
Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari
Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari
Engineering Faculty Articles and Research
Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …