Abstract When sawing a log into lumber or other products, the saw blade removes material to separate wood fibers between resulting two parts, loss of that is commonly referred as kerf. Thicker kerfs result in greater waste and less available produce lumber. Over past decades, with advancement materials technology, thickness has decreased. However, reduction owing kerf may not always translate s...

Antibiotic treatment of Staphylococcus aureus infections is often problematic due to the slow response and recurrences. The intracellular persistence of the staphylococci offers a plausible explanation for the treatment difficulties because of the impaired intracellular efficacies of the antibiotics. The intra- and extracellular time- and concentration-kill relationships were examined in vitro ...

Polyhexanide and betaine topical solution is used in the management of infected wounds as a cleaning agent. An in vitro study was conducted to examine the antimicrobial effects of a solution containing 0.1% of the antimicrobial agent polyhexanide and 0.1% of the surfactant betaine. Three batches of each product were tested, and culture results of 13 microorganisms were evaluated after 7, 14, an...

The refutation tree problem is to compute a refutation tree which is associated with the structure of a graph generated by a formal graph system (FGS).We present subclasses of FGSs, called simple FGSs, size-bounded simple FGSs and bounded simple FGSs. In order to show that the refutation tree problem for simple FGSs can be solved in polynomial time, we prove that the refutation tree problem for...

There is renewed interest in the therapeutic use of honey, including use in the treatment of infected wounds and burn patients. In this study, we have assessed the antibacterial activity of Libyan floral Hannon honey on Escherichia coli and Staphylococcus aureus, both known to infect wounds. The effects of four concentrations (5%-30%) of honey were compared with that of four antibiotics (ampici...

We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.

We generalize various classical results on specialization of fundamental groups to log schemes in the sense of Fontaine and Illusie. The key technical result relates the category of finite Kummer étale covers of a fs log scheme over a complete noetherian local ring to the Kummer étale coverings of its reduction, generalizing earlier results of Hoshi.