Diastereoselective Alkylation of (Diene-Aldehyde)Fe(CO)3 Complexes with Functionalized Zinc-Copper Reagents NuCu(CN)Znl

Addition of functionalized zinc-copper reagents to the title complexes proceeds in a highly diastereoselective fashion to afford dienol complexes. The relative configurations of adducts 3d were determined by single X-ray diffraction analysis.     

Approximation of bandlimited functions

Many signals encountered in science and engineering are approximated well by bandlimited functions. We provide suitable error bounds for the approximation of bandlimited functions by linear combinations of certain special functions—the prolate spheroidal wave functions of order 0. The coefficients in the approximating linear combinations are given explicitly via appropriate quadrature formulae.     

Likelihood Ratio Processes for Markovian Particle Systems with Killing and Jumps

We consider Markov processes built from pasting together pieces of strong Markov processes which are killed at a position dependent rate and connected via a transition kernel. We give necessary and sufficient conditions for local absolute continuity of probability laws for such processes on a suitable path space and derive an explicit formula for the corresponding likelihood ratio process. The main tool is the consideration of the process between successive jumps – what we call ‘elementary experiments’ – and criteria for absolute continuity of laws of the process there. We apply our results to systems of branching diffusions with interactions and immigrations. This revised version was published online in June 2006 with corrections to the Cover Date.     

一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

机载海洋激光测深系统参量设计与最大探测深度能力分析

详细讨论了机载海洋激光测深系统最大测量深度与相关因子之间的关系，并利用最小可探测信噪比为判据，对机载海洋激光测深系统在白天和晚上工作进行了数值模拟，通过比较最大测量深度与激光脉冲峰值功率、接收视场角、接收口径和光谱接收带宽等关系，确定了系统的主要参量。以确定的参量建立的系统具有白天49m和晚上65m的最大测深能力，可完全满足在沿岸带以及岛礁的测量要求。     

Predictability and model selection in the context of ARCH models

Most of the methods used in the ARCH literature for selecting the appropriate model are based on evaluating the ability of the models to describe the data. An alternative model selection approach is examined based on the evaluation of the predictability of the models in terms of standardized prediction errors. Copyright © 2005 John Wiley & Sons, Ltd.     

Antimicrobial activity on the copolymers of 2,4‐dichlorophenyl methacrylate with methyl methacrylate: Synthesis and characterization

Copolymers of monomers 2,4‐dichlorophenyl methacrylate (2,4‐DMA) and methyl methacrylate (MMA) were synthesized with different monomer feed ratios using toluene as a solvent and 2,2′‐azobisisobutyronitrile (AIBN) as an initiator at 70 °C. The copolymers were characterized by IR‐spectroscopy, and copolymer composition was determined with UV‐spectroscopy. The linearization method of Fineman–Ross was employed to obtain the monomer reactivity ratios. The molecular weights and polydispersity indexes were determined by gel permeation chromatography (GPC). Thermogravimetric analyses of polymers were carried out in nitrogen atmosphere. The homo‐ and copolymers were tested for their antimicrobial properties against selected microorganisms. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 5227–5234, 2004     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

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.