In the design and operation of a superconducting magnet, stability and protection are two key issues that determine the magnet's reliability and safe operation. Although the high-temperature superconductor (HTS) is considered much more stable than the low-temperature superconductor (LTS), it is susceptible to damage caused primarily by three events that can occur in large-scale "real" devices: ...

One of the main purposes of humanoid robots is to improve the quality of life of elderly and/or disabled people by helping them in their everyday activities. In other words, robots need to interact with humans in a meaningful, flexible and adaptable manner, ideally by observing, recognizing and understanding the behavior of the humans. Understanding human activities is a common and difficult pr...

A hamiltonian cycle C of G is described as 〈u1, u2, . . . , un(G), u1〉 to emphasize the order of nodes in C. Thus, u1 is the beginning node and ui is the i-th node in C. Two hamiltonian cycles of G beginning at a node x, C1 = 〈u1, u2, . . . , un(G), u1〉 and C2 = 〈v1, v2, . . . , vn(G), v1〉, are independent if x = u1 = v1, and ui 6= vi for every 2 ≤ i ≤ n(G). A set of hamiltonian cycles {C1, C2,...

We show that diradicaloid helical conjugated molecules can display strong through-space bonding interactions. These interactions are analogous to π-stacking pancake bonding widely observed for dimers and other aggregates of stable π-conjugated radicals. We show that these multicenter interactions can have a significant stabilizing effect, but they depend in subtle ways on the specific overlap a...

In this paper, we consider the fault hamiltonicity and the fault hamiltonian connectivity of the pancake graph Pn. Assume that F ⊆ V (Pn)∪E(Pn). For n 4, we prove that Pn−F is hamiltonian if |F | (n−3) and Pn−F is hamiltonian connected if |F | (n− 4). Moreover, all the bounds are optimal.  2003 Elsevier Science B.V. All rights reserved.

Graphs are often used as models to solve problems in computer science, mathematics, and biology. A pancake sorting problem is modeled using a graph whose classes include burnt graphs, signed permutation restricted graphs. The network cost degree × diameter. Finding with small like finding good algorithm. We propose novel recursively divided (RDP) that has smaller than other pancake-like In the ...

Particle methods are a ubiquitous tool for solving the Vlasov-Poisson equation in comoving coordinates, which is used to model the gravitational evolution of dark matter in an expanding universe. However, these methods are known to produce poor results on idealized test problems, particularly at late times, after the particle trajectories have crossed. To investigate this, we have performed a s...

Aims. We study the case of a solar-type star penetrating deeply within the tidal radius of a massive black hole. We focus on the compression phase leading to a so-called pancake configuration of the star at the instant of maximal compression. The aim is to provide reliable estimates of the thermodynamical quantities involved in the pancake star, and to solve a controversy about whether or not t...