基于多信道预约可冲突避免的多址接入协议

本文为多跳分布多无线网络提出了一套灵活而有效的自适应获取冲突避免（AACA）的多址接入协议。在该协议中，各节点竞争公共信道，利用RTS/CTS对话形式来预约各业务信道，成功预约后的分组传输不会受到其他节点的干扰。它使用任意确定数目信道，以异步方式工作，并且使得各节点利用半双工无线电台就可以灵活、简便地实现资源预约。分析和比较结果说明，所提出的多信道预约协议可以有效地解决隐藏终端、暴露终端以及侵入终端的问题。     

Locally Adaptive Wavelet Empirical Bayes Estimation of a Location Parameter

The traditional empirical Bayes (EB) model is considered with the parameter being a location parameter, in the situation when the Bayes estimator has a finite degree of smoothness and, possibly, jump discontinuities at several points. A nonlinear wavelet EB estimator based on wavelets with bounded supports is constructed, and it is shown that a finite number of jump discontinuities in the Bayes estimator do not affect the rate of convergence of the prior risk of the EB estimator to zero. It is also demonstrated that the estimator adjusts to the degree of smoothness of the Bayes estimator, locally, so that outside the neighborhoods of the points of discontinuities, the posterior risk has a high rate of convergence to zero. Hence, the technique suggested in the paper provides estimators which are significantly superior in several respects to those constructed earlier.     

调幅系数为任意值的调幅波研究

本文讨论了调幅系数为任意值的调幅波，给出了它的表达式，频谱与调幅系数，调制效率和信噪比增益的计算公式。     

松纵坑切梢小蠹虫害的仿真模型与生态防治的优化策略

根据松纵坑切梢小蠹的主要生物学特征,通过分析抚育间伐持续控制松纵坑切梢小蠹虫害的机理,应用复杂适应系统(CA S)理论,建立了模拟松纵坑切梢小蠹虫害的一种动态演化数学模型,并讨论了模型的收敛性.然后选用昆明小哨林场为背景,进行了各种抚育间伐决策的仿真,从中优选抚育间伐决策.结果表明:模拟优化方案与实际调查统计分析结果一致:均为弱度间伐与中弱度间伐控制蠹害效果最好.最后通过森林积材量与虫害程度之间的优化,给出了抚育间伐的优化策略.     

中学生男性性别角色期望的因子模型与应用

运用中学生男性性别角色期望调查表和因子分析方法对贵阳市中学生进行男性性别角色期望调查和定性与定量分析,为中学生树立适宜的性别角色观,促进其心理健康发展提供量化依据.分析显示:传统的男性角色并不被现代中学生完全接受,无论是男中学生还是女中学生都在力图探求一种新的男性性别角色模式,且两性中学生对这一新的男性性别角色模式的期望和把握是有一定差异的.     

拟因子试验设计在生产中的应用

根据生产实际,综合利用并列、赋闲列和拟水平试验设计,运用多重比较进行方差分析,寻找水泥熟料的最佳工艺.不仅解决了不同水平多因素试验问题,同时还可考虑交互作用,大大减少了试验次数,从而提高经济效益.     

A Characterization of Graphs without Even Factors

In this paper, we first reduce the problem of finding a minimum parity (g,f)-factor of a graph G into the problem of finding a minimum perfect matching in a weighted simple graph G*. Using the structure of G*, a necessary and sufficient condition for the existence of an even factor is derived. This paper was accomplished while the second author was visiting the Center for Combinatorics, Nankai University. The research is supported by NSFC     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.     

Does the beam width affect the generalized M factor of hard-edged diffracted beams?

A detailed study of the generalized M² factor of hard-edged diffracted beams based on the truncated second-order moments method, asymptotic analysis and self-convergent beam width approach is performed. The dependence of the generalized M² factor on the parameters characterizing the spatial profile, and beam truncation, etc. is analyzed.