نتایج جستجو برای: predictive maps derived from maximum entropy and multi
تعداد نتایج: 17748891 فیلتر نتایج به سال:
this study attempts to investigate the effect of peers’ revision in comparison to that of the teacher, and whether peers’ comments and teachers’ comments facilitate students’ revision? if yes, which one is more effective? also attempts have been made to see which aspects of language are more highlighted by peers versus teachers when commenting. besides, it is investigating the student’s attitud...
the present study is paid to the evaluation of the welfare program of the unemployment insurance in iran. the main purpose which was the main reason for performing this thesis, was the unemployment insurance plan’s challenges in iran such as financial problems of this plan, prolongation of the credit receipt for some insured people, unemployment slow exiting from the unemployment insurance fund...
in this paper, we consider the determination methods of maximum entropy multivariate distributions with given prior under the constraints, that the marginal distributions or the marginals and covariance matrix are prescribed. next, some numerical solutions are considered for the cases of unavailable closed form of solutions. finally, these methods are illustrated via some numerical examples.
Bayesian optimization is a sequential method that can optimize single and costly objective function based on surrogate model. In this work, we propose system dedicated to monitoring estimating multiple water quality parameters simultaneously using autonomous surface vehicle. The proposed work combines different strategies methods for task, evaluating two approaches acquisition fusion: the coupl...
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
This paper considers the problem and appropriateness of filling-in missing conditional probabilities in causal networks by the use of maximum entropy. Results generalizing earlier work of Rhodes, Garside & Holmes are proved straightforwardly by the direct application of principles satisfied by the maximum entropy inference process under the assumed uniqueness of the maximum entropy solution. It...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید