نتایج جستجو برای: covering materials

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

Journal: :Sustainability 2022

Against the background of sustainable development, landfill covers can consist a range materials, from clay to geocomposite and polymer composites. Given engineering environmental requirements, we analyzed performance sustainability four sanitary cover namely clay, HDPE, PVC, GCL. Within principles environmentally design, constructed material selection index based on as well economic impacts ma...

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university yazd iran amir ebrahimi zade hassan hosseininasab department of industrial engineering, yazd university yazd iran

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...

Journal: :Journal of Environmental Engineering (Transactions of AIJ) 2003

پایان نامه :0 1374

having conducted the experiment and analysed the data, the researcher computed the groups mean scores and variances for the test relating to the research question. as the final atep, a t-test was conodonted for the hypothesis. as noted earlier, the significance level was determined at .05 and .01 respectively. the observed t-value was higher than the critical t-value at. 5 and .01 levels. conse...

Journal: :European Journal of Combinatorics 1991

Journal: :Electr. J. Comb. 2015
André G. Castoldi Emerson L. Monte Carmelo

We investigate the covering problem in RT spaces induced by the RosenbloomTsfasman metric, extending the classical covering problem in Hamming spaces. Some connections between coverings in RT spaces and coverings in Hamming spaces are derived. Several lower and upper bounds are established for the smallest cardinality of a covering code in an RT space, generalizing results by Carnielli, Chen an...

Journal: :JoCG 2015
John C. Baez Karine Bagdasaryan Philip Gibbs

In 1914 Lebesgue defined a ‘universal covering’ to be a convex subset of the plane that contains an isometric copy of any subset of diameter 1. His challenge of finding a universal covering with the least possible area has been addressed by various mathematicians: Pál, Sprague and Hansen have each created a smaller universal covering by removing regions from those known before. However, Hansen’...

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

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