اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSolving the Imaging Problem with Coherently Integrated Multiwavelength Data
90
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Recovering images from optical interferometric observations is one of the major challenges in the field. Unlike the case of observations at radio wavelengths, in the optical the atmospheric turbulence changes the phases on a very short time scale, which results in corrupted phase measurements. In order to overcome these limitations, several groups developed image reconstruction techniques based only on squared visibility and closure phase information, which are unaffected by atmospheric turbulence. We present the results of two techniques used by our group, which employed coherently integrated data from the Navy Prototype Optical Interferometer. Based on these techniques we were able to recover complex visibilities for several sources and image them using standard radio imaging software. We describe these techniques, the corrections applied to the data, present the images of a few sources, and discuss the implications of these results.
قيم البحث
اقرأ أيضاً
This paper deals with linear algebraic equations where the global coefficient matrix and constant vector are given respectively, by the summation of the coefficient matrices and constant vectors of the individual agents. Our approach is based on refo
rmulating the original problem as an unconstrained optimization. Based on this exact reformulation, we first provide a gradient-based, centralized algorithm which serves as a reference for the ensuing design of distributed algorithms. We propose two sets of exponentially stable continuous-time distributed algorithms that do not require the individual agent matrices to be invertible, and are based on estimating non-distributed terms in the centralized algorithm using dynamic average consensus. The first algorithm works for time-varying weight-balanced directed networks, and the second algorithm works for general directed networks for which the communication graphs might not be balanced. Numerical simulations illustrate our results.
An accurate knowledge of the neutron capture cross sections of 62,63Ni is crucial since both isotopes take key positions which affect the whole reaction flow in the weak s process up to A=90. No experimental value for the 63Ni(n,gamma) cross section
exists so far, and until recently the experimental values for 62Ni(n,gamma) at stellar temperatures (kT=30 keV) ranged between 12 and 37 mb. This latter discrepancy could now be solved by two activations with following AMS using the GAMS setup at the Munich tandem accelerator which are also in perfect agreement with a recent time-of-flight measurement. The resulting (preliminary) Maxwellian cross section at kT=30 keV was determined to be <sigma>30keV = 23.4 +/- 4.6 mb. Additionally, we have measured the 64Ni(gamma,n)63Ni cross section close to threshold. Photoactivations at 13.5 MeV, 11.4 MeV and 10.3 MeV were carried out with the ELBE accelerator at Forschungszentrum Dresden-Rossendorf. A first AMS measurement of the sample activated at 13.5 MeV revealed a cross section smaller by more than a factor of 2 compared to NON-SMOKER predictions.
Many intellectual endeavors require mathematical problem solving, but this skill remains beyond the capabilities of computers. To measure this ability in machine learning models, we introduce MATH, a new dataset of 12,500 challenging competition math
ematics problems. Each problem in MATH has a full step-by-step solution which can be used to teach models to generate answer derivations and explanations. To facilitate future research and increase accuracy on MATH, we also contribute a large auxiliary pretraining dataset which helps teach models the fundamentals of mathematics. Even though we are able to increase accuracy on MATH, our results show that accuracy remains relatively low, even with enormous Transformer models. Moreover, we find that simply increasing budgets and model parameter counts will be impractical for achieving strong mathematical reasoning if scaling trends continue. While scaling Transformers is automatically solving most other text-based tasks, scaling is not currently solving MATH. To have more traction on mathematical problem solving we will likely need new algorithmic advancements from the broader research community.
Sturmfels offered 100 Swiss Francs in 2005 to a conjecture, which deals with a special case of the maximum likelihood estimation for a latent class model. This paper confirms the conjecture positively.
Despite significant advances on distributed continuous-time optimization of multi-agent networks, there is still lack of an efficient algorithm to achieve the goal of distributed optimization at a pre-specified time. Herein, we design a specified-tim
e distributed optimization algorithm for connected agents with directed topologies to collectively minimize the sum of individual objective functions subject to an equality constraint. With the designed algorithm, the settling time of distributed optimization can be exactly predefined. The specified selection of such a settling time is independent of not only the initial conditions of agents, but also the algorithm parameters and the communication topologies. Furthermore, the proposed algorithm can realize specified-time optimization by exchanging information among neighbours only at discrete sampling instants and thus reduces the communication burden. In addition, the equality constraint is always satisfied during the whole process, which makes the proposed algorithm applicable to online solving distributed optimization problems such as economic dispatch. For the special case of undirected communication topologies, a reduced-order algorithm is also designed. Finally, the effectiveness of the theoretical analysis is justified by numerical simulations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
