Real-world time series data sets contain a combination of linear and nonlinear patterns, making the time series forecasting problem more challenging. In this paper, a new hybrid methodology is introduced for forecasting univariate time series data sets using a multiplicative error modeling approach. An autoregressive integrated moving average (ARIMA) model is combined with an autoregressive neural network (ARNN) for improving the predictions of individual forecast models. The proposed multiplicative ARIMA-ARNN model glorifies the chances of capturing the different combinations of linear and nonlinear patterns in time series. The model shows outstanding performance on six standard time-series data sets compared to other widely used single and hybrid forecasting models.

We compute explicitly trace of one-dimensional diffusion process which can be regarded as a Dirichlet form on graphs and we study its conservativeness property. Finally, we give an example of a discretization of one dimensional diffusion of Bessel's process with order $\nu$.

In this paper the dynamics of spatially extended infected phytoplankton with the Holling type II functional response and logistically growing susceptible phytoplankton system is studied. The proposed model is an extension of temporal model available [6], in spatiotemporal domain. The reaction diffusion system exhibits spatiotemporal chaos in phytoplankton dynamics. This is particularly important for the spatially extended systems that are studied in this paper as they display a wide spectrum of ecologically relevant behavior, including chaos. In this system stability of the system is studied with respect to disease contact rate and the growth fraction of infected phytoplankton indirectly rejoin the susceptible phytoplankton population. The results of numerical experiments in one dimension and two dimensions in space as well as time series in temporal models are presented using MATLAB simulation. Moreover, the stability of the corresponding temporal model is studied analytically. Finally, the comparison of the three types of numerical experimentations are discussed in conclusion.

This study investigates the impact of global financial crisis and the present COVID-19 pandemic on daily and weekly Crude oil futures using four variants of ARMA-GARCH models: ARMA-sGARCH, ARMA-eGARCH, ARMA-TGARCH and ARMA- aPARCH with dummy variables We also investigated the persistence, half-life and backtesting of the models. This study therefore seeks to contribute to the body of literature on the impact of global financial crisis and the present COVID-19 pandemic on crude oil futures market. This investigation of the impact of global financial crisis and the COVID-19 on crude oil futures has not been much studied at present. We obtained and analyzed the daily and weekly crude oil futures from secondary sources. Daily crude oil futures used in this study covers the period from the 4th January 2000 to 27th April 2020 while the weekly crude oil futures covered from 2ndJanuary 2000 to 26th April 2020 . The global financial crisis period covered from 2nd July 2007 to 31st March 2009 and the current COVID-19 pandemic covered from 1st January 2020 to 27th April, 2020. The study used both student t and skewed student t innovations with AIC, goodness-of-test fit and backtesting to select the best model. Most of the estimated ARMA-GARCH models are supported by skewed student t distribution while most of the ARMA-GARCH models exhibited high persistence values in the presence of global financial crisis and the COVID-19 pandemic. In the overall, the estimated ARMA(1,0)-eGARCH(2,1) and ARMA(1,0)-eGARCH(2,2) model for daily crude oil futures and weekly crude oil futures respectively have been significantly impacted by the global financial crisis and the Present COVID-19 pandemic while the preferred estimated models also passed the goodness-of-test fit and backtesting.This study recommends shareholders and investors should think outside the box as crude oil futures tend to be affected by global financial crisis and COVID-19 pandemic while countries also that depend mostly on crude oil are encouraged to diversify their economy in other to survive and be sustained during financial and health crisis.

This study developed a system dynamics model to understand the spread of coronavirus disease (COVID-19) in Japan. The model is built on the generic SEIR (Susceptible, Exposed, Infected, and Recovered) framework adopted by Ghaffarzadegan and Rahmandad (2020) to build a system dynamics model for the spread of COVID-19 in Iran. Japan seems to be successful in containing the spread compared with other countries, and its first peak has passed. However, because this also leaves a large population still susceptible to the virus, it could cause a second and potentially higher peak of infection after the state of emergency aimed at reducing contact rate is lifted. As the government has proposed the “New Lifestyle,” it is critical to behave cautiously so as not to be infected. While the model focuses on the SEIR structure, the reflection of other sub-structures such as economy and hospital capacity that have tradeoffs with reducing contact rate should be beneficial. However, before extending the model, it is also critical to conduct estimates using confidence intervals rather than point estimates to better reflect uncertainties.

Retinopathy is a human eye disease that causes changes in retinal blood vessels that leads to bleed, leak fluid and vision impairment. Symptoms of retinopathy are blurred vision, changes in color perception, red spots, and eye pain. In this paper, a new methodology based on Convolutional Neural Networks (CNN) is developed and proposed to diagnose and give a decision about the presence of retinopathy. The CNN model is trained by different images of eyes that have retinopathy and those which do not have retinopathy. The performance of the proposed model is compared with the related methods of DREAM, KNN, GD-CNN and SVM. Experimental results show that the proposed CNN performs better.

The recent advancements of the Semantic Web and Linked Data have changed the working of the traditional web. There is a huge adoption of the Resource Description Framework (RDF) format for saving of web-based data. This massive adoption has paved the way for the development of various centralized and distributed RDF processing engines. These engines employ different mechanisms to implement key components of the query processing engines such as data storage, indexing, language support, and query execution. All these components govern how queries are executed and can have a substantial effect on the query runtime. For example, the storage of RDF data in various ways significantly affects the data storage space required and the query runtime performance. The type of indexing approach used in RDF engines is key for fast data lookup. The type of the underlying querying language (e.g., SPARQL or SQL) used for query execution is a key optimization component of the RDF storage solutions. Finally, query execution involving different join orders significantly affects the query response time. This paper provides a comprehensive review of centralized and distributed RDF engines in terms of storage, indexing, language support, and query execution.

We have considered a SEIR-SEI Vector-host mathematical model which captures malaria transmission dynamics, described and built on 7-dimensional nonlinear ordinary differential equations. We compute the basic reproduction number of the model; examine the positivity and boundedness of the model compartments in a region using well established methods viz: Cauchy’s differential theorem, Birkhoff & Rota’s theorem which verifies and reveals the well-posedness, and carrying capacity of the model respectively, the existence of the Disease-Free (DFE) and Endemic (EDE) equilibrium points were determined and examined. Using the Gaussian elimination method and the Routh-hurwitz criterion, we convey stability analyses at DFE and EDE points which indicates that the DFE (malaria-free) and the EDE (epidemic outbreak) point occurs when the basic reproduction number is less than unity (one) and greater than unity (one) respectively. We obtain a solution to the model using the Variational iteration method (VIM) (an unprecedented method) to each population compartments and verify the efficacy, reliability and validity of the proposed method by comparing the respective solutions via tables and combined plots with the computer in-built Runge-kutta-Felhberg of fourth-fifths order (RKF-45). We illustrate the combined plot profiles of each compartment in the model, showing the dynamic behavior of these compartments; then we speculate that VIM is efficient and capable to conduct analysis on Malaria models and other epidemiological models.

Through the half-unit circle area computation using the integration of the corresponding curve power series representation, we deduce a slow converging positive infinite series to $\pi$. However, by studying the remainder of that series we establish sufficiently close inequalities with equivalent lower and upper bound terms allowing us to estimate, more precisely, how the series approaches $\pi$. We use the obtained inequalities to compute up to four-digit denominator, what are in this sense, the best rational numbers that can replace $\pi$. It turns out that the well-known convergents of the continued fraction of $\pi$, $22/7$ and $355/113$ called, respectively, Yuel\"{u} and Mil\"{u} in China are the only ones found. Thus we apply a similar process to find rational estimations to $\pi+e$ where $e$ is taken as the power series of the exponential function evaluated at $1$. For rational numbers with denominators less than $2000$, the convergent $920/157$ of the continued fraction of $\pi+e$ turns out to be the only rational number of this type.

The famous Toms effect (1948) consists of a substantial increase of the critical Reynolds number when a small amount of soluble polymer is introduced into water. The most noticeable influence of polymer additives is manifested in the boundary layer near solid surfaces. The goal of the present paper is a group analysis of the boundary layer equations in two mathematical models of the flow of aqueous polymer solutions: the second grade fluid (Rivlin and Ericksen, 1955) and the model derived by Pavlovskii (1971). The equations of the unsteady two-dimensional boundary layer in the Pavlovskii and Rivlin-Ericksen models are analyzed for the first time here. These equations have no definite type so that finding their exact solutions is very important in order to understand the mathematical nature of the above mentioned models. The problem of group classification with respect to the arbitrary function of the longitudinal coordinate and time present in the equations, which sets the pressure gradient of the external flow, arises. All functions for which an extension of the admitted Lie group occurs are found. The task includes the ratio of two characteristic length scales. One of them is the Prandtl scale, and another is defined as the square root of the normalized coefficient of relaxation viscosity (Frolovskaya and Pukhnachev, 2018) and does not depend on the characteristics of the motion. The paper contains a number of exact solutions in the Pavlovskii model including a solution describing the flow near a critical point. Among the solutions of the new model of the boundary layer, a special place is taken by the solution of the stationary problem of flow around a rectilinear plate. Within the framework of the Prandtl theory of the boundary layer, such a solution was constructed by Blasius (1908). As is well-known, this solution has a non-removable defect: the transverse velocity near the edge of the plate increases without bound. The introduction of a relaxation term into the model makes it possible to eliminate this singularity.

Automated medical diagnosis is one of the important machine learning applications in the domain of healthcare. In this regard, most of the approaches primarily focus on optimizing the accuracy of classification models. In this research, we argue that unlike general purpose classification problems, medical applications require special treatment. In case of medical diagnosis, apart from model performance other factors such as cost of data acquisition may also be taken into account. Since, models which are relatively expensive to operate would have diminished applicability in the field. Therefore, both performance and cost factors may be considered for designing the automated diagnosis solutions. In this regard, we have proposed two ensemble based cost-sensitive feature ranking techniques which tend to select an optimal feature subset by evaluating the cost-benefit trade-off on benchmarked chronic kidney disease dataset. We have also addressed the issue of automatic threshold selection which is generally faced by feature ranking approaches; hence enhancing the overall applicability of the solution. In this research, the main focus is on the application of decision-tree based classifiers in a cost-effective manner. As a case study, we have selected chronic kidney disease as the application of interest in which we demonstrate that our proposed approaches select features which are both useful and cost-effective. Furthermore, the proposed approaches are also evaluated against a number of comparative techniques and the results are promising.

Significant progress has made in pattern recognition technology. However, one obstacle that has not yet overcome is the recognition of words in the Brahmi script, specifically the identification of characters, compound characters, and word. This study proposes the use of the deep convolutional neural network with dropout to recognize the Brahmi words. This study also proposed a DCNN for Brahmi word recognition and a series of experiments are performed on standard Brahmi dataset. The practical operation of this method was systematically tested on accessible Brahmi image database, achieving 92.47% recognition rate by CNN with dropout respectively which is among the best while comparing with the ones reported in the literature for the same task.

The world is facing new challenges every day; however, with the spread of the pandemic around the world, this new challenge is different. The pandemic is increasing and concentrating various challenges simultaneously. Although different sectors are facing consequences, the most important sectors, that is, health and economy are the most affected. When the pandemic began, it was not known how long it would last, which complicated health and economic planning. Therefore, it is important for decision makers and the public to know the predictions and expectations of the future of these challenges. In this work, the current situation is analyzed. Then, an expectation model is developed based on the statistics of the pandemic using a growth rate model based on an exponential and logarithmic rate of increase. Based on the available open data about the pandemic spread, the model can successfully predict future expectations, including the duration and maximum number of cases of the pandemic. The model uses the equilibrium point as the day the cases decrease. The model can be used for planning and the development of strategies to overcome these challenges.

A novel software engineering platform called the Dynamic Nuchwezi Architecture Platform (DNAP) is introduced, specified and its novelties explained. The unique features of this platform are explained and several new concepts and abstractions upon which its implementation, usage, and analysis are hinged also elaborately discussed. The motivations for this new approach to building especially tools used in data engineering are spelled out and the platform is contrasted against other existing technologies of a similar kind. Finally, it is shown what known limitations DNAP suffers, as well as what room for further research and improvement there is in this field.

We consider a four-dimensional Riemannian manifold M with an additional structure S, whose fourth power is minus identity. In a local coordinate system the components of the metric g and the structure S form skew-circulant matrices. Both structures S and g are compatible, such that an isometry is induced in every tangent space of M. By a special identity for the curvature tensor, generated by the Riemannian connection of g, we determine classes of Einstein and almost Einstein manifolds. For such manifolds we obtain propositions for the sectional curvatures of some characteristic 2-planes in a tangent space of M. We consider a Hermitian manifold associated with the studied manifold and find conditions for g, under which it is a K\"{a}hler manifold. We construct some examples of the considered manifolds on Lie groups.

In this paper, closed forms of the sum formulas $\sum_{k=0}^{n}W_{k}^{2}$ \ for the squares of generalized Tetranacci numbers are presented. We also present the sum formulas $\sum_{k=0}^{n}W_{k+1}W_{k},$ $\sum_{k=0}^{n}W_{k+2}W_{k},$ and $\sum_{k=0}^{n}W_{k+3}W_{k}.$ As special cases, we give summation formulas of the of Tetranacci, Tetranacci-Lucas and some other fourth order linear recurrance sequences.

Local binary pattern is one of the visual descriptors and can be used as a powerful feature extractor for texture classification. In this paper, a novel representation for face recognition is proposed, called it Bilateral Line Local Binary Patterns (BL-LBP). This scheme is an extension of Line Local Binary Patterns descriptors in the statistical learning subspace. The present bilateral descriptors are fused with an ensemble learning of calibrated SVM models. The performance of this scheme is evaluated using 5 standard face databases. It is found that it is robust against illumination variation, diverse facial expressions and head pose variations and its recognition accuracy reaches 98 percent, running on a mobile device with a processing speed of 63 ms per face. Results suggest that our proposed method can be very useful for the vision systems that have limited resources where the computational cost is critical.

Abstract: The main contribution of this paper is to introduce a new iterative training algorithm for restricted Boltzmann machines. The proposed learning path is inspired from online sequential extreme learning machine one of extreme learning machine variants which deals with time accumulated sequences of data with fixed or varied sizes. Recursive least squares rules are integrated for weights adaptation to avoid learning rate tuning and local minimum issues. The proposed approach is compared to one of the well known training algorithms for Boltzmann machines named “contrastive divergence”, in term of time, accuracy and algorithmic complexity under the same conditions. Results strongly encourage the new given rules during data reconstruction.

Twin prime numbers are two prime numbers which have the difference of 2 exactly. In other words, twin primes is a pair of prime that has a prime gap of two. Sometimes the part “twin prime” is used for a pair of twin primes; an alternative name for this is prime twin or prime pair. Up to date there is no any valid proof/disproof for twin prime conjecture. Through this research paper, my attempt is to provide a valid proof for twin prime conjecture.

All transmission disease depends on the transmission opportunity or medium like humans in COVID-19. Due to globalization and regular movement of people from one country to another, spread of COVID 19 reached to 208 countries till May 10, 2020. For any society health is major concern for humanity as well as administration. Any pandemic is declared as and when it reached at a particular severity level and control vice versa. So, we have continued the daily COVID 19 cases analysis and segregated till May 10, 2020. We have included at least 25 countries for the analysis purpose due to limitation of number of observations in the analysis. Maximum number of day’s data available for China is for 100 days, followed by Iran for 81 days, minimum number of days data is for 16 days for Western Sahara and Tajikistan.

This paper presents a new interactive visualization system to represent and compare rate of spread of COVID 19 pandemic across different countries over time. We surveyed existing visualization techniques used in various websites and media outlets and introduced use of a knee detection algorithm that divides the exponential spread in multiple linear components. A set of use cases demonstrates the utility of the system in comparing the spread across different countries for both analysis and prediction.

The world is facing new challenges every day. however, with the pandemic spread over the world, a new challenge is different. The pandemic challenge is taking all the challenges to concentrate and increase in one time. Although different sectors are facing consequences, the most important sectors, health and economy are the most affected. When the pandemic start, it is not known when it will last for different health and economic planning. Therefore, it is very important for decision makers and the public to know the prediction and expectations of the future of these challenges to successfully goes over it. In this work, the current situation is analyzed. Then, an expectation model is developed based on the statistics of the pandemic using a growth rate model based on the exponential and logarithmic increase rate. Based on the available open data about the pandemic spread, the model successfully can predict the future expectations. The model expects the time and the maximum number of cases of the pandemic. The model uses the equilibrium point as the day the of cases decreases. The model can be used for planning and development of strategies to overcome the challenges.

This paper presents a signal-processing method to remove pan-artifact on ISEs with artificial neural networks. An Ion Selective Electrode is used to investigate the concentration of a specific ion from aqueous solution, by measuring the Nernst potential along the glass membrane. However, Application of ISE on a multi-ion solution has problem. First problem is a chemicophysical artifact which is called ion interference effect. Electrically charged particles interact with each other and flows through the glass membrane of different ISEs. Second problem is that movement of liquid directly interfere the glass membrane, causing inaccurate voltage measurement. When multiple ISEs are dipped into same solution, a sensor’s signal emission interference voltage measurement of other sensors. Therefore, an ISE is recommended to applied on single-ion solution, without any other sensors applied at the same time. Deep learning approach can remove both artifacts at the same time. The proposed method is designed to remove complex artifacts with one-shot calculation, with MAPE less than 1.8%, and R² as 0.997. A randomly chosen value of AI-predicted value has MAPE less than 5% (p-value 0.016).

In the promptness of the COVID-19 outbreak, it would be very important to observe and estimate the pattern of diseases to reduce the contagious infection. To study this effect, we developed a COVID-19 analytical epidemic framework that combines with isolation and lockdown effect by incorporating five various groups of individuals. Then we analyze the model by evaluating the equilibrium points and analyzing their stability as well as determining the basic reproduction number. The extensive numerical simulations show the dynamics of a different group of the population over time. Thus, our findings based on the sensitivity analysis and the reproduction number highlight the role of outbreak of the virus that can be useful to avoid a massive collapse in Bangladesh and rest of the world. The outcome of this study concludes that outbreak will be in control which ensures the social and economic stability.

In this article, we prove an orthogonal decomposition theorem for real inner product gyrogroups, which unify some well-known gyrogroups in the literature: Einstein, M\"{o}bius, Proper Velocity, and Chen's gyrogroups. This leads to the study of left (right) coset partition of a real inner product gyrogroup induced from a subgyrogroup that is a finite-dimensional subspace. As a result, we obtain gyroprojectors onto the subgyrogroup and its orthogonal complement. We construct also quotient spaces and prove an associated isomorphism theorem. The left (right) cosets are characterized using gyrolines (cogyrolines) together with automorphisms of the subgyrogroup. With the algebraic structure of the decompositions, we study fiber bundles and sections inherited by the gyroprojectors. Finally, the general theory is exemplified for the aforementioned gyrogroups.

The recent advancements of the Semantic Web and Linked Data have changed the working of the traditional web. There is a huge adoption of the Resource Description Framework (RDF) format for saving of web-based data. This massive adoption has paved the way for the development of various centralized and distributed RDF processing engines. These engines employ different mechanisms to implement key components of the query processing engines such as data storage, indexing, language support, and query execution. All these components govern how queries are executed and can have a substantial effect on the query runtime. For example, the storage of RDF data in various ways significantly affects the data storage space required and the query runtime performance. The type of indexing approach used in RDF engines is key for fast data lookup. The type of the underlying querying language (e.g., SPARQL or SQL) used for query execution is a key optimization component of the RDF storage solutions. Finally, query execution involving different join orders significantly affects the query response time. This paper provides a comprehensive review of centralized and distributed RDF engines in terms of storage, indexing, language support, and query execution.

Satellite communication (Satcom) is an artificial geostationary satellite that facilitates a wide range of telecommunications. Considering its quality of service (QoS) and security is crucial in government/military applications. The most challenging situation for efficient Satcom is radio frequency interference (RFI) environment. Thus, it is necessary to ensure that transmissions are incorruptible or at least sense the quality of its spectrum. This paper presents a new method to recognize received signal characteristics using a hierarchical classification in a multi-layer perceptron neural network. We consider signal modulation and the type of RFI as the characteristics of a real-time video stream transmitted in the direct broadcast satellite. Four different modulation types are investigated in this study. Moreover, the combination of the communication signal with various kinds of interference and their effects on the classification method widely have been analyzed. Besides, two robust feature selection techniques have been developed to reduce the data-set dimensional, which leads to optimizing the classification process. The results show that the Genetic Algorithm (GA) slightly outperforms Principal Component Analysis (PCA) for feature selection. Furthermore, the robustness of the proposed techniques is assessed to detect unknown signals at different signal to noise ratios.

In this paper, we introduce deboost, a Python library devoted to weighted distance ensembling of predictions for regression and classification tasks. Its backbone resides on the scikit-learn library for default models and data preprocessing functions. It offers flexible choices of models for the ensemble as long as they contain the predict method, like the models available from scikit-learn. deboost is released under the MIT open-source license and can be downloaded from the Python Package Index (PyPI) at https://pypi.org/project/deboost. The source scripts are also available on a GitHub repository at https://github.com/weihao94/DEBoost.

Multi-objective optimization (MOO) is the subset of optimization which deals with minimization of several objective functions more than the conventional one objective optimization. These have useful application in decision making. Many of the current methodologies addresses challenges and solutions to multi-objective optimization problem which attempt to simultaneously solve several objectives with multiple constraints subjoined to each objective. Such as evolutionary algorithm, genetic algorithm, flower pollination algorithm, and many more. However, most challenges in MOO are generally subjected to linear inequality constraints that prevent all objectives from being optimized at once. This paper discusses some approaches presented by scholars in MOO and then presents some new concepts by introducing methods in solving problem in MOO which comes due to periodical objectives that do not stay for the entire duration of process life time unlike permanent objectives which are optimized once for the entire process life time. A methodology based on partial optimization which optimizes each objective iteratively and weight convergence method which optimizes sub-group of objectives is given. Furthermore, another methods is introduced which involve objective classification ranking, estimation and prediction where objectives are classified base on their properties, and rank using a given criteria and in addition estimated for its optimal weight point if it certifies a coveted optimal weight point. Then finally predicted to find how much it deviates from the estimated point.

As technology evolves, our digital footprint keeps increasing. Now, everything we do is largely related to us being online, connected and logged. Therefore, if someone’s online data is exposed, then their life will be compromised. This is called identity theft and in this era of technology, it has become one of the most serious forms of crime. When someone’s data is compromised, there is a huge chance of harming the person financially, morally and socially. New technology and the knowledge gap it creates when it first comes out is perfect for identity thieves to exploit. If we are not cautious, our future will be very different than what we dream of due to the very technology created to make it better. Hence, we need to understand the technology, identify the loopholes and educate ourselves to avoid being held captive by our digital footprint.

Classification algorithms are very widely used algorithms for the study of various categories of data located in multiple databases that have real-world implementations. The main purpose of this research work is to identify the efficiency of classification algorithms in the study of breast cancer analysis. Mortality rate of women increases due to frequent cases of breast cancer. The conventional method of diagnosing breast cancer is time consuming and hence research works are being carried out in multiple dimensions to address this issue. In this research work, Google colab, an excellent environment for Python coders, is used as a tool to implement machine learning algorithms for predicting the type of cancer. The performance of machine learning algorithms is analyzed based on the accuracy obtained from various classification models such as logistic regression, K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Naïve Bayes, Decision Tree and Random forest. Experiments show that these classifiers work well for the classification of breast cancers with accuracy>90% and the logistic regression stood top with an accuracy of 98.5%. Also implementation using Google colab made the task very easier without spending hours of installation of environment and supporting libraries which we used to do earlier.

Presently, smartphones support a large range of applications, many of which require high computing power. This presents a problem because smartphones offer limited computing power, storage, and energy. Fortunately, Cloud computing (CC) is rapidly becoming known as the state of the art technology in the computer world. CC allows users to use unlimited dynamic resources when necessary. Mobile Cloud Computing (MCC) is integration into a mobile environment of the concept of cloud computing which eliminates barriers to the performance of mobile devices. The demand for mobile cloud applications and mobile user services is strong. This gives MCC a great opportunity to do business and research. However, security problems are a major obstacle to the adaptability of mobile cloud computing. This study presents the definitions of Cloud Computing, Mobile Computing (MC) and Mobile Cloud Computing including the architecture and applications of MCC. Furthermore, it discusses the challenges and opportunities faced in MCC.

COVID-19 is an infectious disease, growth of which depends upon the linked stages of the epidemic, the average number of people one person can infect and the time it takes for those people to become infectious themselves. We have studied the COVID-19 time series to understand the growth behaviour of COVID-19 cases series. A structural break occurs in the COVID-19 series at the change time form one stage to another. We have performed the structural break analysis of data available for 207 countries till April 20, 2020. There are 42 countries which have recorded five breaks in COVID cases series. This means that these countries are in the sixth stage of growth transmission and show a downward pattern in reporting in the daily cases, whereas countries with two and three breaks, record the rapid growth pattern in the daily cases. From this study, we conclude that the more the breaks in the series, there is more possibility to determine the constant or decreasing rate of daily cases. It is well fitted using lognormal distribution as this distribution is archived at its highest peak after some period and then suddenly it decreases at a longer time period. This can be seen in various countries like China, Australia, New Zealand and so on.

The Coronavirus pandemic has created complex challenges and adverse circumstances. This research discovers public sentiment amidst problematic socioeconomic consequences of the lockdown, and explores ensuing four potential sentiment associated scenarios. The severity and brutality of COVID-19 have led to the development of extreme feelings, and emotional and mental healthcare challenges. This research identifies emotional consequences - the presence of extreme fear, confusion and volatile sentiments, mixed along with trust and anticipation. It is necessary to gauge dominant public sentiment trends for effective decisions and policies. This study analyzes public sentiment using Twitter Data, time-aligned to COVID-19, to identify dominant sentiment trends associated with the push to 'reopen' the economy. Present research uses textual analytics methodologies to analyze public sentiment support for two potential divergent scenarios - an early opening and a delayed opening, and consequences of each. Present research concludes on the basis of exploratory textual analytics and textual data visualization, that Tweets data from American Twitter users shows more trust sentiment support, than fear, for reopening the US economy. With additional validation, this could present a valuable time sensitive opportunity for state governments, the federal government, corporations and societal leaders to guide the nation into a successful new normal future.

Conditional heteroskedastic financial time series are commonly modelled by ARCH and GARCH. ARCH(1) and GARCH processes were recently extended to the function spaces C[0,1] and L²[0,1], their probabilistic features were studied and their parameters were estimated. The projections of the operators on finite-dimensional subspace were estimated, as were the complete operators in GARCH(1,1). An explicit asymptotic upper bound of the estimation errors was stated in ARCH(1). This article provides sufficient conditions for the existence of strictly stationary solutions, weak dependence and finite moments of ARCH and GARCH processes in various L^p[0,1] spaces, C[0,1] and other spaces. In L²[0,1] we deduce explicit asymptotic upper bounds of the estimation errors for the shift term and the complete operators in ARCH and GARCH and for the projections of the operators on a finite-dimensional subspace in ARCH. The operator estimaton is based on Yule-Walker equations. The estimation of the GARCH operators also involves a result concerning the estimation of the operators in invertible, linear processes which is valid beyond the scope of ARCH and GARCH. Through minor modifications, all results in this article regarding functional ARCH and GARCH can be transferred to functional ARMA.

We show how some concentration inequalities for sampling without replacement can be used for bounding future samples. This process can be extended to bound the sum of future samples from multiple populations, and we analyse an illustrative sample allocation problem.

The constant news about the corona virus is scary. It is not possible to separate treatment for Cancer due to COVID-19. An effective treatment comparison strategy is needed. We need to have a handy tool to understand cancer progression in this unprecedented scenario. Linking different events of cancer progression is the need of the hour. It is a methodological challenge. We provide the solutions to overcome the issue with interval between two consecutive events in motivating head and neck cancer (HNC) data.

Big Data in medicine includes possibly fast processing of large data sets, both current and historical in purpose supporting the diagnosis and therapy of patients' diseases. Support systems for these activities may include pre-programmed rules based on data obtained from the interview medical and automatic analysis of test results diagnostic results will lead to classification of observations to a specific disease entity. The current revolution using Big Data significantly expands the role of computer science in achieving these goals, which is why we propose a Big Data computer data processing system using artificial intelligence to analyze and process medical images.

Through the half-unit circle area computation using the integration of the corresponding curve power series representation, we deduce a slow converging positive infinite series to $\pi$. However, by studying the remainder of that series we establish sufficiently close inequalities with equivalent lower and upper bound terms allowing us to estimate, more precisely, how the series approaches $\pi$. We use the obtained inequalities to compute up to four-digit denominator, what are in this sense, the best rational numbers that can replace $\pi$. It turns out that the well-known $22/7$ and $355/113$ called, respectively, Yuel\"{u} and Mil\"{u} in China are the only ones found. This is not so surprising when one considers the empirical computations around these two rational approximations to $\pi$. Thus we apply a similar process to find rational estimations to $\pi+e$ where $e$ is taken as the power series of the exponential function evaluated at $1$. For rational numbers with denominators less than $2000$, $920/157$ turns out to be the only rational number of this type.

Blockchain decentralized applications (ÐApps) are applications which run on Blockchains nodes. Thus, in order to interact directly with this sort of applications, users need to have a blockchain address, wallet and knowledge about how to make transactions in order to interact with ÐApps. Therefore, the knowledge required to use a ÐApp can easily make users to desist when trying to interact with them. In order to tackle this issue, we propose a software architecture that will be located in the middle of the user and the ÐApp, thus making users initially unaware that they are interacting with a ÐApp. This is achieved by analyzing the relationship between ÐApps and Apps by using UML modelling. Next, based in the previous analysis, we created a middleware for users to interact with a ÐApp in the same manner the do with a traditional web app, i.e. by using usernames, passwords and UI elements instead of addresses, private keys or transactions. Finally, in order to put the developed middleware into practice, we developed a ÐApp that makes use of it. This ÐApp registers the time control of workers from companies by using Blockchain to store the data in a secure and non-modifiable manner.

Fractional differential mathematical model unfolding the dynamics of the COVID-19 pandemic in India is presented and explored in this paper. The purpose of this study is to estimate the future outbreak of disease and potential control strategies using mathematical models in India as a whole country as well as in some of the states of the country. This model is calibrated based on reported cases of infections over the month of April 2020 in India. We have used iterative fractional complex transform method to find approximate solutions of the model having modified Riemann Liouville fractional differential operator. We have also carried out a comparative analysis between actual and estimated cumulative cases graphically, moreover, most sensitive parameters for basic reproduction number$(R_0)$ are computed and their effect on transmission dynamics of COVID-19 pandemic is investigated in detail.

Using only a limited number of computationally expensive functions, we show a way how to construct accurate and computationally efficient approximations of the Colebrook equation for flow friction. The presented approximations are based on the asymptotic series expansion of the Wright ω-function and symbolic regression. The results are verified with 8 million of Quasi-Monte Carlo points covering the domain of interest for engineers. In comparison with the built-in “wrightOmega” feature of Matlab R2016a, the herein introduced related approximations of the Wright ω-function significantly accelerate the computation. With only two logarithms and several basic arithmetic operations used, the presented approximations are not only computationally efficient but also extremely accurate. The maximal relative error of the most promising approximation which is given in the form suitable for engineers’ use is limited to 0.0012%, while for a little bit more complex variant is limited to 0.000024%.

In the wake of the novel coronavirus, SARS-CoV-19, the world has undergone a critical situation in which grave threats to global public health emerged. Among human populations across the planet, travel restraints, border enforcement measures, quarantine, and isolation provisions were implemented in an attempt to control and limit the spread of the contagion. Decisions on how to implement and enforce various control policies should be determined based on available real-world evidence and theoretical prediction. In this study, we propose a novel exportation- importation epidemic model associated with the quarantine and hospitalized-isolation policies by considering the two-body system: a source country of a contagious disease and a neighboring country that is initially disease-free. The model is first applied to the original COVID-19 data in China, Italy, and the Republic of Korea (ROK) and observed through consistent fitting results with equivalent goodness-of-fit. Then, the data are estimated per the fitting parameters. Driven by these parametric settings and considering the normalized population, the numerical analysis, and epidemiological exploration, this work further elucidates the substantial impact of quarantine policies, healthcare facilities, and the public counter-compliance effect.

Email is the most common as well as the fastest medium for communicating around the globe. But, presently every day we used to get lots of junk emails in the name of “spam”. This “spam” emails mainly used to contain two types of content, those are content like an advertisement, offers and, criminal activity content like a phishing website link, malware, trojan, etc. Those advertisements, offer types of spam or junk emails known as Unsolicited Commercial Emails and, those emails contain phishing website link, malware, trojan used to known as Unsolicited Bulk Emails. Whoever used to send spam emails, they are known as Spammers. Spammers mainly used to get the email address of target user from the websites, junk sites, browsers add on, etc. Naive Bayes algorithm is a probabilistic machine learning algorithm that mainly well-known for classifying spam emails. Naive Bayes algorithm mainly originated from Bayes Theorem. Bayes Theorem mainly used in conditional probability for elaborates the probability of an event in terms of when the probability of other event is true. In this research work, we have been performing Feature Extraction in terms of email characteristics and behavior. In this paper, we have been proposed a detection approach for classifying spam emails using Naïve Bayes classifier. In this research work, we have been used multiple email data-sets for implementing Naïve Bayes classifier. Those data sets are Spam Corpus, Spambase. Based on the results of WEKA (Waikato Environment for Knowledge Analysis) tool, we have been performing Experimental analysis in terms of measuring the performance of Naïve Bayes classifier using parameters like Accuracy, Recall, Precision, F-measure. Based on correctly classified instances of emails and incorrectly classified instances of emails, lastly comparing the performance of Naïve Bayes classifier in multiple data sets.

World is now experiencing a major health calamity due to the coronavirus disease (COVID-19) pandemic, caused by the severe acute respiratory syndrome coronavirus clade 2 (SARS-CoV- 2). The foremost challenge facing the scientific community is to explore the growth and transmission capability of the virus. Use of artificial intelligence (AI), such as, deep learning, in (i) rapid disease detection from x-ray/computerized tomography (CT)/ high-resolution computed tomography (HRCT) images, (ii) accurate prediction of the epidemic patterns and their saturation throughout the globe, (iii) identification of the epicenter in each country/state and forecasting the disease from social networking data, (iv) prediction of drug-protein interactions for repurposing the drugs, and (v) socio-economic impact and prediction of future relapses, has attracted much attention. In the present manuscript, we describe the role of various AI-based technologies for rapid and efficient detection from CT images complementing quantitative real time polymerase chain reaction (qRT-PCR) and immunodiagnostic assays. AI-based technologies to anticipate the current pandemic pattern, possibility of future relapses and socio-economic impact are also discussed. We inspect how the virus transmits depending on different factors, such as, population density and mobility among others. We depict how AI-based mobile app for contact tracing and surveys can prevent the transmission. A modified deep learning technique can assess affinity of the most probable drugs to treat COVID-19. Here a few effective antiviral drugs, such as, Geneticin, Avermectin B1, and Ancriviroc among others, have been reported with their appropriate validation from previous investigations.

Globally, there is massive uptake and explosion of data and challenge is to address issues like scale, pace, velocity, variety, volume and complexity of this big data. Considering the recent epidemic in China, modeling of COVID-19 epidemic for cumulative number of infected cases using data available in early phase was big challenge. Being COVID-19 pandemic during very short time span, it is very important to analyze the trend of these spread and infected cases. This chapter presents medical perspective of COVID-19 towards epidemiological triad and the study of state-of-the-art. The main aim this chapter is to present different predictive analytics techniques available for trend analysis, different models and algorithms and their comparison. Finally, this chapter concludes with the prediction of COVID-19 using Prophet algorithm indicating more faster spread in short term. These predictions will be useful to government and healthcare communities to initiate appropriate measures to control this outbreak in time.

A mathematical model is proposed for quantitative description of the outbreak of novel coronavirus COVID-19 Although the model is relatively simple, the comparison with the public data shows that an exact solution solution of the model (with the correctly-specified parameters) leads to the results, which are in good agreement with the measured data in China and Austria. Prediction of the total number of the COVID-19 cases is discussed and examples are presented using the measured data in Austria, France and Poland.

Positioning is an essential aspect of robot navigation, and visual odometry an important technique for continuous updating the internal information about robot position, especially indoors without GPS. Visual odometry is using one or more cameras to find visual clues and estimate robot movements in 3D relatively. Recent progress has been made, especially with fully integrated systems such as the RealSense T265 from Intel, which is the focus of this article. We compare between each other three visual odometry systems and one wheel odometry, on a ground robot. We do so in 8 scenarios, varying the speed, the number of visual features, and with or without humans walking in the field of view. We continuously measure the position error in translation and rotation thanks to a ground truth positioning system. Our result show that all odometry systems are challenged, but in different ways. In average, ORB-SLAM2 has the poorer results, while the RealSense T265 and the Zed Mini have comparable performance. In conclusion, a single odometry system might still not be sufficient, so using multiple instances and sensor fusion approaches are necessary while waiting for additional research and further improved products.

Background: Outbreak of the Covid-19 is now an ongoing global health emergency. At the end of December 2019, the first infection was reported in Wuhan and the world did not pay attention to this extremely contaminated disease and plucked to react rapidly. The World is in an vulnerable state in disease spreading, facing a great loss of lives and socio-economic aspects also. That is why we have proposed a potential mathematical model with data analysis to predict and control the outcome of this pandemic. Methods: The model presented the epidemic dynamics of multiple compartments. We collected available online data of Spain. In primary step, we estimated the parameters using either the data analysis or reference papers. Then we did the data fitting analysis in comparison with the outcome of our mathematical results. The results of the system depended not only the parameters also on social consciousness. Results: It is found that disease progression in this model is determined by the basic reproductive ratio, $R_0$, the actual epidemic of $R_0$ and effective $R(t)$ of each day. If $R_0>1$, the number of latently infected individuals grows exponentially; endemic solution is stable while infection rate decays if $R_0<1$. The optimal control theory stated that vaccination and treatment strategies are highly effective for reducing both susceptible and infected population and to increase the recover rate high. In Spain, after state of alarm (quarantine) on 14 March 2020, reported cases increasing for 13 days only and from the 14th day, daily reported cases started to decline albeit with small fluctuation. Our proposed model approximates that the disease in Spain could be fully under control by after July 2020. Conclusion: Outbreak will be in control of health care system, reduce the death rate and will ensure social-economic stability.

A novel software engineering platform called the Dynamic Nuchwezi Architecture Platform is introduced, specified and its novelties explained. The unique features of this platform are explained and several new concepts and abstractions upon which its implementation, usage and analysis are hinged also elaborately discussed. The motivations for this new approach to building especially tools used in data engineering are spelled out and the platform is contrasted against other existing technologies of a similar kind. Finally, it is shown what known limitations DNAP suffers, as well as what room for further research and improvement there is in this field.

This brief note aims to explain the scope in conducting large-scale serological surveys of SARS-CoV-2 to define the landscape of population immunity without overlooking the inherent uncertainty steaming from sampling design and diagnostic validity. The note completes with a succinct statistical appendix of simple methods for estimating prevalence from random population samples using imperfect diagnostic tests.

According to the changed operative conditions due to lockdown and successive reopening a number of facts can be analysed. The main effects have been detected on: mobility, environment, social media and people flows. While in this first report only mobility, transport and environment are reported. The analysis performed identified a strong reduction of the mobility and transport activities, and in the pollutants. The mobility reduction has been assessed to be quite coherent with respect to what has been described by Google Global mobility report. On the other hand, in this paper a number of additional aspects have been put in evidence providing detailed aspects on mobility and parking that allowed us to better analyze the impact of the reopening on an eventual revamping of the infection. To this end, the collected data from the field have been compared from those of google and some considerations with respect to the Imperial college Report 20 have been derived. For the pollutant aspects, a relevant reduction on most of them has been measured and rationales are reported.

The prevalence of differential equations as a mathematical technique has refined the fields of control theory and constrained optimization due to the newfound ability to accurately model chaotic, unbalanced systems. However, in recent research, systems are increasingly more nonlinear and difficult to model using Differential Equations only. Thus, a newer technique is to use policy iteration and Reinforcement Learning, techniques that center around an action and reward sequence for a controller. Reinforcement Learning (RL) can be applied to control theory problems since a system can robustly apply RL in a dynamic environment such as the cartpole system (an inverted pendulum). This solution successfully avoids use of PID or other dynamics optimization systems, in favor of a more robust, reward-based control mechanism. This paper applies RL and Q-Learning to the classic cartpole problem, while also discussing the mathematical background and differential equations which are used to model the aforementioned system.

In India the first case of coronavirus disease 2019 (COVID-19) reported on 30 January 2020, and thereafter cases were increasing daily after the last week of Feb. 2020. COVID-19 identified as family member of coronaviridae where previously Middle East Respiratory Syndrome MERS and Severe Acute Respiratory Syndrome SARS belongs to same family. The COVID-19 attacks on respiratory system signing fever, cough and breath shortness, in severe cases may cause pneumonia, SARS or some time death. The aim of this study work is to develop model which predicts the epidemic peak for COVID-19 in India by using the real-time data from 30 Jan to 10 May 2020. There are uncertainties while identifying the population information due to the incomplete and inaccurate data, we initiate the most popular model for epidemic prediction i.e Susceptible, Exposed, Infectious, & Recovered SEIR initially the compartmental model for the prediction. Based on the solution of the state estimation problem for polynomial system with Poisson noise, we estimate that the epidemic peak may reach the early-middle July 2020, initializing recovered R0 to 0 and Infected I0 to 1. The outcomes of the model will help epidemiologist to isolate the source of the disease geospatially and analyze the death. Also government authorities will be able to target their interventions for rapidly checking the spread of the epidemic.

Image registration has an imperative role in medical imaging. In this work, a grey-wolf optimizer (GWO) based non-rigid demons registration is proposed to support the retinal image registration process. A comparative study of the proposed GWO-based demons registration framework with cuckoo search, firefly algorithm, and particle swarm optimization- based demons registration is conducted. In addition, a comparative analysis of different demons registration methods, such as Wang’s demons, Tang’s demons, and Thirion’s demons which are optimized using the proposed GWO is carried out. The results established the superiority of the GWO-based framework which achieved 0.9977 correlation, and fast processing compared to the use of the other optimization algorithms. Moreover, GWO-based Wang’s demons performed better accuracy compared to the Tang’s demons and Thirion’s demons framework. It also achieved the best less registration error of 8.36×10^-5.

