One of the industries with the fastest rate of growth is healthcare, and this industry's enormous data requires extensive cloud storage. The cloud may offer some protection, but there is no assurance that data owners can rely on it for refuge and privacy amenities. Therefore, it is essential to offer security and privacy protection. Increased customer satisfaction with security and privacy preservation is crucial since healthcare big data and its sources are stored in the cloud and contain increasingly private and sensitive information. However, maintaining privacy and security in an untrusted green cloud environment is difficult, thus the data owner should have complete data control. A new work SecPri-BGMPOP(security and privacy of Boost graph Convolutional Network -Pinpointing-Optimization Performance) is suggested that can offer a solution that involves several different steps in order to handle the numerous problems relating to security and protecting privacy. Initially Boost Graph Convolutional Network Clustering (BGCNC) algorithm, which reduces computational complexity in terms of time and memory measurements, is first applied to the input dataset to begin the clustering process. Second, enlarge by employing a piece of the magnifying bit string to generate a safe key, pinpointing based encryption avoids amplify leakage even if a rival or attacker decrypts the key or asymmetric encryption. Finally, to determine the accuracy of the method, an optimal key was created using a meta-heuristic algorithmic framework called Hybrid fragment horde bland lobo Optimization (HFHBLO). Our proposed method currently kept in a cloud environment, allowing analytics users to utilize it without risking their privacy or security.

The technical capabilities of modern Industry 4.0 and Industry 5.0 are rather vast and growing exponentially daily. The present-day Industrial Internet of Things (IIoT) combines manifold underlying technologies that require real-time interconnections and communications among heterogeneous devices. Smart cities are established with sophisticated designs and control for seamless Machine-to-Machine (M2M) communication to optimize resources, costs, performances, and energy distribution. All the sensory devices within a building interact to maintain a sustainable climate for residents and intuitively optimize the energy distribution to optimize energy production. However, it encompasses quite a few challenges for devices that lack compatible and interoperable designs. Conventional solutions are restricted to limited domains or rely on engineers to design and deploy translators for each pair of ontologies. This is a costly process in terms of engineering efforts and computational resources. The issue persists that a new device with a different ontology must be integrated into an existing IoT network. We propose a self-learning model that can determine the taxonomy of devices given their ontology meta-data and structural information. The model finds matches between two distinct ontologies using the Natural Language Processing (NLP) approach for learning linguistic contexts. Then, by visualizing the ontology network as a knowledge graph, it is possible to learn the structure of the meta-data and understand the device's message formulation. Finally, it can align entities of both ontology graphs similar in context and structure. Furthermore, the model performs dynamic M2M translation without requiring extra engineering or hardware efforts.

This paper presents a limited scope dynamic probabilistic risk assessment (D-PRA) on the survivability of commercial of the shelf (COTS) drones tasked with surveilling areas with varying radiation levels after a nuclear accident. The D-PRA is based on a discrete-dynamic event tree (D-DET) approach, which couples with the OpenEPL error propagation framework to model sequences leading to Loss of Mission (LOM) scenarios due to component failures in the drone’s navigation system. Radiation effects are simulated by calculating the total ionizing dose (TID) against the permissible limit per component, and errors are propagated within the electronic hardware and software blocks to quantify navigation system availability per radiation zone. The proposed methods are integrated into the traditional event tree/fault tree approach and the most vulnerable components are radiation-hardened (RAD-HARD) to the extent specified by a predefined mission success criterion. The results demonstrate the usefulness of the proposed approach in performing trade studies for incorporating COTS components into RAD-HARD drone designs.

This paper presents a novel approach to demonstrate the Collatz Conjecture, an unsolved problem in mathematics stating that all positive integers will eventually converge to 1 when subjected to a recursive sequence of operations. We introduce Algebraic Inverse Trees (AITs), innovative data structures that characterize relationships within the Collatz sequence by tracing inverse transformations back to the origin. Leveraging properties unveiled through this inverted representation, including absence of non-trivial cycles and guaranteed convergence of paths, we construct a topological framework to formally prove that all trajectories invariably lead to 1 under the Collatz iterative process. This modern technique provides not only the machinery to manifest a rigorous proof, but also grants intuitive insights into the deep complexity of this notorious yet elementary conjecture.

The purpose of water treatment through ultraviolet (UV) radiation is to interrupt the development and multiplication of microorganisms by preventing their growth and reproduction.Ultraviolet treatment has become a very affordable solution to produce clean water of optimal quality in regions where access to drinking water is essential. The experimental water treatment unit is powered by a photovoltaic (PV) source. It incorporates a discharge lamp used to generate ultraviolet radiation, which is harnessed to address bacteriological issues related to water quality. This lamp is continuously powered by a photovoltaic (PV) source through an inverter and an electronic ballast. The water treatment system also includes a motor pump designed to draw contaminated water from the input reservoir, a flow control valve to adjust flow rates as needed, and a filter aimed at enhancing the quality of the contaminated water. The water circulates between the input reservoir (contaminated water) and the output reservoir (treated water) through the UV lamp. The relationship between the intensity of the UV lamp and the water flow rate can ensure an adequate water quality.

Chatbots have gained widespread popularity for their task automation capabilities and consistent availability in various domains, including education. However, their ability to adapt to the continuously evolving and dynamic nature of knowledge is limited. This research investigates the implementation of an internet wizard to enhance the knowledge base of an open-domain question-answering chatbot. The proposed approach leverages search engines, particularly Google, and its features, including feature snippets, knowledge graph, and organic search, in conjunction with data science and natural language models. This mechanism empowers the chatbot to dynamically access the extensive and up-to-date knowledge available on the web, enabling the provision of real-time and pertinent answers to user queries sourced from web documents. A pilot study in a higher education context evaluated the chatbot's mechanism and features, confirming its proficiency in generating responses across a broad range of educational and non-educational topics. Positive feedback and high user satisfaction validate these findings. Notably, the chatbot's dynamic feature of retrieving related or follow-up questions from search engines significantly enhances student engagement and facilitates exploration of supplementary information beyond the curriculum.

Maintaining a healthy cyber society is a big challenge due to the users’ freedom of expression and behaving. It can be solved by monitoring and analyzing the users’ behavior and taking proper actions towards them. This research aims to present a platform that monitors the public content on Twitter by extracting tweet data. After maintaining the data, the users’ interactions are analyzed using Graph Analysis methods. Then the users’ behavioral patterns are analyzed by applying Metadata Analysis, in which the timeline of each profile is obtained; also, the time-series behavioral features of users are investigated. Then in the Abnormal Behavior Detection Filtering component, the interesting profiles are selected for further examinations. Finally, in the Contextual Analysis component, the contents will be analyzed using natural language processing techniques; A binary text classification model (SVM + TF-IDF with 88.89% accuracy) for detecting if the tweet is related to crime or not. Then, a sentiment analysis method is applied to the crime-related tweets to perform aspect-based sentiment analysis (DistilBERT + FFNN with 80% accuracy); because sharing positive opinions about a crime-related topic can threaten society. This platform aims to provide the end-user (Police) suggestions to control hate speech or terrorist propaganda.

Various factors, such as uncertainty of component parameters and uncertainty of sensor meas-urement values, contribute to the difficulty of fault detection in the landing gear retrac-tion/extension hydraulic system. In this paper, we introduce linear fractional transformation technology and uncertainty analysis theory for the construction of the diagnostic bond graph of the landing gear retraction/extension hydraulic system. In this way, interval analytical redundancy relations and fault signature matrix can be derived. Using the fault signature matrix, existing faults of the system can be preliminarily detected and isolated. Additionally, interval analytical re-dundancy relations can be used to detect system faults in detail, and cases analysis can be carried out to determine if the actuator is externally or internally leaky, and if the landing gear selector valve is reversing stuck. Compared to the traditional analytical redundancy relations, this method takes into account the negative factors of uncertainty; and compared to the traditional absolute diagnostic threshold, the interval diagnostic threshold is more accurate and sensitive.

