992 resultados para Empiricial mode decomposition
Resumo:
Near threshold, mixed mode (I and II), fatigue crack growth occurs mainly by two mechanisms, coplanar (or shear) mode and branch (or tensile) mode. For a constant ratio of ΔKI/ΔKII the shear mode growth shows a self-arrest character and it would only start again when ΔKI and ΔKII are increased. Both shear crack growth and the early stages of tensile crack growth, are of a crystallographic nature; the fatigue crack proceeds along slip planes or grain boundaries. The appearance of the fracture surfaces suggest that the mechanism of crack extension is by developing slip band microcracks which join up to form a macrocrack. This process is thought to be assisted by the nature of the plastic deformation within the reversed plastic zone where high back stresses are set up by dislocation pile-ups against grain boundaries. The interaction of the crack tip stress field with that of the dislocation pile-ups leads to the formation of slip band microcracks and subsequent crack extension. The change from shear mode to tensile mode growth probably occurs when the maximum tensile stress and the microcrack density in the maximum tensile plane direction attain critical values.
Resumo:
Two local solutions, one perpendicular and one parallel to the direction of solar gravitational field, are discussed. The influence of gravity on the gas-dynamical process driven by the piston is discussed in terms of characteristic theory, and the flow field is given quantitatively. For a typical piston trajectory similar to the one for an eruptive prominence, the velocity of the shock front which locates ahead the transient front is nearly constant or slightly accelerated, and the width of the compressed flow region may be kept nearly constant or increased linearly, depending on the velocity distribution of the piston. Based on these results, the major features of the transient may be explained. Some of the fine structure of the transient is also shown, which may be compared in detail with observations.
Resumo:
For high-speed-flow lasers, the one-dimensional and first-order approximate treatment in[1] under approximation of geometrical optics is improved still within the scope of approx-imation of geometrical optics. The strict accurate results are obtained, and what is more,two- and three-dimensional treatments are done. Thus for two- and three-dimensional cases, thestable oscillation condition, the formulae of power output and analytical expression of modesunder approximation of geometrical optics (in terms of gain function) are derived. Accord-ing to the present theory, one-and two-dimensional calculations for the typical case of Gerry'sexperiment are presented. All the results coincide well with the experiment and are better thanthe results obtained in [1].In addition, the applicable scope of Lee's stable oscillation condition given by [1] is ex-panded; the condition for the approximation of gcometrical optics to be applied to mode con-structure in optical cavity is obtained for the first time and the difference between thiscondition and that for free space is also pointed out in the present work.
Resumo:
In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the (optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration of the Lagrangian based procedures, the traditional aim consists of obtaining the solution value of the corresponding Lagrangian dual via solving scenario submodels once the nonanticipativity constraints have been dualized. Instead of considering a splitting variable representation over the set of scenarios, we propose to decompose the model into a set of scenario clusters. We compare the computational performance of the four Lagrange multiplier updating procedures, namely the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm and the Dynamic Constrained Cutting Plane scheme for different numbers of scenario clusters and different dimensions of the original problem. Our computational experience shows that the CLD bound and its computational effort depend on the number of scenario clusters to consider. In any case, our results show that the CLD procedures outperform the traditional LD scheme for single scenarios both in the quality of the bounds and computational effort. All the procedures have been implemented in a C++ experimental code. A broad computational experience is reported on a test of randomly generated instances by using the MIP solvers COIN-OR and CPLEX for the auxiliary mixed 0-1 cluster submodels, this last solver within the open source engine COIN-OR. We also give computational evidence of the model tightening effect that the preprocessing techniques, cut generation and appending and parallel computing tools have in stochastic integer optimization. Finally, we have observed that the plain use of both solvers does not provide the optimal solution of the instances included in the testbed with which we have experimented but for two toy instances in affordable elapsed time. On the other hand the proposed procedures provide strong lower bounds (or the same solution value) in a considerably shorter elapsed time for the quasi-optimal solution obtained by other means for the original stochastic problem.