نتایج جستجو برای: control options

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور مرکز - دانشکده زبانهای خارجی 1391

the primary goal of the current project was to examine the effect of three different treatments, namely, models with explicit instruction, models with implicit instruction, and models alone on differences between the three groups of subjects in the use of the elements of argument structures in terms of toulmins (2003) model (i.e., claim, data, counterargument claim, counterargument data, rebutt...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیخ بهایی - دانشکده زبانهای خارجی 1392

critical thinking ability has an important role in education. accordingly, scholars around the world are searching for new ways for teaching and improving students critical thinking ability. in line with the studies in efl contexts supporting the positive relationship between critical thinking and writing performances, this study investigated the differential effects of halverson’s critical thi...

2001
Murray Crease

Behaviour Widget State of current widget In Outside system: User input to widget Out Feedback Manager: Abstract, media independent feedback requests Feedback Manager Widget Media used by widget In Abstract Behaviour: Abstract, media independent feedback requests Control System: Commands regarding output media Out Module Mapper(s): Abstract, media specific feedback requests Module Mapper Widget ...

Journal: :Finance and Stochastics 2003
John B. Walsh

We study the detailed convergence of the binomial tree scheme. It is known that the scheme is first order. We find the exact constants, and show it is possible to modify Richardson extrapolation to get a method of order three-halves. We see that the delta, used in hedging, converges at the same rate. We analyze this by first embedding the tree scheme in the Black-Scholes diffusion model by mean...

Journal: :CoRR 2017
Hong Chang Meng Ji Xueliang Li Jingshu Zhang

An edge-colored graph G is conflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are required in order to make G conflict-free connected. A coloring of vertices of a hypergraph H = (...

1996
Bernhard Schölkopf Christopher J. C. Burges Vladimir Vapnik

Developed only recently, support vector learning machines achieve high generalization ability by minimizing a bound on the expected test error; however, so far there existed no way of adding knowledge about invariances of a classiication problem at hand. We present a method of incorporating prior knowledge about transformation invari-ances by applying transformations to support vectors, the tra...

2012
Luiz Eduardo Teixeira Brandão

In this paper we propose a Symmetrical Binomial Lattice Approach that is equivalent to the well‐known and widely utilized Lattice of Cox, Ross & Rubinstein (1979) when modeling Geometric Brownian Motion type of processes, but can be utilized for a wide variety of other Markov style stochastic processes. This is due to the highly intuitive construction in which first the expecte...

2015
Gilbert Fridgen Lukas Häfner Christian König Thomas Sachs

As the transition to renewable energy sources progresses, their integration makes electricity production increasingly fluctuating, also causing amplified volatility in electricity prices on energy markets. To contribute to power grid stability, utilities need to balance volatile supply through shifting demand. This measure of demand side management creates flexibility, being enabled as the inte...

2005
Akimichi TAKEMURA Taiji SUZUKI Akimichi Takemura

In this expository paper we illustrate the generality of game theoretic probability protocols of Shafer and Vovk (2001) in finite-horizon discrete games. By restricting ourselves to finite-horizon discrete games, we can explicitly describe how discrete distributions with finite support and the discrete pricing formulas, such as the Cox-Ross-Rubinstein formula, are naturally derived from game-th...

2006
Peter Sanders Jesper Larsson Träff

We describe and experimentally compare three theoretically well-known algorithms for the parallel prefix (or scan, in MPI terms) operation, and give a presumably novel, doubly-pipelined implementation of the in-order binary tree parallel prefix algorithm. Bidirectional interconnects can benefit from this implementation. We present results from a 32 node AMD Cluster with Myrinet 2000 and a 72-no...

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

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