اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFILOU oscillation code
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The present paper provides a description of the oscillation code FILOU, its main features, type of applications it can be used for, and some representative solutions. The code is actively involved in CoRoT/ESTA exercises (this volume) for the preparation for the proper interpretation of space data from the CoRoT mission. Although CoRoT/ESTA exercises have been limited to the oscillations computations for non-rotating models, the main characteristic of FILOU is, however, the computation of radial and non-radial oscillation frequencies in presence of rotation. In particular, FILOU calculates (in a perturbative approach) adiabatic oscillation frequencies corrected for the effects of rotation (up to the second order in the rotation rate) including near degeneracy effects. Furthermore, FILOU works with either a uniform rotation or a radial differential rotation profile (shellular rotation), feature which makes the code singular in the field.
قيم البحث
اقرأ أيضاً
The Liege Oscillation code can be used as a stand-alone program or as a library of subroutines that the user calls from a Fortran main program of his own to compute radial and non-radial adiabatic oscillations of stellar models. We describe the varia
bles and the equations used by the program and the methods used to solve them. A brief account is given of the use and the output of the program.
In neutrino oscillations, a neutrino created with one flavor can be later detected with a different flavor, with some probability. In general, the probability is computed exactly by diagonalizing the Hamiltonian operator that describes the physical s
ystem and that drives the oscillations. Here we use an alternative method developed by Ohlsson & Snellman to compute exact oscillation probabilities, that bypasses diagonalization, and that produces expressions for the probabilities that are straightforward to implement. The method employs expansions of quantum operators in terms of SU(2) and SU(3) matrices. We implement the method in the code NuOscProbExact, which we make publicly available. It can be applied to any closed system of two or three neutrino flavors described by an arbitrary time-independent Hamiltonian. This includes, but is not limited to, oscillations in vacuum, in matter of constant density, with non-standard matter interactions, and in a Lorentz-violating background.
In this paper, our aim is to propose a model for code abstraction, based on abstract interpretation, allowing us to improve the precision of a recently proposed static analysis by abstract interpretation of dynamic languages. The problem we tackle he
re is that the analysis may add some spurious code to the string-to-execute abstract value and this code may need some abstract representations in order to make it analyzable. This is precisely what we propose here, where we drive the code abstraction by the analysis we have to perform.
State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states |A>=(|0>+e^{ipi/4}|1>)/sqrt{2} produced a single
improved |A> state given 15 input copies. New block code state distillation methods can produce k improved |A> states given 3k+8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three.
Despite a decade of active research, there is a marked lack in clone detectors that scale to very large repositories of source code, in particular for detecting near-miss clones where significant editing activities may take place in the cloned code.
We present SourcererCC, a token-based clone detector that targets three clone types, and exploits an index to achieve scalability to large inter-project repositories using a standard workstation. SourcererCC uses an optimized inverted-index to quickly query the potential clones of a given code block. Filtering heuristics based on token ordering are used to significantly reduce the size of the index, the number of code-block comparisons needed to detect the clones, as well as the number of required token-comparisons needed to judge a potential clone. We evaluate the scalability, execution time, recall and precision of SourcererCC, and compare it to four publicly available and state-of-the-art tools. To measure recall, we use two recent benchmarks, (1) a large benchmark of real clones, BigCloneBench, and (2) a Mutation/Injection-based framework of thousands of fine-grained artificial clones. We find SourcererCC has both high recall and precision, and is able to scale to a large inter-project repository (250MLOC) using a standard workstation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
