Mobile devices have become tools we spend our free time where we carry them with us every moment, they allow us to interact with the environment, we immortalize the moment when necessary. These devices which we spend most of our daily life become very common in recent years and even there are unique business areas emerged. It was announced that the number of people using smartphones is over than 2.5 billion in the first quarter of 2016. As people become more addicted to mobile technology, they become the target of malevolent people. A huge increase in the number of mobile malware is observed as the number of the users increase. Billions of users at risk day by day due to the development of the methods. We have addressed the recent methods used and the types of malware that target mobile devices in our study. We have mentioned the proxy server and reverse proxy server operation logic. We discuss the method of turning mobile devices into reverse proxy servers, risks involved and protection methods.

RAxML-NG is a new phylogentic inference tool that replaces the widely-used RAxML and ExaMLtree inference codes. Compared to its predecessors, RAxML-NG offers improvements in accur-acy, flexibility, speed, scalability, and user-friendliness. In this chapter, we provide practicalrecommendations for the most common use cases of RAxML-NG: tree inference, branch supportestimation via non-parametric bootstrapping, and parameter optimization on a fixed tree topo-logy. We also describe best practices for achieving optimal performance with RAxML-NG, inparticular, with respect to parallel tree inferences on computer clusters and supercomputers. AsRAxML-NG is continuously updated, the most up-to-date version of the tutorial described inthis chapter is available online at: https://cme.h-its.org/exelixis/raxml-ng/tutorial .

The challenge of this work is to re-define the concept of intelligent agent as a building block of social networks by presenting it as a physical particle with additional non-Newtonian properties. The proposed model of an intelligent agent described by a system of ODE coupled with their Liouville equation has been introduced and discussed. Following the Madelung equation that belongs to this class, non-Newtonian properties such as superposition, entanglement, and probability interference typical for quantum systems have been described. Special attention was paid to the capability to violate the second law of thermodynamics, which makes these systems neither Newtonian, nor quantum. It has been shown that the proposed model can be linked to mathematical models of livings as well as to models of AI. The model is presented in two modifications. The first one is illustrated by the discovery of a stochastic attractor approached by the social network; as an application, it was demonstrated that any statistics can be represented by an attractor of the solution to the corresponding system of ODE coupled with its Liouville equation. It was emphasized that evolution to the attractor reveals possible micro-mechanisms driving random events to the final distribution of the corresponding statistical law. Special attention is concentrated upon the power law and its dynamical interpretation: it is demonstrated that the underlying micro- dynamics supports a “violent reputation” of the power-law statistics. The second modification of the model of social network associated with a decision-making process and applied to solution of NP-complete problems known as being unsolvable neither by classical nor by quantum algorithms. The approach is illustrated by solving a search in unsorted database in polynomial time by resonance between external force representing the address of a required item and the response representing the location of this item.

Hash tables are widely used. They rely on good quality hash functions. Popular data structure libraries either provide no hash functions or weak hash functions for sets or maps, making it impossible or impractical to use them as keys in other tables. This article presents three algorithms for hashing a set, two of which are simple to implement, practically fast, and can be combined. The quality evaluations follow the method of [1, chapter 2]. The insight that we are looking for commutative semigroups suggests that even better methods than symmetric polynomials may be found.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we looked at the duality of resource allocation problems. First, we chose a real world optimization problem and looked at its solution with linear programming. Then, we restudied this problem with a quantum algorithm in order to understand whether if there is a speedup of the solution. The improvement in computation is analysed and some interesting results are reported.

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

In recent years, wireless networks have undoubtedly become a convenient way to connect to the Internet and provide connection to everyone in any corner of the world. In fact, in this era, people are connected to the internet almost everyday and wireless networks give us this privilege in a seamless manner. A wireless network normally consists of access points and nodes where the access points are responsible to amplify the wireless signals, while the nodes are the gadgets that are receiving these signals. However, with such great convenience provided, many challenges are also faced by the users and stakeholders. With no physical connection to devices, wireless networks are evidently more vulnerable to invisible cyber attacks. In this research paper, it the security issues that cause issues in the wireless networks are discussed. Furthermore, an analytical review of privacy challenges found in these networks is performed; these challenges are segregated into security issues and privacy issues. The paper will then present the methods used in conducting a survey and gathering the research results along with further discussion on the results obtained through this study. Finally, a suitable solution is proposed to prevent and overcome the intrusions faced in terms of security and privacy in wireless network scenarios through detection and response mechanism for mitigation of the problems.

The use of Learning Management Systems (LMS) has had a rapid growth over the last decades. Great efforts have been recently made to assess the level of performance of the students online due to the COVID-19 pandemic. Faculty members with limited experience in the use of LMS such as Moodle, Edmodo, MOOC, Blackboard and Google Classroom can have some problems creat-ing online tests. In this work, a new plugin for Moodle is presented: FastTest PlugIn. This plugin is based on a Microsoft® Excel spreadsheet and it can be used to export questions to Moodle. Us-ers of FastTest PlugIn can create question pools in an easy and intuitive way. A literature review about plugins used to import/export questions in Moodle is carried out. Then, the characteristics of FastTest PlugIn are presented. At the end, the characteristics of the main plugins found in the literature are discussed and compared with the ones of FastTest PlugIn.

Security has become a critical issue in today’s highly distributed and networked systems. Network intrusion detection systems (NIDSs), especially signature-based NIDSs, are being widely deployed in a distributed network environment with the purpose of defending against a variety of network attacks. Most of the commercially available NIDSs are software based and rely on pattern matching to extract the threat from network traffic. The increase in network speed and traffic may make existing algorithms to become a performance bottleneck. Therefore it is very necessary to develop faster and more efficient pattern matching algorithm in order to overcome the troubles on performance of NIDSs. Therefore, we propose a multi fusion pattern matching algorithm for Network Intrusion Detection Systems. The results obtained in percentages from the proposed fusion algorithm given better values in terms processing time in milliseconds than the existing algorithms when data English text are applied to evaluate the fusion performances.

Sports video analysis is an interesting and emerging field in the domain of computer vision. It has become a very popular subject among scholars all over the world in the last decade due to the need of automated classification of events such as offsides, in/out situations, goals and so on. The most important problem in sports video analysis is detection and tracking of ball and players. Extraction of court lines is also another important problem since it is necessary in the classification of aforementioned events. In this study, considering some of the previous work on the subject, we develop a method for tracking the ball and players in tennis videos where the camera position and orientation is supposed fixed.

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

Deep neural networks (DNNs) have made a huge impact in the field of machine learning by providing unbeatable humanlike performance to solve real-world problems such as image processing and natural language processing (NLP). Convolutional neural network (CNN) and recurrent neural network (RNN) are two typical architectures that are widely used to solve such problems. Time sequence-dependent problems are generally very challenging, and RNN architectures have made an enormous improvement in a wide range of machine learning problems with sequential input involved. In this paper, different types of RNN architectures are compared. Special focus is put on two well-known gated-RNN’s Long Term Short Memory (LSTM) and Gated Recurrent Unit (GRU). We evaluated these models on the task of force estimation system in pouring. In this study, four different models including multi-layers LSTM, multi-layers GRU, single-layer LSTM and single-layer GRU) were created and trained. The result suggests that multi-layer GRU outperformed other three models.

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

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

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

The COVID-19 outbreak has focused attention on the use of social distancing as the primary defence against community infection, yet forcing social animals to maintain that physical distance has presented significant challenges for health authorities and law enforcement. Anecdotal media reports suggest widespread dissatisfaction with social distancing as a policy, yet there is little prior work aimed at measuring community acceptance of social distancing. In this paper, we propose a new approach to measuring attitudes towards social distancing by using social media and sentiment analysis. Over a 4 month period, we found 82.5% of tweets were in favour of social distancing. The results indicate a widespread acceptance of social distancing in the community. We conclude by examining options for estimating the optimal (minimal) social distance required at scale, and the implications for securing widespread community support and acceptance of public health messaging.

Indonesia is among the countries developing the concept of smart city. The national government envisions Indonesia 2030 which shall implement the smart city towards sustainable development. Many regions in Indonesia have already implemented the concept of smart city, but still on the level of smart government and smart technology, lacking on the smart citizen component of a smart city. This paper aims to analyze the citizens behavior of using technology on Sleman smart citizen 2021 through the lapor sleman mobile application. This research uses mixed method of quantitative and qualitative approaches in examining the data. The authors distributed 100 questionares and conducted interviews to the government which is department of communication and information, Sleman and the several community that ever use the lapor sleman application. The result of the study reveals the following: firstly, performance expectancy, social influence, and behavioral intention are three independent variables which affect the users’ behavior. Secondly, the behavioral intention has the biggest significant effect on users’ behavior. Thirdly, the citizen behavior of using technology has affect the making a smart citizen. Therefore, using technology in term of lapor sleman mobile application can make the citizens as active participants in public life, in terms of social cooperation, freedom of expression and flexibility. However, there are still many problems in the use of lapor sleman mobile application such as the limited access to only android smartphones, lack of technical know-how, and people’s reluctance to use the lapor sleman mobile application.

Motion related human activity recognition using wearable sensors can potentially enable various useful daily applications. So far, most studies view it as a stand-alone mathematical classification problem without considering the physical nature of human motions. Consequently, they suffer from data dependencies and encounter the dimension disaster problem and the over-fitting issue, and their models are never human-readable. In this study, we start from a deep analysis on natural physical properties of human motions, and then propose a useful feature selection method to quantify each feature's classification contribution capability. On one hand, the "dimension disaster" problem can be avoid to some extent, due to the affined dimension of key features; On the other hand, over-fitting issue can be depressed since the knowledge implied in human motions are nearly invariant, which compensates the possible data inadequacy. The experiment results indicate that the proposed method performs superior to those adopted in related works, such as decision tree, k-NN, SVM, neural networks.

Identifying the total number of fruits on trees has long been of interest in agricultural crop estimation work. Yield prediction of fruits in practical environment is one of the hard and significant tasks to obtain better results in crop management system to achieve more productivity with regard to moderate cost. Utilized color vision in machine vision system to identify citrus fruits, and estimated yield information of the citrus grove in-real time. Fruit recognition algorithms based on color features to estimate the number of fruit. In the current research work, some low complexity and efficient image analysis approach was proposed to count yield fruits image in the natural scene. Semi automatic segmentation and yield calculation of fruit based on shape analysis is presented. Color and shape analysis was utilized to segment the images of different fruits like apple, pomegranate obtained under different lighting conditions. First the input sectional tree image was converted from RGB colour space into the colour space transform (i.e., YUV, YIQ, or YCbCr). The resultant image was then applied to the algorithm for fruit segmentation. After it is applied Morphological Operations which is enhanced image then execute Blob counting method which identify the object and count the number of it. Accuracy of this algorithm used in this thesis is 82.21% for images that have been scanned.

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

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

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

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.

A reliable Electronic Voting Machine (EVM) is proposed and implemented in this study, which is integrated with a biometric fingerprint scanner to ensure a secure election process. This biometric EVM includes features such as an interactive user interface, hack-free design and master lock. The EVM system has the capability of registering user data and storing them in a database through proper authentication. Moreover, the system proposed lowers the requirement for human resources. This paper provides a detailed description of the systematic development of the hardware and software used. The software part includes algorithm development and implementation. A thorough and in-depth understanding of the data and the communication protocols along with the pathways used for storage of data in the devices is provided. Additionally, the cost of the system is 62.82% less than the officially existing EVM machines of India. Furthermore, this study seeks to demonstrate the benefits of such an approach from a technological and a social standpoint.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.

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

Most computer keyboard layouts (mappings of characters to keys) do not reflect the ergonomics of the human hand, resulting in preventable repetitive strain injuries. We present a set of ergonomics principles relevant to touch typing, introduce a scoring model that encodes these principles, and outline a systematic approach for developing optimized keyboard layouts in any language based on this scoring model coupled with character-pair frequencies. We then create a keyboard layout optimized for touch typing in English by constraining key assignments to reduce lateral finger movements and enforce easy access to high-frequency letters and letter pairs, applying open source software to generate millions of layouts, and evaluating them based on Google’s N-gram data. We use two independent scoring methods to compare the resulting Engram layout against 10 other prominent keyboard layouts based on a variety of publicly available text sources. The Engram layout scores consistently higher than other keyboard layouts.

Depth-sensing technology has led to broad applications of inexpensive depth cameras that can capture human motion and scenes in 3D space. Background subtraction algorithms can be improved by fusing color and depth cues, thereby allowing many issues encountered in classical color segmentation to be solved. In this paper, we propose a new fusion method that combines depth and color information for foreground segmentation based on an advanced color-based algorithm. First, a background model and a depth model are developed. Then, based on these models, we propose a new updating strategy that can eliminate ghosting and black shadows almost completely. Extensive experiments have been performed to compare the proposed algorithm with other, conventional RGB-D algorithms. The experimental results suggest that our method extracts foregrounds with higher effectiveness and efficiency.

The anti-money laundering (AML) process has failed both in identifying suspicious cases in due time as in assisting the AML analysts in decision making. Starting from a new generic anti-fraud approach, this article presents the main aspects related to the development of a multi-agent system that goes beyond the capture of suspicious transactions, seeking to assist the human expert in the analysis of suspicious behaviour. First, a transactional behavioural profile of clients is obtained in a data mining process. A set of rules, obtained through data mining over a real database, in conjunction with specific rules based on legal aspects and in the expertise of the AML analysts make up the agents' knowledge base. The cases for which the system was unable to suggest a decision are flagged as requiring more detailed analysis. The system analysed 6 months of real transactions and indicated several suspicious profiles, a set of these suspects was investigated by the AML analysts who proved the suspicion of several cases, including some that had not been identified by the systems in execution.

The focus of this research is to analyze the results of encrypting audio using various authenticated encryption algorithms implemented in the Python cryptography library for ensuring authenticity and confidentiality of the original contents. The Advanced Encryption Standard (AES) is used as the underlying cryptographic primitive in conjunction with various modes including Galois Counter Mode (GCM), Counter with Cipher Block Chaining Message Authentication Code (CCM), and Cipher Block Chaining (CBC) with Keyed-Hashing for encrypting a relatively small audio file. The resulting encrypted audio shows similarity in the variance when encrypting using AES-GCM and AES-CCM. There is a noticeable reduction in variance of the performed encodings and an increase in the amount of time it takes to encrypt and decrypt the same audio file using AES-CBC with Keyed-Hashing. In addition, the corresponding encrypted using this mode audio spans a longer duration. As a result, AES should either have GCM or CCM for an efficient and reliable authenticated encryption integration within a workflow.

The optimization of guide vane closing schemes (OGVCS) of pumped storage hydro unit (PSHU) is the research field of cooperative control and optimal operation of pumped storage, wind power and solar power generation. This paper presents a OGVCS model of PSHU considering the rise rate of the unit rotational speed and the specific node pressure of each hydraulic unit, as well as various complicated hydraulic and mechanical constraints. OGVCS model is formulated as a multi-objective optimization problem to optimize conflictive objectives, i.e., unit rotational speed and water hammer pressure criteria. In order to realize the efficient solution of the OGVCS model, an enhanced multi-objective bacterial-foraging chemotaxis gravitational search algorithm (EMOBCGSA) is proposed to solve this problem, which adopts population reconstruction, adaptive selection chemotaxis operator of local searching strategy and Elite archive set to efficiently solve the multi-objective problem. Especially, novel constraints-handling strategy with eliminating and local search based on violation ranking is used to balance various hydraulic and mechanical constraints. Finally, simulation cases of complex extreme operating conditions (i.e., load rejection and pump outage) of ‘single tube-double units’ type PSHU system are conducted to verify the feasibility and effectiveness of the proposed EMOBCGSA in solving OGVCS problem. The simulation results indicate that the proposed EMOBCGSA can provide lower rise rate of the unit rotational speed and smaller water hammer pressure than other method established recently while considering various complex constraints in OGVCS problem.

An application of deep convolutional neural network and recurrence plot for financial market movement prediction is presented. Though it is challenging and subjective to interpret its information, the pattern formed by a recurrence plot provide a useful insight into the dy- namical system. We used a recurrence plot of seven financial time series to train a deep neural network for financial market movement predic- tion. Our approach is tested on our dataset and achieved an average of 53.25% classification accuracy. The result suggests that a well trained deep convolutional neural network can learn a recurrence plot and pre- dict a financial market direction.

Context: Code smells are associated with poor design and programming style that often degrades code quality and hampers code comprehensibility and maintainability. Goal: Identify reports from the literature that provide evidence of the influence of code smells on the occurrence of software bugs. Method: We conducted a Systematic Literature Review (SLR) to reach the~stated goal. Results: The SLR includes selected studies from July 2007 to September 2017 which analyzed the source code for open source and proprietary projects, as well, as several code smells and anti-patterns. The results of this SLR show that 24 code smells are more influential in the occurrence of bugs according to 16 studies. In contrast, three studies reported that at least 6 code smells are less influential in such occurrences. Evidence from the selected studies also point out tools, techniques and procedures applied to analyze the influence. Conclusion: To the best of our knowledge, this is the first SLR to target this goal. This study provides an up-to-date and structured understanding of the influence of code smells on the occurrence of software bugs based on findings systematically collected from a list of relevant references in the latest decade.

Facial expression has lots of applications in human-computer interaction. Although feature extraction and selection have been well studied, the specificity of each expression variation is not fully explored in state-of-the-art works. In this work, the problem of multiclass expression recognition is converted into triplet-wise expression recognition. For each expression triplet, a new feature optimization model based on Action Unit (AU) weighting and patch weight optimization is proposed to represent the specificity of the expression triplet. Sparse representation based approach is then proposed to detect the active AUs of testing sample for better generalization. The algorithm achieved competitive accuracies of 89.67% and 94.09% for Jaffe and CK+ databases, respectively. Better cross-database performance has also been observed.

Layout estimation is a challenge of segmenting a cluttered room image into floor, walls and ceiling. We applied Double refinement network proved to be efficient in the depth estimation to generate heat maps for room key points and edges. Our method is the first not using encoder-decoder architecture for the room layout estimation. ResNet50 was utilized as a backbone for the network instead of VGG16 commonly used for the task, allowing the network to be more compact and faster. We designed a special layout score function and layout ranking algorithm for key points and edges output. Our method achieved the lowest pixel and corner errors on the LSUN data set. The input image resolution is 224*224.

Megacities are complex systems facing the challenges of overpopulation, poor urban design and planning, poor mobility and public transport, poor governance, climate change issues, poor sewerage and water infrastructure, waste and health issues, and unemployment. Smart cities have emerged to address these challenges by making the best use of space and resources for the benefit of citizens. A smart city model views the city as a complex adaptive system consisting of services, resources, and citizens that learn through interaction and change in both the spatial and temporal domains. The characteristics of dynamic development and complexity are key issues for city planners that require a new systematic and modeling approach. Multiscale modeling (MM) is an approach that can be used to better understand complex adaptive systems. The MM aims to solve complex problems at different scales, i.e., micro, meso, and macro, to improve system efficiency and mitigate computational complexity and cost. In this paper, we present an overview of MM in smart cities. First, this study discusses megacities, their current challenges, and their emergence to smart cities. Then, we discuss the need of MM in smart cities and its emerging applications. Finally, the study highlights current challenges and future directions related to MM in smart cities, which provide a roadmap for the optimized operation of smart city systems.

Quantum Computers are provisioned as very high performance computers using quantum mechanical aspects for information processing. Quantum Information Theory and Quantum Computing topics are popular topics in academia aiming the construction of theoretical background of Quantum Computers. The information processing units for Quantum Computers are defined as qubits but for some problems three level (trinary) systems may be applied as well. We call these three level systems as qutrits. The scope of this work is the analysis of well-defined entanglement measures Negativity and Relative Entropy of Entanglement (REE) for two qutrit (3- level/trinary) quantum systems. In this manner, for randomly generated 1000 two qutrit and 1000 two qubit states the mentioned measures are calculated and these values are compared. These comparisons are analyzed and for quantum state ordering problem, some interesting results are reported.

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

Given a stream of depth images with a known cuboid reference object present in the scene, we propose a novel approach for accurate camera tracking and volumetric surface reconstruction in real-time. Our contribution in this paper is threefold: (a) utilizing a priori knowledge of the cuboid reference object, we keep drift-free camera tracking without explicit global optimization; (b) we improve the fineness of the volumetric surface representation by proposing a prediction-corrected data fusion strategy rather than simple moving average, which enables accurate reconstruction of high-frequency details such as sharp edges of objects and geometries of high curvature; (c) we introduce a benchmark dataset CU3D containing both synthetic and real-world scanning sequences with ground-truth camera trajectories and surface models for quantitative evaluation of 3D reconstruction algorithms. We test our algorithm on our dataset and demonstrate its accuracy compared with other state-of-the-art algorithms. We release both our dataset and code as opensource1 for other researchers to reproduce and verify our results.

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

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

Non-invasive, electroencephalography (EEG)-based brain-computer interfaces (BCIs) on motor imagery movements translate the subject’s motor intention into control signals through classifying the EEG patterns caused by different imagination tasks, e.g. hand movements. This type of BCI has been widely studied and used as an alternative mode of communication and environmental control for disabled patients, such as those suffering from a brainstem stroke or a spinal cord injury (SCI). Notwithstanding the success of traditional machine learning methods in classifying EEG signals, these methods still rely on hand-crafted features. The extraction of such features is a difficult task due to the high non-stationarity of EEG signals, which is a major cause for the stagnating progress in classification performance. Remarkable advances in deep learning methods allow end-to-end learning without any feature engineering, which could benefit BCI motor imagery applications. We developed three deep learning models: 1) a long short-term memory (LSTM); 2) a proposed spectrogram-based convolutional neural network model (pCNN); and 3) a recurrent convolutional neural network (RCNN), for decoding motor imagery movements directly from raw EEG signals without (manual) feature engineering. Results were evaluated on our own, publicly available, EEG data collected from 20 subjects and on an existing dataset known as 2b EEG dataset from "BCI Competition IV". Overall, better classification performance was achieved with deep learning models compared to state-of-the art machine learning techniques, which could chart a route ahead for developing new robust techniques for EEG signal decoding. We underpin this point by demonstrating the successful real-time control of a robotic arm using our CNN based BCI.

Real-time strategy (RTS) game has proposed many challenges for AI research for its large state spaces, enormous branch factors, limited decision time and dynamic adversarial environment. To tackle above problems, the method called Adversarial Hierarchical Task Network planning (AHTN) has been proposed and achieves favorable performance. However, the HTN description it used cannot express complex relationships among tasks and impacts of environment on tasks. Moreover, the AHTN cannot handle task failures during plan execution. In this paper, we propose a modified AHTN planning algorithm named AHTNR. The algorithm introduces three elements essential task, phase and exit condition to extend the HTN description. To deal with possible task failures, the AHTNR first uses the extended HTN description to identify failed tasks. And then a novel task repair strategy is proposed based on historical information to maintain the validity of previous plan. Finally, empirical results are presented for the μRTS game, comparing AHTNR to the state-of-the-art search algorithms for RTS games.

P versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States National Security Agency. However, a precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is NP-complete. It is well-known that P is equal to NP under the assumption of the existence of a polynomial time algorithm for some NP-complete. We show that the Monotone Weighted Xor 2-satisfiability problem (MWX2SAT) is NP-complete and P at the same time. Certainly, we make a polynomial time reduction from every directed graph and positive integer k in the K-CLOSURE problem to an instance of MWX2SAT. In this way, we show that MWX2SAT is also an NP-complete problem. Moreover, we create and implement a polynomial time algorithm which decides the instances of MWX2SAT. Consequently, we prove that P = NP.

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

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.

Infectious diseases, as COVID-19 is proving, pose a global health threat in an interconnected world. In the last 20 years, resistant infectious diseases such as SARS, MERS, H1N1, Ebola, Zika and now COVID-19 have been impacting global health defences, and aggressively flourishing within the rise of global travel, urbanization, climate change and ecological degradation. In parallel, this extraordinary episode in global human health highlights the potential for artificial intelligence (AI)-enabled disease surveillance to collect and analyse vast amounts of unstructured and real-time data to inform epidemiological and public health emergency responses. The uses of AI in these dynamic environments are increasingly complex, challenging the potential for human autonomous decisions. In this context, our study of qualitative perspectives will consider a responsible AI framework to explore its potential application to disease surveillance in a global health context. Thus far, there is a gap in the literature in considering these multiple and interconnected levels of disease surveillance and emergency health management through the lens of a responsible AI framework.

The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

In this paper, a new approach to retrieve semantic images based on shape and geometric features of image in conjunction with multi-class support vector machine is proposed. Zernike moment as shape feature is to verify the invariance of objects for silhouette image. In addition, a set of geometrical features is to explore the objects shape using two features of rectangularity and circularity. Then the extracted features are normalized and employed for multi-class support vector machine either for learning or retrieving processes. The retrieving process relies on three main tasks which namely Query Engine, Matching Module and Ontology Manger, respectively. Query Engine is to build the input text or image query using SPARQL language. The matching module extracts the shape and geometric features of image’s objects and employ them to Ontology Manger which in turn inserts them in ontology knowledge base. Benchmark mammals have been conducted to empirically conclude the outcome of proposed approach. Our experiment on text and image retrieval yields efficient results to problematic phenomena than previously reported.

Ontology is a formalized representation of the problem area (PrA). Representation of the PrA in the form of an domain ontology is often used in the process of development of intelligent software systems and used as a knowledge base. The process of building an ontology is complex and requires an expert in the PrA. A large number of researchers are working to solve this problem. The basis of our approach is the use of a pipeline of different linguistic methods of text analysis. The set of rules developed by us is used to build an ontology based on the content analysis of a text resource. This article describes the method of building a domain ontology based on the linguistic analysis of content of text resources, presents an example of the proposed approach, and also presents the architecture of our pipeline.

Continuous object tracking in WSNs, such as monitoring of mud-rock flows, forest fires etc., is a challenging task due to characteristic nature of continuous objects. They can appear randomly in the network field, move continuously, and can change in size and shape. Monitoring such objects in real-time generally require tremendous amount of messaging between sensor nodes to synergistically estimate object’s movement and track its location. In this paper, we propose a novel twofold-sink mechanism, comprising of a mobile and a static sink node. Both sink nodes gather information about boundary sensor nodes, which is then used to uniformly distribute energy consumption across all network nodes, thus helping in saving residual energy of network nodes. Numerous object tracking schemes, using mobile sink, have been proposed in the literature. However, existing schemes employing mobile sink cannot be applied to track continuous objects, because of momentous variation of network topology. Therefore, we present in this paper a mechanism, transformed from K-means algorithm, to find the best sensing location of the mobile sink node. It helps to reduce transmission load on the intermediate network nodes situated between static sink node and the ordinary network sensing nodes. The simulation results show that the proposed scheme can distinctly improve life time of the network, compared to one-sink protocol employed in continuous object tracking.

AI research and implementations are growing, and so are the risks associated with AI (Artificial Intelligence) developments, especially when it’s difficult to understand exactly what they do and how they work, both at a localized level, and at deployment, in particular when distributed and on a large scale. Governments are pouring massive funding to promote AI research and education, yet research results and claims, as well as the effectiveness of educational programmes, can be difficult to evaluate given the limited reproducibility of computations based on ML (machine learning) and poor explainability, which in turn limits the accountability of the systems and can cause cascading systemic problems and challenges including poor reproducibility, reliability, and overall lack of trustworthiness. This paper addresses some of the issues in Knowledge Representation for AI at system level, identifies a number of knowledge gaps and epistemological challenges as root causes of risks and challenges for AI, and proposes that neurosymbolic and hybrid KR approaches can serve as mechanisms to address some of the challenges. The paper concludes with a postulate and points to related and future research

The digital society is an outcome of the Internet which has nearly made everything connected and accessible no matter where or when. Nevertheless, despite the fact that conventional IP networks are complicated and very hard to manage, they are still widely adopted. The already established policies make the network configuration/reconfiguration a complex process that reacts to errors, load, and modifications. The prevailing networks are vertically integrated which makes things more and more complicated: Data planes and control are strapped together. Software-defined networking is a model that is meant to solve this issue by splitting the vertical integration and detaching the network’s control logic from the implicit routers and switches; this could be achieved by reinforcing centralization of network control and making the network programmable. In this work, we worked to implement MPLS networks with SDN, to enhance the traffic engineering over the network, and to minimize the network delay and latency, with minimum cost using three of the different SDN networks. The experiment results showed the advantage of the proposed approach for reducing the network delay, comparing with previous studies. Where the average of network delay in our approach reaches to 3.01 milliseconds.

This paper aims to develop a low-cost, high-performance and high-reliability computing system to process large-scale data using common data mining algorithms in the Internet of Things computing. Considering the characteristics of IoT data processing, similar to mainstream high performance computing, we use a GPU cluster to achieve better IoT services. Firstly, we present an energy consumption calculation method (ECCM) based on WSN. Then, using the CUDA Programming model, we propose a Two-level Parallel Optimization Model (TLPOM) which exploits reasonable resource planning and common compiler optimization techniques to obtain the best blocks and threads configuration considering the resource constraints of each node. The key to this part is dynamic coupling Thread-Level Parallelism (TLP) and Instruction-Level Parallelism (ILP) to improve the performance of the algorithms without additional energy consumption. Finally, combining the ECCM and the TLPOM, we use the Reliable GPU Cluster Architecture (RGCA) to obtain a high-reliability computing system considering the nodes’ diversity, algorithm characteristics, etc. The results show that the performance of the algorithms significantly increased by 34.1%, 33.96% and 24.07% for Fermi, Kepler and Maxwell on average with TLPOM and the RGCA ensures that our IoT computing system provides low-cost and high-reliability services.

With the development of IoT technology, various information resources, such as social resources and physical resources, are deeply integrated for different comprehensive applications. Social networking, car networking, medical services, video surveillance and other forms of IoT information Service model gradually change people's daily life. Facing the vast amounts of IoT information data, IoT search technology is used to quickly find accurate information to meet real-time search needs of users. However, IoT search requires to use a large number of user privacy Information, such as personal health information, location information, social relations information, to provide personalized services. User privacy information will meet security problems if an effective access control mechanism is missing during the IoT search process. Access control mechanism can effectively monitor the access activities of resources, and ensure authorized users to access information resources under legitimate conditions. This survey examines the growing literature on access control for IoT search. Problems and challenges of access control mechanism are analyzed to facilitate the adoption of access control solutions in real-life settings. This paper aims to provides theoretical, methodological and technical guidance for IoT search access control mechanism in large-scale dynamic heterogeneous environment. Based on the literature study, we also analyzed future development direction of access control in the age of IoT.

The recent worldwide outbreak of the novel corona-virus (COVID-19) opened up new challenges to the research community. Artificial intelligence (AI) driven methods can be useful to predict the parameters, risks, and effects of such an epidemic. Such predictions can be helpful to control and prevent the spread of such diseases. The main challenges of applying AI is the small volume of data and the uncertain nature. Here, we propose a shallow Long short-term memory (LSTM) based neural network to predict the risk category of a country. We have used a Bayesian optimization framework to optimized and automatically design country-specific networks. We have combined the trend data and weather data together for the prediction. The results show that the proposed pipeline outperforms against state-of-the-art methods for 170 countries data and can be a useful tool for such risk categorization. The tool can be used to predict long-duration outbreak of such an epidemic such that we can take preventive steps earlier.

Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical counterparts. For example, Shor’s factorization algorithm, Grover’s search algorithm, quantum Fourrier transformation, etc. Entanglement, is the theoretical basis providing the expected speedups. It can be view in bipartite or multipartite forms. In order to quantify entanglement, some measures are defined. On the other hand, a general and accepted criterion, which can measure the amount of entanglement of multilateral systems, has not yet been found. In this work, we make a short review of recent research on the topic entanglement monotones and measures with an analitical approach.

Many clinical research datasets have a large percentage of missing values that directly impacts their usefulness in yielding high accuracy classifiers when used for training in supervised machine learning. While missing value imputation methods have been shown to work well with smaller percentages of missing values, their ability to impute sparse clinical research data can be problem specific. We previously attempted to learn quantitative guidelines for ordering cardiac magnetic resonance imaging during the evaluation for pediatric cardiomyopathy, but missing data significantly reduced our usable sample size. In this work, we sought to determine if increasing the usable sample size through imputation would allow us to learn better guidelines. We first review several machine learning methods for estimating missing data. Then, we apply four popular methods (mean imputation, decision tree, k-nearest neighbors, and self-organizing maps) to a clinical research dataset of pediatric patients undergoing evaluation for cardiomyopathy. Using Bayesian Rule Learning (BRL) to learn ruleset models, we compared the performance of imputation-augmented models versus unaugmented models. We found that all four imputation-augmented models performed similarly to unaugmented models. While imputation did not improve performance, it did provide evidence for the robustness of our learned models.

Over the past decades, overweight and obesity has become a global epidemic and the leading threat for death. To prevent the serious risk, an overweight or obese individual must apply a long-term weight-management strategy to control food intake and physical activities, which is however, not easy. Recently, with the advances of information technology, more and more people can use wearable devices and smartphones to obtain physical activity information, while they can also access various health-related information from Internet online social networks (OSNs). Nevertheless, there is a lack of an integrated approach that can combine these two methods in an efficient way. In this paper, we address this issue and propose a novel mobile-social framework for health recognition and recommendation, namely, H-Rec². The main ideas of H-Rec² include (1) to recognize the individual's health status using smartphone as a general platform, and (2) to recommend physical activity and food intake based on personal health information, life science principles, and health-related information obtained from OSNs. To demonstrate the potentials of the H-Rec² framework, we develop a prototype that consists of four important components: (1) an activity recognition module that senses physical activity using accelerometer, (2) a health status modeling module that applies a novel algorithm to generate personalized health status index, (3) a restaurant information collection module that collects relevant information from OSN, and (4) a restaurant recommendation module that provides personalized and context-aware recommendation. To evaluate the prototype, we conduct both objective and subjective experiments, which confirm the performance and effectiveness of the proposed system.

We employ the solution concept of ex post Nash equilibrium to predict the interaction of a finite number of agents competing in a finite number of basic games simultaneously. The competition is called a multi-game. For each agent, a specific weight, considered as private information, is allocated to each basic game representing its investment in that game and the utility of each agent for any strategy profile is the weighted sum, i.e., convex combination, of its utilities in the basic games. Multi-games can model decision making in multi-environments in a variety of circumstances, including decision making in multi-markets and decision making when there are both material and social utilities for agents as, we propose, in the Prisoner's Dilemma and the Trust Game. Given a set of pure Nash equilibria, one for each basic game in a multi-game, we construct a pure Bayesian Nash equilibrium for the multi-game. We then focus on the class of so-called uniform multi-games in which each agent is constrained to play in all games the same strategy from an action set consisting of a best response per game. Uniform multi-games are equivalent to multi-dimensional Bayesian games where the type of each agent is a finite dimensional vector with non-negative components. A notion of pure type-regularity for uniform multi-games is developed and it is shown that a multi-game that is pure type-regular on the boundary of its type space has a pure ex post Nash equilibrium which is computed in constant time with respect to the number of the types and is independent of prior probability distributions. We then develop an algorithm, linear in the number of types of the agents, which tests if a multi-game is pure type-regular on the boundary of its type space in which case it returns a pure ex post Nash equilibrium for the multi-game.

Efficiently solving the problem of computing, in a distributed fashion, the shortest paths of a graph whose topology dynamically changes over time is a core functionality of many today’s digital infrastructures, probably the most prominent example being communication networks. Many solutions have been proposed over the years for this problem that can be broadly classified into two categories, namely Distance-Vector and Link-State algorithms. Distance-Vector algorithms are widely adopted solutions when scalability and reliability are key issues or when nodes have either limited hardware resources, as they result in being very competitive approaches in terms of both the memory and the computational point of view. In this paper, we first survey some of the most established solutions of the Distance-Vector category. Then, we discuss some recent algorithmic developments in this area. Finally, we propose a new experimental study, conducted on a prominent category of network instances, namely generalized linear preference (GLP) power-law networks, to rank the performance of such solutions.

We examined a series of real-world, pictorial photographs with varying characteristics, along with their modification by noise addition and unsharp masking. As response metrics we used three different versions of the aesthetic measure originally proposed by Birkhoff. The first aesthetic measure, which has been used in other studies, and which we used in our previous work as well, showed a preference for the least complex of the images. It provided no justification for noise addition, but did reveal enhancement on unsharp masking. Optimum level of unsharp masking varied with the image, but was predictable from the individual image’s GIF compressibility. We expect this result to be useful for guiding the processing of pictorial photographic imagery. The second aesthetic measure, that of informational aesthetics based on entropy alone failed to provide useful discrimination among the images or the conditions of their modification. A third measure, derived from the concepts of entropy maximization, as well as the hypothesized preference of observers for “simpler”, i.e., more compressible, images, yielded qualitatively the same results as the more traditional version of the measure. Differences among the photographs and the conditions of their modification were more clearly defined with this metric, however.

Development of early math skills is linked to future success in mathematics and other academics. Educational videogames have been shown to promote academic achievement; however, few rigorous studies have evaluated the use of educational videogames in supporting math development, especially in early primary education. In the current study, an open-label randomized controlled trial was conducted involving 134 first grade students to determine, using standardized assessments, the impact of the educational mathematics tablet-based videogame, Knowledge Battle, on math scores and self-competency. Overall, Knowledge Battle did improve math skills in participants who played the game. Among those with lower pre-game math skills, the Knowledge Battle group’s mean math score increased more than the control group’s mean math score (9.7 vs. 6.0; p=0.02). There was no association between perceived sense of self-competency and total math score (p=0.8141). However, players who had a higher sense of self-competency were more likely to enjoy playing the game. In conclusion, our findings suggest that Knowledge Battle was an acceptable and enjoyable educational mathematical videogame for first grade students, and may be most impactful for those with low math skills.

A monocular vision pose estimation and identification algorithm used on a small spacecraft for future orbital servicing is studied in this paper. A tracker spacecraft equipped with a short-range vision system is proposed to recover the 3D structural model of a space target in orbit and automatically identify its solar panels and main body using only visual information from an onboard camera. The proposed reconstruction and identification framework is tested using structure-from-motion and point cloud identification methods. The Efficient Perspective-n-Points (EPnP) descriptor is used for pose estimation. Triangulated points are used for component segmentation by means of orientation histogram descriptors. Experimental results based on laboratory images of a spacecraft model show the effectiveness and robustness of our approach.

Broadcasting a message from one to many processors in a network corresponds to concurrent reading on a random access shared memory parallel machine. Computing the trees of a forest, the level of each node in its tree and the path between two nodes are problems that can easily be solved with concurrent reading in a time logarithmic in the maximum height of a tree. Solving such problems with exclusive reading requires a time logarithmic in the number of nodes, implying message passing between disjoint pairs of processors on a distributed system. Allowing concurrent reading in parallel algorithm design for distributed computing might be advantageous in practice if these problems are faced on shallow trees with some specific constraints. We show an application to LZC-compressed file decoding, whose parallelization employs these computations on such trees for realistic data. On the other hand, zipped files do not have such advantage since they are compressed by the Lempel-Ziv sliding window technique.

Breast Cancer diagnosis is one of the most studied problems in the medical domain. In the medical domain, cancer diagnosis has been studied extensively which instantiates the need of early prediction of cancer disease. For obtaining advance prediction, health records are exploited and given as input to an automated system. This paper focuses on constructing an automated system by employing deep learning based recurrent neural network models. A stacked GRU-LSTM-BRNN is proposed in this paper that accepts health records of a patient for determining possibility of being affected by breast cancer. Proposed model is compared against other baseline classifiers such as stacked Simple-RNN model, stacked LSTM-RNN model, stacked GRU-RNN model. Comparative results obtained in this study indicate that stacked GRU-LSTM-BRNN yield better classification performance for predictions related to breast cancer disease.

The violation of Bell's theorem is a very simple way to see that there is no underlying classical interpretation of quantum mechanics. The measurements made on the photons shows that light signal (information) could travel between them, hence completely eliminating any chance that the result was due to anything other than entanglement. Entanglement has been studied extensively for understanding the mysteries of non-classical correlations between quantum systems. It was found that violation of Bell's inequalities could be trivially calculated and for sets of nonmaximally entangled states of two qubits, comparing these entanglement measures may lead to different entanglement orderings of the states. On the other hand, although it is not an entanglement measure and not monotonic under local operations, due to its ability of detecting multipartite entanglement, quantum Fisher information (QFI) has recently received an intense attraction generally with entanglement in the focus. In this work, we visit violation of Bell's inequalities problem with a different approach. Generating a thousand random quantum states and performing an optimization based on local general rotations of each qubit, we calculate the maximal QFI for each state. We analyze the maximized QFI in comparison with violation in Bell's inequalities and we make similar comparison of this violation with commonly studied entanglement measures, negativity and relative entropy of entanglement. We show that there are interesting orderings for system states.

Significant progress has made in pattern recognition technology. However, one obstacle that has not yet overcome is the recognition of words in the Brahmi script, specifically the identification of characters, compound characters, and word. This study proposes the use of the deep convolutional neural network with dropout to recognize the Brahmi words. This study also proposed a DCNN for Brahmi word recognition and a series of experiments are performed on standard Brahmi dataset. The practical operation of this method was systematically tested on accessible Brahmi image database, achieving 92.47% recognition rate by CNN with dropout respectively which is among the best while comparing with the ones reported in the literature for the same task.

Underwater wireless sensor networks (UWSN) have recently been proposed as a way to monitor and explore the water depths' environments. Efficiently delivering the data is still a challenging problem in these networks because of the weaknesses in the acoustic transmission. To tackle such a problem, we propose a novel algorithm provides controlling mechanisms for critical long-term data forwarding underwater sensor networks, called Hop by Hop Power-Efficient Routing Protocol (Hⁿ-PERP). The proposed Hⁿ-PERP is a centralized full-control model that enhances the network's throughput and energy efficiency by a set of solutions depend on power monitoring in UWSN nodes. In particular, the model provides a guaranteed mechanism for scheduling and processing data transmission based on number of nodes, hops between the nodes, energy level and congestion within each node to minimize energy levels or power consumption by avoiding disconnected probability for any node, which in turn maximizing the network lifetime. Simulation results show that our proposed model is consistent with energy level and congestion, and is more accurate for enabling routing and data transmission. Therefore, the data packet delivery ratio and overall throughput also achieves robust scenarios of very sparse or/and weak networks, to keep on Performance stability in UWSN via adjusting hop-by-hop delay and energy consumption during packages delivery.

This study presents the B92 Quantum Key Distribution scheme and its optimization and implementation considerations. Simulation software was developed to model and analyze the B92 protocol under varying conditions. Another contribution of this work is investigating how this protocol runs on real quantum computing hardware. New eavesdropping schemes were proposed and modeled.

Cheating prevention in online exams is often hard and costly to tackle with proctoring, and it even sometimes involves privacy issues, especially in social distancing due to the pandemic of COVID-19. Here we propose a low-cost and privacy-preserving anti-cheating scheme by programmatically minimizing the cheating gain. A novel anti-cheating scheme we developed theoretically ensures that the cheating gain of all students can be controlled below a desired level aided by the prior knowledge of students’ abilities and a proper assignment of question sequences. Furthermore, a heuristic greedy algorithm we developed can refine an assignment of questions from a cyclic pool of question sequences to efficiently reduce the cheating gain. Compared to the integer linear programming and min-max matching methods in a small-scale simulation, our heuristic algorithm provides results close to the optimal solutions offered by the two standard discrete optimization methods. Hence, our anti-cheating approach could potentially be a cost-effective solution to the well-known cheating problem even without proctoring.

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 meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they have been used in classic game theory in order to model players and their actions. Game theory has recently been influenced by ideas from the field of quantum computation. As a result, quantum versions of classic games have already been introduced and studied. The PQ penny flip game is a famous quantum game introduced by Meyer in 1999. In this paper we investigate all possible finite games that can be played between the two players Q and Picard of the original PQ game. For this purpose we establish a rigorous connection between finite automata and the PQ game along with all its possible variations. Starting from the automaton that corresponds to the original game, we construct more elaborate automata for certain extensions of the game, before finally presenting a semiautomaton that captures the intrinsic behavior of all possible variants of the PQ game. What this means is that from the semiautomaton in question, by setting appropriate initial and accepting states, one can construct deterministic automata able to capture every possible finite game that can be played between the two players Q and Picard. Moreover, we introduce the new concepts of a winning automaton and complete automaton for either player.

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

In India the first case of coronavirus disease 2019 (COVID-19) reported on 30 January 2020, and thereafter cases were increasing daily after the last week of Feb. 2020. COVID-19 identified as family member of coronaviridae where previously Middle East Respiratory Syndrome MERS and Severe Acute Respiratory Syndrome SARS belongs to same family. The COVID-19 attacks on respiratory system signing fever, cough and breath shortness, in severe cases may cause pneumonia, SARS or some time death. The aim of this study work is to develop model which predicts the epidemic peak for COVID-19 in India by using the real-time data from 30 Jan to 10 May 2020. There are uncertainties while identifying the population information due to the incomplete and inaccurate data, we initiate the most popular model for epidemic prediction i.e Susceptible, Exposed, Infectious, & Recovered SEIR initially the compartmental model for the prediction. Based on the solution of the state estimation problem for polynomial system with Poisson noise, we estimate that the epidemic peak may reach the early-middle July 2020, initializing recovered R0 to 0 and Infected I0 to 1. The outcomes of the model will help epidemiologist to isolate the source of the disease geospatially and analyze the death. Also government authorities will be able to target their interventions for rapidly checking the spread of the epidemic.

We define a new seasonal forecasting method based on fuzzy transforms. We use the best interpolating polynomial for extracting the trend of the time series and generate the inverse fuzzy transform on each seasonal subset of the universe of discourse for predicting the value of a an assigned output. Like first example, we use the daily weather dataset of the municipality of Naples (Italy) starting from data collected from 2003 till to 2015 making predictions on the following outputs: mean temperature, max temperature and min temperature, all considered daily. Like second example, we use the daily mean temperature measured at the weather station “Chiavari Caperana” in the Liguria Italian Region. We compare the results with our method, the average seasonal variation, ARIMA and the usual fuzzy transforms concluding that the best results are obtained under our approach in both examples.

Quantum Correlations are studied extensively in quantum information domain. Entanglement Measures and Quantum Discord are good examples of these actively studied correlations. Detection of violation in Bell inequalities is also a widely active area in quantum information theory world. In this work, we revisit the problem of analyzing the behavior of quantum correlations and violation of Bell inequalities in noisy channels. We extend the problem defined in a recent study by observing the changes in negativity measure, quantum discord and a modified version of Horodecki measure for violation of Bell inequalities under amplitude damping, phase damping and depolarizing channels. We report different interesting results for each of these correlations and measures. All these correlations and measures decrease under decoherence channels, but some changes are very dramatical comparing to others. We investigate also separability conditions of example studied states.

