A CLASS OF FACTORIZATION UPDATE ALGORITHM FOR SOLVING SYSTEMS OF SPARSE NONLINEAR EQUATIONS

ＡＣＬＡＳＳＯＦＦＡＣＴＯＲＩＺＡＴＩＯＮＵＰＤＡＴＥＡＬＧＯＲＩＴＨＭＦＯＲＳＯＬＶＩＮＧＳＹＳＴＥＭＳＯＦＳＰＡＲＳＥＮＯＮＬＩＮＥＡＲＥＱＵＡＴＩＯＮＳＢＡＩＺＨＯＮＧＺＨＩ（ＩｎｓｔｉｔｕｔｅｏｆＣｏｍｐｕｔａｔｉｏｎａｌＭａｔｈｅｍａｔｉｃ...     

Local convergence of collinear scaling algorithms related to direct least‐change secant update methods for minimization

Collinear scaling algorithms related to direct fixed-scale and rescaled least-change secant update methods for unconstrained minimization are derived. Theorems on local and q-superlinear convergence of these algorithms are presented. These results are extensions of those of Dennis and Walker [14] for direct least-change secant update methods. This revised version was published online in August 2006 with corrections to the Cover Date.     

Implementing the ALGOL 68 heap

The implications of the heap, reference variables and global generators in ALGOL 68 are examined and some notes on possible implementation mechanisms are presented. In particular the use or simulation of hardware with segment addressing facilities is discussed.     

GOSAT-2009 methane spectral line list in the 5550-6236 cm range

A methane spectral line list for the 5550-6236 cm⁻¹ range with the intensity cut off 4×10⁻²⁶ cm/molecule at 296 K is presented. The line list is based on new extensive measurements of methane spectral line parameters performed at different temperatures and pressures of methane and buffer gases N₂, O₂ and air. This spectral line list is prepared in HITRAN-2008 format and contains the following spectral line parameters of about 11,000 lines: position, intensity, energy for lower state (where possible), air-broadening and air-shifting coefficients, exponent of temperature dependence of air-broadening coefficient and self-broadening coefficient.     

基于IP over TS系统网段内地址扩展技术的研究

针对IP over TS 系统研究同一网段内的地址扩展技术,分析常用的链路扩展方法,在无线链路传输中针对该方法所导致的信道有效占有率不稳定且不足提出邻接表法.为了增强邻接表法的地址扩展灵活性将邻接表法改进为自适应邻接表法.测试结果表明,自适应邻接表法解决了同一网段内的地址扩展问题.同时提高了无线信道有效数据的占有率和稳定性.     

Coloring triangle‐free graphs with local list sizes

We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow‐up work of Bernshteyn) on the (list) chromatic number of triangle‐free graphs. In both our results, we permit the amount of color made available to vertices of lower degree to be accordingly lower. One result concerns list coloring and correspondence coloring, while the other concerns fractional coloring. Our proof of the second illustrates the use of the hard‐core model to prove a Johansson‐type result, which may be of independent interest.     

1-平面图的结构性质及其在无圈边染色上的应用

一个图称为是1-平面的如果它可以画在一个平面上使得它的每条边最多交叉另外一条边.本文描述了任意1-平面图中小于等于7度点之邻域的局部结构,解决了由Fabrici和Madaras提出的两个关于1-平面图图类中轻图存在性的问题,证明了每个最大度是△的1-平面图G是无圈列表max{2△-2,△+83}-边可选的.     

Body fitted link-cell algorithm for particulate flow simulation in curved pipeline domain

The link-cell (LC) algorithm is widely used in discrete element method (DEM) simulation, in order to increase computational efficiency. The common way is to divide the entire computational domain into a series of square sub-cells. A huge index matrix, Ω$\Omega$, is required to store the information of particles located in each of these sub-cells. However, most of these sub-cells are always empty for some anomalistic computational domain, such as particulate flow in a pipeline. These empty sub-cells also consume the limited memory bandwidth and lower the computational power. In order to reduce the size of the index matrix, a body fitted link-cell (BFLC) algorithm is established to identify the neighbors quickly. Furthermore, a simplified algorithm for simulation of two dimensional particulate flow in curved pipelines is presented. Lastly, an example is presented to validate the BFLC algorithm.     

Lazy Group Key Updating Scheme Based on Dynamic Tree

In group key management systems adopting lazy updating, the overhead of key updating might be amortized. In this paper, a Dynamic-tree based Lazy group key updating scheme （DT-LGKU） is presented, which consists of four algorithms Init, Update, Derive and Extract. DT-LGKU supports lazy join events and lazy leave events with unbounded number of time intervals, and provides the forward secrecy and the backward secrecy. DT-LGKU is secure if both the Large Integer Factoring problem and RSA problem are hard. The performance evaluation shows that the worst-case complexity of the cryptographic operations used in the Extract algorithms is logarithmic in the number of time intervals, and those of Init, Update, Derive are constant.     

老化处理试验对铜箔与树脂基板的附着性的影响

概述了镀锌的铜箔暴露于老化处理氛围中（313K,90％RH,168h）以后,铜箔上镀锌层的取向和HCl浸渍后的剥离损失对附着性的影响。试验结果表明箔镀层（0002）取向的锌基面比其它取向具有较低的HCl浸渍后的剥离损失。