Coronavirus, also known as COVID-19, has been declared a pandemic by the World Health Organization (WHO). At the time of conducting this study, it had recorded over 1.6million cases while more than 105,000 have died due to it, with these figures rising on a daily basis across the globe. The burden of this highly contagious respiratory disease is that it presents itself in both symptomatic and asymptomatic patterns in those already infected, thereby leading to an exponential rise in the number of contractions of the disease and fatalities. It is therefore crucial to expedite the process of early detection and diagnosis of the disease across the world. The case-based reasoning (CBR) model is an effective paradigm that allows for the utilization of cases’ specific knowledge previously experienced, concrete problem situations or specific patient cases for solving new cases. This study therefore aims to leverage the very rich database of cases of COVID-19 to interpret and solve new cases even at their early stage to the advanced stage. The approach adopted in this study employs a natural language processing (NLP) technique to parse records of cases and thereafter formalize each case which is represented as a mini-ontology file. The formalized case is therefore parsed into a CBR model to allow for classification of the case into positive or negative to COVID-19. Meanwhile, feature extraction for each case is done by classifying tokens extracted by the NLP approach into special, temporal and thematic classes before encoding them using an ontology modeling method. The CBR model therefore leverages on the formalized features to compute the similarity of the new case with extracted similar cases from the archive of the CBR model. The proposed framework was populated with 68 cases obtained from the Italian Society of Medical and Interventional Radiology (SIRM) repository. Results obtained revealed that the proposed approach leverages on locations (spatial) and time (temporal) of contagion to successfully detect cases even in their early stages of two days onward before the incubation period of fourteen days. The proposed framework achieved an accuracy of 97.10%, sensitivity of 0.98 and specificity of .066. The study found that the proposed model can assist physicians to easily diagnose and isolate cases, thereby minimizing the rate of contagion and reducing false diagnosis as observed in some parts of the globe.

Accurate detection of players and teams in ice hockey games is crucial to the tracking of individual players on court and team tactical decisions, which is therefore becoming an important task for coaches and other analysts. However, hockey is a fluid sport due to complex dynamics and frequent substitutions by both teams, resulting in various body positions of players. Few traditional player detection models from other team sports take these characteristics into account, especially for the detection of teams without prior annotations. Here, we design a two-phase cascaded Convolutional Neural Network (CNN) model coupling between individual players position information and team uniform colors to hierarchically detect players in ice hockey games. Our model filters most of disturbing information, such as audience and sideline advertising bars, in Phase I, and refines the detection of targeted players in Phase II, which is efficient and accurate with a precision rate of 91.30% and a recall rate of 95.60% for individual players detection, and an average accuracy of 93.05% in team classification from a self-built dataset of collected images in the 2018 Winter Olympics. Meanwhile, we also present results based on the images and real-time detection from broadcasting videos of 2019-20 NHL regular games covering all 31 teams to show the robustness of our model.

This article presents a method of segmenting images with gray levels that uses Onicescu's information energy calculated in the context of the neutrosophic theory. Starting from the information energy calculation for complete neutrosophic information, it is shown how to extend its calculation for incomplete and inconsistent neutrosophic information. The segmentation method is based on calculation of thresholds for separating the gray levels using the local maximum points of the Onicescu information energy.

Increasingly, genomics is being used for the prediction of specific traits and diseases (phenotypes) among humans. Wider availability of genomics data through multiple research projects (such as International HapMap Project1 and 1000 Genomes2) has been a catalyst in that direction. With the recent advances in machine learning and big data analysis, data computation resources and data models needed for genomics data analysis are readily available. However, the prediction of traits and diseases has its own challenges in terms of computational requirements and computational analysis, statistical analysis (example: confounding variables), and limited quality of data collection. Linear Mixed Models (LMM, a type of linear regression) is a common approach for Genome-wide Association Studies (GWAS) for the prediction of common traits among humans using genomics. This paper researches the existing LMM-based approaches for Genome-wide Association Studies (GWAS), describes the experiment performed on FaST-LMM approach from Microsoft Research, and then proposes an enhanced approach (called LMM-22) on how to address computational and statistical issues. LMM-22 focuses on the parallelization of LMM computations and execution of LMM-22 on General Purpose Graphics Processing Units (GPU) as against CPUs to accelerate the LMM approach for GWAS studies.

Coronavirus disease (COVID-19) is a pandemic infectious disease that has a severe risk of spreading rapidly. The quick identification and isolation of the affected persons is the very first step to fight against this virus. In this regard, chest radiology images have been proven to be an effective screening approach of COVID-19 affected patients. A number of AI based solutions have been developed to make the screening of radiological images faster and more accurate in detecting COVID-19. In this study, we are proposing a deep learning based approach using Densenet-121 to effectively detect COVID-19 patients. We incorporated transfer learning technique to leverage the information regarding radiology image learned by another model (CheXNet) which was trained on a huge Radiology dataset of 112,120 images. We trained and tested our model on COVIDx dataset containing 13,800 chest radiography images across 13,725 patients. To check the robustness of our model, we performed both two-class and three-class classifications and achieved 96.49% and 93.71% accuracy respectively. To further validate the consistency of our performance, we performed patient-wise k-fold cross-validation and achieved an average accuracy of 92.91% for three class task. Moreover, we performed an interpretability analysis using Grad-CAM to highlight the most important image regions in making a prediction. Besides ensuring trustworthiness, this explainability can also provide new insights about the critical factors regarding COVID-19. Finally, we developed a website that takes chest radiology images as input and generates probabilities of the presence of COVID-19 or pneumonia and a heatmap highlighting the probable infected regions. Code and models' weights are availabe.

Prior to lockdown the spread of COVID-19 in UK is found to be exponential, with an exponent α=0.207 In case of COVID-19 this spreading patterns is quantitatively better described with mobility-driven SIR-SEIR model [2] rather than the homogenous mixing models Lockdown has dramatically slowed down the spread of COVID-19 in UK, and even more significantly has changed the growth in the total number of infected from exponential to quadratic. This significant change is due a transition from a mobility-driven epidemic spreading to a spatial epidemic which is dominated by slow growth of spatially isolated clusters of infected population. Our results strongly indicated that, to avoid a return to exponential growth of COVID-19 (also known as “second wave”) mobility restrictions should not be prematurely lifted. Instead mobility should be kept restricted while new measures, such as wearing mask and contact tracing, get implemented in order to allow a safe exit from lockdown.

Accurate lithium battery diagnosis and prognosis is critical to increase penetration of electric vehicles and grid-tied storage systems. They are both complex due to the intricate, nonlinear, and path-dependent nature of battery degradation. Data-driven models are anticipated to play a significant role in the behavioral prediction of dynamical systems such as batteries. However, they are often limited by the amount of training data available. In this work, we generated the first big data comprehensive synthetic datasets to train diagnosis and prognosis algorithms. The proof-of-concept datasets are over three orders of magnitude larger than what is currently available in the literature. With benchmark datasets, results from different studies could be easily equated, and the performance of different algorithms can be compared, enhanced, and analyzed extensively. This will expend critical capabilities of current AI algorithms, tools, and techniques to predict scientific data.

Background: Administrative healthcare databases are widespread and are often standardized with regard to their content and data coding, thus they can be used also as data sources for surveillance and epidemiological research. Chronic dialysis requires patients to frequently access hospital and clinic services, causing a heavy burden to healthcare providers. This also means that these patients are routinely tracked on administrative databases, yet very few case definitions for their identification are currently available. The aim of this study was to develop two algorithms derived from administrative data for identifying incident chronic dialysis patients and test their validity compared to the reference standard of the regional dialysis registry. Methods: The algorithms are based on data retrieved from hospital discharge records (HDR) and ambulatory specialty visits (ASV) to identify incident chronic dialysis patients in an Italian region. Subjects are included if they have at least one event in the HDR or ASV databases based on the ICD9-CM dialysis-related diagnosis or procedure codes in the study period. Exclusion criteria comprise non-residents, prevalent cases, or patients undergoing temporary dialysis, and are evaluated only on ASV data by the first algorithm, on both ASV and HDR data by the second algorithm. We validated the algorithms against the Emilia-Romagna regional dialysis registry by searching for incident patients in 2014. Results: Algorithm 1 identified 680 patients and algorithm 2 identified 676 initiating dialysis in 2014, compared to 625 patients included in the regional dialysis registry. Sensitivity for the two algorithms was respectively 90.8% and 88.4%, positive predictive value 84.0% and 82.0%, and percentage agreement was 77.4% and 74.1%. Conclusions: These results suggest that administrative data have high sensitivity and positive predictive value for the identification of incident chronic dialysis patients. Algorithm 1, which showed the higher accuracy and has a simpler case definition, can be used in place of regional dialysis registries when they are not present or sufficiently developed in a region, or to improve the accuracy and timeliness of existing registries.

We review and assess the classic SIR and SEIR epidemiological models regarding possible applications to the COVID-19 pandemic. In spite of numerous more complicated models, we show how the qualitative features of the solution to the SIR and SEIR models continue to provide valuable public health insights in some scenarios. Using estimated COVID-19 data as of this date, the SEIR model shows that if it were possible to reduce R₀ from 2.5 to 1.25 through social distancing and other measures, the maximum fraction of the population that would become infected at any particular time would drop from 17% to 4%, provided that all of the model assumptions are satisfied. Finally, we compare the classic SIR model with a recent stochastic model with favorable results. Since this comparison underscores the importance of underlying connectivity assumptions, we conclude with Monte-Carlo simulations with specific connectivity that reproduce the classical SIR model with standard incidence.

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

We applied a generalized SEIR epidemiological model to the recent SARS-CoV-2 outbreak in the world, with a focus on Italy and its Lombardia, Piemonte, and Veneto regions. We focus on the application of a stochastic approach in fitting the model numerous parameters using a Particle Swarm Optimization (PSO) solver, to improve the reliability of predictions in the medium term (30 days). We analyze the official data and the predicted evolution of the epidemic in the Italian regions, and we compare the results with data and predictions of Spain and South Korea. We link the model equations to the changes in people’s mobility, with reference to Google’s COVID-19 Community Mobility Reports. We discuss the effectiveness of policies taken by different regions and countries and how they have an impact on past and future infection scenarios.

