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

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

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

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

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

Agile methods promise to achieve high productivity and provide high-quality software. Agile software development is the most important model that has spread through the world of software development over the past decade. Software productivity measurement is essential in agile teams to increase the performance of Software development. Due to the increasing competition of software development companies, software team productivity has become one of the crucial challenges for software companies and teams. Awareness of the level of team productivity can help them to achieve more accurate estimation results on the time and cost of the projects. However, to measure software productivity, there is no definitive solution or approach whether in traditional and agile software development teams that lead to the occurrence of many problems in achieving a reliable definition of software productivity. Hence, this study aims to evaluate the productivity of the software in an up-to-date view of software development and to present a model for computing software team productivity. A survey was conducted with forty software development organizations located in Iran and measured the impact of six factors of the team on productivity in these companies. The results show that team effectiveness factors including inter-team relationship, quality conformance by the team, team vision, team leader, and requirements handled by the team had an impact on productivity. Moreover, the results also state that inter-team relations affect the most on software teams’ productivity. Finally, using the model fit test, it found that 80% of productivity changes based on team effectiveness factors.

For bounded unit interval, we propose a new Kumaraswamy generalized (G) family of distributions from a new generator which could be an alternate to the Kumaraswamy-G family proposed earlier by Cordeiro and de-Castro in 2011. This new generator can also be used to develop alternate G-classes such as beta-G, McDonald-G, Topp-Leone-G, Marshall-Olkin-G and Transmuted-G for bounded unit interval. Some mathematical properties of this new family are obtained and maximum likelihood method is used for estimating the family parameters. We investigate the properties of one special model called a new Kumaraswamy-Weibull (NKwW) distribution. Parameter estimation is dealt and maximum likelihood estimators are assessed through simulation study. Two real life data sets are analyzed to illustrate the importance and flexibility of this distribution. In fact, this model outperforms some generalized Weibull models such as the Kumaraswamy-Weibull, McDonald-Weibull, beta-Weibull, exponentiated-generalized Weibull, gamma-Weibull, odd log-logistic-Weibull, Marshall-Olkin-Weibull, transmuted-Weibull, exponentiated-Weibull and Weibull distributions when applied to these data sets. The bivariate extension of the family is proposed and the estimation of parameters is given. The usefulness of the bivariate NKwW model is illustrated empirically by means of a real-life data set.

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

Intelligent Transportation Systems (ITS) are emerging field characterized by complex data model, dynamics and strict time requirements. Ensuring cybersecurity in ITS is a complex task on which the safety and efficiency of transportation depends. The imposition of standards for a comprehensive architecture, as well as specific security standards, is one of the key steps in the evolution of ITS. The article examines the general outlines of the ITS architecture and security issues. The main focus of security approaches is: configuration and initialization of the devices during manufacturing at perception layer; anonymous authentication of nodes in VANET at network layer; defense of fog-based structures at support layer and description and standardization of the complex model of data and metadata and defense of systems, based on AI at application layer. The article oversees some conventional methods as network segmentation and cryptography that should be adapted in order to be applied in ITS cybersecurity. The focus is on innovative approaches that have been trying to find their place in ITS security strategies recently. The list of innovative approaches includes blockchain, bloom filter, fog computing, artificial intelligence, game theory, and ontologies. In conclusion, a correspondence is made between the commented methods, the problems they solve and the architectural layers in which they are applied.

The paper proposes a new principle of finding and removing elements of mathematical model, redundant in terms of parametric identification of the model. It allows reducing computational and time complexity of the applications built on the model. Especially this is important for AI based systems, systems based on IoT solutions, distributed systems etc. Besides, the complexity reduction allows increasing an accuracy of mathematical models implemented. Despite the model order reduction methods are well known, they are extremely depended however on the problem area. Thus, proposed reduction principles can be used in different areas, what is demonstrated in this paper. The proposed method for the reduction of mathematical models of dynamic systems allows also the assessment of the requirements for the parameters of the simulator elements to ensure the specified accuracy of dynamic similarity. Efficiency of the principle is shown on the ordinary differential equations and on the neural network model. The given examples demonstrate efficient normalizing properties of the reduction principle for the mathematical models in the form of neural networks.

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

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

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

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

Information theory provides robust measures of multivariable interdependence, but classically does little to characterize the multivariable relationships it detects. The Partial Information Decomposition (PID) characterizes the mutual information between variables by decomposing it into unique, redundant, and synergistic components. This has been usefully applied, particularly in neuroscience, but there is currently no generally accepted method for its computation. Independently, the Information Delta framework characterizes non-pairwise dependencies in genetic datasets. This framework has developed an intuitive geometric interpretation for how discrete functions encode information, but lacks some important generalizations. This paper shows that the PID and Delta frameworks are largely equivalent. We equate their key expressions, allowing for results in one framework to apply towards open questions in the other. For example, we find that the approach of Bertschinger et al. is useful for the open Information Delta question of how to deal with linkage disequilibrium. We also show how PID solutions can be mapped onto the space of delta measures. Using Bertschinger et al. as an example solution, we identify a specific plane in delta-space on which this approach’s optimization is constrained, and compute it for all possible three-variable discrete functions of a three-letter alphabet. This yields a clear geometric picture of how a given solution decomposes information

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

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

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

Tinnitus is a complex and heterogeneous psycho-physiological disorder responsible for causing a phantom ringing or buzzing sound albeit the absence of an external sound source. It has a direct influence on affecting the quality of life of its sufferers. Despite being around for a while, there hasn’t been a cure for tinnitus, and the usual course of action for its treatment involves use of tinnitus retaining and sound therapy, or Cognitive Behavioral Therapy (CBT). One positive aspect about these therapies is that they can be administered face-to-face as well as delivered via internet or smartphone. Smartphones are especially helpful as they are highly personalized devices, and offer a well-established ecosystem of apps, accessible via respective marketplaces of differing mobile platforms. Note that current therapeutic treatments such as CBT have shown to be effective in suppressing the tinnitus symptoms when administered face-to-face, their effectiveness when being delivered using smartphones is not known so far. A quick search on the prominent market places of popular mobile platforms (Android and iOS) yielded roughly 250 smartphone apps offering tinnitus-related therapies and tinnitus management. As this number is expected to steadily increase due to high interest in smartphone app development, a contemporary review of such apps is crucial. In this paper, we aim to review scientific studies validating the smartphone apps, particularly to test their effectiveness in tinnitus management and treatment. We use the PRISMA guidelines for systematic identification of studies on major scientific literature sources and delineate the outcomes of identified studies.

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

The $k$-means problem is to compute a set of $k$ centers (points) that minimizes the sum of squared distances to a given set of $n$ points in a metric space. Arguably, the most common algorithm to solve it is $k$-means++ which is easy to implement, and provides a provably small approximation factor in time that is linear in $n$. We generalize $k$-means++ to support: (i) non-metric spaces and any pseudo-distance function. In particular, it supports M-estimators functions that handle outliers, e.g. where the distance $\mathrm{dist}(p,x)$ between a pair of points is replaced by $\min {\mathrm{dist}(p,x),1}$. (ii) $k$-means clustering with $m\geq 1$ outliers, i.e., where the $m$ farthest points from the $k$ centers are excluded from the total sum of distances. This is the first algorithm whose running time is linear in $n$ and polynomial in $k$ and $m$.

There are two reasons to have an efficient algorithm for identifying all maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all maximal Lyndon substrings of the input string, and secondly, Franek et al. showed in 2017 a linear equivalence of sorting suffixes and sorting maximal Lyndon substrings of a string, inspired by a novel suffix sorting algorithm of Baier. In 2016, Franek et al. presented a brief overview of algorithms for computing the Lyndon array that encodes the knowledge of maximal Lyndon substrings of the input string. Among the presented were two well-known algorithms for computing the Lyndon array: a quadratic in-place algorithm based on iterated Duval's algorithm for Lyndon factorization, and a linear algorithmic scheme based on linear suffix sorting, computing inverse suffix array, and applying to it the Next Smaller Value algorithm. Duval's algorithm works for strings over any ordered alphabet, while for linear suffix sorting, a constant or an integer alphabet is required. The authors at that time were not aware of Baier's algorithm. In 2017, our research group proposed a novel algorithm for the Lyndon array. Though the proposed algorithm is linear in the average case and has O(n log(n)) worst-case complexity, it is interesting as it emulates the fast Fourier algorithm's recursive approach and introduces tau-reduction that might be of independent interest. In 2018, we presented a linear algorithm to compute the Lyndon array of a string inspired by Phase I of Baier's algorithm for suffix sorting. This paper presents theoretical analysis of these two algorithms and provides empirical comparisons of both their C++ implementations with respect to iterated Duval's algorithm.

By adaptively updating the coarse quantizers according to the inner-source temporal correlation, based on the nested lattices quantization (NLQ) method, an adaptive nested lattices quantization (ANLQ) for practical asymmetric Wyner-Ziv coding method is proposed, which jointly exploits the spatial and temporal correlations of real-valued distributed real-time Markov sources. We prove that the adaptively updated coarse quantizer at the decoder is synchronized with that at the encoder through the algebraic congruence and geometric symmetry of lattices, so that ANLQ has the characteristics of time-dependent space-independent encoding, as well as time-independent space-dependent decoding. More specifically, at the encoder, by exploring the temporal correlation, ANLQ has a better compression performance, while at the encoder, each decoding process will not be affected by the result at the previous time. For to theoretically analyze the encoding and decoding performance, practical lattice-based spatially and temporally evolution models are derived in this paper, with which the performance advantages of ANLQ are verified comparing with NLQ.

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

Conditional heteroskedastic financial time series are commonly modelled by (G)ARCH processes. ARCH(1) and GARCH were recently established in C[0,1] and L^2[0,1]. This article provides sufficient conditions for the existence of strictly stationary solutions, weak dependence and finite moments of (G)ARCH processes for any order in C[0,1] and L^p[0,1]. It deduces explicit asymptotic upper bounds of estimation errors for the shift term, the complete (G)ARCH operators and the projections of ARCH operators on finite-dimensional subspaces. The operator estimaton is based on Yule-Walker equations, and estimating the GARCH operators also involves a result estimating operators in invertible linear processes being valid beyond the scope of (G)ARCH. Moreover, our results regarding (G)ARCH can be transferred to functional AR(MA).

We review a modern differential geometric description of the fluid isotropic motion and featuring it the diffeomorphism group structure, modelling the related dynamics, as well as its compatibility with the quasi-stationary thermodynamical constraints. There is analyzed the adiabatic liquid dynamics, within which, following the general approach, there is explained in detail, the nature of the related Poissonian structure on the fluid motion phase space, as a semidirect Banach groups product, and a natural reduction of the canonical symplectic structure on its cotangent space to the classical Lie-Poisson bracket on the adjoint space to the corresponding semidirect Lie algebras product. We also present a modification of the Hamiltonian analysis in case of the isotermal liquid dynamics. We study the differential-geometric structure of the adiabatic magneto-hydrodynamic superfluid phase space and its related motion within the Hamiltonian analysis and invariant theory. In particular, we construct an infinite hierarchies of different kinds of integral magneto-hydrodynamic invariants, generalizing those before constructed in the literature, and analyze their differential-geometric origins. A charged liquid dynamics on the phase space invariant with respect to an abelian gauge group transformation is also investigated, some generalization of the canonical Lie-Poisson type bracket is obtained.

The COVID-19 pandemic situation has created even more difficulties in the quick identification and screening of the COVID-19 patients for the medical specialists. Therefore, a significant study is necessary for detecting COVID-19 cases using an automated diagnosis method, which can aid in controlling the spreading of the virus. In this paper, the study suggests a Deep Convolutional Neural Network-based multi-classification approach (COV-MCNet) using eight different pre-trained architectures such as VGG16, VGG19, ResNet50V2, DenseNet201, InceptionV3, MobileNet, InceptionResNetV2, Xception which are trained and tested on the X-ray images of COVID-19, Normal, Viral Pneumonia, and Bacterial Pneumonia. The results from 3-class (Normal vs. COVID-19 vs. Viral Pneumonia) showed that only the ResNet50V2 model provides the highest classification performance (accuracy: 95.83%, precision: 96.12%, recall: 96.11%, F1-score: 96.11%, specificity: 97.84%) compared to rest of the models. The results from 4-class (Normal vs. COVID-19 vs. Viral Pneumonia vs. Bacterial Pneumonia) demonstrated that the pre-trained model DenseNet201 provides the highest classification performance (accuracy: 92.54%, precision: 93.05%, recall: 92.81%, F1-score: 92.83%, specificity: 97.47%). Notably, the ResNet50V2 (3-class) and DenseNet201 (4-class) models in the proposed COV-MCNet framework showed higher accuracy compared to the rest six models. This indicates that the designed system can produce promising results to detect the COVID-19 cases on the availability of more data. The proposed multi-classification network (COV-MCNet) significantly speeds up the existing radiology-based method, which will be helpful to the medical community and clinical specialists for early diagnosis of the COVID-19 cases during this pandemic.

Two well-known drawbacks in fuzzy clustering are the requirement of assign in advance the number of clusters and random initialization of cluster centers.; the quality of the final fuzzy clusters depends heavily on the initial choice of the number of clusters and the initialization of the clusters, then it is necessary to apply a validity index to measure the compactness and the separability of the final clusters and run the clustering algorithm several times. We propose a new fuzzy C-means algorithm in which a validity index based on the concepts of maximum fuzzy energy and minimum fuzzy entropy is applied to initialize the cluster centers and to find the optimal number of clusters and initial cluster centers in order to obtain a good clustering quality, without increasing time consumption. We test our algorithm on UCI machine learning classification datasets comparing the results with the ones obtained by using well-known validity indices and variations of FCM using optimization algorithms in the initialization phase. The comparison results show that our algorithm represents an optimal trade-off between the quality of clustering and the time consumption.

Dissolved Oxygen (DO) concentration is a vital parameter that indicates water quality. DO short term forecasting using time series analysis on data collected from an aquaculture pond is presented here. This can provide data support for an early warning system for an improved management of the aquaculture farm. The conventional forecasting approaches are commonly characterized by low accuracy and poor generalization problems. In this article, we present a novel hybrid DO concentration forecasting method with ensemble empirical mode decomposition (EEMD) based LSTM (Long short-term memory) neural network (NN). With this method, first, the sensor data integrity is improved through linear interpolation and moving average filtering methods of data preprocessing. Next, the EEMD algorithm is applied to decompose the original sensor data into multiple intrinsic mode functions (IMFs). Finally, the feature selection is used to carefully select IMFs that are strongly correlated with the original sensor data and integrate both into inputs for the NN. The hybrid EEMD-based LSTM forecasting model is then constructed. Performance of this proposed model in training and validation sets was compared with the observed real sensor data. To obtain the exact evaluation accuracy of the forecasted results of the hybrid EEMD-based LSTM forecasting model, three statistical performance indices were adopted: MAE, MSE, and RMSE. Results presented for short term (12-hour period) and long term (1-month period) give a strong indication of suitability of this method for forecasting DO values.

This study aims to evaluate a new approach in modeling gully erosion susceptibility based on deep learning neural network (DLNN) model, ensemble Particle swarm optimization (PSO) algorithm with DLNN (PSO-DLNN) and comparing these approaches with common artificial neural network (ANN) and support vector machine (SVM) models in Shiran watershed, Iran. For this purpose, 13 independent variables affecting gully erosion susceptibility in the study area, including altitude, slope, aspect, plan curvature, profile curvature, drainage density, distance from river, land use, soil, lithology, rainfall, , stream power index (SPI), topographic wetness index (TWI), were prepared. Also, 132 gully erosion locations were identified during field visits. Data for modeling were divided into two categories of training (70%) and testing (30%). Receiver operating characteristic (ROC) parameters including sensitivity, specificity, negative predictive value (NPV), positive predictive value (PPV) and area under curve (AUC) were used to evaluate the performance of the models. The results showed that, the AUC values from ROC with considering testing datasets of PSO-DLNN is 0.89 and which is associated with superb accuracy. Rest of the models also associated with optimal accuracy and near about PSO-DLNN model; the AUC values from ROC of DLNN, SVM and ANN for testing datasets are 0.87, 0.85 and 0.84 respectively. The PSO algorithm has updated and optimized the weights of DLNN model, and as a result, the efficiency of this model in predicting gully erosion susceptibility has increased. Therefore, it can be concluded that the use of DLNN model and its ensemble with PSO algorithm can be used as a novel and practical method in predicting the susceptibility of gully erosion that helps planners and managers in managing and reducing the risk of this phenomenon.

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

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

In this paper, we investigate the relationship people have with their smart devices. We use the concept of agency to capture aspects of users’ sense of mastery as they relate to their device. This study gives preliminary evidence of the existence of two independent dimensions of agency for modeling the interaction between humans and smart devices: (i) user agency and (ii) device agency. These constructs emerged from an exploratory factorial analysis conducted on a survey data collected from 587 participants. In addition, we investigate the correlation between user agency and device agency with background variables of the respondents. Finally, we argue that mapping the users’ dynamics with their device into user agency and device agency fosters a better understanding of the needs of the users and helps in designing interfaces tailored for the specific capabilities and expectations of the users.

In this paper, we investigate the relationship people have with their smart devices. We use the concept of agency to capture aspects of users’ sense of mastery as they relate to their device. This study gives preliminary evidence of the existence of two independent dimensions of agency for modeling the interaction between humans and smart devices: (i) user agency and (ii) device agency. These constructs emerged from an exploratory factorial analysis conducted on a survey data collected from 587 participants. In addition, we investigate the correlation between user agency and device agency with background variables of the respondents. Finally, we argue that mapping the users’ dynamics with their device into user agency and device agency fosters a better understanding of the needs of the users and helps in designing interfaces tailored for the specific capabilities and expectations of the users.

To minimise environmental impact, avoid regulatory penalties, and improve competitiveness, energy-intensive manufacturing firms require accurate forecasts of their energy consumption so that precautionary and mitigation measures can be taken. Deep learning is widely touted as a superior analytical technique to traditional artificial neural networks, machine learning, and other classical time series models due to its high dimensionality and problem solving capabilities. Despite this, research on its application in demand-side energy forecasting is limited. We compare two benchmarks (Autoregressive Integrated Moving Average (ARIMA), and an existing manual technique used at the case site) against three deep learning models (simple Recurrent Neural Networks (RNN), Long Short-Term Memory (LSTM), and Gated Recurrent Unit (GRU)) and three machine learning models (Support Vector Regression (SVM), Random Forest, and K-Nearest Neighbors (KNN)) for short term load forecasting (STLF) using data from a Brazilian thermoplastic resin manufacturing plant. We use the grid search method to identify the best configurations for each model, and then use Diebold-Mariano testing to confirm the results. Results suggests that the legacy approach used at the case site is the worst performing, and that the GRU model outperformed all other models tested.

We use a system biology approach to translate the interaction of Bacillus Calmette-Gurin (BCG) + interleukin 2 (IL-2) for the treatment of bladder cancer into a mathematical model. The model is presented as a system of differential equations with the following variables: number of tumor cells, bacterial cells, immune cells, and cytokines involved in the tumor-immune response. This work investigates the delay effect induced by the proliferation of tumor antigen-specific effector cells after the immune system destroys BCG-infected urothelium cells following BCG and IL-2 immunotherapy in the treatment of bladder cancer. For the proposed model, three equilibrium states are found analytically. The stability of all equilibria is analyzed using the method of Lyapunov functionals construction and the method of linear matrix inequalities (LMIs).

In real financial market, the delayed market feedback and the delayed effect of government macro-control are inevitable. And both the delay of market feedback and the delay of macro-control effect bring about the mathematical difficulties in studying stabilization and synchronization of the hyper-chaotic financial system. However, employing Lyapunov function method, differential mean value theorem, suitable bounded hypotheses and pulse control technology results in the globally asymptotical stabilization and synchronization criteria. It is the first paper to drive the stabilization and synchronization criteria under the assumptions of the double delays. Finally, numerical examples illuminate the effectiveness of the proposed methods.

In this paper, the existence of two nontrivial stationary solutions for the nonlinear Gilpin Ayala two species competition model is given by using the mountain pass lemma, and the local stability criterion of the trivial solution is given by using Lyapunov function method. Based on the local stability criterion, we give some suggestions on how to avoid the population extinction. This is, when the population is on the verge of extinction, we should try our best to avoid the diffusion behavior and reduce the diffusion coefficient, otherwise the species are easy to go extinct. Numerical example shows the effectiveness of the proposed method.

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? The precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is P-Sel. P-Sel is the class of decision problems for which there is a polynomial time algorithm (called a selector) with the following property: Whenever it’s given two instances, a “yes” and a “no” instance, the algorithm can always decide which is the “yes” instance. It is known that if NP is contained in P-Sel, then P = NP. We claim a possible selector for 3SAT and thus, P = NP.

Recently, the conformable derivative and its properties have been introduced. In this paper, we propose and prove some new results on conformable Boundary Value Problems. First, we introduce a conformable version of classical Sturm´s separation, and comparison theorems. For a conformable Sturm-Liouville problem, Green's function is constructed, and its properties are also studied. In addition, we propose the applicability of the Green´s Function in solving conformable inhomogeneous linear differential equations with homogeneous boundary conditions, whose associated homogeneous boundary value problem has only trivial solution. Finally, we prove the generalized Hyers-Ulam stability of the conformable inhomogeneous boundary value problem.

Developments of new probability models for data analysis are keen interest of importance for all fields. The log-Dagum distribution has a prominent role in the theory and practice of statistics. In this article, a new family of continuous distributions generated from a log Dagum random variable called the log-Dagum Weibull distribution is proposed. The key properties of the proposed distribution are derived. Its density function can be symmetrical, left-skewed, right-skewed and reversed-J shaped and can have increasing, decreasing, bathtub hazard rates shaped. The model parameters are estimated by the method of maximum likelihood and illustrate its importance by means of applications to real data sets.

Background: Traditional omic analysis relies on p-value and fold change as selection criteria. There is an ongoing debate on their effectiveness in delivering systemic and robust interpretation, due to their dependence on assumptions of conformity with various parametric distributions.Here, we propose a threshold-free selection method based on robust, non-parametric statistics, ensuring independence from the statistical distribution properties and broad applicability. Such methods could adapt to different initial data distributions, contrary to statistical techniques based on fixed thresholds. Methods: Our work extends the Rank Products methodology with a neutral selection method of high information-extraction capacity. We introduce the calculation of the RP distribution’s entropy to isolate the features of interest by their contribution to the distribution’s information content. The aim is a methodology performing threshold-free identification of the differentially expressed features, which are highly informative about the phenomenon under scrutiny. Conclusions: Applying the proposed method on microarray (transcriptomic and DNA methylation) and RNAseq count data of varying sizes and noise presence, we observe robust convergence for the different parameterisations to stable cutoff points. Functional analysis through BioInfoMiner and EnrichR was used to evaluate the information potency of the resulting feature lists. Overall, the derived functional terms provide a systemic description highly compatible with the results of traditional statistical hypothesis testing techniques. The methodology behaves consistently across different data types. The feature lists are compact and information-rich, indicating phenotypic aspects specific to the tissue and biological phenomenon i nvestigated. Selection by information content measures efficiently addresses problems, emerging from arbitrary thresholding, thus facilitating the full automation of the analysis.

Recently deep cross-modal hashing networks have received increasing interests due to its superior query efficiency and low storage cost. However, most of existing methods concentrate less on hash representations learning part, which means the semantic information of data cannot be fully used. Furthermore, they may neglect the high-ranking relevance and consistency of hash codes. To solve these problems, we propose a Self-Attention and Adversary Guided Hashing Network (SAAGHN). Specifically, it employs self-attention mechanism in hash representations learning part to extract rich semantic relevance information. Meanwhile, in order to keep invariability of hash codes, adversarial learning is adopted in the hash codes learning part. In addition, to generate higher-ranking hash codes and avoid local minima early, a new batch semi-hard cosine triplet loss and a cosine quantization loss are proposed. Extensive experiments on two benchmark datasets have shown that SAAGHN outperforms other baselines and achieves the state-of-the-art performance.

Background: Distance to a health facility for inpatient care in developing countries has been a huge hindrance towards the achievement of the Sustainable Development Goal three. The United Nation encourages countries to research on access to inpatient care, so as to form health policies based on data. Methods: Data on four hundred and eighty-one participants of all ages from forty-seven counties in Kenya who sought inpatient care in Kenya in 2018 were analyzed. Distance to a health facility was captured as a continuous variable and was self-reported by the respondent. The response exhibited a discrete mass at zero and continuous characteristic, therefore a Tweedie distribution was adopted for modelling. Due to the correlation nature of clustered data, we embraced the Generalized Estimating Equations approach with an exchangeable correlation. Since no standard software was available to analyze this problem, we developed an R functions. We assessed the best model fit using the QICu and criteria, in which the lowest value for the former and the highest for the later are preferred.Findings: Differences in employment, ability to pay for the service and household size are associated with the distance covered to access government facilities. Interpretation: Poor people tend to have large households and are more likely to live in rural areas and slums, thus are forced to travel for long distance to access inpatient care. Compared to unemployed, the employed could have better socio-economic status and possibly live within reach of the inpatient health facilities, therefore travel less distances to access. Longer distances are associated with high payments, signifying some form of specialized treatment care due to the complexity of the medical cases, that are expensive to treat.

Social distancing is a recommended solution by the World Health Organisation (WHO) to minimise the spread of COVID-19 in public places. The majority of governments and national health authorities have set the 2-meter physical distancing as a mandatory safety measure in shopping centres, schools and other covered areas. In this research, we develop a Deep Neural Network-based Model for automated people detection, tracking, and inter-people distances estimation in the crowd, using common CCTV security cameras. The proposed DNN model along with an inverse perspective mapping technique leads to a very accurate people detection and social distancing monitoring in challenging conditions, including people occlusion, partial visibility, and lighting variations. We also provide an online infection risk assessment scheme by statistical analysis of the Spatio-temporal data from the moving trajectories and the rate of social distancing violations. We identify high-risk zones with the highest possibility of virus spread and infection. This may help authorities to redesign the layout of a public place or to take precaution actions to mitigate high-risk zones. The efficiency of the proposed methodology is evaluated on the Oxford Town Centre dataset, with superior performance in terms of accuracy and speed compared to three state-of-the-art methods.

The accurate prediction of the solar Diffuse Fraction (DF), sometimes called the Diffuse Ratio, is an important topic for solar energy research. In the present study, the current state of Diffuse Irradiance research is discussed and then three robust, Machine Learning (ML) models, are examined using a large dataset (almost 8 years) of hourly readings from Almeria, Spain. The ML models used herein, are a hybrid Adaptive Network-based Fuzzy Inference System (ANFIS), a single Multi-Layer Perceptron (MLP) and a hybrid Multi-Layer Perceptron-Grey Wolf Optimizer (MLP-GWO). These models were evaluated for their predictive precision, using various Solar and Diffuse Fraction (DF) irradiance data, from Spain. The results were then evaluated using two frequently used evaluation criteria, the Mean Absolute Error (MAE) and the Root Mean Square Error (RMSE). The results showed that the MLP-GWO model, followed by the ANFIS model, provided a higher performance, in both the training and the testing procedures.

Susceptible, infective, recovered, and hospitalized/isolated individuals are placed on the cells of a nxn square lattice, where each cell is occupied by a single individual or is vacant. At discrete time units (typically one day each) all susceptibles and infectives execute a random movement and when a coincidence of the two types occurs the susceptible is converted to infective status according to some probability. Infectives are labelled by the number of days since originally infected. At each time increment the age label of the infectives is increased by one unit. When the label reaches a number like 15 or 20 days the susceptibles recover with some probability or become isolated/hospitalized. Upon reaching some age the latter types either recover or die. Probabilities for the movements and conversions from one status to another are implemented by random numbergeneration. Simulations were carried out to investigate the effect of several probability and age parameters, the size of population (proportional to nxn) and density (related to fraction of occupied cells), and the size of the movements. Mid-term gradual conversion of susceptibles to isolated was explored as intervention policy.

Data papers have emerged as a powerful instrument for open data publishing, obtaining credit, and establishing priority for datasets generated in scientific experiments. Academic publishing improves data and metadata quality through peer-review and increases the impact of datasets by enhancing their visibility, accessibility, and re-usability. We aimed to establish a new type of article structure and template for omics studies: the omics data paper. To improve data interoperability and further incentivise researchers to publish high-quality data sets, we created a workflow for streamlined import of omics metadata directly into a data paper manuscript. An omics data paper template was designed by defining key article sections which encourage the description of omics datasets and methodologies. The workflow was based on REpresentational State Transfer services and Xpath to extract information from the European Nucleotide Archive, ArrayExpress and BioSamples databases, which follow community-agreed standards. The workflow for automatic import of standard-compliant metadata into an omics data paper manuscript facilitates the authoring process. It demonstrates the importance and potential of creating machine-readable and standard-compliant metadata. The omics data paper structure and workflow to import omics metadata improves the data publishing landscape by providing a novel mechanism for creating high-quality, enhanced metadata records, peer reviewing and publishing of these. It constitutes a powerful addition for distribution, visibility, reproducibility and re-usability of scientific data. We hope that streamlined metadata re-use for scholarly publishing encourages authors to improve the quality of their metadata to achieve a truly FAIR data world.

We give an operator solution to an advanced-retarded differential equation. The application of the operators involved produces a solution in terms of Bessel functions.

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

The symmetry properties of an ornament contain information about its civilisation and its interactions with other cultural sources. Two-dimensional periodic ornaments can be strictly classified into a limited set of 17 mathematical symmetry groups, also known as wallpaper groups. The collection of ornaments thus classified for a civilisation is characteristic of the cultural group and serves as a fingerprint to identify that group. If the distribution of wallpaper groups is available for several societies, mathematical methods can be applied to determine similarities and differences between the art practices of these communities. This method allows a systematic approach to the general ornamental practices within a culture and their interactions in the form of similarity of fingerprints. We test the feasibility of the method on examples of medieval Armenians, Byzantium, Seljuks first in Persia and then in Anatolia and among Arabs in the Middle East. For this purpose we present the distribution of the planar ornaments and calculate the Euclidean distances in pairs. We tested to what extend geographical and religious factors could account for the observed similarity of ornamental groups between cultures. The results suggest an intensive interaction between the Seljuk Turks and Arab craftsmen who produced the ornaments. Therefore the cultural interactions are religiously motivated.

While the use of crime data has been widely advocated in the literature, its availability is often limited to large urban cities and isolated databases tend not to allow for spatial comparisons. This paper presents an efficient machine learning framework capable of predicting spatial crime occurrences, without using past crime as a predictor, and at a relatively high resolution: the U.S. Census Block Group level. The proposed framework is based on an in-depth multidisciplinary literature review allowing the selection of 188 best-fit crime predictors from socio-economic, demographic, spatial, and environmental data. Such data are published periodically for the entire United States. The selection of the appropriate predictive model was made through a comparative study of different machine learning families of algorithms, including generalized linear models, deep learning, and ensemble learning. The gradient boosting model was found to yield the most accurate predictions for violent crimes, property crimes, motor vehicle thefts, vandalism, and the total count of crimes. Extensive experiments on real-world datasets of crimes reported in 11 U.S. cities demonstrated that the proposed framework achieves an accuracy of 73 and 77% when predicting property crimes and violent crimes, respectively.

In this paper, We propose a field-based network for object detection: Ellipse Field Network(EFN). It is a elegant way to detect the objects that is cluttered and rotated. EFN works with the probability fields which can preserves the information of object distribution in image space during forward propagation. It is for object detection in aerial images, and also work well in natural images detection. For an input image, The extensive experiments have validated that EFN can work with a light weight model and doesn’t sacrificing performance. We achieve state-of-the-art results in aerial images test, and a good score in natural images.

