Plasma shaping and its impact on the pedestal of ASDEX Upgrade: edge stability and inter-ELM dynamics at varied triangularity

AbstractMolecular-beam epitaxy of quantum-well wires on vicinal surfaces is studied by application of Monte Carlo simulations of a solid-on-solid model. Characterization of simulated quantum-well wires indicates an optimum regime within which the quality of the quantum-well wire is maximized. The model is extended to include observed anisotropies in GaAs growth on vicinal surfaces, and the conclusion is reached that better quality quantum-well wires may be grown on substrates misoriented from the (001) towards [110], rather than [110], due to relative step edge stability on the two misoriented surfaces.

Download Full-text

Edge Stability and Pedestal Profile Sensitivity of Snowflake Diverted Equilibria in the TCV Tokamak

Contributions to Plasma Physics ◽

10.1002/ctpp.201010053 ◽

2010 ◽

Vol 50 (3-5) ◽

pp. 324-330 ◽

Cited By ~ 13

Author(s):

S. Yu. Medvedev ◽

A. A. Ivanov ◽

A. A. Martynov ◽

Yu. Yu. Poshekhonov ◽

R. Behn ◽

...

Keyword(s):

Edge Stability

Download Full-text

Dihalogen edge-modification: an effective approach to realize the half-metallicity and metallicity in zigzag silicon carbon nanoribbons

Journal of Materials Chemistry C ◽

10.1039/c4tc01093k ◽

2014 ◽

Vol 2 (37) ◽

pp. 7836-7850 ◽

Cited By ~ 21

Author(s):

Wei Chen ◽

Hui Zhang ◽

Xiuling Ding ◽

Guangtao Yu ◽

Dan Liu ◽

...

Keyword(s):

Half Metallicity ◽

Edge Modification ◽

Silicon Carbon ◽

Edge Stability

Dihalogen edge modification can effectively break the magnetic degeneracy of the pristine zSiCNRs and significantly enhance edge stability.

Download Full-text

Edge stability in secure graph domination

Discrete Mathematics & Theoretical Computer Science ◽

10.46298/dmtcs.2120 ◽

2015 ◽

Vol Vol. 17 no. 1 (Graph Theory) ◽

Author(s):

Anton Pierre Burger ◽

Alewyn Petrus Villiers ◽

Jan Harm Vuuren

Keyword(s):

Graph Theory ◽

Dominating Set ◽

Domination Number ◽

Arbitrary Subset ◽

Graph Domination ◽

Vertex Set ◽

International Audience ◽

Edge Stability ◽

Secure Domination

Graph Theory International audience A subset X of the vertex set of a graph G is a secure dominating set of G if X is a dominating set of G and if, for each vertex u not in X, there is a neighbouring vertex v of u in X such that the swap set (X-v)∪u is again a dominating set of G. The secure domination number of G is the cardinality of a smallest secure dominating set of G. A graph G is p-stable if the largest arbitrary subset of edges whose removal from G does not increase the secure domination number of the resulting graph, has cardinality p. In this paper we study the problem of computing p-stable graphs for all admissible values of p and determine the exact values of p for which members of various infinite classes of graphs are p-stable. We also consider the problem of determining analytically the largest value ωn of p for which a graph of order n can be p-stable. We conjecture that ωn=n-2 and motivate this conjecture.

Download Full-text