نتایج جستجو برای: full toroidal
تعداد نتایج: 302329 فیلتر نتایج به سال:
Since its introduction in the early 1980s, the gyrokinetic particle-in-cell (PIC) method has been very successfully applied to the exploration of many important kinetic stability issues in magnetically confined plasmas. Its self-consistent treatment of charged particles and the associated electromagnetic fluctuations makes this method appropriate for studying enhanced transport driven by plasma...
The toroidal field coil system of the FIRE tokamak utilizes LN2 cooled, copper alloy Bitter plate type magnets. The wedged configuration is baseline structural concept for the project. A beryllium copper alloy has been chosen for the conductor. Reported are some of the refinements in the design and analysis of FIRE based on a re-sizing of the machine to 2.14m The larger machine offers greater s...
In this paper we construct a large class of modules for toroidal Lie superalgebras. Toroidal Lie superalgebras are universal central extensions of g⊗A where g is a basic classical Lie superalgebra and A is Laurent polynomial ring in several variables. The case where g is a simple finite dimensional Lie algebra is included.
We derive formulas for (i) the number of distinct toroidal n × n binary arrays, allowing rotation of rows and/or columns as well as matrix transposition, and (ii) the number of distinct toroidal n × n binary arrays, allowing rotation and/or reflection of rows and/or columns as well as matrix transposition.
We show that a k x n diagonal mesh is isomorphic to a 9 x 9 -9 x 9 twisted toroidal mesh, i.e., a network similar to a standard 9 x 9 toroidal mesh, but with opposite handed twists of 9 in the two directions, which results in a loss of (9)2 nodes
A formula for the number of toroidal m × n binary arrays, allowing rotation of the rows and/or the columns but not reflection, is known. Here we find a formula for the number of toroidal m × n binary arrays, allowing rotation and/or reflection of the rows and/or the columns.
This paper studies deterministic movement over toroidal grids, integrating local information, bounded memory and choice at individual nodes. The research is motivated by recent work on deterministic random walks, and applications in multi-agent systems. Several results regarding passing tokens through toroidal grids are discussed, as well as some open questions.
In this paper, we shall prove that a projective-planar (resp., toroidal) triangulation G has K6 as a minor if and only if G has no quadrangulation isomorphic to K4 (resp., K5) as a subgraph. As a application of the theorems, we can prove that Hadwiger’s conjecture is true for projective-planar and toroidal triangulations.
We derive explicit local transport relations for the global gyrokinetic formalism at arbitrary wavelength. This is an extension of the analysis in Scott et. al. 2010 where this was examined in the long-wavelength limit. Deriving a local expression for the fluxes requires that the gyroaveraging operator is symmetric, so that if point B is on the gyroring around A, point A is on the gyroring arou...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید