نتایج جستجو برای: and inform them
تعداد نتایج: 16835984 فیلتر نتایج به سال:
abstract the present study was conducted to investigate the effectiveness of a rather newly developed method in language teaching that is the use of paragraph reading task and whole reading task and their effects on improving efl learner’s speaking ability. to fulfill the purpose of the study, first 90 participants studying their course at sa eedi high school in tehran were chosen by means of ...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
abstract: research purpose: the purpose of this research is to identify academic databases assessment factors and criteria at law and political science majors. the necessity of this research is to distinguish academic databases assessment factors and criteria and to identify the most important ones and rank them in order to select an appropriate database according to students’ and faculty memb...
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communication networks. IEEE Trans. Inform. Theory, 33 (2) (1987), 224-232] proposed the notion of forwarding index and established the tight upper bound (n − 1)(n − 2) for a connected graph of order n. This note improves this bound in terms of order n and maximum degree ∆ to the tight upper bound (n−1)(n−2)...
Dr. rer. nat. Viktor Sabelfeld studierte von 1966 bis 1971 Mathematik und arbeitete dann bis 1996 an der Universität Nowosibirsk als Professor. Sein Forschungsgebiet liegt auf den äquivalenten Programmtransformationen. Seit November 1997 arbeitet er am IRF. Dr. rer. nat. Michaela Huhn studierte 1985-1992 Informatik in Erlangen und arbeitete bis 1997 an der Universität Hildesheim im Themengebiet...
Abstract—The maximal rate for non-square Complex Orthogonal Designs (CODs) with n transmit antennas is 1 2 + 1 n if n is even and 1 2 + 1 n+1 if n is odd, which are close to 1 2 for large values of n. A class of maximal rate non-square CODs have been constructed by Liang (IEEE Trans. Inform. Theory, 2003) and Lu et. al. (IEEE Trans. Inform. Theory, 2005) have shown that the decoding delay of th...
Let w 1 = d, w 2 , ... , w s be the weights of the nonzero codewords in a binary linear [n , k, d] code C, and let w1′ , w2′ , ... , ws ′ ′ be the nonzero weights in the dual code C ⊥ . Let t be an integer in the range 0 < t < d such that there are at most d − t weights wi′ with 0 < wi′ ≤ n − t. Assmus and Mattson proved that the words of any weight w i in C form a t-design. We show that if w 2...
Bisection search is the most efficient algorithm for locating a unique point X∗ ∈ [0, 1] when we are able to query an oracle only about whether X∗ lies to the left or right of a point x of our choosing. We study a noisy version of this classic problem, where the oracle’s response is correct only with probability p. The probabilistic bisection algorithm (PBA) introduced by Horstein [IEEE Trans. ...
functions,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 525-531, IT-25, no. 1, pp. 80-82, Jan. 1979. 1969. [ 131 A. Crolotte, “Memory versus error tradeoffs in question-answering [ 121 A. Crolotte and J. Pearl, “Asymptotic rate-distortion functions for systems,” Ph.D. dissertation, Univ. California, Los Angeles, coding precedence relations,” IEEE Trans. Inform. Theoy, vol. UCLA-ENG-7753, July 1...
Cognitive gameplay—the cognitive dimension of a player’s experience—emerges from the interaction between a player and a game. While its design requires careful consideration, cognitive gameplay can be designed only indirectly via the design of game components. In this paper, we focus on one such component—the core mechanic—which binds a player and game together through the performance of essent...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید