نتایج جستجو برای: arc length scheme
تعداد نتایج: 555715 فیلتر نتایج به سال:
We developed an algorithm to find and characterize gravitationally lensed galaxies (arcs) to perform a comparison of the observed and simulated arc abundance. Observations are from the Cluster Lensing And Supernova survey with Hubble (CLASH). Simulated CLASH images are created using the MOKA package and also clusters selected from the high-resolution, hydrodynamical simulations, MUSIC, over the...
Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex s to a vertex 1 with the smallest possible range of arc lengths. and MINRATIO, i.e., find such a path for which the ratio of the largest to the smallest arc length is minimum. Several bicriterion extensions of these problems are also considered. Ke_vwords: Bicriterion paths; Range; Ratio
In this article an “hyper-reduced” scheme for the Crisfield’s algorithm (Crisfield, 1981) applied to buckling simulations and plastic instabilities is presented. The two linear systems ellipse equation entering are projected on a reduced space solved in integration domain, resulting system of equations. Use made Gappy proper orthogonal decomposition recover stresses outside domain. Various meth...
The two main electrode techniques for fullerenes production; the direct arc technique and the resistive heating of graphite rod were employed in this work. One of the electrodes was resistively heated to high temperature and subjected to arc discharge along its length by the second graphite rod. Fullerenes solid were extracted from carbon soot samples collected from an installed arc discharge s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید