Disclaimer: These images were generated using artificial intelligence and may contain inaccuracies or inconsistencies.
They are provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in these article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Special issue papers
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Barna
Iantovics
Abstract:
This Special Issue contains selected papers presented at the International Symposium on Understanding Intelligent and Complex Systems - UICS 2009, held on 22-23 October 2009 at Petru Maior University of Targu Mures, Romania.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Ion
C. Băianu
, George
Georgescu
, James
F. Glazebrook
, Ronald
Brown
Abstract:
The fundamentals of Lukasiewicz-Moisil logic algebras and their applications to complex genetic network dynamics and highly complex systems are presented in the context of a categorical ontology theory of levels, Medical Bioinformatics and self-organizing, highly complex systems. Quantum Automata were defined in refs.[2] and [3] as generalized, probabilistic automata with quantum state spaces [1]. Their next-state functions operate through transitions between quantum states defined by the quantum equations of motions in the SchrÄodinger representation, with both initial and boundary conditions in space-time. A new theorem is proven which states that the category of quantum automata and automata-homomorphisms has both limits and colimits. Therefore, both categories of quantum automata and classical automata (sequential machines) are bicomplete. A second new theorem establishes that the standard automata category is a subcategory of the quantum automata category. The quantum automata category has a faithful representation in the category of Generalized (M,R)-Systems which are open, dynamic biosystem networks [4] with de¯ned biological relations that represent physiological functions of primordial(s), single cells and the simpler organisms. A new category of quantum computers is also defined in terms of reversible quantum automata with quantum state spaces represented by topological groupoids that admit a local characterization through unique, quantum Lie algebroids. On the other hand, the category of n-Lukasiewicz algebras has a subcategory of centered n-Lukasiewicz algebras (as proven in ref. [2]) which can be employed to design and construct subcategories of quantum automata based on n-Lukasiewicz diagrams of existing VLSI. Furthermore, as shown in ref. [2] the category of centered n-Lukasiewicz algebras and the category of Boolean algebras are naturally equivalent. A `no-go' conjecture is also proposed which states that Generalized (M,R)-Systems complexity prevents their complete computability (as shown in refs. [5]-[6]) by either standard, or quantum, automata.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Istvan
Gergely Czibula
, Gabriela
Czibula
Abstract:
Object-oriented concepts are useful concerning the reuse of existing software. Therefore a transformation of procedural programs to objectoriented architectures becomes an important process to enhance the reuse of procedural programs. Moreover, it would be useful to assist by automatic methods the software developers in transforming procedural code into an equivalent
object-oriented one. In this paper we aim at introducing a hierarchical clustering algorithm that can be used for assisting software developers in the process of transforming procedural code into an object-oriented architecture.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Cyrille
Bertelle
, Antoine
Dutot
, Rawan
Ghnemat
Abstract:
Self-organization is common in natural systems. This tutorial
describes some of these systems, speci¯cally from insect societies like in bees, termites or ant colonies. In a first part, a modeling process is explained. Objects and phenomena targeted by these methods are presented. Natural
or social complex systems are the context of these objects and phenomena. Basic algorithms presented for example in [8] are given. These algorithms belongs to the class of swarm intelligence methods describing how a network of interacting entities can lead to emergent properties of the whole system. In a second part, more original applications are presented, based on extensions of these basic algorithms in order to model ecosystems, urban dynamics or to propose a decentralized method to distribute simulations over dynamical
communication graphs.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
David
Hobby
, Barna
Iantovics
, Florin
Felix Nichita
Abstract:
The quantum Yang-Baxter equation ¯rst appeared in theoretical physics and statistical mechanics. Afterwards, it has proved to be
important also in knot theory, quantum groups, etc. This paper deals with the (colored) Yang-Baxter equation and computational methods. A new result about the set-theoretical Yang-Baxter equation is presented.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Tamas
Szantai
, Edith
Kovacs
Abstract:
Pattern recognition aims to classify data (patterns) based ei-
ther on a priori knowledge or on statistical information extracted from the data. In this paper we will concentrate on statistical pattern recognition using a new probabilistic approach which makes possible to select the so called 'informative' features. We develop a pattern recognition algorithm which is based on the conditional independence structure underlying the statistical data. Our method was succesfully applied on a real problem of recognizing Parkinson's disease on the basis of voice disorders.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Mirela
Mitu
, Teodora
Balaci
, Eleonora
Mircia
, Andreea
Stănescu
, Anca
Nicoară
, Ancuța
Fița
Abstract:
Photoprotective products are considered borderline between
cosmetics and pharmaceuticals due to physiological implications they have on skin health considering the environmental changes (radiations, global warming, and the diminished ozone layer) and due to the high demands regarding the balance between the e±cacy and the safety of the consumer. The studies we have carried out in this paper consist in the following: selection of the excipients and active ingredients (organic and inorganic filter and/or screen substances, natural products, antioxidants) and the use of a proper technological process for obtaining a dermo-cosmetic product having a good physical and chemical stability, as well as suitable organoleptic and rheological properties in order to ensure the innocuity and pleasant administrating features.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Mihai
Talmaciu
, Elena
Nechita
Abstract:
During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Constantin-Bălă
Zamfirescu
, Luminița
Duță
, Barna
Iantovics
Abstract:
The paper investigates for some basic contextual factors (such
us the problem complexity, the users' creativity and the problem space complexity) the cognitive complexity associated with modelling the group decision processes (GDP) in e-meetings. The analysis is done by conducting a socio-simulation experiment for an envisioned collaborative software tool that acts as a stigmergic environment for modelling the GDP. The simulation results revels some interesting design guidelines for engineering some contextual functionalities that minimize the cognitive complexity associated with modelling the GDP.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Mirela
Mitu
, Ancuța
Fița
, Teodora
Balaci
, Andreea
Stănescu
, Emma
Crețu
Abstract:
The experimental study objective was the development of
chewable tablets with the calcium complex association, the minerals and vitamin D3 for children, subject to the rules as stipulated by the Romanian Pharmacopoeia Xth edition. Generating sources of calcium, used as raw materials in the preparation of these tablets are natural products represented by complex mineral rich in calcium - Lactoval (R) HiCal (ratio of calcium and phosphorus is 2,2:1, report the same as breast milk) and 30% bovine colostrums [1, 3], making the absorption of calcium should be increased. Also, in order to
fix and better absorb calcium in the body was added to make the preparation of these chewable tablets and vitamin D3.
Was chosen as a method of preparing direct compression. Excipients for direct compression are diluents-binder-disaggregated. They are unitary excipients or co-processed products, multi-processed excipients together to meet those properties: microcrystalline cellulose (Vivapur 102) Ludipress, lactose (Tablettose 80), Kollidon CL Isomalt DC 100. Was also added to a lubricant (magnesium stearate) and sweetener and flavoring to carry out the preparation of tablets and after 30 days as provided Romanian Pharmacopoeia Xth and its 2001 supplement, which comprises: organoleptic control, uniformity of weight, strength, disintegration and their friability. Working method chosen and make the appropriate choice leads to tablets in terms of quality standards officinal.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Maria
Muntean
, Ioan
Ileană
, Corina
Rotar
, Mircea
Rîșteiu
Abstract:
This paper presents three data mining techniques applied
on a SCADA system data repository: Naijve Bayes, k-Nearest Neighbor and Decision Trees. A conclusion that k-Nearest Neighbor is a suitable method to classify the large amount of data considered is made finally according to the mining result and its reasonable explanation. The experiments are built on the training data set and evaluated using the new test set with machine learning tool WEKA.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Laszlo
Kovacs
Abstract:
The proposed transformation module performs mapping be-
tween two di®erent knowledge representation forms used in grammar induction systems. The kernel knowledge representation form is a special predicate centered conceptual graph called ECG. The ECG provides a semantic-based, language independent description of the environment. The other base representation form is some kind of language. The sentences of the language should meet the corresponding grammatical rules. The pilot project demonstrates the functionality of a translator module using this transformation engine between the ECG graph and the Hungarian language.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Joel
Ratsaby
Abstract:
What is the relationship between the complexity of a learner
and the randomness of his mistakes? This question was posed in [4] who showed that the more complex the learner the higher the possibility that his mistakes deviate from a true random sequence. In the current paper we report on an empirical investigation of this problem. We investigate two characteristics of randomness, the stochastic and algorithmic complexity of the binary sequence of mistakes. A learner with a Markov model of order k is trained on a finite binary sequence produced by a Markov source of order k* and is tested on a different random sequence. As a measure of learner’s complexity we define a quantity called the sysRatio, denoted by ρ, which is the ratio between the compressed and uncompressed lengths of the binary string whose ith bit represents the maximum a posteriori decision made at state i of the learner’s model. The quantity ρ is a measure of information density. The main result of the paper shows that this ratio is crucial in answering the above posed question. The result indicates that there is a critical threshold ρ* such that when ρ <=ρ* the sequence of mistakes possesses the following features: (1) low divergence Δ from a random sequence, (2) low variance in algorithmic complexity. When ρ > ρ*, the characteristics of the mistake sequence changes sharply towards a high Δ and high variance in algorithmic complexity. It is also shown that the quantity ρ is inversely proportional to k and the value of ρ* corresponds to the value k*. This is the point where the learner’s model becomes too simple and is unable to approximate the Bayes optimal decision. Here the characteristics of the mistake sequence change sharply.
Disclaimer: This image was generated using artificial intelligence and may contain inaccuracies or inconsistencies.
It is provided solely as a visual aid to facilitate the rapid understanding of the key ideas presented
in this article. Our editorial team conducts ongoing reviews of AI-generated images and will correct
or replace them whenever an error or discrepancy is identified or reported.
Authors:
Ion
C. Baianu
, James
F. Glazebrook
Abstract:
Relational structures of organisms and the human mind are naturally represented in terms of novel variable topology concepts, non-Abelian categories and Higher Dimensional Algebra{ relatively new concepts that would be defined in
this tutorial paper. A unifying theme of local-to-global approaches to organismic development, evolution and human consciousness leads to novel patterns of relations that emerge in super- and ultra- complex systems in terms of compositions of local procedures [1]. The claim is defended in this paper that human consciousness is unique and should be viewed as an ultra-complex, global process of processes, at a meta-level not sub{summed by, but compatible with, human brain dynamics [2]-[5]. The emergence of consciousness and its existence
are considered to be dependent upon an extremely complex structural and functional unit with an asymmetric network topology and connectivities{the human brain. However, the appearance of human consciousness is shown to be critically dependent upon societal co-evolution, elaborate language-symbolic communication and `virtual', higher dimensional, non{commutative processes involving separate space and time perceptions. Theories of the mind are approached from the theory of levels and ultra-complexity viewpoints that throw
new light on previous semantic models in cognitive science. Anticipatory systems and complex causality at the top levels of reality are discussed in the context of psychology, sociology and ecology. A paradigm shift towards non-commutative, or more generally, non-Abelian theories of highly complex dynamics [6] is suggested to unfold now in physics, mathematics, life and cognitive sciences, thus leading to the realizations of higher dimensional algebras in neurosciences and psychology, as well as in human genomics, bioinformatics and interactomics. The presence of strange attractors in modern society dynamics gives rise to very serious concerns for the future of mankind and the continued persistence of a multi-stable Biosphere.
▲