Let f : V → V be a Cohomological Expanding Mapping¹ of a smooth complex compact homogeneous manifold with $ dim_{\mathbb{C}}(\Vc)=k \ge 1$ and Kodaira Dimension $\leq 0$. We study the dynamics of such mapping from a probabilistic point of view, that is, we describe the asymptotic behavior of the orbit $ O_{h} (x) = \{h^{n} (x), n \in \mathbb{N} \quad \mbox{or}\quad \mathbb{Z}\}$ of a generic point. Using pluripotential methods, we have constructed in our previous paper \cite{Armand4} a natural invariant canonical probability measure of maximal Cohomological Entropy $ \nu_{h} $ such that ${\chi_{2l}^{-m}} (h^m)^\ast \Omega \to \nu_h \qquad \mbox{as} \quad m\to\infty$ for each smooth probability measure $\Omega $ in $\Vc$ . We have also studied the main stochastic properties of $ \nu_{h}$ and have shown that $ \nu_{h}$ is a smooth equilibrium measure , ergodic, mixing, K-mixing, exponential-mixing. In this paper we are interested on equidistribution problems and we show in particular that $ \nu_{h}$ reflects a property of equidistribution of periodic points by setting out the Third and Fourth Main Results in our study. Finally we conjecture that $$\nu_h:=T_l^+ \wedge T_{k-l}^-,$$ $$\dim_\HH(\nu_h)= \Psi h_{\chi}(h) , $$ $$\dim_\HH( \mbox{Supp} T_l^+) \geq 2(k-l) + \frac{\log \chi_{2l}}{\psi_l},$$ $$|\langle \nu_m^x-\nu_h,\zeta\rangle|\leq M \Big[1+\log^+{1\over D(x,\Tc)}\Big]^{\beta/2}\|\zeta\|_{\Cc^\beta} \gamma^{-\beta m/2}$$ and $$|\langle \nu_m^x-\nu_h,\zeta\rangle|\leq M \Big[1 +\log^+{1\over D(x,E_\gamma)}\Big]^{\beta/2}\|\zeta\|_{\Cc^\beta} \gamma^{-\beta m/2}.$$

The coronavirus disease 2019 (COVID-19) is the fastest transmittable virus caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). The detection of COVID-19 using artificial intelligence techniques and especially deep learning will help to detect this virus in early stages which will reflect in increasing the opportunities of fast recovery of patients worldwide. This will lead to release the pressure off the healthcare system around the world. In this research, classical data augmentation techniques along with CGAN based on a deep transfer learning model for COVID-19 detection in chest CT scan images will be presented. The limited benchmark datasets for covid-19 especially in chest CT images is the main motivation of this research. The main idea is to collect all the possible images for covid-19 that exists until the very writing of this research and use the classical data augmentations along with CGAN to generate more images to help in the detection of the COVID-19. In this study, five different deep convolutional neural network-based models (AlexNet, VGGNet16, VGGNet19, GoogleNet, and ResNet50) have been selected for the investigation to detect the coronavirus infected patient using chest CT radiographs digital images. The classical data augmentations along with CGAN improve the performance of classification in all selected deep transfer models. The Outcomes show that ResNet50 is the most appropriate deep learning model to detect the COVID-19 from limited chest CT dataset using the classical data augmentation with testing accuracy of 82.91%.

We know that the classical Mittag-Leffler function play an important role as solution of fractional order differential and integral equations. We introduce the j-generalized p - k Mittag-Leffler function. We evaluate the second order differential recurrence relation and four different integral representations and introduce a homogeneous linear differential equation whose one of the solution is the j-generalized p-k Mittag-Leffler function. Also we evaluate the certain relations that exist between j-generalized p - k Mittag-Leffler function and Riemann-Liouville fractional integrals and derivatives. We evaluate Mellin-Barnes integral representation of j-generalized p-k Mittag-Le er Function. The relationship of j-generalized p-k Mittag-Leffler Function with Fox H-Function and Wright hypergeometric function is also establish. we obtained its Euler transform, Laplace Transform and Mellin transform. Finally we derive some particular cases.

Noise reduction in medical images is a perplexing undertaking for the researchers in digital image processing. Noise generates maximum critical disturbances as well as touches the medical images quality, ultrasound images in the field of biomedical imaging. The image is normally considered as gathering of data and existence of noises degradation the image quality. It ought to be vital to reestablish the original image noises for accomplishing maximum data from images. Medical images are debased through noise through its transmission and procurement. Image with noise reduce the image contrast and resolution, thereby decreasing the diagnostic values of the medical image. This paper mainly focuses on Gaussian noise, Pepper noise, Uniform noise, Salt and Speckle noise. Different filtering techniques can be adapted for noise declining to improve the visual quality as well as reorganization of images. Here four types of noises have been undertaken and applied on medical images. Besides numerous filtering methods like Gaussian, median, mean and Weiner applied for noise reduction as well as estimate the performance of filter through the parameters like mean square error (MSE), peak signal to noise ratio (PSNR), Average difference value (AD) and Maximum difference value (MD) to diminish the noises without corrupting the medical image data.

The Coronavirus disease (COVID-19) caused by a novel coronavirus, SARS-CoV-2, has been declared as a global pandemic. Due to its infection rate and severity, it has emerged as one of the major global threats of the current generation. To support the current combat against the disease, this research aims to propose a Machine Learning based pipeline to detect the COVID-19 infection using the lung Computed Tomography scan images (CTI). This implemented pipeline consists of a number of sub-procedures ranging from segmenting the COVID-19 infection to classifying the segmented regions. The initial part of the pipeline implements the segmentation of the COVID-19 affected CTI using Social-Group-Optimization and Kapur’s Entropy thresholding, followed by k-means clustering and morphology-based segmentation. The next part of the pipeline implements feature extraction, selection and fusion to classify the infection. PCA based serial fusion technique is used in fusing the features and the fused feature vector is then employed to train, test and validate four different classifiers namely Random Forest, k-Nearest Neighbors (KNN), Support Vector Machine with Radial Basis Function, and Decision Tree. Experimental results using benchmark datasets show a high accuracy (> 91%) for the morphology-based segmentation task and for the classification task the KNN offers the highest accuracy among the compared classifiers (> 87%). However, this should be noted that this method still awaits clinical validation, and therefore should not be used to clinically diagnose the ongoing COVID-19 infection.

In this paper, inspired by Jleli and Samet [journal of inequalities and applications 38 (2014) 2 1–8] we introduce two new classes of auxiliary functions and utilize the same to define (q, y)R-weak 3 contractions. Utilizing (q, y)R-weak contractions, we prove some fixed point theorems in the setting 4 of relational metric spaces. We employ some examples to substantiate the utility of our newly proved 5 results. Finally, we apply one of our newly proved results to ensure the existence and uniqueness of 6 solution of a Volterra-type integral equation.

