Scientific Research Publishing

Adaptive Lidar-Inertial SLAM Algorithm with Multi-Feature Assistance in Degraded Environments ()

To address the issues of feature mismatching and map overlap drift in simultaneous localization and mapping (SLAM) within degraded environments characterized by sparse geometric features or severe ...
IEEE

A 1.5-Approximation for Symmetric Euclidean Open Loop TSP

Abstract: Travelling Salesman Problem (TSP) is NP-hard and therefore lacks efficient algorithm that provides optimal solution. So far, a benchmark in this area is Christofides’ Algorithm, which ...
IEEE

Arrhythmia detection from heartbeat using k-nearest neighbor classifier

Abstract: Automatic interpretation of electrocardiography provides a non-invasive and inexpensive technique to analyze the heart activity for different cardiac conditions. The emergence of smartphones ...
Frontiers

Identification technique of cryptomining behavior based on traffic features

Recently, the growth of blockchain technology and the economic benefits of cryptocurrencies have led to a proliferation of malicious cryptomining activities on the internet, resulting in significant ...
Frontiers

Intelligent Fall-Risk Assessment Based on Gait Stability and Symmetry Among Older Adults Using Tri-Axial Accelerometry

Falls are a major public health problem in adults aged >65 years worldwide. Approximately 30% of adults who have experienced a fall once tend to fall each year, and medically injurious falls occur in ...
Scientific Research Publishing

Johnson, D.S. and McGeoch, L.A. (1997) The Traveling Salesman Problem: A Case Study in Local Optimization. Local Search in Combinatorial Optimization, 1, 215-310.

ABSTRACT: The traveling salesman problem (TSP) is the most popular and most studied non-deterministic polynomial (NP) hard problem that has been used in various fields of science and technology. Due ...