The Halmos Similarity Problem

Author(s):  
Gilles Pisier
Keyword(s):  
Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 314
Author(s):  
Tianyu Jing ◽  
Huilan Ren ◽  
Jian Li

The present study investigates the similarity problem associated with the onset of the Mach reflection of Zel’dovich–von Neumann–Döring (ZND) detonations in the near field. The results reveal that the self-similarity in the frozen-limit regime is strictly valid only within a small scale, i.e., of the order of the induction length. The Mach reflection becomes non-self-similar during the transition of the Mach stem from “frozen” to “reactive” by coupling with the reaction zone. The triple-point trajectory first rises from the self-similar result due to compressive waves generated by the “hot spot”, and then decays after establishment of the reactive Mach stem. It is also found, by removing the restriction, that the frozen limit can be extended to a much larger distance than expected. The obtained results elucidate the physical origin of the onset of Mach reflection with chemical reactions, which has previously been observed in both experiments and numerical simulations.


2013 ◽  
Vol 65 (1) ◽  
pp. 52-65
Author(s):  
Erik Christensen ◽  
Allan M. Sinclair ◽  
Roger R. Smith ◽  
Stuart White
Keyword(s):  
Type I ◽  

AbstractIn this paper we consider near inclusions of C*-algebras. We show that if B is a separable type I C*-algebra and A satisfies Kadison's similarity problem, then A is also type I. We then use this to obtain an embedding of A into B.


1978 ◽  
Vol 85 (3) ◽  
pp. 173-182
Author(s):  
Michael A. Gauger ◽  
Christopher I. Byrnes

Author(s):  
Maria Kontaki ◽  
Apostolos N. Papadopoulos ◽  
Yannis Manolopoulos

In many application domains, data are represented as a series of values in different time instances (time series). Examples include stocks, seismic signals, audio, and so forth. Similarity search in time series databases is an important research direction. Several methods have been proposed to provide efficient query processing in the case of static time series of fixed length. Research in this field has focused on the development of effective transformation techniques, the application of dimensionality reduction methods, and the design of efficient indexing schemes. These tools enable the process of similarity queries in time series databases. In the case where time series are continuously updated with new values (streaming time series), the similarity problem becomes even more difficult to solve, since we must take into consideration the new values of the series. The dynamic nature of streaming time series precludes the use of methods proposed for the static case. To attack the problem, significant research has been performed towards the development of effective and efficient methods for streaming time series processing. In this article, we introduce the most important issues concerning similarity search in static and streaming time series databases, presenting fundamental concepts and techniques that have been proposed by the research community.


1985 ◽  
Vol 6 (11) ◽  
pp. 1045-1051 ◽  
Author(s):  
Tsai Shu-tang ◽  
Liu Yi-xin
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document