Deep learning is an emerging area of machine learning (ML) research. It comprises multiple hidden layers of artificial neural networks. The deep learn- ing methodology applies nonlinear transformations and model abstractions of high level in large databases. The recent advancements in deep learning architec- tures within numerous fields have already provided significant contributions in artificial intelligence. This article presents a state of the art survey on the contri- butions and the novel applications of deep learning. The following review chron- ologically presents how and in what major applications deep learning algorithms have been utilized. Furthermore, the superior and beneficial of the deep learning methodology and its hierarchy in layers and nonlinear operations are presented and compared with the more conventional algorithms in the common applica- tions. The state of the art survey further provides a general overview on the novel concept and the ever-increasing advantages and popularity of deep learning.

Artificial intelligence (AI) has the potential to revolutionize research by automating data analysis, generating new insights, and supporting the discovery of new knowledge. The top 10 contribution areas of AI towards public health were gathered in this feasibility study. We utilized the “text-davinci-003” model of GPT-3, using OpenAI playground default parameters. The model was trained with the largest training dataset any AI had, limited to a cut-off date in 2021. This study aimed to test the ability of GPT-3 to advance public health and to explore the feasibility of using AI as scientific co-author. The AI was asked for input including scientific quotations and the human authors reviewed responses for plausibility. We found that GPT-3 was able to assemble, summarize, and generate plausible text blocks relevant for public health concerns, elucidating valuable areas of application for itself. However, most quotations were invented by GPT-3 and thus, invalid. Ac-cording to today’s rules, we conclude that AI can contribute to public health research as a team member. Nevertheless, good scientific practice needs to be also followed for AI contributions, and a broad scientific discourse on AI contributions is needed. Policies for good scientific practice should be updated timely following this discourse.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

This paper presents a quantitative approach to poetry, based on the use of several statistical measures (entropy, information energy, N-gram, etc.) applied to a few characteristic English writings. We found that English language changes its entropy as time passes, and that entropy depends on the language used and on the author. In order to compare two similar texts, we were able to introduce a statistical method to asses the information entropy between two texts. We also introduced a method of computing the average information conveyed by a group of letters about the next letter in the text. We found a formula for computing the Shannon language entropy and we introduced the concept of N-gram informational energy of a poetry. We also constructed a neural network, which is able to generate Byron-type poetry and to analyze the information proximity to the genuine Byron poetry.

In cricket, particularly the twenty20 format is most watched and loved by the people, where no one can guess who will win the match until the last ball of the last over. In India, The Indian Premier League (IPL) started in 2008 and now it is the most popular T20 league in the world. So we decided to develop a machine learning model for predicting the outcome of its matches. Winning in a Cricket Match depends on many key factors like a home ground advantage, past performances on that ground, records at the same venue, the overall experience of the players, record with a particular opposition, and the overall current form of the team and also the individual player. This paper briefs about the key factors that affect the result of the cricket match and the regression model that best fits this data and gives the best predictions. Cricket, the mainstream and widely played sport across India which has the most noteworthy fan base. Indian Premier League follows 20-20 format which is very unpredictable. IPL match predictor is a ML based prediction approach where the data sets and previous stats are trained in all dimensions covering all important factors such as: Toss, Home Ground, Captains, Favorite Players, Opposition Battle, Previous Stats etc, with each factor having different strength with the help of KNIME Tool and with the added intelligence of Naive Bayes network and Eulers strength calculation formula.

Multiple sensor nodes known as detection stations make the sensor networks; each node is light and portable. Every sensor node contains power source, microcomputer, transducer and transceiver. Power source provides power to each node. Micro-computer is used for storing and processing the output coming from the sensors. The transducer is used to generate the signals and the transceiver is used to receive and transmit data to the central computer. Eavesdropping gets facilitated with wireless communication, and it has many useful applications in military, homeland, hostile and uncontrolled environments. So it is prone to the high level of security. The process in which information is gathered to form a summarized type for analysis is known as data aggregation, as it is used to reduce the energy consumption in wireless sensor networks. The security issues have become crucial in data aggregation, especially when gets deployed in hostile and remote environment. In wireless sensor networks many secure aggregations have been proposed. It still faces some resource constrained that’s why new techniques are needed. In our survey we will discuss those approaches and their pros and cons.

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

This paper presents an upcoming nonvolatile memories (NVM) overview. Non-volatile memory devices are electrically programmable and erasable to store charge in a location within the device and to retain that charge when voltage supply from the device is disconnected. The non-volatile memory is typically a semiconductor memory comprising thousands of individual transistors configured on a substrate to form a matrix of rows and columns of memory cells. Non-volatile memories are used in digital computing devices for the storage of data. In this paper we have given introduction including a brief survey on upcoming NVM's such as FeRAM, MRAM, CBRAM, PRAM, SONOS, RRAM, Racetrack memory and NRAM. In future Non-volatile memory may eliminate the need for comparatively slow forms of secondary storage systems, which include hard disks.

Build a special identical equation, use its calculation characters to prove and search for solution of any odd converging to 1 equation through (*3+1)/2^k operation, change the operation to (*3+2^m-1)/2^k, and get a solution for this equation, give a specific example to verify. Thus prove the Collatz Conjecture is true. Furthermore, analysis the sequences produced by iteration calculation during the procedure of searching for solution, build a weight function model, prove it decrease progressively to 0, build a complement weight function model, prove it increase to its convergence state. Build a (*3+2^m-1)/2^k odd tree, prove if odd in (*3+2^m-1)/2^k long huge odd sequence can not converge, the sequence must outstep the boundary of the tree after infinite steps of (*3+2^m-1)/2^k operation.

Multiple governmental agencies and private organisations have made commitments for the colonisation of Mars. Such colonisation requires complex systems and infrastructure that could be very costly to repair or replace in cases of cyber-attacks. This paper surveys deep learning algorithms, IoT cyber security and risk models, and established mathematical formulas to identify the best approach for developing a dynamic and self-adapting system for predictive cyber risk analytics supported with Artificial Intelligence and Machine Learning and real-time intelligence in edge computing. The paper presents a new mathematical approach for integrating concepts for cognition engine design, edge computing and Artificial Intelligence and Machine Learning to automate anomaly detection. This engine instigates a step change by applying Artificial Intelligence and Machine Learning embedded at the edge of IoT networks, to deliver safe and functional real- time intelligence for predictive cyber risk analytics. This will enhance capacities for risk analytics and assists in the creation of a comprehensive and systematic understanding of the opportunities and threats that arise when edge computing nodes are deployed, and when Artificial Intelligence and Machine Learning technologies are migrated to the periphery of the internet and into local IoT networks.

Recently, the medical image processing is extensively used in several areas. In earlier detection and treatment of these diseases is very helpful to find out the abnormality issues in that image. Here there are number of methods available for segmentation to detect the lung nodule of computer tomography (CT) image. The main result of this paper, the earlier detection of lung nodules using Pre-processing techniques of top-hat transform, median and adaptive bilateral filter was compared both filtering methods and proved the adaptive bilateral filter is suitable method for CT images. The proposed segmentation technique uses novel strip method and the image is split into number of strips 3, 4, 5 and 6. A marker- watershed method based on PSO and Fuzzy C-mean Clustering method was proposed method. Firstly, the input image was reduced noise reduction and smoothing and the filter image is using strips method and then the image is segmented by marker watershed method. Secondly, the enhanced PSO technique was used to locate the better accurate value of the clustering centers of Fuzzy C-mean Clustering. Final stage, with the accurate value of centers and the enhanced target function and the small region of the segmented object was clustered by Fuzzy C-mean. In segmentation algorithm presented in this paper gives 95% of accuracy rate to detect lung nodules when strip count is 5.

Cloud Computing is a promising and emerging technology that is rapidly being adopted by many IT companies due to a number of benefits that it provides, such as large storage space, low investment cost, virtualization, resource sharing, etc. Users are able to store a vast amount of data and information in the cloud and access it from anywhere, anytime on a pay-per-use basis. Since many users are able to share the data and the resources stored in the cloud, there arises a need to provide access to the data to only those users who are authorized to access it. This can be done through access control schemes which allow the authenticated and authorized users to access the data and deny access to unauthorized users. In this paper, a comprehensive review of all the existing access control schemes has been discussed along with analysis. Keywords: role-based access control, attribute-based access control, attribute-based encryption

We describe a dataset that contains job description published on a popular online website in the information and technology sector. As the website focus mainly on United Kingdom based jobs, the data have a specific focus on this country. It contains 11.501 job vacancies and 13 related meta data information. The dataset is suitable for HR analysis using machine learning techniques such as natural language processing and neural networks.

Day-ahead forecasting of electricity prices is important in deregulated electricity markets for all the stakeholders: energy wholesalers, traders, retailers, and consumers. Electricity price forecasting is an inherently difficult problem due to its special characteristic of dynamicity and non-stationarity. In this paper, we present a robust price forecasting mechanism that shows resilience towards aggregate demand response effect and provides highly accurate forecasted electricity prices to the stakeholders in a dynamic environment. We employ an ensemble prediction model in which a group of different algorithms participate in predicting the price for each hour of a day. We propose two different strategies, namely, Fixed Weight Method (FWM) and Varying Weight Method (VWM), for selecting each hour's expert algorithm from the set of participating algorithms. In addition, we utilize a carefully engineered set of features selected from a pool of features derived from information such as past electricity price data, weather data, and calendar data. The proposed ensemble model offers better results than both the Pattern Sequence-based Forecasting (PSF) method and our own previous work using Artificial Neural Networks (ANN) alone do on the datasets for New York, Australian, and Spanish electricity markets.

Komlos conjecture is about the existing of a constant upper bound over the dimension n of the function $K(n)$ defined by $$K(n)=max_{ \{ \overrightarrow{V_1},...,\overrightarrow{V_n} \} \in \{ \overrightarrow{V_i} \in { R}^n \| \overrightarrow{V_i} \| \leq 1 \} ^n } min_{ \{\epsilon_1,...\epsilon_n\} \in \{-1,+1\}^n } \|\sum_{i=0}^{n} \epsilon_i \overrightarrow{V_i}\}\|_{\infty} $$ In this paper, the function $K(n)$ is evaluated first for lower dimensions, $n\leq 5$, where it found that $K(2)=\sqrt{2}$. For higher dimension, the function $f(n)=\sqrt{ n-\lceil\log_2(2^{n-1}/n) \rceil}$ is found to be a lower bound for the function $K(n)$, from where it is concluded that the Komlos conjecture is false i.e., the universal constant $k=max_{n \in N} K(n) $ does not exist because of $$\lim_{n \rightarrow \infty } K(n) \geq \lim_{n \rightarrow \infty } \sqrt{ \log_2(n)-1 }=+\infty$$

In this paper, we scrutinize the axiomatic system of effect algebras which is given by D. J. Foulis and M.K. Bennett in the paper Effect Algebras and Unsharp Quantum Logics. We prove that this axiomatic system consists of independent axioms. To do this, we construct some models to indicate the indepence of each axiom. Therefore none of these axioms can be reduced when constructing any effect algebra. As a result, any algebra is an effect algebra if and only if it verifies (E1)-(E4) axioms.

In the paper, the authors present an explicit form for a family of inhomogeneous linear ordinary differential equations, find a more significant expression for all derivatives of a function related to the solution to the family of inhomogeneous linear ordinary differential equations in terms of the Lerch transcendent, establish an explicit formula for computing all derivatives of the solution to the family of inhomogeneous linear ordinary differential equations, acquire the absolute monotonicity, complete monotonicity, the Bernstein function property of several functions related to the solution to the family of inhomogeneous linear ordinary differential equations, discover a diagonal recurrence relation of the Stirling numbers of the first kind, and derive an inequality for bounding the logarithmic function.

Local polynomial smoother (LPS) is a weighted local least-squares nonparametric method. It provides a local Taylor series fit of the data at any location and can be directly used in a differential equation to provide a numerical scheme. In this article, we introduce this new nonparametric idea based on local polynomial smoother, for acquiring the numerical solution of the Bagley-Torvik fractional-order differential equations. Furthermore, this paper will present a numerical comparison with some methods, such as legendre operational matrix and pseudo-spectral method. The efficiency and accuracy of the LPS method are demonstrated by two numerical examples.

This article investigates a proposed new mathematical model that considers the infected individuals using various rate coefficients such as transmission, progression, recovery and vaccination. The fact that the dynamic analysis is completely determined by the basic reproduction number is established. More specifically, local and global stabilities of the disease-free equilibrium and the endemic equilibrium are proved under certain parameter conditions when the basic reproduction number is below or above unity. A realistic computer simulation is performed for better understanding of the variations in trends of different compartments after the outbreak of the disease.

In this article, a generalization of the geometry of Grassmannian chain complex of free abelian groups generated by the projective configuration of points and Cathelineau's infinitesimal complex of polylogarithmic groups is proposed. Firstly, homomorphisms for weight n =2 up to weight n=6 will be introduced to connect sub-complexes of Grassmannian and Cathelineau. Lately, generalization of these morphisms will be shown for weight n=N. The associated diagrams will also be proven to be commutative and bi-complex.

Historic expeditions are events that are flavored by exploratory, scientific, military or geographic characteristics. Such events are often documented in literature, journey notes or personal diaries. A typical historic expedition involves multiple site visits and their descriptions contain spatiotemporal and attributive contexts. Expeditions involve movements in space that can be represented by triplet features (location, time and description). However, such features are implicit and innate parts of textual documents. Extracting the geospatial information from these documents requires understanding the contextualized entities in the text. To this end, we developed a semi-automated framework that has multiple Information Retrieval and Natural Language Processing components to extract the spatiotemporal information from a two-volumes historic expedition gazetteer. Our framework has three basic components, namely, the Text Preprocessor, the Gazetteer Processing Machine and the JAPE (Java Annotation Pattern Engine) Transducer. We used the Brazilian Ornithological Gazetteer as an experimental dataset and extracted the spatial and temporal entities from entries that refer to three expeditioners’ site visits and mapped the trajectory of each expedition using the extracted information. Finally, one of the mapped trajectories was manually compared with a historical reference map of that expedition to assess the reliability of our framework. The reference map was manually prepared in previous research work by others.

Recent advancement of deep learning has been elevated the multifaceted nature in various applications of this field. Artificial neural networks are now turning into a genuinely old procedure in the vast area of computer science; the principal thoughts and models are more than fifty years of age. However, in this modern computing era, 3rd generation intelligent models are introduced by scientists. In the biological neuron, actual film channels control the progression of particles over the layer by opening and shutting in light of voltage changes because of inborn current flows and remotely led to signals. A comprehensive 3rd generation, Spiking Neural Network (SNN) is diminishing the distance between deep learning, machine learning, and neuroscience in a biologically-inspired manner. It also connects neuroscience and machine learning to establish high-level efficient computing. Spiking Neural Networks initiate utilizing spikes, which are discrete functions that happen at focuses as expected, as opposed to constant values. This paper is a review of the biological-inspired spiking neural network and its applications in different areas. The author aims to present a brief introduction to SNN, which incorporates the mathematical structure, applications, and implementation of SNN. This paper also represents an overview of machine learning, deep learning, and reinforcement learning. This review paper can help advanced artificial intelligence researchers to get a compact brief intuition of spiking neural networks.

The study of different forms of preconditioners for solving a system of nonlinear equations, by using Newton’s method, is presented. The preconditioners provide numerical stability and rapid convergence with reasonable computation cost, whenever chosen accurately. Different families of iterative methods can be constructed by using a different kind of preconditioners. The multi-step iterative method consists of a base method and multi-step part. The convergence order of base method is quadratic and each multi-step add an additive factor of one in the previously achieved convergence order. Hence the convergence of order of an m-step iterative method is m + 1. Numerical simulations confirm the claimed convergence order by calculating the computational order of convergence. Finally, the numerical results clearly show the benefit of preconditioning for solving system of nonlinear equations.

Categorical variables are common in spatial data analysis. Traditional analytical methods for deriving probabilities of class occurrence, such as kriging-family algorithms, have been hindered by the discrete characteristics of categorical fields. This study introduces the theoretical backgrounds of linear Bayesian updating (LBU) approach for spatial classification through expert system. Transition probabilities are interpreted as expert opinions for updating the prior marginal probabilities of categorical response variables. The main objective of this paper is to present the solid theoretical foundations of LBU and provide a categorical random field prediction method which yields relatively higher classification accuracy compared with conventional Markov chain random field (MCRF) approach. A real-world case study has also been carried out to demonstrate the superiority of our method. Since the LBU idea is originated from aggregating expert opinions and not restricted to conditional independent assumption (CIA), it may prove to be reasonably adequate for analyzing complex geospatial data sets, like remote sensing images or area-class maps.

Information-theoretic measures such as the entropy, cross-entropy and the Kullback-Leibler divergence between two mixture models is a core primitive in many signal processing tasks. Since the Kullback-Leibler divergence of mixtures provably does not admit a closed-form formula, it is in practice either estimated using costly Monte-Carlo stochastic integration, approximated, or bounded using various techniques. We present a fast and generic method that builds algorithmically closed-form lower and upper bounds on the entropy, the cross-entropy and the Kullback-Leibler divergence of mixtures. We illustrate the versatile method by reporting on our experiments for approximating the Kullback-Leibler divergence between univariate exponential mixtures, Gaussian mixtures, Rayleigh mixtures, and Gamma mixtures.

The software industry has adopted component-based software development (CBSD) to rapidly build and deploy large and complex software systems with significant savings at minimal engineering effort, cost, and time. However, CBSD encounters issues on security trust, mainly with respect to dependability attributes. A system is considered dependable when it can produce the outputs for which it was designed with no adverse effect on its intended environment. Dependability consists of several attributes that imply availability, confidentiality, integrity, reliability, safety, and maintainability. Dependability attributes must be embedded in a CBSD model to develop dependable component software. Motivated by the importance of these attributes, this paper pursues two objectives: to design a model for developing a dependable system that mitigates the vulnerabilities of software components, and to evaluate the proposed model. The model proposed in this study is labelled as developing dependable component-based software (2DCBS). To develop this model, the CBSD architectural phases and processes must be framed and the six dependability attributes embedded according to the best practice method. The expert opinion approach was applied to evaluate 2DCBS framing. In addition, the 2DCBS model was applied to the development of an information communication technology (ICT) portal through an empirical study method. Vulnerability assessment tools (VATs) were employed to verify the dependability attributes of the developed ICT portal. Results show that the 2DCBS model can be adopted to develop web application systems and to mitigate the vulnerabilities of the developed systems. This study contributes to CBSD and facilitates the specification and evaluation of dependability attributes throughout model development. Furthermore, the reliability of the dependable model can increase confidence in the use of CBSD for industries.

In this paper we consider type II bivariate generalized power series Poisson distribution as a compound Poisson distribution with bivariate generalized power series compounding distribution. We obtain some properties, p.m.f. and conditional distributions. In addition we also give a brief discussion about the multivariate extension of this case. Then we introduce type II bivariate generalized power series Poisson process and consider a bivariate risk model with type II bivariate generalized power series Poisson model as the counting process. For this model we derive distribution of the time to ruin and bounds for the probability of ruin. We obtain partial integro-differential equation for the ruin probabilities and express its bivariate transform through two univariate boundary transforms,where one of the initial capitals is fixed at zero.

Myocarditis is the form of an inflammation of the middle layer of the heart wall which is caused by a viral infection and can affect the heart muscle and its electrical system. It has remained as one of the most challenging diagnoses in cardiology. Myocardial is the prime cause of unexpected death in approximately 20% of adults less than 40 years of age. Cardiac MRI (CMR) has been considered as a noninvasive and golden standard diagnostic tool for suspected myocarditis and plays an indispensable role in diagnosing various cardiac diseases. However, the performance of CMR is heavily dependent on the clinical presentation and non-specific features such as chest pain, arrhythmia, and heart failure. Besides, other imaging factors like artifacts, technical errors, pulse sequence, acquisition parameters, contrast agent dose, and more importantly qualitatively visual interpretation can affect the result of the diagnosis. This paper introduces a new deep learning-based model called Convolutional Neural Network-Clustering (CNN-KCL) to diagnose the Myocarditis. The hybrid CNN-KCL method performs the early and accurate diagnosis of Myocarditis. To the best-of-our-knowledge, a Convolutional neural network has never been used before for the diagnosis of Myocarditis. In this study, we used 47 subjects to diagnose myocarditis patients from Tehran's Omid Hospital. The total number of data examined is 10425. Our results demonstrate that CNN-KCL achieves 92.3% in terms of diagnosis myocarditis prediction accuracy which is significantly better than those reported in previous studies.

One of the most common and important destructive attacks on the victim system is Advanced Persistent Threats (APT)-attack. The APT attacker can achieve his hostile goals by obtaining information and gaining financial benefits regarding the infrastructure of a network. One of the solutions to detect a secret APT attack is using network traffic. Due to the nature of the APT attack in terms of being on the network for a long time and the fact that the network may crash because of high traffic, it is difficult to detect this type of attack. Hence, in this study, machine learning methods such as C5.0 decision tree, Bayesian network and deep neural network are used for timely detection and classification of APT-attacks on the NSL-KDD data set. Moreover, 10-fold cross validation method is used to experiment these models. As a result, the accuracy (ACC) of the C5.0 decision tree, Bayesian network and 6-layer deep learning models is obtained as 95.64%, 88.37% and 98.85%, respectively, and also, in terms of the important criterion of the false positive rate (FPR), the FPR value for the C5.0 decision tree, Bayesian network and 6-layer deep learning models is obtained as 2.56, 10.47 and 1.13, respectively. Other criterions such as sensitivity, specificity, accuracy, false negative rate and F-measure are also investigated for the models, and the experimental results show that the deep learning model with automatic multi-layered extraction of features has the best performance for timely detection of an APT-attack comparing to other classification models.

Urban rail transit hub platform is the most important area for passenger flow distribution. In order to calculate passenger flow volume in platform and evaluate platform service level during rush hours, this paper presents a method for modeling and simulation of passenger flow distribution in platform. Passenger flow distribution model (PFDM) is proposed based on the basic analysis and the superposition principle of passenger flow. Simulation design for PFDM is proposed by Anylogic, which contains simulation process and simulation model. Experiment results show that PFDM and simulation design are effective and accordant with the reality scenario, and the simulation precision is comparatively ideal. This research could provide a beneficial reference for train scheduling and operation management under the viewpoint of traffic safety and service level.

Recently emerging data-driven citizen sciences need to harness increasing amount of massive data with varying quality. This paper develops essential theoretical frameworks and example models and examine its computational complexity for interactive data-driven citizen science within the context of guided self-organization. We first define a conceptual model that incorporates quality of observation in terms of accuracy and reproducibility, ranging between subjectivity, inter-subjectivity, and objectivity. Next, we examine the database's algebraic and topological structure in relation to informational complexity measures, and evaluate its computational complexities with respect to exhaustive optimization. Conjectures of criticality are obtained on self-organizing processes of observation and dynamical model development. Example analysis is demonstrated with the use of biodiversity assessment database, the process that inevitably involves human subjectivity for the management in open complex systems.

In this paper we propose the explicit formulas of Average Run Length (ARL) of Exponentially Weighted Moving Average (EWMA) control chart for Autoregressive Integrated Moving Average: ARIMA (p,d,q) (P, D, Q)_L process with exponential white noise. To check the accuracy, the ARL results were compared with numerical integral equations based on the Gauss-Legendre rule. There was an excellent agreement between the explicit formulas and the numerical solutions. Additionally, we compared the computational time between our explicit formulas for the ARL with the one obtained via Gauss-Legendre numerical scheme. The computational time for the explicit formulas was approximately one second that is much less than the numerical approximations. The explicit analytical formulas for evaluating ARL0 and ARL₁ can produce a set of optimal parameters which depend on the smoothing parameter (λ) and the width of control limit (H), for designing an EWMA chart with a minimum ARL₁.

Due to advancement in hacking/reverse engineering tools, threat against transfer of sensitive data or highly classified information is always at risk of being intercepted by an attacker. Covert communication outwit this malicious breach of privacy act better than cryptography as it camouflage secret information inside another innocent looking information, while cryptography shows scrambled information that might arouse attention of an attacker. However, the challenges in Steganography are the modification of carrier that causes some abnormalities, which is detectable and often the methods are not optimize. This paper presents an approach in Covert communication Chanel, which utilizes mathematical concept of combination to optimize time of transmission using sets of multiple transmitter’s, and receiver’s addresses where each abstractly represents a set of bits or characters combination without modifying the address. To minimize the number of physical address to be use, a combinatorial and permutation concept of virtual address generation from physical address is introduce. The paper in addition presents some technique like relationship and their application in both re-enforcing resistivity against Steganalysis and generating combinations. Furthermore, a concept of dynamical clockwise and anti-clockwise rotation of combination over addresses after every transmission is introduce to further improve on resistivity against Steganalysis. A simple test was performed for demonstrating relay address, combination and permutation concepts. Based on test results and analysis, the method is effective as expected and it is quite easy to use as it can be implemented in different platform without much difficulties.

Visualizing geo-spatial data embedded into a three-dimensional terrain is challenging. The problem becomes even more complex when uncertainty information needs to be presented as well. This paper addresses the question of how to visually communicate all three aspects: the 3D terrain, the geo-spatial data, and the data-associated uncertainty. We argue that visualizing all aspects with a high degree of detail will likely exceed the visual budget. Therefore, we propose a visualization strategy based on prioritizing a selected aspect and presenting the remaining two with less detail. We discuss various design options that allow us to obtain differently prioritized visual representations. Our approach has been implemented as a tool for rapid visualization prototyping in the context of avionics applications. Practical solutions are described for a use case related to the visualization of 3D terrain and uncertain weather data.

A text obtained by a Large Language Model (LLM) such as GPT4 usually has issues in terms of incorrectness and hallucinations. We build a fact-checking system 'Truth-O-Meter' which identifies wrong facts, comparing the generation results with the web and other sources of information, and suggests corrections. Text mining and web mining techniques are leveraged to identify correct corresponding sentences; also, the syntactic and semantic generalization procedure adopted to the content improvement task. To handle inconsistent sources while fact-checking, we rely on an argumentation analysis in the form of defeasible logic programming. We compare our fact checking engine with competitive approach based on reinforcement learning on top of LLM or token-based hallucination detection. It is observed that LLM content can be substantially improved for factual correctness and meaningfulness.

In this study, based on a new quantum integral identity, the authors establish some quantum estimates of Hermite-Hadamard type inequalities for convex functions. These results generalize and improve some known results given in literatures.

Cyber Physical Systems (CPS) is the integration of computation and physical process that makes a complete system such as the physical components, networked systems, embedded computers and software and linking together of devices and sensors for information sharing. Cyber Physical Systems are Smart Systems that comprises of the merging and integration of Industry Control Systems, Critical Infrastructures, Internet of Things (IoT) and Embedded Systems. Major industries such as the Chemical and Industrial Plants, Aviation Systems, National Grid, the Stock Exchange, Military Systems, and others depends heavily on these Cyber Physical Systems for financial and economic growth. The benefits of CPS nationally and globally are in the areas of Manufacturing, Energy, Transport, Healthcare and Communication. Cyber Physical Systems incorporates Physical systems, Digital systems and Human elements on network infrastructures to provide interactive systems. However, these three key components the Physical systems, Digital systems and Human elements may have inherent threats and vulnerabilities on them that may run the risk of being compromise, exploited, attacked or hacked. Cybercriminals in their quest to bring down these systems and may cause disruption of services either for fame, revenge, political motive, economic war, cyber terrorism and cyber war. The study seeks to review the risks that are associated with these three key components Physical systems, Digital systems and Human elements. The study considered four main risk mitigation goals for this purpose, and these are Business Value, Organizational Requirements, Threat Agent and Impact based on the review results. We used Analytical Hierarchical Process (AHP) to determine the relative importance of these goals that contributes to developing cybercrime and rich in CPS. For the results, the prioritized goals are then used to assess the risks using a semi-quantitative approach to determine the net threat level.

This paper aims to develop a hierarchical risk assessment model using the newly-developed evidential reasoning (ER) rule, which constitutes a generic conjunctive probabilistic reasoning process. In this paper, we first provide a brief introduction to the basics of the ER rule and emphasize the strengths for representing and aggregating uncertain information from multiple experts and sources. Further, we discuss the key steps of developing the hierarchical risk assessment framework systematically, including (1) formulation of risk assessment hierarchy, (2) representation of both qualitative and quantitative information, (3) elicitation of attribute weights and information reliabilities, (4) aggregation of assessment information using the ER rule and (5) quantification and ranking of risks using utility-based transformation. The proposed hierarchical risk assessment framework can potentially be implemented to various complex and uncertain systems. A case study on the fire/explosion risk assessment of marine vessels demonstrates the applicability of the proposed risk assessment model.

The public release of ChatGPT, a generative artificial intelligence language model, caused wide-spread public interest in its abilities but also concern about the implications of the application on academia, depending on whether it was deemed benevolent (e.g., supporting analysis and simplification of tasks) or malevolent (e.g., assignment writing and academic misconduct). While ChatGPT has been shown to provide answers of sufficient quality to pass some university exams, its capacity to write essays that require an exploration of value concepts is unknown. This paper presents the results of a study where ChatGPT 4 (release May 2023) was tasked with writing a 1500-word essay to discuss the nature of values used in the assessment of cultural heritage significance. Based on an analysis of 36 iterations, ChatGPT writes essays of limited length of about 50% of the stipulated word count which are primarily descriptive without any depth or complexity. The concepts, which are often flawed and suffer from inverted logic, are presented in an arbitrary sequence with limited coherence and without any defined line of argument. Given that it is a generative language model, ChatGPT often splits concepts and uses one or more words to develop tangential arguments. While ChatGPT provides references as tasked, many are fictitious, albeit with plausible authors and titles. At present ChatGPT has the ability to critique its own work but seems unable to incorporate that critique in a meaningful way to improve a previous draft. Setting aside conceptual flaws such as inverted logic, several of the essays could possibly pass as a junior school assignment, but fall far short of what would be expected in senior school, let alone at a college and university level.

Entanglement is at the heart of quantum technologies such as quantum information and quantum metrology. Providing larger quantum Fisher information (QFI), entangled systems can be better resources than separable systems in quantum metrology. QFI topic is a very active research area and it has many possible usage areas in quantum information domain. In this study, we review quantum Fisher information research with both from theoritical and application perspective.

In the paper, the authors find two explicit formulas and recover a recursive formula for the generalized Motzkin numbers. Consequently, the authors deduce two explicit formulas and a recursive formula for the Motzkin numbers, the Catalan numbers, and the restricted hexagonal numbers respectively.

We approximate the trigonometric function sine and cosine on the interval . This analysis provides two formulas to approximate sine and cosine. At first, we try to derive the formula which involves a square root, and then we derive another formula that does not require any use of a square root. Nevertheless, after deriving the procedure which requires no square root, we further try to increase its accuracy and then derive another formula that approximates trigonometric functions more accurately on the interval [0, pi/2]. So, this analysis provides mainly two types of procedures. One uses square roots, whereas the other does not. We also focus on ensuring the accuracy of these trigonometric functions in the interval [0,pi/2]. This accuracy analysis is portrayed using the graph. This graph shows the difference between the values generated by the functions defined here and the actual value of these functions. So, these graphs also indicate the error of these functions on that interval. Finally, we compare our approximation with the approximation formula of the 7th-century Indian Mathematician Bhaskara I.

In this paper, we study a one-dimensional Bresse-Cattaneo system with infinite memories and time-dependent delay term (the coefficient of which is not necessarily positive) in the internal feedbacks. First, it is proved that the system is well-posed by means of the Hille-Yosida theorem under suitable assumptions on the relaxation functions. Then, without any restriction on the speeds of wave propagations, we establish the exponential or general decay result by introducing suitable energy and Lyapunov functionals.

This paper is an attempt to present a COVID-19 prediction model for India. Lockdown plays an important role in the arrest of community spread of the disease. This was evident from the study of other countries such as Russia, Belgium and Germany, where peak cases were recorded within a month of the imposition of lockdown, that it showed an immediate positive effect. However, in India, even after 65 days of lockdown, there is no decrease in the number of daily new cases reported. There were many models prepared for India and almost all of them were proven wrong by the increase in the number of cases. The model in this paper is prepared using the COVID-19 trend in other countries, population density and the pandemic bell curve. Based on the available data until 24^th May 2020, two scenarios have been presented. In one, the peak shall be obtained when the number of daily new cases per million reaches 190 and in the second when the daily new cases per million reach 724. One model predicts the number of cases to reach 1 million by mid-July 2020. The other model predicts the number of cases to peak by mid-July with the total cases reaching 20 million. The predicted cases were compared with the actual cases recorded for the period 25^th May to 11^th June 2020. It was observed that the actual values matched quite reasonably with the predicted values.

Reconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of steps such that each step produces an intermediate feasible solution. The solution space can be represented as a reconfiguration graph, where two vertices representing solutions are adjacent if one can be formed from the other in a single step. Work in the area encompasses both structural questions (Is the reconfiguration graph connected?) and algorithmic ones (How can one find the shortest sequence of steps between two solutions?) This survey discusses techniques, results, and future directions in the area.

P versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States National Security Agency. However, a 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 NP-complete. It is well-known that P is equal to NP under the assumption of the existence of a polynomial time algorithm for some NP-complete. We show that the Monotone Weighted Xor 2-satisfiability problem (MWX2SAT) is NP-complete and P at the same time. Certainly, we make a polynomial time reduction from every directed graph and positive integer k in the K-CLOSURE problem to an instance of MWX2SAT. In this way, we show that MWX2SAT is also an NP-complete problem. Moreover, we create and implement a polynomial time algorithm which decides the instances of MWX2SAT. Consequently, we prove that P = NP.

Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the ev-degree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we define the ve-degree and ev-degree Narumi–Katayama indices, investigate the predicting power of these novel indices and extremal graphs with respect to these novel topological indices. Also we give some basic mathematical properties of ev-degree and ve-degree Narumi-Katayama and Zagreb indices.

We study certain function algebras and their operator algebra completions on r-discrete abelian groupoids, the corresponding conditional expectations, maximal abelian subalgebras (masa) and eigen-functionals.

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, the average lower 2-domination number of a graph is a measure of the graph vulnerability and it is defined by ${\gamma }_{2av}\left(G\right)=\frac{1}{\left|V\left(G\right)\right|}{\sum }_{v\in V\left(G\right)}{\gamma }_{2v}\left(G\right)$, where the lower 2-domination number, denoted by ${\gamma }_{2v}\left(G\right)$, of the graph G relative to v is the minimum cardinality of 2-domination set in G that contains the vertex v. In this paper, the average lower 2-domination number of wheels and some related networks namely gear graph, friendship graph, helm graph and sun flower graph are calculated. Then, we offer an algorithm for computing the 2-domination number and the average lower 2-domination number of any graph G.

