Search Results - (( based reasoning graph algorithm ) OR ( java implication based algorithm ))

Implement edge pruning to enhance attack graph generation using the naïve approach algorithm by Al-Araji, Zaid J., Mutlag, Ammar Awad, Syed Ahmad, Sharifah Sakinah

“…The main reason for designing the attack graph is to predict the attack as well as to predict the attack’s next step in the network. …”
Get full text
Get full text
Get full text
Get full text

Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

“…This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. …”
Get full text
Get full text

Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

“…The main reason for designing the attack graph is to predict the attack as well as to predict the attack's next step in the network. …”
Get full text
Get full text
Get full text

Multiple case-based retrieval for university course timetabling problem by Hong, Siaw Theng

“…This thesis presents research for Case-based reasoning (CBR), a knowledge-based reasoning technique to solve university timetabling problem such as resource allocation for student’s course timetabling. …”
Get full text
Get full text

A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences by M. Othman, Razib, Deris, Safaai, Md. IIlias, Rosli

“…Then, the parallel genetic algorithm is employed to perform batch retrieval and to accelerate the search in large search space of the Gene Ontology graph. …”
Get full text
Get full text
Get full text

Enhanced Privacy Protection Against Location-Dependent Attacks in Location Based Services Using Spatial Cloaking by Saravanan, Perumal Shanthi, Balasundaram, Sadhu Ramakrishnan

“…This paper presents a solution to protect users from location-dependent attacks by improving the existing clique based cloaking algorithm. The main idea is to maintain maximum sized cliques required for location cloaking in an undirected graph. …”
Get full text
Get full text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…Moreover, the reason behind using the BST is to make the generation of the path by Dijkstra’s algorithm more accurate and less time performance. …”
Get full text
Get full text
Get full text

Enhanced privacy protection from location dependent attacks in location based services using spatial cloaking by Saravanan, Perumal Shanthi, Balasundaram, Sadhu Ramakrishnan

“…This paper presents a solution to protect users from location-dependent attacks by improving the existing clique based cloaking algorithm. The main idea is to maintain maximum sized cliques required for location cloaking in an undirected graph. …”
Get full text
Get full text
Get full text

The implications for ahybrid detection technique against malicious sqlattacks on web applications by Bahjat Arif, Sarajaldeen Akram, Wani, Sharyar

Get full text
Get full text
Get full text

Performance evaluation of compression techniques on scientific dataset / Lam Wai Leong by Lam , Wai Leong

“…Though most theoretical background of compression tool compresses datasets based on Lempel-ziv’s algorithm, in reality, these tools varied when it comes to compressing a binary file to a text file or a graphical one. …”
Get full text
Get full text

Analyzing students’ experience in programming with computational thinking through competitive, physical, and tactile games: The quadrilateral method approach by Habib, M. A. a, Raja-Yusof, R. -J., Salim, S. S.a, Sani, A. A. a, Sofian, H., Abu Bakar, A.

“…The CT elements in this research focus on four major programming concepts, which are decomposition, pattern recognition, abstraction, and algorithmic thinking. We have conducted game activities through several algorithms that include sorting, swapping, and graph algorithms and analyzed how the game affects the student experience (SX) in understanding the CT concept in those algorithms. …”
Get full text
Get full text
Get full text

Keyword query processing interface model of ontological natural language manipulation by Hasany, Syed Muhammad Noman

“…For the problem of conversion, techniques with fixed templates face scalability problems; while graph only techniques are processing intensive. We propose a variable template based conversion with inexpensive graph techniques to handle lengthy queries and exploring indirect connectivity among elements. …”
Get full text
Get full text

Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method by Ashraf Saleh Mohammad Alomoush

Evolutionary approach for combinatorial testing of software product lines by Sahid, Mohd Zanes

“…The approaches are (1) adopting an Estimation of Distribution Algorithm approach to aid the construction of a covering array driven by second order feature dependence, and (2) construct a feature configuration dependence graph to assist in building the variable-strength covering array. …”
Get full text
Get full text