Aiming at the damage detection and continuous monitoring of high efficiency composite structure, the method of carbon nano sensor embeded in the 3-D braided composite material specimen was put forward and the method of damage location for 3-D braided composite material was described. In this paper, the mechanical and electrical characteristics of carbon nano-fiber were analyzed. Considering the massive data of the health monitoring of composite processing, to ensure that the system has good real-time performance, quaternary matrix Singular Value Decomposition algorithm is proposed to simplify data and improve the efficiency of the algorithm. The existence of injury is determined and the damage location is calculated by comparing with key features of healthy specimen. Experimental results prove the method is feasible and effective.

Universities, like cities, have embraced novel technologies and data-based solutions to improve their campuses with ‘smart’ becoming a welcomed concept. Campuses in many ways are small-scale cities. They increasingly seek to address similar challenges and to deliver improved experiences to their users. How can data be used in making this vision a reality? What can we learn from smart campuses that can be scale up to smart cities? A short research study was conducted over a three-month period at a public university in the United Kingdom employing stakeholder interviews and user surveys, aiming at gaining insight into these questions. Based on the study, the authors suggest that making data publicly available could bring many benefits to different groups of stakeholders and campus users. These benefits come with risks and challenges such as data privacy and protection and infrastructure hurdles. However, if these challenges can be overcome, open data could contribute significantly to improving campuses and user experiences, and potentially set an example for smart cities.

Network Embedding (NE) is an important method to learn the representations of network via a low-dimensional space. Conventional NE models focus on capturing the structure information and semantic information of vertices while neglecting such information for edges. In this work, we propose a novel NE model named BimoNet to capture both the structure and semantic information of edges. BimoNet is composed of two parts, i.e., the bi-mode embedding part and the deep neural network part. For bi-mode embedding part, the first mode named add-mode is used to express the entity-shared features of edges and the second mode named subtract-mode is employed to represent the entity-specific features of edges. These features actually reflect the semantic information. For deep neural network part, we firstly regard the edges in a network as nodes, and the vertices as links, which will not change the overall structure of the whole network. Then we take the nodes' adjacent matrix as the input of the deep neural network as it can obtain similar representations for nodes with similar structure. Afterwards, by jointly optimizing the objective function of these two parts, BimoNet could preserve both the semantic and structure information of edges. In experiments, we evaluate BimoNet on three real-world datasets and task of relation extraction, and BimoNet is demonstrated to outperform state-of-the-art baseline models consistently and significantly.

Currently, face recognition technologies are the most widely used methods for verifying 1an individual’s identity. Nevertheless, it has increased in popularity, raising concerns about face spoofing attacks, in which a photo or video of an authorized person’s face is used to get access to services. Based on a combination of Background Subtraction (BS) and Convolutional Neural Networks (CNN), as well as an ensemble of classifiers, we propose an efficient and more robust face spoof detection algorithm. This algorithm includes a Fully Connected (FC) classifier with a Majority Vote (MV) algorithm, which uses different face spoof attacks (e.g., printed photo and replayed video). By including a majority vote to determine whether the input video is genuine or not, the proposed method significantly enhances the performance of the Face Anti-Spoofing (FAS) system. For evaluation, we considered the MSU MFSD, REPLAY-ATTACK, and CASIA-FASD databases. The obtained results by our proposed approach are better than those obtained by state of the art methods. On the REPLAY-ATTACK database, we were able to attain a Half Total Error Rate (HTER) of 0.62% and an Equal Error Rate (EER) of 0.58%. It was possible to attain an EER of 0% on both the CASIA-FASD and the MSU FAS databases.

For the particular selected type of fractals, i.e., the Kronecker product based fractals, the introductory common classification is proposed. It essentially relies on the size and content of the initial fractal matrix. In turn, it gives one of the possible explanation of the phenomenal ability to produce a few of the most popular fractals using many different algorithms, languages and tools. Also, it paves the way to discover on the regular basis thousands of the new fractals, and this gives researchers a wider range of fractal models to choose from.

The paper presents an analysis of the latest developments in the field of stereo vision in the low-cost segment, both for prototypes and for industrial designs. We described the theory of stereo vision and presented information about cameras and data transfer protocols and their compatibility with various devices. The theory in the field of image processing for stereo vision processes is considered and the calibration process is described in detail. Ultimately, we presented the developed stereo vision system and provided the main points that need to be considered when developing such systems. The final, we presented software for adjusting stereo vision parameters in real-time in the python language in the Windows operating system.

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.

This paper builds on previous work introducing the Secure Remote Update Protocol (SRUP)—a secure communications protocol for Command & Control applications in the Internet of Things, built on top of MQTT. This paper builds on the original protocol, and introduces a number of additional message types: adding additional capabilities to the protocol. We also discuss the difficulty of proving that a physical device has an identity corresponding with a logical device on the network, and propose a mechanism to overcome this within the protocol.

In this paper, we employ fuzzy Sumudu transform for solving system of linear fuzzy differential equations with fuzzy constant coefficients. The system with fuzzy constant coefficients is interpreted under strongly generalized differentiability. For this purpose, new procedures for solving the system are proposed. A numerical example is carried out for solving system adapted from fuzzy radioactive decay model. Conclusion is drawn in the last section and some potential research directions are given.

This paper presents a simple yet effective solution for the transcrip- tion of printed texts. Our tool consists of a web-based user interface that provides an easy-to-use and ergonomic workflow and a col- laborative environment for the philologists while allowing them to profit from machine learning OCR technology. As the targeted use case is not mass digitisation but the creation of accurate citable digital editions, the user interface for ground truth production and post correction is built to provide the means for rapid proofread- ing while minimising the amount of errors. The productivity of the setup is further improved by enabling progressive OCR train- ing and recognition in the background to constantly increase the accuracy of the predictions. The advantages of the application are showcased in the second part of the paper by documenting our experiences utilising it for di- gitising Arabic and Latin texts. Over the course of several months the tool has been used to create transcriptions of a wide range of sources, among them challenging early modern editions and Ar- abic scripts, producing a large amount of reusable OCR training data as a positive side effect. Finally, there will be a discussion of possible future extensions of the tool and of how it could be adapted to fit the needs of other digitisation projects.

Banks are normally offered two kinds of deposit accounts. It consists of deposits like current/saving account and term deposits like fixed or recurring deposits. For enhancing the maximized profit from bank as well as customer perspective, term deposit can accelerate uplifting of finance fields. This paper focuses on likelihood of term deposit subscription taken by the customers. Bank campaign efforts and customer detail analysis can influence term deposit subscription chances. An automated system is approached in this paper that works towards prediction of term deposit investment possibilities in advance. This paper proposes deep learning based hybrid model that stacks Convolutional layers and Recurrent Neural Network (RNN) layers as predictive model. For RNN, Gated Recurrent Unit (GRU) is employed. The proposed predictive model is later compared with other benchmark classifiers such as k-Nearest Neighbor (k-NN), Decision tree classifier (DT), and Multi-layer perceptron classifier (MLP). Experimental study concludes that proposed model attains an accuracy of 89.59% and MSE of 0.1041 which outperform well other baseline models.

General Variable Neighborhood Search (GVNS) is a well known and widely used metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. Quantum General Variable Neighborhood Search (qGVNS) is a novel, quantum inspired extension of the conventional GVNS. Its quantum nature derives from the fact that it takes advantage and incorporates tools and techniques from the field of quantum computation. Travelling Salesman Problem (TSP) is a well known NP-Hard problem which has broadly been used for modelling many real life routing cases. As a consequence, TSP can be used as a basis for modelling and finding routes for Geographical Systems (GPS). In this paper, we examine the potential use of this method for the GPS system of garbage trucks. Specifically, we provide a thorough presentation of our method accompanied with extensive computational results. The experimental data accumulated on a plethora of symmetric TSP instances (symmetric in order to faithfully simulate GPS problems), which are shown in a series of figures and tables, allow us to conclude that the novel qGVNS algorithm can provide an efficient solution for this type of geographical problems.

