scholarly journals Pinned distance problem, slicing measures, and local smoothing estimates

2018 ◽  
Vol 371 (6) ◽  
pp. 4459-4474 ◽  
Author(s):  
Alex Iosevich ◽  
Bochen Liu
Keyword(s):  
Local Smoothing ◽  
Distance Problem

Effect of chamber roughness and local smoothing on performance of a CAES axial turbine

2021 ◽  
Vol 170 ◽  
pp. 500-516
Author(s):  
Xing Wang ◽  
Xuehui Zhang ◽  
Zhitao Zuo ◽  
Yangli Zhu ◽  
Wen Li ◽  
...  
Keyword(s):  
Local Smoothing ◽  
Axial Turbine

scholarly journals An improved FPT algorithm for the flip distance problem

2021 ◽  
pp. 104708
Author(s):  
Qilong Feng ◽  
Shaohua Li ◽  
Xiangzhong Meng ◽  
Jianxin Wang
Keyword(s):  
Fpt Algorithm ◽  
Distance Problem ◽  
Flip Distance

scholarly journals Local smoothing with robustness against outlying predictors

2004 ◽  
Vol 15 (6) ◽  
pp. 541-554 ◽  
Author(s):  
Jochen Einbeck ◽  
Carmen D. S. André ◽  
Julio M. Singer
Keyword(s):  
Local Smoothing

A Maxmin Distance Problem

1972 ◽  
Vol 94 (2) ◽  
pp. 155-158 ◽  
Author(s):  
R. Aggarwal ◽  
G. Leitmann
Keyword(s):  
Minimum Distance ◽  
Terminal State ◽  
Initial State ◽  
Closed Set ◽  
Distance Problem

The problem of maximizing the minimum distance of a dynamical system’s state from a given closed set, while transferring the system from a given initial state to a given terminal state, is considered. Two different methods of solution of this problem are given.

A General Method for Computing the Distance Between Two Moving Objects Using Optimization Techniques

1992 ◽  
Author(s):  
Ou Ma ◽  
Meyer Nahon
Keyword(s):  
Quadratic Programming ◽  
Moving Objects ◽  
Optimization Techniques ◽  
Quadratic Constraints ◽  
Space Manipulators ◽  
Programming Techniques ◽  
Distance Problem ◽  
A Minor ◽  
Bounding Surfaces ◽  
General Method

Abstract Presented in this paper is a general method used to find the distance between two moving objects. This distance is defined as the length of the shortest path from one object to the other. The objects are assumed to be composed of arbitrary quadratic surface segments. The distance problem is formulated as a quadratic programming problem with linear and/or quadratic constraints, which is solved by efficient and robust quadratic programming techniques. Attention is focused on implementation in order to achieve computational efficiency for real-time applications. Computing tests show that the computational speed of this method is of linear order in terms of the total number of bounding surfaces of the two objects. It is also shown that, with a minor modification, this method can be used to calculate the interference between objects. A corresponding general software code has been implemented, and will be used for kinematics and dynamics modelling and simulation of space manipulators including situations with transient topologies, contact of environment, and capture/release of payloads.

scholarly journals Variable coefficient Wolff-type inequalities and sharp local smoothing estimates for wave equations on manifolds

2020 ◽  
Vol 13 (2) ◽  
pp. 403-433 ◽  
Author(s):  
David Beltran ◽  
Jonathan Hickman ◽  
Christopher D. Sogge
Keyword(s):  
Variable Coefficient ◽  
Wave Equations ◽  
Local Smoothing
Sign in / Sign up

Export Citation Format

Share Document