The cut-set $$\partial (S)$$ of a graph $$G=(V,E)$$ is the set edges that have one endpoint in $$S\subset V$$ and other $$V\setminus S$$ , whenever G[S] connected, cut $$[S,V\setminus S]$$ G called connected cut. A bond an inclusion-wise minimal disconnecting G, i.e., bonds are cut-sets determine cuts such $$G[V\setminus both connected. Contrasting with large number studies related to maximum c...

Volueme compelto v. 7, n. 22, set./dez. 2022.

In underground mining, hydraulic backfill materials, such as waste tailings, river sand, and cement, are often used to fill underground mined stopes. In cut-and-fill mining methods with blasthole stoping and delayed backfill, after extraction of adjacent pillars that contain economic minerals, the backfill is often subject to exposure of free standing on at least one side. A key concern for min...

We have assessed the physical and dynamic characteristics of 23 home jet nebulizer/compressor combinations currently available in the UK and Europe. The combinations were evaluated in terms of pressure-flow characteristics, aerosol mass distribution, volume output, electrical costs, and sound level. In addition, we determined the effect of nebulizer fill volume on aerosol mass distribution and ...

The construction suggested by Lemma 1 enables transformation of a prof?lem of maximization of E, to a problem of maximiza-tion of E , ; hence randomness can be introduced. To summarize, given a quadratic function of the form E, or E,, it is possible to construct a neural network which will perform a random local search for the maximum. A rich class of optimization problems can be represented by...