Claim Missing Document
Check
Articles

Found 2 Documents
Search

Identifying Actual Users in a Web Surfing Session using Tracing and Tracking Maiwada, Umar Danjuma; Muazu, Aminu Aminu; Yakasai, Izaddeen Kabir; Zakari, Rufai Yusuf
JINAV: Journal of Information and Visualization Vol. 1 No. 1 (2020)
Publisher : Yayasan Ahmar Cendekia Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35877/454RI.jinav174

Abstract

The World Wide Web (www) has become an interactive medium for millions of Internet users across the world, daily visiting occur for various purposes. However, their behavior could be monitored by various service providers or company’s website they visited for several purposes. Thus, we can see that if certain data pre-processing techniques are practiced correctly, results will be of high quality and in turn provide substantial evidence of the user and its web session. This paper provides a way of knowing user behavior on the web. It explains the use of cookies: Cookies allow you to do many things such as log on to Internet Banking, have us 'remember' your log-in preferences, when logging on, a pop-up window appears stating the service is not available and to try later. A misspelled domain name in the address line. Lotteries that charge a fee to collect your winnings, apply for products and services online, and use financial tools like our ‘find and compare’ mortgage calculators., servers, and proxy logs with some scripting to be able not only to get a user’s IP address but also get personal information like age, identity, and any other credential as long as the user puts them down while using the web.
Pairwise test case generation with harmony search, one-parameter-at-at-time, seeding, and constraint mechanism integration Aminu Muazu, Aminu; Hashim, Ahmad Sobri; Maiwada, Umar Danjuma; Isma'ila, Umar Audi; Yakubu, Muhammad Muntasir; Abubakar Ibrahim, Muhammad
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 3: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i3.pp3137-3149

Abstract

Pairwise testing is a method for identifying defects through combinatorial analysis. It involves testing all possible combinations of input parameters in pairs within a system, ensuring that each pair is tested at least once. The field of test case generation is highly active in the realm of combinatorial interaction testing. Research in this area is particularly encouraged, as it falls under the category of non-deterministic polynomial-time hardness. A big challenge in this field is the combinatorial explosion problem. It is about finding the best test suite that covers all possible combinations of interaction strength. In this paper, we present the task of discovering a pairwise test set as a search problem and introduce an innovative testing tool referred to as pairwise test case generation in harmony search algorithm with seeding and constraint mechanism (PHOSC). Experimental results show that PHOSC performs better compared to some existing pairwise strategies in terms of test suite size. Additionally, PHOSC provides a comprehensive framework and serves as a research platform for the generation of pairwise test sets employing the harmony search algorithm. It adopts an approach that focuses on one parameter at a time (OPAT) and incorporates seeding and constraint mechanisms at the same time, thereby enhancing the efficiency and effectiveness of the testing process.