In this paper, to reflect a real fire combustion situation of stilted buildings with typical wooden structure, we used FDS numerical simulation software study the suppression effect fine-water-mist fire-extinguishing system under different working conditions. The influences mist droplet diameters, spray flows, and nozzle densities on temperature change in area were analyzed compared. particle s...

In this paper we present the novel idea of computing near the edge of IOT architecture which enhances the inherent efficiency while computing complex applications. This concept is termed as mist computing. We believe this computing will bring about an massive revolution in future computing technologies. instead of thrusting the control responsibility to gateways while data transmission the cont...

The MATILDA hypermedia authoring framework has been developed in an attempt to address a number of issues related to authoring process, information reuse and application maintainability. In particular, the framework addresses information representation and usage issues, and has been used in the development of a series of data models. The architecture of MATILDA separates the information domain ...

Growing hairy roots in bioreactors has proven challenging. Here we summarize the recent work using a novel bioreactor, the mist reactor, for the culture of hairy roots from many plant species. Compared to most liquid-phase bioreactors, this gasphase bioreactor offers a completely different environment for growing roots. Design, modeling, and some of the unique engineering aspects inherent to mi...

This work aimed to evaluate the effect of acid mist on microbial communities developed mortar with same composition from wall National Museum in Rio de Janeiro. Five autochthonous groups were inoculated coated acrylic paint and uncoated surfaces submitted or water for 100 days. A heterogeneous biofilm was well coupons under mist. Molecular analysis revealed that bacterial structured according i...

The maximum internal spanning tree (MIST) problem is utilized to determine a in graph G, with the number of possible vertices. incremental (IMIST) version MIST whose feasible solutions are edge-sequences e1, e2, …, en−1 such that first k edges form trees for all ∈ [n − 1]. A solution’s quality measured using $${\text{max}_{k \in - 1]}}\frac{{\text{opt}(G,k)}}{{\left| {\text{In}({T_k})} \right|}...