Results 1 - 10 of 187

Table 1: A summary of the signs ( ) of various quantities associated with twist and helicity, and the handedness (R or L) of helical eld lines. The signs re ect the Coriolis e ect on turbulence in the bulk of the CZ; rising, expanding material will develop retrograde rotation, while sinking, contracting material will develop prograde rotation. Some theoretical studies indicate that several of these signs are reversed in a layer near the bottom of the CZ. None of the signs is expected to change with solar cycle.

in Flux tube twist resulting from helical turbulence: The Σ-Effect
by D. W. Longcope, G. H. Fisher, A.A. Pevtsov

Table 4. Final confusion matrix for SVM classifier with C = classical, E = electronic, R = rock, J/B = jazz and blues, and A = ambient

in A study on music genre classification based on universal acoustic models
by Jeremy Reed 2006
"... In PAGE 5: ... SV Classical versus Electronica 488 Classical versus Rock 478 Classical versus Jazz 550 Classical versus Ambient 677 Electronica versus Rock 672 Electronica versus Jazz 558 Electronica versus Ambient 716 Rock verus Jazz 561 Rock versus Ambient 574 Jazz versus Ambient 641 4.3 Genre Confusion The final confusion matrix is displayed in Table4 for the SVM maximum vote classifier, where the rows represent the ground truth as labeled in the metadata from Magnatunes and the columns represent how the algorithm classified the test songs. Recall and precision rates are shown as defined in Section 3.... ..."
Cited by 1

Table 3: Approximate Asymptotic Bias J B-spl Freq Cnt Kern

in Effective Nonparametric Estimation in the Case of Severely Discretized Data
by Mark Coppejans
"... In PAGE 22: ... To check the validity of this, we ran the above examples once on a sample size of 1,000,000 for the cases of J = 10; 22. Given that the relative variance is small with such a large sample, we call the associated l2 estimates the approximate asymptotic bias, and they are provided in Table3 . In each case, the weighted B-spline clearly outperforms the frequency estimators.... ..."

Table 4.1: RIT for A[i; j] = F(A[i; j]; B[i; j]; B[i?1; j?1]; B[i?2; j?2]; B[i?2; j+2])

in AUTOMATIC DATA AND COMPUTATION MAPPINGFOR DISTRIBUTED MEMORY MACHINES
by unknown authors 1996

Table 8 The computation rule of P-Prolog A0 g j B, let try(A; C) be de ned by

in From Concurrent Logic Programming to Concurrent Constraint Programming
by Frank S. de Boer, Catuscia Palamidessi 1993
Cited by 11

Table 2. Values of i;j;b for i = 1 and varying j. ji= 1, b = 1 i = 1, b = 2

in An Application of Yield Management for Internet Service Providers
by Suresh K. Nair, Ravi Bapna 1997
Cited by 1

Table 2 The arrays for j e S1(x; y)j and j b S1(x; y)j.

in Schröder Paths and Zebra Parallelogram Polyominoes
by Robert A. Sulanke

Table 3.1: D(lambda): Operational Semantics and Type Inference De nition Proof idea: Use the natL rule with the induction hypothesis j:8k:[nat k k lt; j B k]. 2 Thus the following is a derived inference rule of our meta-logic: nat j; 8k:[nat k k lt; j B k] ?! B j B I; ? ?! C nat I; ? ?! C

in Proving Meta-Theorems in a Logical Framework
by Raymond Mcdowell, Val Tannen 1986
Cited by 1

Table 1. Operational semantics.

in An Algebra of Actors
by Mauro Gaspari, Gianluigi Zavattaro, Mura Anteo Zamboni 1997
"... In PAGE 10: ... Thus, if we add a restriction on actor b, the action bv can not be observed and the term: B0 = (aForward j bDouble)nb can be considered equivalent to A. Note that we abstract away from details of internal communication: the synchronization of actor b, which receives a message from actor a, is an internal action labelled (rule Sinc in Table1 ) which is not observable (hence it does not have any effects on bisimulation). Example 3.... In PAGE 10: ... Consider the actor term A1 = aSums (where s is an integer), which receives messages represented as pairs (b; v), where the first argument is an actor name and the second argument is an integer, updates the state to s + v and sends b the integer s v. This behaviour is defined formally below: Sum def= send(1st(message); 2nd(message) + state); become(Sum; 2nd(message) + state) The evolution of the state is modelled by the rule Become in Table1 : a become operation updates the state of the actor, but the new state can be accessed only after the next receive operation. Suppose now that we want to compose this actor with the interface actor defined in the previous exam- ple: we define the actor term: B1 = aForward j bSums.... In PAGE 14: ...ranslation (rules 2.5, 3.5) a new channel for the restricted name is created. It is interesting to note that the creation of the channel by means of a create primitive ensures the creation of a new restricted name for it (see rule Create in Table1 ). Each process a(b):P starting with an input action is mapped into a new idle actor and a request message addressed to the channel a (rules 2.... ..."
Cited by 15

Table 1. Operational semantics.

in An Algebra of Actors
by Mauro Gaspari, Gianluigi Zavattaro, Mura Anteo Zamboni 1997
"... In PAGE 10: ... Thus, if we add a restriction on actor b, the action bv can not be observed and the term: B0 = (aForward j bDouble)nb can be considered equivalent to A. Note that we abstract away from details of internal communication: the synchronization of actor b, which receives a message from actor a, is an internal action labelled (rule Sinc in Table1 ) which is not observable (hence it does not have any effects on bisimulation). Example 3.... In PAGE 10: ... Consider the actor term A1 = aSums (where s is an integer), which receives messages represented as pairs (b; v), where the first argument is an actor name and the second argument is an integer, updates the state to s + v and sends b the integer s v. This behaviour is defined formally below: Sum def= send(1st(message); 2nd(message) + state); become(Sum; 2nd(message) + state) The evolution of the state is modelled by the rule Become in Table1 : a become operation updates the state of the actor, but the new state can be accessed only after the next receive operation. Suppose now that we want to compose this actor with the interface actor defined in the previous exam- ple: we define the actor term: B1 = aForward j bSums.... In PAGE 14: ...ranslation (rules 2.5, 3.5) a new channel for the restricted name is created. It is interesting to note that the creation of the channel by means of a create primitive ensures the creation of a new restricted name for it (see rule Create in Table1 ). Each process a(b):P starting with an input action is mapped into a new idle actor and a request message addressed to the channel a (rules 2.... ..."
Cited by 15
Results 1 - 10 of 187