نتایج جستجو برای: pre ordered group
تعداد نتایج: 1291386 فیلتر نتایج به سال:
the present study was conducted to investigate the effect of implicit focus on form through input flooding and the effect of noticing, explicit focus on form on linguistic accuracy. to fulfill the purpose of the study, 86 iranian pre-intermediate efl learners of one of the language institutes were chosen by means of administering ket as the homogeneity test. these learners were pretested throug...
language learning courseware has been receiving growing attention by english educators since its advent. a variety of softwares have been designed by software designers and resorted to by language educators to supplement language textbooks. this experimental study investigated how the application of computerized version of language textbooks and the reception of the entire course through comput...
We study self-homeomorphisms of zero dimensional metrizable compact Hausdorff spaces by means of the ordered first cohomology group, particularly in the light of the recent work of Giordano, Putnam, and Skau on minimal homeomorphisms. We show that flow equivalence of systems is analogous to Morita equivalence between algebras, and this is reflected in the ordered cohomology group. We show that ...
⎯This study addresses the problem of complete pre-ordered merchandise supply. We discuss the sale price and the supply period with the demand rate function of merchandise for customers and the ratio function of customers’ willingness to wait for taking merchandise, wherein the supply period and the sale price at any point of time during the complete stock-out period are decision variables. The ...
BACKGROUND AND OBJECTIVES The indiscriminate order for additional tests on pre-anesthetic evaluation is common in clinical practice, which entails additional costs and the possibility of false-positive results. The aim of this study was to analyze whether preoperative tests in elective surgeries are ordered according to clinical criteria and assess the unnecessary costs for the institution. M...
Algorithms are presented for the all-pairs min-cut problem in bounded treewidth, planar, and sparse networks. The approach used is to preprocess the input n-vertex network so that afterward, the value of a min-cut between any two vertices can be efficiently computed. A tradeoff is shown between the preprocessing time and the time taken to compute min-cuts subsequently. In particular, after an Ž...
5 Goguen’s category of V-sets whose objects are functions with values in a pre-ordered set and morphisms are suitable maps is shown to be a topological construct if and only if the pre-ordered set is a complete lattice; in particular the category Set(L) of L-sets, 7 also considered by Goguen, is topological over Set. The special case when the considered pre-ordered set is L with the “mapping to...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید