نتایج جستجو برای: thick subset
تعداد نتایج: 137981 فیلتر نتایج به سال:
8:45am Welcome and Introduction Innovations in Deep Exploration 9:00 Richard Hillis (DETCRC) The Deep Exploration Technologies CRC 9:30 Steven Hill (The University of Adelaide) Some deep thinking about deep regolith 9:50 Andreas Schmidt-Mumm (The University of Adelaide) Tracing ore systems using mineral chemistry 10:10 Graham Heinson (The University of Adelaide) Joint inversion of seismic and M...
We investigate when thick 3D polygonal chains are locked, i.e., have a disconnected configuration space. In particular, we show that thick 4-chains are never locked, and we exhibit a class of locked thick 5-chains whose ratio of maximum edge length to minimum edge length is strictly less than 3 (the best known ratio for nonthick chains).
In this paper, a method is proposed for geometrically constructing thick panel structures that follow the kinetic behavior of rigid origami by using tapered or two-ply panels and hinges located at their edges. The proposed method can convert generalized pattern of rigid-foldable origami into thick panels structure with kinetic motion, which leads to novel designs of origami for various engineer...
We consider the problem of finding shortest non-crossing thick paths in a polygonal domain, where a thick path is a Minkowski sum of a usual path and unit disk. We show that in a simple polygon, K shortest paths may be found in optimal O(K(n + K)) time and O(n + K) space. For polygons with holes we show that the problem becomes (weakly) NP-hard even for the case K = 2 and even when the paths ar...
Properties of turbulence, such as the direction of the energy cascade depend on the flow dimensionality. Recent experimental results reveal new physics understanding of flows in thick layers. We show that the flow dimensionality can be characterized by the flow damping and that a comparison of the decay rate with that of a quasi-2D flow can be used as a measure of dimensionality of a turbulent ...
We investigate the spacetime of a thick gravitating domain wall for a general potential V (Φ). Using general analytical arguments we show that all nontrivial solutions fall into two categories: those interpretable as an isolated domain wall with a cosmological event horizon, and those which are pure false vacuum de Sitter solutions. Although this latter solution is always unstable to the field ...
The paper deals with the reliability–based design optimization (RBDO) of concrete gravity dams subjected to earthquake load using subset simulation. The optimization problem is formulated such that the optimal shape of concrete gravity dam described by a number of variables is found by minimizing the total cost of concrete gravity dam for the given target reliability. In order to achieve this p...
Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...
in the transformation semigroup (x, s) we introduce the height of a closed nonempty invariant subset of x, define the transformed dimension of nonempty subset s of x and obtain some results and relations.
A code C in a generalised quadrangle $${\mathcal {Q}}$$ is defined to be subset of the vertex set point-line incidence graph $${\Gamma }$$ . The minimum distance $$\delta $$ smallest between pair distinct elements C. metric gives rise partition $$\{C,C_1,\ldots ,C_\rho \}$$ , where $$\rho maximum any and its nearest element Since diameter 4, both are at most 4. If =4$$ then partial ovoid or spr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید