Results 1 to 10 of about 1,569,721 (239)

Numerical study of different ventilation schemes in a classroom for efficient aerosol control

Heliyon, 2023
The air quality is a parameter to be controlled in order to live in a comfortable place. This paper analyzes the trajectory of aerosols exhaled into the environment in a classroom.
Ainara Ugarte-Anero, Unai Fernandez-Gamiz, Koldo Portal-Porras, Jose Manuel Lopez-Guede, Gaspar Sanchez-Merino   +4 more
doaj   +1 more source

Path count asymptotics and Stirling numbers [PDF]

, 2010
We obtain formulas for the growth rate of the numbers of certain paths in infinite graphs built on the two-dimensional Eulerian graph. Corollaries are identities relating Stirling numbers of the first and second kinds.Comment: Misprint corrected.
Petersen, K., Varchenko, A.
core   +5 more sources

RNA-seq assembly – Are we there yet?

Frontiers in Plant Science, 2012
Transcriptomic sequence resources represent invaluable assets for research, in particular for non-model species without a sequenced genome. To date, the Next Generation Sequencing technologies 454/Roche and Illumina have been used to generate ...
Simon eSchliesky, Udo eGowik, Andreas P M Weber, Andrea eBraeutigam   +3 more
doaj   +1 more source

Modeling Performance of SCALE‐AMPS: Simulations of Arctic Mixed‐Phase Clouds Observed During SHEBA

Journal of Advances in Modeling Earth Systems, 2022
The Advanced Microphysics Prediction System (AMPS), which adopts a two‐moment hybrid‐bin habit‐predicting scheme, was previously developed to study cloud microphysical processes that depend on ice habit; however, only one particular atmospheric model ...
Chia Rui Ong, Makoto Koike, Tempei Hashino, Hiroaki Miura   +3 more
doaj   +1 more source

Synchronizing Automata on Quasi Eulerian Digraph [PDF]

, 2012
In 1964 \v{C}ern\'{y} conjectured that each $n$-state synchronizing automaton posesses a reset word of length at most $(n-1)^2$. From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in $n$.
A.L. Dulmage, A.N. Trahtman, B. Steinberg, B. Steinberg, C.D. Meyer, D. Ananichev, H. Wielandt, J. Kari, J. Černý, J.-E. Pin, L. Dubuc, M. Berlinkov, M. Jungers, M.V. Volkov, P. Frankl   +14 more
core   +1 more source

An Explosive Driven Shock Tube-Based Laboratory Scale Test for Combined Blast and Fragment Impact Loading

Applied Sciences, 2022
This work is a part of a larger research effort to better understand the combined effect of the blast wave and fragment impacts following the detonation of a shrapnel bomb. It is known that the time interval Δt, which represents the difference in arrival
Oussama Atoui, Georgios Kechagiadakis, Abdelhafidh Moumen, Azer Maazoun, Bachir Belkassem, Lincy Pyl, David Lecompte   +6 more
doaj   +1 more source

Approximating ATSP by Relaxing Connectivity

, 2015
The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments
Svensson, Ola
core   +1 more source

An efficient parametric modeling and path planning method for 3D printing of curved surface corrugated sandwich structures

Graphical Models
This study proposes an efficient preprocessing method and parametric modeling technique for the path planning of corrugated curved surface sandwich structures.
Tan Gui, Zhihong Li, Yongjun Cao, Jianghong Yang, Yingjun Wang   +4 more
doaj   +1 more source

Granular flow in static mixers by coupled DEM/CFD approach [PDF]

Hemijska Industrija, 2016
The mixing process greatly influence the mixing efficiency, as well as the quality and the price of the intermediate and/or the final product. Static mixer is used for premixing action before the main mixing process, for significant reduction of
Pezo Lato, Pezo Milada, Jovanović Aca, Kosanić Nenad, Petrović Aleksandar, Lević Ljubinko   +5 more
doaj   +1 more source

On fractionality of the path packing problem

, 2008
In this paper, we study fractional multiflows in undirected graphs. A fractional multiflow in a graph G with a node subset T, called terminals, is a collection of weighted paths with ends in T such that the total weights of paths traversing each edge ...
A Frank, A Karzanov, A Karzanov, BV Cherkassky, EA Dinic, H Hirai, H Hirai, H Ilani, L Lovãsz, LR Ford Jr, M Lomonosov, M Lomonosov, N Vanetik, Natalia Vanetik, TC Hu   +14 more
core   +1 more source