This paper presents a new method for approximating the classical arcsine function. The proposed approximating methodology is simpler in its approach than other classical approaches and undeniably innovative. It is based on matrix representation besides the basic interpolation to approximate the inverse trigonometric function. It provides an efficient model which allows for reliable and precise calculations. The results are as per our knowledge unseen results in the previous literature.

Graph coloring is a manifestation of graph partitioning, wherein, a graph is partitioned based on the adjacency of its elements. Partitioning serves potentially as a compartmentalization for any structural problem. Vertex coloring is the heart of the problem which is to find the chromatic number of a graph. The fact that there is no general efficient solution to this problem that may work unequivocally for all graphs opens up the realistic scope for combinatorial optimization algorithms to be invoked. The algorithmic complexity of graph coloring is non-deterministic in polynomial time (NP) and hard. To the best of our knowledge, there is no algorithm as yet that procures an exact solution of the chromatic number comprehensively for any and all graphs within the polynomial (P) time domain. However, several heuristics as well as some approximation algorithms have been attempted to obtain an approximate solution for the same. Here, we present a novel heuristic, namely, the 'trailing path', which returns an approximate solution of the chromatic number within polynomial time, and, with a better accuracy than most existing algorithms. The ‘trailing path’ algorithm is effectively a subtle combination of the search patterns of two existing heuristics (DSATUR and Largest First), and, operates along a trailing path of consecutively connected nodes (and thereby effectively maps to the problem of finding spanning tree(s) of the graph) during the entire course of coloring, where essentially lies both the novelty and the apt of the current approach. The study also suggests that the judicious implementation of randomness is one of the keys towards rendering an improved accuracy in such combinatorial optimization algorithms. Apart from the algorithmic attributes, essential properties of graph partitioning in random and different structured networks have also been surveyed, followed by a comparative study. The study reveals the remarkable stability and absorptive property of chromatic number across a wide array of graphs. Finally, a case study is presented to demonstrate the potential use of graph coloring in protein design – yet another hard problem in structural and evolutionary biology.

In an era of rapid global change, our ability to understand and predict Earth's natural systems is lagging behind our ability to monitor and measure changes in the biosphere. Bottlenecks in our ability to process information have reduced our capacity to fully exploit the growing volume and variety of data. Here, we take a critical look at the information infrastructure that connects modeling and measurement efforts, and propose a roadmap that accelerates production of new knowledge. We propose that community cyberinfrastructure tools can help mend the divisions between empirical research and modeling, and accelerate the pace of discovery. A new era of data-model integration requires investment in accessible, scalable, transparent tools that integrate the expertise of the whole community, not just a clique of ‘modelers’. This roadmap focuses on five key opportunities for community tools: the underlying backbone to community cyberinfrastructure; data ingest; calibration of models to data; model-data benchmarking; and data assimilation and ecological forecasting. This community-driven approach is key to meeting the pressing needs of science and society in the 21st century.

In this paper we report a new development on the numerical model for aluminum-steam combustion. This model is based on diffusion flame of continuum regime and the thermal equilibrium between the particle and the flow field, which can be used to calculate the aluminum particle combustion model for two phase calculation conditions. The model prediction is in good agreement with the experimental data. A new type of vortex combustor was proposed for the combustion of aluminum and steam, and the mathematical model of the two phase reacting flow with in this combustor was established. The turbulence effects are modeled using the Reynolds Stress Model (RSM) with Linear Pressure-Strain approach, and the Eddy-Dissipation model is used to simulate the gas phase combustion. Aluminum particles are injected into the vortex combustor and form a swirling flow around the chamber and their trajectories are traced using the Discrete Phase Model (DPM). The simulation results show that the vortex combustor can achieve high efficient combustion of aluminum and steam. The influencing factors, such as the eccentric distance of the inlet of aluminum particles, particle size and steam inlet diameter, etc., are studied. The work described in this paper represents an attempt to the design of a vortex combustor in order to increase aluminum combustion efficiency.

We present a very computationally light and fast approximation algorithm and then verify it with genetic algorithm and simulated annealing. We show that our algorithm is on par with GA and SA in terms of output produced while having a tightly bounded time complexity. Our algorithm works best when there is a strong positive correlation between the reliability of a component and its cost. We present two algorithms with the same essence. One of them is system cost bounded and the other is target reliability bounded. Our proposed algorithm works on a subsystem level redundancy instead of component level redundancy.

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

Real-time estimation of the parameters characterising infectious disease transmission is important for optimization quarantine interventions during outbreaks. One of the most significant parameters is the effective reproduction number - number of secondary cases produced by a single infection. The current study presents an approach for estimating the effective reproduction number and its application to COVID-19 outbreak. The method is based on fitting SIR epidemic model to observation data in a sliding time window and allows to show real-time dynamics of reproduction number at any phase of epidemic for countries globally. Online data on COVID-19 daily cases of infections, recoveries, deaths are used.Finally, time-dependent reproduction number is explored in connection with dynamics of peoples mobility. The method allows to assess the disease transmission potential and understand the effect of interventions on epidemics spread. It also can be easily adapted to future outbreaks of different pathogens. The tool is available online as Python code from the Github repository.

The developments of confirmed daily Sars-CoV-2 infections can be modeled a posteriori in a comparatively simple and satisfactory way by means of a special exponential function: its exponential coefficient varies exponentially with time itself. This property enables the function to directly simulate the „daily case“ curve fragments observed for the first waves of the current epidemics in a number of counties and countries. Linear combinations of two or more of the functions allow for the modeling of the complete curves observed in the vast majority of all regions for which case number developments have been tabulated.

Deep learning (DL) and machine learning (ML) methods have recently contributed to the advancement of models in the various aspects of prediction, planning, and uncertainty analysis of smart cities and urban development. This paper presents the state of the art of DL and ML methods used in this realm. Through a novel taxonomy, the advances in model development and new application domains in urban sustainability and smart cities are presented. Findings reveal that five DL and ML methods have been most applied to address the different aspects of smart cities. These are artificial neural networks; support vector machines; decision trees; ensembles, Bayesians, hybrids, and neuro-fuzzy; and deep learning. It is also disclosed that energy, health, and urban transport are the main domains of smart cities that DL and ML methods contributed in to address their problems.

The electroencephalogram (EEG) is a record of brain activity. Brain Computer Interface (BCI) technology formed by the EEG signal has become one of the hotspots at present. How to extract the feature signal of EEG is the most basic research of BCI technology. In this paper, A new method of recognizing fatigue, conscious, concentrated state of human brain is proposed by the combination of discrete wavelet transform and the neural network based on EEG signal. First of all, the law signal is preprocessed by the wavelet denoising method because the law EEG signal contains a large number of high frequency noise, which is decomposed into multi-layer high frequency signal and low frequency signal. thus, δ wave, θ wave, α wave, β wave are obtained by the wavelet transform. And then, frequency band energy of the different wave is regards as the feature signal of EEG. In the experiment, the feature signal is classified by radial basic function (RBF) and annealed chaotic competitive learning network (ACCLN). RBF and ACCLN networks are trained with 500 sets of sample data and are tested by 100 sets of samples in different mental states. The experimental results show that the average accuracy of RBF network under three conditions are 88.75%, 88.25%, 88.5%, respectively, and the correct rate of ACCLN network is 97%, 98%, 98%, respectively.

In the paper, by virtue of a Lévy–Khintchine representation and an alternative integral representation for the weighted geometric mean, the authors establish a Lévy–Khintchine representation and an alternative integral representation for the Toader–Qi mean. Moreover, the authors also collect an probabilistic interpretation and applications in engineering of the Toader–Qi mean.

In the current age of the Fourth Industrial Revolution ($4IR$ or Industry $4.0$), the digital world has a wealth of data, such as Internet of Things (IoT) data, cybersecurity data, mobile data, business data, social media data, health data, etc. To intelligently analyze these data and develop the corresponding real-world applications, the knowledge of artificial intelligence (AI), particularly, machine learning (ML) is the key. Various types of machine learning algorithms such as supervised, unsupervised, semi-supervised, and reinforcement learning exist in the area. Besides, the deep learning, which is part of a broader family of machine learning methods, can intelligently analyze the data on a large scale. In this paper, we present a comprehensive view on these machine learning algorithms that can be applied to enhance the intelligence and the capabilities of an application. Thus, this study's key contribution is explaining the principles of different machine learning techniques and their applicability in various real-world applications areas, such as cybersecurity, smart cities, healthcare, business, agriculture, and many more. We also highlight the challenges and potential research directions based on our study. Overall, this paper aims to serve as a reference point for not only the application developers but also the decision-makers and researchers in various real-world application areas, particularly from the technical point of view.

This paper presents a review of cloud application architectures and its evolution. It reports observations being made during the course of a research project that tackled the problem to transfer cloud applications between different cloud infrastructures. As a side effect we learned a lot about commonalities and differences from plenty of different cloud applications which might be of value for cloud software engineers and architects. Throughout the course of the research project we analyzed industrial cloud standards, performed systematic mapping studies of cloud-native application related research papers, performed action research activities in cloud engineering projects, modeled a cloud application reference model, and performed software and domain specific language engineering activities. Two major (and sometimes overlooked) trends can be identified. First, cloud computing and its related application architecture evolution can be seen as a steady process to optimize resource utilization in cloud computing. Second, this resource utilization improvements resulted over time in an architectural evolution how cloud applications are being build and deployed. A shift from monolithic servce-oriented architectures (SOA), via independently deployable microservices towards so called serverless architectures is observable. Especially serverless architectures are more decentralized and distributed, and make more intentional use of independently provided services. In other words, a decentralizing trend in cloud application architectures is observable that emphasizes decentralized architectures known from former peer-to-peer based approaches. That is astonishing because with the rise of cloud computing (and its centralized service provisioning concept) the research interest in peer-to-peer based approaches (and its decentralizing philosophy) decreased. But this seems to change. Cloud computing could head into future of more decentralized and more meshed services.

The philosophy of testing statistical hypothesis is a natural consequence and functional extension of mathematical analysis of Probability. Along with the concept of recurrence when applied to random sequences and functions, it leads to the analysis of a priori and posterior which implies testing statistical hypothesis. Testing statistical hypothesis also involves algebraic, functional and dimensional considerations, which are found in the works of Laplace. Aspects of mathematical analysis such as universality of solutions, Laws of Large Numbers, Entropy, Information, and various functional dependencies are the main factors explained in the five properties that lead to implication of testing statistical hypothesis. Various interesting examples with modern scientific significance from genetics, astrophysics, and other areas give methodological access to answers of different problems and phenomena which are involved in the logic of testing statistical hypothesis.

Background: Previous papers have developed a statistical mechanics of neocortical interactions (SMNI) fit to short-term memory and EEG data. Adaptive Simulated Annealing (ASA) has been developed to perform fits to such nonlinear stochastic systems. An N-dimensional path-integral algorithm for quantum systems, qPATHINT, has been developed from classical PATHINT. Both fold short-time propagators (distributions or wave functions) over long times. Previous papers applied qPATHINT to two systems, in neocortical interactions and financial options. Objective: In this paper the quantum path-integral for Calcium ions is used to derive a closed-form analytic solution at arbitrary time that is used to calculate interactions with classical-physics SMNI interactions among scales. Using fits of this SMNI model to EEG data, including these effects, will help determine if this is a reasonable approach. Method: Methods of mathematical-physics for optimization and for path integrals in classical and quantum spaces are used for this project. Studies using supercomputer resources tested various dimensions for their scaling limits. In this paper the quantum path-integral is used to derive a closed-form analytic solution at arbitrary time that is used to calculate interactions with classical-physics SMNI interactions among scales. Results: The mathematical-physics and computer parts of the study are successful, in that there is modest improvement of cost/objective functions used to fit EEG data using these models. Conclusions: This project points to directions for more detailed calculations using more EEG data and qPATHINT at each time slice to propagate quantum calcium waves, synchronized with PATHINT propagation of classical SMNI.

In this paper, our goal is to perform a virtual restoration of an ancient coin from its image. The present work is the first one to propose this problem, and it is motivated by two key promising applications. The first of these emerges from the recently recognised dependence of automatic image based coin type matching on the condition of the imaged coins; the algorithm introduced herein could be used as a pre-processing step, aimed at overcoming the aforementioned weakness. The second application concerns the utility both to professional and hobby numismatists of being able to visualise and study an ancient coin in a state closer to its original (minted) appearance. To address the conceptual problem at hand, we introduce a framework which comprises a deep learning based method using Generative Adversarial Networks, capable of learning the range of appearance variation of different semantic elements artistically depicted on coins, and a complementary algorithm used to collect, correctly label, and prepare for processing a large numbers of images (here 100,000) of ancient coins needed to facilitate the training of the aforementioned learning method. Empirical evaluation performed on a withheld subset of the data demonstrates extremely promising performance of the proposed methodology and shows that our algorithm correctly learns the spectra of appearance variation across different semantic elements, and despite the enormous variability present reconstructs the missing (damaged) detail while matching the surrounding semantic content and artistic style.

The paper presents a study of two novel visual motion onset stimulus-based brain–computer interfaces (vmoBCI). Two settings are compared with afferent and efferent to a computer screen center motion patterns. Online vmoBCI experiments are conducted in an oddball event–related potential (ERP) paradigm allowing for “aha–responses” decoding in EEG brainwaves. A subsequent stepwise linear discriminant analysis classification (swLDA) classification accuracy comparison is discussed based on two inter–stimulus–interval (ISI) settings of 700 and 150 ms in two online vmoBCI applications with six and eight command settings. A research hypothesis of classification accuracy non–significant differences with various ISIs is confirmed based on the two settings of 700 ms and 150 ms, as well as with various numbers of ERP response averaging scenarios.The efferent in respect to display center visual motion patterns allowed for a faster interfacing and thus they are recommended as more suitable for the no–eye–movements requiring visual BCIs.

In this paper, we study the well-posedness and asymptotics of a one-dimensional thermoelastic laminated beam system either with or without structural damping, where the heat conduction is given by Fourier's law effective in the rotation angle displacements. We show that the system is well-posed by using Lumer-Philips theorem, and prove that the system is exponentially stable if and only if the wave speeds are equal, by using the perturbed energy method and Gearhart-Herbst-Prüss-Huang theorem. Furthermore, we show that the system with structural damping is polynomially stable provided that the wave speeds are not equal, by using the second-order energy method.

In this paper, we establish the generalized Qi-type inequality involving conformable fractional integrals. The results presented here would provide extensions of those given in earlier works.

In research applications across several areas, noise removal is indispensable for accuracy of final results. Noise is caused due to physical principals, such as background electronic noise, quantum effect, and wave rebound effect to name a few. Noise removal can help improve results in medical, astronomy, defense, and numerous other fields. Addressing this limitation would result in potentially low cost, automatic, and reliable systems. In this paper, a generalized new approach i.e. Multi-Frame Noise Removal (MFNR) is proposed for noise removal. Given any type of data, the probability density function (PDF) of the noise can be determined. Herein, we extracted the noise PDF parameters using KDE (Kernel Density Estimation). Because the data is corrupted by “deterministic” noise, hence can be cleaned. This could be used as a general purpose noise removal tool. The data point with same position in multiple frames helps us determine the noise PDF characteristics and hence making it possible to remove noise. The conventional wisdom which states that noise removal and detail preservation are contrary to each other is not true for MFNR. Experimental results validate our proposed method which showed practically complete noise reduction based on number of frames used, as compared to existing benchmark methods.

Using insights from cybernetics and an information-based understanding of biological systems, a precise, scientifically inspired, definition of free-will is offered and the essential requirements for an agent to possess it in principle are set out. These are: a) there must be a self to self-determine; b) there must be a non-zero probability of more than one option being enacted; c) there must be an internal means of choosing among options (which is not merely random, since randomness is not a choice). For (a) to be fulfilled, the agent of self-determination must be organisationally closed (a `Kantian whole'). For (c) to be fulfilled: d) options must be generated from an internal model of the self which can calculate future states contingent on possible responses; e) choosing among these options requires their evaluation using an internally generated goal defined on an objective function representing the overall `master function' of the agent and f) for `deep free-will', at least two nested levels of choice and goal (d-e) must be enacted by the agent. The agent must also be able to enact its choice in physical reality. The only systems known to meet all these criteria are living organisms, not just humans, but a wide range of organisms. The main impediment to free-will in present-day artificial robots, is their lack of being a Kantian whole. Consciousness does not seem to be a requirement and the minimum complexity for a free-will system may be quite low and include relatively simple life-forms that are at least able to learn.

This article develops duality principles and numerical results for a large class of non-convex variational models. The main results are based on fundamental tools of convex analysis, duality theory and calculus of variations. More specifically the approach is established for a class of non-convex functionals similar as those found in some models in phase transition. Finally, in the last section we present a concerning numerical example and the respective software.

The most significant assumptions in the subdomain technique (i.e., based on the formal resolution of Maxwell's equations applied in subdomain) is defined by: “The iron parts (i.e., the teeth and the back-iron) are considered to be infinitely permeable so that the saturation effect is neglected”. In this paper, the author presents a new scientific contribution on improving of this method in two-dimensional (2-D) and in Cartesian coordinates by focusing on the consideration of iron. The subdomains connection is carried out in the two directions (i.e., x- and y-edges). For example, the improvement was performed by solving magnetostatic Maxwell's equations for an air- or iron-cored coil supplied by a direct current. To evaluate the efficacy of the proposed technique, the magnetic flux density distributions have been compared with those obtained by the 2-D finite-element analysis (FEA). The semi-analytical results are in quite satisfying agreement with those obtained by the 2-D FEA, considering both amplitude and waveform.

This article presents a dataset of tweets in the Urdu language. There are 1,140,824 tweets in the dataset, collected from Twitter for September and October 2020. This large-scale corpus of tweets is generated by performing pre-processing which includes removing columns containing user information, retweet’s count, followers information, duplicate tweets, removing unnecessary punctuation, links, symbols, and spaces, and finally extracting emojis if present in the tweet text. In the final dataset each tweet record contains columns for tweet id, text, and emoji extracted from the text with a sentiment score. Emojis are extracted to validate Machine Learning models used for the multilingual sentiment and behavior analysis. These are extracted using a Python script that searches for an emoji from the list of 751 most frequently used emojis. If an emoji is present in the text, a column with the emoji description and sentiment score is added.

In this short paper we study some properties of the lines associated with van Aubel’s theorem in the special case when squares are replaced with equilateral triangles constructed on the sides of an arbitrary quadrilateral.

In this article we compute many topological indices for the family of Möbius ladder. At first we give general closed form of M-polynomial of this family and recover many degree based topological indices out of it. We also compute Zagreb indices and Zagreb polynomials of this family.

Predicting the outcome of a future game between two National Basketball Association (NBA) teams poses a challenging problem of interest to statistical scientists as well as the general public. In this article, we formalize the problem of predicting the game results as a classification problem and apply the principle of maximum entropy to construct NBA maximum entropy (NBAME) model that fits to discrete statistics for NBA games, and then predict the outcomes of NBA playoffs by the NBAME model. The best NBAME model is able to correctly predict the winning team 74.4 percent of the time as compared to some other machine learning algorithms which is correct 69.3 percent of the time.

This article focuses on obtaining the analytical solutions for parabolic Volterra integro- differential equations in d-dimensional with different types frictional memory kernel. Based on theories of Laplace transform, Fourier transform, the properties of Fox-H function and convolution theorem, analytical solutions of the equations in the infinite domain are derived under three frictional memory kernel functions respectively. The analytical solutions are expressed by infinite series, the generalized multi-parameter Mittag-Leffler function, Fox-H function and convolution form of Fourier transform. In addition, the graphical representations of the analytical solution under different parameters are given for one-dimensional parabolic Volterra integro-differential equation with power-law memory kernel. It can be seen that the solution curves subject to Gaussian decay at any given moment.

In recent times, with the increase of Artificial Neural Network (ANN), deep learning has brought a dramatic twist in the field of machine learning by making it more Artificial Intelligence (AI). Deep learning is used remarkably used in vast ranges of fields because of its diverse range of applications such as surveillance, health, medicine, sports, robotics, drones etc. In deep learning, Convolutional Neural Network (CNN) is at the center of spectacular advances that mixes Artificial Neural Network (ANN) and up to date deep learning strategies. It has been used broadly in pattern recognition, sentence classification, speech recognition, face recognition, text categorization, document analysis, scene, and handwritten digit recognition. The goal of this paper is to observe the variation of accuracies of CNN to classify handwritten digits using various numbers of hidden layer and epochs and to make the comparison between the accuracies. For this performance evaluation of CNN, we performed our experiment using Modified National Institute of Standards and Technology (MNIST) dataset. Further, the network is trained using stochastic gradient descent and the backpropagation algorithm.

We propose an approach for estimating the error in depth data provided by generic 3D sensors, which are modern devices capable of generating an image (RGB data) and a depth map (distance) or other similar 2.5D structure (e.g. stereo disparity) of the scene. Our approach starts capturing images of a checkerboard pattern devised for the method. Then proceed with the construction of a dense depth map using functions that generally comes with the device SDK (based on disparity or depth). The 2D processing of RGB data is performed next to find the checkerboard corners. Clouds of corner points are finally created (in 3D), over which an RMS error estimation is computed. We come up with a multi-platform system and its verification and evaluation has been done, using the development kit of the board nVIDIA Jetson TK1 with the MS Kinects v1/v2 and the Stereolabs ZED camera. So the main contribution is the error determination procedure that does not need any data set or benchmark, thus relying only on data acquired on-the-fly. With a simple checkerboard, our approach is able to determine the error for any device. Envisioned application is on 3D reconstruction for robotic vision, with a series of 3D vision sensors embarked in robots (UAV of type quadcopter and terrestrial robots) for high-precision map construction, which can be used for sensing and monitoring.

In pattern recognition domain, deep architectures are widely used nowadays and they have achieved fine grades. However, these deep architectures need special demands, especially big datasets and GPU. Aiming to gain better grades without deep networks, we propose a simplified algorithm framework using fusion features extracted from the salient areas of faces. Furthermore, the proposed algorithm has achieved a better result than some deep architectures. For extracting more effective features, this paper firstly defines the salient areas on the faces. This paper normalizes the salient areas of the same location in the faces to the same size, therefore it can gain more similar features from different subjects. LBP and HOG features are extracted from the salient areas, fusion features’ dimensions are reduced by Principal Component Analysis( PCA) and we apply softmax to classify the six basic expressions at once. This paper proposes a salient areas definitude method which uses peak expressions frames to compare with their neutral faces. This paper also proposes and applies the idea of normalizing the salient areas to align the specific areas which express the different expressions. This makes the salient areas found from different subjects have the same size. Besides, gamma correction method is firstly applied on LBP features in our algorithm framework which improves our recognition rates significantly. By applying this algorithm framework, our research has gained state-of-the-art performances on CK+ database and JAFFE database.

During the last years some new variants of Permutation entropy have been introduced and applied to EEG analysis, among them a conditional variant and variants using some additional metric information or being based on entropies different from the Shannon entropy. In some situations it is not completely clear what kind of information the new measures and their algorithmic implementations provide. We discuss the new developments and illustrate them for EEG data.

In this paper, we study the problem of controllability of impulsive neutral evolution integrodifferential equations with state dependent delay in Banach spaces. The main results are completely new and are obtained by using Sadovskii's fixed point theorem, theory of resolvent operators, and an abstract phase space. An example is given to illustrate the theory.

IoT is a new communication paradigm that gains a very high importance in the past few years. This communication paradigm supports various heterogeneous applications in many fields and with the dramatic increase of the number of sensor devices, it becomes a demand. Designing IoT networks faces many challenges that include security, massive traffic, high availability, high reliability and energy constraints. Thus, new communication technologies and paradigms should be deployed for IoT networks to overcome these challenges and achieve high system performance. Distributed computing techniques (e.g. fog and MEC), software defined networking (SDN), network virtualization and blockchain are common recent paradigms that should be deployed for IoT networks, either combined or individually, to achieve the main requirements of the IoT networks at a high system performance. Fog computing is a form of edge computing that has been developed to provide the computing capabilities (e.g. storage and processing) at the edge of the access network. Employing Fog computing in IoT networks, as an intermediate layer between IoT devices and the remote cloud, becomes a demand to make use of the edge computing benefits. In this work, we provide a framework for the IoT system structure that employs an edge computing layer of Fog nodes controlled and managed by SDN network with the blockchain technology to achieve a high level of security for latency sensitive IoT applications. The proposed system employs SDN network with distributed controllers and distributed OpenFlow switches; these switches are enabled with limited computing and processing capabilities. Furthermore, a data offloading algorithm is developed to allocate different processing and computing tasks to the distributed OpenFlow switches with available resources. Moreover, a traffic model is proposed to model and analyze the traffic among different parts of the network. The proposed work achieves various benefits to the IoT network, such as the latency reduction, security improvement and high efficiency of resources utilization. The proposed algorithm is simulated and also the proposed system is experimentally tested over a developed testbed to validate the proposed structure. Experimental results show that the proposed system achieves higher efficiency in terms of latency, security and resource utilization.

Euler’s product formula over the primes and Euler’s zeta function equate to enshrine the Fundamental Theorem of Arithmetic that every integer > 1 is the product of a unique set of primes. The product formula has no zero, and with a domain ≤1 Euler’s zeta diverges. Dirichlet’s eta function η(s), negates alternate terms of zeta, permitting convergence when s∈C and Re(s) < 1, and its non-trivial zeros {ρ}, have a deep relationship with the distribution of the primes. The Riemann Hypothesis is that all the non-trivial zeros have Re(ρ) = 1/2. This work examines the symmetries in a partial Euler’s zeta series with a complex domain equating it to the difference between two finite vector series whose matched terms have mirror-image arguments, but whose magnitudes differ when Re(s) ≠ 1/2. Analytical continuation generates a modified eta series η_l(s), in which every l^th term is multiplied by (1-l). If the integer l is appropriately determined by the Im(s), similar paired finite vector series have a difference that closely follows η_l (s) and their terminal vectors intersect in a unique way permitting zeros only when Re(s) = 1/2. Furthermore, those vectors tracking the derivatives of the series, have a special relationship permitting zeros of the differential only when Re(s) > 1/2.

The dark proteome as we define it, is the part of the proteome where 3D structure has not been observed either by homology modeling or by experimental characterization in the protein universe. From the 550.116 proteins available in Swiss-Prot (as of July 2016) 43.2% of the Eukarya universe and 49.2% of the Virus universe are part of the dark proteome. In Bacteria and Archaea, the percentage of the dark proteome presence is significantly less, with 12.6% and 13.3% respectively. In this work, we present the map of the dark proteome in Human and in other model organisms. The most significant result is that around 40%- 50% of the proteome of these organisms are still in the dark, where the higher percentages belong to higher eukaryotes (mouse and human organisms). Due to the amount of darkness present in the human organism being more than 50%, deeper studies were made, including the identification of ‘dark’ genes that are responsible for the production of the so-called dark proteins, as well as, the identification of the ‘dark’ organs where dark proteins are over represented, namely heart, cervical mucosa and natural killer cells. This is a step forward in the direction of the human dark proteome.

In this paper, some convexity properties and some inequalities for the (p,k)-analogue of the Gamma function, Г_p,k(x) are given. In particular, a (p,k)-analogue of the celebrated Bohr-Mollerup theorem is given. Furthermore, a (p,k)-analogue of the Riemann zeta function, ζ_p,k(x) is introduced and some associated inequalities are derived. The established results provide the (p,k)-generalizations of some known results concerning the classical Gamma function.

Conditions under which compositions of component systems form a well-defined system-of-systems here are formulated at a fundamental level. Statement of what defines a well-defined composition and sufficient conditions guaranteeing such a result offers insight into exemplars that can be found in special cases such as differential equation and discrete event systems. For any given global state of a composition, two requirements can be stated informally as: 1) the system can leave this state, i.e., there is at least one trajectory defined that starts from the state, and 2) the trajectory evolves over time without getting stuck at a point in time. Considered for every global state, these conditions determine whether the resultant is a well-defined system and if so, whether it is non-deterministic or deterministic. We formulate these questions within the framework of iterative specifications for mathematical system models that are shown to be behaviorally equivalent to the Discrete Event System Specification (DEVS) formalism. This formalization supports definitions and proofs of the afore-mentioned conditions. Implications are drawn at the fundamental level of existence where the emergence of a system from an assemblage of components can be characterized. We focus on systems with feedback coupling where existence and uniqueness of solutions is problematic.

