
Cybercrimes are consistently advancing in complexity. Cyber threat intelligence (CTI) is useful for analyzing, evaluating, and drawing conclusions for areas such as indicators of compromise (IOCs) and tactics, techniques, and procedures (TTPs). However, valuable CTI is not always utilized effectively, particularly from the unregulated Dark Web. Manually processing this vast and complex data is unrealistic. This research uses artificial intelligence (AI) and machine learning (ML) to provide automation and process a sizable amount of information in a reasonable time. Specifically, it will use the DUTA-10K Darknet dataset to develop ML models based on the Random Forest, Support Vector Machine, and XGBoost algorithms. These models distinguish illicit and benign addresses, along with their classes and language categories. The resulting models showed reliable performance, with XGBoost consistently producing more effective models overall for predicting illicit status and language.
Pathfinding algorithms are fundamental to autonomous navigation, traditionally computing optimal routes based on defined start and goal locations using heuristic cost functions. While effective, these algorithms become computationally intensive in dynamic environments due to the need for exhaustive search. Gradient-based optimization methods, such as Broyden-Fletcher-Goldfarb-Shanno (BFGS), offer a reactive alternative by making local decisions based on the current position; however, they are susceptible to local minima and increased computational burden in complex cost landscapes, particularly when second-order derivative information is required. This paper proposes an enhanced A^* algorithm through the introduction of a custom heuristic function designed to reduce computational load and facilitate reactive navigation. The proposed heuristic, along with three well-established heuristics, is evaluated against an augmented BFGS approach that integrates a repulsive force field to improve obstacle avoidance. Performance metrics include path length and path behavior near obstacles. Experimental results demonstrate that the A^* algorithm with the proposed heuristic achieves obstacle avoidance performance comparable to BFGS, outperforming traditional heuristics. These findings suggest the potential for the enhanced A^* to support reactive robotic navigation, motivating further exploration towards hybrid strategies that leverage the strengths of both global search and local optimization methods.
This paper introduces a novel memetic optimization approach that segments the population into multiple semi-independent subpopulations, referred to as countries, each evolving in parallel through concurrent local search cycles. The proposed Country-Segmented Memetic Algorithm (CSMA) leverages multithreading and SIMD capabilities to enhance computational efficiency without compromising solution quality. By decentralizing elitism and enabling controlled migration between subpopulations, the method achieves a better balance between exploration and exploitation. Experimental evaluations on standard benchmark functions demonstrate superior convergence speed and robustness compared to classical memetic algorithms. Additionally, theoretical scalability assessments using Amdahl’s Law, Gustafson’s Law, Karp-Flatt’s metric, and isoefficiency models confirm the algorithm’s effectiveness in parallel environments.
The rapid growth of e-commerce has transformed how businesses operate globally, creating new opportunities but also introducing significant security challenges. As online platforms process millions of transactions daily, they face increasingly sophisticated cyber threats that can compromise customer data and disrupt business operations. Security management becomes particularly complex in the global marketplace. Organizations must navigate multiple regulations, such as the European Union’s General Data Protection Regulation (GDPR) and California’s Consumer Privacy Act (CCPA), which set strict standards for data protection and privacy. Additionally, supply chain security presents critical challenges, as demonstrated by recent breaches where attackers exploited vulnerabilities in vendor systems to access larger networks. This research analyzes current e-commerce security challenges and potential solutions. We examine how organizations implement established frameworks like the Payment Card Industry Data Security Standard (PCI DSS), while also adopting newer technologies such as advanced encryption, blockchain, and AI-based threat detection. Our findings indicate that while technological solutions are essential, they must be complemented by strong human factors - particularly staff training and security awareness, as human error remains a significant factor in security breaches. Based on empirical evidence and industry practices, we propose practical security recommendations. These include implementing Zero Trust Architecture to strengthen access controls, following international security standards for better compliance, and developing ethical data handling practices. Our research emphasizes the importance of regular security assessments to address emerging threats. The findings provide organizations with practical approaches to protect sensitive data and maintain customer trust. By implementing these recommendations, businesses can strengthen their security measures while building a foundation for sustainable growth in digital commerce.
This study investigates the phenomenon of bug seeding in open-source software development, with a focus on how and when bugs are introduced into the source code. Previous research often assumes that the bug is introduced in the commit preceding the bug fix. However, our large-scale observational study on the OpenStack project challenges this assumption. By analyzing 459 bug reports and tracing their origins, we reveal that only 50