Background: The possibility of converting the organic fraction of municipal solid waste to mature compost using the composting bin method was studied. Nine distinct treatments were created by combining municipal solid waste (MSW) with animal waste (3:1, 2:1), poultry manure (3:1, 2:1), mixed waste (2:1:1), agricultural waste (dry leaves), biocont (Trichoderm hazarium), and humic acid. Weekly monitoring of temperature, pH, EC, organic matter (OM percent), and the C/N ratio was performed, and macronutrients (N, P, K) were measured. Trace elements, including heavy metals (Cd and Pb), were tested in the first and final weeks of maturity. Results: Temperatures in the first days of composting reached the thermophilic phase in MSW compost

Background: The possibility of converting the organic fraction of municipal solid waste to mature compost using the composting bin method was studied. Nine distinct treatments were created by combining municipal solid waste (MSW) with animal waste (3:1, 2:1), poultry manure (3:1, 2:1), mixed waste (2:1:1), agricultural waste (dry leaves), biocont (Trichoderm hazarium), and humic acid. Weekly monitoring of temperature, pH, EC, organic matter (OM percent), and the C/N ratio was performed, and macronutrients (N, P, K) were measured. Trace elements, including heavy metals (Cd and Pb), were tested in the first and final weeks of maturity. Results: Temperatures in the first days of composting reached the thermophilic phase in MSW compost

Quantum channels enable the achievement of communication tasks inaccessible to their
classical counterparts. The most famous example is the distribution of secret keys. Unfortunately, the rate
of generation of the secret key by direct transmission is fundamentally limited by the distance. This limit
can be overcome by the implementation of a quantum repeater. In order to boost the performance of the
repeater, a quantum repeater based on cut-off with two different types of quantum memories is suggestd,
which reduces the effect of decoherence during the storage of a quantum state.

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith