Volume 10, Issue 1

The problem of maximizing a linear function with linear and quadratic constraints is considered. The solution of the problem is obtained in a constructive form using the Lagrange function and the optimality conditions. Many optimization problems can be reduced to the problem of this type. In this paper, as an application, we consider an improper linear programming problem formalized in the form of maximization of the initial linear criterion with a restriction to the Euclidean norm of the correction vector of the right-hand side of the constraints or the Frobenius norm of the correction matrix of both sides of the constraints.

The Charged Balls Method is based on physical ideas. It allows one to solve problem of finding the minimum distance from a point to a convex closed set with a smooth boundary, finding the minimum distance between two such sets and other problems of computational geometry. This paper proposes several new quick modifications of the method. These modifications are compared with the original Charged Ball Method as well as other optimization methods on a large number of randomly generated model problems. We consider the problem of orthogonal projection of the origin onto an ellipsoid. The main aim is to illustrate the results of numerical experiments of Charged Balls Method and its modifications in comparison with other classical and special methods for the studied problem.

Any real continuous bounded function of many variables is representable as a superposition of functions of one variable and addition. Depending on the type of superposition, the requirements for the functions of one variable differ. The article investigated one of the options for the numerical implementation of such a superposition proposed by Sprecher. The superposition was presented as a three-layer Feedforward neural network, while the functions of the first’s layer were considered as a generator of space-filling curves (Peano curves). The resulting neural network was applied to the problems of direct kinematics of parallel manipulators.

Nonlinear least squares iterative solver is considered for real-valued sufficiently smooth functions. The algorithm is based on successive solution of orthogonal projections of the linearized equation on a sequence of appropriately chosen low-dimensional subspaces. The bases of the latter are constructed using only the first-order derivatives of the function. The technique based on the concept of the limiting stepsize along normalized direction (developed earlier by the author) is used to guarantee the monotone decrease of the nonlinear residual norm. Under rather mild conditions, the convergence to zero is proved for the gradient and residual norms. The results of numerical testing are presented, including not only small-sized standard test problems, but also larger and harder examples, such as algebraic problems associated with canonical decomposition of dense and sparse 3D tensors as well as finite-difference discretizations of 2D nonlinear boundary problems for 2nd order partial differential equations.

Advanced optimization algorithms with a variety of configurable parameters become increasingly difficult to apply effectively to solving optimization problems. Appropriate algorithm configuration becomes highly relevant, still remaining a computationally expensive operation. Development of machine learning methods allows to model and predict the efficiency of different solving strategies and algorithm configurations depending on properties of optimization problem to be solved. The paper suggests the Dependency Decomposition approach to reduce computational complexity of modeling the efficiency of optimization algorithm, also considering the amount of computational resources available for optimization problem solving. The approach requires development of explicit Exploratory Landscape Analysis methods to assess a variety of significant characteristic features of optimization problems. The results of feature assessment depend on the number of sample points analyzed and their location in the design space, on top of that some of methods require additional evaluations of objective function. The paper proposes new landscape analysis methods based on given points without the need of any additional objective function evaluations. An algorithm of building a so-called Full Variability Map is suggested based on informativeness criteria formulated for groups of sample points. The paper suggests Generalized Information Content method for analysis of Full Variability Map which allows to get accurate and stable estimations of objective function features. The Sectorization method of Variability Map analysis is proposed to assess characteristic features reflecting such properties of objective function that are critical for optimization algorithm efficiency. The resulting features are invariant to the scale of objective function gradients which positively affects the generalizing ability of problems classification algorithm. The procedure of the comparative study of effectiveness of landscape analysis algorithms is introduced. The results of computational experiments indicate reliability of applying the suggested landscape analysis methods to optimization problem characterization and classification.

The paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered. An algorithm of artificial tree generation is formulated according to this criterion. The process of simulator modeling is described, several computational experiments are conducted. Their results show a hyperbolic decrease trend for modeled time as the number of computational units grows, which is concluded to be similar to real systems.

A two-stage continuous-discrete optimal partitioning-allocation problem is studied, and a method and an algorithm for its solving are proposed. This problem is a generalization of a classical transportation problem to the case when coordinates of the production points (collection, storage, processing) of homogeneous products are continuously allocated in the given domain and the production volumes at these points are unknown. These coordinates are found as a solution of the corresponding continuous optimal set-partitioning problem in a finite-dimensional Euclidean space with the placement (finding coordinates) of these subsets’ centers. Also, this problem generalizes discrete two-stage production-transportation problems to the case of continuously allocated consumers. The method and algorithm are illustrated by solving two model problems.

Nature inspired swarm based meta-heuristic optimization technique is getting considerable attention and established to be very competitive with evolution based and physical based algorithms. This paper proposes a novel Buyer Inspired Meta-heuristic optimization Algorithm (BIMA) inspired form the social behaviour of human being in searching and bargaining for products. In BIMA, exploration and exploitation are achieved through shop to shop hoping and bargaining for products to be purchased based on cost, quality of the product, choice and distance to the shop. Comprehensive simulations are performed on 23 standard mathematical and CEC2017 benchmark functions and 3 engineering problems. An exhaustive comparative analysis with other algorithms is done by performing 30 independent runs and comparing the mean, standard deviation as well as by performing statistical test. The results showed significant improvement in terms of optimum value, convergence speed, and is also statistically more significant in comparison to most of the reported popular algorithms.

A new approach to determining the attitude of a rigid body is suggested, which does not rely on the use of magnetometers. In the framework of this approach, the problem of determining the attitude reduces to solving a minimization problem for a function of three variables (angles characterizing the initial attitude of the body). The proposed method can be employed in precise geodetic measurements carried out with the use of a geodetic pole with a satellite antenna and an IMU installed on its top when, for some reasons, the surveyor cannot position the pole vertically (e.g., near walls or buildings). The use of the traditional approach, which relies on a compass and accelerometers, in this case does not ensure the desired accuracy of the attitude determination due to magnetic disturbances (both external ones and those induced by the receiver) affecting badly compass readings. The discussion is illustrated by results of field experiments.

We consider an equilibrium problem for an elastic body with a crack, on the faces of which unilateral non-penetration conditions and Coulomb friction are realized. This problem can be formulated as quasi-variational inequality. To solve it, the successive approximation method is applied. On each outer step of this method, we solve an auxiliary problem with given friction. We solve the auxiliary problem by using modified Lagrange functionals. Numerical results are presented.

The technology of formal quantitative estimation of the conformity of mathematical models to the available dataset is presented. The main purpose of the technology is to make the model selection decision-making process easier for the researcher. The method is a combination of approaches from the areas of data analysis, optimization and distributed computing including: cross-validation and regularization methods, algebraic modeling in optimization and methods of optimization, automatic discretization of differential and integral equations, and optimization REST-services. The technology is illustrated by a demo case study. A general mathematical formulation of the method is presented. It is followed by a description of the main aspects of algorithmic and software implementation. The list of success stories of the presented approach is substantial. Nevertheless, the domain of applicability and important unresolved issues are discussed.

In this paper, a sliding mode controller (SMC) with PID surface is designed for the trajectory tracking control of a robot manipulator using different optimization algorithms such as, Antlion Optimization Algorithm (ALO) Sine Cosine Algorithm (SCA) Grey Wolf Optimizer (GWO) and Whale Optimizer Algorithm (WOA). The aim of this work is to introduce a novel SMC-PID-ALO to control nonlinear systems, especially the position of two of the joints of a 2DOF robot manipulator. The basic idea is to determinate four optimal parameters ( K p , K i , K d and lamda) ensuring the best performance of a robot manipulator system, minimizing the integral time absolute error criterion (ITAE) and the integral time square error criterion (ISTE). The robot manipulator is modeled in Simulink and the control is implemented using the MATLAB environment. The obtained simulation results prove the robustness of ALO in comparison with other algorithms.

Blockchain plays a significant role in providing security during data handling operations and defines how trusted transactions can be carried out addressing the solution for internet facing vulnerability problems. Blockchain solves the security fault line among AI and IoT, where most of the IoT devices are connected to each other through public networks. This special issue aims to publish a collection of high quality research articles in the area of blockchain, IoT and Machine Learning.

Nowadays, the automobile sector is one of the hottest applications, where vehicles can be intelligent by using IoT technology. But unfortunately, these vehicles suffer from many crimes. Hence it has become a big challenge for the IoT to avoid such these crimes from professional thieves. This paper presents a proposal for the development of a vehicle guard and alarm system using biometric authentication based on IoT technology. Whereas, for vehicle security issues; the proposed system VSS − IoT gives only full access for authorized vehicle’s driver based on the interface of a Raspberry Pi 3 Model B + development board, Pi camera, PIR sensor, and smart-phone. Therefore, if the proposed system detects an unauthorized person inside the vehicle, then the system will notify and send his image to vehicle’s owner and/or to a police workstation through the Internet, as well as, its location in case the vehicle is stolen or damaged. The proposed system is tested on two datasets that are ORL dataset and our dataset. The experimental results of the VSS − IoT showed that the accuracy is 98.2% on ORL dataset, whereas 99.6% when applied on our dataset. Besides, the V SS − IoT enhances the sensitivity to 97.7% which is important for real-time. As well as the result demonstrated that the proposed system took shorter time 0.152 sec under different illumination conditions, when the value of the threshold is 3 * 10 3 and 3.50 * 10 3 . Therefore, the VSS − IoT is very robust and reliable for face recognition when deployed on the low-power processor.

Link prediction problem has received remarkable interest in recent past. In this paper, firefly swarm intelligence algorithm is used to perform link prediction exploiting the topological and node attribute features of social network. Fireflies will be made to traverse on nodes and edges of social networks and the brightness of fireflies will play a major role in their movement. Common neighbor method of link prediction is used to compute similarity score upon each iteration. Performance of the proposed algorithm were analyzed over standard data sets using validation method called ten-fold method. The accuracy of proposed work is measured in terms of Area Under the Curve Characteristics (AUC), Recall and Precision. Experimental results showed that the proposed work outperforms the methods proposed in the literature.

Web service compositions are commendable in structuring innovative applications for different Internet-based business solutions. The existing services can be reused by the other applications via the web. Due to the availability of services that can serve similar functionality, suitable Service Composition (SC) is required. There is a set of candidates for each service in SC from which a suitable candidate service is picked based on certain criteria. Quality of service (QoS) is one of the criteria to select the appropriate service. A standout amongst the most important functionality presented by services in the Internet of Things (IoT) based system is the dynamic composability. In this paper, two of the metaheuristic algorithms namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are utilized to tackle QoS based service composition issues. QoS has turned into a critical issue in the management of web services because of the immense number of services that furnish similar functionality yet with various characteristics. Quality of service in service composition comprises of different non-functional factors, for example, service cost, execution time, availability, throughput, and reliability. Choosing appropriate SC for IoT based applications in order to optimize the QoS parameters with the fulfillment of user’s necessities has turned into a critical issue that is addressed in this paper. To obtain results via simulation, the PSO algorithm is used to solve the SC problem in IoT. This is further assessed and contrasted with GA. Experimental results demonstrate that GA can enhance the proficiency of solutions for SC problem in IoT. It can also help in identifying the optimal solution and also shows preferable outcomes over PSO.

Assistive technology has proven to be one of the most significant inventions to aid people with Autism to improve the quality of their lives. In this study, a real-time emotion recognition system for autistic children has been developed. Emotion recognition is implemented by executing three stages: Face identification, Facial Feature extraction, and feature classification. The objective is to frame a system that includes all three stages of emotion recognition activity that executes expeditiously in real time. Thus, Affectiva SDK is implemented in the application. The propound system detects at most 7 facial emotions: anger, disgust, fear, joy, sadness, contempt, and surprise. The purpose for performing this study is to teach emotions to individuals suffering from autism, as they lack the ability to respond appropriately to others emotions. The proposed application was tested with a group of typical children aged 6–14 years, and positive outcomes were achieved.

Even though there is continuous improvement in road and vehicle safety, road traffic incidents have been increasing over last few decades. There is a need to reduce traffic incidents like accidents through predictive analysis and timely warnings while at the same time data related to accidents and traffic violations need to be maintained in a tamper proof storage system that can be retrieved for forensic analysis and law enforcement at a later stage. The Secure Incident and Evidence Management Framework (SIEMF) proposed in this work address these two challenges of predictive modeling for timely warning and secure evidence management for forensics analysis in case of accidents and traffic violations. The system proposes a deep learning based predictive incident modeling with blockchain and CP-ABE based access control for the incident data stored in blockchain.

In the distributed computing worldview, the client and association’s information is put away remotely on the cloud server. Clients and associations can get to applications, administrations, and foundation on-request from a cloud server through the internet, withstanding the various advantages, numerous difficulties, and issues that endure verifying cloud information access and capacity. These difficulties have featured additional security and protection issues as cloud specialist co-ops are exclusively in charge of the capacity and handling of the association’s information out of its physical limits. Hence, a robust security plan is required in order to ensure the association’s touchy information emerges to keep the information shielded and distant from programmers. Over the globe, specialists have proposed fluctuated security structures having an alternate arrangement of security standards with changing computational expense. Down to earth usage of these structures with low calculation cost remains an extreme test to tackle, as security standards have not been characterized. Methodology – To verify the cloud and deal with all security standards, we propose a REGISTRATION AUTHENTICATION STORAGE DATA ACCESS (RASD) structure for giving security to authoritative information put away on cloud catalogs utilizing a novel security plot, for example, H E E T P S . A RASD system involves a stage by stage process-Enlistment of clients, Authentication of the client secret key, and Capacity of information just as information access on cloud registry. When the system is connected to cloud servers, all the delicate information put away on the cloud will end up being accessible just to verified clients. The essential favourable position of the proposed RASD structure is its simple usage, high security, and overall less computational expense. Moreover, we propose a homomorphic-private-practical uniformity testing-based plan structured under a schematic calculation C he A et D Ps . This calculation executes homomorphic encryption with subtractive fairness testing, notwithstanding low computational intricacy. To test the security ability, we tried the proposed RASD system with other existing conventions like Privacy-protecting examining convention, group reviewing convention, verified system coding convention, and encoded information preparing with homomorphic re-encryption convention. Findings – Experimentation-based outcomes demonstrated that the RASD structure not only gives a high-security layer for delicate information but also enables a decrease in computational expense and performs better when compared with existing conventions for distributed computing.

Researchers in bio-sciences are increasingly harnessing technology to improve processes that were traditionally pegged on pen-and-paper and highly manual. The pen-and-paper approach is used mainly to record and capture data from experiment sites. This method is typically slow and prone to errors. Also, bio-science research activities are often undertaken in remote and distributed locations. Timeliness and quality of data collected are essential. The manual method is slow to collect quality data and relay it in a timely manner. Capturing data manually and relaying it in real time is a daunting task. The data collected has to be associated to respective specimens (objects or plants). In this paper, we seek to improve specimen labelling and data collection guided by the following questions; (1) How can data collection in bio-science research be improved? (2) How can specimen labelling be improved in bio-science research activities? We present WebLog , an application that we prototyped to aid researchers generate specimen labels and collect data from experiment sites. We use the application to convert the object (specimen) identifiers into quick response (QR) codes and use them to label the specimens. Once a specimen label is successfully scanned, the application automatically invokes the data entry form. The collected data is immediately sent to the server in electronic form for analysis.

In this paper, the authors propose to increase the efficiency of blockchain mining by using a population-based approach. Blockchain relies on solving difficult mathematical problems as proof-of-work within a network before blocks are added to the chain. Brute force approach, advocated by some as the fastest algorithm for solving partial hash collisions and implemented in Bitcoin blockchain, implies exhaustive, sequential search. It involves incrementing the nonce (number) of the header by one, then taking a double SHA-256 hash at each instance and comparing it with a target value to ascertain if lower than that target. It excessively consumes both time and power. In this paper, the authors, therefore, suggest using an inner for-loop for the population-based approach. Comparison shows that it’s a slightly faster approach than brute force, with an average speed advantage of about 1.67% or 3,420 iterations per second and 73% of the time performing better. Also, we observed that the more the total particles deployed, the better the performance until a pivotal point. Furthermore, a recommendation on taming the excessive use of power by networks, like Bitcoin’s, by using penalty by consensus is suggested.

Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph as a description of a pan-genome, comprising the genomes of many individuals/strains of the same or closely related species. Subsequent work improved the construction of the compressed de Bruijn graph in terms of run-time and memory consumption. According to the Computational Pan-Genomics Consortium (Briefings in Bioinformatics 2016), a pan-genome data structure should support the following functionality: “All information within a data structure should be easily accessible for human eyes by visualization support on different scales.” However, a pan-genome graph can have thousands to millions of nodes and such an amount of information is certainly not easily accessible for human eyes. Thus, the possibility to construct pangenome subgraphs on demand would be quite valuable. In this article, we use the space-efficient representation of the compressed de Bruijn graph devised by Beller and Ohle-busch (Algorithms for Molecular Biology 2016) to construct pan-genome subgraphs on the fly. The user can specify a region in one of the genomes and the software tool will build a subgraph that contains the path corresponding to that region and all paths that are in the neighborhood of that path. The size of the neighborhood can be controlled by the user.

Indoor tracking has evolved with various methods. The most popular method is using signal strength measuring techniques like triangulation, trilateration and fingerprinting, etc. Generally, these methods use the internal sensors of the smartphone. All these techniques require an adequate number of access point signals. The estimated positioning accuracy depends on the number of signals received at any point and precision of its signal (Wi-Fi radio waves) strength. In a practical environment, the received signal strength indicator (RSSI) of the access point is hindered by obstacles or blocks in the direct path or Line of sight. Such access points become an anomaly in the calculation of position. By detecting the anomaly access points and neglecting it during the computation of an indoor position will improve the accuracy of the positioning system. The proposed method, Practical Hindrance Avoidance in an Indoor Positioning System (PHA-IPS), eliminate the anomaly nodes while estimating the position, so then enhances the accuracy.

Data is the key to information mining that unveils hidden knowledge. The ability to revealed knowledge relies on the extractable features of a dataset and likewise the depth of the mining model. Conversely, several of these datasets embed sensitive information that can engender privacy violation and are subsequently used to build deep neural network (DNN) models. Recent approaches to enact privacy and protect data sensitivity in DNN models does decline accuracy, thus, giving rise to significant accuracy disparity between a non-private DNN and a privacy preserving DNN model. This accuracy gap is due to the enormous uncalculated noise flooding and the inability to quantify the right level of noise required to perturb distinct neurons in the DNN model, hence, a dent in accuracy. Consequently, this has hindered the use of privacy protected DNN models in real life applications. In this paper, we present a neuron noise-injection technique based on layer-wise buffered contribution ratio forwarding and ϵ-differential privacy technique to preserve privacy in a DNN model. We adapt a layer-wise relevance propagation technique to compute contribution ratio for each neuron in our network at the pre-training phase. Based on the proportion of each neuron’s contribution ratio, we generate a noise-tuple via the Laplace mechanism, and this helps to eliminate unwanted noise flooding. The noise-tuple is subsequently injected into the training network through its neurons to preserve privacy of the training dataset in a differentially private manner. Hence, each neuron receives right proportion of noise as estimated via contribution ratio, and as a result, unquantifiable noise that drops accuracy of privacy preserving DNN models is avoided. Extensive experiments were conducted based on three real-world datasets and their results show that our approach was able to narrow down the existing accuracy gap to a close proximity, as well outperforms the state-of-the-art approaches in this context.

