NROM: A novel localized trapping, 2-bit nonvolatile memory cell

This paper presents a novel flash memory cell based on localized charge trapping in a dielectric layer and on a new read operation. It is based on the storage of a nominal ~400 electrons above a n⁺/p junction. Programming is performed by channel hot electron injection and erase by tunneling enhanced hot hole injection. The new read methodology is very sensitive to the location of trapped charge above the source. This single device cell has a two physical bit storage capability. The cell shows improved erase performances, no over erase and erratic bit issues, very good retention at 250°C, and endurance up to 1M cycles. Only four masks are added to a standard CMOS process to implement a virtual ground array. In a typical 0.35 μm process, the area of a bit is 0.315 μm² and 0.188 μm² in 0.25 μm technology. All these features and the small cell size compared to any other flash cell make this device a very attractive solution for all NVM applications     

Construction of Approximate Entropy Measure-Valued Solutions for Hyperbolic Systems of Conservation Laws

Entropy solutions have been widely accepted as the suitable solution framework for systems of conservation laws in several space dimensions. However, recent results in De Lellis and Székelyhidi Jr (Ann Math 170(3):1417–1436, 2009) and Chiodaroli et al. (2013) have demonstrated that entropy solutions may not be unique. In this paper, we present numerical evidence that state-of-the-art numerical schemes need not converge to an entropy solution of systems of conservation laws as the mesh is refined. Combining these two facts, we argue that entropy solutions may not be suitable as a solution framework for systems of conservation laws, particularly in several space dimensions. We advocate entropy measure-valued solutions, first proposed by DiPerna, as the appropriate solution paradigm for systems of conservation laws. To this end, we present a detailed numerical procedure which constructs stable approximations to entropy measure-valued solutions, and provide sufficient conditions that guarantee that these approximations converge to an entropy measure-valued solution as the mesh is refined, thus providing a viable numerical framework for systems of conservation laws in several space dimensions. A large number of numerical experiments that illustrate the proposed paradigm are presented and are utilized to examine several interesting properties of the computed entropy measure-valued solutions.     

Local-mode approach to modeling multidimensional infrared spectra of metal carbonyls

We present a general approach for modeling multidimensional infrared spectra based on a combination of phenomenological fitting and ab initio electronic structure calculations. The vibrational Hamiltonian is written in terms of bilinearly coupled Morse oscillators that represent local carbonyl stretches. This should be contrasted with the previous approach, where the anharmonic Hamiltonian was given in terms of normal-mode coordinates ( Baiz et al. J. Phys. Chem. A 2009 , 113 , 9617 ). The bilinearly coupled Morse oscillator Hamiltonian is parametrized such that the frequencies and couplings are consistent with experiment, and the anharmonicities are computed by density functional theory. The advantages of the local-mode versus normal-mode approaches are discussed, as well as the ability of different density functionals to provide accurate estimates of the model parameters. The applicability and usefulness of the new approach are demonstrated in the context of the recently measured multidimensional infrared spectra of dimanganese decacarbonyl. The shifts in local site frequencies, couplings, and anharmonicities due to hydrogen bonding to the individual carbonyls are explored. It is found that, even though the effect of hydrogen bonding is nonlocal, it is additive.     

On the physical mechanism of the NROM memory erase

The purpose of this paper is to investigate the physical mechanism of NROM memory erase. Three conduction mechanisms potentially responsible of NROM erase will be analyzed (tunneling and emission of electrons through both bottom and top oxide, tunneling and injection of holes over the bottom oxide barrier) by means of standard two-dimensional simulations and ad-hoc models reproducing hole and electron transport mechanisms across the oxide not included in standard device simulators. Hot-hole injection will be identified as the actual conduction mechanism of NROM erase, and two compact models capable to describe the main characteristics of NROM erase current will be developed.     

On ACK filtering on a slow reverse channel

Acknowledgement (ACK) filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection. Old ACKs waiting at the input of the slow channel are erased when new ACKs are to be queued. In the literature the case of one‐ACK per connection at a time has been studied. In this paper we show that this is too aggressive for short transfers where ACKs arrive in bursts due to the slow start phase, and where the TCP source needs to receive the maximum number of ACKs to increase fast its window. We study first static filtering where a certain ACK queue length is allowed. We show analytically how this length needs to be chosen. We present then some algorithms that adapt the filtering of ACKs as a function of the slow channel utilization rather than the ACK queue length. These algorithms provide a good compromise between reducing the ACK queueing delay and passing a large number of ACKs that guarantee a fast window increase. Copyright © 2003 John Wiley & Sons, Ltd.     

Probabilistic analysis of geometric location problems

We analyze the behaviour of thek center and median problems forn points randomly distributed in an arbitrary regionA ofR ^d . Under a mild assumption on the regionA, we show that fork≦k(n)=o(n/logn), the objective function values of the discrete and continuous versions of these problems are equal to each otheralmost surely. For the two-dimensional case, both these problems can be solved by placing the centers or medians in an especially simple regular hexagonal pattern (the ‘honeycomb heuristic’ of Papadimitriou). This yields the exact asymptotic values for thek center and median problem, namely, α(|A|/k)^1/2 and β(|A|/k)^1/2, where |A| denotes the volume ofA, α and β are known constants, and the objective of the median problem is given in terms of the average, rather than the usual total, distance. For the 3- and 4-dimensional case, similar results can be obtained for the center problem to within an accuracy of roughly one percent. As a by-product, we also get asymptotically optimal algorithms for the 2-dimensionalp-normk median problem and for the twin problems of minimizing the maximum number of vertices served by any center and similarly for maximizing the minimum.     

Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem

The dynamic programming algorithm of [12.] for the bandwidth minimization problem is improved. It is shown that, for all k > 1, BANDWIDTH(k) can be solved in O(n^k) steps and simultaneous O(n^k) space, where n is the number of vertices in the graph, and that each such problem is in NSPACE(log n). The same improved dynamic programming algorithm approach works to show that the MINCUT LINEAR ARRANGEMENT problem restricted to the fixed value k, denoted by MINCUT(k), is solvable in O(n^k) steps and simultaneous O(n^k) space and is in the class NSPACE(log n).     

Numerical radius of positive matrices

We study some properties of the numerical radius of matrices with non-negative entries, and explicit ways to compute it. We also characterize positive matrices with equal spectral and numerical radii, i.e., positive spectral matrices.     

A survey on discriminatory processor sharing

The Discriminatory Processor Sharing (DPS) model is a multi-class generalization of the egalitarian Processor Sharing model. In the DPS model all jobs present in the system are served simultaneously at rates controlled by a vector of weights {g_k > 0; k = 1,..., K }. If there are N_k jobs of class k present in the system, k = 1,..., K, each class-k job is served at rate . The present article provides an overview of the analytical results for the DPS model. In particular, we focus on response times and numbers of jobs in the system. This work is part of a French-Dutch Van Gogh research project funded by NWO (The Netherlands Organization for Scientific Research) and EGIDE under grant VGP 61-520. We also acknowledge the support of EuroNGI Network of Excellence. This work was done while U. Ayesta was an ERCIM Postdoc fellow at CWI.