Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

Effects of annealing conditions on the electrical properties of Bi4-xNdxTi3O12 (x = 0.46) thin films processed at low temperature

Neodymium-substituted Bi₄Ti₃O₁₂ (BNdT) thin films were prepared by a chemical solution deposition technique on platinum- coated silicon substrates. All of the samples were annealed at the relatively low temperature of 600 °C by a rapid thermal annealing process in different atmospheres, such as O₂, air, and nitrogen, and vacuum. Irrespective of different annealing atmospheres, all of the BNdT thin films exhibit good ferroelectric properties, such as a saturated hysteresis loop, good fatigue endurance, and low leakage current density. A large remanent polarization (P_r) of ∼48 μC/cm² with an electric field of 240 kV/cm was observed from the BNdT thin film annealed in O₂ atmosphere. The BNdT thin films annealed in nitrogen and vacuum, at reduced oxygen partial pressures, exhibit smaller P_r than that annealed in oxygen. The difference of P_r of the BNdT thin films annealed in different atmospheres may originate from differences in the grain sizes and the number of oxygen vacancies. PACS 77.55.+f; 77.80.-e; 77.80.Fm; 81.15.-z     

Some formulae for the q-Bernoulli and Euler polynomials of higher order

The purpose of this paper is to give a proof of Kummer type congruence for the q-Bernoulli numbers of higher order, which is an answer to a part of the problem in a previous publication (see Indian J. Pure Appl. Math. 32 (2001) 1565-1570).     

Asymmetric synthesis of homo-apioneplanocin A from d-ribose

Homo-apioneplanocin A was efficiently synthesized via stereoselective hydroxymethylation, regio- and chemoselective hydroboration, and chemoselective oxidation as key steps from d-ribose.     

Novel route to 5-position vinyl derivatives of thiolactomycin: Olefination vs. deformylation

Vinyl and diene derivatives of thiolactomycin have been prepared via Horner-Wadsworth-Emmons olefination from protected 5-formyl-3,5-dimethylthiotetronic acid. Several 4-position protecting groups and a variety of phosphonates were evaluated, with MOM protection and β-ketophosphonates yielding the highest ratio of the desired product to deformylated product.     

Calibrating software reliability models when the test environment does not match the user environment

Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.     

Fuzzy convex sets in median algebras

The fuzzification of convex sets in median algebras is considered, and some of their properties are investigated. A characterization of finite valued fuzzy convex set is given.     

Active long pulse shaping technique of pulsed CO2 laser using multi-pulse discharge control

We describe the pulse forming of pulsed CO₂ laser using multi-pulse superposition technique. Various pulse shapes, high duty cycle pulse forming network (PFN) are constructed by time sequence. This study shows a technology that makes it possible to make various long pulse shapes by activating SCRs of three PFN modules consecutively at a desirable delay time with the aid of a PIC one-chip microprocessor. The power supply for this experiment consists of three PFN modules. Each PFN module uses a capacitor, a pulse forming inductor, a SCR, a high voltage pulse transformer, and a bridge rectifier on each transformer secondary. The PFN modules operate at low voltage by driving the primary of HV pulse transformer. The secondary of the transformer has a full-wave rectifier, which passes the pulse energy to the load in a continuous sequence.We investigated various long pulse shapes as different trigger time intervals of SCRs among three PFN modules. As a result, we could obtain laser beam with various pulse shapes and durations from about 250 to 1000 μs.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.