同面多极电容感应式冰层厚度传感器的设计及应用

同面多极电容感应式冰层厚度传感器是基于空气、冰与水不同的介电特性,通过对空气层、冰层和冰下水层电容值进行分层测量,从而实现对冰层厚度与水位高度自动检测的一种新型冰情检测传感器.主要融合了单片机技术和电子信息采集,处理,转换技术.利用Maxwell软件对其机理进行仿真,对实验数据进行分析,论证了同面多电极电容感应式冰厚传感器的测量原理;通过分析该传感器在黄河内蒙段的现场检测数据,证明该传感器具有准确度高、误差小、稳定等优点,并能在低温、辐射和强烈振动等恶劣环境下工作,非常适合野外环境中使用.     

基于PS021的电容式冰层厚度检测系统的设计

根据空气、冰和水的电容特性差异,本文设计了一种新型的电容式冰层厚度检测系统.该检测系统应用了德国acam公司的电容数字转换器PS021,可以把电容式传感器采集到的电容信号转换成数字信号输出.黄河的现场实验数据分析结果表明,系统结构简单,可靠性高,可以应用于冬季河道冰层厚度及冰下水位的定点、连续自动测量.     

基于DS18B20的冰层温度梯度-厚度传感器的设计

根据高寒地区河流结冰时,河道冰情监测点垂直柱面内空气、冰与水三种介质所表现出的不同温度特性,设计了基于DS18820温度传感器的高显示分辨率冰层温度梯度一厚度自动化检测传感器,传感器内部采用单总线结构,通过MSP430单片机的控制实现了温度梯度各监测点的数字化数据采集,使传感器具有结构简单、功耗低、抗干扰能力强等优点.将新型传感器安装在内蒙古三湖口黄河河道并进行了连续两个月的现场冰情数据采集试验,传感器获得了黄河河道监测点系统的温度梯度数据.通过对采集获得的冰层温度梯度数据的进一步分析,可以全面掌握河道冰层变化的状况,实验结果表明这一新的冰层温度梯度一厚度传感器是一种更加适应于工程应用的冰情检测设备.     

电阻电路分析方法在冰水情自动监测中的应用

电阻元件特性和包含电阻元件的电路分析是电路理论中最基本的分析内容和电路分析方法之一.根据冰水情工程检测中的客观环境条件,利用空气、冰与水的等效电阻随温度变化所具有的数值差异这一特点,将电路理论中电阻电路分析方法应用于冰水情工程检测中,提出了将检测环境分层处理的思路,应用线性电路理论中电阻分压的原理,通过对各分层介质等效电阻的检测、计算,反推出被检测介质的物理形态,进而实现对冰层内部物理状态、冰层厚度与冰下水位连续监测的目的.基于这一新的检测原理,作者研制成功新型R-T(电阻-温度梯度)冰水情自动检测传感器及其检测系统,并在南极海冰观测、黄河中上游河道冰水情定点连续监测、高寒地区河道与水电大坝冰情预警与水文信息自动测报等多个重大工程领域获得应用,为解决南极科学考察、黄河冰凌灾害预报、高寒地区河道、水电大坝、湖泊等领域冰情自动监测难题提供了一种新的检测方法与实现途径.     

黄河河道冰水情定点连续自动检测及数据分析

根据黄河中上游流域冰水情监测以及预防凌汛灾害的需求,设计了一种适合黄河河道的冰水情自动测报系统.该系统由基于空气、冰与水电阻特性差异的冰层厚度传感器、DS18B20的温度梯度传感器以及智能处理仪构成.采用该系统在内蒙托克托县黄河河道进行了黄河封冻期河道冰层厚度连续监测试验,获取了大量的现场实测数据,对采样数据进行分析,提出了判别冰层厚度的平均滤波算法,实现了对冰层生消变化全过程的自动监测.     

冰层厚度探测的频率域电磁法研究

根据冰层厚度探测的实际需要,研究了频率域电磁法的冰层厚度探测系统.系统是利用频率域电磁法的基本原理设计,同时,利用椭圆率来消除一次场的影响,可实现一次和二次磁场的分离提取、数据采集等模块功能.并且在实验室对传感器的电流发射部分和数据接收部分进行了试验,与理论数据进行比对.实验结果表明,系统可实现冰层厚度检测和生消变化过程检测.     

基于B样条和萤火虫算法的测压孔布置优化研究

风洞实验昂贵,实验前有必要进行数值仿真以预测减少盲目性.采用B样条拟合方法对CFD实验的翼型表面压力分布的大量数据进行拟合,并在测压孔数一定的情况下使用萤火虫算法寻找最小二乘意义上的测压点位置.结果表明,优化后的测压点拟合的曲线与原来大量数据拟合的曲线比较接近,同时一种在高维非标准单纯形内使用萤火虫算法的新方法被发现.     

基于光纤位移检测原理的静冰压力传感器的设计与研究

在高纬度地区冬季结冰期,水电大坝、水库等水工建筑物要承受由于温度变化引起冰体积膨胀而产生的静冰压力的挤压,如果对静冰压力估计不足,水工建筑物往往会遭受严重损坏.提出了一种基于光纤位移检测原理的静冰压力传感器结构,介绍了静冰压力传感器机械结构与数据处理电路的设计思路和工作原理,分析了静冰压力与冰层厚度和冰层温度的关系,对传感器的现场实验数据进行了初步的分析.     

基于光纤位移检测原理的静冰压力传感器的设计与研究北大核心

在高纬度地区冬季结冰期,水电大坝、水库等水工建筑物要承受由于温度变化引起冰体积膨胀而产生的静冰压力的挤压,如果对静冰压力估计不足,水工建筑物往往会遭受严重损坏.提出了一种基于光纤位移检测原理的静冰压力传感器结构,介绍了静冰压力传感器机械结构与数据处理电路的设计思路和工作原理,分析了静冰压力与冰层厚度和冰层温度的关系,对传感器的现场实验数据进行了初步的分析.     

黄河万家寨水利枢纽水库冰情定点连续自动监测系统的设计与应用

基于空气、冰与水的物理特性差异实现对冰水情连续自动检测的原理,作者设计、研制了适应高寒地区水电大坝冰情定点连续监测的冰水情自动检测传感器与信号采集系统,通过在黄河万家寨水利枢纽水库现场对冰情近4个月的冬季连续试验,获取了水库冰层内部系统的冰水情数据,采集数据客观反映了水库库区监测点冰层生消变化的规律,为确保引黄入晋工程的安全运行,也为高寒地区河道与水电大坝的冰情预警提供了一种可行的检测方法与设备.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².