Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Annals of Computer Science and Information Systems

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

BoostSole: Design and Realization of a Smart Insole for Automatic Human Gait Classification

Djamaa Badis, Bessa Med Messaoud, Diaf Badreddine, Rouigueb Abdenebi, Yachir Ali

Annals of Computer Science and Information Systems

2020

Vol. 21

35--43

This paper presents BoostSole; a smart insole based system for automatic human gait recognition. It consists of a smart instrumented insole connected to the cloud via the patient's smartphone using low-power wireless communication. First, the design of BoostSole is introduced with discussions of sensors choice, placement, calibration, and data communication. Next, an adaptive multi-boost classification algorithm is deployed to accurately identify different gait patterns. The algorithm is fast and lightweight and can be implemented in ordinary smartphones with a small footprint in terms of computational requirements, energy consumption, and communication usage. Raw and on-device classified data can be securely uploaded to a distant cloud server for continuous monitoring and analysis. Indeed, they can be visualized and exploited by doctors to identify/correct walking habits and assess the risks of chronic pain associated with an abnormal walk. The system has been evaluated on a dataset containing three gait patterns, namely: shuffle walk; toe walking; and normal gait. Obtained results are promising with more than 97\\% classification accuracy accompanied by low response time and computational demands.

Integration of polynomials over n-dimensional simplices

Rouigueb Abdenebi, Maiza Mohamed, Tkourt Abderahmane, Cherchour Imed

Annals of Computer Science and Information Systems

2019

Vol. 18

157--163

Integrating an arbitrary polynomial function f of degree D over a general simplex in dimension n is well-known in the state of the art to be NP-hard when D and n are allowed to vary, but it is time-polynomial when D or n are fixed. This paper presents an efficient algorithm to compute the exact value of this integral. The proposed algorithm has a time-polynomial complexity when D or n are fixed, and it requires a reasonable time when the values of D and n are less than 10 using widely available standard calculators such as desktops.