scispace - formally typeset
Search or ask a question
Topic

Bounding overwatch

About: Bounding overwatch is a research topic. Over the lifetime, 966 publications have been published within this topic receiving 15156 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article , a simple yet effective method for automatic extraction of ODIM is proposed by using the contact relations, bounding box data and, the two-dimensional (2D) projections from the 3D-CAD assembly model.

4 citations

Proceedings ArticleDOI
13 Jun 2022
TL;DR: This work provides an efficient, generic tool for upper-bounding key rates in device-independent quantum key distribution and proves that Bell nonlocality is not suf-ficient for the security of standard DIQKD protocols.
Abstract: We provide an efficient, generic tool for upper-bounding key rates in device-independent quantum key distribution (DIQKD) and prove that Bell nonlocality is not suf-ficient for the security of standard DIQKD protocols.

4 citations

Posted Content
TL;DR: In this article, the authors proposed a spectral version of the volatility bound for evaluating asset-pricing models that is a restriction on the volatility of a representative agent is intertemporal marginal rate of substitution (IMRS).
Abstract: Hansen and Jagannathan (1991) proposed a volatility bound for evaluating asset-pricing models that is a restriction on the volatility of a representative agentIs intertemporal marginal rate of substitution (IMRS). We develop a generalization of their bound that (i) incorporates the serial correlation properties of return data and (ii) allows us to calculate a spectral version of the bound. That is, we develop a bound and then decompose it by frequency; this enables us to judge whether models match important aspects of the data in the long run, at business cycle frequencies, seasonal frequencies, etc. Our generalization is related to the space in which the bounding IMRS lives. Instead of specifying the bounding IMRS to be a linear combination of contemporaneous returns, we let the bounding IMRS live in a linear space of current, past and future returns. We also require the bounding IMRS to satisfy additional restrictions that resemble Euler equations. Our volatility bound not only uses the unconditional first and second moment properties of return data but also the serial correlation properties. Incorporating this additional information results in a tighter bound for two reasons. First, we impose additional orthogonality conditions on our bounding IMRS. Second, our projection is onto a larger space (current, past and future returns). We also show that the spectrum of the model IMRS must exceed the spectrum of our bounding IMRS. Using the serial correlation properties of returns (together with the mean and variance), we are able to derive the spectrum of the bounding IMRS. That is, the lower bound on the spectrum of the model IMRS is completely pinned down by asset return data. This permits a frequency-by-frequency examination of the fundamental component of the model, namely, the Euler equation that links asset returns to the IMRS. In particular, we can identify the frequencies at which an asset-pricing model does not perform well. The researcher can then decide whether or not failures at a particular set of frequencies are troubling. We illustrate our method with four asset pricing models -- time-separable CRRA preferences, state non-separable preferences (Epstein-Zin, 1989, 1991), internal habit formation (Constantinides, 1990), and external habit formation preferences (Campbell and Cochrane, 1999) -- using two data sets, annual data from 1889-1992 and quarterly data spanning 1950:1-1995:4.

4 citations

24 Nov 2015
TL;DR: An exact minimum bounding sphere algorithm for large point sets in low dimensions that aims to reduce the number of required passes by retrieving a well-balanced set of outliers in each l pass.
Abstract: We propose an exact minimum bounding sphere algorithm for large point sets in low dimensions. It aims to reduce the number of required passes by retrieving a well-balanced set of outliers in each l ...

4 citations

Patent
29 Dec 1999
TL;DR: In this paper, a multi-dimensional bounding sphere is determined for a collection of points by determining a multidimensional bounding box that encompasses all of the points, determining the center of the bounding spheres from the center, and determining the radius of the bounded sphere.
Abstract: A multi-dimensional bounding sphere is determined for a collection of points by determining a multi-dimensional bounding box that encompasses all of the points, determining the center of the bounding sphere from the center of the bounding box, and determining the radius of the bounding sphere as the distance from the center of the bounding sphere to a location not closer to the center of the bounding sphere than any of the points in the collection of points.

4 citations


Network Information
Related Topics (5)
Robustness (computer science)
94.7K papers, 1.6M citations
85% related
Optimization problem
96.4K papers, 2.1M citations
85% related
Matrix (mathematics)
105.5K papers, 1.9M citations
82% related
Nonlinear system
208.1K papers, 4M citations
81% related
Artificial neural network
207K papers, 4.5M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023714
20221,629
2021155
202075
201973
201850