We present an entropy discussion, which indicates that the schemes with nodal solvers constructed following the old formula, which can only use the 1D Riemann solvers satisfying our strong entropy condition, are usually numerically very dissipative.
Other documents released to the media on Tuesday indicate that the scheme may have been in operation for almost 30 years, suggesting that previous Brazilian governments may also be drawn into the scandal.
Our simulation results indicated that the scheme improved the performance of the data flooding.
Numerical experiments conducted indicate that the scheme is feasible and accurate.
The results indicate that the scheme participants may have global diversification benefit by investing in US and Japanese equity funds.
Our results indicate that the scheme does not achieve its designed objectives of tamper detection and image ownership.
The comparison indicated that the scheme, including the Earth Moon L2 point and return to the Moon, was preferred for the CHANG'E-5T1 extended mission.
Our findings indicate that the scheme consistently achieves greater performance improvement on Erdos Renyi's random graphs than on other graphs such as Barabasi-Albert's scale-free graphs and two social graphs empirically sampled from Facebook and Douban OSNs.
The numerical calculations indicate that the scheme is numerically sufficiently stable and well behaving, exhibits high degree of parallelism, and produces results in agreement with the existing numerical data.
Trials conducted using a conventional, powered C-47, first conducting ordinary deadstick landings, then being towed by another C-47, indicated that the scheme was feasible.
