نتایج جستجو برای: پرسشنامه enrich

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

Journal: : 2022

هدف: این پژوهش با هدف بررسی اثر آموزش برنامه هوش موفق استرنبرگ بر افزایش خلاقیت و تحمل ابهام دانش‌­آموزان انجام شد. روش: روش ­آزمایشی طرح پیش ­آزمون پس پیگیری گروه کنترل بود. جامعۀ آماری را 15842 نفر ازدانش‌­آموزان پسر کلاس چهارم در سال تحصیلی1399-1400 شهر اصفهان تشکیل دادند که30 نمونه‌­گیری تصادفی چند مرحله­‌ای انتخاب به صورت دو آزمایش (15 نفر) گمارده شدند. ده جلسه برنامه‌­ی دریافت نمود. داده­...

Journal: :IOP Conference Series: Earth and Environmental Science 2021

Journal: :Eastern-European Journal of Enterprise Technologies 2022

This paper reports a study addressing the issue of enriching pressed sugar in order to improve its biological value. As additives sugar, use derivative products processing wild berries Hippophaerhamnoides L., Viburnumopulus, Sambucusnigra, Sorbusaucuparia is suggested. The technology includes their preliminary freezing, partial dehydration by osmotic dehydration, and subsequent drying. resultin...

2015
Mehmet Ali Abdulhayoglu Bart Thijs

Introduction Today prominent and comprehensive databases such as Thomson Reuters’ Web of Science (WoS) or Elsevier’s Scopus are highly in use for bibliometric research. However, these databases do not index full texts hindering researchers to carry out more detailed analyses. Besides, it is possible that some indexed publications do not have DOI numbers playing an important role to access full ...

2016
Sreelekha S Pushpak Bhattacharyya

In this paper we present our work on the usage of lexical resources for the Machine Translation English and Malayalam. We describe a comparative performance between different Statistical Machine Translation (SMT) systems on top of phrase based SMT system as baseline. We explore different ways of utilizing lexical resources to improve the quality of English Malayalam statistical machine translat...

2007
Thomas Ristenpart Phillip Rogaway

Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E , E] that can encipher messages of l + s bits for any s < n. Enciphering such a string will take one call to E and two calls to E. We prove that E∗ is a strong pseudorandom permutation as long as E and E are. Our construction works even in the tweakable and VIL (varia...

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

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