Search results for "algorithm."
showing 10 items of 4617 documents
Urban drinking and driving:comparison of electric scooter and bicycle related accidents in facial fracture patients
2022
In recent years, electric scooters (e-scooter) have emerged as an alternative mode of urban transport due to their availability and effortless use. However, e-scooter-related trauma and injuries, especially to the head, have received wide media coverage and raised public concern about their safety. We aim to determine and compare clinically relevant variables, incidence, and severity between bicycle and e-scooter-related facial fractures and potential protective measures for injury prevention. This retrospective study comprised all patients admitted to a tertiary trauma center with bicycle or e-scooter-related facial fractures between January 2019 and October 2020. Patient- and injury-relat…
On the suffix automaton with mismatches
2007
International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.
A trie-based approach for compacting automata
2004
International audience; We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et al., as it uses less nodes, still with arcs labeled by single characters.
Dynamic MAC Parameters Configuration for Performance Optimization in 802.11e Networks
2006
Quality of service support in wireless LAN is a theme of current interest. Several solutions have been proposed in literature in order to protect time-sensitive traffic from best-effort traffic. According to the EDCA proposal, which is a completely distributed solution, the service differentiation is provided by giving probabilistically higher number of channel accesses to stations involved in real-time applications. To this purpose, the MAC parameter settings of each contending stations can be tuned dynamically. In this paper, we face the problem of tuning the EDCA MAC parameters in common scenarios in which a given number of low-rate delay-sensitive traffic flows share the channel with so…
Remarks on IEEE 802.11 DCF Performance Evaluation, IEEE Communication Letters, Vol. 9, Issue 8, Aug 2005 pp:765 - 767
2005
This letter presents a new approach to evaluate the throughput/delay performance of the 802.11 Distributed Coordination Function (DCF). Our approach relies on elementary conditional probability arguments rather than bidimensional Markov chains (as proposed in previous models), and can be easily extended to account for backoff operation more general than DCF's one
On the accuracy of some common modeling assumptions for EDCA analysis
2005
Several models have been discussed in literature in order to evaluate the performance of the EDCA differentiation mechanisms. Despite of the exponential back off rules, usually the EDCA protocol has been modeled as a persistent slotted access protocol, and summarized into a set of access probabilities. These models often show a very different complexity and accuracy, according to the basis assumptions. In this paper, we propose a new modeling approach for EDCA, in which the medium access is described in terms of backoff counter comparisons, contention by contention, and no restrictive hypothesis is considered. Through our model, we verify the applicability of the most common protocol simpli…
Network Capacity Estimators Predicting QoE in HTTP Adaptive Streaming
2022
The aim of adaptive HTTP streaming technology is preserving the best possible video streaming quality for viewers in heterogeneous network conditions. This can be achieved by making multiple quality versions of the video available. Switching between versions during playback should be imperceptible and fluent. The decision about quality-level switching is typically based on network capacity estimation and buffer occupancy, which predict the risk of stalling. Since quality-level switching and stalling are directly evident to the user, they are often classified as influence factors of quality of experience (QoE). In this paper, we observe different network capacity estimators and buffer behavi…
Utilisation et traitement des données saisies sous EndNote avec des scripts PHP/MySQL
2010
National audience; Cet article présente la façon d’exploiter ou de traiter des données de références bibliographiques saisies ou importées dans EndNote en dehors de leur logiciel natif en utilisant des scripts PHP/MySQL. Deux raisons nous ont amenés à utiliser ce traitement : soit EndNote ne pouvait pas faire des opérations particulières, soit il le pouvait mais de façon trop fastidieuse. Dans ce but nous exposerons dans un premier temps la façon dont les données sont organisées par EndNote, puis la méthode pour les exploiter et enfin nous donnerons quelques exemples d’utilisation.
Normal, Abby Normal, Prefix Normal
2014
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number \(\textit{pnw}(n)\) of prefix normal words of length n, showing that \(\textit{pnw}(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)\) for some c and \(\textit{pnw}(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)\). We introduce efficient algorithms for testing the prefix normal property and a “mechanical algorithm” for computing prefix normal forms. We also include games which can be played with prefix normal words. In these games Alice wishes t…
Less Data Same Information for Event-Based Sensors: A Bioinspired Filtering and Data Reduction Algorithm
2018
Sensors provide data which need to be processed after acquisition to remove noise and extract relevant information. When the sensor is a network node and acquired data are to be transmitted to other nodes (e.g., through Ethernet), the amount of generated data from multiple nodes can overload the communication channel. The reduction of generated data implies the possibility of lower hardware requirements and less power consumption for the hardware devices. This work proposes a filtering algorithm (LDSI&mdash