Gesture-based recognition is one of the most intuitive methods for inputting information and is not subject to cumbersome operations. Recognition is performed on human's consecutive motion without reference to retrial or alternation by user. We propose a gesture recognition model with a mechanism for correcting recognition errors that operates interactively and is practical. We applied the model to a setting involving a manual grading task in order to verify its effectiveness. Our system, named GERMIC, consists of two major modules, namely, handwritten recognition and interactive correction. Recognition is materialized with image feature extraction and convolutional neural network. A mechanism for interactive correction is called on-demand by a user-based trigger. GERMIC monitors, track, and stores information on the user's grading task and generates output based on the recognition information collected. In contrast to conventional grading done manually, GERMIC significantly shortens the total time for completing the task by 24.7% and demonstrates the effectiveness of the model with interactive correction in two real world user environments.

Nowadays, the research and development of on-chip LiDAR sensors for vehicle collision avoidance is growing very fast. Therefore, the assessment of the reliability in obstacle detection using the information provided by LiDAR sensors has become a key issue to be explored by the scientific community. This paper presents the design and implementation of a self-tuning method in order to maximize the reliability of an Internet-of-Things sensors network and to minimize the number of sensors to localize with the required accuracy obstacles by a detection threshold. In order to achieve this goal, models that predict accuracy (i.e., prediction error) for object localization using data collected by LIDAR sensors are designed and implemented in Webots Automobile 3D simulation tool. The approach is based on combining different techniques. Firstly, point-cloud clustering technique and an error prediction model library composed by a multilayer perceptron neural network with backpropagation, k-nearest neighbors and linear regression are explored. Secondly the above-mentioned techniques for modeling are also combined with a supervised and reinforcement machine learning technique, Q-learning in order to minimize the detection threshold. In addition, a IoT driving assistance simulated scenario with a LiDAR sensor network is designed in order to validate the prediction model and the optimal configuration of the sensor network to guarantee reliability in obstacle localization. The results demonstrate that the self-tuning method is appropriate to increase the reliability of the sensor network whereas minimizing the detection threshold

Since the outbreak of 2019 novel coronavirus (2019-nCoV) at the hardest-hit city of Wuhan, the fast-moving spread has killed over three hundred people and infected more than ten thousands in China¹. There are more than one hundred cases outside of China, affecting a dozen of countries globally². The genome sequence of 2019-nCoV has been reported and fast diagnostic kits, effective treatment as well as preventive vaccines are rapidly being developed³. Initial fast-growing confirmed cases triggered lock-down of Wuhan as well as nearby cities in Hubei Province. Mathematical models have been proposed by scientists around the world to project the numbers of infected cases in the coming days ^4,5. However, major factors such as transportation and cultural customs have not been weighed enough. Our model is not set out for precise prediction of the number of infected cases, rather, it is meant for a glance of the dynamics under a public epidemic emergency situation and of different contributing factors. We hope that our model and simulation would provide more insights and perspective information to public health authorities around the globe for better informed prevention and containment solution.

In this systematic review of the literature on using Machine Learning (ML) for credit risk prediction, we raise the need for financial institutions to use AI and ML to assess credit risk, analyzing large volumes of information. We posed research questions about algorithms, metrics, results, data sets, variables, and related limitations in predicting credit risk. We searched renowned databases to answer them and identified 52 relevant studies with the credit industry microfinance. Challenges and approaches in credit risk prediction using ML models we identified, difficulties with the implemented models such as the black box model, the need for explanatory artificial intelligence, the importance of selecting relevant features, addressing multicollinearity, and the problem of the imbalance in the input data. By answering the questions, we identified that the Boosted Category is the most researched family of ML models; the most commonly used metrics for evaluation are Area Under Curve (AUC), Accuracy (ACC), Recall, precision measure F1 (F1), and Precision; Research mainly uses public data sets to compare models, and private ones to generate new knowledge when applied to the real world. The most significant limitation identified is the representativeness of reality, and the variables primarily used in the microcredit industry are related data to the demographic, the operation, and payment behavior. This study aims to guide the developers of credit risk management tools and software towards the existing offer of ML methods, metrics, and techniques used to forecast it, thereby minimizing possible losses due to default and guiding risk appetite.

Acquisition of real-time hydraulic data is an essential component for flood forecasting. However, we frequently face difficulties in obtaining discharge data using classical contact methods during high magnitude floods and for systems experiencing rapid hydro-geomorphological adjustment. Therefore, we developed low-cost, non-contact sensors and platforms that are designed to overcome these difficulties. These advances enable flood flow properties to be monitored at multiple locations across a river catchment, at low-cost, and communicated in near real-time by using an image velocimetry method. This is an optics-based approach for stream flow measurement using commercially available near-infrared digital cameras to acquire video footage in full HD (30fps). Video footage is then subjected to optical flow tracking techniques based on cross-correlation, and feature-based tracking, enabling the displacement rates of detected features (for example natural foam, seeds, woody debris, and turbulent structures) to be computed. This manual provides step by step guidance to install an image-based gauging station. It contains the list of necessary components, the calibration process of a new camera and the assembly procedure of the system.

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

People counting applications have been used in diverse applications. The ability and accuracy of thermal imaging over conventional image cameras has led to the implementation of thermal cameras in people counting applications. This paper present a thermal people counting smart glass windows. The people counting application would be remotely monitored from a single centralized PC station as it’s connected to a multiplex of mass monitoring of 20 thermal camera, all embedded into different glass windows. The thermal cameras would then be able to detect body temperatures of all individuals who pass through any of the camera range and also count the numbers of people who passed through the camera range. The data gotten can then be further utilized in various ways, example is in the control of air conditioning and lightening.

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

With the proliferation of locating devices, more and more raw spatial trajectories are formed, and many works enrich these raw trajectories with semantics, and mine patterns from both raw and semantic trajectories, but access control of spatial trajectories is not considered yet. We present a multi-policy secure model for semantic spatial trajectories. In our model, Mandatory Access Control, Role Based Access Control and Discretionary Access control are all enforced, separately and combined, and we represent the model semi-formally in Ontology Web Language.

The onset of coronavirus disease 2019 (COVID-19), an infectious disease caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), has sparked unprecedented change. Due to the public health guidelines imposed during the COVID-19 pandemic, there is no longer sufficient street traffic for remaining buskers to generate sufficient revenue, leading a majority of street musicians to pursue remote music production. However, real-time music production is notoriously difficult due to the excessively high latencies that current video call platforms such as Zoom and Google Meet harbor. In this paper, we propose an architecture for a platform with end-to-end, near-lossless audio transmission tailored specifically to online joint music production, called Latent Space. We discuss the usage of a recurrent autoencoder with sequence-aware encoding (RAES) and a 1D convolutional layer for audio compression, which we dub ClefNet, as well as propose a new evaluation metric for naive autoencoders (AEs), MSE-DTW loss, which combines the traditional mean square error (MSE) loss function with dynamic time warping (DTW) to prevent an increase in loss when the target sequence predicted by the AE is strictly a temporal variation of the source sequence. Moreover, we detail the logistics of a live system implementation which uses the Web Audio API to extract raw audio samples in real-time to feed into our client-side model before relaying the traffic using peer-to-peer WebRTC technology. The Latent Space platform can be accessed at https://latent-space.tech, and the code and data can be found under the MIT License at https://github.com/rvignav/ClefNet.

The capability to avoid other air traffic is a fundamental component of the layered conflict management system to ensure safe and efficient operations in the National Airspace System. The evaluation of systems designed to mitigate the risk of midair collisions of manned aircraft are based on large-scale modeling and simulation efforts and a quantitative volume defined as a near midair collision (NMAC). Since midair collisions are difficult to observe in simulation and are inherently rare events, basing evaluations on NMAC enables a more robust statistical analysis. However, an NMAC and its underlying assumptions for assessing close encounters with manned aircraft do not adequately consider the different characteristics of smaller UAS-only encounters. The primary contribution of this paper is to explore quantitative criteria to use when simulating two or more smaller UASs in sufficiently close proximity that a midair collision might reasonably occur and without any mitigations to reduce the likelihood of a midair collision. The criteria assumes a historically motivated upper bound for the collision likelihood and subsequently identify the smallest possible NMAC analogs. We also demonstrate the NMAC analogs can be used to support modeling and simulation activities.