高陡横坡段桩柱式桥梁双桩基础受力分析

基于高陡横坡段桩柱式桥梁双桩基础承载特性,提出了一种改进有限杆单元计算分析方法.分析了高陡横坡段桩柱式桥梁双桩基础承载机理及受力特性,建立了双桩基础计算分析模型.其次,根据前、后桩与边坡相对位置关系,给出了后桩所受剩余下滑力与前桩所受土压力的比例关系.在传统有限杆单元分析方法基础上,结合陡坡桩受力特征,导得了考虑桩土共同作用与"P-Δ"效应的单元刚度矩阵修正方法,并在此基础上编制了适用于高陡横坡段桩柱式桥梁双桩基础的有限杆单元分析MATLAB计算程序.采用室内模型试验对本文计算方法进行验证,给出了适用于陡坡段桥梁桩基的设计流程图.研究结果表明:本文理论计算值与模型试验实测结果吻合良好,表明本文计算方法正确可行,可为同类工程设计提供参考.     

一种数字密码电路

介绍一种以 JK 触发器为主要组成部分的数字密码电路,并着重对它的工作原理和功能的实现进行了论述,从而阐明了此电路的实用性和可取性。     

The mapping properties of the radiosity operator along an edge

In this article we study the radiosity operator along an edge between two adjacent half‐planes. First we show that the radiosity operator is invertible in a whole scale of anisotropic Sobolev spaces. In the absence of any shadows we are able to derive regularity properties of the solution, which depend only on the angle between the half‐planes, the reflectivity coefficients and the right‐hand side. This work can be considered as a supplement to the article of Rathsfeld (Mathematical Methods in the Applied Sciences 1999; 22 : 217–241). Copyright © 2002 John Wiley & Sons, Ltd.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

若干图类的邻强边染色

研究了若干图类的邻强边染色 .利用在图中添加辅助点和边的方法 ,构造性的证明了对于完全图 Kn和路 Lm 的笛卡尔积图 Kn× Lm,有χ′as(Kn× Lm) =△ (Kn× Lm) +1 ,其中△ (Kn× Lm)和χ′as(Kn× Lm)分别表示图 Kn× Lm的最大度和邻强边色数 .同理验证了 n阶完全图 Kn的广义图 K(n,m)满足邻强边染色猜想 .     

Orthogonal double covers by super‐extendable cycles

An Orthogonal Double Cover (ODC) of the complete graph K_n by an almost‐hamiltonian cycle is a decomposition of 2K_n into cycles of length n?1 such that the intersection of any two of them is exactly one edge. We introduce a new class of such decompositions. If n is a prime, the special structure of such a decomposition allows to expand it to an ODC of K_n+1 by an almost‐hamiltonian cycle. This yields the existence of an ODC of K_p+1 by an almost‐hamiltonian cycle for primes p of order 3 mod 4 and its eventual existence for arbitrary primes p. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 283–293, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10011     

前缘弯掠斜流转子叶顶间隙流动特性数值分析

本文对前缘弯掠斜流转子叶顶间隙内的流动特性进行了数值分析。结果表明:叶顶间隙气流与主流发生卷吸而生成泄漏涡。泄漏涡作用的区域具有较低的压力分布。在叶片通道内,泄漏涡沿着与转子旋向相反的方向朝相邻叶片的压力面移动。大间隙时的泄漏涡比小间隙时强烈。低流量时泄漏涡的作用区域比高流量时大。在各种流量特性下,叶顶尾缘近吸力面区域都存在着二次间隙流。     

HL-1M边缘等离子体静电湍流扰动

对HL－1M边缘等离子体静电湍流扰动进行了初步的实验研究。获得了扰动的基本特征量，估计了低杂波引起的径向粒子流的变化。在加低杂波（2．45GHz)前、后，电子密度扰动和极向电场扰动的幅度及其关联性变化不大。虽然低杂波部分抑制了静电湍流，但在数量上不能解释粒子约束改善的实验结果。     

多目标多阶段决策问题最优化方法及应用

本文提出了可行状态点,可行边和可行策略等概念,建立了一种新的解决多目标多阶段决策问题的方法,介绍了这一方法的应用实例:     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.