Ultra-wideband wavelength division multiplexed networks enable operators to use more effectively the bandwidth offered by a single fiber pair and thus make significant savings, both in operational and capital expenditures. The main objective of this study is to minimize optical node resources, such as transponders, multiplexers and wavelength selective switches, needed to provide and maintain high quality of network services, in ultra-wideband wavelength division multiplexed networks, at low cost. A model based on integer programming is proposed, which includes a detailed description of optical network nodal resources. The developed optimization tools are used to study the ultra-wideband wavelength division multiplexed network performance when compared with the traditional C-band wavelength division multiplexed networks. The analysis is carried out for realistic networks of different dimensions and traffic demand sets.

In this work, some operator trace inequalities are proved. An extension of Klein's inequality for all Hermitian matrices is proved. A non-commutative version (or Hansen-Pedersen version) of the Jensen trace inequality is provided as well. A generalization of the result for any positive Hilbert space operators acts on a positive unital linear map is established.

Smart Grid systems have become popular and necessary for the development of a sustainable power grid. These systems use different technologies to provide optimized services to the users of the network. Regarding computing, these systems optimize electrical services by processing a large amount of data generated. However, privacy and security are essential in this kind of system. With a large amount of data generated, it is necessary to protect the privacy of users, because this data may reveal users’ personal information. Today, blockchain technology has proven to be an efficient architecture for solving privacy and security problems in different scenarios. Over the years, different blockchain platforms have emerged, attempting to solve specific problems in different areas. However, the use of different platforms fragmented the market, which was no different in the smart grid scenario. This work proposes a blockchain architecture that uses sidechains to make the system scalable and adaptable. We used three blockchains to ensure privacy, security, and trust in the system. To universalize the proposed solution, we used the OSGP protocol and smart contracts. The results show that architecture security and privacy are guaranteed, making it feasible for implementation in real systems. Although scalability issues regarding the storage of data generated still exists.

Drawing inspiration from a recent construction of a polyhedral structure associated with an icosahedrally-symmetric map on the Riemann sphere, the article shows how to build such "dynamical polyhedra" for other icosahedral maps. First, icosahedral algebra is used to determine a special family of maps with 60 periodic critical points. The topological behavior of each map is worked out and results in a geometric algorithm that constructs a system of edges---the dynamical polyhedron---in natural correspondence to a map's topology. It turns out that the maps' descriptions fall into classes the presentation of which concludes the paper.

The properties of iterative splitting methods with serial versions have been analyzed since recent years, see [1] and [3]. We extend the iterative splitting methods to a class of parallel versions, which allow to reduce the computational time and keep the benet of the higher accuracy with each iterative step. Parallel splitting methods are nowadays important to solve large problems, which can be splitted in subproblems and computed independently with the dierent processors. We present a novel parallel iterative splitting method, which is based on the multi-splitting methods, see [2], [10] and [15]. Such a exibilisation with multisplitting methods allow to decompose large iterative splitting methods and recover the benet of their underlying waveform-relaxation (WR) methods. We discuss the convergence results of the parallel iterative splitting methods, while we could reformulate such an error to a summation of the individual WR methods. We discuss the numerical convergence of the serial and parallel iterative splitting methods and present dierent numerical applications to validate the benet of the parallel versions.

We present a numerical illumination model to calculate direct as well as diffuse or Hapke scattered radiation scenarios on arbitrary planetary surfaces. This includes small body surfaces such as main belt asteroids as well as e.g. the lunar surface. The model is based on the raytracing method. This method is not restricted to spherical or ellipsiodal shapes but digital terrain data of arbitrary spatial resolution can be fed into the model. Solar radiation is the source of direct radiation, wavelength-dependent effects (e.g. albedo) can be accounted for. Mutual illumination of individual bodies in implemented (e.g. in binary or multiple systems) as well as self-illumination (e.g. crater floors by crater walls) by diffuse or Hapke radiation. The model is validated by statistical methods. A χ2 test is undertaken to compare simnulated images with DAWN images acquired during the survey phase at small body 4 Vesta.

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

A pixel-based segmentation method was demonstrated to be confounded by developmental stage in estimation of flowering of mango. Categorization of panicles into three developmental stages was undertaken with a single and a two-stage deep learning framework (YOLO and R2CNN), using either upright or rotated bounding boxes. For a validation image set and for total panicle count, the models MangoYOLO(-upright), MangoYOLO-rotated, YOLOv3-rotated, R2CNN(-rotated) and R2CNN-upright achieved: (i) RMSEs of 25.6, 16.0, 15.4, 25.8 and 32.3 panicles per tree image, (ii) Mean average precision (mAP) scores of 72.2, 69.1, 65.0, 62.5 and 70.9% and (iii) weighted F1-scores of 76.5, 76.1, 74.9, 74.0 and 82.0, respectively. For a test set of images involving a different orchard and cultivar and use of a different camera, the R2 for machine vision to human count of panicles per tree was 0.86, 0.80, 0.83, 0.81 and 0.76 for the same models, respectively. Thus, models generalised well, but with no consistent benefit from use of rotated over upright bounding boxes. While the YOLOv3-rotated model was superior in terms of total panicle count, the R2CNN-upright model was more accurate for panicle stage classification. To demonstrate practical application, panicle counts were made weekly for an orchard of 994 trees, with a peak detection routine applied to document multiple flowering events.

Supplier selection is an important part of supply chain management (SCM) for any organisation to achieve their objectives. The problem has attracted great interest from academics and practitioners. The selection process starts with determining the most important criteria out of a wide range. Many academic researchers apply multi-criteria decision-making (MCDM) techniques for supplier selection. However, the complexity of such approaches may increase significantly, especially when considering a large number of suppliers and selection criteria. This paper proposes an integrated approach combining machine learning classification with the Analytic Hierarchy Process (AHP) to select and evaluate the most suitable supplier. A Decision Tree (DT) classifier is used to select the most important criteria, instead of applying AHP on the complete set of criteria. The applicability of the approach is demonstrated using data from Libyan companies. Results show that decision trees can successfully lead to a most important subset of selection criteria, which would lead to a less complex application of AHP.

The loss of integrity and adverse effect on mechanical properties can be concluded as attributing miro/macro-mechanics damage in structures, especially in composite structures. Damage as a progressive degradation of material continuity in engineering predictions for any aspects of initiation and propagation requires to be identified by a trustworthy mechanism to guarantee the safety of structures. Besides the materials design, structural integrity and health are usually prone to be monitored clearly. One of the most powerful methods for the detection of damage is machine learning (ML). This paper presents the state of the art of ML methods and their applications in structural damage and prediction. Popular ML methods are identified and the performance and future trends are discussed.

The sensor nodes have limited computation, sensing, communication capabilities and generally operated by batteries in a harsh atmosphere with non-replenish able power sources. These limitations force the sensor network subject to failure because most of the energy is spent on sensing, computing and data transmission. This paper introduces an Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) to assist Wireless Sensor Networks (WSNs) by (a) extending the lifespan of the network (b) effectively using the battery power (c) decreasing the network overhead and (d) ensuring a high packet transmission ratio with minimal delay. The delay time-based Cluster Head (CH) is elected based on the node degree, residual energy and Received Signal Strength (RSS) to accomplish the goal. Additionally, the RSS-based network partitioning is implemented to evaluate the gradient based on demand routing between source (sensing node) and destination (BS). Whenever the current CH residual energy goes under the threshold level, the proposed protocol performs the clustering process, reducing the exchange of control packets. However, the BS periodically gathers the data from every single CH which helps to reduce the collision and Medium Access Control (MAC) layer conflict. From the simulation results, it is the evident that the proposed protocol performance in terms of average end-to-end latency, packet delivery ratio, average energy consumption and control overhead is better than the well-known current protocols.

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

Interpolation is procedure that depends on spatial and/or statistical properties of analysed variable(s). It is special challenging task for data that included low number of samples, like dataset with less than 20 data. This problem is especially emphasized in the subsurface geological mapping, i.e. in the cases where data are taken solely from wells. Successful solutions of such mapping problems ask for knowledge about interpolation methods designed primarily for small datasets and dataset itself. Here are compared two methods, namely Inverse Distance Weighting and Modified Shepard’s Method, applied for three variables (porosity, permeability, thickness) measured in the Neogene sandstone hydrocarbon reservoirs (Northern Croatia). The results showed that pure cross-validation is not enough condition for appropriate map selection, but also geometrical features need to be considered, for datasets with less than 20 points.

The success of a software system is highly dependent upon its quality which is a very critical aspect and is the ultimate goal to be achieved. Defect Management is the most important process in ensuring software quality, it involves defect detection, defect categorization, defect prioritization, defect removal and defect verification. The main purpose of this process is to develop and produce defect free or least defected software systems of high quality. It plays a vital role in gaining customer confidence and satisfaction which is essential for the reputation of the organization developing the system. The central objective of this study is to explain the importance of defect management and its impact on the quality of the software along with various defect management techniques to support the objective.

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

Nodes in wireless sensor networks (WSN) are characterized particularly by their limited power and memory capabilities. Limited memory is an important parameter as it defines the size of the operating system and the processing code. As established previously, energy and memory efficiency is the most important evaluation factors of WSNs as they are directly related to data loss and network lifetime. However, based on our simulation results, memory efficiency determines the selection or abandon of nodes by the botmaster for the propagation of bots in an IoT infrastructure. Consequently, the node’s memory efficiency determined the spread of bots in the network and provides defense actors with an insight of the botmaster behavior for mitigation of the attack. Conventional botnet propagation and mitigation models did not consider the impact of node’s memory efficiency in the IoT platform. To address this gap, we build IoT-SIEF, a novel propagation model with forensic capability that will analyze command and control propagation behavior based on the perspective of the node’s memory efficiency. IoT-SIEF model used to explore the dynamics of propagation using numerical simulation with more than 50% outperform other models in mitigating the number of secondary bots. Consequently, it can serve as a basis for assisting the planning, design, and defense of such networks from the investigator's point of view.

In this work, some numerical radius inequalities based on the recent Dragomir extension of Furuta's inequality are obtained. Some particular cases are also provided.

This paper introduces a fusion convolutional architecture for efficient learning of spatio-temporal features in video action recognition. Unlike 2D CNNs, 3D CNNs can be applied directly on consecutive frames to extract spatio-temporal features. The aim of this work is to fuse the convolution layers from 2D and 3D CNNs to allow temporal encoding with fewer parameters than 3D CNNs. We adopt transfer learning from pre-trained 2D CNNs for spatial extraction, followed by temporal encoding, before connecting to 3D convolution layers at the top of the architecture. We construct our fusion architecture, semi-CNN, based on three popular models: VGG-16, ResNets and DenseNets, and compare the performance with their corresponding 3D models. Our empirical results evaluated on the action recognition dataset UCF-101 demonstrate that our fusion of 1D, 2D and 3D convolutions outperforms its 3D model of the same depth, with fewer parameters and reduces overfitting. Our semi-CNN architecture achieved an average of 16 – 30% boost in the top-1 accuracy when evaluated on an input video of 16 frames.

Mobile Cloud Computing(MCC) is a recent technology used by various users worldwide. In 2015, more than 240 million users used mobile cloud computing which gives a profit of $5.2 billion to service providers. MCC is a combination of Mobile computing and cloud computing. By the combination of these two, it gives various challenges like network access, elasticity, management, availability, security, privacy, etc. Here security issues are considered because both the security issues of mobile computing and cloud computing are considered as important like data security, virtualization security, partitioning security, Mobile cloud application security, Mobile device security. This paper gives a detailed study of security issues in mobile cloud computing and its prevention measures.

Statistical inferences is regarded as the general criteria for statistical conclusion and drawing generalizations. However, most of the inferential statistical tools are based on strong assumptions which create a strict limitations on their use and application. Analysis of variance (ANOVA) is one of such statistics. In this article, eight (8) new ANOVA-like methodologies were proposed, in alternative to one-way ANOVA, based on the assumptions of statistical mirroring. Methods validation in comparison with one-way ANOVA was designed to assess the suitability and statistical power of the new proposals as an alternative methods, using different sets of logically generated multivariate datasets with different problems and statistical complications. The results of comparisons validate that the eight (8) proposed ANOVA-like methodologies were suitable alternatives to ANOVA, in the sense that they require no normality assumption to be meet, used different ways to compare the data with different statistical elements rather than depending on only variance, efficient with negative values, and results interpretation is easier.

Sequence alignment and comparison through pairwise, multiple, global and local techniques are the main principles that underpin comparative genomics. However, most of the algorithms used are alignment-based which imposed some limitations on their use and application. In an attempt to provide an alignment-free alternative approaches, a methodology of comparative optinalysis and statistical mirroring was used and adopted to provide a suitable alternative for multiple genomic sequence comparison. In this article, methods comparison with MUSCLE, MUFFT, Clustal Omega, and T-Coffee was designed to assess the suitability and statistical power of statistical mirroring as an alternative method for multiple genomic sequences comparison using different sets of logically generated biological sequence datasets with different problems and computational complications. The results of the comparisons validate that statistical mirroring is a suitable alignment-free alternative approach for multiple genomic sequence comparison. The applied method (statistical mirroring) distinguishes itself over MUSCLE, MUFFT, Clustal Omega, and T-Coffee in specificity to a position-specific changes, specificity to a base-specific changes, cladogram and phylogenetic linearity, alignment independency, computational simplicity, and limit of input capacity.

In a generalized topological space Tg = (Ω, Tg), ordinary interior and ordinary closure operators intg, clg : P (Ω) −→ P (Ω), respectively, are defined in terms of ordinary sets. In order to let these operators be as general and unified a manner as possible, and so to prove as many generalized forms of some of the most important theorems in generalized topological spaces as possible, thereby attaining desirable and interesting results, the present au- thors have defined the notions of generalized interior and generalized closure operators g-Intg, g-Clg : P (Ω) −→ P (Ω), respectively, in terms of a new class of generalized sets which they studied earlier and studied their essen- tial properties and commutativity. The outstanding result to which the study has led to is: g-Intg : P (Ω) −→ P (Ω) is finer (or, larger, stronger) than intg : P (Ω) −→ P (Ω) and g-Clg : P (Ω) −→ P (Ω) is coarser (or, smal ler, weaker) than clg : P (Ω) −→ P (Ω). The elements supporting this fact are reported therein as a source of inspiration for more generalized operations.

In recent years, more and more researchers have gradually paid attention to Hyperspectral Image (HSI) classification. It is significant to implement researches on how to use HSI's sufficient spectral and spatial information to its fullest potential. To capture spectral and spatial features, we propose a Double-Branch Dual-Attention mechanism network (DBDA) for HSI classification in this paper, Two branches aer designed to extract spectral and spatial features separately to reduce the interferences between these two kinds of features. What is more, because distinguishing characteristics exist in the two branches, two types of attention mechanisms are applied in two branches above separately, ensuring to exploit spectral and spatial features more discriminatively. Finally, the extracted features are fused for classification. A series of empirical studies have been conducted on four hyperspectral datasets, and the results show that the proposed method performs better than the state-of-the-art method.

Automation is at the core of modern industry. It aims to increase production rates, decrease production costs, and reduce human intervention in order to avoid human mistakes and time delays during manufacturing. On the other hand, human assistance is usually required to customize products and reconfigure control systems through a special process interface called Human Machine Interface (HMI). Machine Learning (ML) algorithms can effectively be used to resolve this tradeoff between full automation and human assistance. This paper provides an example of the industrial application of ML algorithms to help human operators save their mental effort and avoid time delays and unintended mistakes for the sake of high production rates. Based on real-time sensor measurements, several ML algorithms have been tried to classify paper rolls according to paper grammage in a white paper mill. The performance evaluation shows that the AdaBoost algorithm is the best ML algorithm for this application with classification accuracy (CA), precision, and recall of 97.1%. The generalization of the proposed approach for achieving a cost-effective mill construction by reducing the total number of the required physical sensors will be the subject of our future research.

The work is devoted to the investigation of virus quasispecies evolution and diversification due to mutations, competition for host cells, and cross-reactive immune responses. The model consists of a nonlocal reaction-diffusion equation for the virus density depending on the genotype considered as a continuous variable and on time. This equation contains two integral terms corresponding to the nonlocal effects of virus interaction with host cells and with immune cells. In the model, a virus strain is represented by a localized solution concentrated around some given genotype. Emergence of new strains corresponds to a periodic wave propagating in the space of genotypes. The conditions of appearance of such waves and their dynamics are described.

The latest methods based on deep learning have achieved amazing results regarding the complex work of inpainting large missing areas in an image. This type of method generally attempts to generate one single "optimal" inpainting result, ignoring many other plausible results. However, considering the uncertainty of the inpainting task, one sole result can hardly be regarded as a desired regeneration of the missing area. In view of this weakness, which is related to the design of the previous algorithms, we propose a novel deep generative model equipped with a brand new style extractor which can extract the style noise (a latent vector) from the ground truth image. Once obtained, the extracted style noise and the ground truth image are both input into the generator. We also craft a consistency loss that guides the generated image to approximate the ground truth. Meanwhile, the same extractor captures the style noise from the generated image, which is forced to approach the input noise according to the consistency loss. After iterations, our generator is able to learn the styles corresponding to multiple sets of noise. The proposed model can generate a (sufficiently large) number of inpainting results consistent with the context semantics of the image. Moreover, we check the effectiveness of our model on three databases, i.e., CelebA, Agricultural Disease, and MauFlex. Compared to state-of-the-art inpainting methods, this model is able to offer desirable inpainting results with both a better quality and higher diversity. The code and model will be made available on https://github.com/vivitsai/SEGAN.

Assume that $f:C\rightarrow \mathbb{R}$ is subadditive (superadditive) and hemi-Lebesgue integrable on $C,$ a cone in the linear space $X$ with $0\in C. $ Then for all $x,$ $y\in C$ and a symmetric Lebesgue integrable and nonnegative function $p:\left[ 0,1\right] \rightarrow \lbrack 0,\infty ),$ \begin{align*} \frac{1}{2}f\left( x+y\right) \int_{0}^{1}p\left( t\right) dt& \leq \left( \geq \right) \int_{0}^{1}p\left( t\right) f\left( \left( 1-t\right) x+ty\right) dt \\ & \leq \left( \geq \right) \int_{0}^{1}p\left( t\right) f\left( tx\right) dt+\int_{0}^{1}p\left( t\right) f\left( ty\right) dt. \end{align*} In particular, for $p\equiv 1,$ we have \begin{equation*} \frac{1}{2}f\left( x+y\right) \leq \left( \geq \right) \int_{0}^{1}f\left( \left( 1-t\right) x+ty\right) dt\leq \left( \geq \right) \int_{0}^{1}f\left( tx\right) dt+\int_{0}^{1}f\left( ty\right) dt. \end{equation*} Some particular inequalities related to Jensen's dicrete inequality for convex functions are also given.

This paper addresses the issues of how we can quantify structural information for nonparametric distributions and how we can detect its changes. Structural information refers to an index for a global understanding of a data distribution. When we consider the problem of clustering using a parametric model such as a Gaussian mixture model, the number of mixture components (clusters) can be thought of as structural information in the model. However, there does not exist any notion of structural information for nonparametric modeling of data. In this paper we introduce a novel notion of {\em kernel complexity} (KC) as structural information in the nonparametric setting. The key idea of KC is to combine the information bias inspired by the Gini index with the information quantity measured in terms of the normalized maximum likelihood (NML) code length. We empirically show that KC has a property similar to the number of clusters in a parametric model. We further propose a framework for structural change detection with KC in nonparametric distributions. With synthetic and real data sets we empirically demonstrate that our framework enables us to detect structural changes underlying the data and their early warning signals.

The increasing number of robots around us will soon create a demand for connecting these robots in order to achieve goal-driven teamwork in heterogeneous multi-robot systems. In this paper, we focus on robot teamwork specifically in dynamic environments. While the conceptual modeling of multi-agent teamwork has been studied extensively during the last two decades, related engineering concerns have not received the same degree of attention. Therefore, this paper makes two contributions. The analysis part discusses general design challenges that apply to robot teamwork in dynamic application domains. The constructive part presents a review of existing engineering approaches for challenges that arise with dynamically changing runtime conditions. An exhaustive survey of robot teamwork aspects would be beyond the scope of this paper. Instead, we aim at creating awareness for the manifold dimensions of the design space and highlight state-of-the-art technical solutions for dynamically adaptive teamwork, thus pointing at open research questions that need to be tackled in future work.

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? 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 classes are L and NL. We demonstrate if L is not equal to NL, then P = NP. In addition, we show if L is equal to NL, then P = NP. In this way, we prove the complexity class P is equal to NP.

We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrations on the graph and the resulting complex. The persistent homology computation part of Flagser is based on the program Ripser [2], but is optimised specifically for large computations. The construction of the directed flag complex is done in a way that allows easy parallelisation by arbitrarily many cores. Flagser also has the option of working with undirected graphs. For homology computations Flagser has an Approximate option, which shortens compute time with remarkable accuracy. We demonstrate the power of Flagser by applying it to the construction of the directed flag complex of digital reconstructions of brain microcircuitry by the Blue Brain Project and several other examples. In some instances we perform computation of homology. For a more complete performance analysis, we also apply Flagser to some other data collections. In all cases the hardware used in the computation, the use of memory and the compute time are recorded.

An increase in the use of smartphones has laid to the use of the internet and social media platforms. The most commonly used social media platforms are Twitter, Facebook, WhatsApp and Instagram. People are sharing their personal experiences, reviews, feedbacks on the web. The information which is available on the web is unstructured and enormous. Hence, there is a huge scope of research on understanding the sentiment of the data available on the web. Sentiment Analysis (SA) can be carried out on the reviews, feedbacks, discussions available on the web. There has been extensive research carried out on SA in the English language, but data on the web also contains different other languages which should be analyzed. This paper aims to analyze, review and discuss the approaches, algorithms, challenges faced by the researchers while carrying out the SA on Indigenous languages.

The continuous increase in tuition fees in university education in many countries requires justification by the university authorities through improved learning resources that can guarantee employment opportunities for the students through hands-on industry training. This paper describes the design of curriculum of cloud computing module in collaboration with Amazon Web Services (AWS) Academy to include industry-based practical hands-on labs in the curriculum to improve the employability of Internet of Things (IoT) engineering students. This study introduces industry best practices and hands-on labs in cloud computing and discovered that students’ understanding and learning experience in the subject increase when exposed to real-life applications. The study blends academic theories in cloud computing with their applications as obtained in industry to enable students to have both the theoretical and practical skills that will prepare them for careers in cloud computing. To achieve this, cloud computing lecturers were trained by AWS Academy as a prerequisite to ensure that the tutors themselves acquire hands-on proficiency in cloud computing technologies. The study finds that students tend to be more engaged and learn better when academic theories and concepts are combined with real-world applications as obtained in the industry.

A novel mathematical model is developed to calculate the temperature distribution on the surface and bulk of a steel plate under the laser hardening process. The model starts with the basic heat equation then it is developed into a volumetric form and is connected to the various solid existing phases. The proposed model is based on three influencing parameters of the laser hardening process which are the velocity of the laser spot and irradiation time. The results are compared with the available experimental data reported in the literature. The volumetric model provides an assessment of temperature distribution in both the vertical and horizontal axis. Laser irradiation at sufficiently high fluence can be used to create a solid-state phase change on the surface. Primary calculations show that the temperature profile has a Gaussian distribution in horizontal x and y-axis and presents an exponentially decreasing in the horizontal and vertical depth directions.

The use of machine learning (ML) approaches to target clinical problems is called to revolutionize clinical decision-making. The success of these tools is subjected to the understanding of the intrinsic processes being used during the classical pathway by which clinicians make decisions. In a parallelism with this pathway, ML can have an impact at four levels: for data acquisition, predominantly by extracting standardized, high-quality information with the smallest possible learning curve; for feature extraction, by discharging healthcare practitioners from performing tedious measurements on raw data; for interpretation, by digesting complex, heterogeneous data in order to augment the understanding of the patient status; and for decision support, by leveraging the previous step to predict clinical outcomes, response to treatment or to recommend a specific intervention. This paper discusses the state-of-the-art, as well as the current clinical status and challenges associated with each of these tasks, together with the challenges related to the learning process, the auditability/traceability, the system infrastructure and the integration within clinical processes.

The main central goal and statistical power of any statistical tool is to present the reader about the level, degree and strength of variations within or between datasets in a clear and precise interpretation that allows a researcher to make a rational and empirical conclusion. The current tools used for measure of dispersion have been challenged with some limitations. A new novel approach, called optinalytic (statistical) mirroring is proposed in this article to address some of the limitations other measure of dispersion methods have failed to solve and resolve. An optinalytic (statistical) mirrors are designed sequence images on which a sequence or set of sequences can optinalytically and intermetrically reflects to give an inferential information about their comparisons (similarity and dissimilarity). Method validation and comparisons with some most important tools of dispersion measures (e.g: variance, standard deviation, coefficient of variation, variance-to-mean ratio) was established to assess the suitability of the new proposal as an alternative measure of dispersion using different sets of logically generated univariate sequences with different problems and complications. The results of comparison shows that optinalytic (statistical) mirroring is more resistant to extreme outliers, more inferential and works efficiently with negative values with a very meaningful interpretation of result to the common understanding of a non-expert of statistics, which all other methods cannot provide.

The goal of this paper is to propose a dual version of the direct cosine simplex algorithm (DDCA) for general linear problems. Unlike the two-phase and the big-M methods, our technique does not involve artificial variables. Our technique solves the dual Klee-Minty problem in two iterations and solves the dual Clausen’s problem in four iterations. The utility of the proposed method is evident from the extensive computational results on test problems adapted from NETLIB. Preliminary results indicate that this dual direct cosine simplex algorithm (DDCA) reduces the number of iterations of two-phase method.

For a positive integer k, a radio k-coloring of a simple connected graph G = (V (G), E(G)) is a mapping | f(u) - f(v)| ≥ k +1-d (u , v ) such that f :V (G)→{0,1, 2,...} for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k-coloring f, rck(f), is the maximum integer it assigns to some vertex of G. The radio k-chromatic number, rck(G) of G is min{rck(f)}, where the minimum is taken over all radio k-colorings f of G. If k is the diameter of G, then rck(G) is known as the radio number of G. In this work, we propose four algorithms (two serial algorithms and their parallel versions) which related to the radio k-coloring problem. One of them is an approximate algorithm that determines an upper bound of the radio number of a given graph. The other is an exact algorithm which finds the radio number of a graph G. The approximate algorithm is a polynomial time algorithm while the exact algorithm is an exponential time algorithm. The parallel algorithms are parallelized using the Message Passing Interface (MPI) standard. The experimental results prove the ability of the proposed algorithms to achieve a speedup 7 for 8 processors.

This paper aims to investigate the criteria of behaviour of certain type of third order neutral generalized difference equations with distributed delay. With the technique of generalized Riccati transformation and Philos-type method, some oscillation criteria are obtained to ensure convergence and oscillatory solution of suitable example is listed to illustrate the main result.

