Augmenting Trees to Meet Biconnectivity and Diameter Constraints

Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a minimum number of new edges E' such that the augmented graph G'=(V,E\cup E') is biconnected and has diameter no greater than D. In this note we show that this problem is NP-hard for all fixed D , by employing a reduction from the DOMINATING SET problem. We prove that the problem remains NP-hard even for forests and trees, but in this case we present approximation algorithms with worst-case bounds 3 (for even D ) and 6 (for odd D ). A closely related problem of finding a minimum number of edges such that the augmented graph has diameter no greater than D has been shown to be NP-hard by Schoone et al. [21] when D=3 , and by Li et al. [17] when D=2. Received April 19, 1999; revised June 5, 2001.     

凸轮机构推程、回程运动角的最佳匹配及其求解方法

在推程、回程运动角之和 Φ0 +Φ′0 =C(定值 )的情况下 ,必存在某一对推程、回程运动角的最佳匹配 Opti-m um{ Φ0 ,Φ′0 } ;当选用该最佳匹配时 ,对心式直动从动杆盘形凸轮基圆半径 r0 取得最小值 r0 min。本文在揭示出上述事实的基础上 ,研究解决了当选取最佳匹配 Optim um{ Φ0 ,Φ′0 }时 ,按许用压力角 [α]条件求解对心式直动从动杆盘形凸轮基圆半径最小值 r0 min的解析法。     

Prediction of mean square radius of gyration of tree-like polymers by a general kinetic approach

This paper describes a kinetic method to predict the z-average molecular mean square radius of gyration of tree-like polymers formed by irreversible reactions, assuming Gaussian chains. It is based on the population balance equations for the two-sided molecular distributions of pendant chains associated with every chemically distinguishable kind of bonds. An automated method for the solution of those equations is valid both before as well as after gelation for complex kinetic schemes. Examples of its use are presented with polycondensation systems leading to hyperbranched polymers, the anionic polymerization of mono- and divinyl monomers and a radical polymerization with terminal branching and transfer to polymer.     

对南方山地勘探激发试验实施方式的新思考

针对南方山地野外地震采集过程中关于如何实施激发试验提出了两点疑问,并对疑问进行了深入的思考,同时在CXN地区进行了一系列激发试验研究探讨,主要研究了传统的井深试验、药量试验的特点,指出其存在的欠科学性,并对这些问题进行了重点分析,提出了相应的解决方法。     

基于TNC的安全接入系统的设计与实现

为了保证网络安全,将威胁隔离在受保护的网络之外,需要在主机接入网络以前对其进行健康状况评估,只允许符合既定安全策略的主机接入网络。针对上述问题,本文基于可信网络连接TNC技术设计并实现了一个安全接入系统,该系统可以根据指定的安全策略,对所有申请接入内网的主机进行身份验证和完整性校验,拒绝不安全的主机接入,最大限度的保证内网安全。     

Minimum size of a graph or digraph of given radius

In this paper we show that a connected graph of order n, radius r and minimum degree δ has at least edges, for n large enough, and this bound is sharp. We also present a similar result for digraphs.     

Characterizing Strong Stability Preserving Additive Runge-Kutta Methods

Space discretization of some time dependent partial differential equations give rise to ordinary differential equations containing additive terms with different stiffness properties. In these situations, additive Runge-Kutta (additive RK) methods are used. For additive RK methods the curve of absolute monotonicity gives stepsize restrictions for monotonicity. Necessary conditions for nontrivial curves of absolute monotonicity are the nonnegativity of the additive RK coefficients and some inequalities on some incidence matrices. In this paper we characterize strong stability preserving additive Runge-Kutta methods giving some order barriers and structural properties. Research supported by the Ministerio de Educación y Ciencia, Project MTM2005-03894.     

WIFI无线登录安全性研究

一直以来,无线网络的安全问题都备受关注,其中认证是保证信息安全的一个重要环节。目前无线认证有多种方式,比如Radius认证,Web认证,端口认证等,本文通过调研分析Radius认证与Web认证两种无线认证方式,来比较在家庭路由认证状态下,两者的性能差异,从而更好的解决目前普遍存在的弱密码问题。     

基于均匀设计的砂砾石层浆液扩散规律研究

在砂砾石层灌浆中,渗流对浆液在不同方向上扩散的影响一直是研究的空白。现通过室内灌浆模拟试验,采用均匀设计的方法构建试验方案,对不同渗流强度砂砾石层中浆液在不同方向上的扩散规律进行了研究,分析了灌浆压力P、水灰比m、渗透系数k以及渗流速度v对浆液在不同方向上扩散半径R0的影响,并得出回归关系式。试验结果表明:对浆液扩散半径R0影响最显著的是灌浆压力P,渗透系数k的影响次之;渗透速度v与上游向扩散半径Ru负相关,与下游向扩散半径Rd显著正相关,而对侧向扩散半径Rl的影响很小。     

On the local convergence of secant-type methods

In this article, we carry out a local convergence study for Secant-type methods. Our goal is to enlarge the radius of convergence, without increasing the necessary hypothesis. Finally, some numerical tests and comparisons with early results are analyzed.