Fuzzy Sets, Fuzzy Logic and Their Applications 2020

The present book contains the 24 total articles accepted and published in the Special Issue “Fuzzy Sets, Fuzzy Logic and Their Applications, 2020” of the MDPI Mathematics journal, which covers a wide range of topics connected to the theory and applications of fuzzy sets and systems of fuzzy logic and their extensions/generalizations. These topics include, among others, elements from fuzzy graphs; fuzzy numbers; fuzzy equations; fuzzy linear spaces; intuitionistic fuzzy sets; soft sets; type-2 fuzzy sets, bipolar fuzzy sets, plithogenic sets, fuzzy decision making, fuzzy governance, fuzzy models in mathematics of finance, a philosophical treatise on the connection of the scientific reasoning with fuzzy logic, etc. It is hoped that the book will be interesting and useful for those working in the area of fuzzy sets, fuzzy systems and fuzzy logic, as well as for those with the proper mathematical background and willing to become familiar with recent advances in fuzzy mathematics, which has become prevalent in almost all sectors of the human life and activity

Symbol correspondences for spin systems

The present monograph explores the correspondence between quantum and classical mechanics in the particular context of spin systems, that is, SU(2)-symmetric mechanical systems. Here, a detailed presentation of quantum spin-j systems, with emphasis on the SO(3)-invariant decomposition of their operator algebras, is followed by an introduction to the Poisson algebra of the classical spin system and a similarly detailed presentation of its SO(3)-invariant decomposition. Subsequently, this monograph proceeds with a detailed and systematic study of general quantum-classical symbol correspondences for spin-j systems and their induced twisted products of functions on the 2-sphere. This original systematic presentation culminates with the study of twisted products in the asymptotic limit of high spin numbers. In the context of spin systems, it shows how classical mechanics may or may not emerge as an asymptotic limit of quantum mechanics.Comment: Research Monograph, 171 pages (book format, preliminary version

Aeronautical engineering: A continuing bibliography with indexes (supplement 309)

This bibliography lists 212 reports, articles, and other documents introduced into the NASA scientific and technical information system in Oct. 1994. Subject coverage includes: design, construction and testing of aircraft and aircraft engines; aircraft components, equipment, and systems; ground support systems; and theoretical and applied aspects of aerodynamics and general fluid dynamics

Clustering Theory and Data Driven Health Care Strategies

DoD health care requires reform with growing costs causing concerns of decreased military capability. One proposed radical strategy to fix current health care delivery systems is to organize medical teams around patients with similar treatment requirements. This is a clustering problem; how do you partition the set of patients so that each group has similar treatment needs? We provide advances in clustering theory relevant to this new health care strategy. In particular, we create fast certifiably optimal k-means clustering using what is known as Probably Certifiably Correct (PCC) algorithms which achieves state-of-the-art performance under certain models. Inspired by the health care clustering problem, we pay particular attention to a Bipartite Stochastic Block Model and produce an alternative PCC algorithm specific to this model. We conclude by demonstrating the potential utility of applying these clustering methods in health care. Using conditional entropy as a metric, clusters obtained from our methods vastly outperform partitions prescribed by subject matter experts

Stabilization of Mobile Manipulators

The focus of this work is to generate a method of stabilization in a system generated through the marriage of a mobile robot and a manipulator. While the stability of a rigid manipulator is a solved problem, upon the introduction of flexibilities into the manipulator base structure there is the simultaneous introduction of an unmodeled, induced, oscillatory disturbance to the manipulator system from the mobile base suspension and mounting. Under normal circumstances, the disturbance can be modeled through experimentation and then a form of vibration suppression control can be employed to damp the induced oscillations in the base. This approach is satisfactory for disturbances that are measured, however the hardware necessary to measure the induced oscillations in the manipulator base is generally not included in mobile manipulation systems. Because of this lack of sensing hardware it becomes difficult to directly compensate for the induced disturbances in the system. Rather than developing a direct method for compensation, efforts are made to find postures of the manipulator where the flexibilities of the system are passive. In these postures the manipulator behaves as if it is on a rigid base, this allows the use of higher feedback gains and simpler control architectures.Ph.D

Variable illumination and invariant features for detecting and classifying varnish defects

This work presents a method to detect and classify varnish defects on wood surfaces. Since these defects are only partially visible under certain illumination directions, one image doesn\u27t provide enough information for a recognition task. A classification requires inspecting the surface under different illumination directions, which results in image series. The information is distributed along this series and can be extracted by merging the knowledge about the defect shape and light direction

Discrete Mathematics and Symmetry

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group