Annotating training data is a time consuming and labor intensive process in deep learning, especially for images with many objects present. In this paper, we propose a method to allow deep networks to be trained on data with reduced numbers of annotations (per image) in heatmap regression tasks (e.g. object detection and counting), by applying an asymmetric loss function. In a real scenario, this reduction of annotations can be imposed by the researchers (e.g. ask the annotators to label only 50% of what they see in each image), or can potentially counteract unintentionally missing labels from the annotators. To demonstrate the effectiveness of our method, we conduct experiments in two domains, crowd counting and wheat spikelet detection, using different deep network architecture. We drop various percentages of instance annotations per image in training. Results show that an asymmetric loss function is effective across different models and datasets, even in very extreme cases with limited annotations provided (e.g. 90% of the original annotations reduced). Whilst tuning of the key parameters are required, we find that setting conservative parameter values can help more realistic situations, where only small amounts of data have been missed by annotators.

Coronavirus disease (COVID-19) is a pandemic infectious disease that has a severe risk of spreading rapidly. The quick identification and isolation of the affected persons is the very first step to fight against this virus. In this regard, chest radiology images have been proven to be an effective screening approach of COVID-19 affected patients. A number of AI based solutions have been developed to make the screening of radiological images faster and more accurate in detecting COVID-19. In this study, we are proposing a deep learning based approach using Densenet-121 to effectively detect COVID-19 patients. We incorporated transfer learning technique to leverage the information regarding radiology image learned by another model (CheXNet) which was trained on a huge Radiology dataset of 112,120 images. We trained and tested our model on COVIDx dataset containing 13,800 chest radiography images across 13,725 patients. To check the robustness of our model, we performed both two-class and three-class classifications and achieved 96.49% and 93.71% accuracy respectively. To further validate the consistency of our performance, we performed patient-wise k-fold cross-validation and achieved an average accuracy of 92.91% for three class task. Moreover, we performed an interpretability analysis using Grad-CAM to highlight the most important image regions in making a prediction. Besides ensuring trustworthiness, this explainability can also provide new insights about the critical factors regarding COVID-19. Finally, we developed a website that takes chest radiology images as input and generates probabilities of the presence of COVID-19 or pneumonia and a heatmap highlighting the probable infected regions. Code and models' weights are availabe.

Pattern recognition has long been regarded as key role for crime prevention and reduction. Crime analysts and policy makers can formulate effective strategies and allocate resources with reference to spatial and temporal pattern of crime. In order the combat and prevent severe crime in New York City (NYC), this study analyzed Felony Crime data of NYC in previous 5 years (2015 2020) and discovered criminal hotspots pattern and temporal patterns with open criminal complaint data provided by New York Police Department (NYPD). This study adapt a human computer interactive appraoch to draw patterns from crime data, whereas computations and visualization are performed by Python libraries, and human to inform the decision of visualization methods, computational parameters and direction of this exploratary analysis. Density based clustering algorithms, Grid Thematic Mapping and Density Heatmap are displayed to identify hotspots and demonstrates their associations with spatial features. Timeline analysis on moments of crime occurance demonstrates seasonality where crimes are mostly commited, while aoristic analysis showed hours of day when crime is mostly committed considering their timespan. Lastly, 3D visualization improved recognition of the displacement of hotspot over time, and suggested long term hotspots in NYC in 3 D visualization. This inform strategic plans for police deployment.

One of the oldest and common methods of diagnosing heart abnormalities is auscultation. Even for experienced medical doctors, it is not an easy task to detect abnormal patterns in the heart sounds. Most of the digital stethoscopes are now capable of recording and transferring the heart sounds. Moreover, it is proven that auscultation records can be classified as healthy or unhealthy via artificial intelligence techniques. In this work, an artificial intelligence-powered mobile application that works in a connectionless fashion is presented. According to the clinical experiments, the mobile application can detect heart abnormalities with approximately 92% accuracy which is comparable if not better than humans since only a small number of well-trained cardiologists can analyze auscultation records better than artificial intelligence. Using the diagnostic ability of artificial intelligence in a mobile application would change the classical way of auscultation for heart disease diagnosis.

The research develops the vehicular routing problem for the distribution of refrigerated products in a multinational company. The mathematical model corresponds to the vehicle routing problem with hard time windows and stochastic service (VRPTW-ST) time model applied in the city of Santiago de Chile. For optimization of the model, optimization methods tabu search, chaotic search and general algebraic modeling were used. The results allow to validate the meta-heuristic chaotic search to solve the VRPTW-ST; chaotic search method obtains superior performance than tabu search method for solving a real problem in a large city.

The XPRIZE Foundation designs and operates multi-million-dollar, global competitions to incentivize the development of technological breakthroughs that accelerate humanity toward a better future. To combat the COVID-19 pandemic, the Foundation coordinated with several organizations to make available data sets about different facets of the disease and to provide the computational resources needed to analyze those data sets. We describe the requirements, design, and implementation of the XPRIZE Data Collaborative, a cloud-based infrastructure that enables the XPRIZE to meet its COVID-19 mission and host future data-centric competitions. We offer our experiences as a case study of a Cloud Native application developed during the pandemic, from motivations and design to implementation. In contrast to previous Cloud deployment studies that focus on implementations of containers and microservices or serverless architecture, we describe how and why we used both containers, serverless, and other Cloud technologies, even older ones such as Virtual Machines. We include our experiences of having users successfully exercise the Data Collaborative, detailing the challenges encountered and areas for improvement.

The COVID-19 pandemic has caused ~ 2 million fatalities. Significant progress has been made in advancing our understanding of the disease process, one of the unanswered questions, however, is the anomaly in the case/mortality ratio with Mexico as a clear example. Herein, this anomaly is explored by spatial analysis and whether mortality varies locally according to local factors. To address this, hexagonal cartogram maps (hexbin) used to spatially map COVID-19 mortality and visualise association with patient-level data on demographics and pre-existing health conditions. This was further interrogated at local Mexico City level by choropleth mapping. Our data show that the use of hexagonal cartograms is a better approach for spatial mapping of COVID-19 data in Mexico as it addresses bias in area size and population. We report sex/age-related spatial relationship with mortality amongst the Mexican states and a trend between health conditions and mortality at the state level. Within Mexico City, there is a clear south, north divide with higher mortality in the northern municipalities. Deceased patients in these northern municipalities have the highest pre-existing health conditions. Taken together, this study provides an improved presentation of COVID-19 mapping in Mexico and demonstrates spatial divergence of the mortality in Mexico.

We consider a Mean Field Games model where the dynamics of the agents is given by a controlled Langevin equation and the cost is quadratic. A change of variables, introduced in [13], transforms the Mean Field Games system into a system of two coupled kinetic Fokker-Planck equations. We prove an existence result for the latter system, obtaining consequently existence of a solution for the Mean Field Games system.

Recently, the application of deep reinforcement learning in recommender system is flourishing and stands out by overcoming drawbacks of traditional methods and achieving high recommendation quality. The dynamics, long-term returns and sparse data issues in recommender system have been effectively solved. But the application of deep reinforcement learning brings problems of interpretability, overfitting, complex reward function design, and user cold start. This paper proposed a tag-aware recommender system based on deep reinforcement learning without complex function design, taking advantage of tags to make up for the interpretability problems existing in recommender system. Our experiment is carried out on MovieLens dataset. The result shows that, DRL based recommender system is superior than traditional algorithms in minimum error and the application of tags has little effect on accuracy when making up for interpretability. In addition, DRL based recommender system has excellent performance on user cold start problems.

In response to the need to address the safety challenges in the use of artificial intelligence (AI), this research aimed to develop a framework for a safety controlling system (SCS) to address the AI black-box mystery in the healthcare industry. The main objective was to propose safety guidelines for implementing AI black-box models to reduce the risk of potential healthcare-related incidents and accidents. The system was developed by adopting the multi-attribute value model approach (MAVT), which comprises four symmetrical parts: extracting attributes, generating weights for the attributes, developing a rating scale, and finalizing the system. On the basis of the MAVT approach, three layers of attributes were created. The first level contained 6 key dimensions, the second level included 14 attributes, and the third level comprised 78 attributes. The key first level dimensions of the SCS included safety policies, incentives for clinicians, clinician and patient training, communication and interaction, planning of actions, and control of such actions. The proposed system may provide a basis for detecting AI utilization risks, preventing incidents from occurring, and developing emergency plans for AI-related risks. This approach could also guide and control the implementation of AI systems in the healthcare industry.

In fisheries monitoring, catch is assumed to be a product of fishing intensity, catchability, and availability, where availability is defined as the number or biomass of fish present and catchability refers to the relationship between catch rate and the true population. Ecological monitoring programs use catch per unit of effort (CPUE) to standardize catch and monitor changes in fish populations; however, CPUE is proportional to the portion of the population that is vulnerable to the type of gear that is used in sampling, which is not necessarily the entire population. Programs often deal with this problem by assuming that catchability is constant, but if catchability is not constant, it is not possible to separate the effects of catchability and population size using monitoring data alone. This study uses individual-based simulation to separate the effects of changing environmental conditions on catchability and availability in environmental monitoring data. The simulation combines a module for sampling conditions with a module for individual fish behavior to estimate the proportion of available fish that would escape from the sample. The method is applied to the case study of the well-monitored fish species Delta Smelt (Hypomesus transpacificus) in the San Francisco Estuary, where it has been hypothesized that changing water clarity may affect catchability for long-term monitoring studies. Results of this study indicate that given constraints on Delta Smelt swimming ability, it is unlikely that the apparent declines in Delta Smelt abundance are due to an effect of changing water clarity on catchability.

We give a simple proof of the Chen inequality for the Chen invariant $\underbrace{\delta (2,...,2)}_{k\mbox{ terms}}$ of submanifolds in Riemannian space forms.

Knowledge processing is an important feature of intelligence in general and artificial intelligence in particular. To develop computing systems working with knowledge, it is necessary to elaborate means of working with knowledge representations (as opposed to data) because knowledge is an abstract structure. There are different forms of knowledge representations derived from data. One of the basic forms is called a schema. The goal of this paper is the development of theoretical and practical tools for processing schemas. To achieve this goal, we use schema representations elaborated in the mathematical theory of schemas and use structural machine as a powerful theoretical tool for modeling parallel and concurrent computational processes. We describe the schema of autopoietic machines as physical realizations of structural machines. An autopoietic Machine is a technical system capable of regenerating, reproducing and maintaining itself by production, transformation and destruction of its components and the networks of processes downstream contained in them. We present the theory and practice of designing and implementing autopoietic machines as information processing structures integrating both symbolic computing and neural networks. Autopoietic machines use knowledge structures containing the behavioral evolution of the system and its interactions with the environment to maintain stability by counteracting fluctuations.

The problem of sequencing $n$ equal-length non-simultaneously released jobs with delivery times on $m$ uniform machines to minimize the maximum job completion time is considered. To the best of our knowledge, the complexity status of this classical scheduling problem remained open up to the date. We establish its complexity status positively by showing that it can be solved in polynomial time. We adopt for the uniform machine environment the general algorithmic framework of the analysis of behavior alternatives developed earlier for the identical machine environment. The proposed algorithm has the time complexity $O(\gamma m^2 n\log n)$, where $\gamma$ can be any of the magnitudes $n$ or $q_{\max}$, the maximum job delivery time. In fact, $n$ can be replaced by a smaller magnitude $\kappa<n$, which is the number of special types of jobs (it becomes known only upon the termination of the algorithm).

The Kummer surface was constructed in 1864. It corresponds to the desingularisation of the quotient of a 4-torus by 16 complex double points. Kummer surface is kwown to play a role in some models of quantum gravity. Following our recent model of the DNA genetic code based on the irreducible characters of the finite group G5:=(240,105)≅Z5⋊2O (with 2O the binary octahedral group), we now find that groups G6:=(288,69)≅Z6⋊2O and G7:=(336,118)≅Z7⋊2O can be used as models of the symmetries in hexamer and heptamer proteins playing a vital role for some biological functions. Groups G6 and G7 are found to involve the Kummer surface in the structure of their character table. An analogy between quantum gravity and DNA/RNA packings is suggested.

This paper presents a discrete compartmental Susceptible-Exposed-Infected-Recovered/Dead (SEIR/D) model to address the expansion of Covid-19 pandemic. When time passes, the status of the cells is determined by binary rules that update following both a neighbourhood and a delay pattern. The model assumes the environmental parameters have a crucial impact on the expansion of the disease so a grid is assigned to each parameter to model the single effect caused by this parameter. The expansion is then the weighted sum of all the grids. This proposal shows how the grid architecture, along with an update rule and a neighbourhood pattern is a valuable tool to model the pandemic expansion. This model has already been analyzed in previous works and compared with the corresponding continuous models solved by ordinary differential equations (ODE), coming to find the homologous parameters between both approaches. Thus, it has been possible to prove that the combination neighborhood-update rule is responsible for the rate of expansion and recovering/death of the illness. The delays (between Susceptible and Asymptomatic, Asymptomatic and Infected, Infected and Recovered/Dead) may have a crucial impact on both the peak of Infected and the Recovery/Death rate. This theoretical model has been successfully tested in the case of the dissemination of information through mobile social networks and in the case of plant pests.

Studies have found critical software malfunctions responsible for some of the worst accidents in recent times. These malfunctions are often only minor defects that snowball into large problems; a few lines of code is all it takes. Complexity, safety, quality, and resilience are among the key attributes defining a software’s operational success. There are many leading factors for complexity, such as increases in the product size, the rate of requirement changes, and the number and type of stakeholders, and failure to manage these issues efficiently always has the same consequence, i.e., massive failure and sometimes technological catastrophe. This work analyzes some of the architecture, design, and implementation guidelines used as detection and mitigation techniques. It also discusses the safety considerations, as considering how the steam industry has handled safety issues could offer some guidance for ensuring safety. Complexity in such systems also causes some of the worst side effects from the quality auditor's perspective. While failures in the software are hard to predict, one of the most significant ways of showing preparedness is practicing software resilience. New mitigation areas, such as the fragility spectrum and failure obviation, and their usage for building a safer system are analyzed. Also discussed are various architecture styles in practice and the dramatic effect human factors can have on the success of the software being developed.

According to the current European and Italian scenario related to urban re-generation, cultural and landscape heritage, valorisation is being also enhanced by the activation of innovative processes. These involve the development of methodologies and tools that are able to address decision-making processes among low entropy economy, complex values and creative practices. In this perspective, the research aims to investigate the possibilities of developing a Cultural Heritage Low Entropy Enhancement (CHLEE) approach by considering how the complex values of cultural heritage can vary not only through a physical transformation of spaces but also through a program of uses and activities able to produce new values, where the human experience is essential. This type of model modifies the objectives that characterise the valorisation of cultural heritage and landscape, recognising that the fruition is no longer “consumerist” but “experiential”. A crucial role is represented by the heterogeneity of creative practices that contribute to the identificationidentifying and implementation ofimplementing innovative management and governance models. The present paper explores the components of creative regenerative processes, based upon the ex-post evaluation of some Italian experiments, across the PROMETHEE-GAIA multi-criteria method, to understand how creative experiences are building innovation ecosystem thanks to low entropy economy and improve the ex-ante evaluation for new strategies and policies.

In recent times, BERT based transformer models have become an inseparable part of the 'tech stack' of text processing models. Similar progress is being observed in the speech domain with a multitude of models observing state-of-the-art results by using audio transformer models to encode speech. This begs the question of what are these audio transformer models learning. Moreover, although the standard methodology is to choose the last layer embedding for any downstream task, but is it the optimal choice? We try to answer these questions for the two recent audio transformer models, Mockingjay and wave2vec2.0. We compare them on a comprehensive set of language delivery and structure features including audio, fluency and pronunciation features. Additionally, we probe the audio models' understanding of textual surface, syntax, and semantic features and compare them to BERT. We do this over exhaustive settings for native, non-native, synthetic, read and spontaneous speech datasets

In this paper we address one of the most important topics in the field of Social Networks Analysis: the community detection problem with additional information. That additional information is modeled by a fuzzy measure that represents the possibility of polarization. Particularly, we are interested in dealing with the problem of taking into account the Polarization of nodes in the community detection problem. Adding this type of information to the community detection problem makes it more realistic, as a community is more probably to be defined if the corresponding elements are willing to maintain a peaceful dialogue. The polarization capacity is modeled by a fuzzy measure based on the JDJpol measure of polarization related to two poles. We also present an efficient algorithm for finding groups whose elements are no polarized. Hereafter, we work in a real case. It is a network obtained from Twitter, concerning the political position against the Spanish government taken by several influential users. We analyze how the partitions obtained change when some additional information related to how polarized that society is, is added to the problem.

A novel machine learning approach is presented in this paper, based on extracting latent information and using it to assist decision making on ambulance attendance and conveyance to a hospital. The approach includes two steps: in the first, a forward model analyzes the clinical and, possibly, non-clinical factors (explanatory variables), predicting whether positive decisions (response variables) should be given to the ambulance call, or not; in the second, a backward model analyzes the latent variables extracted from the forward model to infer the decision making procedure. The forward model is implemented through a machine, or deep learning technique, whilst the backward model is implemented through unsupervised learning. An experimental study is presented, which illustrates the obtained results, by investigating emergency ambulance calls to people in nursing and residential care homes, over a one-year period, using an anonymized data set provided by East Midlands Ambulance Service in United Kingdom.

Machine learning research has been able to solve problems in multiple aspects. An open area of research is machine learning for solving optimisation problems. An optimisation problem can be solved using a metaheuristic algorithm, which is able to find a solution in a reasonable amount of time. However, there is a problem, the time required to find an appropriate metaheuristic algorithm, that would have the convenient configurations to solve a set of optimisation problems properly. A solution approach is shown here, using a proposal that automatically creates metaheuristic algorithms aided by a reinforced learning approach. Based on the experiments performed, the approach succeeded in creating a metaheuristic algorithm that managed to solve a large number of different continuous domain optimisation problems. This work's implications are immediate because they describe a basis for the generation of metaheuristic algorithms in real-time.

Emotion recognition is becoming very relevant in educational scenarios, since previous research has proven the strong influence of emotions on the student's engagement and motivation. There is no standard method for stating student's affect, but physiological signals have been widely used in educational contexts. Physiological signals have been proved to offer high accuracy in detecting emotions because they reflect spontaneous affect-related information, and which is fresh and do not require an additional control or interpretation. However, most proposed works use measuring equipment that limit its applicability in real-world scenarios because of their high cost and their intrusiveness. Expensive material means an economic challenge for schools and reduce the scalability of the experiments. Intrusive equipment can be uncomfortable for the students which can lead to errors in the collected data. In this work, we analyse the feasibility of developing a low-cost non-intrusive device that integrates easy-to-capture signals that guarantee high detection accuracy. The advantage of the approach also lies in using user’s centred information sources (intra-subject) in real-world situations, which provide better detection accuracy, by offering models adapted to each subject. To this end, we present an experimental study that aims to explore the potential application of Hidden Markov Models (HMM) to predict the concentration state from 4 commonly used physiological signals, namely heart rate, breath rate, skin conductance and skin temperature. We study the multi-fusion of every possible combination of these four signals and analyse their potential use in an educational context in terms of intrusiveness, cost and accuracy. Results show that a high accuracy can be achieved with three of the signals when using HMM-based intra-subject models. However, inter-subject models, which are meant to obtain subject-independent approaches for affect detection, fail at the same task. This work concludes that the implementation of a low-cost wrist-worn device for recognising relevant emotions from each student is possible and open the way to a wide range of practical applications in the context of adaptive learning systems.

The concept of transformative resilience emerges from complex recent literature and represents a way to interpret the potential opportunities to change in vulnerable territories, where a socio-economic change is required. This article extends the perspective of transformative resilience to assessing of the landscape multi-functionality of inland areas, exploring the potentials to identify a network of synergies among the different municipalities able to trigger a process of territorial resilience. A Spatial Decision Support System (SDSS) for multi-functionality landscape assessment aims to support the local actors to understand local resources and multi-functional values of the Partenio Regional Park (PRP) and surrounding municipalities, in the South of Italy, stimulating their cooperation to the management of environmental and cultural sites and the co-design of new strategies of enhancement.

Software is playing the most important role in recent vehicle innovation, and consequently the amount of software has been rapidly growing last decades. Safety-critical nature of ships, one sort of vehicles, makes Software Quality Assurance (SQA) has gotten to be a fundamental prerequisite. Just-In-Time Software Defect Prediction (JIT-SDP) aims to conduct software defect prediction (SDP) on commit-level code changes to achieve effective SQA resource allocation. The first case study of SDP in maritime domain reported feasible prediction performance. However, we still consider that the prediction model has still rooms for improvement since the parameters of the model are not optimized yet. Harmony Search (HS) is a widely used music-inspired meta-heuristic optimization algorithm. In this article, we demonstrated that JIT-SDP can produce the better performance of prediction by applying HS-based parameter optimization with balanced fitness value. Using two real-world datasets from the maritime software project, we obtained an optimized model that meets the performance criterion beyond baseline of previous case study throughout various defect to non-defect class imbalance ratio of datasets. Experiments with open source software also showed better recall for all datasets despite we considered balance as performance index. HS-based parameter optimized JIT-SDP can be applied to the maritime domain software with high class imbalance ratio. Finally, we expect that our research can be extended to improve performance of JIT-SDP not only in maritime domain software but also in open source software.

