نتایج جستجو برای: bound methods

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

Journal: :Journal of the Royal Statistical Society: Series B (Statistical Methodology) 2015

Journal: :international journal of environmental research 2014
s.c. chen s.z. you i.y. chang

the purpose of this study was to conduct a quantitative risk assessment for pah exposure forconsumers at a night market in taiwan. the major methods assessed potential risk under different exposure scenarios based on bap equivalent concentration (bapeq) and incremental lifetime cancer risk (ilcr) models. we performed experimental sampling at a night market from 27 october through 22 november 20...

Journal: :bulletin of the iranian mathematical society 0
n. mahdavi-amiri faculty of‎ ‎mathematical sciences‎, ‎sharif‎ ‎university of technology‎, ‎tehran‎, ‎iran. b. kheirfam azarbaijan shahid madani university, ‎tabriz‎, ‎iran.

we present an improved version of a full nesterov-todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (bull. iranian math. soc.,40(3), 541-564, (2014)). in the earlier version, each iteration consistedof one so-called feasibility step and a few -at most three -centering steps. here, each iteration consists of only a feasibilitystep. thus, the new alg...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ارومیه 1377

the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...

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

the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...

Journal: :iranian journal of parasitology 0
elahe ebrahimzade department of parasitology, iranian center for ticks and tick-borne diseases, faculty of veterinary medicine, university of tehran, tehran, iran. parviz shayan department of parasitology, iranian center for ticks and tick-borne diseases, faculty of veterinary medicine, university of tehran, tehran, iran. zeinab asghari department of parasitology, iranian center for ticks and tick-borne diseases, faculty of veterinary medicine, university of tehran, tehran, iran. sedighe jafari department of parasitology, iranian center for ticks and tick-borne diseases, faculty of veterinary medicine, university of tehran, tehran, iran. zahra omidian department of parasitology, iranian center for ticks and tick-borne diseases, faculty of veterinary medicine, university of tehran, tehran, iran.

background: cryptosporidium parvum causes severe gastroenteritis in immunocompromised human and new borne animals. the organism can be transmitted through water. since small number of c. parvum is infectious, the aim of the present study was to develop a chromatography method for the isolation of c. parvum oocyst in samples with limited number of oocysts. methods: antibody was prepared against ...

1997
A N Gorban I V Karlin

When a wave function is represented as a linear combination over an overfull set of elementary states, an ambiguity arises since such a representation is not unique. We introduce a variational principle which eliminates this ambiguity, and results in an expansion which provides the best" representation to a given Schrr odinger operator. Operational simplicity of an expansion of a wave function ...

1998
Alan R. Washburn

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch and Bound methods, with emphasis on the tradeoff between the accuracy of the bound employed and t...

1997
Michael Perregaard Jens Clausen

Job-Shop Scheduling (JSS) problems are among the more diicult to solve in the class of NP-complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem , but with limited success. Even with recent methods, it is still not possible to so...

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

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