Background: World Health Organization (WHO) declared that COVID-19 as a pandemic on March 11, 2020. There is sudden need of statistical modeling due to onset of COVID-19 pandemic across the world. But health planning and policy requirements the estimates of disease problem form clinical data. Objective: To predict recovery rate, cases load rate on the basis of cumulative confirmed Novel Corona virus (NCV) cases, recovered cases and deaths form COVID-19 in India. Methods: The reported COVID-19 cases in the country were obtained from website (https://datahub.io/core/covid-19#resource-covid-19_zip/). The cumulative NCV confirmed cases; recovery cases and deaths were used for estimating recovery rate, cases load rate and death rate till date 24 April 2020. Results: A total of 24530 NCV confirmed cases were reported nationwide in India on 24 April 2020. It is found that the recovery rate increased 22% and case load rate decreased 74%. Death rate is found to be very low 3%. The difference of cases load rate and recovery rate (delta) coincide at 50 % then NCV cases expected would be declined. Conclusion: The epidemic in the country was mainly caused by the importation of India. Lockdown as restricting the migration of population and decided to quarantine of population may greatly reduce the risk of continued spread of the epidemic in India. This study predicts that by 20 May 2020, the cases load rate lesser than recovery rate there after COVID-19 patients would be started to reducing.

In a one price economy, the Fundamental Theorem of Asset Pricing (FTAP) establishes that no-arbitrage is equivalent to the existence of an equivalent martingale measure. Such an equivalent measure can be derived as the normal unit vector of the hyperplane that separates the attainable gain subspace and the convex cone representing arbitrage opportunities. However, in two-price financial models (where there is a bid-ask price spread), the set of attainable gains is not a subspace anymore. We use convex optimization, and the conic property of this region to characterize the “No-Arbitrage” principle in financial models with the bid-ask price spread present. This characterization will lead us to the generation of a set of price factor random variables. Under such a set, we can find the lower and upper bounds (supper-hedging and sub-hedging bounds) for the price of any future cash flow. We will show that for any given cash flow, for which the price is outside the above range, we can build a trading strategy that provides one with an arbitrage opportunity. We will generalize this structure to any two-price finite-period financial model.

Several epidemiological models are being used around the world to project the number of infected individuals and the mortality rates of the COVID-19 outbreak. Advancing accurate prediction models is of utmost importance to take proper actions. Due to a high level of uncertainty or even lack of essential data, the standard epidemiological models have been challenged regarding the delivery of higher accuracy for long-term prediction. As an alternative to the susceptible-infected-resistant (SIR)-based models, this study proposes a hybrid machine learning approach to predict the COVID-19 and we exemplify its potential using data from Hungary. The hybrid machine learning methods of adaptive network-based fuzzy inference system (ANFIS) and multi-layered perceptron-imperialist competitive algorithm (MLP-ICA) are used to predict time series of infected individuals and mortality rate. The models predict that by late May, the outbreak and the total morality will drop substantially. The validation is performed for nine days with promising results, which confirms the model accuracy. It is expected that the model maintains its accuracy as long as no significant interruption occurs. Based on the results reported here, and due to the complex nature of the COVID-19 outbreak and variation in its behavior from nation-to-nation, this study suggests machine learning as an effective tool to model the outbreak. This paper provides an initial benchmarking to demonstrate the potential of machine learning for future research.

Along with the Coronavirus pandemic, another crisis has manifested itself in the form of mass fear and panic phenomena, fuelled by incomplete and often inaccurate information. There is therefore a tremendous need to address and better understand COVID-19's informational crisis and gauge public sentiment, so that appropriate messaging and policy decisions can be implemented. In this research article, we identify public sentiment associated with the pandemic using Coronavirus specific Tweets and R statistical software, along with its sentiment analysis packages. We demonstrate insights into the progress of fear-sentiment over time as COVID-19 approached peak levels in the United States, using descriptive textual analytics supported by necessary textual data visualizations. Furthermore, we provide a methodological overview of two essential machine learning classification methods, in the context of textual analytics, and compare their effectiveness in classifying Coronavirus Tweets of varying lengths. We observe a strong classification accuracy of 91% for short Tweets, with the Naive Bayes method. We also observe that the logistic regression classification method provides a reasonable accuracy of 74% with shorter Tweets, and both methods showed relatively weaker performance for longer Tweets. This research provides insights into Coronavirus fear sentiment progression, and outlines associated methods, implications, limitations and opportunities.

Communication has never been more accessible than today. With the help of Instant messengers and Email Services, millions of people can transfer information with ease, and this trend has affected organizations as well. There are billions of organizational emails sent or received daily, and their main goal is to facilitate the daily operation of organizations. Behind this vast corpus of human-generated content, there is much implicit information that can be mined and used to improve or optimize the organizations’ operations. Business processes are one of those implicit knowledge areas that can be discovered from Email logs of an Organization, as most of the communications are followed inside Emails. The purpose of this research is to propose an approach to discover the process models in the Email log. In this approach, we combine two tools, supervised machine learning and process mining. With the help of supervised machine learning, fastText classifier, we classify the body text of emails to the activity-related. Then the generated log will be mined with process mining techniques to find process models. We illustrate the approach with a case study company from the oil and gas sector.

In this paper we introduce the Umbrella function and its recurrence relations. Also we provide the integral representation for the this newly defined function.

Photogrammetry involves aerial photography of the earth’s surface and subsequently processing the images to provide a more accurate depiction of the area (Orthophotography). It’s used by the Spanish Instituto Geográfico Nacional to update road cartography but requires a significant amount of manual labor due to the need to perform visual inspection of all tiled images. Deep Learning techniques (artificial neural networks with more than one hidden layer) can perform road detection but it is still unclear how to find the optimal network architecture. Our system applies grammar guided genetic programming to the search of deep neural network architectures. In this kind of evolutive algorithm all the population individuals (here candidate network architectures) are constrained to rules specified by a grammar that defines valid and useful structural patterns to guide the search process. Grammar used includes well-known complex structures (e.g. Inception-like modules) combined with a custom designed mutation operator (dynamically links the mutation probability to structural diversity). Pilot results show that the system is able to design models for road detection that obtain test accuracies similar to that reached by state of the art models when evaluated over a dataset from the Spanish National Aerial Orthophotography Plan.

In this paper we introduce the New/Generalized two parameter Gamma function and Pochhammer symbol. We named them, as Generalized p - k Gamma Function and Generalized p - k Pochhammer symbol and denoted as $ _{p}^{a}\Gamma_{k}(x) $ and $ _{p}^{a}(x)_{n,k} $ respectively. We prove the several identities for $ _{p}^{a}\Gamma_{k}(x) $ and $ _{p}^{a}(x)_{n,k} $ those satisfied by the classical Gamma function. Also we provide the integral representation for the $ _{p}^{a}\Gamma_{k}(x) $

Let $f:V\rightarrow V $ be a Cohomological Expanding Mapping¹ of a smooth complex compact homogeneous manifold with dim_C(V) = k ≥ 1 and Kodaira Dimension $\leq 0$. We study the dynamics of such mapping from a probabilistic point of view, that is, we describe the asymptotic behavior of the orbit $ O_{f} (x) = \{f^{n} (x), n \in \mathbb{N} \quad \mbox{or}\quad \mathbb{Z}\}$ of a generic point. Using pluripotential methods, we construct a natural invariant canonical probability measure of maximum Cohomological Entropy $ \mu_{f} $ such that ${\chi_{2l}^{-m}} (f^m)^\ast \Omega \to \mu_f \qquad \mbox{as} \quad m\to\infty$ for each smooth probability measure $\Omega $ on V . Then we study the main stochastic properties of $ \mu_{f}$ and show that $ \mu_{f}$ is a measure of equilibrium, smooth, ergodic, mixing, K-mixing, exponential-mixing and the unique measure with maximum Cohomological Entropy. We also conjectured that $\mu_f:=T_l^+ \wedge T_{k-l}^-$, $\dim_\H(\mu_f)= \Psi h_{\chi}(f) $ and $\dim_\H( \mbox{Supp} T_l^+) \geq 2(k-l) + \frac{\log \chi_{2l}}{\psi_l}.$

Reverse order laws for generalized inverses of matrix products is a classic object of study in the theory of generalized inverses. One of the well-known reverse order laws for a matrix product $AB$ is $(AB)^{(i,\ldots,j)} = B^{(s_2,\ldots,t_2)}A^{(s_1,\ldots,t_1)}$, where $(\cdot)^{(i,\ldots,j)}$ denotes an $\{i,\ldots, j\}$-generalized inverse of matrix. Because $\{i,\ldots, j\}$-generalized inverse of a singular matrix is unique, the relationships between both sides of the reverse order law can be divided into four situations for consideration. This paper provides a thorough coverage of the reverse order laws for $\{i,\ldots, j\}$-generalized inverses of $AB$, from the development of background and preliminary tools to the collection of miscellaneous formulas and facts on the reverse order laws in one place with cogent introduction and references for further study. We begin with the introduction of a linear mixed model $y = AB\beta + A\gamma + \epsilon$ and the presentation of two least-squares methodologies to estimate the fixed parameter vector $\beta$ in the model, and the description of connections between the two types of least-squares estimators and the reverse order laws for generalized inverses of $AB$. We then prepare some valued matrix analysis tools, including a general theory on linear or nonlinear matrix identities, a group of expansion formulas for calculating ranks of block matrices, two groups of explicit formulas for calculating the maximum and minimum ranks of $B^{(s_2,\ldots,t_2)}A^{(s_1,\ldots,t_1)}$, as well as necessary and sufficient conditions for $B^{(s_2,\ldots,t_2)}A^{(s_1,\ldots,t_1)}$ to be invariant with respect to the choice of $B^{(s_2,\ldots,t_2)}A^{(s_1,\ldots,t_1)}$. We then present a unified approach to the 512 matrix set inclusion problems associated with the above reverse order laws for the eight commonly-used types of generalized inverses of $A$, $B$, and $AB$ through use of the definitions of generalized inverses, the block matrix method (BMM), the matrix rank method (MRM), the matrix equation method (MEM), and various algebraic calculations of matrices.

The coronavirus disease 2019 (COVID-19) is the fastest transmittable virus caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). The detection of COVID-19 using artificial intelligence techniques and especially deep learning will help to detect this virus in early stages which will reflect in increasing the opportunities of fast recovery of patients worldwide. This will lead to release the pressure off the healthcare system around the world. In this research, classical data augmentation techniques along with CGAN based on a deep transfer learning model for COVID-19 detection in chest CT scan images will be presented. The limited benchmark datasets for covid-19 especially in chest CT images is the main motivation of this research. The main idea is to collect all the possible images for covid-19 that exists until the very writing of this research and use the classical data augmentations along with CGAN to generate more images to help in the detection of the COVID-19. In this study, five different deep convolutional neural network-based models (AlexNet, VGGNet16, VGGNet19, GoogleNet, and ResNet50) have been selected for the investigation to detect the coronavirus infected patient using chest CT radiographs digital images. The classical data augmentations along with CGAN improve the performance of classification in all selected deep transfer models. The Outcomes show that ResNet50 is the most appropriate classifier to detect the COVID-19 from chest CT dataset using the classical data augmentation and CGAN with testing accuracy of 82.91%.

The detection performance of small objects in remote sensing images has not been satisfactory compared to large objects, especially in low-resolution and noisy images. A generative adversarial network (GAN)-based model called enhanced super-resolution GAN (ESRGAN) showed remarkable image enhancement performance, but reconstructed images usually miss high-frequency edge information. Therefore, object detection performance showed degradation for small objects on recovered noisy and low-resolution remote sensing images. Inspired by the success of edge enhanced GAN (EEGAN) and ESRGAN, we applied a new edge-enhanced super-resolution GAN (EESRGAN) to improve the quality of remote sensing images and used different detector networks in an end-to-end manner where detector loss was backpropagated into the EESRGAN to improve the detection performance. We proposed an architecture with three components: ESRGAN, EEN, and Detection network. We used residual-in-residual dense blocks (RRDB) for both the ESRGAN and EEN, and for the detector network, we used a faster region-based convolutional network (FRCNN) (two-stage detector) and a single-shot multibox detector (SSD) (one stage detector). Extensive experiments on a public (car overhead with context) dataset and another self-assembled (oil and gas storage tank) satellite dataset showed superior performance of our method compared to the standalone state-of-the-art object detectors.

Graph theory plays significant role in every field of science as well as technology. Every situation can be articulated in terms of suitable graphs by using various approaches of graph theory. Considering the recent pandemic in the world and the precautions taken for prevention of the COVID 19, it is the most appropriate way to exercise the graph models with theoretical as well as practical aspects to control this epidemic. This paper defines the variable set, variable graphs and their types with respect to variable vertex sets and variable edge sets. Depending upon the nature of the pandemic, there are four types of Virus graphs. Virus graph I and III are not so perilous for all living beings. Although, Virus graphs II and IV are extremely hazardous for the harmony of the world. In view of different aspects for expand of pandemic, growth types of virus graphs are divided in 1-1, 1-P and 1-all growth types. The COVID19 initially was in Virus graph-I type, but presently it is in Virus graph-II types. We present the table involving the number of infected people after n days with respect to different values of P and growth rates with I0 = 100. Moreover, the country wise starting dates of stages of the virus graph-I and II are specified. The concept of cut sets is applicable for prevention of COVID19 and the whole world is using the same analogy.

In Ultra-wideband (UWB)-based wireless ranging or distance measurement, differentiation between line-of-sight~(LOS), non-line-of-sight~(NLOS), and multi-path (MP) conditions are important for precise indoor localization. This is because the accuracy of the reported measured distance in UWB ranging systems is directly affected by the measurement conditions (LOS, NLOS or MP). However, the major contributions in literature only address the binary classification between LOS and NLOS in UWB ranging systems. The MP condition is usually ignored. In fact, the MP condition also has a significant impact on the ranging errors of the UWB compared to the direct LOS measurement results. Though, the magnitudes of the error contained in MP conditions are generally lower than completely blocked NLOS scenarios. This paper addresses machine learning techniques for identification of the mentioned three classes (LOS, NLOS, and MP) in the UWB indoor localization system using an experimental data-set. The data-set was collected in different conditions at different scenarios in indoor environments. Using the collected real measurement data, we compare three machine learning (ML) classifiers, i.e., support vector machine (SVM), random forest (RF) based on an ensemble learning method, and multilayer perceptron (MLP) based on a deep artificial neural network, in terms of their performance. The results show that applying ML methods in UWB ranging systems are effective in identification of the above-mentioned three classes. In specific, the overall accuracy reaches up to 91.9% in the best-case scenario and 72.9% in the worst-case scenario. Regarding the F1-score, it is 0.92 in the best-case and 0.69 in the worst-case scenario. For reproducible results and further exploration, we (will) provide the publicly accessible experimental research data discussed in this paper at PUB - Publications at Bielefeld University. The evaluations of the three classifiers are conducted using the open-source python machine learning library scikit-learn.

Coronavirus, also known as COVID-19, has spread to several countries around the world. It was announced as a pandemic disease by The World Health Organization (WHO) in 2020 for its devastating impact on humans. With the advancements in computer science algorithms, the detection of this type of virus in the early stages is urgently needed for the fast recovery of patients. In this paper, a study of neutrosophic set significance on deep transfer learning models over a limited COVID-19 chest x-ray dataset will be presented. The study relies on neutrosophic set theory, as it shows a huge potential for solving many computers problems related to the detection, and the classification domains. The neutrosophic set in this study is used for converting the medical images from the grayscale spatial domain to the neutrosophic domain. The neutrosophic domain consists of three types of images and they are, the True (T) images, the Indeterminacy (I) images, and the Falsity (F) images. The dataset used in this research has been collected from different sources as there is no benchmark dataset for COVID-19 chest X-ray until the writing of this research. The dataset consists of four classes and they are COVID-19, Normal, Pneumonia bacterial, and Pneumonia virus. The selected deep learning models for investigation are Alexnet, Googlenet, and Restnet18. Those models are selected as they have a small number of layers on their architectures. To test the performance of the conversion to the neutrosophic domain, 36 experimental trails have been conducted and presented. A combination of training and testing strategies have been applied into dataset by splitting it to (90%-10%, 80%-20%, and 70%-30%) accordingly. According to the experimental results, the Indeterminacy (I) neutrosophic domain achieves the highest accuracy possible in the testing accuracy and performance metrics such as Precision, Recall, and F1 Score. The study concludes that using the neutrosophic set with deep learning models may be an encouraging transition to achieve higher testing accuracy, especially with limited datasets such as COVID-19 chest x-ray dataset which is investigated throughout this study

The very first case of corona-virus illness was recorded on 30 January 2020, in India and the number of infected cases, including the death toll, continues to rise. In this paper, we present short-term forecasts of COVID-19 for 28 Indian states and five union territories using real-time data from 30 January to 20May 2020. Applying Holt’s second-order exponential smoothing method and autoregressive integrated moving average (ARIMA) model, we generated 10-day ahead forecasts of the likely number of infected cases and deaths in India until 29 May2020. Our results show that the number of cumulative cases in India will rise to169109 [PI 95% (14426, 19455)], concurrently the number of deaths may increase to 4863 [PI 95% (4221, 5551)] by 29 May 2020.Further, we have marked the states (e.g. Delhi, Uttar Pradesh, Rajasthan, Madhya Pradesh, Maharashtra, Gujarat, and Tamil Nadu) where outburst is expected by considering the cases above three standard deviations. Under the worst-case scenario, Maharashtra is likely to be the most affected state with around 62628 [PI 95% (52840, 73555)] cumulative cases by 29 May 2020. However, Kerala and Karnataka are likely to remain in the lesser affected region. The presented results mark the states where lockdown by 1 June2020, can be loosened.

Kim(2015) introduced the degenerate Cauchy numbers of the second kind and gave some identities of them. In this paper, by using the modified polyexponential functions which are introduced by Kim-Kim(2019), we define the degenerate poly-Cauchy polynomials of the second kind and investigate some properties of them. Furthermore, we consider the degenerate unipoly-Cauchy polynomials of the second kind and discuss some properties of them.

Cyber security has recently received enormous attention in today’s security concerns, due to the popularity of the Internet-of-Things (IoT), the tremendous growth of computer networks, and the huge number of relevant applications. Thus, detecting various cyber-attacks or anomalies in a network and building an effective intrusion detection system that performs an essential role in today’s security is becoming more important. Artificial intelligence, particularly machine learning techniques, can be used for building such a data-driven intelligent intrusion detection system. In order to achieve this goal, in this paper, we present an Intrusion Detection Tree (“IntruDTree”) machine-learning-based security model that first takes into account the ranking of security features according to their importance and then build a tree-based generalized intrusion detection model based on the selected important features. This model is not only effective in terms of prediction accuracy for unseen test cases but also minimizes the computational complexity of the model by reducing the feature dimensions. Finally, the effectiveness of our IntruDTree model was examined by conducting experiments on cybersecurity datasets and computing the precision, recall, fscore, accuracy, and ROC values to evaluate. We also compare the outcome results of IntruDTree model with several traditional popular machine learning methods such as the naive Bayes classifier, logistic regression, support vector machines, and k-nearest neighbor, to analyze the effectiveness of the resulting security model.

The world has been evolving with new technologies and advances day-by-day. With the advent of various learning technologies in every field, the research community is able to provide solution in every aspect of life with the applications of Artificial Intelligence, Machine Learning, Deep Learning, Computer Vision, etc. However, with such high achievements, it is found to lag behind the ability to provide explanation against its prediction. The current situation is such that these modern technologies are able to predict and decide upon various cases more accurately and speedily than a human, but failed to provide an answer when the question of why to trust its prediction is put forward. In order to attain a deeper understanding into this rising trend, we explore a very recent and talked-about novel contribution which provides rich insight on a prediction being made -- ``Explainability.'' The main premise of this survey is to provide an overview for researches explored in the domain and obtain an idea of the current scenario along with the advancements published to-date in this field. This survey is intended to provide a comprehensive background of the broad spectrum of Explainability.

This study explores students’ understanding of one measure of central tendency, the mean. A teaching experiment was conducted to understand how sixth-grade students made sense of this concept. Findings suggest that the students know how to solve mathematical problems related to mean using procedural understanding and lack of conceptual understanding.

COVID-19 was first identified in Wuhan, China in December 2019 and has caused huge death and has spread to almost all the parts of the world. There are speculation that most of the world economy and financial markets would be affected due to lockdown and social distancing. The first case of COVID-19 was first identified in Nigeria on 27th February 2020 and this study examines the effect of COVID-19 outbreak on the performance of the Nigeria stock exchange using historical data covering 2nd March 2015 to 16th April, 2020 sourced from a secondary source. This study considered the COVID-19 period from 2nd January 2020 to 16th April 2020, the results revealed a loss in stock returns and high volatility in stock returns under the COVID-19 period in Nigeria as against the normal period under study. In addition, Quadratic GARCH (QGARCH) and Exponential GARCH (EGARCH) models with dummy variable were applied to the stock returns shows that the COVID-19 has had negative effect on the stock returns in Nigeria. The study recommended that political and economic policy such as stable political environment, incentive to indigenous companies, diversification of the economy, flexible exchange rate regime be implemented so as to improve the financial market and to attract more and new investors to the Nigerian Stock Exchange.

In this paper, closed forms of the sum formulas $\sum_{k=0}^{n}x^{k}W_{k}^{3}$ and $\sum_{k=1}^{n}x^{k}W_{-k}^{3}$ for the cubes of generalized Fibonacci numbers are presented. As special cases, we give sum formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers.

Upper confidence bound multi-armed bandit algorithms (UCB) typically rely on concentration in- equalities (such as Hoeffding’s inequality) for the creation of the upper confidence bound. Intu- itively, the tighter the bound is, the more likely the respective arm is or isn’t judged appropriately for selection. Hence we derive and utilise an optimal inequality. Usually the sample mean (and sometimes the sample variance) of previous rewards are the information which are used in the bounds which drive the algorithm, but intuitively the more infor- mation that taken from the previous rewards, the tighter the bound could be. Hence our inequality explicitly considers the values of each and every past reward into the upper bound expression which drives the method. We show how this UCB method fits into the broader scope of other information theoretic UCB algorithms, but unlike them is free from assumptions about the distribution of the data, We conclude by reporting some already established regret information, and give some numerical simulations to demonstrate the method’s effectiveness.

The recent worldwide outbreak of the novel corona-virus (COVID-19) opened up new challenges to the research community. Artificial intelligence (AI) driven methods can be useful to predict the parameters, risks, and effects of such an epidemic. Such predictions can be helpful to control and prevent the spread of such diseases. The main challenges of applying AI is the small volume of data and the uncertain nature. Here, we propose a shallow Long short-term memory (LSTM) based neural network to predict the risk category of a country. We have used a Bayesian optimization framework to optimized and automatically design country-specific networks. We have combined the trend data and weather data together for the prediction. The results show that the proposed pipeline outperforms against state-of-the-art methods for 170 countries data and can be a useful tool for such risk categorization. The tool can be used to predict long-duration outbreak of such an epidemic such that we can take preventive steps earlier.

In the field of stochastic optimisation, the so-called structural bias constitutes an undesired behaviour of an algorithm that is unable to explore the search space to a uniform extent. In this paper, we investigate whether algorithms from a subclass of estimation of distribution algorithms, the compact algorithms, exhibit structural bias. Our approach, justified in our earlier publications, is based on conducting experiments on a test function whose values are uniformly distributed in its domain. For the experiment, 81 combinations of compact algorithms and strategies of dealing with infeasible solutions have been selected as test cases. We have applied two approaches for determining the presence and severity of structural bias, namely a visual and a statistical (Anderson-Darling) tests. Our results suggest that compact algorithms are more immune to structural bias than their counterparts maintaining explicit populations. Both tests indicate that strong structural bias is found only in one of the algorithms (cBFO) regardless of the choice of strategy of dealing with infeasible solutions and cPSO mirror. For other test cases, statistical and visual tests disagree on some cases classified as having mild or strong structural bias: the former one tends to make harsher decisions, thus needing further investigation.

A nonlinear singularly perturbed Cauchy problem with confluent fuchsian singularities is examined. This problem involves coefficients with polynomial dependence in time. A similar initial value problem with logarithmic reliance in time has been investigated by the author in a recent work, for which sets of holomorphic inner and outer solutions were built up and expressed as a Laplace transform with logarithmic kernel. Here, a family of holomorphic inner solutions are constructed by means of exponential transseries expansions containing infinitely many Laplace transforms with special kernel. Furthermore, asymptotic expansions of Gevrey type for these solutions relatively to the perturbation parameter are established.

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. We prove the Riemann hypothesis using the Complexity Theory. Number theory is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. The Goldbach's conjecture is one of the most important and unsolved problems in number theory. Nowadays, it is one of the open problems of Hilbert and Landau. We show the Goldbach's conjecture is true using the Complexity Theory as well. An important complexity class is 1NSPACE(S(n)) for some S(n). These mathematical proofs are based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.

An oil and vinegar scheme is a signature scheme based on multivariate quadratic polynomials over finite fields. The system of polynomials contains $n$ variables, divided into two groups: $v$ vinegar variables and $o$ oil variables. The scheme is called balanced (OV) or unbalanced (UOV), depending on whether $v = 0$ or not, respectively. These schemes are very fast and require modest computational resources, which make them ideal for low-cost devices such as smart cards. However, the OV scheme has been already proven to be insecure and the UOV scheme has been proven to be very vulnerable for many parameter choices. In this paper, we propose a new multivariate public key signature whose central map consists of a set of polynomials obtained from the multiplication of block matrices. Our construction is motivated by the design of the Simple Matrix Scheme for Encryption and the UOV scheme. We show that it is secure against the Separation Method, which can be used to attack the UOV scheme, and against the Rank Attack, which is one of the deadliest attacks against multivariate public-key cryptosystems. Some theoretical results on matrices with polynomial entries are also given, to support the construction of the scheme.