Rapid in vitro multiplication of shoots has been described using capitular sections and leaf explants in Gerbera jamesonii. Three types of basal media regimes were used including MS and two of its modified forms⎯MSI and MSA. Shoot induction was achieved on all three regimes but MSI medium supplemented with Kn (4 mg/l) and IAA (0.5 mg/l) was ideal for shoot bud initiation (8-11) from capitular s...

We characterize the multiplication table of an algebra with a multiplicative unity and derive properties of multiplication tables and associated quadratic forms, which allow eecient computation. We compare several ways of computing a multiplication table and associated quadratic forms. By index permutation the complexity of the computation time of associated quadratic forms can be reduced. Expl...

The t-class semigroup of an integral domain is the semigroup of the isomorphy classes of the t-ideals with the operation induced by ideal tmultiplication. This paper investigates ring-theoretic properties of an integral domain that reflect reciprocally in the Clifford or Boolean property of its t-class semigroup. Contexts (including Lipman and Sally-Vasconcelos stability) that suit best t-multi...

A general theory for constructing linear secret sharing schemes over a finite field Fq from toric varieties is introduced. The number of players can be as large as (q − 1)r − 1 for r ≥ 1. We present general methods to obtain the reconstruction and privacy thresholds as well as conditions for multiplication on the associated secret sharing schemes. In particular we apply the method on certain to...

Previous theoretical investigations of the three-dimensional (3-D) angular vestibuloocular reflex (VOR) have separately modeled realistic coordinate transformations in the direct velocity path or the nontrivial problems of converting angular velocity into a 3-D orientation command. We investigated the physiological and behavioral implications of combining both approaches. An ideal VOR was simul...

Let C(A) denote the multiplicative complexity of a finite dimensional associative k-algebra A. For algebras A with nonzero radical radA, we exhibit several lower bound techniques for C(A) that yield bounds significantly above the Alder–Strassen bound. In particular, we prove that the multiplicative complexity of the multiplication in the algebras k[X1; : : : ; Xn]= Id+1 (X1; : : : ; Xn) is boun...

In this thesis, we study the software implementation of the NIST-recommended elliptic curves over prime fields. Our implementation goals are to achieve a fast, small, and portable cryptographic library, which supports elliptic curve digital signature generation and verification. The implementation results are presented on a Pentium I1 448.81 MHz. We also consider the sliding window algorithm (S...

Given a stable semistar operation of finite type ⋆ on an integral domain D, we show that it is possible to define in a canonical way a stable semistar operation of finite type [⋆] on the polynomial ring D[X], such that D is a ⋆-quasi-Prüfer domain if and only if each upper to zero in D[X] is a quasi-[⋆]-maximal ideal. This result completes the investigation initiated by Houston-Malik-Mott [18, ...

In many applications, such as inverse dithering, it is necessary to increase the pixel bit-depth of images by expanding q -bit integer values to m -bit integer values ( q m > ). This paper describes a simple and efficient method that uses bit replication, instead of conventional multiplication, to achieve this expansion. First, we show that the optimal number of repetitions is given by } / { ce...

Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered rather than totally ordered. A term t using the bi-Kleene operations 0, 1,+, · , , ‖,(∗) defines a set [[t]] of pomsets in a natural way. We prove that every valid universal equality over pomset languages using these operations is a con...