Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe State of the Art in Hydrodynamic Turbulence: Past Successes and Future Challenges
270
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We present a personal view of the state of the art in turbulence research. We summarize first the main achievements in the recent past, and then point ahead to the main challenges that remain for experimental and theoretical efforts.
rate research
Read More
Graph-structured data are an integral part of many application domains, including chemoinformatics, computational biology, neuroimaging, and social network analysis. Over the last two decades, numerous graph kernels, i.e. kernel functions between graphs, have been proposed to solve the problem of assessing the similarity between graphs, thereby making it possible to perform predictions in both classification and regression settings. This manuscript provides a review of existing graph kernels, their applications, software plus data resources, and an empirical comparison of state-of-the-art graph kernels.
After briefly reviewing the good agreement between large-scale observations and the predictions of the now-standard CDM theory and problems with the MOND alternative, I summarize several of the main areas of possible disagreement between theory and observation: galaxy centers, dark matter substructure, angular momentum, and the sequence of cosmogony, updating earlier reviews [1]. All of these issues are sufficiently complicated that it is not yet clear how serious they are, but there is at least some reason to think that the problems will be resolved through a deeper understanding of the complicated gastrophysics of star formation and feedback from supernovae and AGN.
The idea of predicting the future from the knowledge of the past is quite natural when dealing with systems whose equations of motion are not known. Such a long-standing issue is revisited in the light of modern ergodic theory of dynamical systems and becomes particularly interesting from a pedagogical perspective due to its close link with Poincares recurrence. Using such a connection, a very general result of ergodic theory - Kacs lemma - can be used to establish the intrinsic limitations to the possibility of predicting the future from the past. In spite of a naive expectation, predictability results to be hindered rather by the effective number of degrees of freedom of a system than by the presence of chaos. If the effective number of degrees of freedom becomes large enough, regardless the regular or chaotic nature of the system, predictions turn out to be practically impossible. The discussion of these issues is illustrated with the help of the numerical study of simple models.
The recent proliferation of computing technologies (e.g., sensors, computer vision, machine learning, and hardware acceleration), and the broad deployment of communication mechanisms (e.g., DSRC, C-V2X, 5G) have pushed the horizon of autonomous driving, which automates the decision and control of vehicles by leveraging the perception results based on multiple sensors. The key to the success of these autonomous systems is making a reliable decision in real-time fashion. However, accidents and fatalities caused by early deployed autonomous vehicles arise from time to time. The real traffic environment is too complicated for current autonomous driving computing systems to understand and handle. In this paper, we present state-of-the-art computing systems for autonomous driving, including seven performance metrics and nine key technologies, followed by twelve challenges to realize autonomous driving. We hope this paper will gain attention from both the computing and automotive communities and inspire more research in this direction.
This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in finance that are computationally challenging classically and for which quantum computing algorithms are promising. In the main part, we describe in detail quantum algorithms for specific applications arising in financial services, such as those involving simulation, optimization, and machine learning problems. In addition, we include demonstrations of quantum algorithms on IBM Quantum back-ends and discuss the potential benefits of quantum algorithms for problems in financial services. We conclude with a summary of technical challenges and future prospects.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