This work presents significant results obtained by the application of global optimization techniques to the design of finite, normal form games with mixed strategies. To that end, the Fuzzy ASA global optimization method is applied to several design examples of strategic games, demonstrating its effectiveness in obtaining payoff functions whose corresponding games present a previously established Nash equilibrium. In other words, the game designer becomes able to choose a convenient Nash equilibrium for a generic finite state strategic game and the proposed method computes payoff functions that will realize the desired equilibrium, making it possible for the players to reach the favorable conditions represented by the chosen equilibrium. Considering that game theory is a very significant approach for modeling interactions between competing agents, and Nash equilibrium represents a powerful solution concept, portraying situations in which joint strategies are optimal in the sense that players cannot benefit from individually modifying their current strategies provided that other players do not change their strategies as well, it is natural to infer that the proposed method may be very useful for strategists in general. In summary, it is a genuine instance of artificial inference of payoff functions after a process of global machine learning, applied to their numerical components.

Circular RNAs are a special type of RNAs which recently attracted a lot of research interest in studying its formation and function. RNA binding proteins (RBPs) that bind circRNAs are important in these processes but are relatively less studied. CLIP-Seq technology has been invented and applied to profile RBP-RNA interactions on the genome-wide scale. While mRNAs are usually the focus of CLIP-Seq experiments, RBP-circRNA interactions could also be identified through specialized analysis of CLIP-Seq datasets. However, many technical difficulties are involved in this process, such as the usually short read length of CLIP-Seq reads. In this study, we created a pipeline called Clirc specialized for profiling circRNAs in CLIP-Seq data and analyzing the characteristics of RBP- circRNAs interactions. In conclusion, this is one of the first few studies to investigate circRNAs and their binding partners through repurposing CLIP-Seq datasets to our knowledge, and we hope our work will become a valuable resource for future studies into the biogenesis and function of circRNAs. Clirc software is available at https://github.com/Minzhe/Clirc

In this study, we define new classes of convexity called of h-Godunova-Levin and h-Godunova-Levin preinvexity, through which some new inequalities of Hermite-Hadamard type were established. These new classes are the generalisation of several known convexity including the s-convex, P-function, Godunova-Levin. Further, the properties of h-Godunova-Levin function were also discussed. Meanwhile, the applications of h-Godunova-Levin Preinvex function are given

Consider a robot that is navigating in a space modeled by a graph, and that wants to know its current location. It can send a signal to determine how far it is from each landmark among a set of fixed landmarks. We study the problem of computing the minimum required number of landmarks, and where they should be placed so that the robot can always determine its location. Since the problem is an NP-complete problem, the robot's responses to the actions are slow. To accelerate this response, we can use the parallel version of this problem. In this work, we introduce a new parallel implementation for determining the metric dimension of a given graph. We run the proposed algorithm on a symmetric multi-processing (SMP) cluster using C programming language and the Message Passing Interface (MPI) library. Finally, we run our implementation on four categories of graphs (the tracks in which the robot moves): a cycle graph Cn, a path graph Pn, a triangular snake graph and a ladder graph Ln. Preliminary computational results indicate that the metric dimension problem is an NP-complete problem and prove the ability of the proposed algorithm to achieve a speedup of 6 for 8 processors.

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

In this article, the new Hermite–Hadamard type inequalities are studied via generalized s-convexity on fractal sets. These inequalities derived on fractal sets are shown to be the generalized s-convexity on fractal sets. We proved that the absolute values of the first and second derivatives for the new inequalities are the generalization of s-convexity on fractal sets.

This work presents significant results obtained by the application of global optimization techniques to the design of finite, normal form games with mixed strategies. To that end, the Fuzzy ASA global optimization method is applied to several design examples of strategic games, demonstrating its effectiveness in obtaining payoff functions whose corresponding games present a previously established Nash equilibrium. In other words, the game designer becomes able to choose a convenient Nash equilibrium for a generic finite state strategic game and the proposed method computes payoff functions that will realize the desired equilibrium, making it possible for the players to reach the favorable conditions represented by the chosen equilibrium. Considering that game theory is a very significant approach for modeling interactions between competing agents, and Nash equilibrium represents a powerful solution concept, portraying situations in which joint strategies are optimal in the sense that players cannot benefit from individually modifying their current strategies provided that other players do not change their strategies as well, it is natural to infer that the proposed method may be very useful for strategists in general. In summary, it is a genuine instance of artificial inference of payoff functions after a process of global machine learning, applied to their numerical components.

Optinalysis, as a method of symmetry detection, is a new algorithm that intrametrically (within elements or variables) or intermetrically (between elements or variables) computes and compares two or more univariate or multi-clustered or multivariate sequences as a mirror-like reflection of each other (optics-like manner), hence the name is driven. Optinalysis is based by the principles of reflection and moment about a symmetrical line which detects symmetry that reflects a similarity measurement. This proposed methodology was validated in comparison with Pearson method of skewness detection, and also with some algorithms for pairewise alignment and comparison of genomic sequences (Needle, Stretcher, Water, Matcher) on EMBL-EBI website. A results comparison shows that optinalysis is more advance, more sensitive, more inferential and simple alternative approach of skewness detection and pairewise sequence comparison.

The effect of sensitivity points (sequence order and position of every element) of sequences following comparative optinalysis under two proposed mechanisms, the paranodic and synodic skewization, was studied to develop a modeling approach to comparative optinalysis of sequences. The results show that the outcomes of comparative optinalysis (similarity measurement) in a set of paranodically skewed sequences can be modeled deterministically by suitable line regression functions. The sensitivity points (nodes) of a sequence display two important and distinct zones, the K-zones and the B-zones. Continues paranodic skewization within these zones (KB zones) operates within probability space, but at hyperskewization level and at the K-zones only, the outcomes of comparative optinalysis operate outside the probability space. Moreover, the outcomes of comparative optinalysis by synodic skewization can be modeled deterministically by some regression line functions, but a general regression function cannot be identified. At certain limit of skewization value space, following paranodic and synodic skewization, the outcomes of comparative optinalysis at the left-sided sequence form a similar pattern with the right-sided sequence.

Recent advancements in Software Defined Networking (SDN) makes it possible to overcome the management challenges of traditional network by logically centralizing control plane and decoupling it from forwarding plane. Through centralized controllers, SDN can prevent security breach, but it also brings in new threats and vulnerabilities. Central controller can be a single point of failure. Hence, flow-based anomaly detection system in OpenFlow Controller can secure SDN to a great extent. In this paper, we investigated two different approaches of flow-based intrusion detection system in OpenFlow Controller. The first of which is based on machine-learning algorithm where NSL-KDD dataset with feature selection ensures the accuracy of 82% with Random Forest classifier using Gain Ratio feature selection evaluator. In the later phase, the second approach is combined with Gated Recurrent Unit Long Short-Term Memory based intrusion detection model based on Deep Neural Network (DNN) where we applied an appropriate ANOVA F-Test and Recursive Feature Elimination feature selection method to improve the classifier performance and achieved an accuracy of 88%. Substantial experiments with comparative analysis clearly show that, deep learning would be a better choice for intrusion detection in OpenFlow Controller.

The “norm” regularized variational model is widely used in signal/image restoration. It is suitable for sparsity based regularization model design. This paper proposes a wavelet frame based Poisson noise removal model is proposed and the alternating direction method of multipliers (ADMM) is adopted to solve the corresponding optimization problem. Due to the nonconvex and noncontinuous property of the objective function with term, plenty of results in the literature can not be directly applied to verifying the convergence of this ADMM based algorithm. We established the convergence property of the proposed algorithm for Poisson noise image restoration and reconstruction. This theoretical foundation is valuable to guarantee the stability performance of the algorithm in numerical simulation. Numerical experiments on different image processing tasks, such as grey image deblurring, CT image reconstruction and graph data denoising, also verified the effectiveness of this newly proposed nonconvex and nonsmooth model. Moreover all the results are possible to be extended to more general nonconvex noncontinuous optimization problem.

Deep behavioral covariates (DBCs) introduced in this perspective form a new class of covariates that have the potential to enhance the performance of predictive models and improve analytics in clinical decision support applications. DBCs can measure how engaged a patient tends to be and how he or she tends to respond to events, and they may be highly predictive of the patient’s outcomes for a planned treatment. DBCs may potentially serve as a standard to measure patient engagement and activation and may form highly efficient mechanisms for improving patient outcomes.

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

Background: Iranian traditional medicine is a holistic school of medicine with a long prolific history. It describes numerous concepts and the relationships between them. However, no unified terminology has been proposed for the concepts of this medicine up to the present time. Considering the extensive use of concepts in the numerous textbooks written by the scholars over centuries, comprehending the totality of the terminology is obviously a very challenging task. To resolve this issue and overcome the obstacles, and code the concepts in a reusable manner, constructing an ontology of the concepts of Iranian traditional medicine seems a necessity.Methods: Makhzan al-Advieh, an encyclopedia of materia medica compiled by Mohammad Hossein Aghili Khorasani, was selected as the resource to create an ontology of Mizaj. The steps followed to accomplish this task included (1) compiling the list of classes for Mizaj; (2) arranging the classes in taxonomy; (3) determining object properties and their cardinalities; (4) specifying annotation properties including codes, labels, synonyms, and definitions for each concept; (5) reviewing the fields pertaining to Mizaj of all monographs in Makhzan al-Advieh. The ontology was created using Protégé with adherence to the principles of ontology development provided by the Open Biological and Biomedical Ontology (OBO) foundry. Results: Mizaj ontology was constructed with a final inclusion of 105 classes, three object properties, and 1078 axioms in the Iranian Traditional Medicine General Ontology database, IrGO, freely available at http://jafarilab.com/irgo/. An indented tree view and an interactive graph view using WebVOWL were used to visualize the ontology. All classes were linked to their instances in the UNaProd database to create a knowledge-base of Mizaj. Conclusion: We constructed an ontology-based knowledge base of ITM concepts of Mizaj in the domain of materia medica to help offer a shared and common understanding of this concept, enable reuse of the knowledge, and make the assumptions explicit. Extending IrGO will bridge the gap between traditional and conventional schools of medicine and help guide future research on new treatment options.

With the evolution of technology over the years, it has become possible to develop intelligent environments based on the concept of the Internet of Things, distributed systems, and machine learning. Such environments are incorporated with various solutions to solve user demands from services. One of these solutions is UBIPRI middleware, whose central concept is to maintain privacy in smart environments and to receive notifications as one of its services. However, this service is freely performed, disregarding the privacy that the environment employs. Another consideration is that based on the researched related works, it was possible to identify that the authors do not use statistical hypothesis tests in their solutions developed in the presented context. This work proposes an architecture for notification management in smart environments, composed by a notification manager named PRIPRO to assign it to UBIPRI and to aim to perform tests and comparisons between classification algorithms to delimit which one is most feasible to implement in the PRINM decision-making mechanism. The experiments showed that the J48 algorithm obtained the best results compared to the other algorithms tested and compared.

Speech signals are degraded in real-life environments, product of background noise or other factors. The processing of such signals for voice recognition and voice analysis systems presents important challenges. One of the conditions that make adverse quality difficult to handle in those systems is reverberation, produced by sound wave reflections that travel from the source to the microphone in multiple directions.To enhance signals in such adverse conditions, several deep learning-based methods have been proposed and proven to be effective. Recently, recurrent neural networks, especially those with long and short-term memory (LSTM), have presented surprising results in tasks related to time-dependent processing of signals, such as speech. One of the most challenging aspects of LSTM networks is the high computational cost of the training procedure, which has limited extended experimentation in several cases. In this work, we present a proposal to evaluate the hybrid models of neural networks to learn different reverberation conditions without any previous information. The results show that some combination of LSTM and perceptron layers produce good results in comparison to those from pure LSTM networks, given a fixed number of layers. The evaluation has been made based on quality measurements of the signal's spectrum, training time of the networks and statistical validation of results. Results help to affirm the fact that hybrid networks represent an important solution for speech signal enhancement, with advantages in efficiency, but without a significan drop in quality.

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$$

Tuberculosis cause of death worldwide and the leading cause from a single infectious agent, ranking above Human immunodeficiency virus (HIV) and Acquired Immune Deficiency Syndrome (AIDS). The aim of this study is to ascertain the trend of tuberculosis prevalence and the effect of HIV prevalence onl Tuberculosis case in some West African countries from 2000 to 2016 using count panel data regression models. The data used annual HIV and Tuberculosis cases spanning from 2000 to 2016 extracted from online publication of World health Organization (WHO). Panel Poisson regression model and Negative binomial regression model for fixed and random effects were used to analyzed the count data, the result revealed a positive trend in TB cases while increased in HIV cases leads to increase in TB cases in West African countries. Among the competing models used in this study, Panel Negative Binomial Regression Model with fixed effect emerged the best model with log likelihood value of -1336.554. This study recommended that Government and NGOs need more strategies to fight against HIV menace in West Africa as this will in turn reduced TB cases in West Africa.

In this paper, we investigate the equilibrium points, stability of two equilibrium points, convergences of negative equilibrium point, periodic solutions, and existence of bounded or unbounded solutions of a system of nonlinear difference equations x_n+1 =x_n-1y_n - 1, y_n+1 = y_n-1x_n - 1 n = 0,1,..., where the initial values are real numbers. Additionally we present some numerical examples to verify our theoretical results.

In this paper, we study the dynamics of following system of nonlinear difference equations x_n+1 = x_n-1y_n - 1, y_n+1 = y_n-1z_n - 1, z_n+1 = z_n-1x_n - 1. Especially we investigate the periodicity, boundedness and stability of related system of difference equations.

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

In Sub-Saharan African Countries such as Nigeria with high prevalence rate, Child HIV/AIDs acquired through Mother-to-Child transmission (MTCT) can be largely prevented by using a well-established prevention programme and scheme. This study examined factors that can enhanced Prevention of Mother-to-Child transmission (PMTCT) in Nasarawa State. To achieve this, structured questionnaire were used to collect data from one hundred and sixteen (116) women attending two (2) primary facilities and two (2) secondary facilities in the State. This study utilized methods of Poisson Regression, Negative Binomial Regression and Logistic Regression Analyses. Results revealed that women with at least a secondary school education, women with husband in military and women with perceived confidentiality of their HIV status significantly enhanced PMTCT of HIV in Nasarawa State while significant proportion of the women attest to the fact that drugs are available in the facilities (p-value=0.0000<0.05) . Other factors include mother income level, willingness to continue with PMTCT programme and women in support group can also enhanced PMTCT though they are not significant. This study recommends that the factors identified should be explored by NGOs, Ministry of Health and, Support groups and other relevant agencies since they have the capacity to enhanced PMTCT of HIV in Nasarawa State, Nigeria.

The research work examined the trend of HIV/AIDS, Tuberculosis, and Hepatitis diseases in Plateau state. Annual data from 2003 to 2018 was collected from the department of biostatistics at Plateau State Specialist Hospital (PSSH), Jos. The methods of analysis used are the Poisson Autoregressive Model (PAR(1)) and the Poisson Exponentially Weighted Moving Average Model (PEWMA). The results revealed a significant annual decrease of 23.9% and 4% in Tuberculosis and HIV/AIDS respectively. Furthermore, the results showed a significant annual increase of 46% in Hepatitis. The PEWMA model used revealed that TB increased by 0.02% when there is an increase in HIV but not significant, while Hepatitis significantly aggravates TB by at least 0.24%. Also, there is a significant rise in HIV by 0.85% when TB increases but Hepatitis has no such effect on HIV. Lastly, PEWMA model indicated a rise of 0.5% in Hepatitis cases when there is an increase in TB, but a surge in HIV has no such effect on Hepatitis cases in Jos. The study recommended that fight against TB should be intensified since TB cases significantly affect both HIV and Hepatitis in Jos, Nigeria.

We consider a model of predator-prey interaction at fractional-order where the predation obeys the ratio-dependent functional response and the prey is linearly harvested. For the proposed model, we show the existence, uniqueness, non-negativity as well as the boundedness of the solutions. Conditions for the existence of all possible equilibrium points and their stability criteria, both locally and globally, are also investigated. The local stability conditions are derived using the Magtinon's theorem, while the global stability is proven by formulating an appropriate Lyapunov function. The occurance of Hopf bifurcation around the interior point is also shown analytically. At the end, we implement the Predictor-Corrector scheme to perform some numerical simulations.

The parameters of logistic regression models are usually obtained by the method of maximum likelihood (ML). However, in analyses of small data sets or data sets with unbalanced outcomes or exposures, ML parameter estimates may not exist. This situation has been termed “separation” as the two outcome groups are separated by the values of a covariate or a linear combination of covariates. To overcome the problem of non-existing ML parameter estimates, applying Firth’s correction (FC) was proposed. In practice, however, a principal investigator might be advised to “bring more data” in order to solve a separation issue. We illustrate the problem by means of an examples from colorectal cancer screening and ornithology. It is unclear if such an increasing sample size (ISS) strategy that keeps sampling new observations until separation is removed improves estimation compared to applying FC to the original data set. We performed an extensive simulation study where the main focus was to estimate the cost-adjusted relative efficiency of ML combined with ISS compared to FC. FC yielded reasonably small root mean squared errors and proved to be the more efficient estimator. Given our findings, we propose not to adapt the sample size when separation is encountered but to use FC as the default method of analysis whenever the number of observations or outcome events is critically low.

Rapid increase in digital data coupled with advances in deep learning algorithms is opening unprecedented opportunities for incorporating multiple data sources for modeling spatial dynamics of human infectious diseases. We used Convolutional Neural Networks (CNN) in conjunction with satellite imagery-based urban housing and socio-economic data to predict disease density in a developing country setting. We explored both single (uni) and multiple input (multimodality) network architectures for this purpose. We achieved maximum test set accuracy of 81.6 per cent using a single input CNN model built with one convolutional layer and trained using housing image data. However, this fairly good performance was biased in favor of specific disease density classes due to an unbalanced data set despite our use of methods to address the problem. These results suggest CNN are promising for modeling spatial dynamics of human infectious diseases, especially in a developing country setting. Urban housing signals extracted from satellite imagery seem suitable for this purpose, under the same context.

The computing power of smartphones has not received considerable attention in the mainstream education system. Most of the education-oriented smartphone applications (apps) are limited to general purpose services like Massive Open Online Courses (MOOCs), language learning, and calculators (performing basic mathematical calculations). Greater potential of smartphones lies in educators and researchers developing their customized apps for learners in highly specific domains. In line with this, we present Fluid Dynamics, a highly accurate Android application for measuring flow properties in compressible flows. This app can determine properties across the stationary normal and oblique shock, moving normal shock and across Prandtl $-$ Meyer expansion fan. This app can also measure isentropic flows, Fanno flows, and Rayleigh flows. The functionality of this app is also extended to calculate properties in the atmosphere by assuming the International Standard Atmosphere (ISA) relations and also flows across the Pitot tube. Such measurements are complicated and time-consuming since the relations are implicit and hence require the use of numerical methods, which give rise to repetitive calculations. The app is an efficient semi-implicit solver for gas dynamics formulations and uses underlying numerical methods for the computations in a graphical user interface (GUI), thereby easing and quickening the learning of concerned users. The app is designed for the Android operating system, the most ubiquitous and capable surveillance platform, and its calculations are based on JAVA based code methodology. In order to check its accuracy, the app's results are validated against the existing data given in the literature.

In the present work we study the properties of geodesic sub-$ (\alpha,b,s) $-preinvex functions on Hadamard manifolds and establish some basic properties in both general and differential cases. Further, we study sufficient conditions of optimality and proved some new inequalities under geodesic sub-($ \alpha,b,s $)-preinvexity.

Remaining service life (RSL) of pavement, as a sign of future pavement performance, has always received growing attention from pavement engineers. The RSL describes the time from the moment of pavement inspection until such a time when a major repair or reconstruction is required. The conventional approach to determining RSL involves using non-destructive tests. These tests, in addition to being costly, interfere with traffic flow and compromise users' safety. In this paper, surface distresses of pavement have been used to estimate the pavement’s RSL in order to eliminate the aforementioned problems and challenges. To implement the proposed theory, 105 flexible pavement segments were taken from Shahrood-Damghan Highway (Highway 44) in Iran. For each pavement segment, the type, severity, and extent of surface damage and pavement condition index (PCI) were determined. The pavement RSL was then estimated using non-destructive tests include Falling Weight Deflectometer (FWD) and Ground Penetrating Radar (GPR). After completing the dataset, the modeling was conducted to predict RSL using three techniques include Support Vector Regression (SVR), Support Vector Regression Optimized by Fruit Fly Optimization Algorithm (SVR-FOA), and Gene Expression Programming (GEP). All three techniques estimated the RSL of the pavement by selecting the PCI as input. The Correlation Coefficient (CC), Nash-Sutcliffe efficiency (NSE), Scattered Index (SI), and Willmott’s Index of agreement (WI) criteria were used to examine the performance of the three techniques adopted in this study. In the end, it was found that GEP with values of 0.874, 0.598, 0.601, and 0.807 for CC, SI, NSE, and WI criteria, respectively, had the highest accuracy in predicting the RSL of pavement.

We present an Arduino-based automatic robotic system which is used for cutting grass or lawns, mostly healthy grass which needs to cut neatly like in a public park or a private garden. The purpose of this proposed project is to design a programmable automatic pattern design grass cutting robot with solar power which no longer requires time-consuming manual grass-cutting, and that can be operated wirelessly using an Android Smartphone via Bluetooth from a safe distance which is capable of cutting the grass in indeed required shapes and patterns; the cutting blade can also be adjusted to maintain the different length of the grass. The main focus was to design a prototype that can work with a little or no Physical user interaction. The proposed work is accomplished by using an Arduino microcontroller, DC geared Motors, IR obstacle detection sensor, motor shield, relay module, DC battery, solar panel, and Bluetooth module. The grass-cutting robot system can be moved to the location in the lawn remotely where the user wants to cut the grass directly or in desired patterns. The user can press the desired pattern button from the mobile application, and the system will start cutting grass in the similar design such as a circle, spiral, rectangle, and continue pattern. Also, with the assistance of sensors positioned at the front of the vehicle, an automatic barrier detection system is introduced to enhance safety measurements to prevent any risks. IR obstacle detector sensors are used to detect obstacles, if any obstacle is found in front of the robot while traveling; it avoids the barrier by taking a right/right turn or stop automatically appropriately, thereby preventing the collision. Also, the main aim of this project is the formation of a grass cutter that relieves the user from mowing their own grasses and reduces environmental and noise pollution. The proposed system is designed as a lab-scale prototype to experimentally validate the efficiency, accuracy, and affordability of the systems. The experimental results prove that the proposed work has all in one capability (Simple and Pattern based grass cutting with mobile-application, obstacle detection), is very easy to use, and can be easily assembled in a simple hardware circuit. We note that the systems proposed can be implemented on a large scale under real conditions in the future, which will be useful in robotics applications and cutting grass in playing grounds such as cricket, football, and hockey, etc.

Firstly, a new set of Quasi-Cubic Trigonometric Bernstein basis with two tension shape parameters is constructed, and we prove that it is an optimal normalized totally basis in the framework of Quasi Extended Chebyshev space. And the Quasi-Cubic Trigonometric Bézier curve is generated by the basis function and the cutting algorithm of the curve are given, the shape features (cusp, inflection point, loop and convexity) of the Quasi-Cubic Trigonometric Bézier curve are analyzed by using envelope theory and topological mapping; Next we construct the non-uniform Quasi-Cubic Trigonometric B-spline basis by assuming the linear combination of the optimal normalized totally positive basis have partition of unity and continuity, and its expression is obtained. And the non-uniform B-spline basis is proved to have totally positive and high-order continuity. Finally, the non-uniform Quasi Cubic Trigonometric B-spline curve and surface are defined, the shape features of the non-uniform Quasi-Cubic Trigonometric B-spline curve are discussed, and the curve and surface are proved to be continuous.

In this paper, we address the problem of car detection from aerial images using Convolutional Neural Networks (CNN). This problem presents additional challenges as compared to car (or any object) detection from ground images because features of vehicles from aerial images are more difficult to discern. To investigate this issue, we assess the performance of two state-of-the-art CNN algorithms, namely Faster R-CNN, which is the most popular region-based algorithm, and YOLOv3, which is known to be the fastest detection algorithm. We analyze two datasets with different characteristics to check the impact of various factors, such as UAV’s altitude, camera resolution, and object size. The objective of this work is to conduct a robust comparison between these two cutting-edge algorithms. By using a variety of metrics, we show that none of the two algorithms outperforms the other in all cases.

Research background: Relationship between inflation rate, unemployment rate, interest rate and real gross domestic product per capita in Nigeria. However, there seems to be a short-run or long-run relationship among the macroeconomic variables.Purpose: This study investigated the impact of the inflation rate, unemployment rate and interest rate on real gross domestic product per capita (RGDPPC) (proxy for economic growth) and proffered recommendations towards enhancing economic growth and to reduce the distasteful effects of inflation rate, unemployment rate and interest rate in Nigeria in this present time economic challenges.Research methodology: This study applied a linear dynamic model Autoregressive Distributed Lag (ARDL) modeling technique to analyze the short-run dynamics and long-run relationship of the economic growth in Nigeria over the sample period between 1984 and 2017 using annual secondary data extracted from World Bank Development Indicators Report (last updated January 2019).Results: The empirical results showed that there was long-run relationship between inflation rate, unemployment rate and interest rate on real gross domestic product per capita (proxy for economic growth) in Nigeria. The result further revealed that only unemployment rate had a significant positive impact on real gross domestic product per capita in the long-run and inflation rate had a significant negative impact on real gross domestic product per capita in the short-run.Novelty: Therefore, the study concluded that unemployment rate and inflation rate proved to have significant impacts on economic growth in the long-run and short-run respectively. Formulation of policies to reduce unemployment through the adoption of labour concentrated technique of production, entrepreneurship development and policy to keep the inflation rate at single digit.

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

The central limit theorem (CLT) and its generalization to stable distributions have been widely described in literature. However, many variations of the theorem have been defined and often their applicability in practical situations is not straightforward. In particular, the applicability of the CLT is essential for a derivation of heterogeneous ensemble of Brownian particles (HEBP). Here, we analyze the role of the CLT within the HEBP approach in more detail and derive the conditions under which the existing theorems are valid.

Topology optimization is a pioneering design method that can provide various candidates with high mechanical properties. However, the high-resolution for the optimum structures is highly desired, normally in turn leading to computationally intractable puzzle, especially for the famous Solid Isotropic Material with Penalization (SIMP) method. In this paper, an efficient and high-resolution topology optimization method is proposed based on the Super-Resolution Convolutional Neural Network (SRCNN) technique in the framework of SIMP. The SRCNN includes four processes, i.e. refining, path extraction & representation, non-linear mapping, and reconstruction. The high computational efficiency is achieved by a pooling strategy, which can balance the number of finite element analysis (FEA) and the output mesh in optimization process. To further reduce the high computational cost of 3D topology optimization problems, a combined treatment method using 2D SRCNN is built as another speeding-up strategy. A number of typical examples justify that the high-resolution topology optimization method adopting SRCNN has excellent applicability and high efficiency for 2D and 3D problems with arbitrary boundary conditions, any design domain shape, and varied load.

This paper is a continuation of previous papers on unification theories publishes in AXIOMS. We present results about the (modified) Yang-Baxter equation, Euler’s formula, dual numbers, coalgebra structures, non-associative structures, differential geometry, and (mean) inequalities. We will also attempt to relate our discussion to some Brain Studies and Machine Learnig.

We propose a new estimator for creating expansion factors for survey plots in the USDA Forest Inventory and Analysis program. This is a regularized version of the raking estimator widely used in sample surveys. The regularized raking method differs from other predictive modeling methods for integrating survey and ancillary data in that it produces a single set of expansion factors that can have general purpose use to produce small area estimates and wall-to-wall maps of any plot characteristic. This method also differs from other more widely used survey techniques, such of GREG estimation, in that it is guaranteed to produce positive expansion factors. We extend the previous method here to include cross-validation, and provide a comparison to expansion factors between the regularized raking and ridge GREG survey calibration.

Machine reading comprehension aims to teach machines to understand a text like a human, and is a new challenging direction in Artificial Intelligence. Datasets play an important role while describing or building an algorithm for machine reading comprehension. The type of answers we required from developed algorithm depends on datasets.The datasets are classified into two types, namely datasets with extractive answers and datasets with descriptive answers. This article summarize both datasets with an example of each type to get better insight of datasets in machine reading comprehension and which datasets to use depending the requirements.

For any positive integer n ≥ 2, the Erdős-Straus Conjecture claims that the Diophantine equation 4/n = 1/x + 1/y + 1/z has a solution where x, y, z are also positive integers. In this paper, a directed network based on this equation is generated, with properties such as its average clustering coefficient, average path length, degree distributions, and largest strongly connected component analysed to reveal some underlying trends about the nature of the conjecture. Potential connections between different numbers, that result from satisfying a source-solution relationship for this equation, are described using the appropriate number-theoretic interpretations wherever possible, while conjectures backed by these trends are made in other instances. Additionally, a directed configuration model is used to show that the origin of several results is the degree sequence of the network. Metrics relating to the prime number nodes, specifically their in and out degrees, are also explored to yield some intriguing observations. On the whole, the aim is to highlight the viability of complex networks as a computational tool to study this general class of problems pertaining to fixed-length unit fraction splits.

This paper presents a novel method to extract local features, which instead of calculating local extrema computes global maxima in a discretized scale-space representation. To avoid obtaining precise scales by interpolation and to achieve perfect rotation invariance, two essential techniques, increasing the width of kernels in pixel and utilizing disk-shaped convolution template are adopted in this method. Since the size of a convolution template is finite and finite templates can introduce computational error into convolution, we sufficiently discuss this problem and work out an upper bound of the computational error. The upper bound is utilized in the method to ensure that all features obtained are computed under a given tolerance. Besides, the technique of relative threshold to determine features is adopted to reinforce the robustness for the scene of changing illumination. Simulations show that this new method attains high performance of repeatability in various situations including scale change, rotation, blur, JPEG compression, illumination change and even viewpoint change.

With the interest and attention that the Blockchain and the Distributed Ledger Technologies (DLT) have recently demanded, the technology is advancing at a very high rate. With investors and applications in a wide variety of fields, a lot of funding and efforts are being driven into bringing the technology to everyday use. The community and companies are coming up with new ways to collaborate, which makes the blockchain ecosystem evolve at full tilt. Consequently, this paper’s aim is to review the academic and grey literature and to provide readers with information about the evolution, benefits and challenges of the Public Distributed Ledger Technologies and to discuss the latest solutions, which are being developed for bringing decentralization closer to the mainstream. The paper reviews the Directed Acyclic Graph (DAG) structured distributed ledgers with focus on the Hedera Hashgraph, a novelty DLT bringing a unique consensus algorithm with new use-cases enabled by new cryptoeconomic mechanisms as well as vital services, such as Solidity smart contracts and distributed file storage. Lastly, we are going to explore second-layer network protocols, a major topic for solving the scalability issues, empower Bitcoin and DLTs and also disrupt cryptocurrency exchanges focusing on the Lightning Network.

The world of query-response systems heavily depends on the cloud storage solutions, distributed data transfers and locality of users etc. When data stores and users are distributed geographically, it is essential to organize distributed data cache points at ideal locations to minimize data transfers. This leads to the question, what data to cache in which location. To answer this, we are developing an adaptive distributed data caching framework that can identify suitable data chunks to cache and move across a network of community cache locations. This paper details the first step of the process: the sub-query fragmentation technique to fragment data into portable objects. Evaluation suggests that sub-query fragments enable distributed learning methods to understand query patterns and association between sub-queries. The sub-query objects can be modelled easily as input dataset to implement machine learning models to assist cache maintenance.

The need for the most accurate and flexible system of revenue collection from internal sources has become a matter of extreme urgency and importance in e-governance. This need underscores the eagerness on the part of the Government to look for a new principle and policy of revenue collection or to become aggressive and innovative in the mode of collecting revenue from existing sources using the present system. The Boards of some Governments in Africa, even up to the moment are facing a lot of setbacks in performing their tasks due to the manual system of revenue collection from the public. This can be improved through an effective collection of revenue using the most accurate and flexible system. Tax is usually collected in the form of specific sales tax, general sales tax, corporate income tax, individual income tax, property tax and inheritance tax. Problems such as high cost of collection, fraud, underpayment, leakage in revenue, poor access to information, poor tracking of defaulters is at the increase. As a result of this, there is need to computerize the revenue collection system. Computerized systems have proven to introduce massive efficiencies and quick collection of revenue from the public. This research work demonstrates how to design and implement an automated system of revenue collection and how to maintain a secured database for collected tax information. This research delves into the study of how machine learning algorithms and Software-defined Networks improve the security of such automated systems.

The differential transformation, an approach based on Taylor's theorem, is proposed as convenient for finding exact or approximate solution to the initial value problem with multiple Caputo fractional derivatives of generally non-commensurate orders. The multi-term differential equation is first transformed into a multi-order system and then into a system of recurrence relations for coefficients of formal fractional power series. The order of the fractional power series is discussed in relation to orders of derivatives appearing in the original equation. Application of the algorithm to an initial value problem results in a reliable and expected outcome.

Anomaly detection is an active area of research with numerous methods and applications. This survey reviews the state-of-the-art of data-driven anomaly detection techniques and their application to the the aviation domain. After a brief introduction to the main traditional data-driven methods for anomaly detection, we review the recent advances in the area of neural networks, deep learning and temporal-logic based learning. We cover especially unsupervised techniques applicable to time series data because of their relevance to the aviation domain, where the lack of labeled data is the most usual case, and the nature of flight trajectories and sensor data is sequential, or temporal. The advantages and disadvantages of each method are presented in terms of computational efficiency and detection efficacy. The second part of the survey explores the application of anomaly detection techniques to aviation and their contributions to the improvement of the safety and performance of flight operations and aviation systems. As far as we know, some of the presented methods have not yet found an application in the aviation domain. We review applications ranging from the identification of significant operational events in air traffic operations to the prediction of potential aviation system failures for predictive maintenance.

With the existence of several programming languages such as C/C++, Java, C#, LISP, Prolog, Python, Simula, F#, Go, Haskell, Scala, Ruby, Dart, Swift, Groovy etc. and diverse paradigms like structured, object-oriented, list, aspect-oriented, service-oriented, web, mobile and logic programming, there is a need to perform an exhaustive comparative analysis of diverse compilers and environments before making a choice of implementation technology in software engineering. Optimization of compilers helps to reduce execution time by making use of high speed processor registers, thereby, eliminating redundant computation. This paper reports some series of performance analysis done with some popular programming languages including Java, C++, Python and PHP. Programs involving recursive and iterative functions like factorial of large numbers and binary search of large arrays were run on the various platforms with the execution time recorded in milliseconds and represented in a chart. This can aid in making a selection of the appropriate language to use for a given application domain.

It has recently been shown that, contrary to the wide belief that a shift-enabled condition (necessary for any shift-invariant filter to be representable by a graph shift matrix) can be ignored because any non-shift-enabled matrix can be converted to a shift-enabled matrix, such a conversion in general may not hold for a directed graph with non-symmetric shift matrix. This paper extends this prior work, focusing on undirected graphs where the shift matrix is generally symmetric. We show that while, in this case, the shift matrix can be converted to satisfy the original shift-enabled condition, the converted matrix is not associated with the original graph, that is, it does not capture anymore the structure of the graph signal. We show via a counterexample, that a non-shift-enabled matrix cannot be converted to a shift-enabled one and still maintain the topological structure of the underlying graph, which is necessary to facilitate localized signal processing.

Control And Data Acquisition (SCADA) systems currently monitor and collect a huge among of data from all kind of processes. In practice, due to sensor failures or to communication errors, in the long-time running, some data may be lost. When it happens, given the nature of these failures, information is lost in bursts, that is, sets of consecutive samples, which besides can be very long. Data completion is a critical step, which must be done with the utmost rigour in order to not propagate errors in the rest of the processing chain stages. Some Big Data techniques do not work if the data series are incomplete, due to the loss of some data. When this occurs it is necessary to fill out the gaps of the historical data with a reliable data completion method. This paper presents an ad-hoc method to replenish the data lost by a SCADA system in case of long bursts. The data correspond to levels of drinking water tanks of a Water Network company that present patterns on a daily and a weekly scale. A method based on tensors is used to take advantage of the data structure. A specially designed \textit{tensorization} is employed to deal with bursts of missed data, applying a twice tensor decomposition and a signal continuity correction. Statistical tests are realized, which consist of apply the data reconstruction algorithms, by deliberately removing bursts of data in verified historical database servers, to be able to evaluate the real effectiveness of the tested methods. For this application, the presented approach outperforms the other techniques found in the literature.

In this article, the new Hermite–Hadamard type inequalities are studied via generalized s-convexity on fractal sets. These inequalities derived on fractal sets are shown to be the generalized s-convexity on fractal sets. We proved that the absolute values of the first and second derivatives for the new inequalities are the generalization of s-convexity on fractal sets.

In this paper, we proposed a high accurate and stable Legendre transform algorithm which can reduce the potential instability for very high order at a very small increase in the computational time. The error analysis of interpolative decomposition for Legendre transform is presented. By employing block partitioning of Legendre-Vandermonde matrix and butterfly algorithm, a new Legendre transform algorithm with computational complexity O(N(logN)^2/loglogN) in theory and less than O(N(logN)^4) in practical application is obtained. Numerical results are provided to demonstrate the efficiency and numerical stability of the new algorithm.

Online social networking techniques and large-scale multimedia retrieval are developing rapidly, which not only has brought great convenience to our daily life, but generated, collected, and stored large-scale multimedia data as well. This trend has put forward higher requirements and greater challenges on massive multimedia retrieval. In this paper, we investigate the problem of image similarity measurement, which is one of the key problems of multimedia retrieval. Firstly, the definition of similarity measurement of images and the related notions are proposed. Then, an efficient similarity measurement framework is proposed. Besides, we present a novel basic method of similarity measurement named SMIN. To improve the performance of similarity measurement, we carefully design a novel indexing structure called SMI Temp Index (SMII for short). Moreover, we establish an index of potential similar visual words off-line to solve to problem that the index cannot be reused. Experimental evaluations on two real image datasets demonstrate that the proposed approach outperforms state-of-the-arts.

In this paper we describe a nonparametric maximum likelihood (NPML) method for estimating multivariate mixing distributions. Given $N$ independent observations, convexity theory shows that the NPML estimator is discrete with at most $N$ support points. The original infinite NPML problem then becomes the finite dimensional problem of finding the location and probability of the support points. The probability of the support points is found by a Primal-Dual Interior-Point method; the location of the support points is found by an Adaptive Grid method. Our method is able to handle high-dimensional and complex multivariate mixture models.An important application is discussed for the problem of population pharmacokinetics and a non-trivial example is treated.Our algorithm has been successfully applied in hundreds of published pharmacometric studies. In addition to population pharmacokinetics, this research also applies to empirical Bayes estimation and many other areas of applied mathematics.

Over the last decade the blockchain technology has emerged to provide solutions to the complexity and privacy challenges of using distributed databases. It reduces the cost for customers by eliminating intermediaries and builds the trust in peer-to-peer communications. Over this time, the concept of blockchain has shifted greatly due to its potential in business growth for enterprises and the rapidly evolving applications in a collaborative smart cities' ecosystem, healthcare, and governance. Many platforms, with different architectures and consensus protocols, have been introduced. Consequently, it becomes challenging for an application developer to choose the right platform. Furthermore, blockchain has misaligned with the goals for efficient green collaborative digital ecosystem. Therefore, it becomes critical to address this gap and to build new frameworks to align blockchain with those goals. In this paper, we discuss the evolution of blockchain architecture and consensus protocols, bringing a retrospective analysis and discussing the rationale of the evolution of the various architectures and protocols, as well as capturing the assumptions conducting to their development and contributions to building collaborative applications. We introduce a classification of those architectures helping developers to choose a suitable platform for applications and providing insights for future research directions in the field to build new frameworks.

Optical motion capture systems are state-of-the-art in motion acquisition, however as any measurement systems they are not error free -- noise is their intrinsic feature. The works so far mostly employ simple noise model, expressing the uncertainty as a simple variance. In the work we prove the existence of several types of noise and demonstrate how to quantify them using Allan variance. For the automated readout of the noise coefficients we solve the multidimensional regression problem using sophisticated metaheuristics in exploration-exploitation scheme. Besides classic types of noise we identified the presence of the correlated noises and periodic distortion in our facility. We had also opportunity to observe the influence of camera failure to the overall performance.

In this paper, the fixed-time stabilization problem for a class of uncertain chained system is addressed by using a novel nonsingular recursive terminal sliding mode control approach. A fixed-time controller and an adaptive law are designed to guarantee the uncertain chained form system both Lyapunov stable and fixed-time convergent within the settling time. The advantage of the controller based on the sliding mode is that the settling time does not depend on the system initial state. Furthermore, we use RBF neural network to estimate the uncertainty of the system. Finally, the simulation results demonstrate the performance of the control laws.

Here we present 1. a model for amplicon sequencing 2. a definition of the best assignment of a read to a set of reference sequences 3. strategies and structures for indexing reference sequences and computing the best assign- ments of a set of reads efficiently, based on (ultra)metric spaces and their geometry The models, techniques, and ideas are particularly relevant to scenarios akin to 16S taxonomic profiling, where both the number of reference sequences and the read diversity is considerable.

This work has its origin in intuitive physical and statistical considerations. The problem of optimizing an artificial neural network is treated as a physical system, composed of a conservative vector force field. The derived scalar potential is a measure of the potential energy of the network, a function of the distance between predictions and targets. Starting from some analogies with wave mechanics, the description of the system is justified with an eigenvalue equation that is a variant of the Schrõdinger equation, in which the potential is defined by the mutual information between inputs and targets. The weights and parameters of the network, as well as those of the state function, are varied so as to minimize energy, using an equivalent of the variational theorem of wave mechanics. The minimum energy thus obtained implies the principle of minimum mutual information (MinMI). We also propose a definition of the work produced by the force field to bring a network from an arbitrary probability distribution to the potential-constrained system. At the end of the discussion we expose a recursive procedure that allows to refine the state function and bypass some initial assumptions. The results demonstrate how the minimization of energy effectively leads to a decrease in the average error between network and target predictions.

This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a quadratic unconstrained binary optimization (QUBO) problem. The time windows impose time constraints that a feasible solution must satisfy. These take the form of inequality constraints, which are known to be particularly difficult to articulate within the QUBO framework. This is, we believe, the first time this major obstacle is overcome and the TSPTW is cast in the QUBO formulation. We have every reason to anticipate that this development will lead to the actual execution of small scale TSPTW instances on the D-Wave platform.

The introduction of the Internet of Things (IoT), i.e. the interconnection of embedded devices over the Internet, has changed the world we live in from the way we measure, make calls, print information and even the way we get energy in our offices or homes. The convenience of IoT products, like CCTV cameras, IP phones, and oscilloscopes, is overwhelming for end-users. In parallel, however, security issues have emerged and it is essential for infrastructure providers to assess the associated security risks. In this paper, we propose a novel method to detect IoT devices and identify the manufacturer, device model, and the firmware version currently running on the device using the page source from the web user interface. We performed automatic scans of the large-scale network at the European Organization for Nuclear Research (CERN) to evaluate our approach. Our tools identified 233 IoT devices that fell into eleven distinct device categories and included 49 device models manufactured by 26 vendors from across the world.

Lung cancer is a deadly disease if not diagnosed in its early stages. However, early detection of lung cancer is a challenging task due to the shape and size of its nodules. Radiologists need support from automated tools for precise opinion. Automated detection of the affected lungs nodule is difficult because of the shape similarity among healthy tissues. Over the years, several expert systems have been developed that help radiologists to diagnose lung cancer. In this article, we propose a framework to precisely detect lungs cancer by classifying it between benign and malignant nodules. The framework is tested using the subset of the publicly available at the Lung Image Database Consortium image collection (LIDC-IDRI). Multiple techniques including filtering and noise removing are applied for pre-processing. Subsequently, the OTSU and the semantic segmentation are used to accurately detect the unhealthy lungs nodules. In total, 13 nodules features were extracted using Principal Components Analysis (PCA) algorithm. Four optimal features are selected based on the classification performance. In the classification phase, 9 different classifiers are used along with two types of validation schemes i.e. train test holdout validation with 70-30 data split and 10 fold cross-validation. Our experiments show that the proposed system provides 99.23\% accuracy using logic boost classifier.