Results 211 to 220 of about 2,233,211 (259)

Information for step length adjustment in running

Human Movement Science, 2005
The purpose of this study was to directly test the hypothesis that the tau parameter, as introduced by Lee et al. [Lee, D. N., Lishman, J. R., & Thomson, J. A. (1982). Regulation of gait in long jumping. Journal of Experimental Psychology: Human Perception and Performance, 8, 448-459] and Warren et al. [Warren, W. H., Young, D. S., & Lee, D. N. (1986).
William P, Berg, Leonard S, Mark
openaire   +2 more sources

On the optimal disclosure of queue length information

Naval Research Logistics (NRL), 2016
AbstractSimhon et al. (2016) proved that disclosing queue length to customers when the queue is shorter than some threshold and concealing the information otherwise cannot maximize the throughout of M/M/1 queues—when customers are familiar with the policy and the threshold. We show that said policy indeed maximizes throughput when customers do not have
Kaili Li, Shiliang Cui, Jinting Wang
openaire   +2 more sources

On Queue-Length Information when Customers Travel to a Queue

Manufacturing & Service Operations Management, 2021
Problem definition: We consider a service system in which customers must travel to the queue to be served. In our base model, customers observe the queue length and then decide whether to travel. We also consider alternative information models and investigate how the availability of queue-length information affects customer-equilibrium strategies ...
Refael Hassin, Ricky Roet-Green
openaire   +1 more source

Texture information in run-length matrices

IEEE Transactions on Image Processing, 1998
We use a multilevel dominant eigenvector estimation algorithm to develop a new run-length texture feature extraction algorithm that preserves much of the texture information in run-length matrices and significantly improves image classification accuracy over traditional run-length techniques.
openaire   +2 more sources

Stabilization of evolutionary networked games with length-r information

Applied Mathematics and Computation, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ying Mao, Liqing Wang, Yang Liu 0040, Jianquan Lu, Zhen Wang 0008   +4 more
openaire   +2 more sources

Information-theoretic lengths of Jacobi polynomials

Journal of Physics A: Mathematical and Theoretical, 2010
The authors study the information-theoretic lengths of the Jacobi polynomials \(P_n^{\alpha, \beta} (x)\) using the Rakhmanov probability density associated with these polynomials \(P_n^{\alpha, \beta} (x)\). They determine an explicit expression for the Fisher length of the Jacobi polynomials and also find an explicit formula for the Renyi lengths of ...
Guerrero, A., Sánchez-Moreno, P., Dehesa, J. S.   +2 more
openaire   +1 more source

A Study of Query Length Heuristics in Information Retrieval

Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, 2015
Query length has generally been regarded as a query-specific constant that does not affect document ranking. In this paper, we reveal that query length actually interacts with term frequency (TF) normalization, a key component of all effective retrieval models. Specifically, the longer the query is, the smaller the TF decay speed should be. In order to
openaire   +1 more source

The Effect of Query Length on Normalisation in Information Retrieval

2010
Document length normalisation is known to be a difficult problem in IR, as tuning is often needed to overcome the collection dependence problem known to affect many normalisation schemes. Furthermore, it has been shown in various studies that the most optimal level of normalisation to apply is correlated with query length.
Ronan Cummins, Colm O'Riordan
openaire   +1 more source