Large datasets that enable researchers to perform investigations with unprecedented rigor are growing increasingly common in neuroimaging. Due to the simultaneous increasing popularity of open science, these state-of-the-art datasets are more accessible than ever to researchers around the world. While analysis of these samples has pushed the field forward, they pose a new set of challenges that might cause difficulties for novice users. Here, we offer practical tips for working with large datasets from the end-user’s perspective. We cover all aspects of the data life cycle: from what to consider when downloading and storing the data, to tips on how to become acquainted with a dataset one did not collect, to what to share when communicating results. This manuscript serves as a practical guide one can use when working with large neuroimaging datasets, thus dissolving barriers to scientific discovery.

In the note, the authors find several simple and explicit forms for a family of inhomogeneous linear ordinary differential equations studied in "D. Lim, Differential equations for Daehee polynomials and their applications, J. Nonlinear Sci. Appl. 10 (2017), no. 4, 1303-1315; Available online at http://dx.doi.org/10.22436/jnsa.010.04.02".

In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.

This paper formulates the performance evaluation of cloud services as a multicriteria group decision making problem, and presents a fuzzy multicriteria group decision making method for evaluating the performance of cloud services. Interval-valued intuitionistic fuzzy numbers are used to model the inherent subjectiveness and imprecision of the performance evaluation process. An effective algorithm is developed based on the technique for order preference by similarity to ideal solution method and the Choquet integral operator for adequately solving the performance evaluation problem. An example is presented to demonstrate the applicability of the proposed fuzzy multicriteria group decision making method for solving the multicriteria group decision making problem in real world situations.

In the paper, the authors establish two identities, which can be regarded as nonlinear differential equations, for the generating function of Eulerian polynomials, find two identities for the Stirling numbers of the second kind, and present two identities for Eulerian polynomials and higher order Eulerian polynomials, pose two open problems about summability of two finite sums involving the Stirling numbers of the second kind. Some of these conclusions meaningfully and significantly simplify several known results.

DevOps is an emerging practice to be followed in the Software Development life cycle. The name DevOps indicates that it’s an integration of the Development and Operation team. It is followed to integrate the various stages of the development cycle. DevOps is an extended version of the existing Agile method. DevOps aims at continuous integration, Continuous Delivery, Continuous Improvement, faster feedback and security. This paper reviews the building blocks of DevOps, challenges in adopting DevOps, Models to improve DevOps practices and Future works on DevOps

Modern companies accumulate a vast amount of customer data that can be used for creating a personalized experience. Analyzing this data is difficult and most business intelligence tools cannot cope with the volume of the data. One example is churn prediction, where the cost of retaining existing customers is less than acquiring new ones. Several data mining and machine learning approaches can be used, but there is still little information about the different algorithm settings to be used when the dataset doesn't fit into a single computer memory. Because of the difficulties of applying feature selection techniques at a large scale, Incremental Probabilistic Component Analysis (IPCA) is proposed as a data preprocessing technique. Also, we present a new approach to large scale churn prediction problems based on the mini-batch Stochastic Gradient Decent (SGD) algorithm. Compared to other techniques, the new method facilitates training with large data volumes using a small memory footprint while achieving good prediction results.

The rising popularity of virtual reality has seen a recent push in applications, such as, social media, educational tools, medical simulations, entertainment and training systems. With virtual realitythe ability to engage users for specific purposes, provides opportunities to entertain, develop cognitive abilities and technical skills outside of the standard mediums (e.g., the television or theclassroom) thereby optimizing exposure with realistic (live) opportunities. However, before these applications of virtual reality become more widespread, there are a number of open questions andissues that must be addressed including limitations, challenges, relationships between fidelity, multi-modal cue interaction, immersion, and knowledge transfer and retention. In this article, we begin with a brief overview of virtual reality methods, followed by a discussion of virtual reality and its applications (both historically, currently and in the future). We review virtual reality trends both from the early artistic days through to current day state of the art technological advancements. We explore emerging and futuristic breakthroughs - and their applications in virtual reality - showing how virtual reality will go way beyond anything we could envision. Infact, after reading this article, we hope the reader will agree, that virtual reality, is possibly one of the most powerful mediums of our time. While the earliest mechanistic virtual reality prototypes (e.g., Sensorama) allowed us to view stereoscopic 3D images accompanied by stereosound, smells, as well as wind effect - set the foundation and direction for future pioneers - there have been spearheaded developments which have continually pushed the concept of virtual reality to new domains. As virtual reality evolves, many new and yet-to-be-imagined applications will arise, but we must have understanding and patience as we wait for science, research andtechnology to mature and improve. The article ends with a short overview of future directions based upon recent breakthroughs in research and what this will mean for virtual reality in the coming years.

Recently, many authors have been interested to introduce fuzzy implications over t-norms and t-conorms. In this paper, we introduce (S,N) and residuum fuzzy implication for Dubois t-norm and Hamacher's t-norm. Also, new concepts so-called (T,N) and residual fuzzy co-implication in dual Heyting Algebra are investigated. Some examples as well as application are discussed as well.

In this paper, we have established Hermite-Hadamard inequalities for r-preinvex functions via fractional integrals.

Blockchain technology has become one of the most popular technologies for maintaining digital transactions. From the foundation of Bitcoin to the now predominant smart contract, blockchain technology promises to induce a shift in thought about digital transactions in many fields, such as energy, healthcare, Internet of Things, cybersecurity, financial services and the supply chain. Despite blockchain technology offers many cryptography advantages such as immutability, digital signature and hashing; it has suffered from several critical cybersecurity threats and vulnerabilities. In this paper, we build upon the previous studies on vulnerabilities and investigates over 60 real cybersecurity incidents that have been happening on the blockchain networks between 2009 and 2019. We categorise those incidents against the key cybersecurity vulnerabilities in blockchain technologies; and have developed a taxonomy that captures five types of cybersecurity threats and vulnerabilities based on five main players in blockchain. The outcome of this research prompted concerns and research direction in developing countermeasures to alleviate these risks.

In this paper, we consider the development of algorithms for the solution of first order initial value problems whose solution exhibits exponential behaviour. Method of interpolation and collocation of basis function to give system of nonlinear equations which is solved for the unknown parameters to give a continuous scheme. The discrete methods recovered from the continuous scheme are implemented in block form. The stability properties of the method is verified and numerical experiments show that our method is efficient in handling these problems

In a recent paper, Sarikaya et al. introduced a new analogue of the classical Gamma function which they called, the conformable Gamma function. Motivated by their results, this paper seeks to establish some inequalities for the conformable Gamma and Polygamma functions. Among other analytical tools, the procedure relies on the generalized forms of some classical inequalities.