In recent years, demand has been increasing for target detection and tracking from aerial imagery via drones using onboard powered sensors and devices. We propose a very effective method for this application based on a deep learning framework. A state-of-art embedded hardware system empowers small flying robots to carry out the real-time onboard computation necessary for object tracking. Two types of embedded modules were developed: one is designed using a Jetson TX or AGX Xavier, and the other is based on an Intel Neural Compute Stick. These are suitable for real-time onboard computing power on small flying drones with limited space. A comparative analysis of current state-of-art deep-learning-based multi-object detection algorithms was carried out utilizing the designated GPU-based embedded computing modules to obtain detailed metric data about frame rates as well as the computation power. We also introduce an effective target tracking approach for moving objects. The algorithm for tracking moving objects is based on the extension of simple online and real-time tracking. It was developed by integrating a deep-learning-based association metric approach (Deep SORT), which uses a hypothesis tracking methodology with Kalman filtering and a deep-learning-based association metric. In addition, a guidance system that tracks the target position using a GPU-based algorithm is introduced. Finally, we demonstrate the effectiveness of the proposed algorithms by real-time experiments with a small multi-rotor drone.

The efficiency of data sorting algorithms is the key aspect which determines the speed of data processing and searching. The best known efficiency of sorting algorithm has been Log (N) if there are N terms. All of the well-known sorting algorithms use various techniques to sort data. The basis for most of these are comparing the data terms with each other. In this manuscript, we are introducing a new approach for sorting data. This method is postulated to have the highest efficiency ever achieved by any of the sorting algorithms. We achieve this by sorting data without comparing the data terms. Or achieving results of data comparison without comparing the terms explicitly.

In this ‘New Normal' post-COVID-19 modern world, people's health is becoming increasingly important to track. An advanced technology that uses sensory instruments to track and record critical parameters and communicates with others is the need of the time. It's difficult to keep track of all of the medical parameters and post-operative data of people with non-communicable diseases like diabetes and heart disease on a continuous basis. The system discussed here to be designed for patients who are confined to their homes, particularly when going out and being exposed to the outer world is prohibited. This paper proposed a groundbreaking health management system based on the Internet of Things (IoT) for accessing patient medical parameters in both local and remote areas. When a person's wellbeing becomes urgent, this initiative seeks to send an emergency alert to family members or loved ones. A cloud server records data from the patient's temperature sensor and pulse sensor; the data is analyzed using support vector machine algorithms to identify irregular conditions, and an emergency message is sent to the rest of the family via a mobile application, as well as a warning message to the nearest hospital.

Big data has revolutionised science and technology leading to the transformation of our societies. High Performance Computing (HPC) provides the necessary computational power for big data analysis using artificial intelligence and methods. Traditionally HPC and big data had focused on different problem domains and had grown into two different ecosystems. Efforts have been underway for the last few years on bringing the best of both paradigms into HPC and big converged architectures. Designing HPC and big data converged systems is a hard task requiring careful placement of data, analytics, and other computational tasks such that the desired performance is achieved with the least amount of resources. Energy efficiency has become the biggest hurdle in the realisation of HPC, big data, and converged systems capable of delivering exascale and beyond performance. Data locality is a key parameter of HPDA system design as moving even a byte costs heavily both in time and energy with an increase in the size of the system. Performance in terms of time and energy are the most important factors for users, particularly energy, due to it being the major hurdle in high performance system design and the increasing focus on green energy systems due to environmental sustainability. Data locality is a broad term that encapsulates different aspects including bringing computations to data, minimizing data movement by efficient exploitation of cache hierarchies, reducing intra- and inter-node communications, locality-aware process and thread mapping, and in-situ and in-transit data analysis. This paper provides an extensive review of the cutting-edge on data locality in HPC, big data, and converged systems. We review the literature on data locality in HPC, big data, and converged environments and discuss challenges, opportunities, and future directions. Subsequently, using the knowledge gained from this extensive review, we propose a system architecture for future HPC and big data converged systems. To the best of our knowledge, there is no such review on data locality in converged HPC and big data systems.

The rapid advancements and the merging of hybrid quantum-classical computing, artificial intelligence (AI), machine learning (ML), and deep learning (DL) pose a potentially unseen and significant threat to encryption that may impact Post-Quantum Cryptography (PQC) transition timelines. There is a direct hybrid quantum-classical computing threat on cryptography, and there is also a direct threat AI/ML on cryptography. However, the synergistic combination of these technologies presents known and unknown threats that need attention, focus action, and research. This paper reviews Grover's Adaptive Search (GAS), which combines Grover's Algorithm with adaptive techniques to optimize search further, potentially making it even more efficient for attacking encryption. This work also examines the quantum-accelerated Harrow-Hassidim-Lloyd (HHL) Algorithm, designed to solve systems of linear equations exponentially faster than classical algorithms in certain conditions. The HHL algorithm can solve some lattice-based problems, which have implications for lattice-based encryption. This technological confluence and its potential impact on cryptography and encryption necessitate a proactive and coordinated approach to developing and implementing quantum-resistant AI/ML cryptographic solutions. This paper reviews the technological confluence and its potential implications for classical cryptography and PQC transition timelines and calls for further research.

Despite the increasing role of machine learning in various fields, very few works considered artificial intelligence for frequency estimation (FE). This work presents a comprehensive analysis of deep-learning (DL) approach for frequency estimation of single-tones. It is shown that DL network with two layers having a few nodes can estimate frequency more accurately than well-known classical techniques. The study is comprehensive, filling gaps of existing works, where it analyzes error under different signal-to-noise ratios, numbers of nodes, and numbers of input samples; also, under missing SNR information. It is found that DL-based FE is not significantly affected by SNR bias or number of nodes. DL-based approach can work properly using minimal number of input nodes N at which classical methods fail. It is possible for DL to use as little as two layers with two or three nodes each, with complexity of O{N} versus O{Nlog2 (N)} for DFT-based FE, noting that less N is required for DL. Hence, DL can significantly reduce FE complexity, memory, cost, and power consumption, making DL-based FE attractive for resource-limited systems like some IoT sensor applications. Also, reduced complexity opens the door for hardware-efficient implementation using short word-length (SWL) or time-efficient software-defined radio (SDR) communications.

A general procedure is described, to generate material parameter sets to simulate fire propagation in horizontal cable tray installations. Cone Calorimeter test data is processed in an inverse modelling approach. Here, parameter sets are generated procedurally and serve as input for simulations conducted with the Fire Dynamics Simulator (FDS). The simulation responses are compared with the experimental data and ranked based on their fitness. The best fitness was found for a test condition of \SI{50}{\kilo\watt\per\meter^2}. Low flux conditions \SI{25}{\kilo\watt\per\meter^2} and less exhibited difficulties to be simulated accurately. As a validation step, the best parameter sets are then utilised to simulate fire propagation within a horizontal cable tray installation and are compared with experimental data. It is important to note, the inverse modelling process is focused on the Cone Calorimeter and not aware of the actual validation step. Despite this handicap, the general features in the fire development can be reproduced, however not exact. The fire in the tray simulation extinguishes earlier and the total energy release is slightly higher as compared to the experiment. The responses of the material parameter sets are briefly compared with a selection of state of the art procedures.

In the domain of financial trading, where accuracy and swift response to data discrep- ancies are paramount for maintaining clienttrust, our research paper delves into the development of a real-time alert system utilizing SpringBoot, a framework renowned for its robustness and adaptability in enterprise applications. We embark on a comprehensive journey, beginning with addressing thefoundational challenges inherent in monitoring trade inquiries - the necessity for real-time processing, unwavering data accuracy,and ensuring unwavering system reliability. The study then methodically transitions to the architectural design, where we explore howSpringBoot’s capabilities are optimally utilized to meet these challenges. Following this, we delve into the im- -plementationphase, detailing the strategic selection of compatible technologies and methods for effective data management and discrepancydetection. The paper culminates in a thorough evalu- ation of the system, where we assess performance across various operationalscenarios, scrutinize the accuracy of the discrepancy detection mechanisms, and integrate real-world feedback from users in thetrading sector. This holistic approach not only highlights the versatility and efficiency of SpringBoot in creating reliable alert systems in the high-stakes world of financial trading but also serves as a detailed guide for similar endeavors in this field

The recent Google’s claim on breakthrough in quantum computing is a gong signal for further analysis of foundational roots of (possible) superiority of some quantum algorithms over the corresponding classical algorithms. This note is a step in this direction. We start with critical analysis of rather common reference to entanglement and quantum nonlocality as the basic sources of quantum superiority. We elevate the role of the Bohr’s principle of complementarity¹ (PCOM) by interpreting the Bell-experiments as statistical tests of this principle. (Our analysis also includes comparison of classical vs genuine quantum entanglements.) After a brief presentation of PCOM and endowing it with the information interpretation, we analyze its computational counterpart. The main implication of PCOM is that by using the quantum representation of probability, one need not compute the joint probability distribution (jpd) for observables involved in the process of computation. Jpd’s calculation is exponentially time consuming. Consequently, classical probabilistic algorithms involving calculation of jpd for n random variables can be over-performed by quantum algorithms (for big values of n). Quantum algorithms are based on quantum probability calculus. It is crucial that the latter modifies the classical formula of total probability (FTP). Probability inference based on the quantum version of FTP leads to constructive interference of probabilities increasing probabilities of some events. We also stress the role the basic feature of the genuine quantum superposition comparing with the classical wave superposition: generation of discrete events in measurements on superposition states. Finally, the problem of superiority of quantum computations is coupled with the quantum measurement problem and linearity of dynamics of the quantum state update.

The combination of artificial intelligence algorithms and numerical methods has recently become popular in the prediction of macroscopic and microscopic hydrodynamics parameters of bubble column reactors. The multi inputs and outputs machine learning can cover small phase interactions or large fluid behavior in industrial domains. This numerical combination can develop the smart multiphase bubble column reactor with the ability of low-cost computational time. It can also decrease case studies for the optimization process when big data is appropriately used during learning. There are still many model parameters that need to be optimized for a very accurate artificial algorithm, including data processing and initialization, the combination of inputs and outputs, number of inputs and model tuning parameters. For this study, we aim to train four inputs big data during learning process by an adaptive neuro-fuzzy inference system or adaptive-network-based fuzzy inference system (ANFIS) method, and we consider the superficial gas velocity as one of the input variables, while for the first time, one of the computational fluid dynamics (CFD) outputs named gas velocity is used as an output of the artificial algorithm. The results show that the increasing number of input variables improves the intelligence of the ANFIS method up to , and the number of rules during learning process has a significant effect on the accuracy of this type of modeling. The results also show that propper selection of model parameters results in more accuracy in prediction of the flow characteristics in the column structure.

Rescaling of rainfall requires measurements of rainfall rates over many dimensions. This paper develops one approach using 10 m vertical spatial observations of the Doppler spectra of falling rain every 10 seconds over intervals varying from 15 up to 41minutes in two different locations and in two different years using two different Micro-Rain Radars (MRR). The transformation of the temporal domain into spatial observations uses the Taylor ‘frozen’ turbulence hypothesis to estimate an average advection speed over an entire observation interval. Thus, when no other advection estimates are possible, this paper offers a new approach for estimating the appropriate frozen turbulence advection speed by minimizing power spectral differences between the ensemble of purely spatial radial power spectra observed at all times in the vertical and those using the ensemble of temporal spectra at all heights to yield statistically reliable scaling relations. Thus, it is likely that, MRR and other vertically pointing Doppler radars may often help to obviate the need for expensive and immobile large networks of instruments in order to determine such scaling relations, but not the need of those radars for surveillance.

Appropriate estimation of soil settlement is of significant importance since it directly influences the performance of building and infrastructures that are built on soil. In particular, the settlement of fine-grained soils is critical because of low permeability and continuous settlement with time. Coefficient of consolidation (Cc) is a key parameter to estimate settlement of fine-grained soil layers. However, estimation of this parameter is time consuming, needs skilled technicians, and specific equipment. In this study, Cc was estimated using several soil parameters such as liquid limit (LL), plastic limit (PL), and initial void ratio (e0). Estimating such parameters in laboratory is straight forward and needs substantially less time and cost compared to conventional tests to estimate Cc such as Oedometer test. This study presents a novel prediction model for Cc of fine-grained soils using gene-expression programming (GEP). GEP is a biologically inspired technique capable of offering closed-form solution for the optimal solution. A database consisted of 108 different data points was used to develop the model. A closed-form equation solution was derived to estimate Cc based on LL, PL, and e0. The performance of developed GEP-based model was evaluated through coefficient of determination (R2), root mean squared error (RMSE), and mean average error (MAE). High R2 and low error values indicated the descent performance of the model. Furthermore, the model was evaluated using the additional performance measures and met all the suggested criteria. Furthermore, the model had a better performance in terms of R2, RMSE, and MAE compared to most of existing models. It is expected that the developed model will decrease the time and cost associate with determining Cc of fine-grained soils.

