Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Existence and uniform decay for Euler–Bernoulli beam equation with memory term

In this article we prove the existence of the solution to the mixed problem for Euler–Bernoulli beam equation with memory term. The existence is proved by means of the Faedo–Galerkin method and the exponential decay is obtained by making use of the multiplier technique combined with integral inequalities due to Komornik. Copyright © 2004 John Wiley & Sons, Ltd.     

Wavelength and repetition rate tunable optical pulse source using a chirped fiber Bragg grating and a nonlinear optical loop mirror

We experimentally demonstrate a simple and novel scheme for tunable real-repetition-rate multiplication, based on the combined use of fractional Talbot effect in a linearly tunable chirped fiber Bragg grating (FBG) and cross-phase modulation (XPM) effect in a nonlinear optical loop mirror (NOLM). By tuning the group-velocity dispersion of the chirped FBG fabricated with the S-bending method using a uniform FBG, we obtain high quality pulses at pseudorepetition rates of 20/spl sim/50 GHz from an original 8.5-ps 10-GHz soliton pulse train. We subsequently convert this pseudorate multiplication into a real-rate multiplication using XPM effect in an NOLM. A wavelength tuning is also achieved over a /spl sim/15-nm range.     

Use and Disuse of Contextual Primes in Dynamic News Environments

This study reexamines the news priming effects of the 1991 Persian Gulf War. Suggesting an alternative approach to those used in previous studies, this study assesses individuals' use and disuse of a contextual prime (i.e., the air war) in dynamic news environments. With a short-term, quasi-experimental approach considering the air war as a prime stimulus, a path analysis suggests robust evidence of the short-term accessibility effects of priming. More importantly, as suggested in Martin's (1986) set/reset model, this study extends priming effects beyond the simple hydraulic patterns of accessibility effects. It reveals that both attitudes toward military action and attitudes toward a diplomatic solution were used in subsequent judgments of the president's job performance and handling of the war. The associations between attitudes toward a diplomatic solution and subsequent judgments were even stronger than those between attitudes toward military action and the same subsequent judgments, despite the clear prowar primes of news discourse in the air-war context. This pattern was more greatly intensified among those in the high news attention group than those in the low news attention group     

Analytic Feynman integrals of transforms of variation of cylinder type functions over Wiener paths in abstract Wiener space

In this paper, we evaluate various analytic Feynman integrals of first variation, conditional first variation, Fourier-Feynman transform and conditional Fourier-Feynman transform of cylinder type functions defined over Wiener paths in abstract Wiener space. We also derive the analytic Feynman integral of the conditional Fourier-Feynman transform for the product of the cylinder type functions which define the functions in a Banach algebra introduced by Yoo, with n linear factors.     

一种简易云雾室的制作

本文利用自制云雾室把微观粒子的运动转化为宏观现象，从而供实验观察和研究。     

Quick construction of efficient morphological operators bycomputational learning

A new technique is introduced to construct generic morphological operators quickly and automatically using input-output pairs of images as training samples. This process can be modelled as generalised PAC (probably approximately correct) learning. A new representation for morphological operators, much more efficient than the traditional one, is also proposed     

Fast DCT algorithm with fewer multiplication stages

A novel fast DCT scheme with reduced multiplication stages and fewer additions and multiplications is proposed. The proposed algorithm is structured so that most multiplications tend to be performed at the final stage, which reduces the propagation error that could occur in the fixed-point computation. Minimisation of the multiplication stages can further decrease the error     

Virtual circuit connection method for RSVP multicasting supportingheterogeneous receivers on the ATM network

The authors suggest a novel virtual circuit connection method based on the reverse traversing technique to minimise the waste of network bandwidth resources, when the Internet protocol multicast is interoperated using the resource reservation protocol over an asynchronous transfer mode network. Simulation results show that, as the number of receivers increases, the bandwidth requirements on all links of the network of the proposed scheme become more advantageous than those of other conventional methods