Storing scientific data on the file system in a meaningful and transparent way is no trivial task. In particular when the data have to be accessed after their originator has left the lab the importance of a standardized file structure cannot be underestimated. It is desirable to have a structure that allows for the unique categorization of all kinds of data from experimental results to publications. It has to be accessible to a broad variety of workflows, e.g., via graphical user interface as well as via command line, in order to find widespread acceptance. Furthermore, the inclusion of already existing data has to be as simple as possible. We propose a three-level structure to organize and store scientific data that incorporates the full chain of scientific data management from data acquisition to analysis to publications. Metadata are saved in a standardized way and connect original data to analyses and publication as well as to their originators. A simple software tool to check a file structure for compliance with the proposed structure is presented.

The work is devoted to the study of a family of linear initial value problems of partial differential equations in the complex domain, dealing with two complex time variables. The use of a truncated Laplace-like transformation in the construction of the analytic solution allows to overcome a small divisor phenomenon arising from the geometry of the problem and represents an alternative approach to the one proposed in a recent work by the last two authors. The result leans on the application of a fixed point argument and the classical Ramis-Sibuya theorem.

The world is now undergoing through a global emergency due to COVID-19 which needs immediate remedies in order to strengthen the healthcare facility to save the nations. Looking towards to the remedies, research on different aspects including the genomic and proteomic level characterizations of the SARS-CoV2 are necessarily important. In this present study, the spatial representation/composition of twenty amino acids across the primary protein sequences of SARS-CoV2 have been looked into through different parameters viz. Shannon entropy, Hurst exponent in order to fetch the autocorrelation and amount of information over the spatial representations. Also frequency distribution of each of the amino acids over the protein sequences have been chalked out.

The construction of different roads, such as freeways, highways, major roads or minor roads must be accompanied by constant monitoring and evaluation of service delivery. Pavements are generally assessed by engineers in terms of the smoothness, surface condition, structural condition and surface safety. Pavement assessment is often conducted using the qualitative indices such as international roughness index (IRI), pavement condition index (PCI), structural condition index (SCI) and skid resistance value (SRV), which are used for smoothness assessment, surface condition assessment, structural condition assessment, and surface safety assessment, respectively. In this paper, Tehran-Qom Freeway in Iran has been selected as the case study and its smoothness and pavement surface conditions are assessed. At 2-km intervals, a 100-meter sample unit is selected in the slow-speed lane (totally, 118 sample units). In these sample units, the PCI is calculated after a visual inspection of the pavement and the recording of distresses. Then, in each sample unit, the average IRI is computed. The purpose of this study is to provide a method for estimating PCI based on IRI. The proposed theory was developed by Random Forest (RF), and Random Forest optimized by Genetic Algorithm (RF-GA) methods and these methods were validated using correlation coefficient (CC), scattered index (SI), and Willmott’s index of agreement (WI) criteria. The proposed method reduces costs, saves time and eliminates the safety risks.

The strong Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two primes. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A principal complexity class is NSPACE(S(n)) for some S(n). We show if the weak Goldbach's conjecture is true, then the problem PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n). However, if this happens, then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples. In addition, if this happens, then the Twin prime conjecture is true. Moreover, if this happens, then the Beal's conjecture is true. Furthermore, if this happens, then the Riemann hypothesis is true. Since the weak Goldbach's conjecture was proven, then this will certainly happen.

Inflation and exchange rates have great influence on consumer prices especially on imports and exports. Exchange rate fluctuations create inefficiency and distort world prices whereas changes in inflation rates have a direct impact on consumer goods prices which incidentally include exchange rates. There is a direct interdependence between inflation and exchange rates and this paper is aimed at investigating this relationship in dynamic context. It tries to find out how changes in inflation and exchange rates impact on another by adopting the econometric and copula approaches. Both inflation and exchange rates data are susceptible to volatility clustering, possess fat tails and are skewed coupled with conditional heteroskedasticity. Hence we model the univariate distributions by using ARMA$(p,q)$-GARCH$(x,y)$ so as to capture the most important stylized features of inflation and exchange rates. A bivariate model is then constructed by coupling the marginal distributions of inflation and exchange rates using the survival Clayton copula. Empirical results from monthly inflation and exchange rates data show positive correlation between the two based on Kendall $\tau$ test which confirms that a change in inflation results in change of exchange rates an vice versa hence there is co-movement. Furthermore, by the Granger causality test, exchange rates spikes cause changes in inflation rates. The results of the study have implications on economic policy design and hedging strategies for traders on imports and exports.

One of the most important factors impacting quality of content in Wikipedia is presence of credible sources. By following references readers can verify facts or find more details about described topic. A Wikipedia article can be edited independently in any of over 300 languages, even by anonymous users, therefore information about the same topic may be inconsistent. This also applies to use of references in different language versions of a particular article, so the same statement can have different sources. In this paper we analyzed over 40 million articles from the 55 most developed language versions of Wikipedia to extract information about nearly 200 million references and find the most popular and reliable sources. We presented 10 models for the assessment of the popularity and reliability of the sources based on analysis of meta information about the references in Wikipedia articles, page views and authors of the articles. Using DBpedia and Wikidata we automatically identified the alignment of the sources to a specific domain. Additionally, we analyzed the changes of popularity and reliability in time and identified growth leaders in each considered months. The results can be used for quality improvements of the content in different languages versions of Wikipedia.

In this paper we describe and exploit a geometric framework for Gibbs probability densities and the associated concepts in statistical mechanics, which unifies several earlier works on the subject, including Souriau's symplectic model of statistical mechanics, its polysymplectic extension, Koszul model, and approaches developed in quantum information geometry. We emphasize the role of equivariance with respect to Lie group actions and the role of several concepts from geometric mechanics, such as momentum maps, Casimir functions, coadjoint orbits, and Lie-Poisson brackets with cocycles, as unifying structures appearing in various applications of this framework to information geometry and machine learning. For instance, we discuss the expression of the Fisher metric in presence of equivariance and we exploit the property of the entropy of the Souriau model as a Casimir function to apply a geometric model for energy preserving entropy production. We illustrate this framework with several examples including multivariate Gaussian probability densities, and the Bogoliubov-Kubo-Mori metric as a quantum version of the Fisher metric for quantum information on coadjoint orbits. We exploit this geometric setting and Lie group equivariance to present symplectic and multisymplectic variational Lie group integration schemes for some of the equations associated to Souriau symplectic and polysymplectic models, such as the Lie-Poisson equation with cocycle.

In this study, we investigate the formation of dynamical energy cascades in higher-order KdV-type equations. In the beginning, we recall what is known about the dynamic cascades for the classical KdV (quadratic) and mKdV (cubic) equations. Then, we investigate further the mKdV case by considering a richer set of initial perturbations in order to check the validity and persistence of various facts previously established for the narrow-banded perturbations. Afterwards, we focus on higher-order nonlinearities (quartic and quintic) which are found to be quite different in many respects from the mKdV equation. Throughout this study, we consider both the direct and double energy cascades. It was found that the dynamic cascade is always formed, but its formation is not necessarily accompanied by the nonlinear stage of the modulational instability. Direct cascade structure remains invariant regardless of the size of the spectral domain. In contrast, the double cascade shape can depend on the size of the spectral domain, even if the total number of cascading modes remains invariant. Results obtained in this study can be potentially applied to plasmas, free surface and internal wave hydrodynamics.

At least 15% of the population in the world has some type of disability. Unfortunately, this population has the problem of facing various accessibility barriers, to which technological barriers are also added. One of the most relevant obstacles is the one that arises as a result of the development of the technology itself when using the Information and Communication Technologies (ICT). Therefore, the objective of this article is to review the main uses of the Semantic Web tools and to group them together in order to be able to propose the design and construction of more personalized and flexible systems, which allows to help people with disabilities to perform some type of activity using ICT, in this way, knowledge can be modeled in different domains related to people who have some type of disability, using ontologies, and some ontological models can be reused for various types of disability depending on the case study. The usefulness of this study is to reveal that with the models presented, it is possible to construct a Meta ontology that includes some or all areas of disability.

The Stochastic Optimisation Software (SOS) is a Java platform facilitating the algorithmic design process and the evaluation of metaheuristic optimisation algorithms. It reduces the burden of coding miscellaneous methods for dealing with several bothersome and time-demanding tasks such as parameter tuning, implementation of comparison algorithms and testbed problems, collecting and processing data to display results, measuring algorithmic overhead, etc. SOS provides numerous off-the-shelf methods including 1) customised implementations of statistical tests, such as the Wilcoxon Rank-Sum test and the Holm-Bonferroni procedure, for comparing performances of optimisation algorithms and automatically generate result tables in PDF and LaTeX formats; 2) the implementation of an original advanced statistical routine for accurately comparing couples of stochastic optimisation algorithms; 3) the implementation of a novel testbed suite for continuous optimisation, derived from the IEEE CEC 2014 benchmark, allowing for controlled activation of the rotation operator. each testbed function. Moreover, this article comments on the current state of the literature in stochastic optimisation and highlights similarities shared by modern metaheuristics inspired by nature. It is argued that the vast majority of these algorithms are simply a reformulation of the same methods and that metaheuristics for optimisation should be simply treated as stochastic processes with less emphasis on the inspiring metaphor behind them.

Many people can take photos with smartphones and easily post photos via SNS (Social Network Services). This has caused a social problem that unintended appearance in photos may threaten the privacy of photographed persons. For this issue, numerous studies have already been introduced to prevent the unintended appearance in photos from the photographer’s side, but only a few methods tackled this from the photographed person's side. Therefore, we considered calling attention to a situation that a photo-taking behavior by a photographer can be automatically detected by using a wearable camera worn by a photographed person. In this paper, we propose an approach to detect photo-taking behaviors in video data taken from the wearable camera, analyzing specific human skeleton information. OpenPose is utilized to obtain the human’s skeleton information and the time-series data are analyzed. In addition, we compare two similar behaviors which are photo-taking behaviors and net-surfing behaviors. These video data are distinguished by DP matching and cross-validation. Finally, it is concluded that the detection accuracy of photo-taking behaviors is about 92.5%, which is satisfactory enough for this research purpose.

The purpose of this paper is to bring to light a method through which the global in time existence for arbitrary large in H¹ initial data of a strong solution to 3D periodic Navier-Stokes equations follows. The method consists of subdividing the time interval of existence into smaller sub-intervals carefully chosen. These sub-intervals are chosen based on the hypothesis that for any wavenumber m, one can find an interval of time on which the energy quantized in low-frequency components (up to m) of the solution u is lesser than the energy quantized in high-frequency components (down to m) or otherwise the opposite. We associate then a suitable number m to each one of the intervals and we prove that the norm ||u(t)||_H1 is bounded in both mentioned cases. The process can be continued until reaching the maximal time of existence T_max which yields the global in time existence of strong solution.

In 2020, the pandemic caused by the Coronaviruses (CoV) that are a large family of viruses that cause illness ranging from the common cold to more severe diseases such as Middle East Respiratory Syndrome (MERS-CoV) and Severe Acute Respiratory Syndrome (SARS-CoV2). The Coronavirus disease (COVID-19) is a new strain that was discovered in 2019 and has not been previously identified in humans. It is the high time to investigate the quantitative and/or qualitative genomic informations of the virus SARS-CoV2 in order to strengthen the healthcare facility to fight against this viral disease. In this article, a through quantitative understanding of the purine and pyrimidine spatial distribution/organization of all 89 complete sequences of SARS-CoV (available as on date in the NCBI virus database, is made using different parameters such as fractal dimension, Hurst exponent, Shannon entropy and GC content of the nucleotide sequences of the genome of SARS-CoV2. Also a cluster among all the the SARS-CoV sequences of nucleotide have been made based on their phylogeny made through their closeness (Hamming distance) based on respective purine-pyrimidine distribution.

In a generalized topological space Tg = (Ω, Tg), generalized interior and generalized closure operators g-Intg, g-Clg : P (Ω) −→ P (Ω), respectively, are merely two of a number of generalized primitive operators which may be employed to topologize the underlying set Ω in the generalized sense. Generalized exterior and generalized frontier operators g-Extg, g-Frg : P (Ω) −→ P (Ω), respectively, are other generalized primitive operators by means of which characterizations of generalized operations under g-Intg, g-Clg : P (Ω) −→ P (Ω) can be given without even realizing generalized interior and generalized closure operations first in order to topologize Ω in the generalized sense. In a recent work, the present authors have defined novel types of generalized interior and generalized closure operators g-Intg, g-Clg : P (Ω) −→ P (Ω), respectively, in Tg and studied their essential properties and commutativity. In this work, they propose to present novel definitions of generalized exterior and generalized frontier operators g-Extg, g-Frg : P (Ω) −→ P (Ω), respectively, a set of consistent, independent axioms after studying their essential properties, and established further characterizations of generalized operations under g-Intg, g-Clg : P (Ω) −→ P (Ω) in Tg.

Restricted Boltzmann machines (RBMs) are the building blocks of some deep learning networks. However, despite their importance, it is our perception that some very important derivations about the RBM are missing in the literature, and a beginner may feel RBM very hard to understand. We provide here these missing derivations. We cover the classic Bernoulli-Bernoulli RBM and the Gaussian-Bernoulli RBM, but leave out the ``continuous'' RBM as it is believed not as mature as the former two. This tutorial can be used as a companion or complement to the famous RBM paper ``Training restricted Boltzmann machines: An introduction'' by Fisher and Igel.

Comments are exploited by product vendors to measure satisfaction of consumers. With the advent of Natural Language Processing (NLP), comments on Google Play can be processed to extract knowledge on applications such as their reputation. Proposals in that direction are either informal or interested merely on functionality. Unlike, this work aims to determine reputation of Android applications in terms of confidentiality, integrity, availability and authentication (CIAA). This work proposes a model of assessing app reputation relying on sentiment analysis and text analysis of comments. While assuming that comments are reliable, we collect Google Play applications subject to comments which include security keywords. An in-depth analysis of keywords based on Naive Bayes classification is made to provide polarity of any comment. Based on comment polarity, reputation is evaluated for the whole application. Experiments made on real applications including dozens to billions of comments, reveal that developers lack to make efforts to guarantee CIAA services. A fine-grained analysis shows that not security reputed applications can be reputed in specific CIAA services. Results also show that applications with negative security polarities display in general positive functional polarities. This result suggests that security checking should include careful comment analysis to improve security of applications.

HTTP/2 video streaming has caught a lot of attentions in the development of multimedia technologies over the last few years. In HTTP/2, the server push mechanism allows the server to deliver more video segments to the client within a single request in order to deal with the requests explosion problem. As a result, recent research efforts have been focusing on utilizing such a feature to enhance the streaming experience while reducing the request-related overhead. However, current works only optimize the performance of a single client, without necessary concerns of possible influences on other clients in the same network. When multiple streaming clients compete for a shared bandwidth in HTTP/1.1, they are likely to suffer from unfairness, which is defined as the inequality in their bitrate selections. For HTTP/1.1, existing works have proven that the network-assisted solutions are effective in solving the unfairness problem. However, the feasibility of utilizing such an approach for the HTTP/2 server push has not been investigated. Therefore, in this paper, a novel proxy-based framework is proposed to overcome the unfairness problem in adaptive streaming over HTTP/2 with the server push. Experimental results confirm the outperformance of the proposed framework in ensuring the fairness, assisting the clients to avoid rebuffering events and lower bitrate degradation amplitude, while maintaining the mechanism of the server push feature.

The detection performance of small objects in remote sensing images is not 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) shows remarkable image enhancement performance, but reconstructed images miss high-frequency edge information. Therefore, object detection performance degrades for the small objects on recovered noisy and low-resolution remote sensing images. Inspired by the success of edge enhanced GAN (EEGAN) and ESRGAN, we apply a new edge-enhanced super-resolution GAN (EESRGAN) to improve the image quality of remote sensing images and used different detector networks in an end-to-end manner where detector loss is backpropagated into the EESRGAN to improve the detection performance. We propose an architecture with three components: ESRGAN, Edge Enhancement Network (EEN), and Detection network. We use residual-in-residual dense blocks (RRDB) for both the GAN and EEN, and for the detector network, we use the faster region-based convolutional network (FRCNN) (two-stage detector) and single-shot multi-box detector (SSD) (one stage detector). Extensive experiments on car overhead with context and oil and gas storage tank (created by us) data sets show superior performance of our method compared to the standalone state-of-the-art object detectors.

The popularity of deep reinforcement learning (DRL) methods in economics have been exponentially increased. DRL through a wide range of capabilities from reinforcement learning (RL) and deep learning (DL) for handling sophisticated dynamic business environments offers vast opportunities. DRL is characterized by scalability with the potential to be applied to high-dimensional problems in conjunction with noisy and nonlinear patterns of economic data. In this work, we first consider a brief review of DL, RL, and deep RL methods in diverse applications in economics providing an in-depth insight into the state of the art. Furthermore, the architecture of DRL applied to economic applications is investigated in order to highlight the complexity, robustness, accuracy, performance, computational tasks, risk constraints, and profitability. The survey results indicate that DRL can provide better performance and higher accuracy as compared to the traditional algorithms while facing real economic problems at the presence of risk parameters and the ever-increasing uncertainties.

Alzheimer's disease (AD) detection acting as an essential role in global health care due to misdiagnosis and sharing many clinical sets with other types of dementia, and costly monitoring the progression of the disease over time by magnetic reasoning imaging (MRI) with consideration of human error in manual reading. This paper goal a comparative study on the performance of data mining techniques on two datasets of Clinical and Neuroimaging Tests with AD. Our proposed model in the first stage, Apply clinical medical dataset to a composite hybrid feature selection (CHFS), for extract new features to select the best features due to eliminating obscures features, In parallel with Apply a novel hybrid feature extraction of three batch edge detection algorithm and texture from MRI images dataset and optimized with fuzzy 64-bin histogram. In the second stage, we applied a clinical dataset to a stacked hybrid classification(SHC) model to combine Jrip and random forest classifiers with six model evaluations as meta-classifier individually to improve the prediction of clinical diagnosis. At the same stage of improving the classification accuracy of neuroimaging (MRI) dataset images by applying a convolution neural network (CNN) in comparison with traditional classifiers, running on extracted features from images. The authors have collected the clinical dataset of 426 subjects with (1229 potential patient sample) from oasis.org and (MRI) dataset from a benchmark kaggle.com with a total of around ~5000 images each segregated into the severity of Alzheimer's. The datasets evaluated using an explorer set of weka data mining software for the analysis purpose. The experimental show that the proposed model of ‏(CHFS) feature extraction ‏ lead to effectively reduced the false-negative rate with a relatively high overall accuracy with a stack hybrid classification of support vector machine (SVM) as meta-classifier of 96.50% compared to 68.83% of the previous result on a clinical dataset, Besides a compared model of CNN classification on MRI images dataset of 80.21%. The results showed the superiority of our CHFS model in predicting Alzheimer's disease more accurately with the clinical medical dataset in early-stage compared with the neuroimaging (MRI) dataset. The results of the proposed model were able to predict with accurately classify Alzheimer's clinical samples at a low cost in comparison with the MRI-CNN images model at the early stage and get a good indicator for high classification rate for MRI images when applying our proposed model of SHC.

Breast cancer is a significant health issue across the world. Breast cancer is the most widely-diagnosed cancer in women; early-stage diagnosis of disease and therapies increase patient safety. This paper proposes a synthetic model set of features focused on the optimization of the genetic algorithm (CHFS-BOGA) to forecast breast cancer. This hybrid feature selection approach combines the advantages of three filter feature selection approaches with an optimize Genetic Algorithm (OGA) to select the best features to improve the performance of the classification process and scalability. We propose OGA by improving the initial population generating and genetic operators using the results of filter approaches as some prior information with using the C4.5 decision tree classifier as a fitness function instead of probability and random selection. The authors collected available updated data from Wisconsin UCI machine learning with a total of 569 rows and 32 columns. The dataset evaluated using an explorer set of weka data mining open-source software for the analysis purpose. The results show that the proposed hybrid feature selection approach significantly outperforms the single filter approaches and principal component analysis (PCA) for optimum feature selection. These characteristics are good indicators for the return prediction. The highest accuracy achieved with the proposed system before (CHFS-BOGA) using the support vector machine (SVM) classifiers was 97.3%. The highest accuracy after (CHFS-BOGA-SVM) was 98.25% on split 70.0% train, remainder test, and 100% on the full training set. Moreover, the receiver operating characteristic (ROC) curve was equal to 1.0. The results showed that the proposed (CHFS-BOGA-SVM) system was able to accurately classify the type of breast tumor, whether malignant or benign.

