Hypothesis CO2 geological storage (CGS) involves different mechanisms which can store millions of tonnes of CO2 per year in depleted hydrocarbon reservoirs and deep saline aquifers. But their storage capacity is influenced by the presence of different carboxylic compounds in the reservoir. These molecules strongly affect the water wetness of the rock, which has a dramatic impact on storage capacities and containment security. However, precise understanding of how these carboxylic acids influence the rock’s CO2-wettability is lacking. Experiments We thus systematically analysed these relationships as a function of pressure, temperature, storage depth and organic acid concentrations. A particular focus was on identifying organic acid conce

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a

Poly-ether-ether-ketone (PEEK) was introduced in dentistry as an alternative to metal alloys.

In order to select the optimal tracking of fast time variation of multipath fast time variation Rayleigh fading channel, this paper focuses on the recursive least-squares (RLS) and Extended recursive least-squares (E-RLS) algorithms and reaches the conclusion that E-RLS is more feasible according to the comparison output of the simulation program from tracking performance and mean square error over five fast time variation of Rayleigh fading channels and more than one time (send/receive) reach to 100 times to make sure from efficiency of these algorithms.