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.

Recent deep learning-based approaches have shown promising results for the challenging task of remove shadow regions in an image. Traditional shadow removal methods based on integration and texture consistency fail to reason global scene semantic structure and illumination condition. Most of them are based on local area classification or low-level feature representation. The shadow removal models based on deep learning have opaque nature. So that difficult to identify and remove shadows. Based on the above observations, those models are often producing distorted structures or inconsistent with the surrounding area blurred textures. We propose a method of image shadow removal, based on an attentive generating adversarial network model. Our model not only can focus on the shaded areas through the attention-recurrent mechanism but also use the semantic image features as a reference in network training to obtain a better shadow removal effect. Experiments show that the proposed method can produce higher quality shadow removal results than the existing methods.

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.

It is important to reduce the computation complexity while maintaining the accuracy of convolution neural networks. We deem it is possible to further reduce the network complexity while ensuring the accuracy. In this paper, we propose a novel feature extraction network called DSRNet which is lightweight but effective. DSRNet follows the basic ideas of stacking modules and short connection, introduces Depthwise Separable convolution and utilizes the Dilated convolution. The proposed network has fewer parameters and achieves outstanding speed. We conducted comprehensive experiments on CIFAR10, CIFAR100 and STL10 datasets, and the results showed the DSRNet has great performance improvement in terms of accuracy and speed.

This article is devoted to Feller's diffusion equation which arises naturally in probabilities and physics (e.g. wave turbulence theory). If discretized naively, this equation may represent serious numerical difficulties since the diffusion coefficient is practically unbounded and most of its solutions are weakly divergent at the origin. In order to overcome these difficulties we reformulate this equation using some ideas from the Lagrangian fluid mechanics. This allows us to obtain a numerical scheme with a rather generous stability condition. Finally, the algorithm admits an elegant implementation and the corresponding Matlab code is provided with this article under an open source license.

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

Some refinements and reverses of the Fejer's inequality for convex functions are given.

Management of demand and capacity for airport operation is important. The effect of capacity setting on slot adjustment, maximum adjustment and flight delay has been extensively investigated and discussed in previous slot adjustment models. But its effect on characteristics of flight waves has not been studied deeply. At present, in order to resolve the problem that Linear Integer Programming (LIP) is limited in slot allocation due to its fast dimension growth and large memory consumption, the general practice is to optimize the slot application according to data-splitting technology. However, the relationship among data splitting method, capacity setting and characteristics of slot wave has not been investigated in detail, which limits the application of LIP in slot allocation. Through the detailed analysis and testing, we found that the waveform and amplitude of slot wave can be controlled and designed by appropriate virtual capacity settings, while the number of capacity constraints and the computing time is reduced by adopting appropriate data feeding method. Our research also provides clues for further research on the construction of the flight waves for airlines operating at specific airports in order to establish direct or indirect connectivity, and increase hit rate by using our approaches.

Purpose: Localization and mapping with LiDAR data is a fundamental building block for autonomous vehicles. Though LiDAR point clouds can often encode the scene depth more accurate and steadier compared with visual information, laser-based Simultaneous Localization And Mapping (SLAM) remains challengeable as the data is usually sparse, density variable and less discriminative. The purpose of this paper is to propose an accurate and reliable laser-based SLAM solution. Design/methodology/approach: The method starts with constructing voxel grids based on the 3D input point cloud. These voxels are then classified into three types to indicate different physical objects according to the spatial distribution of the points contained in each voxel. A global environment model with Partition of Unity (POU) implicit surface is maintained along the process and located voxels are merged into it from stage to stage, through scan-to-model matching implemented by Levenberg-Marquardt method. Findings: We find a laser-based SLAM method. The method uses POU implicit surface representation to build the model and is evaluated on the KITTI odometry benchmark without loop closure. Experimental results indicate that the method achieves accuracy comparable to the state-of-the-art methods. Originality/value: We propose a novel, low-drift SLAM method, which falls into a scan-to-model matching paradigm, operates on point clouds obtained from Velodyne HDL64. The method is of value to researchers developing SLAM systems for autonomous vehicles.

Optical Character Recognition (OCR) on historical printings is a challenging task mainly due to the complexity of the layout and the highly variant typography. Nevertheless, in the last few years great progress has been made in the area of historical OCR, resulting in several powerful open-source tools for preprocessing, layout recognition and segmentation, character recognition and post-processing. The drawback of these tools often is their limited applicability by non-technical users like humanist scholars and in particular the combined use of several tools in a workflow. In this paper we present an open-source OCR software called OCR4all, which combines state-of-the-art OCR components and continuous model training into a comprehensive workflow. A comfortable GUI allows error corrections not only in the final output, but already in early stages to minimize error propagations. Further on, extensive configuration capabilities are provided to set the degree of automation of the workflow and to make adaptations to the carefully selected default parameters for specific printings, if necessary. Experiments showed that users with minimal or no experience were able to capture the text of even the earliest printed books with manageable effort and great quality, achieving excellent character error rates (CERs) below 0.5%. The fully automated application on 19th century novels showed that OCR4all can considerably outperform the commercial state-of-the-art tool ABBYY Finereader on moderate layouts if suitably pretrained mixed OCR models are available. The architecture of OCR4all allows the easy integration (or substitution) of newly developed tools for its main components by standardized interfaces like PageXML, thus aiming at continual higher automation for historical printings.

Nowadays, security is a top priority. In fact, biometrics uses cutting-edge technologies to identify terrorists and criminals. But the practice of distinguishing humans based on intrinsic physical or behavior traits goes back thousands of years. With the widespread use of computers in the late 20th century, new possibilities for digital biometrics emerged and new technologies were generously used. Among these, we remember high resolution security video cameras and drones. So, the aim of the present project is to study and explain the features of these technologies, especially the ones of the the Phantom 4 Pro+ aircraft and analyze its operating methods in order to identify human faces during live streaming of videos. For this purpose, it will be used Paul Viola and Michael Jones’ face detection algorithm, which includes Haar features and cascade classifiers to identify faces, eyes and ears of an individual.

This study tries to focusing on applying information communication technology for economic importance of Mid Oil Company (MDOC), which is among contemporary oil companies in Iraq. Since ICT forms a significant aspect of achieving organizational economic objectives, most of public and private bodies seek to utilize ICT tool and techniques to improve work efficiencies. The emerging growth in ICT has made it process and service automation possible in managing organizational activities. To determine this effect of ICT on organizations, this study formulated statistical research model at MDOC through using fifteen questionnaires, which were distributed on three axes. The outcome of the questionnaire analysis revealed that there is inadequate comprehensive infrastructure to suitably support ICT within the selected organization management. In addition, it revealed that there are no ideal standards to maintain and sustain internet networks. Based on these revelations, the study presents recommendation for the adoption of ICT with the aim of minimizing cost, enhancing communication and managing infrastructure. Also recommends the need to support IT department within an organization, with essential equipment, in terms of man and machine, for better efficiency to employ the key of ICT Impact in Iraqi governmental oil companies.

In this article, we establish the existence of and then compare smallest eigenvalues for nabla fractional boundary value problems involving a fractional difference boundary condition, using the theory of u0-positive operators with respect to a cone in a Banach space.

Although proposition of “Virtual Reality” (VR) and “Augment Reality” (AR) can be traced back to the 60s, both areas are actually blooming in recent decades. Thanks to the latest deep learning techniques, an enormous advance in computer vision research community has taken place. Since VR and AR are highly related to computer vision tasks, these areas have enjoyed the benefits as well. Yet there is no sufficient survey on such impact and new research areas arising from it. This paper mainly focuses on the latest research progress in ACM Symposium on Eye Tracking Research & Applications (ETRA) 2019, as well as several recent representative paper works. It aims to figure out the influence of deep learning techniques on latest VR/AR research. Meanwhile, new issues have popped up with the development of VR and AR technology, such as privacy and computation efficiency. This paper draws attention to such newly produced topics as well. In addition, this paper also investigates on the effect of latest VR and AR techniques on people, such as level of teamwork in collaborative tasks, assistance and treatment to patients and the disabled, etc.

We address the dynamics of two-dimensional Navier-Stokes models with infinite delay and hereditary memory, whose kernels are a much larger class of functions than the one considered in the literature, on a bounded domain. We prove the existence and uniqueness of weak solutions by means of Faedo-Galerkin method. Moreover, we establish the existence of global attractor for the system with the existence of a bounded absorbing set and asymptotic compact property.

In light of Liu et al.'s original works, this research article revisits the solution of Burgers's nonlinear equation. The researcher found two exact and explicit solutions for groups $G_4$ and $G_6$, as well as a general solution. Their applications were conducted by using numerical calculations.

This study demonstrates a global, non-parametric, non-iterative optimization of time-mean value of a kind of index vibrated by time-varying forcing. It is based on the fact that the (steady) forced vibration of non-autonomous ordinary differential equation systems is well approximated by an analytical solution when the amplitude of forcing is sufficiently small and its base state without forcing is linearly stable and steady. It is applied to optimize a time-averaged heat-transfer rate on a two-dimensional thermal convection field in a square cavity with horizontal temperature difference, and the globally optimal way of vibrational forcing, i.e. the globally optimal, spatial distribution of vibrational heat and vorticity sources, is first obtained. The maximized vibrational thermal convection corresponds well to the state of internal gravity wave resonance. In contrast, the minimized thermal convection is weak, keeping the boundary layers on both sidewalls thick.

The free energy principle states that self-organization occurs through minimization of free energy, which is a measure of potential thermodynamic work. By minimizing free energy, the organism happens to also minimize surprise over its boundary, promoting chances of survival. We discuss the ethical implications of the cognitive goal in detail from an empirical point of view, highlighting the principle of least action as a physical basis of Occam's razor, the universality of the free energy principle, and its explanation of natural selection. We explain that the free energy principle extends to groups of organisms and helps us understand group-scale adaptations and selection in biology. The free energy principle applies to all scales of organization in the organism from single cells to the entire nervous system. When this principle is taken to its logical extremes of modeling groups, populations and ecosystems, we uncover a new, evolutionarily sensible path at explaining puzzling aspects of human motivation and judgement, including ethical decisions. To minimize free energy, populations have to act to maximize gathering of information, while building effective models at mitigating changes to its dynamic structure. The free energy principle thus provides a naturalistic explanation of some of our deepest ethical intuitions, and valuable principles of social behavior. We interpret the cognitive goal that corresponds to the principle as seeking a dynamic, fruitful, yet peaceful activity that sustains the organism. This state of mind is interestingly similar to the Buddhist intuition of mental equanimity; the organism's final goal is to be at peace and harmony with the environment. Another immediately relevant aspect is that assemblies must form to promote symbiotic, synergistic, positive feedback loops, which coincides with the findings of ecologists. Therefore, ethics naturally emerges in self-organizing systems. Assemblies of organisms must ultimately unite in macro-minds to achieve the greatest reduction in free energy, as well as building technological extensions of themselves to improve their capacity to do such, therefore the principle also predicts a post-singularity world-mind composed mostly of artificial intelligence.

ver the last decade the blockchain technology has emerged to provide solutions to the complexity, performance and privacy challenges of using distributed databases. Over this time, the concept of blockchain has shifted greatly due to the rapidly evolving distributed applications in a collaborative ecosystem such as smart cities, social networking, governance, and smart healthcare, and the ultimate need for green computing, cost reduction for customers, and business growth for enterprises. Consequently, blockchain architecture has misaligned with the goals for a green collaborative digital ecosystem. Therefore, it becomes critical to address this vent and to build new frameworks to align blockchain with those goals. In this paper, we discuss the evolution of blockchain architecture and its 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 and provide insights for future research directions in the field.

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. This serves as the basis for automatic vulnerability assessment to be presented in a future paper.

In this paper, we study a generalised CIR process with externally-exciting and self-exciting jumps, and focus on the distributional properties and applications of this process and its aggregated process. The first and second moments of this jump-diffusion process are used to calculate the insurance premium based on mean-variance principle. The Laplace transform of the aggregated process is derived, and this leads to an application for pricing default-free bonds which could capture the impacts of both exogenous and endogenous shocks. Illustrative numerical examples and comparisons with other models are also provided.

(1) Background: Most of the existing studies focus on the evaluation of technology finance; the relationship between technology finance and technology innovation. But there are few studies on the development of technology finance and the quality of economic development in our country; (2) Methods: Based on the panel data of 30 provinces in China, this paper constructs an index system to measure the development of technology finance through the improved entropy method, and tests the spatial correlation of the development of technology finance in China by Moran'I index. According to the test results, this paper constructs a spatial econometric model to empirically analyze the promoting effect of scientific, technological and financial development on high-quality economic development, and analyzes its promoting effect in different regions and different time periods; (3) Results: The results show that the quality of China's economic growth is spatially dependent, and the development of science, technology and finance can significantly promote the quality economic development in China. And the promotion coefficient of the central region is the largest, as well as the coefficient of the eastern region is the smallest. The promotion coefficient was small and not significant before 2015, and was significantly positive after 2015; (4) Conclusions: this paper puts forward the corresponding policy recommendations according to the research results.

As a kind of converse of the celebrated Erd˝os-Szekeres theorem, we present a necessary and sufficient condition for a sequence of length n to contain a longest increasing subsequence and a longest decreasing subsequence of given lengths x and y, respectively.

Many scientific and technological problems are studied with the help of computer codes that simulate the phenomena of interest rather than via traditional laboratory experiments. Such models play an important role in neuroscience where they are used to mimic brain function from the sub-cellular to the macroscopic level. Exploration with computer models carries with it a number of statistical challenges: where to sample the input space for the simulator, how to make sense of the data that is generated, how to estimate unknown parameters in the model, how to validate a model. The simulator setting also has some unique problems and possibilities. This review paper describes statistical research on these issues and how that work might be applied to neural simulations.

The Internet of Things (IoT) is an emerging technology that aims to enable the interconnection of a large number of smart devices and heterogeneous networks. Ad hoc networks play an important role in the designing of IoT-enabled platforms due to their efficient, flexible, low-cost, and dynamic infrastructures. These networks utilize the available resources efficiently to maintain the Quality of Service (QoS) in a multi-hop communication. However, in a multi-hop communication, the relay nodes can be malicious, thus requiring a secured and reliable data transmission. In this paper, we propose a QoS-aware secured communication scheme for IoT-based networks (QoS-IoT). In QoS-IoT, a Sybil attack detection mechanism is used for the identification of Sybil nodes and their forged identities in multi-hop communication. %by high-power and mobile nodes. After Sybil nodes detection, an optimal contention window (CW) is selected for QoS provisioning, i.e., to achieve per-flow fairness and efficient utilization of the available bandwidth. In a multi-hop communication, the MAC layer protocols do not perform well in terms of fairness and throughput, especially when the nodes generate a large amount of data. It is because the MAC layer has no capability of providing QoS to prioritized or forwarding flows. We evaluate the performance of QoS-IoT in terms of Sybil attack detection, fairness, throughput, and buffer utilization. The simulation results show that the proposed scheme outperforms the existing schemes and significantly enhances the performance of the network with a large volume of data. Moreover, the proposed scheme is resilient against Sybil attack.

The worldwide interconnected objects, called Internet of Things (IoTs), have been increasingly growing in the last several years. Different social media platforms and devices are continuously generating data about individuals and facilitate the technological and the social convergence of their Internet-based data and services with globalized users. These social and device-related IoTs create rooms for data breaches as such platforms provide ability to collect private and sensitive data. We assert that data breaches are fundamentally failures of access control - most users are too busy or technically ill-equipped to understand access control policy expressions and decisions. We argue that this is symptomatic of globalised societies structured by the conditions of algorithmic modernity; an era in which our data is increasingly interdependent on, and enmeshed with, ever more complex systems and processes that are vulnerable to attack. Ethically managing data breaches is now too complex for current access control systems, such as Role-Based Access Control (RBAC) and Context-Aware Access Control (CAAC). These systems do not provide an explicit mechanism to engage in decision making processes, about who should have access to what data and when, that are involved in data breaches. We argue that a policy ontology will contribute towards the development of Ethical CAAC better suited to attributing accountability for data breaches in the context of algorithmic modernity. We interrogate our proposed Ethical CAAC as a theoretical construct with implications for future policy ontology models and data breach countermeasures. An experimental study on the performance of the proposed framework is carried out with respect to a more generic CAAC framework.

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

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

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

The main purpose of this paper is to introduce and investigate degenerate Poisson distrib- ution which is a new extension of the Poisson distribution including the degenerate expo- nential function. We then provide several properties of the degenerate Poisson distribution such as the first and the second raw moments and di¤erence operator property. Moreover, we acquired the skewness and the kurtosis for the degenerate Poisson distribution. We also derive its moment generating function by which we define the degenerate Bell polynomials and give a connection for these polynomials related to the unsigned Stirling numbers of the …rst kind.

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

The main aim of this paper is to investigate multifarious properties and relations for the gamma distribution. The approach to reach this purpose will be introducing a special polynomial including gamma distribution. Several formulas covering addition formula, derivative property, integral representation and explicit formula are derived by means of the series manipulation method. Furthermore, two correlations including Bernoulli and Euler polynomials for gamma distribution polynomials are provided by utilizing of their generating functions.

The conventional machine learning (ML) algorithms are continuously advancing and evolving at a fast-paced by introducing the novel learning algorithms. ML models are continually improving using hybridization and ensemble techniques to empower computation, functionality, robustness, and accuracy aspects of modeling. Currently, numerous hybrid and ensemble ML models have been introduced. However, they have not been surveyed in a comprehensive manner. This paper presents the state of the art of novel ML models and their performance and application domains through a novel taxonomy.

Automated controlling the harvesting systems can significantly increase the efficiency of the agricultural practices and prevent food wastes. Modeling and improvement of the combine harvester can increase the overall performance. Machine learning methods provide the opportunity of advanced modeling for accurate prediction of the highest performance of the machine. In this study, the modeling of combine harvesting id performed using radial basis function (RBF) and the hybrid machine learning method of adaptive neuro-fuzzy inference system (ANFIS) to predict various variables of the combine harvester for the optimal performance. Response surface methodology (RSM) is also used to optimize the models. The comparative study shows that the ANFIS method outperforms the RBF method.

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

Type-2 fuzzy sets were introduced by L. Zadeh aiming at modelling some settings in which fuzzy sets (usually called type-1 fuzzy sets) are not sufficient to reflect certain uncertainty degrees - loosely speaking, they are fuzzy sets whose membership degrees are ordinary fuzzy sets. On the other hand, fiber bundles are topological entities of extreme importance in Mathematics itself and many other scientific areas, like Physics (General Relativity, Field Theory etc.), finance modelling, and statistical inference. The present work introduces a conceptual link between the two ideas and conjectures about the potential mutual benefits that can be obtained from this viewpoint.As an objective and usable product of the presented ideas, it is described a framework for defining type-2 fuzzy hedges, proper to operate on interval type-2 fuzzy sets.

Building energy consumption plays an essential role in urban sustainability. The prediction of the energy demand is also of particular importance for developing smart cities and urban planning. Machine learning has recently contributed to the advancement of methods and technologies to predict demand and consumption for building energy systems. This paper presents a state of the art of machine learning models and evaluates the performance of these models. Through a systematic review and a comprehensive taxonomy, the advances of machine learning are carefully investigated and promising models are introduced.

Biofuels construct an essential pillar of energy systems. Biofuels are considered as a popular resource for electricity production, heating, household, and industrial usage, liquid fuels, and mobility around the world. Thus, the need for handling, modeling, decision-making, demand, and forecasting for biofuels are of utmost importance. Recently, machine learning (ML) and deep learning (DL) techniques have been accessible in modeling, optimizing, and handling biofuels production, consumption, and environmental impacts. The main aim of this study is to review and evaluate ML and DL techniques and their applications in handling biofuels production, consumption, and environmental impacts, both for modeling and optimization purposes. Hybrid and ensemble ML methods, as well as DL methods, have found to provide higher performance and accuracy in modeling the biofuels.

We present a discussion and analysis regarding the benefits and limitations of open and non-anonymized peer review based on literature results and responses to a survey on the reviewing process of alt.chi, a more or less open-review track within the CHI conference, the predominant conference in the field of human-computer interaction (HCI). This track currently is the only implementation of an open-peer-review process in the field of HCI while, with the recent increase in interest in open science practices, open review is now being considered and used in other fields. We collected 30 responses from alt.chi authors and reviewers and found that, while the benefits are quite clear and the system is generally well liked by alt.chi participants, they are reluctant to see it used in other venues. This concurs with a number of recent studies that suggest a divergence between support for a more open review process and its practical implementation. The data and scripts are available on https://osf.io/vuw7h/, and the figures and follow-up work on http://tiny.cc/OpenReviews.

Artificial intelligence methods and application have recently shown great contribution in modeling and prediction of the hydrological processes, climate change, and earth systems. Among them, deep learning and machine learning methods mainly have reported being essential for achieving higher accuracy, robustness, efficiency, computation cost, and overall model performance. This paper presents the state of the art of machine learning and deep learning methods and applications in this realm and the current state, and future trends are discussed. The survey of the advances in machine learning and deep learning are presented through a novel classification of methods. The paper concludes that deep learning is still in the first stages of development, and the research is still progressing. On the other hand, machine learning methods are already established in the fields, and novel methods with higher performance are emerging through ensemble techniques and hybridization.

Prediction of the likely evolution in the traffic scenes is a challenging task because of high uncertainty of sensing technology and dynamic environment. It leads to failure of planning for intelligent agents like autonomous vehicles. In this paper, we propose a fluid-based physical model to present the influence of surrounding object's motion on driving safety. In our pipeline, the input sensor could be LiDAR, camera, or multi-modal data. We use a Kalman filter to estimate the state space of each detected object, and adopt the properties of stable fluid to build a riskmap based on the density field. The noisy state space are then modeled as the boundary conditions in the simulation of advection and diffusion process. We test our approach on the public KITTI dataset and find this model could handle the short-term prediction in case of misdetection and tracking failure caused by object occlusion, which shows promising in collision risk assessment on road scenes.

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

Deep learning (DL) algorithms have recently emerged from machine learning and soft computing techniques. Since then, several deep learning (DL) algorithms have been recently introduced to scientific communities and are applied in various application domains. Today the usage of DL has become essential due to their intelligence, efficient learning, accuracy and robustness in model building. However, in the scientific literature, a comprehensive list of DL algorithms has not been introduced yet. This paper provides a list of the most popular DL algorithms, along with their applications domains.

In light of Liu's original works, this paper revisits the solution of general Burgers's nonlinear equation. We obtain two exact and explicit solutions for group $G_4$ and $G_6$, and a most general solution as well. As applications, a numerical example is carried out.

Accurate prediction of mercury content emitted from fossil-fueled power stations is of utmost importance for environmental pollution assessment and hazard mitigation. In this paper, mercury content in the output gas of power stations’ boilers was predicted using an adaptive neuro-fuzzy inference system (ANFIS) method integrated with particle swarm optimization (PSO). The input parameters of the model include coal characteristics and the operational parameters of the boilers. The dataset has been collected from 82 power plants and employed to educate and examine the proposed model. To evaluate the performance of the proposed hybrid model of ANFIS-PSO model, the statistical meter of MARE% was implemented, which resulted in 0.003266 and 0.013272 for training and testing, respectively. Furthermore, relative errors between acquired data and predicted values were between -0.25% and 0.1%, which confirm the accuracy of the model to deal nonlinearity and representing the dependency of flue gas mercury content into the specifications of coal and the boiler type.

This paper presents an extension of the resuts obtained in previous work by the author concerning the application of global optimization techniques to the design of finite strategic games with mixed strategies. In that publication the Fuzzy ASA global optimization method was applied to many examples of synthesis of strategic games with one previously specified Nash equilibrium, evidencing its ability in finding payoff functions whose respective games present those equilibria, possibly among others. That is to say, it was shown it is possible to establish in advance a Nash equilibrium for a generic finite state strategic game and to compute payoff functions that will make it feasible to reach the chosen equilibrium, allowing players to converge to the desired profile, considering that it is an equilibrium of the game as well. Going beyond this state of affairs, the present article shows that it is possible to "impose" multiple Nash equilibria to finite strategic games by following the same reasoning as before, but with a slight change: using the same fundamental theorem of Richard D. McKelvey, modifying the original prescribed objective function and globally minimizing it. The proposed method, in principle, is able to find payoff functions that result in games featuring an arbitrary number of Nash equiibria, paving the way to a substantial number of potential applications.

With continued technological innovation in the fields of mixed reality (MR), wearable-type MR devices, such as helmets, have been released and are frequently used in various fields, such as entertainment, training, and education. However, because each product has different parts and specifications in terms of the design and manufacturing process, users feel that the virtual objects overlaying real environments in MR are visualized differently depending on the scale and color used by the MR device. In this paper, we compare the effect of scale and color parameters on users’ perception in using different types of MR devices to improve MR experience. We conducted two experiments (scale and color), and our experimental study showed that the subjects who participated in the scale perception experiment clearly tended to underestimate virtual objects, compared with real objects, and overestimate color in MR environments. [MM1]Please confirm meaning.

We introduce a total energy and environmental evaluation method in the manufacturing industry. The method gives us a series of descriptive indexes to assess the overall environmental effect level on materials, energy, wastes and products in the life cycle process. Meanwhile, the method uses partial indexes, environmental effect factors, and correction offsets into the quantitative model to analyze the learning process and rebound effect on the energy and environment at each procedure. In this work, we choose S-shaped learning curves to describe how to decrease energy consumption and improve the technical learning by doing for recent 30 years. Also, we draw the different rebound effect curves of the total energy-environmental evaluation with technical learning method, which use the annual industrial production growth rate to show that it's significant to estimate its effect on technology changes. The ideas about the interaction of energy and production environment from material flows to energy consumption, direct us to build an example to estimate quantitatively the results with different condition factors, and realize the process improvement and develop new products.

A modified free-wake vortex ring model is proposed to compute the dynamics of a floating horizontal-axis wind turbine. The model is divided into two parts. The near wake model uses a blade bound vortex model and trailed vortex model, which is developed based on vortex filament method. By contrast, the far wake model is based on the vortex ring method. The proposed model is a good compromise between accuracy and computational cost, for example when compared with more complex vortex methods. The present model is used to assess the influence of floating platform motions on the performance of a horizontal-axis wind turbine rotor. The results are validated on the 5MW NREL rotor and compared with other aerodynamic models for the same rotor subjected to different platform motions. It was found that the results from the proposed method are more reliable than the results from BEM theory especially at small angles of attack in the region of low wind speeds, on the one hand, and high wind speeds with blade pitch motions, on the other hand. And also the proposed method is less time consuming and has similar accuracy when comparing with more advanced vortex based methods.

Abstract: As the massive deployment of the heterogeneous IoT devices in the coexisting environment such as smart homes，Traditional channel-based spectrum sharing algorithms such as CSMA has great limitations to further optimize spectrum utilization. Therefore, exploring more efficient spectrum sensing algorithm becomes hot topic these years. This paper proposes Subcarrier-Sniffer, which utilizes Channel State Information (CSI) to sense the subcarrier-level detailed status of the spectrum. In order to evaluate the performance of Subcarrier-Sniffer, we implemented Subcarrier-Sniffer by USRP B200min, and the experimental results show that when the distance between Subcarrier-Sniffer and the monitored devices is not great than 7 m, the accuracy of subcarrier-level spectrum sensing could achieve 100% in our settings.

In this paper we propose a novel self-supervised approach of keywords and keyphrases retrieval and extraction by an end-to-end deep learning approach, which is trained by contextually self-labelled corpus. Our proposed approach is novel to use contextual and semantic features to extract the keywords and has outperformed the state of the art. Through the experiment the proposed approach has been proved to be better in both semantic meaning and quality than the existing popular algorithms of keyword extraction. In addition, we propose to use contextual features from bidirectional transformers to automatically label short-sentence corpus with keywords and keyphrases to build the ground truth. This process avoids the human time to label the keywords and do not need any prior knowledge. To the best of our knowledge, our published dataset in this paper is a fine domain-independent corpus of short sentences with labelled keywords and keyphrases in the NLP community.

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

Clients are increasingly looking for fast and effective means to quickly and frequently survey and communicate the condition of their buildings so that essential repairs and maintenance work can be done in a proactive and timely manner before it becomes too dangerous and expensive. Traditional methods for this type of work commonly comprise of engaging building surveyors to undertake a condition assessment which involves a lengthy site inspection to produce a systematic recording of the physical condition of the building elements, including cost estimates of immediate and projected long-term costs of renewal, repair and maintenance of the building. Current asset condition assessment procedures are extensively time consuming, laborious, and expensive and pose health and safety threats to surveyors, particularly at height and roof levels which are difficult to access. We propose a method for automated detection and localisation of key building defects from images using deep learning and convolution neural networks. The proposed model is based on a pre-trained VGG-16 classifier with Class Activation Mapping (CAM) for object localisation. The model has proven to be robust and able to accurately detect and localise mould growth, stains, and paint deterioration defects arising from dampness in buildings. The approach is being developed with potentials to scale-up to support automated detection of defects and deterioration of buildings in real-time using mobile devices and drones.

This study investigated the trends of registered Death and Birth in Nigeria using Generalized Linear Models. Annual data on Death and Birth was collected from National Population Commission for the period of 2004 to 2017. The Natural increase calculated revealed a positive trend in the natural increase in Nigeria from 2004 to 2017. Evidence from summary statistics revealed some level of over dispersion (variance > mean). This study explored Poisson Regression Models and Negative Binomial Regression Models using two links (identity and log). The results revealed a positive increase in registration of birth and death rates in Nigeria and among the competing the models, Negative Binomial regression model with identity link emerged as the best model for modeling birth and death rates registration in Nigeria. Data on numbers of deaths and causes of death are essential if countries are to determine priorities, formulate and monitor policies for public health care as well as other government policies that may be based on such data

In Wikipedia, articles about various topics can be created and edited independently in each language version. Therefore, quality of information about the same topic depends on language. Any interested user can improve an article and that improvement may depend on popularity of the article. The goal of this study is to show what topics are best represented in different language versions of Wikipedia using results of quality assessment for over 39 million articles in 55 languages. In this paper, we also analyze how popular are selected topics among readers and authors in various languages. We used two approaches to assign articles to various topics. First, we selected 27 main multilingual categories and analyzed all their connections with sub-categories based on information extracted from over 10 million categories in 55 language versions. To classify the articles to one of the 27 main categories we took into account over 400 million links from articles to over 10 million categories and over 26 million links between categories. In the second approach we used data from DBpedia and Wikidata. We also showed how the results of the study can be used to build local and global rankings of the Wikipedia content.

We present an improved algorithm for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithm is much more accurate than the famous fast inverse square root algorithm and has a similar computational cost. The presented modification concern Newton-Raphson corrections and can be applied when the distribution of these corrections is not symmetric (for instance, in our case they are always negative).

In this paper, we propose a novel approach of video skimming by exploiting the fusion of video temporal information and keyword information representation extracted from multi-model video information including audio, text and visual indices. In addition, we introduce the brand-safe filtering and sentiment analysis in order to only reserve the user-friendly content in the video skim. In the experiment by using the videos from YouTube-8M dataset, we have proved that the semantic conservation in the video skim from the proposed approach highly outperforms the approaches by only partial information of the video in conserving the semantic content of the video.

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. NP is the complexity class of languages defined by polynomial time verifiers M such that when the input is an element of the language with its certificate, then M outputs a string which belongs to a single language in P. Another major complexity classes are L and NL. The certificate-based definition of NL is based on logarithmic space Turing machine with an additional special read-once input tape: This is called a logarithmic space verifier. NL is the complexity class of languages defined by logarithmic space verifiers M such that when the input is an element of the language with its certificate, then M outputs 1. To attack the P versus NP problem, the NP-completeness is a useful concept. We demonstrate there is an NP-complete language defined by a logarithmic space verifier M such that when the input is an element of the language with its certificate, then M outputs a string which belongs to a single language in L.

Primary importance is devoted to Fault Detection and Diagnosis (FDI) of electrical machine and drive systems in modern industrial automation. The widespread use of Machine Learning techniques has made it possible to replace traditional motor fault detection techniques with more efficient solutions that are capable of early fault recognition by using large amounts of sensory data. However, the detection of concurrent failures is still a challenge in the presence of disturbing noises or when the multiple faults cause overlapping features. The contribution of this work is to propose a novel methodology using multi-label classification method for simultaneously diagnosing multiple faults and evaluating the fault severity under noisy conditions. Performance of various multi-label classification models are compared. Current and vibration signals are acquired under normal and fault conditions. The applicability of the proposed method is experimentally validated under diverse fault conditions such as unbalance and misalignment.

People with Down syndrome present cognitive difficulties that affect their reading skills. In this study we present results about the use of gestural interaction with Kinect sensor to improve the reading skills of students with Down syndrome. Following a case of study method for small samples with disabilities, measuring different variables related to reading skills in an experimental group and in a control group. We found improvements in the visual association, visual comprehension, sequential memory, and visual integration after this stimulation in the experimental group compared to the control group. Also, we found that the number of error and delay time of interaction decrease between sessions in the experimental group.

Emotion detection from the text is an important and challenging problem in text analytics. The opinion-mining experts are focusing on the development of emotion detection applications as they have received considerable attention of online community including users and business organization for collecting and interpreting public emotions. However, most of the existing works on emotion detection used less efficient machine learning classifiers with limited datasets, resulting in performance degradation. To overcome this issue, this work aims at the evaluation of the performance of different machine learning classifiers on a benchmark emotion dataset. The experimental results show the performance of different machine learning classifiers in terms of different evaluation metrics like precision, recall ad f-measure. Finally, a classifier with the best performance is recommended for the emotion classification.

This paper compares a series of traditional and deep learning methodologies for the segmentation of textures. Six well-known texture composites first published by Randen and Hus{\o}y were used to compare traditional segmentation techniques (co-occurrence, filtering, local binary patterns, watershed, multiresolution sub-band filtering) against a deep-learning approach based on the U-Net architecture. For the latter, the effects of depth of the network, number of epochs and different optimisation algorithms were investigated. Overall, the best results were provided by the deep-learning approach. However, the best results were distributed within the parameters, and many configurations provided results well below the traditional techniques.

This paper investigates an inverse problem of option pricing in the extended Black--Scholes model. We identify the model coefficients from the measured data and attempt to find arbitrage opportunities in financial markets using a Bayesian inference approach. The posterior probability density function of the parameters is computed from the measured data. The statistics of the unknown parameters are estimated by Markov Chain Monte Carlo (MCMC), which explores the posterior state space. The efficient sampling strategy of MCMC enables us to solve inverse problems by the Bayesian inference technique. Our numerical results indicate that the Bayesian inference approach can simultaneously estimate the unknown drift and volatility coefficients from the measured data.