Appropriate estimation of soil settlement is of significant importance since it directly influences the performance of building and infrastructures that are built on soil. In particular, the settlement of fine-grained soils is critical because of low permeability and continuous settlement with time. Coefficient of consolidation (C_c) is a key parameter to estimate settlement of fine-grained soil layers. However, estimation of this parameter is time consuming, needs skilled technicians, and specific equipment. In this study, C_c was estimated using several soil parameters such as liquid limit (LL), plastic limit (PL), and initial void ratio (e₀). Estimating such parameters in laboratory is straight forward and needs substantially less time and cost compared to conventional tests to estimate C_c such as oedometer test. This study presents a novel prediction model for C_c of fine-grained soils using gene-expression programming (GEP). GEP is a biologically inspired technique capable of offering closed-form solution for the optimal solution. A database consisted of 108 different data points was used to develop the model. A closed-form equation solution was derived to estimate C_c based on LL, PL, and e₀. The performance of developed GEP-based model was evaluated through coefficient of determination (R²), root mean squared error (RMSE), and mean average error (MAE). High R² and low error values indicated the descent performance of the model. Furthermore, the model was evaluated using the additional performance measures and met all the suggested criteria. Furthermore, the model had a better performance in terms of R², RMSE, and MAE compared to most of existing models. It is expected that the developed model will decrease the time and cost associate with determining C_c of fine-grained soils.Keywords: evolutionary model, gene-expression programming (GEP), prediction, soil compression index, estimation, soil engineering, soil informatics, civil engineering, machine learning, data science, big data, soft computing, deep learning, forecasting, subject classification codes, construction informatics, computational intelligence (CI), artificial intelligence (AI), estimation

We assume that poetic devices have an implicit goal: producing an overall sound scheme that will induce the reader to associate intended and expressed meaning to the sound of the poem. Sounds may be organized into categories and assigned presumed meaning as suggested by traditional literary studies. In my work, I have extracted automatically the sound grids of all the sonnets by William Shakespeare and have combined them with the themes expressed by their contents. In a first experiment I have computed lexically and semantically based sentiment analysis obtaining an 80% of agreement. In a second experiment sentiment analysis has been substituted by Appraisal Theory thus obtaining a more fine-grained interpretation which in some cases contradicts the first one. The computation for the second poet - regarded by many critics the best of last century - includes both vowels and consonants. In addition, it combines automatic semantically and lexically based sentiment analysis with sound grids. The results produce visual maps that clearly separate poems into three clusters: negative harmony, positive harmony and disharmony where the latter instantiates the need by the poet to encompass the opposites in a desperate attempt to reconcile them.

SARS-CoV-2 Omicron variant spike RBD epitopes in complex with spike (S) -protein D614G mutations now predominate globally and increase infectivity by assembling more functional S proteins into the virion. On average, homeopathic medicine contains less than one molecule per dose on average. Single variable SphericalHarmonicY, LaguerreL, WhittakerM, SphericalBesselJ, LegendreP, LegendreQ, LaguerreL, ChebyshevT, and Hypergeometric1F1 Functions pFqarise in connection with the power series solution of the Schrodinger equation or in the summation of perturbation expansions in quantum mechanics. A quantum interpretation of the homeopathic method is presented here through a novel algebraic topology approach to supersymmetry and symmetry breaking in quantum fields and quantum gravity theory with the aim of developing a wide range of physical-based drug design applications in a Small Molecule Quantized Water Memory Network suggesting that the Hidden Black Hole Paradox of Information Loss might be solved under suitable conditions.