Predicting stock-price remains an important subject of discussion among financial analysts and researchers. However, the advancement in technologies such as artificial intelligence and machine learning techniques has paved the way for better and accurate prediction of stock-price in recent years. Of late, Support Vector Machines (SVM) have earned popularity among Machine Learning (ML) algorithms used for predicting stock price. However, a high percentage of studies in algorithmic investments based on SVM overlooked the overfitting nature of SVM when the input dataset is of high-noise and high-dimension. Therefore, this study proposes a novel homogeneous ensemble classifier called GASVM based on support vector machine enhanced with Genetic Algorithm (GA) for feature-selection and SVM kernel parameter optimisation for predicting the stock market. The GA was introduced in this study to achieve a simultaneous optimal of the diverse design factors of the SVM. Experiments carried out with over eleven (11) years’ stock data from the Ghana Stock Exchange (GSE) yielded compelling results. The outcome shows that the proposed model (named GASVM) outperformed other classical ML algorithms (Decision Tree (DT), Random Forest (RF) and Neural Network (NN)) in predicting a 10-day-ahead stock price movement. The proposed (GASVM) showed a better prediction accuracy of 93.7% compared with 82.3% (RF), 75.3% (DT), and 80.1% (NN). It can, therefore, be deduced from the fallouts that the proposed (GASVM) technique puts-up a practical approach feature-selection and parameter optimisation of the different design features of the SVM and thus remove the need for the labour-intensive parameter optimisation.

All highly centralised enterprises run by criminals do share similar traits, which, if recognised, can help in the criminal investigative process. While conducting a complex confederacy investigation, law enforcement agents should not only identify the key participants but also be able to grasp the nature of the inter-connections between the criminals to understand and determine the modus operandi of an illicit operation. We studied community detection in criminal networks using the graph theory and formally introduced an algorithm that opens a new perspective of community detection compared to the traditional methods used to model the relations between objects. Community structure, generally described as densely connected nodes and similar patterns of links is an important property of complex networks. Our method differs from the traditional method by allowing law enforcement agencies to be able to compare the detected communities and thereby be able to assume a different viewpoint of the criminal network, as presented in the paper we have compared our algorithm to the well-known Girvan-Newman. We consider this method as an alternative or an addition to the traditional community detection methods mentioned earlier, as the proposed algorithm allows, and will assists in, the detection of different patterns and structures of the same community for enforcement agencies and researches. This methodology on community detection has not been extensively researched. Hence, we have identified it as a research gap in this domain and decided to develop a new method of criminal community detection.

The day-to-day use of digital devices with Internet access, such as tablets and smartphones, has increased exponentially in recent years and this has had a consequent effect on the usage of the Internet and social media networks. When using social networks, people share personal data that is broadcast between users, which provides useful information for organizations. This means that characterizing users through their social media activity is an emerging research area in the field of Natural Language Processing (NLP) and this paper will present a review of how personality can be detected using online content. Approach A systematic literature review identified 30 papers published between 2007 and 2019, while particular inclusion and exclusion criteria were used to select the most relevant articles. Outcomes This review describes a variety of challenges and trends, as well as providing ideas for the direction of future research. In addition, personality trait identification and techniques were classified into different types, including deep learning, machine learning (ML) and semi-supervised/hybrid. Implications This paper’s outcomes will not only facilitate insight into the various personality types and models but will also provide knowledge about the relevant detection techniques. Novelty While prior studies have conducted literature reviews in the personality trait detection field, the systematic literature review in this paper provides specific answers to the proposed research questions. This is novel to this field as this particular type of study has not been conducted before.

Distributed denial-of-service (DDoS) attacks on the Internet of Things (IoT) pose a serious threat to several web-based networks. The intruder’s ability to deal with the power of various cooperating devices to instigate an attack makes its administration even more multifaceted. This complexity can be further increased while lots of intruders attempt to overload an attack against a device. To counter and defend against modern DDoS attacks, several effective and powerful techniques have been used in the literature, such as data mining and artificial intelligence for the intrusion detection system (IDS), but they have some limitations. To overcome the existing limitations, in this study, we propose an intrusion detection mechanism that is an integration of a filter-based selection technique and a machine learning algorithm, called information gain-based intrusion detection system (IGIDS). In addition, IGIDS selects the most relevant features from the original IDS datasets that can help to distinguish typical low-speed DDoS attacks and, then, the selected features are passed on to the classifiers, i.e. support vector machine (SVM), decision tree (C4.5), naïve Bayes (NB) and multilayer perceptron (MLP) to detect attacks. The publicly available datasets as KDD Cup 99, CAIDA DDOS Attack 2007, CONFICKER worm, and UNINA traffic traces, are used for our experimental study. From the results of the simulation, it is clear that IGIDS with C4.5 acquires high detection and accuracy with a low false-positive rate.

The semiconductor manufacturing process involves long and complex activities, with intensive use of resources. Producers compete through the introduction of new technologies for increasing yield and reducing costs. So, yield improvement is becoming increasingly important since advanced production technologies are complex and interrelated. In particular, Wafer Bin Maps (WBMs) presenting specific fault models provide crucial information to keep track of process problems in semiconductor manufacturing. Production control is often based on the “judgement” of expert engineers who, however, carry out the analysis of map templates through simple visual exploration. In this way, existing studies are subjective, time consuming, and are also limited by the capacity of human recognition. This study proposes a network-based data mining approach, which integrates correlation graphs with clustering analysis to quickly extract patterns from WBMs and then bind them to manufacturing defects. An empirical study has been conducted on real production data for validating the proposed clustering algorithm, which showed a perfect correspondence between the malfunction patterns found by the algorithm and those discovered by human experts, so confirming the validity of our approach in its ability of correctly identifying actual defective patterns to help improving production yield.

Massive open online courses (MOOCs) have gained enormous popularity in recent years and have attracted learners worldwide. However, MOOCs face a crucial challenge in the high dropout rate, which varies between 91%-93%. An interplay between different learning analytics strategies and MOOCs have emerged as a research area to reduce dropout rate. Most existing studies use click-stream features as engagement patterns to predict at-risk students. However, this study uses a combination of click-stream features and the influence of the learner’s friends based on their demographics to identify potential dropouts. Existing predictive models are based on supervised learning techniques that require the bulk of hand-labelled data to train models. In practice, however, scarcity of massive labelled data makes training difficult. Therefore, this study uses self-training , a semi-supervised learning model, to develop predictive models. Experimental results on a public data set demonstrate that semi-supervised models attain comparable results to state-ofthe-art approaches, while also having the flexibility of utilizing a small quantity of labelled data. This study deploys seven well-known optimizers to train the self-training classifiers, out of which, Stochastic Gradient Descent (SGD) outperformed others with the value of F1 score at 94.29%, affirming the relevance of this exposition.

Steganography is the science and art of covert communication. Conversely, steganalysis is the study of uncovering the steganographic process. The evolution of steganography has been paralleled by the development of steganalysis. In this game of hide and seek, the two player’s steganography and steganalysis always want to break the other down. Over the past three decades, research has produced a plethora of remarkable image steganography techniques (ISTs). The major challenge for most of these ISTs is to achieve a fair balance between the metrics such as high hiding capacity (HC), better imperceptibility, and improved security. This study aims to present an exhaustive scrutiny of various ISTs from the classical to recent developments in the spatial domain, with respect to various image steganographic metrics. Further, the current status, recent developments, open challenges, and promising directions in this field are also highlighted.

Nowadays, big data is a widely utilized concept that has been spreading quickly in almost every domain. For pharmaceutical companies, using this concept is a challenging task because of the permanent pressure and business demands created through the legal requirements, research demands and standardization that have to be adopted. These legal and standards’ demands are associated with human healthcare safety and drug control that demands continuous and deep data analysis. Companies update their procedures to the particular laws, standards, market demands and regulations all the time by using contemporary information technology. This paper highlights some important aspects of the experience and change methodology used in one Macedonian pharmaceutical company, which has employed information technology solutions that successfully tackle legal and business pressures when dealing with a large amount of data. We used a holistic view and deliverables analysis methodology to gain top-down insights into the possibilities of big data analytics. Also, structured interviews with the company’s managers were used for information collection and proactive methodology with workshops was used in data integration toward the implementation of big data concepts. The paper emphasizes the information and knowledge used in this domain to improve awareness for the needs of big data analysis to achieve a competitive advantage. The main results are focused on systematizing the whole company’s data, information and knowledge and propose a solution that integrates big data to support managers’ decision-making processes.

This paper introduces Wikipedia as an extensive knowledge base which provides additional information about a great number of web resources in the semantic web, and shows how RDF web resources in the web of data can be linked to this encyclopedia. Given an input web resource, the designed system identifies the topic of the web resource and links it to the corresponding Wikipedia article. To perform this task, we use the core labeling properties in web of data to specify the candidate Wikipedia articles for a web resource. Finally, a knowledge based approach is used to identify the most appropriate article in Wikipedia database. Evaluation of the system shows the high performance of the designed system.

Bi-directional information and energy flow, renewable energy sources, battery energy storage, electric vehicle, self-healing capability, and demand response programs, etc., revolutionized the traditional distribution network into the smart distribution network. Adoption of modern technologies like intelligent meters such as advanced metering infrastructure & Micro-phasor measurement units, data storage, and analysis techniques and incentive-based electricity trading mechanisms can bring this paradigm shift. This study presents an overview of popular technologies that facilitate this transformation, giving focus on some prime technologies such as real-time monitoring based on Micro-phasor measurement units, data storage and analytics, blockchain technology, multi-agent systems, and incentive-based energy trading mechanisms

Over the last few years, the huge amount of data represented a major obstacle to data analysis. Big data implies that the volume of data undergoes a faster progress than computational speeds, thereby demanding a larger data storage capacity. The Internet of Things (IoT) is a main source of data that is closely related to big data, as the former extends to a variety of fields such as healthcare, entertainment, and disaster control. Despite the different advantages associated with the composition of Big Data analytics and IoT, there are a number of complex difficulties and issues involved that need to be resolved and managed to ensure an accurate data analysis. Some of these solutions include the utilization of map-reduce techniques, processing, and large data scale, particularly for the relatively less time that this method requires to process large data from the Internet of Things. Machine learning algorithms of this kind are often implemented in the healthcare sector. Medical facilities need to be advanced so that more appropriate decisions can be made in terms of patient diagnosis and treatment options. In this work, two datasets have been used: the first set, used in the prediction of heart diseases, obtained an accuracy rate of 84.5 for RF and 83 for J48, whereas the second dataset is related to weather stations (automated sensors) and obtained accuracy rates of 88.5 and 86.5 for RF and J48, respectively.

A hotspot is an axis-aligned square of fixed side length s , where the amount of time a moving entity spends within it is maximised. An exact hotspot of a polygonal trajectory with n edges can be found with time complexity O ( n 2 ). We define a c -approximate hotspot as an axis-aligned square of side length cs , in which the presence duration of the entity is no less than that of an exact hotspot. In this paper we present an algorithm to find a (1 + ϵ )-approximate hotspot of a polygonal trajectory with time complexity O(nϕϵlognϕϵ)O\left( {{{n\phi } \over \varepsilon }\log {{n\phi } \over \varepsilon }} \right), where ϕ is the ratio of average trajectory edge length to s .

The use of LED lights in smart street lighting to save energy is efficient and very common in many developed cities. However, such a system results in higher initial costs, which may discourage smaller towns and villages from its purchasing. This paper therefore deals with the design and development of a smart street lighting control system for smaller cities and villages. Such a system is required to be economical from the perspective of development and production. Considering other requirements such as platform independence, high availability and broad support, we proposed to build a system as a web application using a custom light control service component. The result is a web application that consists of a user interface served by a web server and an application server used to communicate with light control service. In addition, the system is designed as a geographical information system to be easy to use for managing street lights in groups or individually, while displaying them on the map. The system allows automatic sensor-based light intensity modulation by default with the possibility of manual adjustment or override of the illumination. It also includes a device error notification system with a tool to navigate faulty devices. The presented system is a low-cost solution for intelligent street lighting control designed for smaller cities or villages. They can apply the designed architecture of the system and the specific technologies suitable because of their low-cost implementation.

In recent times, comparative opinion mining applications have attracted both individuals and business organizations to compare the strengths and weakness of products. Prior works on comparative opinion mining have focused on applying a single classifier, limited comparative opinion labels, and limited dataset of product reviews, resulting in degraded performance for classifying comparative reviews. In this work, we perform multi-class comparative opinion mining by applying multiple machine learning classifiers using an increased number of comparative opinion labels (9 classes) on 4 datasets of comparative product reviews. The experimental results show that Random Forest classifier has outperformed the comparing algorithms in terms of improved accuracy, precision, recall and f-measure.