نتایج جستجو برای: beep test

تعداد نتایج: 812328  

Journal: :CoRR 2016
Arnaud Casteigts Yves Métivier John Michael Robson Akka Zemmari

We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn [7], which we refer to as the BL variant, processes can choose in each round either to beep or to listen. Those who beep are unable to detect simultaneous beeps. Those who listen can only distinguish between silence and the presence of at least one beep. Beeping models are weak in essence...

2016
Anna Hafström Eva-Maj Malmström Josefine Terdèn Per-Anders Fransson Måns Magnusson

Objective: To develop and assess the efficacy of a multimodal balance-enhancing exercise program (BEEP) designed to be regularly self-administered by community-dwelling elderly. The program aims to promote sensory reweighting, facilitate motor control, improve gaze stabilization, and stimulate continuous improvement by being constantly challenging. Method: Forty participants aged 60 to 80 years...

Journal: :Mental Health and Physical Activity 2021

Physical activity has positive effects on self-esteem and sense of belongingness vice versa. The experience sampling method allows for a level analysis the within-subject temporal dynamics these interactions. We hypothesized that physical would predict prospective increases in flow daily life, Additionally, we at beep level. study included 781 individuals (17.4 ± 3.5 years; 59% female) who resp...

Journal: :Studia sportiva 2023

Motor fitness is seen as a prerequisite for efficient physical functioning of the body and contributes to an active lifestyle. The aim research was use 4 motor tests (standing long jump; sit-up test; 4x10 m shuttle run; Leger test /Beep test/) (1) assess level in comparison with UNIFITTEST, (2) significance difference performance between sexes, (3) current status mean values height (BH) weight ...

Journal: :Theoretical Computer Science 2023

This article considers message and energy-efficient distributed algorithms for the SetCover Problem. Given a ground set U of n elements S m subsets U, we aim to find minimal number these that contain all elements. In default setup this problem, each has bidirected communication link with element it contains. results in graph n+m nodes degree Δ. The value Δ denotes maximal graph, i.e., maximum s...

Journal: :CoRR 2012
Supreeth K. Rao Arpitha Prasad B. Anushree R. Shetty Chinmai Bhakthavathsalam Ramaswamy Rajeshwari Hegde

A smart navigation system (an Electronic Travel Aid) based on an object detection mechanism has been designed to detect the presence of obstacles that immediately impede the path, by means of real time video processing. In this paper this is discussed, keeping in mind the navigation of the visually impaired. A video camera feeds images of the surroundings to a DaVinci Digital Media Processor, D...

2015
Samir Elouasbi Andrzej Pelc

Two mobile agents, starting at arbitrary, possibly different times from arbitrary nodes of an unknown network, have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. Agents have different labels which are positive integers. Each agent knows its own label, but not the label of the other agent. In t...

2002
Tobias Hüsing Hannes Selhofer

Recent information society policies have been paying much attention to the threat of a "digital divide". The gap between citizens from different socio-economic backgrounds with regard to their opportunities and abilities to access and use information and communication technologies is commonly regarded as a potential barrier for participation in the information society. This paper suggests a met...

2015
Rachid Guerraoui Alexandre Maurer

This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We assume that n > 2f (n is the number of processes and f is the number of Byzantine processes) and that the initial state of the processes can b...

2016
Kokouvi Hounkanli Andrzej Pelc

In broadcasting, one node of a network has a message that must be learned by all other nodes. We study deterministic algorithms for this fundamental communication task in a very weak model of wireless communication. The only signals sent by nodes are beeps. Moreover, they are delivered to neighbors of the beeping node in an asynchronous way: the time between sending and reception is finite but ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید