Simplified 0.35-μm flash EEPROM process using high-temperatureoxide (HTO) deposited by LPCVD as interpoly dielectrics and peripheraltransistors gate oxide

A simplified flash EEPROM process was developed using high-temperature LPCVD oxide both as flash cells interpoly dielectrics and as peripheral transistors gate oxide (decoding logic). An O₂ anneal at 850°C lowers charge trapping and interface trap density induced by Fowler-Nordheim injection. However, electron trapping remains slightly higher than with dry thermal oxide. Similar memory charge loss and write-erase endurance are obtained as for ONO-insulated cells. HTO thus proves to have the required quality and reliability to be used in flash EEPROMs     

Prospects for new physics observations in diffractive processes at the LHC and Tevatron

We study the double-diffractive production of various heavy systems (e.g. Higgs, dijet, and SUSY particles) at LHC and Tevatron collider energies. In each case we compute the probability that the rapidity gaps, which occur on either side of the produced system, survive the effects of soft rescattering and QCD bremsstrahlung effects. We calculate both the luminosity for different production mechanisms, and a wide variety of subprocess cross sections. The results allow numerical predictions to be readily made for the cross sections of all these processes at the LHC and the Tevatron collider. For example, we predict that the cross section for the exclusive double-diffractive production of a 120 GeV Higgs boson at the LHC is about 3 fb, and that the QCD background in the decay mode is about 4 times smaller than the Higgs signal if the experimental missing-mass resolution is 1 GeV. For completeness we also discuss production via or WW fusion. Received: 7 November 2001 / Revised version: 11 December 2001 / Published online: 25 January 2002     

The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.     

Spline prewavelets for non-uniform knots

Summary In this paper, we develop a framework suitable for performing a multiresolution analysis using univariate spline spaces of arbitrary degree and with non-uniform knot-sequences. To this end, we show, among other things, the existence of compactly supported prewavelets and of prewavelets that are globally supported, but decay exponentially. In each case we obtain a decomposition of a fine spline space as a sum of a coarse spline space plus a spline space spanned by prewavelets.     

Spline collocation for strongly elliptic equations on the torus

Summary We prove convergence and error estimates in Sobolev spaces for the collocation method with tensor product splines for strongly elliptic pseudodifferential equations on the torus. Examples of applications include elliptic partial differential equations with periodic boundary conditions but also the classical boundary integral operators of potential theory on torus-shaped domains in three or more dimensions. For odd-degree splines, we prove convergence of nodal collocation for any strongly elliptic operator. For even-degree splines and midpoint collocation, we find an additional condition for the convergence which is satisfied for the classical boundary integral operators. Our analysis is a generalization to higher dimensions of the corresponding analysis of Arnold and Wendland [4].     

利用FPGA快速开展新一轮设计

设计工程师面临的挑战 在今天的市场上，产品迅速上市的压力愈来愈大，但产品的使用寿命却不断缩短。产品设计稳定于12-18个月的周期不再存在，取而代之的是产品每6个月便会更新。缩短的使用寿命给OEM厂商带来更大的压力，需要更迅速及高效地把新设计推向市场。有研究指出，产品的推出若延迟4周，便会失去约14％的市场份额。     

A generic view of Dantzig-Wolfe decomposition in mixed integer programming

The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques.