Mathematical modeling of the three-dimensional evolution of the interface between fluids of different viscosities and densities in an inhomogeneous ground

The three-dimensional evolution of the interface between fluids of different viscosities and densities in the case of a piston displacement is considered. The problem is reduced to a system of integral and differential equations, which are solved numerically by the method of discrete singularities. The practical convergence of the numerical scheme is analyzed, and the numerical results are compared with an analytical solution.     

多晶体变形、应力的不均匀性及宏观响应

从单晶滑移变形分析的角度探讨多晶体塑性变形和应力的不均匀性及宏观力学响应：建议了 一种当前构形下以应力为基本变量的单晶黏塑性增量迭代计算方法；用Voronoi晶粒集合体 模型研究多晶体由于晶粒几何及取向的随机性造成的变形和应力的不均匀性, 进行了多晶集 合体的宏观响应和晶粒位向演化数值分析. 结果表明：(1)多晶体内等效塑性应变和应力分量在统计上呈现高斯分布，在应变硬化过程中, 随着塑性变形增加多晶体微观应力的统计变异系数会越来越大；(2)用Voronoi模型计算可得到沿最大剪应力方向的滑移变形带；(3)多晶体内最高三轴拉应力一般出现在晶界特别是三晶交界处；(4)Voronoi模型能用于织构分析.     

Pressure field around a well in a stratified inhomogeneous bed

The steady axisymmetric flow of an incompressible fluid into a vertical well hydrodynamically perfectly drilled into a stratified inhomogeneous half-space consisting of three layers with different permeabilities is considered. The boundaries of the layers are assumed to be horizontal planes and the roof of the upper layer is assumed to be impermeable. The flow obeys a linear Darcy’s law. The pressure distribution on the well is assumed to be given, which is the main obstacle to finding an exact solution of the problem. Beginning with the classical studies of Muskat and Charnyi [1, 2], approximate solutions of such problems have been constructed as a superposition of flows generated by point sources with given intensities, distributed along the well axis in accordance with a fairly simple law. In the present study, this approach is used to obtain an integral equation for the source density distribution, which is then solved numerically. Comparison with the known exact solution for a thin elongated ellipsoid (“needle”) shows that this approach makes it possible to ensure an accuracy which at any rate is sufficient for applications.     

变截面阻抗桩纵向振动问题积分变换解

利用拉普拉斯（Laplace)变换,将变截面阻抗桩振动的时域定解问题转换到频域的形式,求得了关于桩顶位移响应及速度响应的传递函数,然后利用求留数的方法求得了桩土系统的脉冲响应函数,利用脉冲响应函数求得了多种不同激振波形条件下（稳态正弦激励,瞬态半正弦激振及叠加有高频干扰波的瞬态半正弦激振等）的桩顶速度响应的表达式,并对桩土系统的频域特性作了深入的研究,得到了许多重要的结论。此外还将稳态正弦激振、态半正弦激振条件下的解与有关文献所采用分离变量法得到的解进行了对比,为两者的正确性提供了重要的证明。     

A note on gradient blowup rate of the inhomogeneous hamilton-jacobi equations

The gradient blowup of the equation u_t = Δu + a(x)|∇u|^p + h(x), where p > 2, is studied. It is shown that the gradient blowup rate will never match that of the self-similar variables. The exact blowup rate for radial solutions is established under the assumptions on the initial data so that the solution is monotonically increasing in time.     

On the hierarchical product of graphs and the generalized binomial tree

In this article we follow the study of the hierarchical product of graphs, an operation recently introduced in the context of networks. A well-known example of such a product is the binomial tree which is the (hierarchical) power of the complete graph on two vertices. An appealing property of this structure is that all the eigenvalues are distinct. Here we show how to obtain a graph with this property by applying the hierarchical product. In particular, we propose a generalization of the binomial tree and study some of its main properties.     

Analyzing Telephone Network Data

Abstract

As our reliance on computer networks grows, it becomes increasingly important that we understand the behavior of the traffic that they carry. Because of the speeds and sizes involved, working with traffic collected from a computer network usually means working with large datasets. This article describes our experience with traffic collected from the common channel signaling (CCS) network. I will briefly describe the data and how they are collected and discuss similarities with and differences from other large datasets. Next, I will describe our analysis tools and outline the reasons that they have been found useful. Finally, I will discuss the challenges facing us as we strive for a better understanding of more data from faster networks. Although my emphasis in this article is on the CCS network, it has been my experience that both the problems and the solutions generalize to data from other networks.