Investigation on soft computing techniques for airport environment evaluation systems

Spatial and temporal information exist widely in engineering fields, especially in airport environmental management systems. Airport environment is influenced by many different factors and uncertainty is a significant part of the system. Decision support considering this kind of spatial and temporal information and uncertainty is crucial for airport environment related engineering planning and operation. Geographical information systems and computer aided design are two powerful tools in supporting spatial and temporal information systems. However, the present geographical information systems and computer aided design software are still too general in considering the special features in airport environment, especially for uncertainty. In this thesis, a series of parameters and methods for neural network-based knowledge discovery and training improvement are put forward, such as the relative strength of effect, dynamic state space search strategy and compound architecture. [Continues.

The Encyclopedia of Neutrosophic Researchers - vol. 1

This is the first volume of the Encyclopedia of Neutrosophic Researchers, edited from materials offered by the authors who responded to the editor’s invitation. The authors are listed alphabetically. The introduction contains a short history of neutrosophics, together with links to the main papers and books. Neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics, neutrosophic measure, neutrosophic precalculus, neutrosophic calculus and so on are gaining significant attention in solving many real life problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistent, and indeterminacy. In the past years the fields of neutrosophics have been extended and applied in various fields, such as: artificial intelligence, data mining, soft computing, decision making in incomplete / indeterminate / inconsistent information systems, image processing, computational modelling, robotics, medical diagnosis, biomedical engineering, investment problems, economic forecasting, social science, humanistic and practical achievements

Novel System and Method For Telephone Network Planing Based on Neutrosophic Graph

Telephony is gaining momentum in the daily lives of individuals and in the activities of all companies. With the great trend towards telephony networks, whether analogue or digital known as Voice over IP (VoIP), the number of calls an individual can receive becomes considerably high. However, effective management of incoming calls to subscribers becomes a necessity. Recently, much attention has been paid towards applications of single-valued neutrosophic graphs in various research fields. One of the suitable reason is it provides a generalized representation of fuzzy graphs (FGs) for dealing with human nature more effectively when compared to existing models i.e. intuitionistic fuzzy graphs (IFGs), inter-valued fuzzy graphs (IVFGs) and bipolar-valued fuzzy graphs (BPVFGs) etc. In this paper we focused on precise analysis of useful information extracted by calls received, not received due to some reasons using the properties of SVNGs. Hence the proposed method introduced one of the first kind of mathematical model for precise analysis of instantaneous traffic beyond the Erlang unit. To achieve this goal an algorithm is proposed for a neutrosophic mobile network model (NMNM) based on a hypothetical data set. In addition, the drawback and further improvement of proposed method with a mathematical proposition is established for it precise applications

Neutrosophic Crisp Set Theory

Since the world is full of indeterminacy, the Neutrosophics found their place into contemporary research. We now introduce for the first time the notions of Neutrosophic Crisp Sets and Neutrosophic Topology on Crisp Sets. We develop the 2012 notion of Neutrosophic Topological Spaces and give many practical examples. Neutrosophic Science means development and applications of Neutrosophic Logic, Set, Measure, Integral, Probability etc., and their applications in any field. It is possible to define the neutrosophic measure and consequently the neutrosophic integral and neutrosophic probability in many ways, because there are various types of indeterminacies, depending on the problem we need to solve. Indeterminacy is different from randomness. Indeterminacy can be caused by physical space, materials and type of construction, by items involved in the space, or by other factors. In 1965 [51], Zadeh generalized the concept of crisp set by introducing the concept of fuzzy set, corresponding to the situation in which there is no precisely defined set;there are increasing applications in various fields, including probability, artificial intelligence, control systems, biology and economics. Thus, developments in abstract mathematics using the idea of fuzzy sets possess sound footing. In accordance, fuzzy topological spaces were introduced by Chang [12] and Lowen [33]. After the development of fuzzy sets, much attention has been paid to the generalization of basic concepts of classical topology to fuzzy sets and accordingly developing a theory of fuzzy topology [1-58]. In 1983, the intuitionistic fuzzy set was introduced by K. Atanassov [55, 56, 57] as a generalization of the fuzzy set, beyond the degree of membership and the degree of non-membership of each element. In 1999 and 2002, Smarandache [71, 72, 73, 74] defined the notion of Neutrosophic Sets, which is a generalization of Zadeh’s fuzzy set and Atanassov\u27s intuitionistic fuzzy set

Quantum Genetics, Quantum Automata and Quantum Computation

The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In a previous publication (Baianu,1971a) the formal concept of quantum automaton was introduced and its possible implications for genetic and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b). The notions of topological semigroup, quantum automaton,or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebras that showed significant dissimilarities (Baianu, 1977) from Bolean models of human neural networks (McCullough and Pitts,1945). Molecular models in terms of categories, functors and natural transformations were then formulated for uni-molecular chemical transformations, multi-molecular chemical and biochemical transformations (Baianu, 1983,2004a). Previous applications of computer modeling, classical automata theory, and relational biology to molecular biology, oncogenesis and medicine were extensively reviewed and several important conclusions were reached regarding both the potential and limitations of the computation-assisted modeling of biological systems, and especially complex organisms such as Homo sapiens sapiens(Baianu,1987). Novel approaches to solving the realization problems of Relational Biology models in Complex System Biology are introduced in terms of natural transformations between functors of such molecular categories. Several applications of such natural transformations of functors were then presented to protein biosynthesis, embryogenesis and nuclear transplant experiments. Other possible realizations in Molecular Biology and Relational Biology of Organisms are here suggested in terms of quantum automata models of Quantum Genetics and Interactomics. Future developments of this novel approach are likely to also include: Fuzzy Relations in Biology and Epigenomics, Relational Biology modeling of Complex Immunological and Hormonal regulatory systems, n-categories and Topoi of Lukasiewicz Logic Algebras and Intuitionistic Logic (Heyting) Algebras for modeling nonlinear dynamics and cognitive processes in complex neural networks that are present in the human brain, as well as stochastic modeling of genetic networks in Lukasiewicz Logic Algebras

Uninorm trust propagation and aggregation methods for group decision making in social network with four tuples information

The file attached to this record is the authors accepted version. The publisher's final version of record can be found by following the DOI link below.A novel social network based group decision making (SN-GDM) model with experts' weights not provided beforehand and with the following four tuple information: trust; distrust; hesitancy; and inconsistency, is introduced. The concepts of trust score (TS) and knowledge degree (KD) are de ned and combined into a trust order space. Then, a strict trust ranking order relation of trust function values (TFs) is built in which TS and KD play a similar role to the mean and the variance in Statistics. After the operational laws of TFs for uninorm operators are built, the uninorm propagation operator is investigated. It can propagate through a network both trust and distrust information simultaneously and therefore it prevents the loss of trust information in the propagating process. When an indirect trust relationship is built, the uninorm trust weighted average (UTWA) operator and the uninorm trust ordered weighted average (UTOWA) operator are de ned and used to aggregate individual trust relationship and to obtain their associated ranking order relation. Hence, the most trusted expert is distinguished from the group, and the weights of experts are determined in a reasonable way: the higher an expert is trusted the more importance value is assigned to the expert. Therefore, the novelty of the proposed SN-GDM is that it can use indirect trust relationship via trusted third partners (TTPs) as a reliable resource to determine experts' weights. Finally, the individual trust decision making matrices are aggregated into a collective one and the alternative with the highest trust order relation is selected as the best one

Informational Paradigm, management of uncertainty and theoretical formalisms in the clustering framework: A review

Fifty years have gone by since the publication of the first paper on clustering based on fuzzy sets theory. In 1965, L.A. Zadeh had published “Fuzzy Sets” [335]. After only one year, the first effects of this seminal paper began to emerge, with the pioneering paper on clustering by Bellman, Kalaba, Zadeh [33], in which they proposed a prototypal of clustering algorithm based on the fuzzy sets theory

The posterity of Zadeh's 50-year-old paper: A retrospective in 101 Easy Pieces – and a Few More

International audienceThis article was commissioned by the 22nd IEEE International Conference of Fuzzy Systems (FUZZ-IEEE) to celebrate the 50th Anniversary of Lotfi Zadeh's seminal 1965 paper on fuzzy sets. In addition to Lotfi's original paper, this note itemizes 100 citations of books and papers deemed “important (significant, seminal, etc.)” by 20 of the 21 living IEEE CIS Fuzzy Systems pioneers. Each of the 20 contributors supplied 5 citations, and Lotfi's paper makes the overall list a tidy 101, as in “Fuzzy Sets 101”. This note is not a survey in any real sense of the word, but the contributors did offer short remarks to indicate the reason for inclusion (e.g., historical, topical, seminal, etc.) of each citation. Citation statistics are easy to find and notoriously erroneous, so we refrain from reporting them - almost. The exception is that according to Google scholar on April 9, 2015, Lotfi's 1965 paper has been cited 55,479 times