基于DOCSIS标准的HFC数据加密算法的分析

基于DOCSIS标准的增强型基线保密性接口（BPI＋）采用56bit DES加密分组数据，采用二密钥三重DES加密通信量加密密钥。这种多重加密技术的应用为HFC网络的数据传输提供了相当于或更好于专线级的网络安全与加密性能。     

一种改进的共同进化遗传算法及其应用

将共同进化遗传算法应用于临床营养决策优化中,虽然取得了一定成果,但算法中仍存在早熟现象、局部搜索能量弱等问题,为此提出一种改进的共同进化模型。算法使用新的子群体划分方法和交叉算子,引入精英保留策略、信息交换原则和小生境技术。通过对糖尿病营养治疗的仿真表明,改进后的算法在保证群体多样性和避免早熟现象的前提下,提高了算法的局部和全局寻优能力,且膳食配方中营养素达标率符合要求,满足专家建议的糖尿病饮食需求。     

集群系统与公用网互连的仿真模型和模拟算法

在讨论ＭＰＴ１３２７信令的集群移动通信系统与国内Ｎｏ．７信令的ＰＳＴＮ网间互连，帝现两种信令配合中，研究了集群系统的仿真模型和模拟算法，同时模拟出整个集群系统的工作情况，运行结果证实了所提方案的可行性与准确性。     

Analysis of plane and axisymmetric flows of incompressible fluids with the stream tube method: Numerical simulation by trust-region optimization algorithm

New concepts for the study of incompressible plane or axisymmetric flows are analysed by the stream tube method. Flows without eddies and pure vortex flows are considered in a transformed domain where the mapped streamlines are rectilinear or circular. The transformation between the physical domain and the computational domain is an unknown of the problem. In order to solve the non-linear set of relevant equations, we present a new algorithm based on a trust region technique which is effective for non-convex optimization problems. Experimental results show that the new algorithm is more robust compared to the Newton-Raphson method.     

GOLDEN AGES OR MAGIC MOMENTS?

ABSTRACT. The paper is an attempt to refute Quinn's ‘the Golden Age of fisheries population models has ended “hypothesis. The approach is to show it is possible to provide simple matrix based theory for use with delay difference equations applied to products of the 0th to 4th powers of length and numbers at length (Alias” proto‐moments“). It compares these to models just based upon numbers and biomass. It also shows examples (of comparatively little moment) indicating how using multiple proto‐moments could improve the ability of delay difference equations to handle the size dependent processes of maturity, selection, natural mortality rates and predation rates and thus improving the biological reality of these models.     

两种计算吸光光度法同时测定钙镁

研究了在pH10．5的硼砂-氢氧化钾缓冲溶液和乙醇的增敏作用条件下，偶氮氯膦Ⅰ与钙、镁的吸收特性，建立了多波长光度法同时测定钙和镁的方法。采用两种矩阵算法对试验数据进行处理，并对结果进行比较和分析。钙和镁含量在0～25μg／25ml范围内用计算法Ⅱ能得到准确结果。     

Blind omnidirectional image quality assessment with representative features and viewport oriented statistical features

With the development of information technologies, various types of streaming images are generated, such as videos, graphics, Virtual Reality (VR)/omnidirectional images (OIs), etc. Among them, the OIs usually have a broader view and a higher resolution, which provides human an immersive visual experience in a head-mounted display. However, the current image quality assessment works cannot achieve good performance without considering representative human visual features and visual viewing characteristics of OIs, which limited OIs’ further development. Motivated by the above problem, this work proposes a blind omnidirectional image quality assessment (BOIQA) model based on representative features and viewport oriented statistical features. Specifically, we apply the local binary pattern operator to encoder the cross-channel color information, and apply the weighted LBP to extract the structural features. Then the local natural scene statistics (NSS) features are extracted by using the viewport sampling to boost the performance. Finally, we apply support vector regression to predict the OIs’ quality score, and experimental results on CVIQD2018 and OIQA2018 Databases prove that the proposed model achieves better performance than state-of-the-art OIQA models.     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.     

New Monte Carlo method for the self-avoiding walk

We introduce a new Monte Carlo algorithm for the self-avoiding walk (SAW), and show that it is particularly efficient in the critical region (long chains). We also introduce new and more efficient statistical techniques. We employ these methods to extract numerical estimates for the critical parameters of the SAW on the square lattice. We find=2.63820 ± 0.00004 ± 0.00030=1.352 ± 0.006 ± 0.025v=0.7590 ± 0.0062 ± 0.0042 where the first error bar represents systematic error due to corrections to scaling (subjective 95% confidence limits) and the second bar represents statistical error (classical 95% confidence limits). These results are based on SAWs of average length 166, using 340 hours CPU time on a CDC Cyber 170–730. We compare our results to previous work and indicate some directions for future research.     

Nonstationary Markov chains and convergence of the annealing algorithm

We study the asymptotic behavior as timet + of certain nonstationary Markov chains, and prove the convergence of the annealing algorithm in Monte Carlo simulations. We find that in the limitt + , a nonstationary Markov chain may exhibit phase transitions. Nonstationary Markov chains in general, and the annealing algorithm in particular, lead to biased estimators for the expectation values of the process. We compute the leading terms in the bias and the variance of the sample-means estimator. We find that the annealing algorithm converges if the temperatureT(t) goes to zero no faster thanC/log(t/t ₀) ast+, with a computable constantC andt ₀ the initial time. The bias and the variance of the sample-means estimator in the annealing algorithm go to zero likeO(t^–1+) for some 0<1, with =0 only in very special circumstances. Our results concerning the convergence of the annealing algorithm, and the rate of convergence to zero of the bias and the variance of the sample-means estimator, provide a rigorous procedure for choosing the optimal annealing schedule. This optimal choice reflects the competition between two physical effects: (a) The adiabatic effect, whereby if the temperature is loweredtoo abruptly the system may end up not in a ground state but in a nearby metastable state, and (b) the super-cooling effect, whereby if the temperature is loweredtoo slowly the system will indeed approach the ground state(s) but may do so extremely slowly.