Artificial intelligence (AI) techniques have grown rapidly in recent years in the context of computing with smart mobile phones that typically allows the devices to function in an intelligent manner. Popular AI techniques include machine learning and deep learning methods, natural language processing, as well as knowledge representation and expert systems, can be used to make the target mobile applications intelligent and more effective. In this paper, we present a comprehensive view on mobile data science and intelligent apps in terms of concepts and AI-based modeling that can be used to design and develop intelligent mobile applications for the betterment of human life in their diverse day-to-day situation. This study also includes the concepts and insights of various AI-powered intelligent apps in several application domains, ranging from personalized recommendation to healthcare services, including COVID-19 pandemic management in recent days. Finally, we highlight several research issues and future directions relevant to our analysis in the area of mobile data science and intelligent apps. Overall, this paper aims to serve as a reference point and guidelines for the mobile application developers as well as the researchers in this domain, particularly from the technical point of view.

As the embedded device and internet of things (IoTs) concept prevalent in today's world, there is an increasing demand for the security and performance requirements on deploying these devices to private and public sectors. The crucial part of it is to protect privacy, confidentiality and integrity, meanwhile, maintain an adequate level of performance during transmission, storage and access of critical information. While the conventional cryptography methods, such as the Advanced Encryption Standard (AES), SHA$-$2 hashing method and RSA and Diffie Hellman for message authentication and identification, work well on systems which have reasonable processing power and memory capabilities. These do not scale well into a world with embedded systems and sensor networks, in conjunction with their nature of smaller size and lower cost. Thus, in the context of resource constrained device, lightweight cryptography methods are proposed to overcome many of the problems of conventional cryptography possessed. This includes constraints related to physical size, processing requirement, memory limitation, energy drain and production cost. This paper provides a survey of the architectures that are defined as replacements for conventional ciphers within an IoTs space and discuss some trends in the design of future lightweight algorithms. The performance metrics are carefully chosen to reflect and assess the suitability for embedded devices. The aim of this research is to identify the various performance metrics applied on different types of symmetric block ciphers especially lightweight ciphers and compare the results on versatile platforms with stream ciphers and public key methods. The comparative analysis on efficient LW cipher will be tested against other similar block ciphers on both MacBook Pro with Intel core and resource constrained device Raspberry Pi with ARM processor.

In this paper, the authors employ Mountain Pass Lemma, the method of weak solution regularization and Lyapunov function method to derive the unique existence of globally exponential stable positive stationary solution of a single-species model with diffusion and delayed feedback. The obtained stability criterion illuminates that under some suitable conditions, a certain internal competition is conducive to the overall stability of the population, and a certain amount of family planning is conducive to the overall stability of the population. A numerical example and three tables show the effectiveness of the proposed methods.

Nowadays, with smartphones people can easily take photos, post photos to any social networks and use the photos for some purposes. This leads to a social problem that unintended appearance in photos may threaten the privacy of photographed person. Some solutions to protect facial privacy in photos have already been proposed. However, most of them rely on different techniques to de-identify photos which can be done only by photographers, giving no choice to photographed person. To deal with that, we propose an approach that allows photographed person to proactively detect whether someone is intentionally/unintentionally trying to take pictures of him/her. Thereby, he/she can have appropriate reaction to protect the privacy. In this approach, we assume that the photographed person uses a wearable camera to record the surrounding environment in real-time. The skeleton information of likely photographers who are captured in the monitoring video is then extracted to be put into the calculation of dynamic programming score which is eventually compared with a threshold for recognition of photo-taking behavior. Experimental results demonstrate that by using the proposed approach, the photo-taking behavior is precisely recognized with high accuracy of 92.5%.

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

This work probes the combined effects of magnetic field and viscous dissipation on heat field and examine the second law analysis (entropy generation) in an electrically conducting fluid under the effect of wall mass transfer over continuous stretched non-isothermal surface with variable viscosity. The viscosity of the fluid is assumed to be an inverse linear function of temperature. The governing equation for the problem are changed to dimensionless ordinary differential equations by using similarity transformation and solved numerically by using Rung Kutta and Shooting technique. Velocity, concentration and temperature distribution are obtained and used to compute the entropy generation and the Bejan number in the flow field. The effect of variable viscosity, Schmidt number, Hartman and Reynolds number on the velocity, concentration, temperature, entropy generation and Bejan number are studied and discussed.

The purpose of this paper is threefold: (i) to introduce and study the Euler-Lagrange prolongations of flatness PDEs solutions (best approximation of flatness) via associated least squares Lagrangian densities and integral functionals on Riemannian manifolds; (ii) to analyze some decomposable multivariate dynamics represented by Euler-Lagrange PDEs of least squares Lagrangians generated by flatness PDEs and Riemannian metrics; (iii) to give examples of explicit flat extremals and non-flat approximations.

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

This paper aims to introduce the notions of various types of Qc-contractions for which we establish some fixed circle and fixed disc theorems in the setting of metric spaces. Some illustrative examples are also provided to support our results. Moreover, we present some fixed circle and fixed disc results of integral type contractive self-mappings.

Assigning tasks in the project to each member is a difficult job in project management. In this study, we build a multi-objective combinatorial optimization model to assign project tasks of the software project to its members automatically. The model aims to minimize the critical path and a strategy to employ human resources to optimize the project cost determined while maintaining the labor force's quality. The necessary constraints of the makespan problem strictly followed. An alternative of the Compromise Programming approach applied to transform the multi-objective optimization problem to a single objective. Due to the proposed model is NP-Hard and not possible to solve with an Exact Algorithm, we design a scheme of the Genetic Algorithms to solve the proposed combinatorial optimization problem. Experimental results show that the algorithm worked well on the real dataset.

In this paper, we proposed the numerical method called the variational iteration orthogonal collocation method (VIOCM), for the approximate solution of the deadly Corona virus model using Mamadu-Njoseh polynomials as basis functions. The proposed method is an elegant mixture of the variational iteration method (VIM) and the orthogonal collocation method (OCM). It was observed that the proposed method converges rapidly to the exact solution even as N increases. This suggests that the use of orthogonal polynomials as trial functions for the SEIR model is indeed an effective approximant as it produces the analytic solution at just few iterations. Resulting numerical evidences were compared with the standard variational iteration method as available in literature. All computational frameworks were executed with MAPLE software.

Adversarial Classification (AC) is a major subfield within the increasingly important domain of adversarial machine learning (AML). Most approaches to AC so far have followed a classical game-theoretic framework. This requires unrealistic common knowledge conditions untenable in the security settings typical of the AML realm. After reviewing such approaches, we present alternative perspectives on AC based on Adversarial Risk Analysis.

Epigenetic aging has been found associated with a number of phenotypes and diseases. Few studies investigated its effect on lung function in relatively older people. However, this effect has not been explored in younger population. This study examines whether lung function at adolescent can be predicted with epigenetic age accelerations (AAs) using machine learning techniques. DNA methylation based AAs were estimated in 326 matched samples at two time points (at 10 years and 18 years) from the Isle of Wight Birth Cohort. Five machine learning regression models (linear, lasso, ridge, elastic net, and Bayesian ridge) were used to predict FEV1 (Forced Expiratory Volume in one second) and FVC (Forced Vital Capacity) at 18 years from feature selected predictor variables (based on mutual information) and AA changes between the two time points. The best models were ridge regression (R2 = 75.21% ± 7.42%; RMSE = 0.3768 ± 0.0653) and elastic net regression (R2 = 75.38% ± 6.98%; RMSE = 0.445 ± 0.069) for FEV1 and FVC, respectively. This study suggests that the application of machine learning in conjunction with tracking changes in AA over life span can be beneficial to assess the lung health in adolescence.

A micromechanical model is implemented to indicate the progressive fatigue problem of a laminated composite with a central circular hole under fatigue loading based on a finite element model. The mechanical properties of the composite lamina are represented based on the characteristics of the fiber and the matrix through a micromechanics model. An appropriate algorithm is then adopted to simulate fatigue damage development in the composite lamina. According to this algorithm, the stress field of the composite subjected to fatigue load is initially obtained using the finite element method. Finally, the predicted results of the stresses in the constituents i.e. fiber and matrix are determined according to the micromechanical bridging model. Finally applying proper damage driving relations leads to damage degree in each element. The proposed model is proven to be successful in the observation of the fatigue behavior with stiffness degradation in each element of the composite in each cycle. Results are reported and validated using those micromechanical models and experimental data available in the literature.

Nowadays, many political campaigns are using social influence (SI) in order to convince voters to support/oppose a specific candidate/party. In election control via SI problem, an attacker tries to find a set of limited influencers to start disseminating a political message in a social network of voters. A voter will change his opinion when he receives and accepts the message. In constructive case, the goal is to maximize the number of votes/winners of a target candidate/party, while in destructive case, the attacker tries to minimize them. Recent works considered the problem in different models and presented some hardness and approximation results. In this work, we consider multi-winner election control through SI on different graph structures and diffusion models, and our goal is to maximize/minimize the number of winners in our target party. We show that the problem is hard to approximate when voters' connections form a graph, and the diffusion model is the linear threshold model. We also prove the same result considering an arborescence under independent cascade model. Moreover, we present a dynamic programming algorithm for the cases that the voting system is a variation of straight-party voting, and voters form a tree.

Over the past decade, wireless communication technologies have developed significantly for intelligent applications in road transport. This paper provides an overview of telecommunications-based intelligent transport systems with a focus on ensuring system safety and resilience. In vehicle-to-everything, these problems are extremely acute due to the specifics of the operation of transport networks, which requires the use of special protection mechanisms. In this regard, it was decided to use blockchain as a system platform to support the needs of transport systems for secure information exchange. This paper describes the technological aspects of implementing blockchain technology in vehicle-to-network; the features of such technology are presented, as well as the features of their interaction.

In this paper, our goal is to establish the relationship between solutions of local sharp vector variational type inequality and sharp efficient solutions of vector optimization problems, also Minty local sharp vector variational type inequality and sharp efficient solutions of vector optimization problems, under generalized approximate $\eta$-convexity conditions for locally Lipschitzian functions

COVID-19 is a severe global problem, and AI can play a significant role in preventing losses by monitoring and detecting infected persons in early-stage. This paper aims to propose a high-speed and accurate fully-automated method to detect COVID-19 from the patient's CT scan images. We introduce a new dataset that contains 48260 CT scan images from 282 normal persons and 15589 images from 95 patients with COVID-19 infections. At the first stage, this system runs our proposed image processing algorithm to discard those CT images that inside the lung is not properly visible in them. This action helps to reduce the processing time and false detections. At the next stage, we introduce a novel method for increasing the classification accuracy of convolutional networks. We implemented our method using the ResNet50V2 network and a modified feature pyramid network alongside our designed architecture for classifying the selected CT images into COVID-19 or normal with higher accuracy than other models. After running these two phases, the system determines the condition of the patient using a selected threshold. We are the first to evaluate our system in two different ways. In the single image classification stage, our model achieved 98.49% accuracy on more than 7996 test images. At the patient identification phase, the system correctly identified almost 234 of 245 patients with high speed. We also investigate the classified images with the Grad-CAM algorithm to indicate the area of infections in images and evaluate our model classification correctness.

In software development, developers received bug reports that describe the software bug. Developers find the cause of bug through reviewing the code and reproducing the abnormal behavior that can be considered as tedious and time-consuming processes. The developers need an automated system that incorporates large domain knowledge and recommends a solution for those bugs to ease on developers rather than spending more manual efforts to fixing the bugs or waiting on Q&A websites for other users to reply to them. Stack Overflow is a popular question-answer site that is focusing on programming issues, thus we can benefit knowledge available in this rich platform. This paper, presents a survey covering the methods in the field of mining software repositories. We propose an architecture to build a recommender System using the learning to rank approach. Deep learning is used to construct a model that solve the problem of learning to rank using stack overflow data. Text mining techniques were invested to extract, evaluate and recommend the answers that have the best relevance with the solution of this bug report.

Financial system is essentially chaotic and unstable if there is not any external inputs. By means of Lyapunov function method, design of switching law, novel fuzzy assumption, $L^p$ estimation technique and Laplace semigroup theory, the author presents the boundedness and LMI-based (globally) asymptotical input-to-state stability criteria of financial systems. Particularly, the globally asymptotical stability in the meaning of switching implies that when the time $t$ is big enough, the dynamic of any subsystem must approach its unique equilibrium point. Besides, the global financial crisis often erupts periodically, which illuminates that the global stability in the classical sense is actually meaningless. So the stability in the meaning of switching proposed in this paper is suitable and appropriate. Numerical examples illuminate the effectiveness of the obtained results.

Generic object detection is one of the most important and flourishing branches of computer vision and has real-life applications in our day to day life. With the exponential development of deep learning-based techniques for object detection, the performance has enhanced considerably over the last 2 decades. However, due to the data-hungry nature of deep models, they don't perform well on tasks which have very limited labeled dataset available. To handle this problem, we proposed a transfer learning-based deep learning approach for detecting multiple pigs in the indoor farm setting. The approach is based on YOLO-v2 and the initial parameters are used as the optimal starting values for train-ing the network. Compared to the original YOLO-v2, we transformed the detector to detect only one class of objects i.e. pigs and the back-ground. For training the network, the farm-specific data is annotated with the bounding boxes enclosing pigs in the top view. Experiments are performed on a different configuration of the pen in the farm and convincing results have been achieved while using a few hundred annotated frames for fine-tuning the network.

Cardiovascular-related diseases are one of the leading causes of death worldwide. An understanding of heart movement based on images plays a vital role in assisting the procedure in the postoperative and postoperative processes. In particular, if the shape information can be provided in real-time using the electrocardiogram(ECG) signal using this information, the heart’s movement information can be used for cardiovascular analysis and imaging guides during surgery. In this paper, we propose creating a 3D+t cardiac coronary artery model that is rendered in real-time according to the ECG signal. Hierarchical cage-based deformation modeling is used to generate mesh deformation used during the procedure according to the ECG signal. We match the blood vessel’s lumen obtained from the ECG-gated 3D+t CT angiography taken at the multiple cardiac phases to derive the optimal deformation. Splines for 3D deformation control points were used to continuously represent the obtained deformation at the multi-view according to the ECG signal. To verify the proposed method, we compared the manually segmented lumen and results of the proposed method for eight patients. The average distance and dice coefficient between the two models was 0.543mm and 0.735, respectively. The required time for registration of the 3D coronary artery model is 23.53 seconds/model. rendering speed to derive the model according to the ECG signal after generating the 3D+t model is faster than 120 FPS.

In personalized healthcare, an ecosystem for the manipulation of reliable and safe private data should be orchestrated. This paper describes a first approach for the generation of fake electrocardiograms (ECGs) based on Generative Adversarial Networks (GANs) with the objective of anonymizing users’ information for privacy issues. This is intended to create valuable data that can be used both, in educational and research areas, while avoiding the risk of a sensitive data leakage. As GANs are mainly exploited on images and video frames, we are proposing general raw data processing after transformation into an image, so it can be managed through a GAN, then decoded back to the original data domain. The feasibility of our transformation and processing hypothesis is primarily demonstrated. Next, from the proposed procedure, main drawbacks for each step in the procedure are addressed for the particular case of ECGs. Hence, a novel research pathway on health data anonymization using GANs is opened and further straightforward developments are expected.

Increased data acquisition by uncalibrated, heterogeneous digital sensor systems such as smartphones present new challenges. Binary metrics are proposed for the quantification of cyber-physical signal characteristics and features, and a standardized constant-Q variation of the Gabor atom is developed for use with wavelet transforms. Two different continuous wavelet transform (CWT) reconstruction formulas are presented and tested under different signal to noise ratio (SNR) conditions. A sparse superposition of Nth order Gabor atoms worked well against a synthetic blast transient using the wavelet entropy and an entropy-like parametrization of the SNR as the CWT coefficient-weighting functions. The proposed methods should be well suited for sparse feature extraction and dictionary-based machine learning across multiple sensor modalities.

By partly generalizing the Lipschitz condition of existing results to the generalized Lipschitz one, the author utilizes a fixed point theorem, variational method and Lyapunov function method to derive the unique existence of globally asymptotical input-to-state stability of positive stationary solution for Gilpin-Ayala competition model with diffusion and delayed feedback under Dirichlet zero boundary value. Remarkably, it is the first paper to derive the unique existence of the stationary solution of reaction-diffusion Gilpin-Ayala competition model, which is globally asymptotical input-to-state stability. And numerical examples illuminate the effectiveness and feasibility of the proposed methods.

Intelligent Transportation Systems (ITS) are emerging field characterized by complex data model, dynamics and strict time requirements. Ensuring cybersecurity in ITS is a complex task on which the safety and efficiency of transportation depends. The imposition of standards for a comprehensive architecture, as well as specific security standards, is one of the key steps in the evolution of ITS. The article examines the general outlines of the ITS architecture and security issues. The main focus of security approaches is: configuration and initialization of the devices during manufacturing at perception layer; anonymous authentication of nodes in VANET at network layer; defense of fog-based structures at support layer and description and standardization of the complex model of data and metadata and defense of systems, based on AI at application layer. The article oversees some conventional methods as network segmentation and cryptography that should be adapted in order to be applied in ITS cybersecurity. The focus is on innovative approaches that have been trying to find their place in ITS security strategies recently. The list of innovative approaches includes blockchain, bloom filter, fog computing, artificial intelligence, game theory, and ontologies. In conclusion, a correspondence is made between the commented methods, the problems they solve and the architectural layers in which they are applied.

This article presents a new method of segmenting images with gray levels. The method is based on determining several thresholds for separation of gray levels. The determination of these thresholds is done using the certainty of the neutrosophic information. The concept of this method can be stated simply: to choose the local maximums for the neutrosophic certainty.

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

One of the main challenges for autonomous learning in virtual environments is finding the right material that fits students’ needs and supports their learning process. Personalized recommender systems partially solve this problem by suggesting online educational resources to students based on their preferences. However, in educational environments (which need a proper characterization of both users and educational resources), most existing recommendation algorithms either fail to include all the available information or use hybrid processes that do not exploit possible relationships between users and item features. This article presents a personalized recommender system for educational resources aimed at combining user and item information into a single mathematical model based on matrix factorization. As a result, estimated latent factors can provide insight into possible interactions between users and item features, improving the quality of the information retrieval process. We validated the proposed model on a real dataset that contains the ratings assigned by students from Universidad Nacional de Colombia and Universidade Feevale to educational resources in the Colombian Federation of Learning Object Repositories (FROAC in Spanish). User characterization included learning style and educational level, whereas item characterization (obtained from the objects’ metadata), included interactivity level, aggregation level and type, and resource format. These results, compared to those obtained when not all the available information is included, show that our method can improve the recommendation process.

Kronecker products of matrices have some striking operation properties, one of which is called the mixed-product property $(A \!\otimes\! B)(C \!\otimes\! D) = AC \!\otimes\! BD$. In view of this property, the two-term Kronecker product $A_1 \otimes A_2$ can be rewritten as $A_1 \otimes A_2 = (A_1 \otimes I_{m_2})(I_{m_1} \otimes A_2)$ of dilation forms of $A_1$ and $A_2$, and three-term Kronecker product $A_1 \otimes A_2 \otimes A_3$ can be rewritten as the products $A_1 \otimes A_2 \otimes A_3 = (A_1\otimes I_{m_2} \otimes I_{m_3})(I_{m_1} \otimes A_2 \otimes I_{m_3})(I_{m_1} \otimes I_{m_2} \otimes A_3)$ of the dilation forms of $A_1$, $A_2$, and $A_3$, respectively, where the matrices on the right-hand sides of the two factorizations are commutative. In this note, we approach the commutative Kronecker products on the right-hand sides of the two factorization equalities, and present a variety of new and useful analytical formulas for calculating the ranks, dimensions, orthogonal projectors, and ranges of matrices composed of these Kronecker products.

Predicting the popularity of posts on social networks has taken on significant importance in recent years, and several social media management tools now offer solutions to improve and optimize the quality of published content and to enhance the attractiveness of companies and organizations. Scientific research has recently moved in this direction, with the aim of exploiting advanced techniques such as machine learning, deep learning, natural language processing, etc., to support such tools. In light of the above, in this work we aim to address the challenge of predicting the popularity of a future post on Instagram, by defining the problem as a classification task and by proposing an original approach based on Gradient Boosting and feature engineering, which led us to promising experimental results. The proposed approach exploits big data technologies for scalability and efficiency and is general enough to be applied to other social media as well.

Nowadays, many political campaigns are using social influence (SI) in order to convince voters to support/oppose a specific candidate/party. In election control via SI problem, an attacker tries to find a set of limited influencers to start disseminating a political message in a social network of voters. A voter will change his opinion when he receives and accepts the message. In constructive case, the goal is to maximize the number of votes/winners of a target candidate/party, while in destructive case, the attacker tries to minimize them. Recent works considered the problem in different models and presented some hardness and approximation results. In this work, we consider multi-winner election control through SI on different graph structures and diffusion models, and our goal is to maximize/minimize the number of winners in our target party. We show that the problem is hard to approximate when voters' connections form a graph, and the diffusion model is the linear threshold model. We also prove the same result considering an arborescence under independent cascade model. Moreover, we present a dynamic programming algorithm for the cases that the voting system is a variation of straight-party voting, and voters form a tree.

We propose a novel transfer learning method for speech emotion recognition allowing us to obtain promising results when only few training data is available. With as low as 125 examples per emotion class, we were able to reach a higher accuracy than a strong baseline trained on 8 times more data. Our method leverages knowledge contained in pre-trained speech representations extracted from models trained on a more general self-supervised task which doesn’t require human annotations, such as the wav2vec model. We provide detailed insights on the benefits of our approach by varying the training data size, which can help labeling teams to work more efficiently. We compare performance with other popular methods on the IEMOCAP dataset, a well-benchmarked dataset among the Speech Emotion Recognition (SER) research community. Furthermore, we demonstrate that results can be greatly improved by combining acoustic and linguistic knowledge from transfer learning. We align acoustic pre-trained representations with semantic representations from the BERT model through an attention-based recurrent neural network. Performance improves significantly when combining both modalities and scales with the amount of data. When trained on the full IEMOCAP dataset, we reach a new state-of-the-art of 73.9% unweighted accuracy (UA).

In this paper, we propose 2 novel methods for brain tumor detection in MRI images. In the first proposed approach, we build upon prior research on ensemble methods by testing the concatenation of pre-trained models: features extracted via transfer learning are merged and segmented by classification algorithms or a stacked ensemble of those algorithms. In the second approach, we expand upon prior studies on convolutional neural networks: a convolutional neural network involving a specific module of layers is used for classification. The first approach achieved accuracy scores of 0.98 and the second approach achieved a score of 0.863, outperforming a benchmark VGG-16 model. Considerations to granular computing and circuit complexity theory are given in the paper as well.

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

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

A simplified nonlinear dispersive system of BBM-type, initially derived by D. Mitsotakis, is employed here in order to model the generation and propagation of surface water waves over variable bottom. The simplification consists in applying the so-called Boussinesq approximation. Using the finite element method and the FreeFem++ software, we solve numerically this system for three different complexities for the bathymetry function: a flat bottom case, a variable bottom in space, and a variable bottom both in space and in time. The last case is illustrated with the Java 2006 tsunami event. This article is designed rather as a tutorial paper even if it contains the description of completely new adaptation techniques.

YH-DIE must have continuity . Given the basic algebraic clusters of homogeneous configurations,we can get the basic three equations: \begin{array}{l} {\mathop{\int}\nolimits_{0}\nolimits^{{x}_{i}}{\frac{{G}\left({{x}_{i}\mathrm{,}s}\right)}{{\left({{x}_{i}\mathrm{{-}}{s}}\right)}^{\mathit{\alpha}}}\mathrm{\varphi}\left({s}\right){ds}}\mathrm{{=}}{f}\left({{x}_{i}}\right)}\ ;\ {\frac{\mathrm{\partial}}{\mathrm{\partial}{x}_{i}}\left({\frac{{\mathrm{\partial}}_{{x}_{i}}G}{\sqrt{{1}\mathrm{{+}}{\left|{\mathrm{\nabla}{G}}\right|}^{2}}}}\right)\mathrm{{=}}{0}}\ ;\ {{i}\mathrm{{=}}\mathop{\sum}\limits_{{x}_{i}\mathrm{{=}}{1}}\limits^{\mathrm{\infty}}{\arccos\hspace{0.33em}\mathrm{\varphi}\left({{x}_{i}}\right)}\mathrm{{=}}{f}\left({\fbox{${Yuh}$}}\right)} \end{array} YH-DIE has become a fusion point and access point in the fields of algebraic geometry and partial differential equations, and its mapping on multidimensional algebraic clusters or manifolds is very special. The minimal surface equation is a special case.

Social media gives researchers an invaluable opportunity to gain insight into different facets of human life.Researchers put a great emphasis on categorizing the socioeconomic status (SES) of individuals to help predict various findings of interest. Forum uses, hashtags and so on are common tools of conversations grouping. On the other hand, crowdsourcing is a concept that involves gathering intelligence to group online user community based on common interest. This paper provides a mechanism to look at writings on social media and group them based on their academic background. We build upon earlier work where we analyzed online forum posts from various geographical regions in the USA and Canada and characterized the readability scores of such users. Specifically, we collected 1000 tweets from the members of the US Senate and computed the Flesch-Kincaid readability score for the Senators. Comparing the Senators’ tweets to the ones from average citizens, we note the following. 1) US Senators’ readability based on their tweets rate is much higher affirming the gap between the academic performance of US Senators and their average citizen, and 2) the immense difference among average citizen’s score compared to those of US Senators is attributed to the wide spectrum of academic attainment.

Data acquisition by uncalibrated, heterogeneous digital sensor systems such as smartphones present emerging signal processing challenges. Binary metrics are proposed for the quantification of cyber-physical signal characteristics and features, and a highly standardized constant-Q variation of the Gabor atom is developed for use with wavelet transforms. Two different CWT reconstruction schemas are presented and tested under different SNR conditions. A sparse representation of the Nth order Gabor atoms worked well against a test blast synthetic using the wavelet entropy and a comparable entropy-like parametrization of the SNR as the CWT coefficient-weighting functions. The proposed methods should be well suited for dictionary-based machine learning.

We search for limit cycles in the dynamical model of two-species chemical reactions that contain seven reaction rate coefficients as parameters and at least one third-order reaction step, that is, the induced kinetic differential equation of the reaction is a planar cubic differential system. Symbolic calculations were carried out using the Mathematica (or, Wolfram language) mathematical program package, and it was also used for the numerical verifications to show the following facts: the kinetic differential equations of these reactions each has two limit cycles surrounding the stationary point of focus type in the positive quadrant. In the case of Model 1, the outer limit cycle is stable and the inner one is unstable that appears in a supercritical Hopf bifurcation. Moreover, the oscillations in a neighborhood of the outer limit cycle are slow-fast oscillations. In the case of Model 2, the outer limit cycle is unstable and the inner one is stable. With another set of parameters, the outer limit cycle can be made stable and the inner one unstable.

Assigning tasks in the project to each member is a difficult job in project management. In this study, we build a multi-objective combinatorial optimization model to assign project tasks of the software project to its members automatically. The model aims to minimize the critical path and a strategy to employs human resources to optimize the project cost determined, meanwhile maintain the quality of the labor force. The necessary constraints of the makespan problem strictly followed. There are both preference and non-preference applied to transform the multi-objective optimization problem to a single objective respectively, are Linear Scalarizing and Compromise Programming. The benefit of each approach clarified. Due to the proposed model is NP-Hard and not possible to solve with an Exact Algorithm, we design a scheme of the Genetic Algorithms to solve the combinatorial optimization problems. Experimental results show that the algorithm worked well on the real dataset.

Motivated by the #Metoo movement, we explore in this paper people’s perception of female bullying at workplace. We looked at #workplacebullying and found that 1) people were split between identifying the prevalence of workplace bullying against female and the view that such bullying simply does not exist and is a nuisance, 2) The tweets also showed the existence of psychological effects of cyberbullying, and 3) the tweets showed many intervention techniques that can minimize the effects of such bullying. We further explored the top three recurring hashtags mentioned under the #workplacebullying and found that the three top hashtags were #sexism, #feminism and #equality. Our results showed that the above hashtags represent the positive and negative approach to workplace bullying i.e. #feminism hashtag was mostly used by people who denied that workplace bullying against females exist while # sexism was mentioned as the prime cause by people who agree that such bullying exist. #equality overwhelmingly comprises of techniques to minimize workplace bullying against females.

During recent decades, contextual computing applications have emerged in the field of healthcare and particularly in the field of telemonitoring of patients suffering from chronic obstructive pulmonary disease (COPD). According to WHO rankings, chronic obstructive pulmonary disease (COPD) is the third leading cause of death worldwide. Various research works are therefore carried out to improve the health of patients and the monitoring of patients in the comfort of their home environment. To this end, several telemonitoring systems are designed to COPD patients. These systems are connected to health center. Emergency physicians follow the patients subscribed to these systems remotely. These systems focus mainly on prediction, decision-making and the requirements of the healthcare profession, and do not address the quality control aspects of services or QoS based on service level agreements (SLAs). This situation can be dangerous for patients in case of extreme exacerbation of COPD patients. For example, the unavailability of the monitoring system can lead to the death of the patient because the emergency physician could not have access to the patient's data in real time in the context of COPD Patient Monitoring. In addition, Remote medical monitoring platforms are manipulating large volumes of data and the risks of data lost or data quality are real. It is therefore important to have the mechanisms to continuously improve the quality of service of these monitoring platforms in general and COPD patients particularly. In this article, we propose an ontology that uses SLA information from COPD monitoring platforms with dynamic data from the patient context. The purpose of this article is to propose a dynamic mechanism model for evaluating SLA violations. This solution allows retrieving knowledge from the main items of the SLA document based on XML and the COPD patient context data dynamically from a COPD SLA ontology. These data retrieved in real time allow the calculation of SLO-based metrics and display a SLA template available on the supplier and consumer interfaces. The information of the SLA violation control Interface changes dynamically depending the context-aware system and SLA document data. The SLA parties can dynamically control their Key Performance Indicators (KPI) Target.

The implementation of teaching interventions in learning needs has received considerable attention, as the provision of the same educational conditions to all students, is pedagogically ineffective. In contrast, more effectively considered the pedagogical strategies that adapt to the real individual skills of the students. An important innovation in this direction is the Adaptive Educational Systems (AES) that support automatic modeling study and adjust the teaching content on educational needs and students' skills. Effective utilization of these educational approaches can be enhanced with Artificial Intelligence (AI) technologies in order to the substantive content of the web acquires structure and the published information is perceived by the search engines. This study proposes a novel Adaptive Educational eLearning System (AEeLS) that has the capacity to gather and analyze data from learning repositories and to adapt these to the educational curriculum according to the student skills and experience. It is a novel hybrid machine learning system that combines a Semi-Supervised Classification method for ontology matching and a Recommendation Mechanism that uses a hybrid method from neighborhood-based collaborative and content-based filtering techniques, in order to provide a personalized educational environment for each student.

COVID-19 has created anxiety not only in individuals but also in health organizations, and countries worldwide. Not a single industry is left un-influenced and loss is being estimated in billions of dollars. The widespread of this pandemic disease has challenged researchers all over the world. Some of the researchers are working to invent its cure while, others are applying computing technologies to stop its spread, by analyzing and identifying patterns for prediction and forecasting. This is by no doubt the hottest area of research for the last 100 years. This survey has targeted the research published in computing sub-domains to combat the pandemic. The survey has clustered the scientific efforts into logical groups: surveillance, metrological effects, social media analytics, image processing and business and economy, analysis and modeling. It will serve as a leading source for the followings: researchers who want to identify what has been achieved in different computing sub-domains, those who need fresh authenticated datasets openly accessible for different research contexts and what are future directions in this area of research. The findings of analysis and modeling can be also useful for government agencies who want to set priorities and formulate policies.

The aim of this 9th expository article is to conclude a study on domination in two fuzzy models, including t−norm fuzzy graphs and fuzzy graphs. All parts are twofold even if we don’t men- tion, directly. I.e., all results depicts some properties about fuzzy graph and t−norm fuzzy graph.