New marked point process models for microscopy images

In developing new materials, the characterization of microstructures is one of the key steps. To characterize the microstructure, many microscope modalities have been devised and improved over decades. With the increase in image resolution in the spatial and time domains, the amount of image data keeps increasing in the fields such as materials science and biomedical engineering. As a result, image processing plays a critical role in this era of science and technology. In materials image analysis, image segmentation and feature detection are considered very important. The first part of this research aims to resolve the segmentation problem caused by blurring artifacts in scanning electron microscopy (SEM) images. This blurring issue can lead to a bridged channel problem, which becomes an obstacle in analyzing the microstructures. To tackle the problem, we propose a joint deconvolution and segmentation (JDS) method. As a segmentation method, we use the expectation-maximization/maximization of the posterior marginals (EM/MPM) method, using the Markov random field (MRF) prior model. Experiments show the proposed method improves the segmentation result at object boundaries. The next phase of the image segmentation is detecting image features. In the second part of this research, we detect channel configurations in materials images. We propose a new approach of channel identification, based on the marked point process (MPP) framework, to effectively detect channels in materials images. To describe a higher level of structures in an image, the MPP framework is more effective than the MRF prior model. The reversible-jump Markov chain Monte Carlo (RJMCMC) algorithm embedded with simulated annealing is used as an optimization method, and a new switching kernel in an RJMCMC is used to reduce computational time. The channel configuration is useful in characterizing materials images. In addition, this information can be used to reduce the bridged channel problem more effectively. In materials image processing, one of the most important goals of feature detection is identifying the 3D structure of objects from 3D microscope datasets. The final part of this research is to perform fast and accurate estimation of 3D object configurations from a 3D dataset. We propose a fast 3D fitting method to improve the computational complexity over a full-search 3D MPP method. Experiments show that the fast 3D fitting method significantly decreases execution time compared to the full 3D MPP method

Sustainable Smart Cities and Smart Villages Research