Background Hokkaido is the northernmost, least populous, and coldest of the Japanese islands. It was the first prefecture to be affected by COVID-19, while Kanagawa is home to one of the most populous areas of Japan, namely the Tokyo metro area. The Japanese government responded early during the pandemic by identifying infected patients, contact tracing, and performing PCR analysis on anyone who was suspected of having been exposed to SARS-CoV-2. The government has also been publishing information about each individual who tested positive for the virus. Both Hokkaido and Kanagawa started recording COVID-19 cases in the winter of 2020 and have detailed records of thousands of patients, thus providing an invaluable resource for the transmission and behavior of the virus. Methods The current study analyzed the COVID-19 registry data from the Hokkaido and Kanagawa prefectures. The Hokkaido registry contained 1,269 cases (674 (53%) females and 595 (47%) males) recorded between February 14 and July 22, 2020. The Kanagawa registry had 3,123 cases (1,346 (43%) females and 1,777 (57%) males. The final data contained a total of 4,392 cases (2,020 (46%) females and 2,372 (54%) males). By leveraging the information on viral transmission paths available in the registry data, we performed exponential random graph model (ERGM) network analysis to examine demographic and symptomological homophilies of the SARS-CoV-2 viral transmission networks. Results We observed age, symptomatic, and asymptomatic homophilies in both prefectures. Furthermore, those patients who contracted the virus through secondary or tertiary contacts were more likely to be asymptomatic than those who contracted it from primary infection cases. The transmission networks showed that transmission occurred significantly in healthcare settings, as well as in families, although the size of the networks was small in the latter. Most of the transmissions stopped at the primary and secondary levels and no transmission beyond quaternary was observed. We also observed a higher level of asymptomatic transmission in Kanagawa than in Hokkaido. Conclusions Symptom homophilies are an important component of COVID-19 and suggest that nuanced genetic differences in the virus may affect its epithelial cell type range and can thus result in the diversity of symptoms seen in individuals infected by SARS-CoV-2. Moreover, environmental variables such as temperature and humidity may also be playing an important role in the overall pathogenesis of the virus.

Traffic shaping is a critical task in software-defined -IoT networks (SDN-IoTs) to efficiently manage network resources and ensure Quality of Service (QoS) for end-users. However, traditional traffic shaping approaches based on queuing theory or static policies may not be effective due to the dynamic and unpredictable nature of network traffic. In this paper, we propose a novel approach that leverages Graph Neural Networks (GNNs) and Multi-arm Bandit algorithms to dynamically optimize traffic shaping policies based on real-time network traffic patterns. Specifically, our approach uses a GNN model to learn and predict network traffic patterns and a Multi-arm Bandit algorithm to optimize traffic shaping policies based on these predictions. We evaluate the proposed approach on three different datasets, including a simulated corporate network (KDD Cup 1999), a collection of network traffic traces (CAIDA), and a simulated network environment with both normal and malicious traffic (NSL-KDD). The results demonstrate that our approach outperforms other state-of-the-art traffic shaping methods, achieving higher throughput, lower packet loss, and lower delay, while effectively detecting anomalous traffic patterns. The proposed approach offers a promising solution to traffic shaping in SDNs, enabling efficient resource management and QoS assurance

With the growth of air traffic demand in busy airspace, there is an urgent need for airspace sectorization to increase air traffic throughput and ease the pressure on controllers. The purpose of this paper is to develop a method framework that can perform airspace sectorization automatically, reasonably, which can be used as an advisory tool for controllers as an automatic system, especially for eliminating irregular sector shapes generated by simulated annealing algorithm (SAA) based on region growth method. Two graph cutting method, dynamic Monte Carlo method by changing location of flexible vertices (MC-CLFV) and Monte Carlo method by radius changing (MC-RC) were developed to eliminating irregular sector shapes generated by SAA in post-processing. The experimental results show that the proposed method framework of AS can automatically and reasonably generate sector design schemes that meet the design criteria. Our methodology framework and software can provide assistant design and analysis tools for airspace planners to design airspace, improve the reliability and efficiency of airspace design, and reduce the burden of airspace planners. In addition, this lays the foundation for reconstructing airspace with more intelligent method.

Creating self-learning algorithms, developing deep neural networks and improving other methods that "learn" for various areas of human activity is the main goal of the theory of machine learning. It helps to replace the human with a machine, aiming to increase the quality of production. The theory of artificial neural networks, which already have replaced the humans in problems of detection of moving objects, recognition of images or sounds, time series prediction, big data analysis and numerical methods remains the most dispersed branch of the theory of machine learning. Certainly, for each area of human activity it is necessary to select appropriate neural network architectures, methods of data processing and some novel tools from applied mathematics. But the universal problem for all these neural networks with specific data is the achieving the highest accuracy in short time. Such problem can be resolved by increasing sizes of architectures and improving data preprocessing, where the accuracy rises with the training time. But there is a possibility to increase the accuracy without time growing, applying optimization methods. In this survey we demonstrate existing optimization algorithms of all types, which can be used in neural networks. There are presented modifications of basic optimization algorithms, such as stochastic gradient descent, adaptive moment estimation, Newton and quasi-Newton optimization methods. But the most recent optimization algorithms are related to information geometry, for Fisher-Rao and Bregman metrics. This approach in optimization extended the theory of classic neural networks to quantum and complex-valued neural networks, due to geometric and probabilistic tools. There are provided applications of all introduced optimization algorithms, what delighted many kinds of neural networks, which can be improved by including any advanced approaches in minimization of the loss function. Afterwards, we demonstrated ways of developing optimization algorithms in further researches, engaging neural networks with progressive architectures. Classical gradient based optimizers can be replaced by fractional order, bilevel and, even, gradient free optimization methods. There is a possibility to add such analogues in graph, spiking, complex-valued, quantum and wavelet neural networks. Besides the usual problems of image recognition, time series prediction, object detection, there are many are other tasks for modern theory of machine learning, such as solving problem of quantum computations, partial differential and integro-differential equations, stochastic processes and Brownian motion, making decisions and computer algebra.

The influence and importance of research and development (R&D) for business sustainability have gained increasing interests, especially in the high-tech sector. However, the efforts of R&D might cause complex and mixed impacts on the financial results considering the associated expenses. Thus, this study aims to examine how R&D efforts may influence business to improve its financial performance considering the dual objectives: the gross and the net profitability. This research integrated a rough-set-based soft computing technique and multiple criteria decision-making (MCDM) methods to explore this complex and yet valuable issue. A group of public listed companies from Taiwan, all in the semiconductor sector, was analyzed as a case study. Initially, more than 30 variables were considered, and the adopted soft computing technique retrieved 14 core attributes—for the dual profitability objectives—to form the evaluation model. The importance of R&D for pursuing superior financial prospects is confirmed, and the empirical case demonstrates how to guide an individual company to plan for improvements to achieve its long-term sustainability by this hybrid approach.

Smart grid software interconnects multiple Engineering disciplines (power systems, communication, software and hardware technology, instrumentation, big data, etc.). The software architecture is an evolving concept in smart grid systems in which systematic architecture development is a challenging process. The architecture has to realize the complex legacy power grid systems and cope up with current Information and Communication Technologies (ICT). The distributed generation in smart grid environment expects the software architecture to be distributed and to enable local control. Smart grid architecture should also be modular, flexible and adaptable to technology upgrades. In this paper, the authors have made a comprehensive review on architecture for smart grids. An in depth analysis of layered and agent based architectures is presented and compared under various domains.

This paper offers a novel geometric and visual approach to the renowned Four Color Map Theorem and K5 non-planarity problem while unveiling their profound connection to the "kissing number" problem in 2D. We represent planar graphs through circles and tangents, simplifying complex structures and shedding light on these classic problems. Our proofs by contradiction, rooted in the kissing number concept, reveal that both the Four Color Map Theorem and K5 non-planarity are fundamentally linked, as they pivot around the concept of coloring. This study bridges the realms of geometry and graph theory, providing fresh insights and emphasizing the significance of the kissing number problem in various fields.