Experiments on Stability of Tetrapods on Rear Slope of Rubble Mound Structures under Wave Overtopping Condition

In this study, hydraulic model tests were performed to investigate the stability of armor units at harbor side slope for rubble mound structures. The Korean design standard for harbor and fishery port suggested the design figures that showed the ratio of the armor weight for each location of rubble mound structures and it could be known that the same weight ratio was needed to the sea side and harbor side (within 0.5H from the minimum design water level) slope of rubble mound structures. The super structures were commonly applied to the design process of rubble mound structures in Korea and the investigation of the effects of super structures would be needed. The stability number (Nod = 0.5) was applied (van der Meer, 1999) and it showed that the armor (tetrapod) weight ratio for harbor side slope of rubble mound structures needed 0.8 times of that for sea side slope.

Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming

In the context of the maximum stable set problem, rank inequalities impose that the cardinality of any set of vertices contained in a stable set be, at most, as large as the stability number of the subgraph induced by such a set. Rank inequalities are very general, as they subsume many classical inequalities such as clique, hole, antihole, web, and antiweb inequalities. In spite of their generality, the exact separation of rank inequalities has never been addressed without the introduction of topological restrictions on the induced subgraph and the tightness of their closure has never been investigated systematically. In this work, we propose a methodology for optimizing over the closure of all rank inequalities with a right-hand side no larger than a small constant without imposing any restrictions on the topology of the induced subgraph. Our method relies on the exact separation of a relaxation of rank inequalities, which we call relaxed k-rank inequalities, whose closure is as tight. We investigate the corresponding separation problem, a bilevel programming problem asking for a subgraph of maximum weight with a bound on its stability number, whose study could be of independent interest. We first prove that the problem is [Formula: see text]-hard and provide some insights on its polyhedral structure. We then propose two exact methods for its solution: a branch-and-cut algorithm (which relies on a family of faced-defining inequalities which we introduce in this paper) and a purely combinatorial branch-and-bound algorithm. Our computational results show that the closure of rank inequalities with a right-hand side no larger than a small constant can yield a bound that is stronger, in some cases, than Lovász’s Theta function, and substantially stronger than bounds obtained with standard inequalities that are valid for the stable set problem, including odd-cycle inequalities and wheel inequalities. Summary of Contribution: This paper proposes two original methods for solving a challenging cut-separation problem (of bilevel type) for a large class of inequalities valid for one of the key operations research problems, namely, the max stable set problem. An extensive set of experimental results validates the proposed methods. All the source code and data sets are available online on GitHub.

Getting new algorithmic results by extending distance-hereditary graphs via split composition

In this paper, we consider the graph class denoted as Gen(∗;P3,C3,C5). It contains all graphs that can be generated by the split composition operation using path P3, cycle C3, and any cycle C5 as components. This graph class extends the well-known class of distance-hereditary graphs, which corresponds, according to the adopted generative notation, to Gen(∗;P3,C3). We also use the concept of stretch number for providing a relationship between Gen(∗;P3,C3) and the hierarchy formed by the graph classes DH(k), with k ≥1, where DH(1) also coincides with the class of distance-hereditary graphs. For the addressed graph class, we prove there exist efficient algorithms for several basic combinatorial problems, like recognition, stretch number, stability number, clique number, domination number, chromatic number, and graph isomorphism. We also prove that graphs in the new class have bounded clique-width.

The Consolidated Mathews Stability Graph for Open Stope Design

The stability graph method of stope design is one of the most widely used methods of stability assessments of stopes in underground polymetallic mines. The primary objective of this work is to introduce a new stability chart, which includes all relevant case histories, and to exclude parameters with uncertainties in the determination of stability number. The modified stability number was used to achieve this goal, and the Extended Mathews database was recalculated and compared with the new stability graph. In this study, a new refined Consolidated stability graph was developed by excluding the entry mining methods data from the Extended graph data, and only the non-entry methods data was used. The applicability of the proposed Consolidated stability chart was demonstrated by an open stope example. The stability for each stope surface was evaluated by a probabilistic approach employing a logistic regression model and the developed Consolidated stability chart. Comparing the stability analysis results with that of other published works of the same example shows that the determined Consolidated chart, in which the entry-method data is excluded, produces a more conservative and safer design. In conclusion, the size and quality of the dataset dictate the reliability of this approach.

On the stability of a laminated beam with structural damping and Gurt–Pipkin thermal law

In this paper, we investigate the stabilization of a one-dimensional thermoelastic laminated beam with structural damping coupled with a heat equation modeling an expectedly dissipative effect through heat conduction governed by Gurtin–Pipkin thermal law. Under some assumptions on the relaxation function g, we establish the well-posedness of the problem by using Lumer–Phillips theorem. Furthermore, we prove the exponential stability and lack of exponential stability depending on a stability number by using the perturbed energy method and Gearhart–Herbst–Prüss–Huang theorem, respectively.

General decay of porous elastic system with thermo-viscoelastic damping

In this work, we consider a one-dimensional porous thermoelastic system, where the heat flux used is introduced by Green and Naghdi theories. We establish a general decay result depending on the memory kernel and a new introduced stability number.

STABILITY OF HIGH DENSITY CUBES IN RUBBLE MOUND BREAKWATERS

The stability number for rubble mound breakwaters is a function of several parameters and depends on unit shape, placing method, slope angle, relative density, etc. In this study two different densities for cubes in breakwater armour layers were tested to determine the influence of the density on the stability. The experimental results show that the stability of high density blocks were found to be more stable and the damage initiation for high density blocks started at higher stability numbers compared to normal density cubes.