Alzheimer's disease (AD) is a significant regular type of dementia that causes damage in brain cells. Early detection of AD acting as an essential role in global health care due to misdiagnosis and sharing many clinical sets with other types of dementia, and costly monitoring the progression of the disease over time by magnetic reasoning imaging (MRI) with consideration of human error in manual reading. Our proposed model, in the first stage, apply the medical dataset to a composite hybrid feature selection (CHFS) to extract new features for select the best features to improve the performance of the classification process due to eliminating obscures features. In the second stage, we applied a dataset to a stacked hybrid classification system to combine Jrip and random forest classifiers with six model evaluations as meta-classifier individually to improve the prediction of clinical diagnosis. All experiments conducted on a laptop with an Intel Core i7- 8750H CPU at 2.2 GHz and 16 G of ram running on windows 10 (64 bits). The dataset evaluated using an explorer set of weka data mining software for the analysis purpose. The experimental show that the proposed model of ‏(CHFS) feature extraction ‏performs better than principal component analysis (PCA), and lead to effectively reduced the false-negative rate with a relatively high overall accuracy with support vector machine (SVM) as meta-classifier of 96.50% compared to 68.83% which is considerably better than the previous state-of-the-art result. The receiver operating characteristic (ROC) curve was equal to 95.5%. Also, the experiment on MRI images Kaggle dataset of CNN classification process with 80.21% accuracy result. The results of the proposed model show an accurate classify Alzheimer's clinical samples against MRI neuroimaging for diagnoses AD at a low cost.

The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group $G$ with relations. A valid subgroup $H$ of index $d$ in $G$ leads to a \lq magic' state $\left|\psi\right\rangle$ in $d$-dimensional Hilbert space that encodes a minimal informationally complete quantum measurement (or MIC), possibly carrying a finite \lq contextual' geometry. In the present work, we choose $G$ as the fundamental group $\pi_1(V)$ of an exotic $4$-manifold $V$, more precisely a \lq small exotic' (space-time) $R^4$ (that is homeomorphic and isometric, but not diffeomorphic to the Euclidean $\mathbb{R}^4$). Our selected example, due to to S. Akbulut and R.~E. Gompf, has two remarkable properties: (a) it shows the occurence of standard contextual geometries such as the Fano plane (at index $7$), Mermin's pentagram (at index $10$), the two-qubit commutation picture $GQ(2,2)$ (at index $15$) as well as the combinatorial Grassmannian Gr$(2,8)$ (at index $28$) , (b) it allows the interpretation of MICs measurements as arising from such exotic (space-time) $R^4$'s. Our new picture relating a topological quantum computing and exotic space-time is also intended to become an approach of \lq quantum gravity'.

The paper demonstrates the analysis of Corona Virus Disease based on a probabilistic model. It involves a technique for classification and prediction by recognizing typical and diagnostically most important CT images features relating to Corona Virus. The main contributions of the research include predicting the probability of recurrences in no recurrence (first time detection) cases at applying our proposed approach for feature extraction. The combination of the conventional statistical and machine learning tools is applied for feature extraction from CT images through four images filters in combination with proposed composite hybrid feature extraction (CHFS). The selected features were classified by the stack hybrid classification system(SHC). Experimental study with real data demonstrates the feasibility and potential of the proposed approach for the said cause.

The purpose of this paper is to prove strong convergent theorems for Browder's type iterations and Halpern's type iterations of a family of nonexpansive mappings in a complete geodesic space with curvature bounded above by a positive number. Moudafi's viscosity type methods are also discussed without the nice projection property.

The purpose of this paper is to bring to light a method through which the global in time existence for arbitrary large in H¹ initial data of a strong solution to 3D periodic Navier-Stokes equations follows. The method consists of subdividing the time interval of existence into smaller sub-intervals carefully chosen. These sub-intervals are chosen based on the hypothesis that for any wavenumber m, one can find an interval of time on which the energy quantized in low-frequency components (up to m) of the solution u is lesser than the energy quantized in high-frequency components (down to m) or otherwise the opposite. We associate then a suitable number m to each one of the intervals and we prove that the norm ||u(t)||_H1 is bounded in both mentioned cases. The process can be continued until reaching the maximal time of existence T_max which yields the global in time existence of strong solution.

Prediction of stock groups values has always been attractive and challenging for shareholders. This paper concentrates on the future prediction of stock market groups. Four groups named diversified financials, petroleum, non-metallic minerals and basic metals from Tehran stock exchange are chosen for experimental evaluations. Data are collected for the groups based on ten years of historical records. The values predictions are created for 1, 2, 5, 10, 15, 20 and 30 days in advance. The machine learning algorithms utilized for prediction of future values of stock market groups. We employed Decision Tree, Bagging, Random Forest, Adaptive Boosting (Adaboost), Gradient Boosting and eXtreme Gradient Boosting (XGBoost), and Artificial neural network (ANN), Recurrent Neural Network (RNN) and Long short-term memory (LSTM). Ten technical indicators are selected as the inputs into each of the prediction models. Finally, the result of predictions is presented for each technique based on three metrics. Among all algorithms used in this paper, LSTM shows more accurate results with the highest model fitting ability. Also, for tree_based models, there is often an intense competition between Adaboost, Gradient Boosting and XGBoost.

The fact is quite transparent that almost everybody around the world is using android apps. Half of the population of this planet is associated with messaging, social media, gaming, and browsers. This online marketplace provides free and paid access to users. On the Google Play store, users are encouraged to download countless of applications belonging to predefined categories. In this research paper, we have scrapped thousands of users reviews and app ratings. We have scrapped 148 apps’ reviews from 14 categories. We have collected 506259 reviews from Google play store and subsequently checked the semantics of reviews about some applications form users to determine whether reviews are positive, negative, or neutral. We have evaluated the results by using different machine learning algorithms like Naïve Bayes, Random Forest, and Logistic Regression algorithm. we have calculated Term Frequency (TF) and Inverse Document Frequency (IDF) with different parameters like accuracy, precision, recall, and F1 and compared the statistical result of these algorithms. We have visualized these statistical results in the form of a bar chart. In this paper, the analysis of each algorithm is performed one by one, and the results have been compared. Eventually, We've discovered that Logistic Regression is the best algorithm for a review-analysis of all Google play store. We have proved that Logistic Regression gets the speed of precision, accuracy, recall, and F1 in both after preprocessing and data collection of this dataset.

Google play store allow the user to download a mobile application (app) and user get inspired by the rating and reviews of the mobile app. A recent study analyzes that user preferences, user opinion for improvement, user sentiment about particular feature and detail with descriptions of experiences are very useful for an application developer. However, many application reviews are very large and difficult to process manually. Star rating is given of the whole application and the developer cannot analyze the single feature. In this research, we have scrapped 282,231 user reviews through different data scraping techniques. We have applied the text classification on these user reviews. We have applied different algorithms and find the precision, accuracy, F1 score and recall. In evaluated results, we have to find the best algorithm.

Purpose of this article is to introduce a modification of Phillips operators on the interval $\left[ \frac{1}{2},\infty \right) $ via Dunkl generalization. This type of modification enables a better error estimation on the interval $\left[ \frac{1}{2},\infty \right) $ rather than the classical Dunkl Phillips operators on $\left[ 0,\infty \right) $. We discuss the convergence results and obtain the degrees of approximations. Furthermore, we calculate the rate of convergence by means of modulus of continuity, Lipschitz type maximal functions, Peetre's $K$-functional and second order modulus of continuity.

This paper surveys deep learning algorithms, IoT cyber security and risk models, and established mathematical formulas to identify the best approach for developing a dynamic and self-adapting system for predictive cyber risk analytics supported with Artificial Intelligence and Machine Learning and real-time intelligence in edge computing. The paper presents a new mathematical approach for integrating concepts for cognition engine design, edge computing and Artificial Intelligence and Machine Learning to automate anomaly detection. This engine instigates a step change by applying Artificial Intelligence and Machine Learning embedded at the edge of IoT networks, to deliver safe and functional real-time intelligence for predictive cyber risk analytics. This will enhance capacities for risk analytics and assists in the creation of a comprehensive and systematic understanding of the opportunities and threats that arise when edge computing nodes are deployed, and when Artificial Intelligence and Machine Learning technologies are migrated to the periphery of the internet and into local IoT networks.

While visual assessment is the standard technique for burn evaluation, computer-aided diagnosis is increasingly sought due to high number of incidences globally. Patients are increasingly facing challenges which are not limited to shortage of experienced clinicians, lack of accessibility to healthcare facilities, and high diagnostic cost. Certain number of studies were proposed in discriminating burn and healthy skin using machine learning leaving a huge and important gap unaddressed; whether burns and related skin injuries can be effectively discriminated using machine learning techniques. Therefore, we specifically use pre-trained deep learning models due to deficient dataset to train a new model from scratch. Experiments were extensively conducted using three state-of-the-art pre-trained deep learning models that includes ResNet50, ResNet101 and ResNet152 for image patterns extraction via two transfer learning strategies: fine-tuning approach where dense and classification layers were modified and trained with features extracted by base layers, and in the second approach support vector machine (SVM) was used to replace top-layers of the pre-trained models, trained using off-the-shelf features from the base layers. Our proposed approach records near perfect classification accuracy of approximately 99.9%.

In this paper, we address the problem of car detection from aerial images using Convolutional Neural Networks (CNN). This problem presents additional challenges as compared to car (or any object) detection from ground images because features of vehicles from aerial images are more difficult to discern. To investigate this issue, we assess the performance of two state-of-the-art CNN algorithms, namely Faster R-CNN, which is the most popular region-based algorithm, and YOLOv3, which is known to be the fastest detection algorithm. We analyze two datasets with different characteristics to check the impact of various factors, such as UAV's altitude, camera resolution, and object size. The objective of this work is to conduct a robust comparison between these two cutting-edge algorithms. By using a variety of metrics, we show that YOLOv3 yields better performance in most configurations, except that it exhibits a lower recall and less confident detections when object sizes and scales in the testing dataset differ largely from those in the training dataset.

The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. This is known as the strong Goldbach's conjecture. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A principal complexity class is NSPACE(S(n)) for some S(n). We show if the weak Goldbach's conjecture is true, then the problem PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n). This proof is based on the assumption that if some language belongs to NSPACE(S(n)), then the unary version of that language belongs to NSPACE(S(log n)) and vice versa. However, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples. Since Harald Helfgott proved that the weak Goldbach's conjecture is true, then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples, where the case of infinite number of counterexamples statistically seems to be unlikely. In addition, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Twin prime conjecture is true. Moreover, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Beal's conjecture is true. Since the Beal's conjecture is a generalization of Fermat's Last Theorem, then this is also a simple and short proof for that Theorem. In mathematics, the Riemann hypothesis is consider to be the most important unsolved problem in pure mathematics. If PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Riemann hypothesis 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

In this work, the problem is considered for eliminating a non-uniform rectilinear smearing of an image by mathematical and computer-based way, for example, a picture of several cars taken with a fixed camera and moving with different speeds. The problem is described by a set of 1-dimensional Fredholm integral equations (IEs) of the first kind of convolution type with a 1-dimensional point spread function (PSF) at uniform smearing and by a set of new 1-dimensional IEs of a general type (not convolution type) with a 2-dimensional PSF at non-uniform smearing. The problem is also described by one 2-dimensional IE of convolution type with a 2-dimensional PSF at uniform smearing and by a new 2-dimensional IE of a general type with a 4-dimensional PSF at non-uniform smearing. The problem for solving Fredholm IE of the first kind is ill-posed (unstable). Therefore, IEs of convolution type are solved by the Fourier transform (FT) method and Tikhonov's regularization (TR), and IEs of general type are solved by the quadrature/cubature and TR methods. Moreover, the magnitude of the image smear Δ is determined by the original “spectral method”, which increases the accuracy of image restoration. It is shown that the use of a set of 1-dimensional IEs is preferable to one 2-dimensional IE in the case of non-uniform smearing. In the inverse problem (image restoration), the Gibbs effect (the effect of false waves) in the image may occur. It can be edge or inner. The edge effect is well suppressed by the proposed technique “diffusing the edges". In the case of an inner effect, it is eliminated with difficulty, but the image smearing itself plays the role of diffusing and suppresses the inner Gibbs effect to a large extent. It is shown (in the presence of impulse noise in an image) that the well-known Tukey median filter can distort the image itself, and the Gonzalez adaptive filter also distorts the image (but to a lesser extent). We propose a modified adaptive filter. A software package was developed in MatLab and illustrative calculations are performed.

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.

Phishing is a set of devastating techniques which lure target users to provide critical resources. They are successful because they rely on human weaknesses. Gamification which is a recent and non-traditional learning method with purpose to motivate and engage user to carry out activities, is more and more applied to prevent such cyber threats. This paper provides the first survey of gamified solutions dedicated to educate against phishing from 2007 to 2019. The investigation is conducted on eight proposals in terms of core concepts, game mechanics and learning process. We provide three taxonomies of dimensions to systematically characterize researches on gamified solutions, discuss lacks of surveyed works and opens further orientations to enhance this research area. Some key results are: solutions do not consider elementary level of knowledge and do no offer basic notions; solutions are not adapted to general audience and therefore not reliably applicable in different contexts; platforms partially educate about phishing; learners are evaluated predictably and within a short period. This study constitutes a cornerstone to understand and enhance research on phishing education.

Periodic travelling waves are observed in various brain activities including visual, motor, language, sleep, and so on. There are several neural field models describing periodic waves assuming nonlocal interaction and, possibly, inhibition, time delay, or some other properties. In this work we study the influence of asymmetric connectivity functions and of time delay on the emergence of periodic waves and on their properties. Nonlinear wave dynamics is studied, including modulated and aperiodic waves. Multiplicity of waves for the same values of parameters is observed. External stimulation in order to restore wave propagation in a damaged tissue is discussed.

In this paper, by using the q-integer, we introduce a new generalization of Fibonacci and Lucas sedenions called q-Fibonacci and q-Lucas sedenions. We present some fundamental properties of these type of sedenions such as Binet formulas, exponential generating fuctions, summation formulas, Catalan's identity, Cassini's identity and d'Ocagne's identity.

Interval-valued functions have been widely used to accommodate data inexactness in optimization and decision theory. In this paper, we study interval-valued vector optimization problems, and derive their relationships to interval variational inequality problems, of both Stampacchia and Minty types. Using the concept of interval approximate convexity, we establish necessary and sufficient optimality conditions for local strong quasi and approximate $LU$-efficient solutions to nonsmooth optimization problems with interval-valued multiobjective functions.

Management of crowding at subway platform is essential to improving services, preventing train delays and ensuring passenger safety. Establishing effective measures to mitigate crowding at platform requires accurate estimation of actual crowding levels. At present, there are temporal and spatial constraints since subway platform crowding is assessed only at certain locations, done every 1~2 years, and counting is performed manually Notwithstanding, data from smart cards is considered real-time big data that is generated 24 hours a day and thus, deemed appropriate basic data for estimating crowding. This study proposes the use of smart card data in creating a model that dynamically estimates crowding. It first defines crowding as demand, which can be translated into passengers dynamically moving along a subway network. In line with this, our model also identifies the travel trajectory of individual passengers, and is able to calculate passenger flow, which concentrates and disperses at the platform, every minute. Lastly, the level of platform crowding is estimated in a way that considers the effective waiting area of each platform structure.

This paper focuses on quantifying the uncertainty in the specific absorption rate values of brain induced by the uncertain positions of the electroencephalography electrodes placed on patient's scalp. To avoid running a large number of simulations, an artificial neural network architecture for uncertainty quantification involving high-dimensional data is proposed in this paper. The proposed method is demonstrated to be an attractive alternative to conventional uncertainty quantification methods because of its considerable advantage in the computational expense and speed.

In 1969, Jean-Marie Souriau introduced a “Lie Groups Thermodynamics” in Statistical Mechanics in the framework of Geometric Mechanics. This Souriau’s model considers the statistical mechanics of dynamic systems in their "space of evolution" associated to a homogeneous symplectic manifold by a Lagrange 2-form, and defines in case of non null cohomology (non equivariance of the coadjoint action on the moment map with appearance of an additional cocyle) a Gibbs density (of maximum entropy) that is covariant under the action of dynamic groups of physics (eg, Galileo's group in classical physics). Souriau Lie Group Thermodynamics was also addressed 30 years after Souriau by R. F. Streater in the framework of Quantum Physics by Information Geometry for some Lie algebras, but only in the case of null cohomology. Souriau method could then be applied on Lie Groups to define a covariant maximum entropy density by Kirillov representation theory. We will illustrate this method for homogeneous Siegel domains and more especially for Poincaré unit disk by considering SU(1,1) group coadjoint orbit and by using its Souriau’s moment map. For this case, the coadjoint action on moment map is equivariant. For non-null cohomology, we give the case of Lie group SE(2). Finally, we will propose a new geometric definition of Entropy that could be built as a generalized Casimir invariant function in coadjoint representation, and Massieu characteristic function, dual of Entropy by Legendre transform, as a generalized Casimir invariant function in adjoint representation, where Souriau cocycle is a measure of the lack of equivariance of the moment mapping.

We present a general process for the halting problem, valid regardless of the time and space computational complexity of the decision problem. It can be interpreted as the maximization of entropy for the utility function of a given Shannon-Kolmogorov-Bernoulli process. Applications to non-polynomials problems are given. The new interpretation of information rate proposed in this work is a method that models the solution space boundaries of any decision problem (and non polynomial problems in general) as a communication channel by means of Information Theory. We described a sort method that order objects using the intrinsic information content distribution for the elements of a constrained solution space - modeled as messages transmitted through any communication systems. The limits of the search space are defined by the Kolmogorov-Chaitin complexity of the sequences encoded as Shannon-Bernoulli strings. We conclude with a discussion about the implications for general decision problems in Turing machines.

Modern energy systems collect high volumes of data that can provide valuable information about energy consumption. Electric companies can now use historical data to make informed decisions on energy production by forecasting the expected demand. Many deep learning models have been proposed to deal with these type of time series forecasting problems. Deep neural networks, such as recurrent or convolutional, can automatically capture complex patterns in time series data and provide accurate predictions. In particular, Temporal Convolutional Networks (TCN) are a specialised architecture that has advantages over recurrent networks for forecasting tasks. TCNs are able to extract long-term patterns using dilated causal convolutions and residual blocks, and can also be more efficient in terms of computation time. In this work, we propose a TCN-based deep learning model to improve the predictive performance in energy demand forecasting. Two energy-related time series with data from Spain have been studied: the national electric demand, and the power demand at charging stations for electric vehicles. An extensive experimental study has been conducted, involving more than 1900 models with different architectures and parametrisations. The TCN proposal outperforms the forecasting accuracy of Long Short-Term Memory (LSTM) recurrent networks, which are considered the state-of-the-art in the field.

The aim of this survey is to review some recent developements in devising efficient preconditioners for sequences of linear systems A x = b. Such a problem arise in many scientific applications, such as discretization of transient PDEs, solution of eigenvalue problems, (Inexact) Newton method applied to nonlinear systems, rational Krylov methods for computing a function of a matrix. Full purpose preconditioners such as the Incomplete Cholesky (IC) factorization or approximate inverses are aimed at clustering eigenvalues of the preconditioned matrices around one. In this paper we will analyze a number of techniques of updating a given IC preconditioner (which we denote as P0 in the sequel) by a low-rank matrix with the aim of further improving this clustering. The most popular low-rank strategies are aimed at removing the smallest eigenvalues (deflation) or at shifting them towards the middle of the spectrum. The low-rank correction is based on a (small) number of linearly independent vectors whose choice is crucial for the effectiveness of the approach. In many cases these vectors are approximations of eigenvectors corresponding to the smallest eigenvalues of the preconditioned matrix P0 A. We will also review some techniques to efficiently approximate these vectors when incorporated within a sequence of linear systems all possibly having constant (or slightly changing) coefficient matrices. Numerical results concerning sequences arising from discretization of linear/nonlinear PDEs and iterative solution of eigenvalue problems show that the performance of a given iterative solver can be very much enhanced by the use of low-rank updates.

Data science is facing the following major challenges: (1) developing scalable cross-disciplinary capabilities, (2) dealing with the increasing data volumes and their inherent complexity, (3) building tools that help to build trust, (4) creating mechanisms to efficiently operate in the domain of scientific assertions, (5) turning data into actionable knowledge units and (6) promoting data interoperability. As a way to overcome these challenges, we further develop the proposals by early Internet pioneers for Digital Objects as encapsulations of data and metadata made accessible by persistent identifiers. In the past decade, this concept was revisited by various groups within the Research Data Alliance and put in the context of the FAIR Guiding Principles for findable, accessible, interoperable and reusable data. The basic components of a FAIR Digital Object (FDO) as a self-contained, typed, machine-actionable data package are explained. A survey of use cases has indicated the growing interest of research communities in FDO solutions. We conclude that the FDO concept has the potential to act as the interoperable federative core of a hyperinfrastructure initiative such as the European Open Science Cloud (EOSC).

Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as ``tournaplexes'', whose simplices are tournaments. In particular, given a digraph G, we associate with it a ``flag tournaplex'' which is a tournaplex containing the directed flag complex of G, but also the geometric realisation of cliques that are not directed. We define several types of filtrations on tournaplexes, and exploiting persistent homology, we observe that flag tournaplexes provide finer means of distinguishing graph dynamics than the directed flag complex. We then demonstrate the power of these ideas by applying them to graph data arising from the Blue Brain Project's digital reconstruction of a rat's neocortex.

The proliferation of mobile and IoT devices, coupled with the advances in the wireless communication capabilities of these devices, have urged the need for novel communication paradigms for such heterogeneous hybrid networks. Researchers have proposed opportunistic routing as a means to leverage the potentials offered by such heterogeneous networks. While several proposals for multiple opportunistic routing protocols exist, only a few have explored fuzzy logic to evaluate wireless links status in the network to construct stable and faster paths towards the destinations. We propose FQ-AGO, a novel Fuzzy Logic Q-learning Based Asymmetric Link Aware and Geographic Opportunistic Routing scheme that leverages the presence of long-range transmission links to assign forwarding candidates towards a given destination. The proposed routing scheme utilizes fuzzy logic to evaluate whether a wireless link is useful or not by capturing multiple network metrics, the available bandwidth, link quality, node transmission power, and distance progress. Based on the fuzzy logic evaluation, the proposed routing scheme employs a Q-learning algorithm to select the best candidate set toward the destination. We implement FQ-AGO on the NS-3 simulator and compare the performance of the proposed routing scheme with three other relevant protocols: AODV, DSDV, and GOR. For precise analysis, we consider various network metrics to compare the performance of the routing protocols. Our simulation result validates our analysis and demonstrates remarkable performance improvements in terms of total network throughput, packet delivery ration, and end-to-end delay.

The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. This is known as the strong Goldbach's conjecture. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A principal complexity class is NSPACE(S(n)) for some S(n). We show if the weak Goldbach's conjecture is true, then the problem PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n). This proof is based on the assumption that if some language belongs to NSPACE(S(n)), then the unary version of that language belongs to NSPACE(S(log n)) and vice versa. However, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples. Since Harald Helfgott proved that the weak Goldbach's conjecture is true, then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples, where the case of infinite number of counterexamples statistically seems to be unlikely. In addition, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Twin prime conjecture is true. Moreover, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Beal's conjecture is true. Since the Beal's conjecture is a generalization of Fermat's Last Theorem, then this is also a simple and short proof for that Theorem. Furthermore, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Riemann hypothesis cannot have a finite number of counterexamples.

Deep learning has achieved lots of successes in many fields, but when trainable sample are extremely limited, deep learning often under or overfitting to few samples. Meta-learning was proposed to solve difficulties in few-shot learning and fast adaptive areas. Meta-learner learns to remember some common knowledge by training on large scale tasks sampled from a certain data distribution to equip generalization when facing unseen new tasks. Due to the limitation of samples, most approaches only use shallow neural network to avoid overfitting and reduce the difficulty of training process, that causes the waste of many extra information when adapting to unseen tasks. Euclidean space-based gradient descent also make meta-learner's update inaccurate. These issues cause many meta-learning model hard to extract feature from samples and update network parameters. In this paper, we propose a novel method by using multi-stage joint training approach to post the bottleneck during adapting process. To accelerate adapt procedure, we also constraint network to Stiefel manifold, thus meta-learner could perform more stable gradient descent in limited steps. Experiment on mini-ImageNet shows that our method reaches better accuracy under 5-way 1-shot and 5-way 5-shot conditions.

Exploiting the linguistic knowledge of the source language for neural machine translation (NMT) has recently achieved impressive performance on many large-scale language pairs. However, since the Turkish→English machine translation task is low-resource and the source-side Turkish is morphologically-rich, there are limited resources of bilingual corpora and linguistic information available to further improve the NMT performance. Focusing on the above issues, we propose a multi-source NMT approach that models the word feature in parallel to external linguistic features by using two separate encoders to explicitly incorporate linguistic knowledge into the NMT model. We extend the word embedding layer of the knowledge-based encoder to accommodate for each word’s linguistic annotations in the context. Moreover, we share all parameters across encoders to enhance the representation ability of the NMT model on the source language. Experimental results show that our proposed approach achieves substantial improvements of up to 2.4 and 1.1 BLEU scores in Turkish→English and English→Turkish machine translation tasks, respectively, which points to a promising way to utilize the source-side linguistic knowledge for the low-resource NMT.

We present a general process for the halting problem, valid regardless of the time and space computational complexity of the decision problem. It can be interpreted as the maximization of entropy for the utility function of a given Shannon-Kolmogorov-Bernoulli process. Applications to non-polynomials problems are given. The new interpretation of information rate proposed in this work is a method that models the solution space boundaries of any decision problem (and non polynomial problems in general) as a communication channel by means of Information Theory. We described a sort method that order objects using the intrinsic information content distribution for the elements of a constrained solution space - modeled as messages transmitted through any communication systems. The limits of the search space are defined by the Kolmogorov-Chaitin complexity of the sequences encoded as Shannon-Bernoulli strings. We conclude with a discussion about the implications for general decision problems in Turing machines.

A regularization approach to model selection, within a generalized HJM framework, is introduced which learns the closest arbitrage-free model to a prespecified factor model. This optimization problem is represented as the limit of a one-parameter family of computationally tractable penalized model selection tasks. General theoretical results are derived and then specialized to affine term-structure models where new types of arbitrage-free machine learning models for the forward-rate curve are estimated numerically and compared to classical short-rate and the dynamic Nelson-Siegel factor models.

A significant attention has been made to the accurate detection of diabetes which is a big challenge for the research community to develop a diagnosis system to detect diabetes in a successful way in the IoT e-healthcare environment. Internet of Things (IOT) has emerging role in healthcare services which delivers a system to analyze the medical data for diagnosis of diseases applied data mining methods. The existing diagnosis systems have some drawbacks, such as high computation time, and low prediction accuracy. To handle these issues, we have proposed a IOT based diagnosis system using machine learning methods, such as preprocessing of data, feature selection, and classification for the detection of diabetes disease in e- healthcare environment. Model validation and performance evaluation metrics have been used to check the validity of the proposed system. We have proposed a filter method based on the Decision Tree (Iterative Dichotomiser 3) algorithm for highly important feature selection. Two ensemble learning Decision Tree algorithms, such as Ada Boost and Random Forest are also used for feature selection and compared the classifier performance with wrapper based feature selection algorithms also. Machine learning classifier Decision Tree has been used for the classification of healthy and diabetic subjects. The experimental results show that the Decision Tree algorithm based on selected features improves the classification performance of the predictive model and achieved optimal accuracy. Additionally, the proposed system performance is high as compared to the previous state-of-the-art methods. High performance of the proposed method is due to the different combinations of selected features set and GL, DPF, and BMI are more significantly important features in the dataset for prediction of diabetes disease. Furthermore, the experimental results statistical analysis demonstrated that the proposed method would be effectively detected diabetes disease and can easily be deployed in IOT wireless sensor technologies based e-healthcare environment.

Electromyographic (EMG) signals provide information about a person's muscle activity. For hand movements, in particular, the execution of each gesture involves the activation of different combinations of the forearm muscles, which generate distinct electrical patterns. Conversely, the analysis of these muscle activation patterns, represented by EMG signals, allows recognizing which gesture is being performed. In this study, we aimed to implement an automatic identification system of hand or wrist gestures based on supervised Machine Learning (ML) techniques. We trained different computational models and determined which of these showed the best capacity to identify six hand or wrist gestures and generalize between different subjects. We used an open access database containing recordings of EMG signals from 36 subjects. Among the results obtained, we highlight the performance of the Random Forest model, with an accuracy of 95.39%, and the performance of a convolutional neural network with an accuracy of 94.77%.

In this study, we first present a time-fractional L$\hat{e}$vy diffusion equation of the exponential option pricing models of European option pricing and the risk-neutral parameter. Then, we modify a particular L$\hat{e}$vy-time fractional diffusion equation of European-style options. Introduce a more general model from the models based on the L$\hat{e}$vy-time fractional diffusion equation and review some recent findings regarding of the Europe option pricing of risk-neutral free.

We construct a family of two-step optimal fourth order iterative methods for finding single root of non-linear equations. We generalize these methods to simultaneous iterative methods for determining all the distinct as well as multiple roots of single variable non-linear equations. Convergence analysis is present for both cases to show that the order of convergence is four in case of single root finding method and is twelve for simultaneous determination of all roots of non-linear equation. The computational cost, Basin of attraction, efficiency, log of residual and numerical test examples shows, the newly constructed methods are more efficient as compared to the existing methods in literature.

The ongoing outbreak of the novel coronavirus pneumonia (also known as COVID-19) has triggered a series of stringent control measures in China, such as city closure, traffic restrictions, contact tracing and household quarantine. These containment efforts often lead to changes in the contact pattern among individuals of the population. Many existing compartmental epidemic models fail to account for the effects of contact structure. In this paper, we devised a pairwise epidemic model to analyze the COVID-19 outbreak in China based on confirmed cases reported during the period February 3rd--17th, 2020. By explicitly incorporating the effects of family clusters and contact tracing followed by household quarantine and isolation, our model provides a good fit to the trajectory of COVID-19 infections and is useful to predict the epidemic trend. We obtained the average of the reproduction number $R=1.494$ ($95\%$ CI: $1.483-1.507$) for Hubei province and $R=1.178$ ($95\%$ CI: $1.145-1.158$) for China (except Hubei), suggesting that some existing studies may have overestimated the reproduction number by neglecting the dynamical correlations and clustering effects. We forecasted that the COVID-19 epidemic would peak on February 13th ($95\%$ CI: February $9-17$th) in Hubei and 6 days eariler in the regions outside Hubei. Moreover the epidemic was expected to last until the middle of March in China (except Hubei) and late April in Hubei. The sensitivity analysis shows that ongoing exposure for the susceptible and population clustering play an important role in the disease propagation. With the enforcement of household quarantine measures, the reproduction number $R$ effectively reduces and epidemic quantities decrease accordingly. Furthermore, we gave an answer to the public concern on how long the stringent containment strategies should maintain. Through numerical analysis, we suggested that the time for the resumption of work and production in China (except Hubei) and Hubei would be the middle of March and the end of April, 2020, respectively. These constructive suggestions may bring some immeasurable social-economic benefits in the long run.

The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. This is known as the strong Goldbach's conjecture. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A major complexity classes are L, NL and NSPACE(S(n)) for some S(n). Whether L = NL is a fundamental question that it is as important as it is unresolved. We show if the weak Goldbach's conjecture is true, then the problem PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n). This proof is based on the assumption that if some language belongs to NSPACE(S(n)), then the unary version of that language belongs to NSPACE(S(log n)) and vice versa. However, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples. Since Harald Helfgott proved that the weak Goldbach's conjecture is true, then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples, where the case of infinite number of counterexamples statistically seems to be unlikely. In addition, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Beal's conjecture is true when L = NL. On November 2019, Frank Vega proves that L = NP which also implies that L = NL. In this way, the Beal's conjecture is true and since the Beal's conjecture is a generalization of Fermat's Last Theorem, then this is also a simple and short proof for that Theorem.

Cloud infrastructure provides computing services where computing resources can be adjusted on-demand. However, the adoption of cloud infrastructures brings concerns like reliance on the service provider network, reliability, compliance for service level agreements (SLAs), etc. Software-defined networking (SDN) is a networking concept that suggests the segregation of a network’s data plane from the control plane. This concept improves networking behavior. In this paper, we present an SDN-enabled resource-aware topology framework. The proposed framework employs SLA compliance, Path Computation Element (PCE) and shares fair loading to achieve better topology features. We also present an evaluation, showcasing the potential of our framework.

The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. This is known as the strong Goldbach's conjecture. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A major complexity class is NSPACE(S(n)) for some S(n). We show if the weak Goldbach's conjecture is true, then the problem PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n). However, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples. Since Harald Helfgott proved that the weak Goldbach's conjecture is true, then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples, where the case of infinite number of counterexamples statistically seems to be unlikely. In addition, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Beal's conjecture is true. Since the Beal's conjecture is a generalization of Fermat's Last Theorem, then this is also a simple and short proof for that Theorem.

This study explores wind energy resources in different locations through the Gulf of Oman and also their future variability due climate change impacts. In this regard, EC-EARTH near-surface wind outputs obtained from CORDEX-MENA simulations are used for historical and future projection of the energy. The ERA5 wind data are employed to assess the suitability of the climate model. Moreover, the ERA5 wave data over the study area are applied to compute sea surface roughness as an important variable for converting near-surface wind speeds to those of wind speed at turbine hub height. Considering the power distribution, bathymetry and distance from the coats, some spots as tentative energy hotspots to provide a detailed assessment of directional and temporal variability and also to investigate climate change impact studies. RCP8.5 is a common climatic scenario is used to project and extract future variation of the energy in the selected sites. The results of this study demonstrate that the selected locations have a suitable potential for wind power turbine plans and constructions.

In this study, by using Least Square Method, the dataset for the Gross Domestic Product per capita is modeled as a function satisfying the fractional differential equation. The function itself is assumed to be the finite summation of its previous values and the derivatives with unknown coefficients. Then, the prediction for the upcoming years is done by having an approach dividing the dataset into 4 regions corresponding to four different tasks. The mathematical model of the Gross Domestic Product (GDP) per capita of the countries (and union) which are Brazil, China, European Union (EU), India, Italy, Japan, UK, the USA, Spain, and Turkey is constructed with a new methodology called as the deep assessment method which comes from the expressing an arbitrary function modeling the dataset as the finite summation of its previous values and the derivatives with unknown coefficient. The method uses the fractional calculus properties combining with Least Square Method and is compared to Long short-term memory (LSTM) algorithm which is a special type of neural network used for time sequences in general.

A good recommender system can infer customers’ preferences based on their historical purchase records, and recommend products that the customers may be interested in, saving them a lot of time and energy. For enterprises, it is difficult to recommend accurately to each customer, and the bad recommendation may be counterproductive. Customer loyalty is an indicator that measures the preference relationship between customers and products in the field of marketing. A hypothesis is proposed in this study: if companies can divide customers into different groups based on customer loyalty, the recommendation effect on certain groups is better than that on overall customers. In this study, customer loyalty is measured by four features of the RFML model. All customers are viewed as points on a four-dimensional space, which are clustered by the k-means model. Two recommendation algorithms based on complex networks are tested: recommendation algorithm based on bipartite graph and PersonalRank (BGPR), and recommendation algorithm based on a single vertex set network and DeepWalk (SVDW). The experimental results show that customer loyalty has improved the effectiveness of the two algorithms over 14%, and the recommendation effect is the best on customer groups with a loyalty level of 4 (the highest level is 5). The recommendation algorithms with customer loyalty are better than using them alone.

Let β= (((24!)!)!)!, and let {${\mathcal P}_{n^2+1}$} denote the set of all primes of the form {$n^2+1$}. Let ${\mathcal M}$ denote the set of all positive multiples of elements of the set {${\mathcal P}_{n^2+1} \cap (\beta,\infty)$}. The set {${\mathcal X}=\{0,\ldots,\beta\} \cup {\mathcal M}$} satisfies the following conditions: (1) ${\rm card}({\mathcal X})$ is greater than a huge positive integer and it is conjectured that ${\mathcal X}$ is infinite, (2)} we do not know any algorithm deciding the finiteness of ${\mathcal X}$, (3)~a~known and short algorithm for every {$n \in N$} decides whether or not {$n \in {\mathcal X}$}, (4) a known and short algorithm returns an integer~$n$ such that ${\mathcal X}$ is infinite if and only if ${\mathcal X}$ contains an element greater than $n$. The following problem is open: {\em simply define a set {${\mathcal X} \subseteq N$} such that ${\mathcal X}$ satisfies conditions (1)-(4), and \underline{we do not know any representation of~~${\mathcal X}$~~as a finite union of sets whose definitions are simpler than} \underline{the definition of ${\mathcal X}$}} {\tt (5)}. Let {$f(1)=2$}, {$f(2)=4$}, and let {$f(n+1)=f(n)!$} for every integer {$n \geqslant 2$}. For a positive integer $n$, let {$\Psi_n$} denote the following statement: {\em if a system of equations ${\mathcal S} \subseteq \Bigl\{x_i!=x_k: i,k \in \{1,\ldots,n\}\Bigr\} \cup \Bigl\{x_i \cdot x_j=x_k: i,j,k \in \{1,\ldots,n\}\Bigr\}$ has only finitely many solutions in positive integers \mbox{$x_1,\ldots,x_n$}, then each such solution \mbox{$(x_1,\ldots,x_n)$} satisfies {$x_1,\ldots,x_n \leqslant f(n)$}.} We prove that for every statement $\Psi_n$ the bound {$f(n)$} cannot be decreased. The author's guess is that the statements {$\Psi_1,\ldots,\Psi_9$} are true. We prove that the statement $\Psi_9$ implies that the set ${\mathcal X}$ of all {non-negative} integers $k$ whose number of digits belongs to {${\mathcal P}_{n^2+1}$} satisfies conditions {\tt (1)-(5)}.

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.

In this paper, we study the existence of the random -pullback attractor of a non-autonomous local modified stochastic Swift-Hohenberg equation with multiplicative noise in stratonovich sense. It is shown that a random -pullback attractor exists in when its external force has exponential growth. Due to the stochastic term, the estimate are delicate, we overcome this difficulty by using the Ornstein-Uhlenbeck(O-U) transformation and its properties.

In this manuscript we report new effects of resonance detuning on various dynamical parameters of a generic 3-wave system. Namely, for suitably chosen values of detuning the variation range of amplitudes can be significantly wider than for exact resonance. Moreover, the range of energy variation is not symmetric with respect to the sign of the detuning. Finally, the period of the energy oscillation exhibits non-monotonic dependency on the magnitude of detuning. These results have important theoretical implications where nonlinear resonance analysis is involved, such as geophysics, plasma physics, fluid dynamics. Numerous practical applications are envisageable e.g. in energy harvesting systems.

Mammography is often used as the most common laboratory method for the detection of breast cancer, yet associated with the high cost and many side effects. Machine learning prediction as an alternative method has shown promising results. This paper presents a method based on a multilayer fuzzy expert system for the detection of breast cancer using an extreme learning machine (ELM) classification model integrated with radial basis function (RBF) kernel called ELM-RBF, considering the Wisconsin dataset. The performance of the proposed model is further compared with a linear-SVM model. The proposed model outperforms the linear-SVM model with RMSE, R², MAPE equal to 0.1719, 0.9374 and 0.0539, respectively. Furthermore, both models are studied in terms of criteria of accuracy, precision, sensitivity, specificity, validation, true positive rate (TPR), and false-negative rate (FNR). The ELM-RBF model for these criteria presents better performance compared to the SVM model.

The hybridization of machine learning methods with soft computing techniques is an essential approach to improve the performance of the prediction models. Hybrid machine learning models, particularly, have gained popularity in the advancement of the high-performance control systems. Higher accuracy and better performance for prediction models of exergy destruction and energy consumption used in the control circuit of heating, ventilation, and air conditioning (HVAC) systems can be highly economical in the industrial scale to save energy. This research proposes two hybrid models of adaptive neuro-fuzzy inference system-particle swarm optimization (ANFIS-PSO), and adaptive neuro-fuzzy inference system-genetic algorithm (ANFIS-GA) for HVAC. The results are further compared with the single ANFIS model. The ANFIS-PSO model with the RMSE of 0.0065, MAE of 0.0028, and R² equal to 0.9999, with a minimum deviation of 0.0691 (KJ/s), outperforms the ANFIS-GA and single ANFIS models.

Novel applications of artificial intelligence for tuning the parameters of industrial machines for optimal performance are emerging at a fast pace. Tuning the combine harvesters and improving the machine performance can dramatically minimize the wastes during harvesting, and it is also beneficial to machine maintenance. Literature includes several soft computing, machine learning and optimization methods that had been used to model the function of harvesters of various crops. Due to the complexity of the problem, machine learning methods had been recently proposed to predict the optimal performance with promising results. In this paper, through proposing a novel hybrid machine learning model based on artificial neural networks integrated with particle swarm optimization (ANN-PSO), the performance analysis of a common combine harvester is presented. The hybridization of machine learning methods with soft computing techniques has recently shown promising results to improve the performance of the combine harvesters. This research aims at improving the results further by providing more stable models with higher accuracy.

Using machine learning or deep learning to solve the problem of garbage recognition and classification is an important application in computer vision, but due to the incomplete establishment of garbage datasets and the poor performance of complex network models on smart terminal devices, the existing garbage classification models The effect is not good.This paper presents a waste classification and identification method base on transfer learning and lightweight neural network. By migrating the lightweight neural network MobileNetV2 and rebuild it, The reconstructed network is used for feature extraction, and the extracted features are introduced into the SVM to realize the identification of 6 types of garbage. The model was trained and verified by using 2527 pieces of garbage labeled data in the TrashNet dataset, which ultimately resulted in a classification accuracy of 98.4% of the method, which proves that the method can effectively improve the classification accuracy and time and overcome the problem of weak data and less labeling. The over-fitting phenomenon encountered by small data sets in deep learning makes the model robust.

Early detection of cancer increases the probability of recovery. This paper presents an intelligent decision support system (IDSS) for the early diagnosis of cancer based on gene expression profiles collected using DNA microarrays. Such datasets pose a challenge because of the small number of samples (no more than a few hundred) relative to the large number of genes (on the order of thousands). Therefore, a method of reducing the number of features (genes) that are not relevant to the disease of interest is necessary to avoid overfitting. The proposed methodology uses the information gain (IG) to select the most important features from the input patterns. Then, the selected features (genes) are reduced by applying the grey wolf optimization (GWO) algorithm. Finally, the methodology employs a support vector machine (SVM) classifier for cancer type classification. The proposed methodology was applied to two datasets (Breast and Colon) and was evaluated based on its classification accuracy, which is the most important performance measure in disease diagnosis. The experimental results indicate that the proposed methodology is able to enhance the stability of the classification accuracy as well as the feature selection

We present and benchmark FilterNet, a flexible deep learning architecture for time series classification tasks, such as activity recognition via multichannel sensor data. It adapts popular CNN and CNN-LSTM motifs which have excelled in activity recognition benchmarks, implementing them in a many-to-many architecture to markedly improve frame-by-frame accuracy, event segmentation accuracy, model size, and computational efficiency. We propose several model variants, evaluate them alongside other published models using the Opportunity benchmark dataset, demonstrate the effect of model ensembling and of altering key parameters, and quantify the quality of the models’ segmentation of discrete events. We also offer recommendations for use and suggest potential model extensions. FilterNet advances the state of the art in all measured accuracy and speed metrics on the benchmarked dataset, and it can be extensively customized for other applications.

Rough volatility models are popularized by \cite{gatheral2018volatility}, where they have shown that the empirical volatility in the financial market is extremely consistent with rough volatility. Fractional Riccati equation as a part of computation for the characteristic function of rough Heston model is not known in explicit form as of now and therefore, we must rely on numerical methods to obtain a solution. In this paper, we give a short introduction to option pricing theory and an overview of the current advancements on the rough Heston model.

In this article, we introduce a relatively new concept of multi-valued (θ;R)-contractions and utilize the same to prove some xed point results for a new class of multi-valued mappings in metric spaces endowed with an amorphous binary relation. Illustrative examples are also provided to exhibit the utility of our results proved herein. Finally, we utilize some of our results to investigate the existence and uniqueness of a positive solution for the integral equation of Volterra type.

This work investigates centered polygonal lacunary functions restricted from the unit disk onto symmetry angle space which is defined by the symmetry angles of a given centered polygonal lacunary function. This restriction allows for one to consider only the p-sequences of the centered polygonal lacunary functions which are bounded, but not convergent, at the natural boundary. The periodicity of the $p$-sequences naturally gives rise to a convergent subsequence, which can be used as a grounds for decomposition of the restricted centered polygonal lacunary functions. A mapping of the unit disk to the sphere allows for the study of the line integrals of restricted centered polygonal that includes analytic progress towards closed form representations. Obvious closures of the domain obtained from the spherical map lead to four distinct topological spaces of the "broom topology'' type.

Peer-to-peer (P2P) content distribution or file sharing system aims to facilitate the dissemination of large files over unreliable networks. Network coding is a new transmission technique that has captured the interest of researchers because of its ability to increase throughput and robustness of the network, and decrease the download time. In this survey paper, we extensively summarize, assess, compare, and classify the most recently used techniques to improve P2P content distribution systems performance using network coding. To the best of our knowledge, this survey is the first comprehensive survey that specifically focuses on the performance of network coding based P2P file sharing systems.

This paper investigates whether optimisation methods with the population made up of one solution can suffer from structural bias just like their multisolution variants. Following recent results highlighting the importance of choice of strategy for handling solutions generated outside the domain, a selection of single solution methods are considered in conjunction with several such strategies. Obtained results are tested for the presence of structural bias by means of a traditional approach from literature and a newly proposed here statistical approach. These two tests are demonstrated to be not fully consistent. All tested methods are found to be structurally biased with at least one of the tested strategies. Confirming results for multisolution methods, it is such strategy that is shown to control the emergence of structural bias in single solution methods. Some of the tested methods exhibit a kind of structural bias that has not been observed before.

Incorporating source-side linguistic knowledge into the neural machine translation (NMT) model has recently achieved impressive performance on machine translation tasks. One popular method is to generalize the word embedding layer of the encoder to encode each word and its linguistic features. The other method is to change the architecture of the encoder to encode syntactic information. However, the former cannot explicitly balance the contribution from the word and its linguistic features. The latter cannot flexibly utilize various types of linguistic information. Focusing on the above issues, this paper proposes a novel NMT approach that models the words in parallel to the linguistic knowledge by using two separate encoders. Compared with the single encoder based NMT model, the proposed approach additionally employs the knowledge-based encoder to specially encode linguistic features. Moreover, it shares parameters across encoders to enhance the model representation ability of the source-side language. Extensive experiments show that the approach achieves significant improvements of up to 2.4 and 1.1 BLEU points on Turkish→English and English→Turkish machine translation tasks, respectively, which indicates that it is capable of better utilizing the external linguistic knowledge and effective improving the machine translation quality.

Industry 4.0 is having a great impact in all smart efforts. This is not a single product, but is composed of several technologies, being one of them Industrial Internet of Things (IIoT). Currently, there are very varied implementation options offered by several companies, and this imposes a new challenge to companies that want to implement IoT in their processes. This challenge suggests to use multi-criteria analysis to make a repeatable and justified decision, requiring a set of alternatives and criteria. This paper proposes a new methodology and comprehensive criteria to help organizations to take an educated decision by applying multi-criteria analysis. Here, we suggest a new original use of PROMETHEE-II with full example from weight calculation up to IoT platform selection, showing this methodology as an effective study for other organizations interested to select an IoT platform. The criteria proposed outstands from previous work by including not only technical aspects, but economic and social criteria, providing a full view of the problem analyzed. A case of study was used to prove this proposed methodology.

Henry’s constants for different existing compounds in water have great importance in transfer calculations. Measurement of these constants face different difficulties including high costs of experiment and low accuracy of measurement apparatus. Due to these facts, proposing a low cost and accurate approach becomes highlighted. To this end, adaptive neuro-fuzzy inference system (ANFIS) and least squares support vector machine (LSSVM) have been used as Henry’s constant predictor tools. The molecular structure of compounds has been used as inputs of models. After training the models, the visual and mathematical studies of outputs have been done. The coefficients of determination of LSSVM and ANFIS algorithms are 0.999 and 0.990 respectively. According to the comprehensiveness of databank and accurate prediction of algorithms, it can be concluded that LSSVM and ANFIS algorithms are accurate methods for prediction of Henry’s constant in wide range of chemical structure of compounds in water.

Boundary behavior of a given important function or its limit values are essential in the whole spectrum of mathematics and science. We consider some tractable cases of limit values in which either a difference of two ingredients or a difference equation is used coupled with the relevant functional equations to give rise to unexpected results. This involves the expression for the Laurent coefficients including the residue, the Kronecker limit formulas and higher order coefficients as well as the difference formed to cancel the inaccessible part, typically the Clausen functions. We also state Abelian results which yield asymptotic formulas for weighted summatory function from that for the original summatory function

Critical Infrastructures and associated real time Informational systems need some security protection mechanisms that will be able to detect and respond to possible attacks. For this reason, Anomaly Detection Systems (ADS), as part of a Security Information and Event Management (SIEM) system, are needed for constantly monitoring and identifying potential threats inside an Information Technology (IT) System. Typically, ADS collect information from various sources within a CI system using security sensors or agents and correlate those information so as to identify anomaly events. Such sensors though in a CI setting (factories, power plants, remote locations) may be placed in open areas and left unattended thus becoming targets themselves of security attacks. They can be tampering and malicious manipulated so that they provide false data that may lead an ADS or SIEM system to falsely comprehend the CI current security status. In this paper, we describe existing approaches on security monitoring in critical infrastructures and focus on how to collect security sensor - agent information in a secure and trusted way. We then introduce the concept of hardware assisted security sensor information collection that improve the level if trust (by hardware means) and also increase the responsiveness of the sensor. Thus, we propose a Hardware Security Token (HST) that when connected to a CI Host, it acts as a secure anchor for security agent information collection. We describe the HST functionality, its association with a host device, its expected role and its log monitoring mechanism. We also provide information on how security can be established between the Host device and the HST.Then, we introduce and describe the necessary Host components that need to be established in order to guarantee a high security level and correct HST functionality. We, also provide a realization-implementation of the HST overall concept in a FPGA SoC evaluation board and describe how the HST implementation can controlled. Finally, we provide indicative use case scenarios of how the HST can be used in practice to provide a variety of different security services beyond acting as a secure ADS sensor.

Wind power as a renewable source of energy, has numerous economic, environmental and social benefits. In order to enhance and control the renewable wind power, it is vital to utilize models that predict wind speed with high accuracy. Due to neglecting of requirement and significance of data preprocessing and disregarding the inadequacy of using a single predicting model, many traditional models have poor performance in wind speed prediction. In the current study, for predicting wind speed at target stations in the north of Iran, the combination of a multi-layer perceptron model (MLP) with the Whale Optimization Algorithm (WOA) used to build new method (MLP-WOA) with a limited set of data (2004-2014). Then, the MLP-WOA model was utilized at each of the ten target stations, with the nine stations for training and tenth station for testing (namely: Astara, Bandar-E-Anzali, Rasht, Manjil, Jirandeh, Talesh, Kiyashahr, Lahijan, Masuleh and Deylaman) to increase the accuracy of the subsequent hybrid model. Capability of the hybrid model in wind speed forecasting at each target station was compared with the MLP model without the WOA optimizer. To determine definite results, numerous statistical performances were utilized. For all ten target stations, the MLP-WOA model had precise outcomes than the standalone MLP model. The hybrid model had acceptable performances with lower amounts of the RMSE, SI and RE parameters and higher values of NSE, WI and KGE parameters. It was concluded that WOA optimization algorithm can improve prediction accuracy of MLP model and may be recommended for accurate wind speed prediction.

In recent years, the field of deep learning achieved considerable success in pattern recognition, image segmentation and may other classification fields. There are a lot of studies and practical applications of deep learning on images, video or text classification. In this study, we suggest a method for changing the architecture of the most performing CNN models with the aim of designing new models to be used as stand-alone networks or as a component of an ensemble. We propose to replace each activation layer of a CNN (usually a ReLu layer) by a different activation function stochastically drawn from a set of activation functions: in this way the resulting CNN has a different set of activation function layers.

Primary energy consumption is one of the key drivers of global CO₂ emissions that, in turn, heavily depend on the efficiency of involved technologies. Either the improvement in technology efficiency or the expansion of non-fossil fuel consumption require large investments. The planning and financing of such investments, by policy makers or global energy firms, require, in turn, reliable measures of associated global spreads and their evolution in time. In this paper, our main contribution is the introduction of index measures for accessing global spreads (that is, measures of inequality or inhomogeneity in the statistical distribution of a related quantity of interest) of technology efficiency and CO₂ emission in primary energy consumption. These indexes are based on the Gini index, as used in economical sciences, and generalised entropy measures. Regarding primary energy sources, we consider petroleum, coal, natural gas and non-fossil fuels. Between our findings, we attest some stable relations in the evolution of global spreads of technology efficiency and CO₂ emission, and a positive relation between changes in global spreads of technology efficiency and use of non-fossil fuel.

Notion of median in one dimension is a foundational element in nonparametric statistics. It has been extended to multi-dimensional cases both in location and in regression via notions of data depth. Regression depth (RD) and projection regression depth (PRD) represent the two most promising notions in regression. Carrizosa depth DC is another depth notion in regression. Depth induced regression medians (maximum depth estimators) serve as robust alternatives to the classical least squares estimator. The uniqueness of regression medians is indispensable in the discussion of their properties and the asymptotics (consistency and limiting distribution) of sample regression medians. Are the regression medians induced from RD, PRD, and DC unique? Answering this question is the main goal of this article. It is found that only the regression median induced from PRD possesses the desired uniqueness property. The conventional remedy measure for non-uniqueness, taking average of all medians, might yield an estimator that no longer possesses the maximum depth in both RD and DC cases. These and other findings indicate that the PRD and its induced median are highly favorable among their leading competitors.

The impact of the accurate estimated time of arrival (ETA) is often overlooked by bus operators. By providing accurate ETA to riders, it gives them the impression of bus services is efficient and reliable and this promotes higher ridership in the long run. This research project aims to predict bus arrival time by using the Support Vector Regression (SVR) model which is based on the same theory as the Support Vector Machine (SVM). Urban City Bus data covering part of the Petaling Jaya area (route name PJ03) is used in this research work. Features related to traffic such as travel duration, a distance of the road, weather and operation at peak or non-peak hour have been used as input in the training of the SVR model. By using kernel trick and specifying optimum parameters, all the features in higher dimensions are efficiently calculated and the SVR model achieves convergence. The model is evaluated with the test set of data split from the original dataset. The experimental result indicates the SVR model displays good prediction ability with its low average error on the prediction result. However, weather data has not been influential to the prediction model as the results of the model trained with and without weather data show a negligible difference.

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.

World Health Organization (WHO) provides the guideline for managing the Particulate Matter (PM) level because when the PM level is higher, it threats the human health. For managing PM level, the procedure for measuring PM value is needed firstly. We use Tapered Element Oscillating Microbalance (TEOM)-based PM measuring sensors because it shows higher cost-effectiveness than Beta Attenuation Monitor (BAM)-based sensor. However, TEOM-based sensor has higher probability of malfunctioning than BAM-based sensor. In this paper, we call the overall malfunction as an anomaly, and we aim to detect anomalies for the maintenance of PM measuring sensors. We propose a novel architecture for solving the above aim that named as Hypothesis Pruning Generative Adversarial Network (HP-GAN). We experimentally compare the several anomaly detection architectures to certify ours performing better.

In this paper, initially a mathematical model is formulated for transient frequency of power system considering time delays which occur while transmitting the control signals in open communication infrastructure. Time delay negligence in a power system leads to improper measurement of frequency variation in power system. The study of impact of time delays on the stability of power system is performed by estimating the decay rate of frequency wave form using Kalman Filter (KF). In power system, there is a possibility of multiple time delays. This paper also focusses on developing Interacting Multiple Model (IMM) Algorithm with multiple model space using Kalman Filter (KF) as state estimator tool. The multiple time delays in power system is considered as multiple model space. The result shows that KF provides better estimate of correct model for a particular input-set. The qualitative properties of Riccati difference equation (RDE) in terms of state error covariance of IMMKF are also analyzed and presented.

Solar energy is a renewable resource of energy that is broadly utilized and has the least emissions among the renewable energies. In this study, machine learning methods of artificial neural networks (ANNs), least squares support vector machines (LSSVM), and neuro-fuzzy are used for advancing prediction models for thermal performance of a photovoltaic-thermal solar collector (PV/T). In the proposed models, the inlet temperature, flow rate, heat, solar radiation, and the sun heat have been considered as the inputs variables. Data set has been extracted through experimental measurements from a novel solar collector system. Different analyses are performed to examine the credibility of the introduced approaches and evaluate their performance. The proposed LSSVM model outperformed ANFIS and ANNs models. LSSVM model is reported suitable when the laboratory measurements are costly and time-consuming, or achieving such values requires sophisticated interpretations.

In fisheries monitoring, catch is assumed to be a product of fishing intensity, catchability, and availability, where availability is defined as the number or biomass of fish present and catchability refers to the relationship between catch rate and the true population. Ecological monitoring programs use catch per unit of effort (CPUE) to standardize catch and monitor changes in fish populations; however, CPUE is proportional to the portion of the population that is vulnerable to the type of gear that is used in sampling, which is not necessarily the entire population. Programs often deal with this problem by assuming that catchability is constant, but if catchability is not constant, it is not possible to separate the effects of catchability and population size using monitoring data alone. This study uses individual-based simulation to separate the effects of changing environmental conditions on catchability and availability in environmental monitoring data. The simulation combines a module for sampling conditions with a module for individual fish behavior to estimate the proportion of available fish that would escape from the sample. The method is applied to the case study of the well-monitored fish species Delta Smelt (Hypomesus transpacificus) in the San Francisco Estuary, where it has been hypothesized that changing water clarity may affect catchability for long-term monitoring studies. Results of this study indicate that given constraints on Delta Smelt swimming ability, it is unlikely that the apparent declines in Delta Smelt abundance are due to an effect of changing water clarity on catchability.

In the present work we study the existence of solutions for hybrid nonlinear fractional integrodifferential equations. We developed an algorithm by using the operator theoretical techniques in order to obtain the approximate solutions. The main results depend on the Dhage iteration method that were incorporated with the modern hybrid fixed point theorems. The approximate solutions were obtained by using Lipschitz conditions and weaker form of mixed partial continuity. Further, we provide some examples to explain the hypotheses and the related results.

The data from social networks like Twitter is a valuable source for research but full of redundancy, making it hard to provide large-scale, self-contained, and small datasets. The data recording is a common problem in social media-based studies and could be standardized. Sadly, this is hardly done. This paper reports on lessons learned from a long-term evaluation study recording the complete public sample of the German and English Twitter stream. It presents a recording solution proposal that merely chunks a linear stream of events to reduce redundancy. If events are observed multiple times within the time-span of a chunk, only the latest observation is written to the chunk. A 10 Gigabyte Twitter raw dataset covering 1,2 Million Tweets of 120.000 users recorded between June and September 2017 was used to analyze expectable compression rates. It turned out that resulting datasets need only between 10\% and 20\% of the original data size without losing any event, metadata or the relationships between single events. This kind of redundancy reduction recording makes it possible to curate large-scale (even nation-wide), self-contained, and small datasets of social networks for research in a standardized and reproducible manner.

In this paper, a new identity for the generalized fractional integral is defined, through which new integral inequality for functions whose first derivatives in absolute value are convex. The new generalized Hermite-Hadamard inequality for generalized convex function on fractal sets involving Katugampola type fractional integral is established. We derive trapezoid and mid-point type inequalities connected to these generalized Hermite-Hadamard inequality.