An unstructured mesh finite volume method for modelling saltwater intrusion into coastal aquifers

In this paper, a two-dimensional finite volume unstructured mesh method (FVUM) based on a triangular background interpolation mesh is developed for analysing the evolution of the saltwater intrusion into single and multiple coastal aquifer systems. The model formulation consists of a ground-water flow equation and a salt transport equation. These coupled and non-linear partial differential equations are transformed by FVUM into a system of differential/algebraic equations, which is solved using backward differentiation formulas of order one through five. Simulation results are compared with previously published solutions where good agreement is observed.     

Multicast routing and bandwidth dimensioning in overlay networks

Multicast services can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated features and can provide multicast services at places where no network layer support is available. Overlay multicast networks offer an intermediate option, potentially combining the flexibility and advanced features of application layer multicast with the greater efficiency of network layer multicast. In this paper, we introduce the multicast routing problem specific to the overlay network environment and the related capacity assignment problem for overlay network planning. Our main contributions are the design of several routing algorithms that optimize the end-to-end delay and the interface bandwidth usage at the multicast service nodes within the overlay network. The interface bandwidth is typically a key resource for an overlay network provider, and needs to be carefully managed in order to maximize the number of users that can be served. Through simulations, we evaluate the performance of these algorithms under various traffic conditions and on various network topologies. The results show that our approach is cost-effective and robust under traffic variations.     

4-bit adder-accumulator at 41-GHz clock frequency in InP DHBT technology

A 41-GHz 4-b adder-accumulator test circuit implemented in InP double heterojunction bipolar transistor (DHBT) technology using 624 transistors is reported. High clock rates are obtained by combining the logic functions into pipelined latches. The adder-accumulator contains a single-level parallel-gated carry circuit that is used as a step toward reduced power consumption. The carry circuit has a maximum clock frequency of 55 GHz. The accumulator architecture employs modular, pipelined 2-b adders and is cascadable to 2 N-bits. The test circuit includes a 4-b digital to analog converter (DAC) that facilitates demonstration of high-speed operation.     

移动视频点播比移动广播方式更有市场

在车站等车的时候你或许有几分钟的时间需要打发。这时，你拿起手机输入一串紧缩码，只几秒钟，便看到一段你想看的电影片花或是最近朋友们谈论的YouTube上的某个3min的视频剪辑。     

Krylov subspaces and the analytic grade

Typical behaviour of the solution of a linear system of equations obtained iteratively by Krylov methods can be characterized by three stages. Initially the residual diminishes steadily; this is followed by stagnation and finally rapid convergence near the algebraic grade. This study examines this behaviour in terms of the concepts of approximately invariant subspace and what we have called the analytic grade of a Krylov sequence. It is shown how the small Ritz values play a vital role in the convergence and how this knowledge helps in the construction of an effective preconditioner. Copyright © 2004 John Wiley & Sons, Ltd.     

On a zero equation model of turbulence

In this paper we study a widely used zero equation model of turbulence. The governing equations are derived by applying to the incompressible Navier-Stokes equations the Reynolds time averaging procedure. We achieve closure by employing the eddy viscosity concept. Using the Implicit Function Theorem we obtain an existence and uniquencess result. We also discuss the existence of nonsingular solutions. Finally, we present an algorithm for solving the modeled equations.