نتایج جستجو برای: uniform fractional part ufp

تعداد نتایج: 806391  

Journal: :Environmental research 2015
Tenzin Wangchuk Mandana Mazaheri Sam Clifford Marzenna R Dudzinska Congrong He Giorgio Buonanno Lidia Morawska

Exposure assessment studies conducted in developing countries have been based on fixed-site monitoring to date. This is a major deficiency, leading to errors in estimating the actual exposures, which are a function of time spent and pollutant concentrations in different microenvironments. This study quantified school children's daily personal exposure to ultrafine particles (UFP) using real-tim...

2017
Nu Yu Shi Shu Yan Lin Jianwen She Ho Sai Simon Ip Xinghua Qiu Yifang Zhu

Commuters who spend long hours on roads are exposed to high levels of traffic related air pollutants (TRAPs). Despite some well-known multiple adverse effects of TRAPs on human health, limited studies have focused on mitigation strategies to reduce these effects. In this study, we measured fine particulate matter (PM2.5) and ultrafine particle (UFP) concentrations inside and outside 17 taxis si...

2017
Erik van Nunen Roel Vermeulen Ming-Yi Tsai Nicole Probst-Hensch Alex Ineichen Mark Davey Medea Imboden Regina Ducret-Stich Alessio Naccarati Daniela Raffaele Andrea Ranzi Cristiana Ivaldi Claudia Galassi Mark Nieuwenhuijsen Ariadna Curto David Donaire-Gonzalez Marta Cirach Leda Chatzi Mariza Kampouri Jelle Vlaanderen Kees Meliefste Daan Buijtenhuijs Bert Brunekreef David Morley Paolo Vineis John Gulliver Gerard Hoek

Long-term ultrafine particle (UFP) exposure estimates at a fine spatial scale are needed for epidemiological studies. Land use regression (LUR) models were developed and evaluated for six European areas based on repeated 30 min monitoring following standardized protocols. In each area; Basel (Switzerland), Heraklion (Greece), Amsterdam, Maastricht, and Utrecht ("The Netherlands"), Norwich (Unit...

Journal: :Eur. J. Comb. 2014
Daniela Kühn Deryk Osthus Timothy Townsend

A conjecture of Erdős from 1965 suggests the minimum number of edges in a kuniform hypergraph on n vertices which forces a matching of size t, where t ≤ n/k. Our main result verifies this conjecture asymptotically, for all t < 0.48n/k. This gives an approximate answer to a question of Huang, Loh and Sudakov, who proved the conjecture for t ≤ n/3k. As a consequence of our result, we extend bound...

2014
M. Viana I. Rivas X. Querol A. Alastuey J. Sunyer M. Álvarez-Pedrerol

The mass concentration, chemical composition and sources of quasi-ultrafine (quasi-UFP, PM0.25), accumulation (PM0.25−2.5) and coarse mode (PM2.5−10) particles were determined in indoor and outdoor air at 39 schools in Barcelona (Spain). Quasi-UFP mass concentrations measured (25.6 μg m−3 outdoors, 23.4 μg m−3 indoors) are significantly higher than those reported in other studies, and character...

2013
George A. Anastassiou

Here we derive a multivariate fractional representation formula involving ordinary partial derivatives of …rst order. Then we prove a related multivariate fractional Ostrowski type inequality with respect to uniform norm. 2010 AMS Mathematics Subject Classi…cation : 26A33, 26D10, 26D15.

2013
George A. Anastassiou

Here we derive multivariate weighted fractional representation formulae involving ordinary partial derivatives of …rst order. Then we present related multivariate weighted fractional Ostrowski type inequalities with respect to uniform norm. 2010 AMS Mathematics Subject Classi…cation : 26A33, 26D10, 26D15.

2003
Hamid Beigy Mohammad Reza Meybodi

In [1], a learning automata (LA) based call admission policy is given which accepts new calls as long as the pre-specified level of QoS is maintained. The simulation results show that this policy cannot maintain the upper bound on the level of QoS. In this paper, we propose a new LA based algorithm in which a L-\ is used to accept/reject ne\v calls. This algorithm can be considered as an adapti...

Journal: :J. Comb. Theory, Ser. A 2012
Noga Alon Peter Frankl Hao Huang Vojtech Rödl Andrzej Rucinski Benny Sudakov

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erdős on estimating the maximum number of edges in a hypergraph when the (fractional) matching number is given, which we are able to solve in some special cases using probabilistic techniques. Based on these ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید