Sentence examples for s fold from inspiring English sources

def parseLine[A] (f: String ⇒ ValRes[A]) : String ⇒ ValIntState[A] = s ⇒ state(i ⇒ (i + 1, f(s) fold ( _ map ( "Line %d: %s" format (i, _) ) fail, _.success ))).success

We could then test our parser directly from the console by using the following function: def smilesShow (s: String): String = smiles(s) fold ( _.list mkString " n", _.shows ).shows

Astrocyte genes upregulated in W + SD vs S (fold change >30%%, P  < 0.01).

"I certainly don't feel like we've won, the game is over, let's fold up shop.

We make amazing two-dimensional chips, let's fold them up!

In what follows, we consider the density of 1's in the s-fold CBIJM [ J ] p s.

This factorization algorithm is valid for the generalized s-fold CBIJM of order p s over finite field with a suitable matrix unit α of size p×p.

Fortunately, it will be shown that the s-fold block Jacket matrix [ J ] 2 s ≜ α ⊗ s is also a CBIJM.

For any prime number p and non-negative integer number s, let [ J ] p s = [ J ] p ⊗ s be an s-fold block matrix, i.e., [ J ] p s = [ J ] p ⊗ ⋯ [ J ] p ⏟ s. (25).

Consequently, the s-fold CBIJM [ J ] p s of order p s can be generated from the following factorization algorithm [ J ] p s = [ J ] p s − 1 ⊗ [ J ] p = ∏ i = 1 s I p s − i ⊗ [ J ] p ⊗ I p i − 1 (33).

We note that this phenomena exists in the generalized s-fold CBIJM [ J ] p s of order p s for any prime number p. Actually, the two-fold CBIJM [ J ] 2 2 in (26) based on the factorization algorithm can be rewritten as [ J ] 2 2 = [ J ] 2 ⊗ [ J ] 2 = I 2 ⊗ [ J ] 2 [ J ] 2 ⊗ I 2. (30).