Maximum likelihood estimate for discontinuous parameter in stochastic hyperbolic systems

The purpose of this paper is to study the identification problem of a spatially varying discontinuous parameter in stochastic hyperbolic equations. In previous works, the consistency property of the maximum likelihood estimate (MLE) was explored and the generating algorithm for MLE proposed under the condition that an unknown parameter is in a sufficiently regular space with respect to spatial variables.In order to show the consistency property of the MLE for a discontinuous coefficient, we use the method of sieves, i.e. the admissible class of unknown parameters is projected into a finite-dimensional space. For hyperbolic systems, we cannot obtain a regularity property of the solution with respect to a parameter. So in this paper, the parabolic regularization technique is used. The convergence of the derived finite-dimensional MLE to the infinite-dimensional MLE is justified under some conditions.     

Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

Optical packet switching in core networks: between vision andreality

The research on optical packet switching (OPS) has witnessed considerable progress in the 1990s. We examine the future potential of OPS in the core network by discussing this switching approach and the current status of a number of its enabling technologies. Many of these technologies are still in the stage of research and experimentation. We see that optical packet switching may be deployed in the long-term future subject to satisfaction of three main conditions/developments. First, additional technological developments have to take place to overcome remaining implementation challenges while making OPS cost-effective to deploy. Second, a rational migration scenario of the network toward gradual deployment of packet-based optical switching approaches should exist. Finally, carriers have to become more interested in packet-based optical switching solutions     

A 17-GHz Push–Push VCO Based on Output Extraction From a Capacitive Common Node in GaInP/GaAs HBT Technology

This paper presents a new push-push voltage-controlled oscillator (VCO) technique that extracts a second harmonic output signal from a capacitive common node in a negative-g_m oscillator topology. The generation of the second harmonics is accounted for by the nonlinear current-voltage characteristic of the emitter-base junction diode causing: 1) significant voltage clipping and 2) different rise and fall times during the switching operation of the core transistors. Comparative investigations show the technique is more power efficient in the high-frequency region than a conventional push-push technique using an emitter common node. A prototype 17-GHz VCO realized in GaInP/GaAs HBT technology produces an output power of -6dBm and a phase noise of -110.4dBc/Hz at 1-MHz offset, which is equivalent to a VCO figure-of-merit of -184.3dBc/Hz, while drawing 4.38 mA from a 3.0-V supply     

Analysis of adaptive bandwidth allocation in wireless networks with multilevel degradable quality of service

A wireless/mobile network supporting multilevel quality of service (QoS) is considered. In such a network, users or applications can tolerate a certain degree of QoS degradation. Bandwidth allocation to users can, therefore, be adjusted dynamically according to the underlying network condition so as to increase bandwidth utilization and service provider's revenue. However, arbitrary QoS degradation may be unsatisfactory or unacceptable to the users, hence resulting in their subsequent defection. Instead of only focusing on bandwidth utilization or blocking/dropping probability, two new user-perceived QoS metrics, degradation ratio and upgrade/degrade frequency, are proposed. A Markov model is then provided to derive these QoS metrics. Using this model, we evaluate the effects of adaptive bandwidth allocation on user-perceived QoS and show the existence of trade offs between system performance and user-perceived QoS. We also show how to exploit adaptive bandwidth allocation to increase system utilization (for the system administrator) with controlled QoS degradation (for the users). By considering various mobility patterns, the simulation results are shown to match our analytical results, demonstrating the applicability of our analytical model to more general cases.     

Computational Implementation of Asymmetric Integral Imaging by Use of Two Crossed Lenticular Sheets

We propose an asymmetric integral imaging method to adjust the resolution and depth of a three‐dimensional image. Our method is obtained by use of two lenticular sheets with different pitches fabricated under the same F/#. The asymmetric integral imaging is the generalized version of integral imaging, including both conventional integral imaging and one‐dimensional integral imaging. We present experimental results to test and verify the performance of our method computationally.     

A 24-GHz 3.9-dB NF low-noise amplifier using 0.18 /spl mu/m CMOS technology

A 24-GHz low-noise amplifier (LNA) was designed and fabricated in a standard 0.18-/spl mu/m CMOS technology. The LNA chip achieves a peak gain of 13.1 dB at 24 GHz and a minimum noise figure of 3.9 dB at 24.3 GHz. The supply voltage and supply current are 1 V and 14 mA, respectively. To the author's knowledge, this LNA demonstrates the lowest noise figure among the reported LNAs in standard CMOS processes above 20 GHz.     

Numerical simulation on an interaction of a vortex street with an elliptical leading edge using an unstructured grid

An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd.