اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA tomography of the $log(langle Irangle_e)-log(R_e)$ plane
283
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Context. We present a reanalysis of the distribution of galaxies in the $log(langle Irangle_e)-log(R_e)$ plane under a new theoretical perspective. Aims. Using the data of the WINGS database and those of the Illustris simulation we will demonstrate that the origin of the observed distribution in this parameter space can be understood only by accepting a new interpretation of the $log(L)$-$log(sigma)$ relation Methods. We simulate the distribution of galaxies in the $log(langle Irangle_e)-log(R_e)$ plane starting from the new $L=L_0sigma^beta$ relation proposed by DOnofrio et al. (2020) and we discuss the physical mechanisms that are hidden in this empirical law. Results. The artificial distribution obtained assuming that beta spans either positive and negative values and that $L_0$ changes with $beta$, is perfectly superposed to the observational data, once it is postulated that the Zone of Exclusion (ZoE) is the limit of virialized and quenched objects. Conclusions. We have demonstrated that the distribution of galaxies in the $log(langle Irangle_e)-log(R_e)$ plane is not linked to the peculiar light profiles of the galaxies of different luminosity, but originate from the mass assembly history of galaxies, made of merging, star formation events, star evolution and quenching of the stellar population.
قيم البحث
اقرأ أيضاً
In the log Age vs. integrated absolute magnitude (M_V) plane, the open clusters of the Milky Way form a well-defined band parallel to theoretical sequences decribing the passive evolution of Simple Stellar Populations and display a pretty sharp upper
threshold in mass (M ~ 2X 10^4 M_{sun}) over a 4 dex range of ages.
Given a positive lower semi-continuous density $f$ on $mathbb{R}^2$ the weighted volume $V_f:=fmathscr{L}^2$ is defined on the $mathscr{L}^2$-measurable sets in $mathbb{R}^2$. The $f$-weighted perimeter of a set of finite perimeter $E$ in $mathbb{R}^
2$ is written $P_f(E)$. We study minimisers for the weighted isoperimetric problem [ I_f(v):=infBig{ P_f(E):Etext{ is a set of finite perimeter in }mathbb{R}^2text{ and }V_f(E)=vBig} ] for $v>0$. Suppose $f$ takes the form $f:mathbb{R}^2rightarrow(0,+infty);xmapsto e^{h(|x|)}$ where $h:[0,+infty)rightarrowmathbb{R}$ is a non-decreasing convex function. Let $v>0$ and $B$ a centred ball in $mathbb{R}^2$ with $V_f(B)=v$. We show that $B$ is a minimiser for the above variational problem and obtain a uniqueness result.
We show how to efficiently compute the derivative (when it exists) of the solution map of log-log convex programs (LLCPs). These are nonconvex, nonsmooth optimization problems with positive variables that become convex when the variables, objective f
unctions, and constraint functions are replaced with their logs. We focus specifically on LLCPs generated by disciplined geometric programming, a grammar consisting of a set of atomic functions with known log-log curvature and a composition rule for combining them. We represent a parametrized LLCP as the composition of a smooth transformation of parameters, a convex optimization problem, and an exponential transformation of the convex optimization problems solution. The derivative of this composition can be computed efficiently, using recently developed methods for differentiating through convex optimization problems. We implement our method in CVXPY, a Python-embedded modeling language and rewriting system for convex optimization. In just a few lines of code, a user can specify a parametrized LLCP, solve it, and evaluate the derivative or its adjoint at a vector. This makes it possible to conduct sensitivity analyses of solutions, given perturbations to the parameters, and to compute the gradient of a function of the solution with respect to the parameters. We use the adjoint of the derivative to implement differentiable log-log convex optimization layers in PyTorch and TensorFlow. Finally, we present applications to designing queuing systems and fitting structured prediction models.
We study three different measures of quantum correlations -- entanglement spectrum, entanglement entropy, and logarithmic negativity -- for (1+1)-dimensional massive scalar field in flat spacetime. The entanglement spectrum for the discretized scalar
field in the ground state indicates a cross-over in the zero-mode regime, which is further substantiated by an analytical treatment of both entanglement entropy and logarithmic negativity. The exact nature of this cross-over depends on the boundary conditions used -- the leading order term switches from a $log$ to $log-log$ behavior for the Periodic and Neumann boundary conditions. In contrast, for Dirichlet, it is the parameters within the leading $log-log$ term that are switched. We show that this cross-over manifests as a change in the behavior of the leading order divergent term for entanglement entropy and logarithmic negativity close to the zero-mode limit. We thus show that the two regimes have fundamentally different information content. Furthermore, an analysis of the ground state fidelity shows us that the region between critical point $Lambda=0$ and the crossover point is dominated by zero-mode effects, featuring an explicit dependence on the IR cutoff of the system. For the reduced state of a single oscillator, we show that this cross-over occurs in the region $Nam_fsim mathscr{O}(1)$.
Logs have been widely adopted in software system development and maintenance because of the rich system runtime information they contain. In recent years, the increase of software size and complexity leads to the rapid growth of the volume of logs. T
o handle these large volumes of logs efficiently and effectively, a line of research focuses on intelligent log analytics powered by AI (artificial intelligence) techniques. However, only a small fraction of these techniques have reached successful deployment in industry because of the lack of public log datasets and necessary benchmarking upon them. To fill this significant gap between academia and industry and also facilitate more research on AI-powered log analytics, we have collected and organized loghub, a large collection of log datasets. In particular, loghub provides 17 real-world log datasets collected from a wide range of systems, including distributed systems, supercomputers, operating systems, mobile systems, server applications, and standalone software. In this paper, we summarize the statistics of these datasets, introduce some practical log usage scenarios, and present a case study on anomaly detection to demonstrate how loghub facilitates the research and practice in this field. Up to the time of this paper writing, loghub datasets have been downloaded over 15,000 times by more than 380 organizations from both industry and academia.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
