One of the special trends in health care is the increasing availability of data and services to the cloud, especially for convenience (for example, providing a complete patient medical record without interruption) and savings (for example, economic issues). Management of health care data). However, there are limitations to using common cryptographic prototypes and access control models to address security and privacy concerns in an increasingly cloudy environment. In this paper, we explore the potential and capacity of using China's Blockchain technology to protect health care data hosted in the cloud. We also explain the real challenges of such an approach and further research is needed. Health care is a highly data-dependent domain, with large amounts of data being created, published, stored and accessed daily. For example, data are created when a patient undergoes a number of examinations (such as computed tomography or computed tomography scans) and the data need to be sent to the radiologist and then to a physician. The visit results are then stored in the hospital, and then need to be accessed later by another physician at another hospital within the network. It is clear that technology can play an important role in improving the quality of care for patients (for example, using data analytics to make informed medical decisions) and potentially costing more by allocating resources more efficiently in terms of personnel, equipment, etc. , Reduce. For example, paper-based data extraction is difficult to extract into systems (for example, it is costly and may involve data entry errors), archiving them and accessing them as needed is costly. These challenges may cause medical decisions to be incomplete, requiring repeated tests for missing information or missing data stored in another hospital in another state or country (at the expense of increased costs and no convenience). (For patients) and so on. Because of the nature of the industry, it is important to ensure the security, privacy and integrity of health care data. As a result, there is definitely a need for a secure and secure data management system.

In this paper, we consider the problem that the maximal order consider the groups that consisting of transformations we called NG-Transformation on a nonempty set A has no bijection as its element. We find the order of these groups not greater that (n-1)!. In addition, we will prove our result by showing that any kind of NG-group in the theorem be isomorphic to a permutation group on a quotient set of A with respect to an equivalence relation on A.

Maximum likelihood estimation (MLE) is a popular method for parameter estimation in both applied probability and statistics but MLE cannot solve the problem of incomplete data or hidden data because it is impossible to maximize likelihood function from hidden data. Expectation maximum (EM) algorithm is a powerful mathematical tool for solving this problem if there is a relationship between hidden data and observed data. Such hinting relationship is specified by a mapping from hidden data to observed data or by a joint probability between hidden data and observed data. In other words, the relationship helps us know hidden data by surveying observed data. The essential ideology of EM is to maximize the expectation of likelihood function over observed data based on the hinting relationship instead of maximizing directly the likelihood function of hidden data. Pioneers in EM algorithm proved its convergence. As a result, EM algorithm produces parameter estimators as well as MLE does. This tutorial aims to provide explanations of EM algorithm in order to help researchers comprehend it. Moreover some improvements of EM algorithm are also proposed in the tutorial such as combination of EM and third-order convergence Newton-Raphson process, combination of EM and gradient descent method, and combination of EM and particle swarm optimization (PSO) algorithm.

In this paper, we study the Parisian time of a reflected Brownian motion with drift on a finite collection of rays. We derive the Laplace transform of the Parisian time using a recursive method, and provide an exact simulation algorithm to sample from the distribution of the Parisian time. The paper is motivated by the settlement delay in the real-time gross settlement (RTGS) system. Both the central bank and the participating banks in the system are concerned about the liquidity risk, and are interested in the first time that the duration of settlement delay exceeds a predefined limit, we reduce this problem to the calculation of the Parisian time. The Parisian time is also crucial in the pricing of Parisian type options; to this end, we will compare our results with the existing literature.

In this article, we introduce the concept of soft intervals, soft ordering and sequences of soft real numbers and study their properties and some interesting results. Also the notion of soft Lebesgue measure on the soft real numbers has been introduced. A correspondence relationship between the soft Lebesgue measure and the Lebesgue measure has been established.

The COVID-19 pandemic has wreaked havoc on the whole world, taking over half a million lives and capsizing the world economy in unprecedented magnitudes. With the world scampering for a vaccine, early detection and containment is the only redress. Existing diagnostic technologies with high accuracy like RT-PCRs are expensive and sophisticated, requiring skilled individuals for specimen collection and screening, resulting in lower outreach. So, methods excluding direct human intervention are much sought after, and artificial intelligence-driven automated diagnosis, especially with radiography images, captured the researchers' interest. This survey marks a detailed inspection of the deep-learning-based automated detection of COVID-19 works done to date, a comparison of the available datasets, methodical challenges like imbalanced datasets, and others, along with probable solutions with different pre-processing methods, and scopes of future exploration in this arena. We also benchmarked the performance of 315 deep models in diagnosing COVID-19, Normal, and Pneumonia from x-ray images of a custom dataset created from four others. The dataset is publicly available at https://github.com/rgbnihal2/COVID-19-X-ray-Dataset. Our results show that DenseNet201 model with Quadratic SVM classifier performs the best (accuracy: 98.16%, sensitivity: 98.93%, specificity: 98.77%) and maintains high accuracies in other similar architectures as well. This proves that even though radiography images might not be conclusive for radiologists, but it is so for deep learning algorithms for detecting COVID-19. We hope this extensive review will provide a comprehensive guideline for researchers in this field.

We continue to analyze basic constraints on human's decision making from the viewpoint of quantum measurement theory (QMT). As has been found, the conventional QMT based on the projection postulate cannot account for combination of the question order effect (QOE) and the response replicability effect (RRE). This was an alarm signal for quantum-like modeling of decision making. Recently, it was shown that this objection to quantum-like modeling can be removed on the basis of the general QMT based on quantum instruments. In the present paper we analyse the problem of combination of QOE, RRE, and the famous QQ-equality (QQE). This equality was derived by Busemeyer and Wang and it was shown (in the joint paper with Solloway and Shiffrin) that statistical data from many social opinion polls satisfies it. Now, we construct quantum instruments satisfying QOE, RRE, and QQE. The general features of our approach are formalized with postulates which generalize {\it Wang-Busemeyer} postulates for quantum-like modeling of decision making. Moreover, we show that our model closely reproduces the statistics of the famous Clinton-Gore Poll data with a prior belief state independent of the question order. This model successfully removes the order effect from the data to determine the genuine distribution of the opinions in the Poll. The paper also provides a psychologist-friendly introduction to the theory of quantum instruments - the most general mathematical framework for quantum measurements. We hope that this theory will attract attention of psychologists and will stimulate further applications.

Reliability analysis techniques are customary standard tools that are used for evaluating the performance of different equipment and devices in order to minimize their downtime. To predict the reliability, life data from a sample that is satisfactorily representative of the equipment should be fitted to the suitable statistical distribution. The parameterized distribution may be used to estimate essential characteristics such as failure rate; and probability at a precise time, as well as system reliability. In the current study, Weibull++/ALTA software package is used as a novel tool to fit the available data set to estimate the best fitted probability density function (PDF) using Maximum Likelihood (MLE) for parameter estimation. The determined distributions are then assessed using goodness-of-fit test to define how well it fits the available data set. There are multiple methods for determining goodness-of-fit. Weibull distributions and their special cases’ parameters have an effect on life times.

In the present, the growth of digitization and worldwide communications make OCR systems of exotic languages a very important task. In this paper, we attempt to develop an OCR system for one of these exotic languages with a unique script, Amharic. Motivated by the recent success of the Attention mechanism in Neural Machine Translation (NMT), we extend the attention mechanism for Amharic text-image recognition. The proposed model consists of CNNs and attention embedded recurrent encoder-decoder networks that are integrated following the configuration of the seq2seq framework. The attention network parameters are trained in an end-to-end fashion and the context vector is injected, with the previously predicted output, at each time steps of decoding. Unlike the existing OCR model that minimizes the CTC objective function, the new model minimizes the categorical cross-entropy loss. The performance of the proposed attention-based model is evaluated against the test dataset from the ADOCR database which consists of both printed and synthetically generated Amharic text-line images and achieved promising results with a CER of 1.54% and 1.17% respectively.

This paper presents a numerical algorithm for solving high-order BVPs. We introduce the construction method of multiscale orthonormal basis in W^m[0; 1] by multiscale orthonormal basis in W¹[0; 1]. We define approximate solution, and obtain the approximate solution of high-order BVPs by using the approximate theory. Moreover, the convergence and stability of the algorithm are improved. At last, several numerical experiments show the feasibility of the proposed method.

Malware analysis is fundamental for defending against prevalent cyber security threats, and requires a means to deploy and study behavioural software traits as more sophisticated malware is developed. Traditionally, virtual machines are used to provide an environment that is isolated from production systems so as to not cause any adverse impact on existing infrastructure. Malware developers are fully aware of this and so will often develop evasion techniques to avoid detection within sandbox environments. In this paper, we conduct an investigation into anti-evasion malware triggers for uncovering malware behaviours that may act benign when they detect a traditional sandbox environment. To facilitate our investigation, we developed a dynamic sandbox reconfiguration tool called MORRIGU that couples together both automated and human-driven analysis for anti-evasion configuration testing, along with a visual analytics view for examining system behaviours and performing comparative analysis. Our study reveals a variety of anti-evasion traits that are shared amongst different malware families, such as sandbox `wear-and-tear’, and Reverse Turing Tests (RTT), as well as more sophisticated malware samples that require multiple anti-evasion checks to be deployed. Using a systematic testing approach such as MORRIGU enables test coverage of anti-evasion methods, whilst also offering flexibility for further human-driven analysis of additional evasion methods. We also perform a comparative study against automated analysis using Cuckoo sandbox to show that automated scoring alone can not reliably inform on the presence of evasive malware, hence requiring a more sophisticated anti-evasive testing approach. With a greater understanding of anti-evasion malware triggers and with appropriate tools to explore these in an effective and efficient manner, this study helps to advance research on how evasive malware is being utilised to evade analysis so that we can better defend against future attacks.

model checking techniques are often used for the verification of software systems. Such techniques are accompanied with several advantages. However, state space explosion is one of the drawbacks to model checking. During recent years, several methods have been proposed based on evolutionary and meta-heuristic algorithms to solve this problem. In this paper, a hybrid approach is presented to cope with the SSE problem in model checking of systems modeled by GTS with an ample state space. Most of existence proposed methods that aim to verify systems are applied to detect deadlocks by graph transformations. The proposed approach is based on the fuzzy genetic algorithm and is designed to decline the safety property by verifying the reachability property and detecting deadlocks. In this solution, the state space of the system is searched by a fuzzy genetic algorithm to find the state in which the specified property is refuted/verified. To implement and evaluate the suggested approach, GROOVE is used as a powerful designing and model checking toolset in GTS. The experimental results indicate that the presented hybrid fuzzy method improves speed and performance by comparing other techniques

Several studies suggest that COVID-19 may be accompanied by symptoms such as a dry cough, muscle aches, sore throat, and mild to moderate respiratory illness. The symptoms of this disease indicate the fact that COVID-19 causes noticeable negative effects on the lungs. Therefore, considering the health status of the lungs using X-rays and CT scans of the chest can significantly help diagnose COVID-19 infection. Due to the fact that most of the methods that have been proposed to COVID-19 diagnose deal with the lengthy testing time and also might give more false positive and false negative results, this paper aims to review and implement artificial intelligence (AI) image-based diagnosis methods in order to detect coronavirus infection with zero or near to zero false positives and false negatives rates. Besides the already existing AI image-based medical diagnosis method for the other well-known disease, this study aims on finding the most accurate COVID-19 detection method among AI methods such as machine learning (ML) and artificial neural network (ANN), ensemble learning (EL) methods.

Tracking information diffusion is a non-trivial task and it has been widely studied across different domains and platforms. The advent of social media has led to even more challenges, given the higher speed of information propagation and the growing impact of social bots and anomalous accounts. Nevertheless, it is crucial to derive a trustworthy information diffusion graph, which is capable of highlighting the importance of specific nodes in spreading the original message. The paper introduces the interaction strength, a novel metric to model retweet cascade graphs by exploring users’ interactions. Initial findings show the soundness of the approaches based on this new metric with respect to the state-of-the-art model, and its ability to generate a denser graph, revealing crucial nodes that participated in the retweet propagation. Reliable retweet graph generation will enable a better understanding of the diffusion path of a specific tweet.

Nowadays, model checking is applied as an accurate technique to verify software systems. The main problem of model checking techniques is the state space explosion. This problem occurs due to the exponential memory usage by the model checker. In this situation, using meta-heuristic and evolutionary algorithms to search for a state in which a property is satisfied/violated is a promising solution. Recently, different evolutionary algorithms like GA, PSO, etc. are applied to find deadlock state. Even though useful, most of them are concentrated on finding deadlock. This paper proposes a fuzzy algorithm in order to analyze reachability properties in systems specified through GTS with enormous state space. To do so, we first extend the existing PSO algorithm (for checking deadlocks) to analyze reachability properties. Then, to increase the accuracy, we employ a Fuzzy adaptive PSO algorithm to determine which state and path should be explored in each step to find the corresponding reachable state. These two approaches are implemented in an open-source toolset for designing and model checking GTS called GROOVE. Moreover, the experimental results indicate that the hybrid fuzzy approach improves speed and accuracy in comparison with other techniques based on meta-heuristic algorithms such as GA and the hybrid of PSO-GSA in analyzing reachability properties.

In the last decade, the objectives outlined by the needs of personal robotics have led to the rise of new biologically-inspired techniques for arm motion planning. This paper presents a literature review of the most recent research on the generation of human-like arm movements in humanoid and manipulation robotic systems. Search methods and inclusion criteria are described. The studies are analysed taking into consideration the sources of publication, the experimental settings, the type of movements, the technical approach, and the human motor principles that have been used to inspire and assess human-likeness. Results show that there is a strong focus on the generation of single-arm reaching movements and biomimetic-based methods. However, there has been poor attention to manipulation, obstacle-avoidance mechanisms, and dual-arm motion generation. For these reasons, human-like arm motion generation may not fully respect human behavioural and neurological key features and may result restricted to specific tasks of human-robot interaction. Limitations and challenges are discussed to provide meaningful directions for future investigations.

Maximum likelihood estimation (MLE) is a popular method for parameter estimation in both applied probability and statistics but MLE cannot solve the problem of incomplete data or hidden data because it is impossible to maximize likelihood function from hidden data. Expectation maximum (EM) algorithm is a powerful mathematical tool for solving this problem if there is a relationship between hidden data and observed data. Such hinting relationship is specified by a mapping from hidden data to observed data or by a joint probability between hidden data and observed data. In other words, the relationship helps us know hidden data by surveying observed data. The essential ideology of EM is to maximize the expectation of likelihood function over observed data based on the hinting relationship instead of maximizing directly the likelihood function of hidden data. Pioneers in EM algorithm proved its convergence. As a result, EM algorithm produces parameter estimators as well as MLE does. This tutorial aims to provide explanations of EM algorithm in order to help researchers comprehend it. Moreover some improvements of EM algorithm are also proposed in the tutorial such as combination of EM and third-order convergence Newton-Raphson process, combination of EM and gradient descent method, and combination of EM and particle swarm optimization (PSO) algorithm.

This paper provides the state of the art of data science in economics. Through a novel taxonomy of applications and methods advances in data science are investigated. The data science advances are investigated in three individual classes of deep learning models, ensemble models, and hybrid models. Application domains include stock market, marketing, E-commerce, corporate banking, and cryptocurrency. Prisma method, a systematic literature review methodology is used to ensure the quality of the survey. The findings revealed that the trends are on advancement of hybrid models as more than 51% of the reviewed articles applied hybrid model. On the other hand, it is found that based on the RMSE accuracy metric, hybrid models had higher prediction accuracy than other algorithms. While it is expected the trends go toward the advancements of deep learning models.

The calculation of echo intensity involved in the SAR image simulation is usually based on the electromagnetic formula or approximate formula derived under certain assumptions. However, the parameters used in these formulas are often difficult to obtain, and the formulas have errors with the actual situation. In this paper, a method of embedding deep neural network (DNN) into the simulation process based on ray tracing is proposed, so that the DNN model can be directly used to fit the calculation formula of echo intensity from real SAR images. Simulation results show that this method can obtain SAR images with high similarity.

Stocks portfolio is a form of investment that can be used to minimize the risk of loss. In a stock portfolio, the value at risk (VaR) can be predicted through the portfolio return. If portfolio return variance is heteroscedastic risk prediction can be done by using VaR with ARIMA-GARCH or Ensemble ARIMA-GARCH model approach. Furthermore, the accuracy of VaR is tested through backtesting test. In this study, the portfolio formed from Astra Agro Lestari Ltd (AALI) and Indofood Ltd (INDF) stocks from 10/02/2012 to 10/01/2019. The results showed that the best model is ARIMA(0,0,[3])-GARCH(1,2) with AIC of -5.604 and MSE 1.874e-07.At confidence level of 95% and 1 day holding period, the VaR of the ARIMA(0,0,[3])-GARCH(1,2) was -0.3464. Based on the backtesting test, it is proven to be very accurate to predict the value of loss risk because the value of the violation ratio (VR) is equal to 0.

Daltonisation refers to the recolouring of images such that details normally lost by colour vision deficient observers become visible. This comes at the cost of introducing artificial colours. In a previous work, we presented a gradient-domain colour image daltonisation method that outperformed previously known methods both in behavioural and psychometric experiments. In the present paper, we improve the method by (i) finding a good first estimate of the daltonised image, thus reducing the computational time significantly, and (ii) introducing local linear anisotropic diffusion, thus effectively removing the halo artefacts. The method uses a colour vision deficiency simulation algorithm as an ingredient, and can thus be applied for any colour vision deficiency, and can even be individualised if the exact individual colour vision is known.

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several satellite images over different countries to perform binary classification of burnt areas and multiclass classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on the multiclass classification datasets, with no significant effect on the binary classification ones. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

With the widespread use of mobile phones, increasing use of mobile applications in different areas of life have gained a large place. Between the reasons of the preference of the rapid increasing number of apps in the application markets of the different platforms, the aesthetic appereance of the icons that apps have perhaps the most important one. In this study, the visual symmetrical side of the icons of the most downloaded apss which are developed for preparing to Public Servant Exam in Turkey is emphasized. Two different types of data are obtained with working on the icons with image processing technique by using Mathworks Matlab program and survey method which is applied on Korkut Ata University students. By comparing the obtained data with the binary logistic regression method, it was determined that the visual symmetry in the apps’ icons partially contributed to the aesthetic appreciation.

Sepsis is the most common cause of death in emergency departments (ED) that is associated with suspected infections. Currently, the international heuristic most used by physicians are the SIRS (Systemic Inflammatory Response Syndrome) criteria. However, widespread inaccuracy of this criteria has caused physician mistrust and desensitization to symptoms, thereby increasing mortality rates. This study sourced a data set from a Swedish study of the electronic medical health records of 18,006 patients, and processed the data down to 2, 196 unique patients. 26 separate machine learning models from 7 different families were tested for their performance when given the same inputs as the SIRS criteria’s requirements. It was found that the two-layer feedforward neural network performed best and was eligible for optimization in order to achieve the best classification performance to compare with the SIRS criteria. Training functions were tested for error and execution time, and the best function for use in the neural network was determined to be the Levenberg-Marquardt function. 10 baseline covariates with the most relevance to Sepsis diagnosis were combined with the SIRS criteria to achieve the best and most realistic model performance. The resulting neural network had a sensitivity of 98.1% and a specificity 63.4%, far exceeding other machine learning models and the SIRS criteria.

In this work, we treat a prediction problem via the conditional hazard function of a scalar response variable Y given a functional random variable X by using the local linear technique. The main purpose of this paper is to investigate the asymptotic normality of the nonparametric estimator of the conditional hazard function, under some general conditions. A simulation study, conducted to assess finite sample behavior, demonstrates the superiority of our method than the standard kernel method

GANs are well known for success in the realistic image gen-eration. However, they can be applied in tabular data generation as well.We will review and examine some recent papers about tabular GANs inaction. We will generate data to make train distribution bring closer tothe test. Then compare model performance trained on the initial traindataset, with trained on the train with GAN generated data, also wetrain the model by sampling train by adversarial training. We show thatusing GAN might be an option in case of uneven data distribution be-tween train and test data

We present a class of efficient parametric closure models for 1D stochastic Burgers equations. Casting it as statistical learning of the flow map, we derive the parametric form by representing the unresolved high wavenumber Fourier modes as functionals of the resolved variables’ trajectory. The reduced models are nonlinear autoregression (NAR) time series models, with coefficients estimated from data by least squares. The NAR models can accurately reproduce the energy spectrum, the invariant densities, and the autocorrelations. Taking advantage of the simplicity of the NAR models, we investigate maximal and optimal space-time reduction. Reduction in space dimension is unlimited, and NAR models with two Fourier modes can perform well. The NAR model’s stability limits time reduction, with a maximal time step smaller than that of the K-mode Galerkin system. We report a potential criterion for optimal space-time reduction: the NAR models achieve minimal relative error in the energy spectrum at the time step where the K-mode Galerkin system’s mean CFL number agrees with the full model’s.

In this paper, we consider the problem that the maximal order consider the groups that consisting of transformations we called NG-Transformation on a nonempty set A has no bijection as its element. We find the order of these groups not greater that (n-1)!. In addition, we will prove our result by showing that any kind of NG-group in the theorem be isomorphic to a permutation group on a quotient set of A with respect to an equivalence relation on A.

Recently, Kim-Kim [13] have introduced polyexponential functions as an inverse to the polylogarithm functions, and constructed type 2 poly-Bernoulli polynomials. They have also introduced unipoly functions attached to each suitable arithmetic function as a universal concept. Inspired by their work, in this paper, we introduce a new class of the Frobenius-Genocchi polynomials. We derive the diverse formulas and identities covering some summation formulas, derivative formula and correlations with Bernoulli polynomials and numbers, Stirling numbers of the both kinds, degenerate Frobenius-Genocchi polynomials and degenerate Frobenius-Euler polynomials. Moreover, by using the unipoly function as following Kim-Kim's work in <cite>Kim1</cite>, we consider degenerate unipoly-Frobenius-Genocchi polynomials and investigate some formulas and relationships with Daehee numbers, degenerate Frobenius-Genocchi numbers and Stirling numbers of the first kind. Finally, we obtain an Gaussian integral representation of the Frobenius-Genocchi polynomials in terms of the 2-variable Hermite polynomials.

Recently, there has been, on the one hand, an increase in the complexity of digital device designs and, on the other hand, an increase in the requirements for the development time and the reliability of the designs. One of the directions of solving this problem is developing new techniques for designing digital devices.This paper proposes a new technique for designing digital devices based on finite state machines with datapath (FSMD), when the functioning of the device is described in the form of an algorithm state machine with datapath (ASMD) charts. The new technique is called ASMD-FSMD. Different digital device design techniques are compared to each other using design examples of a synchronous multiplier on field programmable gate array (FPGA). The efficiency of the ASMD-FSMD technique compared to the traditional approach in terms of area and performance was investigated. The ASMD-FSMD technique, compared to the traditional one, reduces the area from 28.6% to 39.7% and increases the speed for some designs to 17.6%. In addition, using the ASMD-FSMD technique significantly reduces design time and increases design reliability. In conclusion, recommendations for using the ASMD-FSMD technique are made.

An equilibrium problem of the Kirchhoff-Love plate containing a nonhomogeneous inclusion is considered. It is assumed that elastic properties of the inclusion depend on a small parameter characterizing width of the inclusion $\varepsilon$ as $\varepsilon^N$ with $N<1$. The passage to the limit as the parameter $\varepsilon$ tends to zero is justified, and an asymptotic model of a plate containing a thin inhomogeneous hard inclusion is constructed. It is shown that there exists two types of thin inclusions: rigid inclusion ($N<-1$) and elastic inclusion ($N=-1$). The inhomogeneity disappears in the case of $N\in (-1,1)$.

Information Technology (IT) has become an essential part of our lives and due to the emergence of Internet-of-Things (IoT), technology has encompassed a majority of things that humans rely on in their daily lives. Further, as IT becomes more relevant in daily lives, the need for IT to serve public emergency services has become more important. However, due to the infancy status of IoT, there is a need for a data consortium that would prove to be best used in servicing policing in a technological driven society. This paper will discuss the plausibility of creating a universal format for use in carrying out public services, such as emergency response by the police and regular law maintenance. In this research we will discuss what the police requires in their line-of-duty and how smart devices can be used to satisfy those needs. A data formatting framework is developed and demonstrated, with the goal of showing what can be done to unifying data from smart city sensors.

This paper studies the goodness of fit test for the bivariate Hermite distribution. Specifically, we propose and study a Cramér-von Mises-type test based on the empirical probability generation function. The bootstrap can be used to consistently estimate the null distribution of the test statistics. A simulation study investigates the goodness of the bootstrap approach for finite sample sizes.

The way in which the human being learns certain complex contents has always been a focus of interest and a challenge for researchers. Given the fact that children's cognitive abilities do not fully develop until a certain age, this topic is particularly important in the young children's learning scope as they do not correctly and easily learn some content of abstract nature, such as contents in math class. This work presents the results of the use of an application called "Mathematics Learning System with Augmented Reality based on Kinect" (SAM-RAK by its acronym in Spanish), which was designed to cover basic topics of mathematics in the Basic General Education level (EGB by its acronym in Span-ish) in Ecuador. The research was carried out under an experimental quantitative approach with 30 children (18 girls and 12 boys), who study in third grade of EGB level, from 2 different educational in-stitutions in Riobamba city. In order to obtain the results that evaluate the developed application, a pre-test and a post-test were applied, which were contrasted with the student’s t-test for paired samples. The statistical evidence suggests that the proposed computer system had a positive effect on children's performance, when it was used as a support tool in the classroom. The system was more effective in low performance children compared to those of high performance. It was also proved that children were motivated and showed positive attitudes when using the proposed System.

This paper is a slightly modified, abridged version of a previous work ``Parametric Gevrey asymptotics in two complex time variables through truncated Laplace transforms'' motivated by our contribution in the conference ``Formal and Analytic Solutions of Diff. (differential, partial differential, difference, q-difference, q-difference-differential) Equations on the Internet'' (FASnet20). It aims to clarify and give further detail at some crucial points concerning the asymptotic behavior of the solutions of the problems studied in that work.

For each non-prime odd number as F=pq , if we consider m/n as an approximation for q/p and choose k=mn , then by proving some lemmas and theorems, we can compute the values of m and n. Finally, by using Fermat’s factorization method for F and 4kF as difference of two non-consecutive natural numbers, we should be able to find the values of p and q. Then we introduce two new and powerful sieves for separating composite numbers from prime numbers.

Since their introduction, process trees have been frequently used as a process modeling formalism in many process mining algorithms. A process tree is a (mathematical) tree-based model of a process, in which internal vertices represent behavioral control-flow relations and leaves represent process activities. Translation of a process tree into a sound Workflow net is trivial; however, the reverse is not the case. Simultaneously, an algorithm that translates a WF-net into a process tree is of great interest, e.g., the explicit knowledge of the control-flow hierarchy in a WF-net allows one to reason on its behavior more easily. Hence, in this paper, we present such an algorithm, i.e., it detects whether a WF-net corresponds to a process tree, and, if so, constructs it. We prove that, when the algorithm finds a process tree, the language of the process tree is equal to the language of the original WF-net. The experiments conducted show that the algorithm’s corresponding implementation has a quadratic time complexity in the size of the WF-net. Furthermore, the experiments show strong evidence of process tree re-discoverability.

The main purpose of this paper is to propose a novel optimization model with a new machine learning approach in the first section to achieve the best results in financial institutions in the second section. Since the constancy of efficacy derived from parametric and non-parametric is not significant, this paper provides a scientific assessment at the optimization section and proposes a novel combined parametric and non-parametric model which will be a new experiment in literature perception. A scientific assessment of banks based on a combination of the efficiency measurement method of CCR(Charnes, Cooper and Rhodes model) or CRS(Constant Return to Scale) BCC(Banker, Charnes, and Cooper model) or VRS (Variable Return to Scale) in Data Envelopment Analysis (DEA), as well as Stochastic Frontier Approach (SFA) for 65 banks during Feb to July 2020, are introduced. For analyzing the performance of the parametric and non-parametric approaches we have considered the linear regression and Unreplicated Linear Functional Relationship (ULFR). At the machine learning section, a novel four-layers data mining filtering pre-processes for selected supervised classification as well as unsupervised clustering algorithms to increase the accuracy and to remove unrelated attributes and data are applied. For the four kinds of preprocessing approaches of unsupervised attributes, supervised attributes, supervised instances, and unsupervised instances, we have chosen discretization, attribute selection, stratified remove folds, and resample filters respectively. Based on the nature of the suggested financial institution's dataset and attributes, the most appropriate preprocessing filter in each layer to achieve the highest performance is suggested. Finally, the superior bank, best performance model, and the most accurate algorithm are introduced. The results indicate that the bank number 56 is the superior bank. Among the proposed techniques, the novel recommended CVS compared with CCR-BCC and SFA models, has a more positive correlation with profit risk, and show a higher coefficient of determination values. Sequential Minimal Optimization(SMO) algorithm receives the highest accuracy in all four suggested filtering layers.

Selection of biologically relevant genes from high dimensional expression data is a key research problem in gene expression genomics. Most of the available gene selection methods are either based on relevancy or redundancy measure, which are usually adjudged through post selection classification accuracy. Through these methods the ranking of genes was done on a single high-dimensional expression data, which leads to the selection of spuriously associated and redundant genes. Hence, we developed a statistical approach through combining Support Vector Machine with Maximum Relevance and Minimum Redundancy under a sound statistical setup for the selection of biologically relevant genes. Here, the genes are selected through statistical significance values computed using a non-parametric test statistic under a bootstrap based subject sampling model. Further, a systematic and rigorous evaluation of the proposed approach with nine existing competitive methods was carried on six different real crop gene expression datasets. This performance analysis was carried out under three comparison settings, i.e. subject classification, biological relevant criteria based on quantitative trait loci, and gene ontology. Our analytical results showed that the proposed approach selects genes that are more biologically relevant as compared to the existing methods. Moreover, the proposed approach was also found to be better with respect to the competitive existing methods. The proposed statistical approach provides a framework for combining filter, and wrapper methods of gene selection.

By unraveling a persistent misconception in the zeta Hadamard product expansion, and employing the zeta functional equation, a concise proof of the Riemann Hypothesis is presented, which conclusively demonstrate that the Riemann Hypothesis is true.

The small satellite market continues to grow year after year. A compound annual growth rate of 17% is estimated during the period between 2020 and 2025. Low-cost satellites can send a vast amount of images to be post-processed at the ground to improve the quality and extract detailed information. In this domain lies the resolution enhancement task, where a low-resolution image is converted to a higher resolution automatically. Deep learning approaches to Super-Resolution (SR) reached the state-of-the-art in multiple benchmarks; however, most of them were studied in a single-frame fashion. With satellite imagery, multi-frame images can be obtained at different conditions giving the possibility to add more information per image and improve the final analysis. In this context, we developed and applied to the PROBA-V dataset of multi-frame satellite images a model that recently topped the European Space Agency’s Multi-frame Super Resolution (MFSR) competition. The model is based on proven methods that worked on 2D images tweaked to work on 3D: the Wide Activation Super Resolution (WDSR) family. We show that with a simple 3D CNN residual architecture with WDSR blocks and a frame permutation technique as data augmentation better scores can be achieved than with more complex models. Moreover, the model requires few hardware resources, both for training and evaluation, so it can be applied directly from a personal laptop.

Information security plays a major role in the dynamics of today’s interconnected world. Despite the successful implementation and effectiveness of modern cryptographic techniques, their inherent limitations can be exploited by quantum computers. In this article we discuss Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers. More specifically, we present its formal description and give an implementation of the algorithm using IBM’s Qiskit framework, which allows us to simulate and run the program on a real device. The developed program is modular and scalable, managing to properly run on any input state. We compare the performance of the algorithm running on the local simulator against its execution on a quantum processor from IBM’s lineup, noting the discrepancies between the results due to physical characteristics of the chip.

There is a growing public health need for effective preventive interventions against dengue, and a safe, effective and affordable dengue vaccine against the four serotypes would be a significant achievement for disease prevention and control. Two tetravalent dengue vaccines, Dengvaxia (Sanofi Pasteur) and DENVax (Takeda Pharmaceutical Company), have now completed phase 3 clinical trials. While Dengvaxia resulted in serious adverse events and is restricted to individuals with prior dengue infections, DENVax has shown, at first glance, some encouraging results. Using the available data for the TAK 003 trial, we estimate, via the Bayesian approach, vaccine efficacy (VE) of the post-vaccination surveillance periods. Although better measurement over long time was expected for the second part of the post-vaccination surveillance, variation in serotype-specific efficacy needs careful consideration. Besides observing that individual serostatus prior to vaccination is determinant of DENVax vaccine efficacy, we also compare the VE estimations for 12 and 18 months and we observe that the efficacy is decreasing over time. The comparison of efficacies over time is informative and very important, bring up the discussion of the role of temporary cross-immunity in dengue vaccine trials and the impact of serostatus prior to vaccination in the context of dengue fever epidemiology.

Since the emergence of the quantified self movement, users aim at health behavior change, but only those who are sufficiently motivated and competent with the tools will succeed. Our literature review shows that theoretical models for quantified self exist but they are too abstract to guide the design of effective user support systems. Here, we propose principles linking theory and implementation to arrive at a hierarchical model for an adaptable and personalized self-quantification system for physical activity support. We show that such a modeling approach should include a multi-factors user model (activity, context, personality, motivation), a hierarchy of multiple time scales (week, day, hour), and a multi-criteria decision analysis (user activity preference, user measured activity, external parameters). Although the implementation still raises many challenges, principles linking theory and implementation should facilitate the design of effective self-quantification system aimed at physical activity increase, and more widely for behavior change.

AI is leveraging all aspects of life. Medical services are not untouched. Especially in the field of medical image processing and diagnosis. Big IT and Biotechnology companies are investing millions of dollars in medical and AI research. The recent outbreak of SARS COV-2 gave us a unique opportunity to study for a non interventional and sustainable AI solution. Lung disease remains a major healthcare challenge with high morbidity and mortality worldwide. The predominant lung disease was lung cancer. Until recently, the world has witnessed the global pandemic of COVID19, the Novel coronavirus outbreak. We have experienced how viral infection of lung and heart claimed thousands of lives worldwide. With the unprecedented advancement of Artificial Intelligence in recent years, Machine learning can be used to easily detect and classify medical imagery. It is much faster and most of the time more accurate than human radiologists. Once implemented, it is more cost-effective and time-saving. In our study, we evaluated the efficacy of Microsoft Cognitive Service to detect and classify COVID19 induced pneumonia from other Viral/Bacterial pneumonia based on X-Ray and CT images. We wanted to assess the implication and accuracy of the Automated ML-based Rapid Application Development (RAD) environment in the field of Medical Image diagnosis. This study will better equip us to respond with an ML-based diagnostic Decision Support System(DSS) for a Pandemic situation like COVID19. After optimization, the trained network achieved 96.8% Average Precision which was implemented as a Web Application for consumption. However, the same trained network did not perform like Web Application when ported to Smartphone for Real-time inference, which was our main interest of study. The authors believe, there is scope for further study on this issue. One of the main goals of this study was to develop and evaluate the performance of AI-powered Smartphone-based Real-time Applications. Facilitating primary diagnostic services in less equipped and understaffed rural healthcare centers of the world with unreliable internet service.

In this paper, we investigate the dynamics of following higher order difference equation x_{n+1}=A+B((x_{n})/(x_{n-m}²)) with A,B and initial conditions are positive numbers. Especially we study the boundedness, periodicity, global asymptotically stability and rate of convergence of related higher order difference equations.

In this paper, we study the global asymptotically stability of following system of difference equations with quadratic terms: x_{n+1}=A+B((y_{n})/(y_{n-1}²)),y_{n+1}=A+B((x_{n})/(x_{n-1}²)) where A and B are positive numbers and the initial values are positive numbers. We also investigate the rate of convergence and oscillation behaviour of the solutions of related system.

The conjecture attributed to Norman L. Gilbreath, but formulated by Francois Proth in the second half of the 1800s, concerns an interesting property of the ordered sequence of prime numbers $P$. Gilbreath conjecture stated that, if we compute the absolute values of differences of consecutive primes on ordered sequence of prime numbers, and if this calculation is repeated for the terms in the new sequence and so on, every sequence will start with 1. In this paper the concept of Gilbreath sequence, Gilbreath triangle and Gilbreath equation are defined and on the basis of the results obtained from their properties, an inductive proof is produced, which establishes the necessary condition to state that Gilbreath conjecture is true.

This project focuses on using machine learning classification algorithms to determine whether two people are 6 feet apart or not. Two Raspberry Pis were used simulate smart phones. RSSI values of the Bluetooth beacons transmitted between the Raspberry Pis were collected and recorded to train the classifier. The Gaussian Support Vector Machine Classifer yielded the highest testing accuracy of 79.670 and the Decision Tree Classifier yielded the highest AUC of 0.80.

$P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$? The precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is $\textit{P-Sel}$. $\textit{P-Sel}$ is the class of decision problems for which there is a polynomial time algorithm (called a selector) with the following property: Whenever it's given two instances, a $``yes"$ and a $``no"$ instance, the algorithm can always decide which is the $``yes"$ instance. It is known that if $NP$ is contained in $\textit{P-Sel}$, then $P = NP$. We consider the problem of computing the sum of the weighted densities of states of a Boolean formula in $3CNF$. Given a Boolean formula $\phi$ with $m$ clauses, the density of states $n(E)$ for some integer $0 \leq E \leq m$ counts the number of truth assignments that leave exactly $E$ clauses unsatisfied in $\phi$. The weighted density of states $m(E)$ is equal to $E \times n(E)$. The sum of the weighted densities of states of a Boolean formula in $3CNF$ with $m$ clauses is equal to $\sum_{E = 0}^{m} m(E)$. We prove that we can calculate the sum of the weighted densities of states in polynomial time. Given two Boolean formulas $\phi_{1}$ and $\phi_{2}$ in $3CNF$ with $n$ variables and $m$ clauses, the combinatorial optimization problem $\textit{SELECTOR-3SAT}$ consists in selecting the formula which is satisfiable, where every clause from $\phi_{1}$ and $\phi_{2}$ can be unsatisfied for some truth assignment. We assume that the formula that is satisfiable has the minimum sum of the weighted densities of states. In this way, we solve $\textit{SELECTOR-3SAT}$ with an exact polynomial time algorithm. We claim this problem is a selector of $3SAT$ and thus, $P = NP$.

Introduced in 2009, Bitcoin has demonstrated a huge potential as the world’s first digital currency and has been widely used as a financial investment. Our research aims to uncover the relationship between Bitcoin prices and people’s sentiments about Bitcoin on social media. Among various social media platforms, micro-blogging is one of the most popular. Millions of people use micro-blogging platforms to exchange ideas, broadcast views, and to provide opinions on different topics related to politics, culture, science, and technology. This makes them a potentially rich source of data for sentiment analysis. Therefore we chose one of the busiest micro-blogging platforms, Twitter, to perform sentiment analysis on Bitcoin. We used ELMo embedding model to convert Bitcoin-related tweets into a vector form and SVM classifier to divide the tweets into three sentiment categories - positive, negative, and neutral. We then used the sentiment data to find its relation with Bitcoin price fluctuation using the linear mixed model.

In this paper, we consider a new class of polynomials which is called the multi-poly-Euler polynomials. Then, we investigate their some properties and relations. We provide that the type 2 degenerate multi-poly-Euler polynomials equals a linear combination of the degenerate Euler polynomials of higher order and the degenerate Stirling numbers of the first kind. Moreover, we provide an addition formula and a derivative formula. Furthermore, in a special case, we acquire a correlation between the type 2 degenerate multi-poly-Euler polynomials and degenerate Whitney numbers.

The internet has changed the way people perceived fiction to a new level. For instance, online forums have given people the opportunity to write without revealing their real identities. Especially in the Saudi context, online users were using these forums to write web novels that reflect their culture, lives, concerns, hopes and dreams. In this paper, we describe a dataset that was collected from one of the online forums that was used for sharing web novels among its readers. The collected dataset contains 1,267 novels between 2003-2015. This data set is available to the research community to analyze to gain a better understanding of the social, economical, and behavioral mindset that was manifested in the community in that decade.

We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order on all finite groups, that is well behaved with respect to cardinality. In fact, if $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G$. There is also a canonical order for the elements of $G$ and we can define equivalent objects of $G$. This allows us to find the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and a minimal set of independent equations that define the group is obtained. We show how to find all groups of order $n$, and order them. Examples are given using all groups with order smaller than $10$. The canonical block form of the symmetry group $\Delta_4$ is given and we find its automorphisms. These results are extended to the infinite case. A real number is an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, as well. We make brief comments on treating the calculus of real numbers. In general, we represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects are well assigned to tree structures. We conclude with brief comments on type theory and future work on computational and physical aspects of these representations.

Inspired by the definition of degenerate multi-poly-Genocchi polynomials given by using the degenerate multi-polyexponential functions. In this paper, we consider a class of new generating function for the degenerate multi-poly-Bernoulli polynomials, called the type 2 degenerate multi-poly-Bernoulli polynomials by means of the degenerate multiple polyexponential functions. Then, we investigate their some properties and relations. We show that the type 2 degenerate multi-poly-Bernoulli polynomials equals a linear combination of the weighted degenerate Bernoulli polynomials and Stirling numbers of the first kind. Moreover, we provide an addition formula and a derivative formula. Furthermore, in a special case, we acquire a correlation between the type 2 degenerate multi-poly-Bernoulli numbers and degenerate Whitney numbers.

We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order on all finite groups, that is well behaved with respect to cardinality. In fact, if $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G$. There is also a canonical order for the elements of $G$ and we can define equivalent objects of $G$. This allows us to find the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and a minimal set of independent equations that define the group is obtained. We show how to find all groups of order $n$, and order them. Examples are given using all groups with order smaller than $10$. The canonical block form of the symmetry group $\Delta_4$ is given and we find its automorphisms. These results are extended to the infinite case. A real number is an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, as well. We make brief comments on treating the calculus of real numbers. In general, we represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects are well assigned to tree structures. We conclude with brief comments on type theory and future work on computational and physical aspects of these representations.

In this paper, drug treatment and vaccination are compared healthy and economically. In this comparison, in addition to comparing economic costs, it has paid attention to patients' recovery. To reach the goal, the prevalence of Covid-19 virus in New York is modeled by using the SEIR dynamic model. The SEIR dynamic model is used to model the period of epidemic diseases. Then, three disease control scenarios are evaluated economically. Treatment and vaccination are two important issues in controlling epidemic diseases. To control the disease, each of these two methods has economic costs and benefits. The main purpose of this paper is to compare the two methods of vaccination and treatment economically. Although the results of the study show that vaccination can be effective in preventing the epidemic of the disease than treatment, but due to the high cost and genetic mutation of the virus, vaccination is not the optimal method for both health and the economy in the long term.

In this paper, we construct the degenerate poly-Frobenius-Genocchi polynomials, called the type 2 degenerate poly-Frobenius-Euler polynomials, by means of polyexponential function. We derive explicit expressions and some identities of those polynomials. In the last section, we introduce type 2 degenerate unipoly-Frobenius-Genocchi polynomials by means of unipoly function and derive explicit multifarious properties.

Kim-Kim [12] introduced the new type of degenerate Bernoulli numbers and polynomials arising from the degenerate logarithm function. In this paper, we introduce a new type of degenerate poly-Euler polynomials and numbers, are called degenerate poly-Euler polynomials and numbers, by using the degenerate polylogarithm function and derive several properties on the degenerate poly-Euler polynomials and numbers. In the last section, we also consider the degenerate unipoly-Euler polynomials attached to an arithmetic function, by using the degenerate polylogarithm function and investigate some identities of those polynomials. In particular, we give some new explicit expressions and identities of degenerate unipoly polynomials related to special numbers and polynomials.

In this paper, we consider a class of new generating function for the Frobenius-Genocchi polynomials, called the type 2 degenerate poly-Frobenius-Genocchi polynomials, by means of the polyexponential function. Then, we investigate diverse explicit expressions and some identities for those polynomials.

We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order, on the quotient space of isomorphism classes of finite groups, that is well behaved with respect to cardinality. If $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G\leq\mathbb Z_{p_1}^{n_1}\oplus\mathbb Z_{p_2}^{n_2}\oplus\cdots\oplus\mathbb Z_{p_k}^{n_k}$ where $n=p_1^{n_1}p_2^{n_2}\cdots p_{k}^{n_k}$ is the prime factorization of $n$. We find a canonical order for the objects of $G$ and define equivalent objects of $G$, thus finding the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and we are provided with a minimal set of independent equations that define the group. We show how to find all groups of order $n$, and order them. We give examples using all groups with order smaller than $10$, and we find the canonical block form of the symmetry group $\Delta_4$. In the next section, we extend our results to the infinite case, which defines a real number as an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, as well. In general, we represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects are well assigned to tree structures. We conclude with brief comments on type theory and future work on computational aspects of these representations.

The maximal prime gaps upper bound problem is one of the major mathematical problems to date. The objective of the current research is to develop a standard which will aid in the understanding of the distribution of prime numbers. This paper presents theoretical results which originated with a researchin the subject of the maximal prime gaps. the document presents the sharpest upper bound for the maximal prime gaps ever developed. The result becomes the Supremum bound on the maximal prime gaps and subsequently culminates with the conclusive proof of the Firoozbakht's Hypothesis No 30. Firoozbakht's Hypothesis implies quite a bold conjecture concerning the maximal prime gaps. In fact it imposes one of the strongest maximal prime gaps bounds ever conjectured. Its truth implies the truth of a greater number of known prime gaps conjectures, simultaneously, the Firoozbakht's Hypothesis disproves a known heuristic argument of Granville and Maier. This paper is dedicated to a fellow mathematician, the late Farideh Firoozbakht.

This research paper aims to explicate the complex issue of the Riemann's Hypothesis and ultimately presents its elementary proof. The method implements one of the binomial coefficients, to demonstrate the maximal prime gaps bound. Maximal prime gaps bound constitutes a comprehensive improvement over the Bertrand's result, and becomes one of the key elements of the theory. Subsequently, implementing the theory of the primorial function and its error bounds, an improved version of the Gauss' offset logarithmic integral is developed. This integral serves as a Supremum bound of the prime counting function Pi(n). Due to its very high precision, it permits to verify the relationship between the prime counting function Pi(n) and the offset logarithmic integral of Carl Gauss. The collective mathematical theory, via the Niels F. Helge von Koch equation, enables to prove the RIemann's Hypothesis conclusively.

Motivated by the definition of the type 2 poly-Bernoulli polynomials introduced by Kim-Kim, in the present paper, we consider a class of new generating function for the Frobenius-Genocchi polynomials, called the type 2 poly-Frobenius-Genocchi polynomials, by means of the polyexponential function. Then, we derive some useful relations and properties. We show that the type 2 poly-Frobenius-Genocchi polynomias equal a linear combination of the classical Frobenius-Genocchi polynomials and Stirling numbers of the first kind. In a special case, we give a relation between the type 2 poly-Frobenius-Genocchi polynomials and Bernoulli polynomials of order k. Moreover, inspired by the definition of the unipoly-Bernoulli polynomials introduced by Kim-Kim, we introduce the unipoly-Frobenius-Genocchi polynomials by means of unipoly function and give multifarious properties including derivative and integral properties. Furthermore, we provide a correlation between the unipoly-Frobenius-Genocchi polynomials and the classical Frobenius-Genocchi polynomials.

We provide a construction of natural numbers that is unique with respect to other constructions, and use this construction in the domain of algebra and finite functions to find several results in finite group theory. First, we give a linear order to the set of all finite functions. This gives a linear order in the subset of all finite permutations. To do this, we assign a unique natural number, $N_f$, to every finite function $f$. The sub order on permutations is well defined with respect to cardinality; if $\eta_m,\eta_n$ are permutations on $m<n$ objects, then $N_{\eta_m}<N_{\eta_n}$. This representation also has the characteristic $N_{\textbf{1}_n}<N_{\eta}<N_{\textbf{id}_n}$ where $\textbf{1}_n$ is the one-cycle permutation of $n$ objects, $\textbf{id}_n$ is the identity permutation of $n$ objects, and $\eta$ is any permutation of $n$ objects. This representation provides a good definition of equivalent functions, and equivalent objects on functions. We are able to do this for both concrete functions, and abstract functions. We use this in the main section, on group theory, to number the set of all finite groups. We are able to well represent every finite group as a natural number; two groups are represented by the same natural number if and only if they are in the same isomorphism class. In fact, we are able to give a linear order to the set of finite groups. Specifically, we give a canonical bijective function $\textbf{G}_{Fin}\rightarrow\mathbb N$. This representation, $N_G$, of $G$, is also well behaved with respect to cardinality. Additionally, the cyclic group $\mathbb Z_n$ has smaller representation than any group of $n$ objects, and the group with largest representation is the abelian group $\mathbb Z_{p_1}^{n_1}\oplus\mathbb Z_{p_2}^{n_2}\oplus\cdots\oplus\mathbb Z_{p_k}^{n_k}$, where $n=p_1^{n_1}p_2^{n_2}\cdots p_{k}^{n_k}$ is the prime factorization of $n$. This representation of a finite group as a natural number also provides a linear order to the elements of the group, arranging its Cayley table in a canonical block form. The last section is an introductory description of real numbers as infinite sets of natural numbers. Real functions are represented as sets of real numbers, and sequences of real functions $f_1,f_2,\ldots$ are well represented by sets of real numbers, as well. In the last section we well assign mathematical objects to tree structures and conclude with some brief comments on type theory and future work. In general we are able to represent and manipulate mathematical objects with the smallest possible type, and minimum complexity.

In this paper, we study the symmetry between the supersingular prime number according to smallest sphenic number. With this symmetry, we show that the elements of sporadic group generates all prime numbers with the order by a simple application.

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.6 million 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 solve new cases. The approach adopted in this study employs the use of an improved CBR model for state-of-the-art reasoning task in classification of suspected cases of Covid19. The CBR model leverages on a novel feature selection and semantic-based mathematical model proposed in this study for case similarity computation. An initial population of the archive was achieved with 68 cases obtained from the Italian Society of Medical and Interventional Radiology (SIRM) repository. Results obtained revealed that the proposed approach in this study successfully classified suspected cases into their categories at an accuracy of 97.10%. The study found that the proposed model can support physicians to easily diagnose suspected cases of Covid19 base on their medical records without subjecting the specimen to laboratory test. As a result, there will be a global minimization of contagion rate occasioned by slow testing and as well reduce false positive rates of diagnosed cases as observed in some parts of the globe.

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 $\frac{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. The Robin's inequality consists in $\sigma(n) < e^{\gamma } \times n \times \ln \ln n$ where $\sigma(n)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. The Robin's inequality is true for every natural number $n > 5040$ if and only if the Riemann Hypothesis is true. We prove the Robin's inequality is true for every natural number $n > 5040$. In this way, we demonstrate the Riemann Hypothesis is true.

We provide a construction of natural numbers that is unique with respect to other constructions, and use this construction in the domain of algebra and finite functions to find several results in finite group theory. First, we give a linear order to the set of all finite functions. This gives a linear order in the subset of all finite permutations. To do this, we assign a unique natural number, $N_f$, to every finite function $f$. The sub order on permutations is well defined with respect to cardinality; if $\eta_m,\eta_n$ are permutations on $m<n$ objects, then $N_{\eta_m}<N_{\eta_n}$. This representation also has the characteristic $N_{\textbf{1}_n}<N_{\eta}<N_{\textbf{id}_n}$ where $\textbf{1}_n$ is the one-cycle permutation of $n$ objects, $\textbf{id}_n$ is the identity permutation of $n$ objects, and $\eta$ is any permutation of $n$ objects. This representation provides a good definition of equivalent functions, and equivalent objects on functions. We are able to do this for both concrete functions, and abstract functions. We use this in the main section, on group theory, to number the set of all finite groups. We are able to well represent every finite group as a natural number; two groups are represented by the same natural number if and only if they are in the same isomorphism class. In fact, we are able to give a linear order to the set of finite groups. Specifically, we give a canonical bijective function $\textbf{G}_{Fin}\rightarrow\mathbb N$. This representation, $N_G$, of $G$, is also well behaved with respect to cardinality. Additionally, the cyclic group $\mathbb Z_n$ has smaller representation than any group of $n$ objects, and the group with largest representation is the abelian group $\mathbb Z_{p_1}^{n_1}\oplus\mathbb Z_{p_2}^{n_2}\oplus\cdots\oplus\mathbb Z_{p_k}^{n_k}$, where $n=p_1^{n_1}p_2^{n_2}\cdots p_{k}^{n_k}$ is the prime factorization of $n$. This representation of a finite group as a natural number also provides a linear order to the elements of the group, arranging its Cayley table in a canonical block form. The last section is an introductory description of real numbers as infinite sets of natural numbers. Real functions are represented as sets of real numbers, and sequences of real functions $f_1,f_2,\ldots$ are well represented by sets of real numbers, as well. In the last section we well assign mathematical objects to tree structures and conclude with some brief comments on type theory and future work. In general we are able to represent and manipulate mathematical objects with the smallest possible type, and minimum complexity.

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.

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.

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.

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.

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.

In this paper, inspired by recent articles of G. Anatriello and G. Vincenzi (see \cite{Ana}), and G. Cerda-Morales (see \cite{Cer1,Cer2}), we will introduce the third-order $\overline{h}$-Jacobsthal and third-order $\overline{h}$-Jacobsthal--Lucas sequences and their associated quaternions. The new results that we have obtained extend most of those obtained in \cite{Cer2}.

The conjecture attributed to Norman L. Gilbreath, but formulated by Francois Proth in the second half of the 1800s, concerns an interesting property of the ordered sequence of prime numbers $P$. Gilbreath conjecture stated that, if we compute the absolute values of differences of consecutive primes on ordered sequence of prime numbers, and if this calculation is repeated for the terms in the new sequence and so on, every sequence will start with 1. In this paper is defined the concept of Gilbreath sequence, Gilbreath triangle and Gilbreath equation. On the basis of the results obtained from the proof of properties, an inductive proof is produced thanks to which it is possible to establish the necessary condition to state that Gilbreath conjecture is true.

The paper proves that an odd composite integer $N$ can be factorized in at most $O( 0.125u(log_2N)^2)$ searching steps if $N$ has a divisor of the form $2^a{u} +1$ or $2^a{u}-1$ with $a > 1$ being a positive integer and $u > 1$ being an odd integer. Theorems and corollaries are proved with detail mathematical reasoning. Algorithms to factorize the kind of odd composite integers are designed and tested by factoring certain Fermat numbers. The results in the paper are helpful to factorize the related kind of odd integers as well as some big Fermat numbers

The conjecture attributed to Norman L. Gilbreath, but formulated by Francois Proth in the second half of the 1800s, concerns an interesting property of the ordered sequence of prime numbers $P$. Gilbreath’s conjecture stated that, computing the absolute value of differences of consecutive primes on ordered sequence of prime numbers, and if this calculation is done for the terms in the new sequence and so on, every sequence will starts with 1. In this paper is defined the concept of Gilbreath’s sequence, Gilbreath’s triangle and Gilbreath’s equation. On the basis of the results obtained from the proof of properties, an inductive proof is produced thanks to which it is possible to establish the necessary condition to state that the Gilbreath's conjecture is true.

In this paper, closed forms of the summation formulas for generalized Fibonacci numbers are presented. As special cases, we give summation formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers.

This dissertation is a rigorous study of ecology and macrocellular biology as a subfield of abstract algebra. We begin with the creation of an axiomatic paradigm, then move onto constructing a universal genetic code of biology. We use this to define increasingly complex algebraic structures (ecosystem, evolving populations, etc.). We prove a variety of theorems regarding to the members of the previous mathematical constructs, notably the following three: 1. There is one unique phenotypic representation of each organism. For example, if you subdivide any piece of genetic code into its phenotypic components, then two identical organisms have identical decomposed DNA 2. There are a finite number of indivisible phenotypic traits. 3. The three sophioid-definitions are equivalent: (a) dynamical evolutionary enlargement of the medial temporal lobe and frontal lobe, (b) reliance upon intelligence, (c) the existence of an intellectually- or socially-hierarchical society. Much has yet to be done on this work, but as a first draft, it stands as a jumping point for future exploits; I am working on an entirely revised second draft.

The hybrid numbers are a generalization of complex, hyperbolic and dual numbers. In this paper, we introduce the Horadam hybrid polynomials called Horadam hybrinomials. We also give some special cases and algebraic properties of the Horadam hybrinomials. Finally we obtain some applications related to the Horadam hybrinomials in matrices.

In this paper, we introduce two discrete degenerate random variables, namely the degenerate binomial and degenerate Poisson random variables. We deduce the expectations of the degenerate binomial random variables. We compute the generating function of the moments of the degenerate Poisson random variables, which leads us to define the new type degenerate Bell polynomials, and hence obtain explicit expressions for the moments of those random variables in terms of such polynomials. We also get the variances of the degenerate Poisson random variables. Finally, we illustrate two examples of the degenerate Poisson random variables.

A comprehensive heuristic analysis of the Pollard's Rho Method (PRM) is given. The analysis is based on ultimate periods and tails distribution of sequences. If $n$ is the composite number to be factored, then an improved version of PRM is developed which has an expected run time of $O(\sqrt[8]{n}\ln n)$ on a multi-core architecture which utilized a clever way of evaluating polynomials.

In this paper, we introduce the generalized dual hyperbolic Fibonacci numbers. As special cases, we deal with dual hyperbolic Fibonacci and dual hyperbolic Lucas numbers. We present Binet's formulas, generating functions and the summation formulas for these numbers. Moreover, we give Catalan's, Cassini's, d'Ocagne's, Gelin-Cesàro's, Melham's identities and present matrices related with these sequences.

In the present paper, the (p,q)-Hermite based Apostol type Frobenius-Euler polynomials and numbers are firstly considered and then diverse basic identities and properties for the mentioned polynomials and numbers, including addition theorems, difference equations, integral representations, derivative properties, recurrence relations. Moreover, we provide summation formulas and relations associated with the Stirling numbers of the second kind.

In this paper, a new class of q-Hermite based Frobenius type Eulerian polynomials is introduced by means of generating function and series representation. Several fundamental formulas and recurrence relations for these polynomials are derived via different generating methods. Furthermore, diverse correlations including the q-Apostol-Bernoulli polynomials, the q-Apostol-Euler poynoomials, the q-Apostol-Genocchi polynomials and the q-Stirling numbers of the second kind are also established by means of the their generating functions.

In this paper, we derive multifarious relationships among the two types of higher order q-Daehee polynomials and p-adic gamma function via Mahler theorem. Also, we compute some weighted p-adic q-integrals of the derivative of p-adic gamma function related to the Stirling numbers of the both kinds and the q-Bernoulli polynomials of order k.

In this paper, we firstly consider extended degenerate central factorial numbers of the second kind and provide some properties of them. We then introduce unified degenerate central Bell polynomials and numbers and investigate many relations and formulas including summation formula, explicit formula and derivative property. Moreover, we derive several correlations for the fully degenerate central Bell polynomials associated with the degenerate Bernstein polynomials and the degenerate Bernoulli, Euler and Genocchi numbers.

We introduce a new kind of extended Hermite-based Frobenius type Eulerian polynomials and then derive diverse explicit and implicit summation equations including some symmetric formulas by utilizing series manupulation method. Multifarious summation formulas and identities given earlier for some well known polynomials such as Eulerian polynomials and Frobenius type Eulerian polynomials are generalized.

For any odd positive integer $x$, define $(x_n)_{n\geqslant 0} $ and $(a_n )_{n\geqslant 1} $ by setting $x_{0}=x, \,\, x_n =\cfrac{3x_{n-1} +1}{2^{a_n }}$ such that all $x_n $ are odd. The 3x+1 problem asserts that there is an $x_n =1$ for all $x$. Usually, $(x_n )_{n\geqslant 0} $ is called the trajectory of $x$. In this paper, we concentrate on $(a_n )_{n\geqslant 1} $ and call it the E-sequence of $x$. The idea is that, we consider any infinite sequence $(a_n )_{n\geqslant 1} $ of positive integers and call it an E-sequence. We then define $(a_n )_{n\geqslant 1} $ to be $\Omega-$convergent to $x$ if it is the E-sequence of $x$ and to be $\Omega-$divergent if it is not the E-sequence of any odd positive integer. We prove a remarkable fact that the $\Omega-$divergence of all non-periodic E-sequences implies the periodicity of $(x_n )_{n\geqslant 0} $ for all $x_0$. The principal results of this paper are to prove the $\Omega-$divergence of several classes of non-periodic E-sequences. Especially, we prove that all non-periodic E-sequences $(a_n )_{n\geqslant 1} $ with $\mathop {\overline {\lim } }\limits_{n\to \infty } \cfrac{b_n }{n}>\log _23$ are $\Omega-$divergent by using the Wendel's inequality and the Matthews and Watts's formula $x_n =\cfrac{3^n x_0 }{2^{b_n }}\prod\limits_{k=0}^{n-1} {(1+\cfrac{1}{3x_k })} $, where $b_n =\sum\limits_{k=1}^n {a_k } $. These results present a possible way to prove the periodicity of trajectories of all positive integers in the 3x + 1 problem and we call it the E-sequence approach.

In this paper, we define Tetranacci and Tetranacci-Lucas matrix sequences and investigate their properties.

A 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 term 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 disproof for twin prime conjecture.

In this paper, we generalize Fibonacci quaternion, octonion, sedenion, trigintaduonion, etc. and define Horadam 2^{k}-ions and investigate their properties. Each Horadam (such as Fibonacci, Lucas, Pell) quaternions, octonions and sedenions are Horadam 2^{k}-ions. We also present connection to some earlier works.

We explore the class of positive integers n that admit idempotent factorizations n=pq such that lambda(n) divides (p-1)(q-1), where lambda(n) is the Carmichael lambda function. Idempotent factorizations with p and q prime have received the most attention due to their cryptographic advantages, but there are an infinite number of n with idempotent factorizations containing composite p and/or q. Idempotent factorizations are exactly those p and q that generate correctly functioning keys in the RSA 2-prime protocol with n as the modulus. While the resulting p and q have no cryptographic utility and therefore should never be employed in that capacity, idempotent factorizations warrant study in their own right as they live at the intersection of multiple hard problems in computer science and number theory. We present some analytical results here. We also demonstrate the existence of maximally idempotent integers, those n for which all bipartite factorizations are idempotent. We show how to construct them, and present preliminary results on their distribution.

In this paper, we present Binet's formulas, generating functions, and the summation formulas for generalized Pentanacci numbers, and as special cases, we investigate Pentanacci and Pentanacci-Lucas numbers with their properties. Also, we define Gaussian generalized Pentanacci numbers and as special cases, we investigate Gaussian Pentanacci and Gaussian Pentanacci-Lucas numbers with their properties. Moreover, we give some identities for these numbers. Furthermore, we present matrix formulations of generalized Pentanacci numbers and Gaussian generalized Pentanacci numbers.

In this paper, we introduce the (ρ,q)-analogue of the p-adic factorial function. By utilizing some properties of (ρ,q)-numbers, we obtain several new and interesting identities and formulas. We then construct the p-adic (ρ,q)-gamma function by means of the mentioned factorial function. We investigate several properties and relationships belonging to the foregoing gamma function, some of which are given for the case p = 2. We also derive more representations of the p-adic (ρ,q)-gamma function in general case. Moreover, we consider the p-adic (ρ,q)-Euler constant derived from the derivation of p-adic (ρ,q)-gamma function at x = 1. Furthermore, we provide a limit representation of aforementioned Euler constant based on (ρ,q)-numbers. Finally, we consider (ρ,q)-extension of the p-adic beta function via the p-adic (ρ,q)-gamma function and we then investigate various formulas and identities.

The main aim of this paper is to set some correlations between Boole polynomials and p-adic gamma function in conjunction with p-adic Euler contant. We develop diverse formulas for p-adic gamma function by means of their Mahler expansion and fermionic p-adic integral on ℤ_{p}. Also, we acquire two fermionic p-adic integrals of p-adic gamma function in terms of Boole numbers and polynomials. We then provide fermionic p-adic integral of the derivative of p-adic gamma function and a representation for the p-adic Euler constant by means of the Boole polynomials. Furthermore, we investigate an explicit representation for the aforesaid constant covering Stirling numbers of the first kind.

In this paper, we investigate p-adic q-integral (q-Volkenborn integral) on ℤ_{p} of p-adic gamma function via their Mahler expansions. We also derived two q-Volkenborn integrals of p-adic gamma function in terms of q-Daehee polynomials and numbers and q-Daehee polynomials and numbers of the second kind. Moreover, we discover q-Volkenborn integral of the derivative of p-adic gamma function. We acquire the relationship between the p-adic gamma function and Stirling numbers of the first kind. We finally develop a novel and interesting representation for the p-adic Euler constant by means of the q-Daehee polynomials and numbers.

In this article, a new class of $q$-Hermite based unified Apostol type polynomials is introduced by means of generating function and series representation. Several important formulas and recurrence relations for these polynomials are derived via different generating methods. We also introduce $q$-analog of Stirling numbers of second kind of order $\nu$ by which we construct a relation including aforementioned polynomials.

In this paper, we introduce a new class of Laguerre-based Hermite-Fubini numbers and polynomials and investigate some properties of these polynomials. We establish summation formulas of these polynomials by summation techniques series. Furthermore, we derive symmetric identities of Laguerre-based Hermite-Fubini numbers and polynomials by using generating functions.