Dynamics of human populations can be affected by various socio-economic factors through their influence on the natality and mortality rates, and on the migration intensity and directions. In this work we study an economic-demographic model which takes into account the dependence of the wealth production rate on the available resources. In the case of nonlocal consumption of resources the homogeneous in space wealth-population distribution is replaced by a periodic in space distribution for which the total wealth increases. For the global consumption of resources, if the wealth redistribution is small enough, then the homogeneous distribution is replaced by a heterogeneous one with a single wealth accumulation center. Thus, economic and demographic characteristics of nonlocal and global economies can be quite different in comparison with the local economy.

This paper discusses a possible approach to validate the Goldbach conjucture which states that all even numbers can be expressed as a summation of two prime numbers. For this purpose the paper begins with the concept of successive-addition-of-digits-of-an-integer-number (SADN) and its properties in terms of basic algebraic functions like addition, multiplication and subtraction. This concept of SADN forms the basis for classifying all odd numbers into 3 series- the S1, S3 and S5 series- which comprise of odd numbers of SADN(7,4,1), SADN(3,9,6) and SADN(5,2,8) respectively and follow a cyclical order. The S1 and S5 series are of interest in the analysis since they include both prime and composite numbers while the S3 series exclusively consists of composite numbers. Furthermore, the multiplicative property of SADN shows why composites on the S1 series are derived as products of intra-series elements of the S1 and S5 series while composites on the S5 series are derived as products of inter-series elements of the S1 and S5 series. The role of SADN is also important in determining the relevant series for identifying the combination of primes for a given even number since it shows why such combinations for even numbers of SADN(1,4,7) will be found on the S5 series while those for even numbers of SADN(2,5,8) will lie on the S1 series and both the series have a role to play in identifying the prime number combinations for even numbers with SADN(3,6,9). Thereafter, the analysis moves to calculating the total number of acceptable combinations for a given even number that would include combinations in the nature of two composites (c1+c2), one prime and one composite (p+c) and two primes (p1+p2). A cyclical pattern followed by even numbers is also discussed in this context. Identifying the c1+c2 and p+c combinations and thereafter subtracting them from the total number of combinations will yield the number of p1+p2 combinations. For this purpose the paper discusses a general method to calculate the number of composites on the S1 and S5 series for a given number and provides a detailed method for deriving the number of c1+c2 combinations. The paper presents this analysis as a proof to validate the Goldbach conjecture. Since even numbers can be of SADN 1 to 9 and the relation between nTc (i.e. total number of acceptable combinations) and nc(i.e. number of composites) for all even numbers can either be of nTc > nc or nTc ≤ nc, the paper shows that the Goldbach conjecture is true for both these categories of even numbers. In this manner this analysis is totally inclusive of all even numbers in general terms and since the analysis of every even number is common in methodology but unique in compilation, apart from being totally inclusive, it is also mutually exclusive in nature. This proves that the Goldbach conjecture which states that all even numbers can be expressed as atleast one combination of two prime numbers holds true for all even numbers, across all categories possible. Additionally this approach proves that the identification of p1+p2 combinations which would validate the Goldbach conjecture lies in the identification of c1+c2 combinations.

With data for SARS-CoV-2 and with many countries entering the second wave of contagion required the improvement of the forecasting model, structuring its model to forecast the peak of the first and second contagion wave in Brazil. The Model Estimation for SARS-CoV-2 Peak Contagion (MESPC) was structured, capable of estimating the peak of contagion for SARS-CoV-2 in the first and second waves, as the main objective of this work. Using the MESPC model, it was possible to estimate, with a certain reliability degree, the peak of contagion for the first and second waves in Brazil, with one day difference from the real to the forecast. It is possible to use MESPC to forecast the peak of contagion for several regions, provided that the necessary structure and calibration are respected.

The present work studies a swelling porous-elastic system with viscoelastic damping. We establish a general and optimal decay estimate which generalizes some recent results in the literature. Our result is established without imposing the usual equal-wave-speed condition associated with similar problems in literature.

Our aim in this paper is to establish some new Hermite-Hadamard- Mercer type integral inequalities by utilizing the fractional proportional-integral operators.For this purpose, Hermite-Hadamard-Mercer inequalities for di¤er- antiable mappings whose derivatives in absolute value are convex.

The Galvanic Skin Response (GSR, also widely known as electrodermal activity EDA) is one of the signals related to this emotional reaction. Given the sparsity of studies related to and the variety of devices, we experimented at the Human Health Activity Laboratory with 17 healthy subjects. The goal is to know the variability of detection changes in the electrodermal activity among a test group with heterogeneous respondents in response to valence and arousal stimuli, correlating GSR biosignals measured from different body sites. We experiment with the right and left wrist, left fingers, the right foot's inner side using Shimmer3GSR, and Empatica E4 sensors. Results indicate as the most promising homogeneous GSR measure place the left fingers and right foot. Results suggest that due to a significantly strong correlation among the inner side of the right foot and left fingers and moderate correlations with the right and left wrist, the foot is a good place to measure EDA. This paper also contributes knowledge about some wearable sensor technologies available in the market. Shimmer3GSR sensor may be better reliable to homogenous detecting electrodermal activity changes, as these have fewer anomalies among the respondents. However, we found some anomalies in signals from the Empatica E4 sensor, which we discuss in this work.

Kim-Kim (Russ. J. Math. Phys. 2017, 24, 241-248) defined the degenerate Laplace transform and investigated some of their certain properties. Motivated by this study, in this paper, we introduce the degenerate Sumudu transform and establish some properties and relations. We derive degenerate Sumudu transforms of power functions, degenerate sine, degenerate cosine, degenerate hyperbolic sine, degenerate hyperbolic cosine, degenerate exponential function, and function derivatives. We also acquire a relationship between degenerate Sumudu transform and degenerate gamma function. Moreover, we investigate a scale preserving theorem for the degenerate Sumudu transform. Furthermore, we show that the degenerate Sumudu transform is the theoretical dual transform to the degenerate Laplace transform.

Wireless Sensor Networks (WSN) is the network of the resource-constrained network which forms the foundation of the Internet of Things (IoT). The Routing Protocol for Low-power and Lossy Networks (RPL) is responsible for generating and managing data routing paths. Nodes implementing RPL uses the mechanics of Objective Function (OF) to select the preferred next-hop node – parent node, and optimal routing path to the destination node. If routing decisions are not efficiently made, this results in increased collision domain, leading to packet losses and packet retransmission which impairs the network operational lifetime. In this study, we present the Contiki Operating System (OS), a state-of-the-art OS for IoTs, ContikiRPL; Contiki variant of RPL. We investigated the performance of RPL with respect to its two OFs; Objective Function Zero (OF0) and the Minimum Rank with Hysteresis Objective Function (MRHOF). The performance of these OFs was evaluated on the following metrics; Packet Delivery Ratio (PDR), Power consumption, and network latency. The result shows that MRHOF outperformed OF0 on all metrics with an overall average PDR of 91.5%, a latency of 44ms, and power consumption of 1.72mW across all nodes. This results in optimal network performance with improved network operational lifetime.

Saif et al. (J. Math. Comput. Sci. 21 (2020) 127-135) considered modified Laplace transform and developed some of their certain properties and relations. Motivated by this work, in this paper, we define modified Sumudu transform and investigate many properties and relations including modified Sumudu transforms of the power function, sine, cosine, hyperbolic sine, hyperbolic cosine, exponential function, and function derivatives. Moreover, we attain two shifting properties and a scale preserving theorem for the modified Sumudu transform. We give modified inverse Sumudu transform and investigate some relations and examples. Furthermore, we show that the modified Sumudu transform is the theoretical dual transform to the modified Laplace transform.

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyper-feature from satellite bands to improve the classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

Identifying fake news on the media has been an important issue. This is especially true considering the wide spread of rumors on the popular social networks such as Twitter. Various kinds of techniques have been proposed for automatic rumor detection. In this work, we study the application of graph neural networks for rumor classification at a lower level, instead of applying existing neural network architectures to detect rumors. The responses to true rumors and false rumors display distinct characteristics. This suggests that it is essential to capture such interactions in an effective manner for a deep learning network to achieve better rumor detection performance. To this end we present a simplified aggregation graph neural network architecture. Experiments on publicly available Twitter datasets demonstrate that the proposed network has performance on a par with or even better than that of state-of-the-art graph convolutional networks, while significantly reducing the computational complexity.

In this paper, we implement a Particle Swarm Optimization (PSO) based method for solving the kidney exchange problem. Because using a kidney exchange, we can help incompatible patient-donor couples to swap donors to receive a compatible kidney. Implementing Particle Swarm Optimization in solving the kidney exchange problem is an effective method because the obtained results indicate that PSO outperforms other stochastic-based methods such as Genetic Algorithm regarding the efficient the number of resulting exchanges.

The e-commerce platform in the digital economy era has evolved into a data platform ecosystem built around data resources and data mining technology systems. The most typical applications of big data are also concentrated in the field of e-commerce. E-commerce companies should first grasp the interactive relationship among the three major factors of data, technology and innovation, e-commerce platform operation is a multidisciplinary research field. It is not easy for researchers to obtain a panoramic view of the knowledge structure in this field. Knowledge graph is a kind of graph that shows the development process and structure relationship of knowledge with the field of knowledge as the object. It is not only a visual knowledge mapping, but also a serialized knowledge pedigree, which provides researchers with a quantitative research method for the development trend of statistics and academic status. The purpose of this research is to help researchers understand the key knowledge, evolutionary trends and research frontiers of current research. This study uses Citespace bibliometric analysis to analyze the data of the Science Net database and finds that: 1) The development of the research field has gone through three stages, and some representative key scholars and key documents have been recognized; 2) the common knowledge mapping of literature The co-occurrence of citations and keywords shows research hotspots; 3) The results of burst detection and central node analysis reveal research frontiers and development trends. Today, the visualization of big data brings different challenges. The abstraction between the world and today's data visualization occurs when the data is captured. Every user sees his own visualization data generated by standardized calculations. At the same time, there are still many controversies in the theoretical model, structure and structural dimensions. This is the direction that future researchers need to further study.

Wearable technology will become available and allow prolonged electroencephalography (EEG) monitoring in the home environment of patients with epilepsy. Neurologists analyse the EEG visually and annotate all seizures, which patients often under report. Visual analysis of a 24 hour EEG recording typically takes one to two hours. Reliable automated seizure detection algorithms will be crucial to reduce this analysis. We study a dataset of behind-the-ear EEG measurements. Our first aim was to develop a methodology to reduce the EEG dataset by classifying part of the data automatically, while retaining 100% detection sensitivity (DS). Prediction confidences are determined by temperature scaling of the classification model outputs and trust scores. A DS of approximately 90% (99%) can be achieved when automatically classifying around 90% (60%) of the data. Perfect DS can be achieved when automatically classifying 50% of the data. Our second contribution demonstrates that a common modelling strategy, where predictions from several short EEG segments are used to obtain a final prediction, can be improved by filtering out untrustworthy segments with low trust scores. The false detection rate shows a relative decrease between 21% and 43%, and the DS shows a small increase or decrease.

We present a new post-processing method for Quantum Key Distribution (QKD) that raise cubically the secret key rate in the number of double matching detection events. In Shannon’s communication model information is prepared at Alice’s side then it is intended to pass it over a noisy channel. In our approach, secret bits do not rely in Alice’s transmitted quantum bits but in Bob’s basis measurement choices. Therefore measured bits are publicly revealed while bases selections remain secret. Our method implements sifting, reconciliation and amplification in a unique process, it just require a round iteration, no redundancy bits are sent and there is no limit in the correctable error percentage. Moreover, this method can be implemented as a post processing software into QKD technologies already in use.

With a reduction in the mortality rate of burn patients, patient length of stay (LOS) is increasingly adopted as an outcome measure. Some studies have attempted to identify factors that explain a burn patient's expected LOS. However, few have investigated the association between LOS and a patient's mental and socioeconomic status. There is anecdotal evidence for links between these factors and uncovering these will aid in better addressing the specific physical and emotional needs of burn patients, and facilitate the planning of scarce hospital resources. Here, we employ machine learning (clustering) and statistical models (regression) to investigate whether a segmentation by socioeconomic/mental status can improve the performance and interpretability of an upstream predictive model, relative to a unitary model derived for the full adult population of patients. Although we found no significant difference in the performance of the unitary model and segment-specific models, the interpretation of the segment-specific models reveals a reduced impact of burn severity in LOS prediction with increasing adverse socioeconomic and mental status. Furthermore, the models for the socioeconomic segments highlight an increased influence of living circumstances and source of injury on LOS. These findings suggest that, in addition to ensuring that the physical needs of patients are met, management of their mental status is crucial for delivering an effective care plan.

In this era of technology, programming has become more significant than ever before. Python and C++ are both widely used programming languages. Python, the most popular programming language in today’s world, is a high-level object-oriented language whereas C++, the language behind most operating systems, is a low-level object-oriented language. In this paper, we present a comparative study of Python and C++. This paper discusses the introduction to these languages, their memory management techniques, and the reasons behind their program execution speed. Furthermore, we analyzed the execution time and memory used by multiple algorithms in both the languages with best, average, and worst cases. They are also compared with respect to the benefits and issues related to them. Results indicate that C++ is faster than Python in execution speed but Python serves as a better language for beginners due to its simplicity. Moreover, for the best results, the language should be selected according to the type of project.

Post-quantum public cryptosystems introduced so far do not define an scalable public key infrastructure for the quantum era. We demonstrate here a public certification system based in Lizama’s non-invertible Key Exchange Protocol which can be used to implement a public key infrastructure (PKI), secure, scalable, interoperable and efficient. We show functionality of certificates across different certification domains. Finally, we discuss that non-invertible certificates can exhibit Perfect Forward Secrecy (PFS).

The XPRIZE Foundation designs and operates multi-million-dollar, global competitions to incentivize the development of technological breakthroughs that accelerate humanity toward a better future. To combat the COVID-19 pandemic, the Foundation coordinated with several organizations to make available data sets about different facets of the disease and to provide the computational resources needed to analyze those data sets. This approach fits in with the XPRIZE Foundation’s pre-pandemic plans to host contests that require analysis of data sets while providing the computation resources to those data sets to make it possible for a wide range of teams to be able to compete – democratizing data and its analysis. We describe the requirements, design, and implementation of the XPRIZE Data Collaborative, a cloud-based infrastructure that enables the XPRIZE to meet its COVID-19 mission and host future data-centric competitions. We offer our experiences as a case study of a Cloud Native application from design to implementation, one that used a surprising variety of Cloud services, technologies, and design patterns, from containers to VMs to serverless computing. We include our experiences of having users successfully exercise the Data Collaborative, detailing the challenges encountered and areas for possible improvement.

Abstract: Polylactic acid (PLA) is brittle in nature with extensive deformation property. For improvement of the end-use quality, it is of significant importance to enhance the producibility of fused deposition modeling (FDM)-printed objects in PLA. The purpose of this investigation is to boost toughness and to reduce the production cost of the FDM-printed tensile test samples with the desired part thickness. To attain the research purpose number of experiments are designed and analyzed by the Response Surface Method (RSM). The statistical analysis is performed to deal with this concern considering layer thickness, infill percentage, and extruder temperature as controlled factors. The tensile test specimens are printed based on the designed experiments, and the tensile strength tests are conducted by SANTAM 150 universal testing machine based on ASTM D638. The honeycomb internal fill pattern is applied for the production of light-weight and high-strength specimens. The area under Force- Extension curve up to fracture is acquired as the toughness of the printed specimens. This study also developed a modeling process using ANN and ANN-GA techniques for developing an accurate estimation for toughness, part thickness, and production cost as dependant variables. Results were evaluated by correlation coefficient and RMSE values. According to the modeling results, ANN-GA as a hybrid ML technique could successfully improve the accuracy of modeling about 7.5, 11.5 and 4.5 % for toughness, part thickness, and production cost, respectively, in comparison with those for the single ANN method. In the other side, the optimization results confirm that the optimized specimen is cost-effective and able to comparatively undergo deformation, which develops the usability of printed PLA objects. The research is accomplished under the constraints of PLA compatibility with existing fused deposition modeling setup without changing the functional hardware/software of the machine. Although the mechanical properties and dimensional accuracy of PLA have already been studied, there is little literature on the toughness of the printed PLA with honeycomb internal fill pattern.

In many image processing and computer vision applications, the main aim is to describe image contents. So, different visual properties such as color, texture and shape are extracted to make aim. In this respect, texture information play important role in image description and visual pattern classification. Texture is referred to a specific local distribution of intensities that is repeated throughout the image. Since now different operations or descriptors have been proposed to analysis texture characteristics. In the multi object images specific texture operators usually doesn’t provide accurate results. So, in many cases, combination of texture operators are used to achieve more discriminant features. In this paper, some combination methods are survived to analysis effect of combinational texture features in image content description. Also, in the result part, different related methods are compared in terms of accuracy and computational complexity.

This paper inquires on the options pricing modeling using Artificial Neural Networks to price Apple(AAPL) European Call Options. Our model is based on the premise that Artificial Neural Networks can be used as functional approximators and can be used as an alternative to the numerical methods to some extent, for a faster and an efficient solution. This paper provides a neural network solution for two financial models, the BlackScholes-Merton model, and the calibrated-Heston Stochastic Volatility Model, we evaluate our predictions using the existing numerical solutions for the same, the analytic solution for the Black-Scholes equation, COS-Model for Heston’s Stochastic Volatility Model and Standard Heston-Quasi analytic formula. The aim of this study is to find a viable time-efficient alternative to existing quantitative models for option pricing.

With the rapid expansion of intelligent resource-constrained devices and high-speed communication technologies, Internet of Things (IoT) has earned a wide recognition as the primary standard for low-power lossy networks (LLNs). Nevertheless, IoT infrastructures are vulnerable to cyber-attacks due to the constraints in computation, storage, and communication capacity of the endpoint devices. From one side, the majority of newly developed cyber-attacks are formed by slightly mutating formerly established cyber-attacks to produce a new attack tending to be treated as a normal traffic through the IoT network. From the other side, the influence of coupling the deep learning techniques with cybersecurity field has become a recent inclination of many security applications due to their impressive performance. In this paper, we provide a comprehensive development of a new intelligent and autonomous deep learning-based detection and classification system for cyber-attacks in IoT communication networks leveraging the power of convolutional neural networks, abbreviated as (IoT-IDCS-CNN). The proposed IoT-IDCS-CNN makes use of the high-performance computing employing the robust CUDA based Nvidia GPUs and the parallel processing employing the high-speed I9-Cores based Intel CPUs. In particular, the proposed system is composed of three subsystems: Feature Engineering subsystem, Feature Learning subsystem and Traffic classification subsystem. All subsystems are developed, verified, integrated, and validated in this research. To evaluate the developed system, we employed the NSL-KDD dataset which includes all the key attacks in the IoT computing. The simulation results demonstrated more than 99.3% and 98.2% of cyber-attacks’ classification accuracy for the binary-class classifier (normal vs anomaly) and the multi-class classifier (five categories) respectively. The proposed system was validated using k-fold cross validation method and was evaluated using the confusion matrix parameters (i.e., TN, TP, FN, FP) along with other classification performance metrics including precision, recall, F1-score, and false alarm rate. The test and evaluation results of the IoT-IDCS-CNN system outperformed many recent machine-learning based IDCS systems in the same area of study.

Computer vision is considered as an ally to solve business problems that require human intervention, intelligence and criteria. This topic of research has evolved in XXI century at faster peace, delivering various alternatives from open source until commercial platforms. With so many options and market growing, it result difficult to make a decision on which one to use, or even worse, realize it was not suited for different scenarios. In this paper we analyze five options selected arbitrarily and tested on a dataset of 755 images to detect persons in an image, using object detectors. We analyze elapsed time to process an image, error with observations by humans, number of persons detected, correlation of time and person density, object detected size and F1 Score, considering precision and recall. As we found there are score ties and similar behaviors among options available, we introduce a novel index that takes in consideration the number of persons and their pixel size, to propose the Vision Acuity Index of Computer Vision. The results demonstrate this is a good option to serve as indicator to make decisions. Also, this index proposed have a potential to be expanded for different business use cases, and to measure new proposed algorithms in the future along with the traditional metrics used previously.

Efficient and uninterrupted energy supply plays crucial role in the quality of the modern daily life, while it is obvious that the efficiency and performance of energy supply companies has significant impact on energy supply itself, and on determining and finetuning the future roadmap of the sector. In this study, the performance and efficiency of energy supply companies with respect to productivity is investigated over a case study of an electricity distribution company in Turkey. The factors affecting the company’s performance and their corresponding weights have been determined and elicited using analytical hierarchy process (AHP) and the Fuzzy AHP methods, as two well-known multi-criteria decision-making methods, which are two well-known prominent methods widely used in the literature. The results help demonstrate that the criteria elicited to evaluate the company’s energy supply performance plan a crucial role in developing strategies, policies and action plans to achieve continuous improvement and consistent development.

CNN-based methods have dominated the field of aerial scene classification for the past few years. While achieving remarkable success, CNN-based methods suffer from excessive parameters and notoriously rely on large amounts of training data. In this work, we introduce few-shot learning to the aerial scene classification problem. Few-shot learning aims to learn a model on base-set that can quickly adapt to unseen categories in novel-set, using only a few labeled samples. To this end, we proposed a meta-learning method for few-shot classification of aerial scene images. First, we train a feature extractor on all base categories to learn a representation of inputs. Then in the meta-training stage, the classifier is optimized in the metric space by cosine distance with a learnable scale parameter. At last, in the meta-testing stage, the query sample in the unseen category is predicted by the adapted classifier given a few support samples. We conduct extensive experiments on two challenging datasets: NWPU-RESISC45 and RSD46-WHU. The experimental results show that our method yields state-of-the-art performance. Furthermore, several ablation experiments are conducted to investigate the effects of dataset scale, the impact of different metrics and the number of support shots; the experiment results confirm that our model is specifically effective in few-shot settings.

Glioblastoma multiforme is a deadly brain cancer with a median patient survival time of 18-24 months. A single biopsy cannot provide complete assessment of the tumor’s microenvironment, making personalized care limited. 50% of the patients do not respond to the anti-cancer drug Temozolomide(TMZ) because of the over-expression of MGMT gene. Epigenetic silencing of the MGMT gene by methylation results in decreased MGMT expression, resulting in increased sensitivity to TMZ, and longer survival. The purpose of this research is to use artificial intelligence (AI) to design a low cost methodology to determine the MGMT’s methylation status and suggest non-invasive treatment plan.

Spending on out-patient health care by citizens in limited resource countries has received little attention.The purpose of this study is to determine the predictors of household spending on out-patient expenses in a cross-sectional study in Kenya. We applied the GEE methods to determine the effect of various variables on outpatient care. We established that the best predictors for outpatient spending in Kenya are Age of the household head, wealth index, marital status and education, which had the lowest QICu of 976341.2. There were no differences on age in mean spending on outpatient care and was changing in a sinusoidal manner. The rich spend more on outpatient care, due to financial ability. Spending increased across the wealth quantiles while gender had a significant effect in the general performance of the models, it didn’t assist in lowering the QICu

In this paper, we introduce hybrid numbers with Fibonacci and Lucas hybrid number coefficients. We give the Binet formulas, generating functions, exponential generating functions for these numbers. Then we define an associate matrix for these numbers. In addition, using this matrix, we present two different versions of Cassini identitiy of these numbers.

In WPA3 secure connection is executed in two sequential stages. Firstly, in authentication and association stage a pairwise master key (PMK) is generated. Secondly, in post-association stage a pairwise transient key (PTK) is generated from PMK using the traditional 4-way handshake protocol. To reduce the heavy computation of the first stage PMK caching can be used. If client and AP are previously authenticated and has PMK cache, client can skip the first heavy stage and reuse the cached PMK to directly execute the 4-way handshake. But PMK caching is a very primitive technology to manage shared key between client and AP and there are many limitations; AP has to manage stateful cache for multiple clients, cache lifetime is limited, etc. Paired token (PT) \cite{LZ} is a new secondary credential scheme that provides stateless pre-shared key (PSK) in client-server environment. Server issues paired token (public token and secret token) to authenticated client where public token has the role of signed identity and secret token is a kind of shared secret. Once client is equipped with PT, it can be used for many symmetric key based cryptographic applications such as authentication, authorization, key establishment, etc. In this paper we apply the PT approach to WPA3 and try to replace the PMK caching with the one-time authenticated key establishment using PT. At the end of the authentication and association stage AP securely issues PT to client. Then in reassociation stage client and AP can compute the same one-time authenticated PMK from PT in stateless way and compute PTK using the traditional 4-way handshake protocol. Using this kind of stateless reassociation technology AP can provide high performance service to huge number of clients.

From a scientific standpoint, both temporal and spatial variables must be examined when developing programs for training various soccer scoring techniques (SSTs), but a review of current literature reveals that existing scientific studies have overlooked this combinatory influence. Consequently, there is no reliable theory on temporal-spatial identification when evaluating scoring opportunities. Quantified by using biomechanical modeling, anthropometry, and SSTs found in FIFA Puskás Award (121 nominated goals between 2009 and 2020), it is found that players’ proprioceptive/effective shooting volume (i.e. players’ attack space) could be sevenfold the currently-practiced shooting volume. The ignorance of some SSTs’ training leads to the underuse of the potential shooting volume. These overlooked SSTs are airborne and/or acrobatic techniques, perceived as high-risk and low-reward. Relying on the talent of an athlete to improvise on the fly can hardly be considered as a viable coaching strategy. Therefore, for developing science-based SST training regimes, groundbreaking studies are needed to: 1) expand the perception of shooting volume, and 2) entrain one-touch-shot techniques (airborne/acrobatic) within this volume, in short, Focusing-on-Time-in-Space. Whence, the new temporal-spatial theory could guide future researches and develop novel training programs. An increase of airborne/acrobatic goals would ultimately further enhance the excitement of the game.

In recent years, the need to contain healthcare costs due to the growing public debt of many countries, combined with the need to reduce costly travel by patients unable to move autonomously, have captured the attention of public administrators towards tele-rehabilitation. This trend has been consolidated overwhelmingly following the Covid-19 pandemic, which has made it precarious, difficult and even dangerous for patients to access hospital facilities. We present a platform devoted to the rapid prototyping of Virtual Reality based, cognitive tele-rehabilitation exercises. Patients who experienced injury or pathology need to practice a continuous training in order to recover functional abilities, and the therapist need to monitor the outcomes of such practices. The Virtual Reality exercises are designed on Unity 3D to empower the therapist to set up personalised exercises in a easy way, enabling the patient to receive personalized stimuli, which are crucial for a positive outcome of the practice. Furthermore, the reaction speed of the system is of fundamental importance, as the temporal evolution of the scene must proceed parallel to the patient’s movements, to ensure an effective and efficient therapeutic response. So, we optimized the Virtual Reality application in order to make the loading phase and the startup phase as fast as possible and we have tested the results obtained with many devices: in particular computers and smartphones with different operating systems and hardware. The implemented platform integrates in Nu!Reha system®, a tele-rehabilitation set of services that helps patients to recover cognitive and functional capabilities.

Learning systems have been very focused on creating models that are capable of obtaining the best results in error metrics. Recently, the focus has shifted to improvement in order to interpret and explain their results. The need for interpretation is greater when these models are used to support decision making. In some areas this becomes an indispensable requirement, such as in medicine. This paper focuses on the prediction of cardiovascular disease by analyzing the well-known Statlog (Heart) Data Set from the UCI’s Automated Learning Repository. This study will analyze the cost of making predictions easier to interpret by reducing the number of features that explain the classification of health status versus the cost in accuracy. It will be analyzed on a large set of classification techniques and performance metrics. Demonstrating that it is possible to make explainable and reliable models that have a good commitment to predictive performance.

With the latest advances in information and communication technologies, greater amounts of sensitive user and corporate information are constantly shared across the network making it susceptible to an attack that can compromise data confidentiality, integrity and availability. Intrusion Detection Systems (IDS) are important security mechanisms that can perform a timely detection of malicious events through the inspection of network traffic or host-based logs. Throughout the years, many machine learning techniques have proven to be successful at conducting anomaly detection but only a few considered the sequential nature of data. This work proposes a sequential approach and evaluates the performance of a Random Forest (RF), a Multi-Layer Perceptron (MLP) and a Long-Short Term Memory (LSTM) on the CIDDS-001 dataset. The resulting performance measures of this particular approach are compared with the ones obtained from a more traditional one, that only considers individual flow information, in order to determine which methodology best suits the concerned scenario. The experimental outcomes lead to believe that anomaly detection can be better addressed from a sequential perspective and that the LSTM is a very reliable model for acquiring sequential patterns in network traffic data, achieving an accuracy of 99.94% and a f1-score of 91.66%.

In response to the need to address the safety challenges in the use of artificial intelligence (AI), this research aimed to develop a framework for a safety controlling system (SCS) to solve the AI black-box mystery in the healthcare industry. The system was developed by adopting the multi-attribute value model approach (MAVT), which comprises four parts: extracting attributes, generating weights for the attributes, developing a rating scale, and finalizing the system. On the basis of the MAVT approach, three layers of attributes were created. The first level contained 6 key dimensions, the second level included 14 attributes, and the third level comprised 78 attributes. The key first-level dimensions of the SCS included safety policies, incentives for clinicians, clinician and patient training, communication and interaction, planning of actions, and control of such actions. The proposed system may provide a basis for detecting AI utilization risks, preventing incidents from occurring and developing emergency plans for AI-related risks. This approach could also guide and control the implementation of AI systems in the healthcare industry.

Public key encryption methods are often used to create a digital signature, and where Bob has a public key and a private key. In order to prove his identity, he will encrypt something related to the message with his private key, and which can then be checked with his public key. The main current methods of public-key encryption include RSA and ECC (Elliptic Curve Cryptography), and which involve computationally difficult operations. But these operations have not been proven to be hard in an era of quantum computers. One well-known hard problem is the solving of quadratic equations with $m$ equations with $n$ variables. This is a known NP-hard problem, even in a world of quantum computers. These can be used as post-quantum signature schemes and which involve multivariate equations. In order to understand these methods, this paper outlines a simple example of implementing the oil and vinegar method, and where we have a number of unknown oil variables and a number of known vinegar variables, and where the vinegar variables help convert the hard problem into an easy one.

Summary: Studying biological systems generally relies on computational modeling and simulation, e.g., for model-driven discovery and hypothesis testing. Progress in standardization efforts led to the development of interrelated file formats to exchange and reuse models in systems biology, such as SBML, the Simulation Experiment Description Markup Language (SED-ML), or the Open Modeling EXchange format (OMEX). Conducting simulation experiments based on these formats requires efficient and reusable implementations to make them accessible to the broader scientific community and to ensure the reproducibility of the results. The Systems Biology Simulation Core Library (SBSCL) provides interpreters and solvers for these standards as a versatile open-source API in Java™. The library simulates even complex bio-models and supports deterministic Ordinary Differential Equations (ODEs); Stochastic Differential Equations (SDEs); constraint-based analyses; recent SBML and SED-ML versions; exchange of results, and visualization of in silico experiments; open modeling exchange formats (COMBINE archives); hierarchically structured models; and compatibility with standard testing systems, including the Systems Biology Test Suite and published models from the BioModels and BiGG databases. Availability and implementation: SBSCL is freely available at https://draeger-lab.github.io/SBSCL/.

The main bottleneck when performing computational fluid dynamics (CFD) simulations of combustion systems is the computation and integration of the highly non-linear and stiff chemical source terms. In recent times, machine learning has emerged as a promising tool to accelerate combustion chemistry, involving the use of regression models to predict the chemical source terms as functions of the thermochemical state of the system. However, combustion is a highly nonlinear phenomenon, and this often leads to divergence from the true solution when the neural network representation of chemical kinetics is integrated in time. This is because these approaches minimize the error during training without guaranteeing successful integration with ordinary differential equation (ODE) solvers. In this work, a novel neural ODE approach to combustion modeling is developed to address this issue. The source terms predicted by the neural network are integrated during training, and by backpropagating errors through the ODE solver, the neural network weights are adjusted accordingly to minimize the difference between the predicted and actual ODE solutions. It is shown that even when the dimensionality of the thermochemical manifold is trimmed to remove redundant species, the proposed approach accurately captures the correct physical behavior and reproduces the results obtained using the full chemical kinetic mechanism.

Bootstrap resampling techinques, introduced by Efron and Rubin, can be presented in a general Bayesian framework, approximating the statistical distribution of a statistical functional φ(F), where F is a random distribution function. Efron’s and Rubin’s bootstrap procedures can be extended introducing an informative prior through the Proper Bayesian bootstrap. In this paper different bootstrap techniques are used and compared in predictive classification and regression models based on ensemble approaches, i.e. bagging models involving decision trees. Proper Bayesian bootstrap, proposed by Muliere and Secchi, is used to sample the posterior distribution over trees, introducing prior distributions on the covariates and the target variable. The results obtained are compared with respect to other competitive procedures employing different bootstrap techniques. The empirical analysis reports the results obtained on simulated and real data.

Single sample face recognition (SSFR) is a computer vision challenge. In this scenario, there is only one example from each individual on which to train the system, making it difficult to identify persons in unconstrained environments, particularly when dealing with changes in facial expression, posture, lighting, and occlusion. This paper suggests a different method based on a variant of the Binarized Statistical Image Features (BSIF) descriptor called Multi-Block Color-Binarized Statistical Image Features (MB-C-BSIF) to resolve the SSFR Problem. First, the MB-C-BSIF method decomposes a facial image into three channels (e.g., red, green, and blue), then it divides each channel into equal non-overlapping blocks to select the local facial characteristics that are consequently employed in the classification phase. Finally, the identity is determined by calculating the similarities among the characteristic vectors adopting a distance measurement of the k-nearest neighbors (K-NN) classifier. Extensive experiments on several subsets of the unconstrained Alex &amp; Robert (AR) and Labeled Faces in the Wild (LFW) databases show that the MB-C-BSIF achieves superior results in unconstrained situations when compared to current state-of-the-art methods, especially when dealing with changes in facial expression, lighting, and occlusion. Furthermore, the suggested method employs algorithms with lower computational cost, making it ideal for real-time applications.

Although the dockless bike-sharing system, which can be regarded as a typical example of the resource-sharing system, has been increasingly popular for years with people especially in China, the imbalanced distribution of shared bikes gradually becomes a major problem for both bike-sharing companies and their customers. To solve the imbalance problem, we aim to investigate the long-term performance of a system under the influence of some key factors (with an emphasis on the unequal demand between different nodes), which can guide us to discover the causes of the problem and offer several valuable suggestions to the operators. According to the fundamental principle of a dockless bike-sharing system, we propose a model reduction method to reduce the complexity of the theoretical network models, which are developed based on the Markovian queueing theory with the consideration of higher-demand nodes and lower-demand nodes. The theoretical network models provide us with steady-state probabilities of having a certain number of bikes at one node, which are used as an important part of the optimization model for solving the imbalance problem by carrying out an operator-based relocation strategy. The objective of the optimization model is to maximize the total profit and determine the optimal relocation frequency. It is found that most of the shared bikes are possible to gather at one low-demand node eventually in the long run under the influence of the different arrival rates at different nodes, but the decrease of the number of bikes at the high-demand nodes is more sensitive to the unequal demands and may cause a great loss for operators, which should be payed attention to especially when solving the relocation problems.

A new method in which completely eliminated the negative value of the scattering power is proposed in this paper. Primarily, here are presented the Freeman-Durden decomposition of the scattering powers, which are computed by using the coherency matrix elements with rotation and without rotation. Secondly, this paper investigates the reasons of the occurrence of negative values of the scattering powers. Then using the modification like in algorithm proposed by Yamaguchi for G4U, it was applied for the algorithm of Freeman-Durden decomposition to eliminate negative values. In this research, Radarsat-2 radar remote sensing data were used, which are acquired for study area Yushu County, Qinghai province, China. At the end, the comparison results of Yamaguchi G4U and a modified Freeman-Durden decompositions were presented.

Probabilistic inference problems have very broad practical applications. To solve this kind of problems under conditions of certainty, an effective mathematical apparatus has been developed. In real situations, obtaining deterministic estimates of relevant probabilities is often difficult; therefore, problems with handling uncertain estimates of probabilities appear. This paper examines the problem of probabilistic inference with probability trees provided that the initial probabilities are given in the form of intervals of their possible values.

At container terminals, many cargo handling processes are interconnected and take place in parallel. Within short time windows, many operational decisions need to be taken considering both time and equipment efficiency. During operation, many sources for disturbance exist. These are the reason why perfectly coordinated processes are possibly unraveled. An approach that considers disturbance factors while optimizing a given objective is simulation-based optimization. This study analyses simulation-based optimization as a procedure to simultaneously scale the number of utilized equipment and to adjust the choice and tuning of operational policies. The four meta-heuristics Tree-structured Parzen Estimator, Bayesian Optimization, Simulated Annealing, and Random Search guide the simulation-based optimization process. The results show that simulation-based optimization is suitable to identify the amount of required equipment and well-performing policies. Thereby, there is no clear ranking which of the meta-heuristics finds the best approximation of the optimum. The approximated optima suggest that pooling terminal trucks as well as a yard block assignment close to the quay crane is preferable. With an increasing number of quay cranes, the number of optimal terminal trucks for each quay crane decreases as well as the range of truck utilization within one experiment.

It is a theoretical exportation for mass transpiration and thermal transpiration of Casson nanofluid over an extending cylindrical surface. The Stagnation point flow through porous matrix is influenced by magnetic field of form strength. Appropriate similarity functions are availed to yield the transmuted system of leading differential equations. Existence for the solution of momentum equation is proved for various values of Casson parameter β, magnetic parameter M, porosity parameter Kp and Raynolds number Re in two situations of mass transpiration (suction/injuction). Moreover, uniqueness results are discussed and for skin friction factor are established to attain accuracy for large injection values. Thermal and concentration profiles are delineated numerically by applying Runge-Kutta method and shooting technique.

Chimeric antigen receptor (CAR)-T cell-based therapies have achieved substantial successes against B-cell malignancies, what has led to a growing scientific and clinical interest on extending their use to solid cancers. However, results for solid tumours have been limited up to now, in part due to the immuno-suppressive tumour microenvironment, that is able to inactivate CAR-T cell clones. In this paper we put forward a mathematical model describing the competition of CAR-T and tumour cells, accounting for their immunosuppressive capabilities. Using the mathematical model, we show that the use of large numbers of CAR-T cells targeting the solid tumour antigens could overcome the cancer immunosuppressive potential. To achieve such high levels of CAR-T cells we propose and study computationaly, the manufacture and injection of CAR-T cells targeting two antigens: CD19 and a tumour-associated antigen. We study in-silico the resulting dynamics of the disease after the injection of this product and find that the expansion of the CAR-T cell population in the blood and lymphopoietic organs could lead to the massive generation of an army of CAR-T cells targetting the solid tumour, and potentially overcoming its inmune suppression capabilities. That strategy could benefit from the combination with PD-1 inhibitors and of low tumour loads. Our computational results provide a theoretical support for the treatment of different types of solid tumours using T-cells engineered with combination treatments of dual CARs with on- and off-tumour activity and anti-PD1 drugs after completion of classical cytoreductive treatments.

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

This article has two objectives. Firstly, we will use the vector variational-like inequalities problems to achieve local approximate (weakly) efficient solutions of Vector Optimization Problem within the novel field of the Hadamard manifolds. Previously, we will introduce the concepts of generalized approximate geodesic convex functions and illustrate them with examples. We will see the minimum requirements under which critical points, solutions of Stampacchia and Minty weak variational-like inequalities and local approximate weakly efficient solutions can be identified, extending previous results from the literature for linear Euclidean spaces. Secondly, we will show an economical application, using again solutions of the variational problems to identify with Stackelberg equilibrium points on Hadamard manifolds and under geodesic convexity assumptions.

In this paper, we study singularities of the spherical indicatrix and evolute of spacelike ruled surface with spacelike ruling. Finally, we give an example to illustrate our results.

A new discrete distribution for count data called extended biparametric Waring (EBW) distribution is developed. Its name is related to the fact that, in a specific configuration of its parameters, it can be seen as a biparametric version of the univariate generalized Waring (UGW) distribution, a well-known model for the variance decomposition into three components: randomness, liability and proneness. Unlike the UGW distribution, the EBW can model both overdispersed and underdispersed data sets. In fact, the EBW distribution is a particular case of a UWG distribution when its first parameter is positive; otherwise, it is a particular case of a Complex Triparametric Pearson (CTP) distribution. Hence, this new model inherits most of their properties and, moreover, it helps to solve the identification problem in the variance components of the UGW model. We compare the EBW with the UGW by a simulation study, but also with other over and underdispersed distributions through the Kullback-Leibler divergence. Additionally, we have carried out a simulation study in order to analyse the properties of the maximum likelihood parameter estimates. Finally, some application examples are included which show that the proposed model provides similar or even better results than other models, but with fewer parameters.

A complex square matrix $A$ is said to be Hermitian if $A= A^{\ast}$, the conjugate transpose of $A$. The topic of the present note is concerned with the characterization of Hermitian matrix. In this note, the we show that each of the two triple matrix product equalities $AA^{\ast}A = A^{\ast}AA^{\ast}$ and $A^3 = AA^{\ast}A$ implies that $A$ is Hermitian by means of decompositions and determinants of matrices, which are named the two-sided removal and cancellation laws associated with Hermitian matrix, respectively. We also present several general removal and cancellation laws as the extensions of the preceding two facts about Hermitian matrix.

Energy consumption constantly increases day-by-day, which enforces suppliers and consumers in to plan the needs for the short and long terms. This obliges studying to device useful and accurate ways to predict the need for use in corresponding periods of the time. One of these fields of study is the efficient and uninterrupted energy supply over distribution infrastructures. It is obvious that the efficiency and performance of energy supply companies plays an important role in energy supply itself and has a critical value in determining and finetuning the future roadmap of the sector. In this study, the performance and efficiency of energy supply companies with respect to productivity is investigated over a case study of an electricity distribution company in Turkey. The factors affecting the company’s performance and their corresponding weights have been determined and elicited using analytical hierarchy process (AHP) and the Fuzzy AHP methods, as two well-known multi-criteria decision-making methods. The AHP method differs from other methods in that it can evaluate qualitative and quantitative expressions together, calculate the consistency rate, and show the hierarchical structure between sub-criteria and alternatives depending on the criteria. In addition, it is a decision-making method that is widely used in the literature. The Fuzzy AHP method, on the other hand, reflects the evaluations of people better than the classical AHP method and provides convenience during the evaluation. The results help demonstrate that the criteria elicited to evaluate the company’s energy supply performance plan a crucial role in developing strategies, policies and action plans to achieve continuous improvement and consistent development.

Several problems of radiative transfer are yet unsolved because of the difficulties of the calculations involved in them, especially if the intervening shapes are geometrically complex. The main goal of our investigation in this domain is to convert the formulas that were previously derived, into a graphical interface based on the projected solid-angle principle. Such procedure is now feasible by virtue of several widely diffused programs for Algorithms Aided Design (AAD). Accuracy and reliability of the process is controlled by means of the analytical software DianaX developed at an earlier stage by the authors. With this new approach the often cumbersome procedure of lighting and thermal exchange calculations can be simplified and made available for the neophyte, with the undeniable advantage of reduced computer time.

This paper aimed to use social media impact on student studies in higher education. Apart from enjoyment and academic purposes, many educational practices and processes have been influenced by social networks. This paper highlighted the use of media tools in higher education as well as indicates out some of the factors. Moreover, through a literature review of related articles, we aim to provide insights into the impacts of a social network on educational quality, actual use of social media, and performance impact in higher education. A questionnaire survey on constructivism was circulated among a total of 206 university students as the key method for collecting data. This research hypothesizes educational quality and actual social media use indicates a positive effect in education, all of which also hypothesizes constructivism for educational quality and actual social media that in turn improve students’ satisfaction, and performance impact. Moreover, all research findings were attained through a quantitative method using the Structural Equation Modeling (SEM-AMOS). Findings of this research to indicate a positive effects students on their academic through behavioral intention to utilize social media to actual social media use for teaching and learning on higher education. Moreover, the results mention the use of social media for learning purpose, as well as social media to enables the sharing of knowledge, discussions, and information to enhance students' learning activities, Further studies are recommended which universities educators should take this into consideration when planning their curricula; it comes to the inclusion of technology in the teaching process.

The danger is still very large from cross site scripting attacks. When designing web applications We must follow as much as we can prevention rules and don’t leave any loophole to our programs. Experience is a great factor for programmers to know these attacks and for a trainee programmer is a difficult task to spot all the weak points. In this article we present a tutorial on launching an XSS attack and also we propose simple solutions.

Anomaly occurrences in hydraulic machinery may lead to massive systems shut down, jeopardizing the safety of the machinery and its surrounding human operator(s) and environment, and the severe economic implications succeeding the faults and their associated damage. Hydraulics are mostly placed in ruthless environments, where they are consistently vulnerable to many faults. Hence, not only the machines and their components are prone to anomalies, but also the sensors attached to them, which monitor and report their health and behavioral changes. In this work, a comprehensive applicational analysis of anomalies in hydraulic systems extracted from a hydraulic test rig is thoroughly achieved. Firstly, we provided a combination of a new architecture of LSTM autoencoders and supervised machine and deep learning methodologies to perform two separate stages of fault detection and diagnosis. The two phases are condensed by: the detection phase using the LSTM autoencoder. Followed by the fault diagnosis phase represented by the classification schema. The previously mentioned framework is applied to both component and sensor faults in hydraulic systems, deployed in the form of two in-depth applicational experiments. Moreover, a thorough literature review of the past decade related work for the two stages separately is successfully conducted in this paper.

The progressive impairment analysis in gait from neurological diseases patients such as Hereditary Ataxias (HA) has been carried out using gait data collected with movement sensors. This research is focused on finding the minimum amount required of gait features to recognize efficiently and less intrusive way, HA patients based on data collected with iPhone movement sensors placed on the ankles from 14 HA patients and 14 healthy people. A twofold proposal is made , first a local minimum prominent peak criterion to find out the starting point of each stride, to get 10-stride window about which 56 spatial-temporal features are derived; second a search strategy based on Hill Climbing algorithm to reduce the number of gait features and sensors. The main results were the findings that with two gait patterns a 96% of classification accuracy was achieved by using K-Nearest Neighbors (KNN) and Multi-Layer Perceptron (MLP) algorithms, but in addition, MLP only right ankle sensor patterns were required which also allows to reduce the intrusion.

The eruption of COVID-19 patients in 215 countries worldwide has urged for robust predictive methods that can detect as early as possible the size and duration of the contagious disease and also providing precision predictions. In much recent literature reported on COVID-19, one or more essential parts of such investigation were missed. One of the crucial elements for any predictive method is that such methods should fit simultaneously as much data as possible; these data could be total infected cases, daily hospitalized cases, cumulative recovered cases, and deceased cases, and so on. Other crucial elements include sensitivity and precision of such predictive methods on the amount of data as the contagious disease evolved day by day. To show the importance of these aspects, we have evaluated the standard SIRD model and a newly introduced Gaussian-SIRD model on the development of COVID-19 in Kuwait. It is observed that the SIRD model quickly picks up the main trends of COVID-19 development, but the Gaussian-SIRD model provides precise prediction a longer period of time.

Nonparametric assessments of police technical and scale efficiency is challenging because of the stochastic nature of criminal behavior and because of the subjective dependence on multiple decision criteria, which can lead to a more or less efficiency prospect depending on the regulation, necessity, or organizational objective. There is a trade-off between efficiency and effectiveness in many police performance assessments, i.e., efficient departments (producing more clear-ups with a given resource) are crime-specialized or cannot reproduce those good results effectively on more severe or complex occurrences. This study proposes a combined methodology for carrying out efficiency and effectiveness analysis of Police departments. A conditional non-parametric approach, which allows to include crime as an external factor in the analysis, is combined with a non-compensatory ranking based on the PROMETHEE II methodology for the approach illustrated on the multidimensional efficiency and effectiveness comparison of 145 Pernambuco (Brazil)'s police departments. The application results offer compelling perspectives for public administrations concerning the strategic prioritization of units for rewards or interventions.

In a generalized topological space T_g = (Ω, T_g) (T_g-space), the g-topology T_g : P (Ω) −→ P (Ω) can be characterized in the generalized sense by specifying the generalized open, generalized closed sets (g-T_g-open, g-T_g-closed sets), generalized interior, generalized closure operators g-Intg, g-Cl_g : P (Ω) −→ P (Ω) (g-T_g-interior, g-T_g-closure operators), or generalized derived, generalized coderived operators g-Der_g, g-Cod_g : P (Ω) −→ P (Ω) (g-T_g-derived, g-T_g-coderived operators), respectively. For very many T_g-spaces, the δ^th-iterates g-Der_g^(δ), g-Cod_g^(δ) : P (Ω) −→ P (Ω) of g-Der_g, g-Cod_g : P (Ω) −→ P (Ω), respectively, defined by transfinite recursion on the class of successor ordinals are also themselves g-T_g-derived, g-T_g-coderived operators for new g-topologies in the generalized sense on Ω. Thus, the use of novel definitions of g-T_g-derived, g-T_g-coderived operators g-Der_g, g-Cod_g : P (Ω) −→ P (Ω), respectively, based on a very clever construction, together with their δ^th-iterates g-T_g-operators g-Der_g^(δ), g-Cod_g^(δ) : P (Ω) −→ P (Ω), defined by transfinite recursion on the class of successor ordinals, will give rise to novel generalized g-topologies on Ω. The present authors have been actively engaged in the study of g-T_g-operators in T_g-spaces. The study of the essential properties and the commutativity of novel definitions of g-T_g-interior and g-T_g-closure operators g-Int_g, g-Cl_g : P (Ω) −→ P (Ω), respectively, in T_g has formed the first part, and the study of the essential properties and sets of consistent, independent axioms of novel definitions of g-T_g-exterior and g-T_g-frontier operators g-Ext_g, g-Fr_g : P (Ω) −→ P (Ω), respectively, has formed the second part. In this work, which forms the last part on the theory of g-T_g-operators in T_g-spaces, the present authors propose to present novel definitions and the study of the essential properties of g-T_g-derived and g-T_g-coderived operators g-Der_g, g-Cod_g : P (Ω) −→ P (Ω), respectively, and their δ^th-iterates, and the notions of g-T_g-open and g-T_g-closed sets of ranks δ in T_g-spaces.

This paper presents an effective heart disease prediction model through detecting the anomalies, also known as outliers, in healthcare data using the unsupervised K-means clustering algorithm. Most existing approaches for detecting anomalies are based on constructing profiles of normal instances. However, such techniques require an adequate number of normal profiles to justify those models. Our proposed model first evaluates an \textit{optimal} value of K using Silhouette method. Next, it intends to locate anomalies that are far from a certain threshold distance with respect to their clusters. Finally, the five most popular classification techniques such as K-Nearest Neighbor (KNN), Random Forest (RF), Support Vector Machines (SVM), Naive Bayes (NB), and Logistic Regression (LR) are applied to build the resultant prediction model. The effectiveness of the proposed methodology is justified using a benchmark dataset of heart disease.

Generation Y is known as job jumpers because of the desire to earn a higher salary, career opportunities and opportunities to develop themselves. One type of work is a teacher because by becoming a teacher they get a better life, one of which is by getting extra income from the government for those who already have teacher certification, this is what encourages Generation Y to choose this profession. this study uses crosstabs for the data analysis process because the data comes from the LMS database owned by XYZ Campus. Millennial educators who have the highest performance value of PJJ Information Systems for Information System Engineering Cluster with a value of 5.19. The impact of transactions on millennial lecturers on students is able to fulfill any given workload. Appreciate millennial lecturers in tangible and intangible forms.

Due to the tremendous progress in the automotive industry, the growth of the urban population, the number of vehicles is increasing and this creates parking challenges. Intelligent parking management systems offer an optimal solution for finding empty parking space so that drivers can quickly find their car parking space. To solve these problems, it is necessary to design an intelligent parking system, in addition to providing comfort to drivers, which is also economically viable. This paper proposes an intelligent multi-storey car parking system with the help of RFID technology and examining user preferences that can effectively solve car parking problems. The proposed method is a multi-objective decision-making method to reduce the problem of car parking, which is called MODM-RPCP. Therefore, the proposed MODM-RPCP method can allocate the best space for their stopping place by using the decision-making system and based on the priorities considered by the users. The simulation results show that the MODM-RPCP reduces the average booking time more than 19.2% and 27.1%, and decreases the response time of central parking management server more than 20.1% and 29.78% compared to MOGWOLA and ODPP approaches.

With the rapid development of smart phones, tablets and their operative systems, many positioning enabled sensors have been built into these devices. Users can now accurately fix their location according to the function of GPS receivers. For indoor environments, as in the case we are studying, WiFi based positioning is preferred to GPS due to the attenuation or obstruction of signals. This paper deals with the automatic classification of customers in a Sports Shop Center on the basis of their movements around the shop's premises. To achieve this goal, we start by collecting (x,y) coordinates from customers while they visit the store. Consequently, any costumer's path through the shop is formed by a list of coordinates, obtained with a frequency of one measurement per minute. Then, a guess about the full trajectory is constructed and a number of parameters about these trajectories is calculated before performing an Unsupervised Learning Clustering Process. As a result, we can identify several types of customers, and the dynamics of their behavior inside the shop. This information is of great value to the company, to be used both in the long term and also in short periods of time, monitoring the current state of the shop at any moment, identifying different types of situation appearing during restricted periods, or predicting customer flow conditions

Considering the significant advancements in autonomous vehicle technology, research in this field is of interest to researchers. To drive vehicles autonomously, controlling steer angle, gas hatch, and brakes need to be learned. The behavioral cloning method is used to imitate humans’ driving behavior. We created a dataset of driving in different routes and conditions and using the designed model, the output used for controlling the vehicle is obtained. In this paper, the Learning of Self-driving Vehicles Based on Real Driving Behavior Using Deep Neural Network Techniques (LSV-DNN) is proposed. We designed a convolutional network which uses the real driving data obtained through the vehicle’s camera and computer. The response of the driver is during driving is recorded in different situations and by converting the real driver’s driving video to images and transferring the data to an excel file, obstacle detection is carried out with the best accuracy and speed using the Yolo algorithm version 3. This way, the network learns the response of the driver to obstacles in different locations and the network is trained with the Yolo algorithm version 3 and the output of obstacle detection. Then, it outputs the steer angle and amount of brake, gas, and vehicle acceleration. The LSV-DNN is evaluated here via extensive simulations carried out in Python and TensorFlow environment. We evaluated the network error using the loss function. By comparing other methods which were conducted on the simulator’s data, we obtained good performance results for the designed network on the data from KITTI benchmark, the data collected using a private vehicle, and the data we collected.

Unmanned aerial systems (UASs) create an extensive fighting capability of the developed military forces. Particularly, these systems carrying confidential data are exposed to security attacks. By the wireless’s nature within these networks, they become susceptible to different kinds of attacks, hence, it seems essential to design the appropriate safety mechanism in such networks. The sinkhole attack is one of the most dangerous and threatening attacks amongst types of attack in UAS. A malicious UAV exists in such a threat attacking as a black hole for absorbing all traffic in the network. Mainly, in a Flow-based protocol, the attacker considers the requests on the route, then, it replies to the target UAV such as high quality or the best route towards Gard station. The malicious UAV is able to only insert itself on one occasion between the nodes relating to each other (such as sink node and sensor node), and act for passing packets among them. In this study, the malicious attacks are detected and purged using two stages were. In the first stage, some principles and rules are used to detect black hole, gray hole, and sinkhole attacks. In the second stage, using a smart agent-based strategy negotiation procedure for three steps, a defense mechanism is designed to prevent these attacks. The smart agent is used by reliable neighbors via the negotiation procedure for three steps, hence, the traffic formed by the malicious UAV is not considered. The suggested protocol is called SAUAS. Here, the technique is assessed through extensive simulations performed in the NS-3 environment. Based on the simulation outcomes, it is indicated that the UAS network performance metrics are enhanced based on the packet delivery rate, detection rate, false-negative rate and false-positive rate.

Nowadays, speed up development and use of digital devices such as smartphones have put people at risk of internet crimes. The evidence of present crimes in a computer file can be easily unreachable by changing the prefix of a file or other algorithms. In more complex cases, either file divided into different parts or the parts of a file that has information about the file type are deleted, where the file fragment recognition issue is discussed. The known files are divided into different fragments, and different classification algorithms to solve the problems of file fragment recognition. A confusion matrix measures the accuracy of type recognition. In the present study, first, the file is divided into different fragments. Then, the file fragment features, which are obtained from Binary Frequency Distribution (BFD), are reduced by 2 feature reduction algorithms; Sequential Forward Selection algorithm (SFS) as well as Sequential Floating Forward Selection algorithm (SFFS) to delete sparse features that result in increased accuracy and speed. Finally, the reduced features are given to 3 classifier algorithms, Multilayer Perceptron (MLP), Support Vector Machines (SVM), and K-Nearest Neighbor (KNN) for classification and comparison of the results. In this paper, we proposed the algorithm of file type recognition that can recognize 6 types of useful files ( pdf, txt, jpg, doc, html, exe), which may distinguish a type of file fragments with higher accuracy than the similar works done.

Nowadays, customers play a very important and vital role in the field of global economy. As a result, companies give special significance to the customers to survive and grow in the field of economic competition in the modern world and increase their relationship with the buyers of their products and services throughout their lifetime. Marketing growth through mobile phones has provided further motives for performing more researches in the field of customer behavior and attitude in mobile marketing. The goal of the current study is to analyze the effective factors on customer behavior in mobile marketing. The variables used in this study are perceived ease of use, individual knowledge, user’s mobile phone technology, customers’ negative attitudes, and customers’ positive attitudes. The current research is practical in terms of objective and is descriptive-analytic in terms of methodology. Data were gathered by distributing a questionnaire among 284 students of Tehran University. Data were analyzed by structural equation modeling using Lisrel and Expert Choice software. Test results showed that ease of use, individual knowledge, mobile phone technology, positive attitude, and negative attitude variables have a meaningful effect on customer behavior in mobile marketing. The confirmation of all the assumptions of the research supports the importance of the customer behavior analysis in mobile phone services.

In Differentiated Services (DiffServ) architecture, Priority Service System (PSS) plays a vital responsibility to provide Quality-of-Service (QoS) for the applications based on networks. Priority queuing systems has always been a subject of interest for analytical modelling and evaluating the performance. However, previous works have mainly focused on performing priority queuing under range dependent traffics, namely Short Range Dependent (SRD) or Long Range Dependent (LRD). Recent studies revealed that realistic traffic demonstrates a heterogeneous nature for the modern networks that provide multiple services. In this paper, the results of analytical and simulation models of dynamic priority service systems is reviewed to study the heterogeneous traffic impact on designing and performance of the systems based on networks. In this paper, the results of analytical and simulation models of dynamic priority service systems is reviewed to investigate the impact of heterogeneous traffic on the design and performance of network-based systems. Here, the time of presence of requests in limited and unlimited buffer system is restricted. If the restriction is violated, the requests will be lost. The results of experiments conducted on both models are compared and it is identified that they differ in the allowable limit (2-9) %.

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.

Multiagent technologies give a new way to study and control complex systems. Local interactions between agents often lead to group synchronization also known as clusterization, which usually is a more rapid process in comparison with relatively slow changes in external environment. Usually, the goal of system control is defined by the behaviour of a system on long time intervals. When these time intervals are much longer than the time of cluster formation, clusters may be considered as new variables in a ``slow'' time model. We call such variables ``mesoscopic'' to emphasize their scale laying between the level of the whole system (macroscopic scale) and the level of individual agents (microscopic scale). Thus, it allows us to reduce significantly the dimensionality of a system by omitting considerations of each separated agent, so that we may hope to reduce the required amount of control inputs. Thus, we are often able to consider a system as a collection of ``flowing'' (morphing) clusters emerged form behaviour of a huge amount of individual agents. In this paper, we contrast such approach to the one where a system is considered as a network of elementary agents. We develop a mathematical framework for analysis of cluster flows in multiagent networks and use it to analyze the Kuramoto model as an attracting example of a complex networked system. In this model, a clusterization leads to sparse representation of dynamic trajectories in the whole quantized state space. With that in mind, compressive sensing allows to restore the trajectories in a high-dimensional discrete state space based on significantly lower amount of randomized integral mesoscopic observations. We propose a corresponding algorithm of quantized dynamic trajectory compression. It could allow us to efficiently transmit the state space data to a data center for further control synthesis. The theoretical results are illustrated for a simulated multiagent network with multiple clusters.

Let b∈Cn∖{0} be a fixed direction. We consider slice holomorphic functions of several complex variables in the unit ball, i.e. we study functions which are analytic in intersection of every slice {z0+tb:t∈C} with the unit ball Bn={z∈C:|z|:=|z|12+…+|zn|2&lt;1} for any z0∈Bn. For this class of functions there is introduced a concept of boundedness of L-index in the direction b where L:Bn→R+ is a positive continuous function such that L(z)&gt;β|b|1−|z|, where β&gt;1 is some constant. For functions from this class we describe local behavior of modulus of directional derivatives on every ’circle’ {z+tb:|t|=r/L(z)} with r∈(0;β],t∈C,z∈Cn. It is estimated by value of the function at center of the circle. Other propositions concern a connection between boundedness of L-index in the direction b of the slice holomorphic function F and boundedness of lz-index of the slice function gz(t)=F(z+tb) with lz(t)=L(z+tb). Also we show that every slice holomorphic and joint continuous function in the unit ball has bounded L-index in direction in any domain compactly embedded in the unit ball and for any continuous function L:Bn→R+.

The phenomenal mathematical efficiency of quantum field theories in modern high-speed information and communication systems has a very simple explanation from the point of view of common sense and higher mathematical logic: all of them – quantum cosmology, quantum physics, quantum metrics and quantum calculus – are the self-informational mathematical systems based on symbolic and numerical functional analysis and elementary recursive calculations of interrelated space and time parameters of matter motion in various states of the material environment.For the first time in scientific and engineering practice, it was clearly shown that the information entropy of both standard symbolic and non-standard numerical functional analysis has absolute exact limits of computational accuracy – 1/10^16 and 1/10^64, respectively. Moreover, the second limit determines the maximum level of accuracy of practical quantum metrics and calculations and fully coordinates four branches of classical physics – thermodynamics, electrodynamics, gravidynamics, chromodynamics with special and general relativity.

The fossil record is notorious for being incomplete and distorted, frequently conditioning the type of knowledge that can be extracted from it. In many cases, this often leads to issues when performing complex statistical analyses, such as classification tasks, predictive modelling, and variance analyses, such as those used in Geometric Morphometrics. Here different Generative Adversarial Network architectures are experimented with, testing the effects of sample size and domain dimensionality on model performance. For model evaluation, robust statistical methods were used. Each of the algorithms were observed to produce realistic data. Generative Adversarial Networks using different loss functions produced multidimensional synthetic data significantly equivalent to the original training data. Conditional Generative Adversarial Networks were not as successful. The methods proposed are likely to reduce the impact of sample size and bias on a number of statistical learning applications. While Generative Adversarial Networks are not the solution to all sample-size related issues, combined with other pre-processing steps these limitations may be overcome. This presents a valuable means of augmenting geometric morphometric datasets for greater predictive visualization.

We are concerned with the use of some classical spectral collocation methods as well as with the new software system Chebfun in order to compute high order (index) eigenpairs of singular as well as regular Schrodinger eigenproblems. We want to highlight both the qualities as well as the shortcomings of these methods and evaluate them vis-a-vis the usual ones. In order to resolve a boundary singularity we use Chebfun with the simple domain truncation technique. Although this method is equally easy to apply with spectral collocation, things are more nuanced in the case of these methods. A special technique to introduce boundary conditions as well as a coordinate transform which maps an unbounded domain to a nite one are the ingredients. A challenging set of "hard" benchmark problems, for which usual numerical methods (f. d., f. e. m., shooting etc.) fail, are analysed. In order to separate "good"and "bad"eigenvalues we estimate the drift of the set of eigenvalues of interest with respect to the order of approximation and/or scaling of domain parameter. It automatically provides us with a measure of the error within which the eigenvalues are computed and a hint on numerical stability. We pay a particular attention to problems with almost multiple eigenvalues as well as for problems with a mixed (continuous) spectrum. In the latter case we try to numerically highlight its existence. Special attention will be paid to the higher eigenpairs (the pair of eigenvalue and the corresponding eigenfunction approximated by an eigenvector spanning its nodal values).