夏70－斜05井落井电缆打捞工艺

夏７０－斜０５井完钻电测时３３９７ｍ长的电缆断落井内。使用自制外捞绳器和磨鞋历时７４０ｈ成功地将落井电缆全部打捞出井，避免了该井的报废，挽回了近２００万元经济损失。文中较详细地介绍了打捞作业的难点及打捞工具的制作，最后针对电缆事故的处理提出了几点认识。     

On the Quadratic Convergence of the Levenberg-Marquardt Method without Nonsingularity Assumption

Recently, Yamashita and Fukushima [11] established an interesting quadratic convergence result for the Levenberg-Marquardt method without the nonsingularity assumption. This paper extends the result of Yamashita and Fukushima by using _k=||F(x_k)||, where [1,2], instead of _k=||F(x_k)||² as the Levenberg-Marquardt parameter. If ||F(x)|| provides a local error bound for the system of nonlinear equations F(x)=0, it is shown that the sequence {x_k} generated by the new method converges to a solution quadratically, which is stronger than dist(x_k,X^*)0 given by Yamashita and Fukushima. Numerical results show that the method performs well for singular problems.     

Ca,Sr掺杂BNT-BT压电陶瓷结构与性能研究

采用传统的电子陶瓷制备工艺制备了一系列0.93Bi05Na05Tio3-0.07(Ba1-xAx)TiO3(简写为BNBAT100x;其中A=Ca,sr,x:0.02,0.04,0.06,0.08,0.10)陶瓷,研究了陶瓷的结构、介电、压电性能变化特征.XBD分析表明,陶瓷样品均形成了单一的钙钛矿结构固溶体.陶瓷的介电、压电性能受Ca,Sr含量的影响显著.所有陶瓷样品表现出弥散相变特征.当x<0.08时,BNBCT陶瓷的介电常数大干BNBST陶瓷,同时,BNBCT陶瓷室温介电常数在x=0.04时达到最大.而BNBST陶瓷此时具有最小的室温介电常数.陶瓷的压电性能受Ca,Sr含量的显著影响,当Ca含量为6mol%时,压电常数(d33)和平面机电耦合(kp)达到最大,分别为1 40.5 pc/N和1 9.7%.而当Sr含量为4mol%时,BNBST陶瓷的压电常数(d13)达到最大为1 39.8pC/N.此时平面机电耦合(kp)为1 8.9%.     

EILog-05测井装备在华北油田的应用

EILog-05快速与成像测井成套装备于2006年在华北油田投入应用.从测井时效、井眼适应能力、资料质量、解释精度、试油验证等方面,总结分析了EILog-05成套装备在华北油田的应用效果.通过与Eclips5700、CSL3700和CSU测井系统的对比试验表明,EILog-05成套装备仪器性能稳定,测井时效高,井眼适应能力强,测井资料重复性、与不同系列同类仪器资料一致性均达到行业标准,资料品质高,能够满足华北油田储层评价要求,解释精度高,油气层识别准确率达到油田公司质量指标.     

Learn from the past – sequentially one-to-one video deblurring network

With the growing availability of hand-held cameras in recent years, more and more images and videos are taken at any time and any place. However, they usually suffer from undesirable blur due to camera shake or object motion in the scene. In recent years, a few modern video deblurring methods are proposed and achieve impressive performance. However, they are still not suitable for practical applications as high computational cost or using future information as input. To address the issues, we propose a sequentially one-to-one video deblurring network (SOON) which can deblur effectively without any future information. It transfers both spatial and temporal information to the next frame by utilizing the recurrent architecture. In addition, we design a novel Spatio-Temporal Attention module to nudge the network to focus on the meaningful and essential features in the past. Extensive experiments demonstrate that the proposed method outperforms the state-of-the-art deblurring methods, both quantitatively and qualitatively, on various challenging real-world deblurring datasets. Moreover, as our method deblurs in an online manner and is potentially real-time, it is more suitable for practical applications.     

基于RSA算法的智能锁设计

提出了一种可通过手机远程分享钥匙的智能锁模型,并提供了一套能使系统完整运行的硬件模型.在如今的智能锁领域,普遍只是将指纹、密码、刷卡、蓝牙开锁功能相结合,却少有钥匙分享功能.为了保障钥匙分享过程中钥匙的保密性和时效性,RSA算法可以较好的满足要求.为了保证系统的完整性,对硬件系统（指纹、刷卡解锁）也提出了一套基于STM32F103型低功耗单片机为控制器的可执行设计方案.实验结果表明系统可以较好的实现钥匙分享的功能.     

Kernel Entropy Estimation for Linear Processes

Let {X _n :n∈N}be a linear process with bounded probability density function f(x). We study the estimation of the quadratic functional ∫ _R f ²(x)dx. With a Fourier transform on the kernel function and the projection method, it is shown that, under certain mild conditions, the estimator has similar asymptotical properties as the i.i.d. case studied in Giné and Nickl 2008 if the linear process {X _n :n∈N}has the defined short range dependence. We also provide an application to divergence and the extension to multi‐variate linear processes. The simulation study for linear processes with Gaussian and α‐stable innovations confirms our theoretical results. As an illustration, we estimate the divergences among the density functions of average annual river flows for four rivers and obtain promising results.     

An explicit method for construction of CTBC codes with girth 6

A cylinder-type block-circulant (CTBC) code with circulant permutation matrix (CPM) size p is presented by a binary base matrix with a cylindrical structure and a slope-vector on ${\mathbb{Z}}_p$. The slope-vector is called proper if the corresponding CTBC code is 4-cycle free. In this paper, an algorithm is presented that for a given base matrix with a cylindrical structure, explicitly generates a proper slope-vector. This proper slope-vector provides a lower-bound on the CPM-sizes of the corresponding CTBC codes required to achieve girth at least 6. Interestingly, the lower bound, minimum distance and 6-cycle multiplicity of the constructed CTBC codes are better than some masked and unmasked known explicitly constructed 4-cycle free QC LDPC codes with the same regularity. Simulation results show that the constructed CTBC codes outperform some 4-cycle free QC LDPC codes in binary and nonbinary cases.