We calculate theO(αs) andO(αWmt /M2 W ) corrections to the production of a single top quark via the weak process qq̄ → tb̄ at the Fermilab Tevatron and the CERN Large Hadron Collider. An accurate calculation of the cross section is necessary in order to extract |Vtb| from experiment.

Ai Nagae, Megumi Fujita, Hiroo Kawarazaki, Hiromitsu Matsui, Katsuyuki Ando and Toshiro in Obesity-Induced Hypertension Sympathoexcitation by Oxidative Stress in the Brain Mediates Arterial Pressure Elevation Print ISSN: 0009-7322. Online ISSN: 1524-4539 Copyright © 2009 American Heart Association, Inc. All rights reserved. is published by the American Heart Association, 7272 Greenville Avenue,...

We introduce a new approach for the study of weight distributions of cosets of the Reed–Muller code of order 1. Our approach is based on the method introduced by Kasami in [1], using Pless identities. By interpreting some equations, we obtain a necessary condition for a coset to have a “high” minimum weight. Most notably, we are able to distinguish such cosets which have three weights only. We ...

We derive new bounds on the periodic (cyclic) total squared correlation (PTSC) of binary antipodal signature sets for any number of signatures K and any signature length L. Optimal designs that achieve the new bounds are then developed for several (K,L) cases. As an example, it is seen that complete (K = L + 2) Gold sets are PTSC optimal, but not, necessarily, Gold subsets of K < L + 2 signatur...

We prove a necessary condition for some polynomials of Gold and Kasami degree to be APN over Fqn for large n.

A family of binary sequences is presented and proved to have optimal correlation property and large linear span. It includes the small set of Kasami sequences, No sequence set and TN sequence set as special cases. An explicit lower bound expression on the linear span of sequences in the family is given. With suitable choices of parameters, it is proved that the family has exponentially larger l...

We suggest and discuss a formalization of Dynamic Programming. A methodological novelty consists in an explicit treatment (interpretation) of ascending Dynamic Programming as least fix-point computation (according to Knaster-Tarski fix-point theorem). This interpretation leads to a uniform approach to classical optimization problems as well as to problems where optimality is not explicit (Cocke...