CDMA蜂窝移动通信系统中的无线资源管理算法研究

无线资源管理是CDMA蜂窝移动通信系统保证业务质量(QoS)和提高频谱利用率的关键技术，本文提出了CDMA系统中无线资源管理算法的一般模型，阐述了三种重要的无线资源管理算法，即功率控制算法、呼叫接纳控制算法和分组调度算法的主要研究情况，并分析了目前研究中仍然存在和需要解决的问题。     

Local chain‐configuration dependence of the mechanisms of the chemical reaction of poly(vinyl chloride). IX. Novel results on stereoselectivity of chlorination reaction

A poly(vinyl chloride) (PVC) sample was chlorinated in solution in the presence of 2,2′‐azobisisobutyronitrile and by the fluid‐bed method. The aim was to evaluate the scope of the stereoselectivity of the chlorination reaction. The quantitative microstructural analysis of the residual PVC with a degree of chlorination was followed by ¹³C NMR spectroscopy. From the evolution of the content of isotactic (mm), heterotactic (mr), and syndiotactic (rr) triads and of mmmm, mmmr, and rmmr isotactic pentads in the unchlorinated parts of the polymer, it was unambiguously inferred that the chlorination reaction proceeds by a stereoselective mechanism in that the mr heterotactic triads are the most reactive structures followed by the isotactic triad at mmmr and rmmr pentads. This conclusion was confirmed on the basis of the Fourier transform infrared results. The results provide valuable information regarding the effect of tacticity and related local conformations in the chemical reactions of PVC. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 508–519, 2003     

有向图上的随机游动

设G=(V,Г)是有向图,G上的随机游动X(G)定义如下:位于某个顶点上的一个粒子将以等概率转移到该顶点的所有后继顶点.令M(j,n)表示随机游动X(G)在前n步内访问顶点j的平均次数,用W(j)表示随机游动X(G)到达顶点j所需要的平均步效.我们对M(j,n)和W(j)的值进行了估计,证明了M(j,n)=O(n),并给出了W(j)的上界.     

Optimal volume-corrected laplace-metropolis method

The article provides a refinement for the volume-corrected Laplace-Metropolis estimator of the marginal likelihood of DiCiccioet al. The correction volume of probability α in DiCiccioet al. is fixed and suggested to take the value α=0.05. In this article α is selected based on an asymptotic analysis to minimize the mean square relative error (MSRE). This optimal choice of α is shown to be invariant under linear transformations. The invariance property leads to easy implementation for multivariate problems. An implementation procedure is provided for practical use. A simulation study and a real data example are presented.     

A Generalized Markov Sampler

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.     

Analysis of a Multiserver Queue with Setup Times

This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production when the system consists in a set of machines monitored by a single operator. We carry out an extensive analysis of the system including limiting distribution of the system state, waiting time analysis, busy period and maximum queue length. AMS subject classification: 90B22, 60K25     

Time-Reversed Dynamical Entropy and Irreversibility in Markovian Random Processes

A concept of time-reversed entropy per unit time is introduced in analogy with the entropy per unit time by Shannon, Kolmogorov, and Sinai. This time-reversed entropy per unit time characterizes the dynamical randomness of a stochastic process backward in time, while the standard entropy per unit time characterizes the dynamical randomness forward in time. The difference between the time-reversed and standard entropies per unit time is shown to give the entropy production of Markovian processes in nonequilibrium steady states.     

Using the new in–in method for the synthesis of polyisoprene/polystyrene heteroarm star polymers

The basis of the two‐step in–in method is as follows: star polymers with poly(divinyl benzene) cores, synthesized by the arm‐first method, include many unreacted double bonds in their core, and these double bonds can be attacked by the carbanions of some monomers such as styrene and dienes. In this work, linear polyisoprene chains were used to attack the double bonds existing in the poly(divinyl benzene) cores of polystyrene star polymers, so that a heteroarm star polymer with polystyrene and polyisoprene arms was synthesized. It was later well characterized with size exclusion chromatography, light scattering, viscometry, UV spectroscopy, dynamic mechanical thermal analysis, and ¹H NMR. © 2002 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 135–142, 2003     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.