Search results for "Depth"
showing 10 items of 408 documents
Hydraulic jumps on rough beds
2007
This paper presents the results of an experimental investigation on the hydraulic jump on horizontal rough beds. Experiments were carried out to study the effect of bed roughness on both the sequent depth ratio and the roller length. The investigation allowed the writers to positively test the reliability of a new solution of the momentum equation for the sequent depth ratio as a function of the Froude number and the ratio between the roughness height and the upstream supercritical flow depth. The applicability of some empirical relationships for estimating the roller length was also tested.
Sample details on OSL data for aeolian sediments in north-eastern part of European Sand Belt
2019
A compilation of previously published and unpublished absolute age (OSL and TL) determinations of aeolian sediments from the north-eastern part of European Sand Belt. Contains age, error, sampling depth, location etc. and a reference to data source. Coordinates of sampling locations for contemporary publications are taken from field observations (GPS), but older ones - published schematic maps. Data set is created according to schema of DATED-1 database (https://doi.org/10.1594/PANGAEA.848117).
Phytoplankton assemblages in reservoirs: Is it chemical or physical constraints which regulate their structure?
1998
Data on phytoplankton assemblages and the correspondent environmental variables, collected in a limnological investigation carried out on 21 Sicilian reservoirs between 1987 and 1988, were ordered to clarify which physical (light availability, mixing depth), chemical (nutrient availability) and biological (grazing pressure) parameters modulate the structure of the assemblages. In particular, data sets were analyzed using CANOCO 3.1. The results of the analysis have shown that physical factors are more important in selecting species for those environments subject to pronounced water-level fluctuations. The reasons of such strong influence may be understood in the secondary modifications that…
P2D: a self-supervised method for depth estimation from polarimetry
2021
Monocular depth estimation is a recurring subject in the field of computer vision. Its ability to describe scenes via a depth map while reducing the constraints related to the formulation of perspective geometry tends to favor its use. However, despite the constant improvement of algorithms, most methods exploit only colorimetric information. Consequently, robustness to events to which the modality is not sensitive to, like specularity or transparency, is neglected. In response to this phenomenon, we propose using polarimetry as an input for a self-supervised monodepth network. Therefore, we propose exploiting polarization cues to encourage accurate reconstruction of scenes. Furthermore, we…
On color image quality assessment using natural image statistics
2014
Color distortion can introduce a significant damage in visual quality perception, however, most of existing reduced-reference quality measures are designed for gray scale images. In this paper, we consider a basic extension of well-known image-statistics based quality assessment measures to color images. In order to evaluate the impact of color information on the measures efficiency, two color spaces are investigated: RGB and CIELAB. Results of an extensive evaluation using TID 2013 benchmark demonstrates that significant improvement can be achieved for a great number of distortion type when the CIELAB color representation is used.
Amidst Uncertainty–or Not? : Decision-Making in Early-Stage Software Startups
2019
It is commonly claimed that the initial stages of any startup business are dominated by continuous, extended uncertainty, in an environment that has even been described as chaotic. Consequently, decisions are made in uncertain circumstances, so making the right decision is crucial to successful business. However, little currently exists in the way of empirical studies into this supposed uncertainty. In this paper, we study decision-making in early-stage software startups by means of a single, in-depth case study. Based on our data, we argue that software startups do not work in a chaotic environment, nor are they characterized by unique uncertainty unlike that experienced by other firms. pe…
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
2017
We study quantum algorithms on search trees of unknown structure, in a model where the tree can be discovered by local exploration. That is, we are given the root of the tree and access to a black box which, given a vertex $v$, outputs the children of $v$. We construct a quantum algorithm which, given such access to a search tree of depth at most $n$, estimates the size of the tree $T$ within a factor of $1\pm \delta$ in $\tilde{O}(\sqrt{nT})$ steps. More generally, the same algorithm can be used to estimate size of directed acyclic graphs (DAGs) in a similar model. We then show two applications of this result: a) We show how to transform a classical backtracking search algorithm which exam…
Conditional Bias Robust Estimation of the Total of Curve Data by Sampling in a Finite Population: An Illustration on Electricity Load Curves
2020
Abstract For marketing or power grid management purposes, many studies based on the analysis of total electricity consumption curves of groups of customers are now carried out by electricity companies. Aggregated totals or mean load curves are estimated using individual curves measured at fine time grid and collected according to some sampling design. Due to the skewness of the distribution of electricity consumptions, these samples often contain outlying curves which may have an important impact on the usual estimation procedures. We introduce several robust estimators of the total consumption curve which are not sensitive to such outlying curves. These estimators are based on the conditio…
Completely independent spanning trees in some regular graphs
2014
International audience; Let k >= 2 be an integer and T-1,..., T-k be spanning trees of a graph G. If for any pair of vertices {u, v} of V(G), the paths between u and v in every T-i, 1 <= i <= k, do not contain common edges and common vertices, except the vertices u and v, then T1,... Tk are completely independent spanning trees in G. For 2k-regular graphs which are 2k-connected, such as the Cartesian product of a complete graph of order 2k-1 and a cycle, and some Cartesian products of three cycles (for k = 3), the maximum number of completely independent spanning trees contained in these graphs is determined and it turns out that this maximum is not always k. (C) 2016 Elsevier B.V. All righ…
Method to Remedy Image Degradations Due to Facet Braiding in 3D Integral-Imaging Monitors
2010
One of the main challenges in 3D integral imaging (InI) is to overcome the limited depth of field of displayed 3D images. Although this limitation can be due to many factors, the phenomenon that produces the strongest deterioration of out-of-focus images is the facet braiding. In fact, the facet braiding is an essential problem, since InI 3D monitors are not feasible if the braiding problem is not solved. In this paper, we propose a very simple method for overcoming the facet braiding effect which is a serious limitation for realization of 3D TV based on InI. Hybrid experiments are presented to verify the theoretical analysis.