Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava)
Not a member yet
1506 research outputs found
Sort by
Novel Approach to Hide Sensitive Association Rules by Introducing Transaction Affinity
Get PDFIn this paper, a novel approach has been proposed for hiding sensitive association rules based on the affinity between the frequent items of the transaction. The affinity between the items is defined as Jaccard similarity. This work proposes five algorithms to ensure the minimum side-effects resulting after applying sanitization algorithms to hide sensitive knowledge. Transaction affinity has been introduced which is calculated by adding the affinity of frequent items present in the transaction with the victim-item (item to be modified). Transactions are selected either by increasing or decreasing value of affinity for data distortion to hide association rules. The first two algorithms, MaxaffinityDSR and MinaffinityDSR, hide the sensitive information by selecting the victim item as the right-hand side of the sensitive association rule. The next two algorithms, MaxaffinityDSL and MinaffinityDSL, select the victim item from the left-hand side of the rule whereas the Hybrid approach picks the victim item from either the left-hand side or right-hand side. The performance of proposed algorithms has been evaluated by comparison with state-of-art methods (Algo 1.a and Algo 1.b), MinFIA, MaxFIA and Naive algorithms. The experiments were performed using the dataset generated from IBM synthetic data generator, and implementation has been performed in R language
A Proposed Scheduling Algorithm for IoT Applications in a Merged Environment of Edge, Fog, and Cloud
Get PDFWith the rapid increase of Internet of Things (IoT) devices and applications, the ordinary cloud computing paradigm soon becomes outdated. Fog computing paradigm extends services provided by a cloud to the edge of network in order to satisfy requirements of IoT applications such as low latency, locality awareness, low network traffic, mobility support, and so forth. Task scheduling in a Cloud-Fog environment plays a great role to assure diverse computational demands are met. However, the quest for an optimal solution for task scheduling in the such environment is exceedingly hard due to diversity of IoT applications, heterogeneity of computational resources, and multiple criteria. This study approaches the task scheduling problem with aims at improving service quality and load balancing in a merged computing system of Edge-Fog-Cloud. We propose a Multi-Objective Scheduling Algorithm (MOSA) that takes into account the job characteristics and utilization of different computational resources. The proposed solution is evaluated in comparison to other existing policies named LB, WRR, and MPSO. Numerical results show that the proposed algorithm improves the average response time while maintaining load balancing in comparison to three existing policies. Obtained results with the use of real workloads validate the outcomes
ASIAM-HGNN: Automatic Selection and Interpretable Aggregation of Meta-Path Instances for Heterogeneous Graph Neural Network
Get PDFIn heterogeneous information network (HIN)-based applications, the existing methods usually use Heterogeneous Graph Neural Networks (HGNN) to handle some complex tasks. However, these methods still have some shortcomings: 1) they manually pre-select some meta-paths and thus some important ones are missing, while the missing ones still contains the information and features of the node in the entire graph structure; and 2) they have no high interpretability since they do not consider the logical sequences in an HIN. In order to deal with them, we propose ASIAM-HGNN: a heterogeneous graph neural network combined with the automatic selection and interpretable aggregation of meta-path instances. Our model can automatically filter important meta paths for each node, while preserving the logical sequence between nodes, so as to solve the problems existing in other models. A group of experiments are conducted on real-world datasets, and the results demonstrate that the models learned by our method have a better performance in most of task scenarios
An Approach Based on Genetic and Grasshopper Optimization Algorithms for Dynamic Load Balancing in CloudIoT
Get PDFCloudIoT is a new paradigm, which has emerged as a result of the combination of Cloud Computing (CC) and the Internet of Things (IoT). It has experienced a growing and rapid development, and it has become more popular in information and technology (IT) environments because of the advantages it offers. However, due to a strong use of this paradigm, especially in smart cities, the problem of imbalance load has emerged. Indeed, to satisfy the needs of the user, the intelligent objects send the collected data to the virtual machines (VMs) of the cloud in order to be processed. So, it is necessary to have an idea about the load of its VM. Thus, the problem of load balancing between VMs is strongly related to the technique used for the VMs selection. To tackle this problem, we propose in this paper a task scheduler called Scheduler Genetic Grasshopper Algorithm (SGGA). It allows to ensure a dynamic load balancing, as well as the optimization of the makespan and the resource usage. Our proposed SGGA is based on the combination of Genetic Algorithm (GA) and Grasshopper Optimization Algorithm (GOA). First, the tasks sent by the IoTs are mapped to the VMs in order to build the initial population, then SGGA performs the genetic algorithm, which has expressed a considerable performance. However, the weakness of the GA is marked by its heaviness caused by the mutation operator, especially when the number of tasks increases. Because of this insufficiency, we have replaced the mutation operator with the grasshopper optimization algorithm. The results of the experiments show that our approach (SGGA) is the most efficient, compared to the recent approaches, in terms of the response time to obtain the optimal solution, makespan, throughput, an average resource utilization rate and the hypervolume indicator
Classification of Sentiment Using Optimized Hybrid Deep Learning Model
Get PDFSentiment classification plays a pivotal role in natural language processing (NLP), and prior research has established the efficacy of utilizing convolutional neural networks (CNNs) and long short-term memory (LSTM) in this task. However, these approaches suffer from individual performance limitations: CNNs are limited to extracting local information and fail to express context information adequately, while LSTM networks excel at extracting context dependencies but exhibit long training times. To address this issue, we propose a novel text classification algorithm based on a hybrid CNN-LSTM model that leverages the strengths of both approaches and overcomes their limitations by combining them. Our approach is evaluated on the IMDB dataset, and we present a hyperparameter optimization framework utilizing Random Search to increase the likelihood of producing an optimally performing model
Parameterized Reachability Graph for Software Model Checking Based on PDNet
Get PDFModel checking is a software automation verification technique. However, the complex execution process of concurrent software systems and the exhaustive search of state space make the model-checking technique limited by the state-explosion problem in real applications. Due to the uncertain input information (called system parameterization) in concurrent software systems, the state-explosion problem in model checking is exacerbated. To address the problem that reachability graphs of Petri net are difficult to construct and cannot be explored exhaustively due to system parameterization, this paper introduces parameterized variables into the program dependence net (a concurrent program model). Then, it proposes a parameterized reachability graph generation algorithm, including decision algorithms for verifying the properties. We implement LTL-x verification based on parameterized reachability graphs and solve the problem of difficulty constructing reachability graphs caused by uncertain inputs
New Game-Theoretic Convolutional Neural Network Applied for the Multi-Pursuer Multi-Evader Game
Get PDFPursuit-Evasion Game (PEG) can be defined as a set of agents known as pursuers, which cooperate with the aim forming dynamic coalitions to capture dynamic evader agents, while the evaders try to avoid this capture by moving in the environment according to specific velocities. The factor of capturing time was treated by various studies before, but remain the powerful tools used to satisfy this factor object of research. To improve the capturing time factor we proposed in this work a novel online decentralized coalition formation algorithm equipped with Convolutional Neural Network (CNN) and based on the Iterated Elimination of Dominated Strategies (IEDS). The coalition is formed such that the pursuer should learn at each iteration the approximator formation achieving the capture in the shortest time. The pursuer’s learning process depends on the features extracted by CNN at each iteration. The proposed supervised technique is compared through simulation, with the IEDS algorithm, AGR algorithm. Simulation results show that the proposed learning technique outperform the IEDS algorithm and the AGR algorithm with respect to the learning time which represents an important factor in a chasing game
mTreeIllustrator: A Mixed-Initiative Framework for Visual Exploratory Analysis of Multidimensional Hierarchical Data
Get PDFMultidimensional hierarchical (mTree) data are very common in daily life and scientific research. However, mTree data exploration is a laborious and time-consuming process due to its structural complexity and large dimension combination space. To address this problem, we present mTreeIllustrator, a mixed-initiative framework for exploratory analysis of multidimensional hierarchical data with faceted visualizations. First, we propose a recommendation pipeline for the automatic selection and visual representation of important subspaces of mTree data. Furthermore, we design a visual framework and an interaction schema to couple automatic recommendations with human specifications to facilitate progressive exploratory analysis. Comparative experiments and user studies demonstrate the usability and effectiveness of our framework
Deep Learning Based Misogynistic Bangla Text Identification from Social Media
Get PDFMisogyny is characterized by hostility, hatred, aversion, intimidation, and violence against women. With the rise of social media, it has become one of the most convenient platforms for expressing woman-hating speech. As a result, misogyny is gaining appeal and societal standards are being violated. With millions of Bangladeshi Facebook users, misogyny is growing increasingly prevalent in Bangla as well. In this paper, we have proposed automatically identifying misogynistic content in Bangla on social media platforms in order to evaluate the problem's challenges. As there is no existing Bangla dataset for analyzing misogynistic text, we generated our own. We have applied various deep-learning algorithms to improve the classification of misogynistic text categories. LSTM and RNN models are used for designing the model architecture in deep learning. Models are evaluated using the confusion matrix, accuracy, and f1-scores. The results indicate that LSTM outperforms RNN in terms of accuracy by 67 %
Ontology for Blind SQL Injection
Get PDFIn cyberspace, there exists a prevalent problem that heavily occurs to web application databases and that is the exploitation of websites by using SQL injection attacks. This kind of attack becomes more difficult when it comes to blind SQL vulnerabilities. In this paper, we will first make use of this vulnerability, and subsequently, we will build an ontology (OBSQL) to address the detection of the blind SQL weakness. Therefore, to achieve the exploitation, we reproduce the attacks against a website in production mode. We primarily detect the presence of the vulnerability, after we use our tools to abuse it. Last but not least, we prove the importance of applying ontology in cybersecurity for this matter. The mitigation techniques in our ontology will be addressed in our future work