ca. 200 words; this text will present the book in all promotional forms (e.g. flyers). Please describe the book in straightforward and consumer-friendly terms. [There is ever more research on smart cities and new interdisciplinary approaches proposed on the study of smart cities. At the same time, problems pertinent to communities inhabiting rural areas are being addressed, as part of discussions in contigious fields of research, be it environmental studies, sociology, or agriculture. Even if rural areas and countryside communities have previously been a subject of concern for robust policy frameworks, such as the European Union’s Cohesion Policy and Common Agricultural Policy Arguably, the concept of ‘the village’ has been largely absent in the debate. As a result, when advances in sophisticated information and communication technology (ICT) led to the emergence of a rich body of research on smart cities, the application and usability of ICT in the context of a village has remained underdiscussed in the literature. Against this backdrop, this volume delivers on four objectives. It delineates the conceptual boundaries of the concept of ‘smart village’. It highlights in which ways ‘smart village’ is distinct from ‘smart city’. It examines in which ways smart cities research can enrich smart villages research. It sheds light on the smart village research agenda as it unfolds in European and global contexts.

Binary Classification of Multigranulation Searching Algorithm Based on Probabilistic Decision

Multigranulation computing, which adequately embodies the model of human intelligence in process of solving complex problems, is aimed at decomposing the complex problem into many subproblems in different granularity spaces, and then the subproblems will be solved and synthesized for obtaining the solution of original problem. In this paper, an efficient binary classification of multigranulation searching algorithm which has optimal-mathematical expectation of classification times for classifying the objects of the whole domain is established. And it can solve the binary classification problems based on both multigranulation computing mechanism and probability statistic principle, such as the blood analysis case. Given the binary classifier, the negative sample ratio, and the total number of objects in domain, this model can search the minimum mathematical expectation of classification times and the optimal classification granularity spaces for mining all the negative samples. And the experimental results demonstrate that, with the granules divided into many subgranules, the efficiency of the proposed method gradually increases and tends to be stable. In addition, the complexity for solving problem is extremely reduced

Recent Advances in Indoor Localization Systems and Technologies

Despite the enormous technical progress seen in the past few years, the maturity of indoor localization technologies has not yet reached the level of GNSS solutions. The 23 selected papers in this book present the recent advances and new developments in indoor localization systems and technologies, propose novel or improved methods with increased performance, provide insight into various aspects of quality control, and also introduce some unorthodox positioning methods

A methodology for determining optimum microwave remote sensor parameters

There are no author-identified significant results in this report

New Challenges in Neutrosophic Theory and Applications

Neutrosophic theory has representatives on all continents and, therefore, it can be said to be a universal theory. On the other hand, according to the three volumes of “The Encyclopedia of Neutrosophic Researchers” (2016, 2018, 2019), plus numerous others not yet included in Encyclopedia book series, about 1200 researchers from 73 countries have applied both the neutrosophic theory and method. Neutrosophic theory was founded by Professor Florentin Smarandache in 1998; it constitutes further generalization of fuzzy and intuitionistic fuzzy theories. The key distinction between the neutrosophic set/logic and other types of sets/logics lies in the introduction of the degree of indeterminacy/neutrality (I) as an independent component in the neutrosophic set. Thus, neutrosophic theory involves the degree of membership-truth (T), the degree of indeterminacy (I), and the degree of non-membership-falsehood (F). In recent years, the field of neutrosophic set, logic, measure, probability and statistics, precalculus and calculus, etc., and their applications in multiple fields have been extended and applied in various fields, such as communication, management, and information technology. We believe that this book serves as useful guidance for learning about the current progress in neutrosophic theories. In total, 22 studies have been presented and reflect the call of the thematic vision. The contents of each study included in the volume are briefly described as follows. The first contribution, authored by Wadei Al-Omeri and Saeid Jafari, addresses the concept of generalized neutrosophic pre-closed sets and generalized neutrosophic pre-open sets in neutrosophic topological spaces. In the article “Design of Fuzzy Sampling Plan Using the Birnbaum-Saunders Distribution”, the authors Muhammad Zahir Khan, Muhammad Farid Khan, Muhammad Aslam, and Abdur Razzaque Mughal discuss the use of probability distribution function of Birnbaum–Saunders distribution as a proportion of defective items and the acceptance probability in a fuzzy environment. Further, the authors Derya Bakbak, Vakkas Uluc¸ay, and Memet S¸ahin present the “Neutrosophic Soft Expert Multiset and Their Application to Multiple Criteria Decision Making” together with several operations defined for them and their important algebraic properties. In “Neutrosophic Multigroups and Applications”, Vakkas Uluc¸ay and Memet S¸ahin propose an algebraic structure on neutrosophic multisets called neutrosophic multigroups, deriving their basic properties and giving some applications to group theory. Changxing Fan, Jun Ye, Sheng Feng, En Fan, and Keli Hu introduce the “Multi-Criteria Decision-Making Method Using Heronian Mean Operators under a Bipolar Neutrosophic Environment” and test the effectiveness of their new methods. Another decision-making study upon an everyday life issue which empowered us to organize the key objective of the industry developing is given in “Neutrosophic Cubic Einstein Hybrid Geometric Aggregation Operators with Application in Prioritization Using Multiple Attribute Decision-Making Method” written by Khaleed Alhazaymeh, Muhammad Gulistan, Majid Khan, and Seifedine Kadry

From condition-specific interactions towards the differential complexome of proteins

While capturing the transcriptomic state of a cell is a comparably simple effort with modern sequencing techniques, mapping protein interactomes and complexomes in a sample-specific manner is currently not feasible on a large scale. To understand crucial biological processes, however, knowledge on the physical interplay between proteins can be more interesting than just their mere expression. In this thesis, we present and demonstrate four software tools that unlock the cellular wiring in a condition-specific manner and promise a deeper understanding of what happens upon cell fate transitions. PPIXpress allows to exploit the abundance of existing expression data to generate specific interactomes, which can even consider alternative splicing events when protein isoforms can be related to the presence of causative protein domain interactions of an underlying model. As an addition to this work, we developed the convenient differential analysis tool PPICompare to determine rewiring events and their causes within the inferred interaction networks between grouped samples. Furthermore, we present a new implementation of the combinatorial protein complex prediction algorithm DACO that features a significantly reduced runtime. This improvement facilitates an application of the method for a large number of samples and the resulting sample-specific complexes can ultimately be assessed quantitatively with our novel differential protein complex analysis tool CompleXChange.Das Transkriptom einer Zelle ist mit modernen Sequenzierungstechniken vergleichsweise einfach zu erfassen. Die Ermittlung von Proteininteraktionen und -komplexen wiederum ist in großem Maßstab derzeit nicht möglich. Um wichtige biologische Prozesse zu verstehen, kann das Zusammenspiel von Proteinen jedoch erheblich interessanter sein als deren reine Expression. In dieser Arbeit stellen wir vier Software-Tools vor, die es ermöglichen solche Interaktionen zustandsbezogen zu betrachten und damit ein tieferes Verständnis darüber versprechen, was in der Zelle bei Veränderungen passiert. PPIXpress ermöglicht es vorhandene Expressionsdaten zu nutzen, um die aktiven Interaktionen in einem biologischen Kontext zu ermitteln. Wenn Proteinvarianten mit Interaktionen von Proteindomänen in Verbindung gebracht werden können, kann hierbei sogar alternatives Spleißen berücksichtigen werden. Als Ergänzung dazu haben wir das komfortable Differenzialanalyse-Tool PPICompare entwickelt, welches Veränderungen des Interaktoms und deren Ursachen zwischen gruppierten Proben bestimmen kann. Darüber hinaus stellen wir eine neue Implementierung des Proteinkomplex-Vorhersagealgorithmus DACO vor, die eine deutlich reduzierte Laufzeit aufweist. Diese Verbesserung ermöglicht die Anwendung der Methode auf eine große Anzahl von Proben. Die damit bestimmten probenspezifischen Komplexe können schließlich mit unserem neuartigen Differenzialanalyse-Tool CompleXChange quantitativ bewertet werden

Computation in Complex Networks

Complex networks are one of the most challenging research focuses of disciplines, including physics, mathematics, biology, medicine, engineering, and computer science, among others. The interest in complex networks is increasingly growing, due to their ability to model several daily life systems, such as technology networks, the Internet, and communication, chemical, neural, social, political and financial networks. The Special Issue “Computation in Complex Networks" of Entropy offers a multidisciplinary view on how some complex systems behave, providing a collection of original and high-quality papers within the research fields of: • Community detection • Complex network modelling • Complex network analysis • Node classification • Information spreading and control • Network robustness • Social networks • Network medicin