An Optimal Median Calculation Algorithm for Estimating Internet Link Delays from Active Measurements

Author(s):  
Dima Feldman ◽  
Yuval Shavitt
2019 ◽  
Vol 25 ◽  
pp. 125
Author(s):  
Mark Christiansen ◽  
Timothy Bailey ◽  
Leslie Klaff ◽  
Ron Brazg ◽  
Anna Chang ◽  
...  

2014 ◽  
Vol 59 (2) ◽  
pp. 553-562 ◽  
Author(s):  
Agnieszka Surowiak ◽  
Marian Brożek

Abstract Settling velocity of particles, which is the main parameter of jig separation, is affected by physical (density) and the geometrical properties (size and shape) of particles. The authors worked out a calculation algorithm of particles settling velocity distribution for irregular particles assuming that the density of particles, their size and shape constitute independent random variables of fixed distributions. Applying theorems of probability, concerning distributions function of random variables, the authors present general formula of probability density function of settling velocity irregular particles for the turbulent motion. The distributions of settling velocity of irregular particles were calculated utilizing industrial sample. The measurements were executed and the histograms of distributions of volume and dynamic shape coefficient, were drawn. The separation accuracy was measured by the change of process imperfection of irregular particles in relation to spherical ones, resulting from the distribution of particles settling velocity.


2018 ◽  
Vol 30 (10) ◽  
pp. 1794
Author(s):  
Dejun Zhang ◽  
Fazhi He ◽  
Long Tian ◽  
Zhuyang Xie ◽  
Lu Zou

Author(s):  
J.E. López de Vergara ◽  
M. Ruiz ◽  
L. Gifre ◽  
M. Ruiz ◽  
L. Vaquero ◽  
...  

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Bayu Adhi Nugroho

AbstractA common problem found in real-word medical image classification is the inherent imbalance of the positive and negative patterns in the dataset where positive patterns are usually rare. Moreover, in the classification of multiple classes with neural network, a training pattern is treated as a positive pattern in one output node and negative in all the remaining output nodes. In this paper, the weights of a training pattern in the loss function are designed based not only on the number of the training patterns in the class but also on the different nodes where one of them treats this training pattern as positive and the others treat it as negative. We propose a combined approach of weights calculation algorithm for deep network training and the training optimization from the state-of-the-art deep network architecture for thorax diseases classification problem. Experimental results on the Chest X-Ray image dataset demonstrate that this new weighting scheme improves classification performances, also the training optimization from the EfficientNet improves the performance furthermore. We compare the aggregate method with several performances from the previous study of thorax diseases classifications to provide the fair comparisons against the proposed method.


Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 642
Author(s):  
Luis Miguel González de Santos ◽  
Ernesto Frías Nores ◽  
Joaquín Martínez Sánchez ◽  
Higinio González Jorge

Nowadays, unmanned aerial vehicles (UAVs) are extensively used for multiple purposes, such as infrastructure inspections or surveillance. This paper presents a real-time path planning algorithm in indoor environments designed to perform contact inspection tasks using UAVs. The only input used by this algorithm is the point cloud of the building where the UAV is going to navigate. The algorithm is divided into two main parts. The first one is the pre-processing algorithm that processes the point cloud, segmenting it into rooms and discretizing each room. The second part is the path planning algorithm that has to be executed in real time. In this way, all the computational load is in the first step, which is pre-processed, making the path calculation algorithm faster. The method has been tested in different buildings, measuring the execution time for different paths calculations. As can be seen in the results section, the developed algorithm is able to calculate a new path in 8–9 milliseconds. The developed algorithm fulfils the execution time restrictions, and it has proven to be reliable for route calculation.


Sign in / Sign up

Export Citation Format

Share Document