Evaporation is one of the main processes in the hydrological cycle, and it is one of the most critical factors in agricultural, hydrological, and meteorological studies. Due to the interactions of multiple climatic factors, the evaporation is a complex and nonlinear phenomenon; therefore, the data-based methods can be used to have precise estimations of it. In this regard, in the present study, Gaussian Process Regression (GPR), Nearest-Neighbor (IBK), Random Forest (RF) and Support Vector Regression (SVR) were used to estimate the pan evaporation (PE) in the meteorological stations of Golestan Province, Iran. For this purpose, meteorological data including PE, temperature (T), relative humidity (RH), wind speed (W) and sunny hours (S) collected from the Gonbad-e Kavus, Gorgan and Bandar Torkman stations from 2011 through 2017. The accuracy of the studied methods was determined using the statistical indices of Root Mean Squared Error (RMSE), correlation coefficient (R) and Mean Absolute Error (MAE). Furthermore, the Taylor charts utilized for evaluating the accuracy of the mentioned models. The outcome indicates that the optimum state of Gonbad-e Kavus, Gorgan and Bandar Torkman stations, Gaussian Process Regression (GPR) with the error values of 1.521, 1.244, and 1.254, the Nearest-Neighbor (IBK) with error values of 1.991, 1.775, and 1.577, Random Forest (RF) with error values of 1.614, 1.337, and 1.316, and Support Vector Regression (SVR) with error values of 1.55, 1.262, and 1.275, respectively, have more appropriate performances in estimating PE. It found that GPR for Gonbad-e Kavus Station with input parameters of T, W and S and GPR for Gorgan and Bandar Torkmen stations with input parameters of T, RH, W, and S had the most accurate performances and proposed for precise estimation of PE. Due to the high rate of evaporation in Iran and the lack of measurement instruments, the findings of the current study indicated that the PE values might be estimated with few easily measured meteorological parameters accurately.

In the present work, a novel and the robust computational investigation is carried out to estimate solubility of different acids in supercritical carbon dioxide. Four different algorithms such as radial basis function artificial neural network, Multi-layer Perceptron (MLP) artificial neural network (ANN), Least squares support vector machine (LSSVM) and adaptive neuro-fuzzy inference system (ANFIS) are developed to predict the solubility of different acids in carbon dioxide based on the temperature, pressure, hydrogen number, carbon number, molecular weight, and acid dissociation constant of acid. In the purpose of best evaluation of proposed models, different graphical and statistical analyses and also a novel sensitivity analysis are carried out. The present study proposed the great manners for best acid solubility estimation in supercritical carbon dioxide, which can be helpful for engineers and chemists to predict operational conditions in industries.

Malaria is endemic in Nigeria and remains a major public health problem, taking its greatest toll on children under age 5 and pregnant women, although it is preventable, treatable, and curable. This study investigates the Impact of socio-economic factors and indoor mosquito control on malaria prevalent among pregnant women in Nigeria using logistic regression. To achieve this, secondary data obtained from 2015 Nigeria Malaria Indicator survey, executed by the National Malaria Elimination Programme (NMEP) and the National Population Commission (NPopC), with a nationally representative sample of more than 8,000 consisting of 7,745 households. The results from the logistic regression with odds ratio revealed that pregnant women are more like to be affected by malaria fever (though not significant) compared to women that are not pregnant. The income levels of the household does not significant reduce the incidence of malaria fever among pregnant women in Niger. Concerning the malaria presenting measure, only dwelling sprayed by private company significantly reduce the incidence of malaria fever among pregnant women (P-value=0.020<0.05) compared to dwelling sprayed by government and NGOs and also to Insecticide Treated Net. Also pregnant women in the urban centers are less likely to have malaria fever compared to pregnant women in rural communities in Nigeria. Also, pregnant women with atleast a secondary school level of education are less likely to be affected by malaria fever compared to pregnant women with no formal education. The fitted logistic model passed the goodness-of-test fit; the classification test for the logistic model was correctly classified at about 67.02%. Therefore, this study recommends that government and NGOs should intensify their efforts in the area of dwelling spraying, awareness campaign of the danger of malaria fever among pregnant women and infants, engaged in effective distribution of insecticide treated net in order to reduce the incidence of malaria fever among pregnant women living in rural communities in Nigeria.

A novel method for finding linear mappings among word embeddings for several languages, taking as pivot a shared, universal embedding space, is proposed in this paper. Previous approaches learn translation matrices between two specific languages, but this method learn translation matrices between a given language and a shared, universal space. The system was first trained on bilingual, and later on multilingual corpora as well. In the first case two different training data were applied; Dinu’s English-Italian benchmark data, and English-Italian translation pairs extracted from the PanLex database. In the second case only the PanLex database was used. The system performs on English-Italian languages with the best setting significantly better than the baseline system of Mikolov et al. [1], and it provides a comparable performance with the more sophisticated systems of Faruqui and Dyer [2] and Dinu et al. [3]. Exploiting the richness of the PanLex database, the proposed method makes it possible to learn linear mappings among an arbitrary number of languages.

In this study, based on our previous study, we examined the mathematical properties, especially the stability of the equilibrium for our proposed mathematical model. By means of the results of the stability in this study, we also used actual data representing transient booms and resurgent booms, and conducted parameter estimation for our proposed model using Bayesian inference. In addition, we conducted a model fitting to five actual data. By this study, we reconfirmed that we can express the resurgences or minute vibrations of actual data by means of our proposed model.

This paper investigates the inverse option problems (IOP) in the extended Black--Scholes model arising in financial markets. We identify the volatility and the drift coefficient from the measured data in financial markets using a Bayesian inference approach, which is presented as an IOP solution. The posterior probability density function of the parameters is computed from the measured data. The statistics of the unknown parameters are estimated by a Markov Chain Monte Carlo (MCMC) algorithm, which exploits the posterior state space. The efficient sampling strategy of the MCMC algorithm enables us to solve inverse problems by the Bayesian inference technique. Our numerical results indicate that the Bayesian inference approach can simultaneously estimate the unknown trend and volatility coefficients from the measured data.