A simple algorithm, which exploits the associativity of the BCH formula, and that can be generalized by iteration, extends the remarkable simplification of the BakerCampbell-Hausdorff (BCH) formula, recently derived by Van-Brunt and Visser. We show that if [X,Y ] = uX + vY + cI, [Y, Z] = wY + zZ + dI, and, consistently with the Jacobi identity, [X,Z] = mX + nY + pZ + eI, then exp(X) exp(Y ) exp...

Taurine is involved in various physiological processes, and one of the most abundant amino acids in human. The aim was to investigate the mechanism for intestinal absorption of taurine in vivo using also in vitro mechanistic studies. Taurine absorption was measured in male Sprague-Dawley rats at 10-997 mg/kg and 1-30 mg/kg for oral and intravenous administration, respectively. Oral absorption w...

Most normal cells express L-type amino acid transporter 2 (LAT2). However, L-type amino acid transporter 1 (LAT1) is highly expressed in many tumor cells and presumed to support their increased growth and proliferation. This study examined the effects of JPH203, a selective LAT1 inhibitor, on cell growth and its mechanism for cell death in Saos2 human osteosarcoma cells. FOB human osteoblastic ...

یکی از پارامترهای مهم محیط­های پخش نوترون، طول نوترون حرارتی است. روش مرسوم محاسباتی استفاده کد MCNP برمبنای توزیع شار در محیط و برازش تابع ریاضی مربوطه بر آن این پژوهش، روشی نوین که مبنای کارت PTRAC است، ارایه شده پارامتر برای آب­سبک اساس روش­های فوق محاسبه با مقادیر گزارش مراجع مقایسه گردیده تطابق خوبی نیز مشاهده حسن فوق، عدم نیاز به علاوه فرض می­شود تا محل چشمه، فاصله­ی کافی وجود دارد. مسأله...

Targeting on the future fault-prone hybrid CMOS/Nanodevice digital memories, this paper present two faulttolerance design approaches the integrally address the tolerance for defect and transient faults. These two approaches share several key features, including the use of a group of Bose-ChaudhuriHocquenghem (BCH) codes for both defect tolerance and transient fault tolerance, and integration of...

We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.

We extend the theory of generalized divisors so as to work on any scheme X satisfying the condition S2 of Serre. We define a generalized notion of Gorenstein biliaison for schemes in projective space. With this we give a new proof of the theorem of Gaeta, that standard determinantal schemes are in the Gorenstein biliaison class of a complete intersection.