水电站坝下尾水渠集鱼流场模拟研究

为减缓大坝阻隔对鱼类洄游的不利影响,水电工程需要建设有效的过鱼设施疏通其洄游通道。高寒区高坝大库工程过鱼设施建设是一个极其复杂的技术问题,目前国内类似工程尚无成功运用经验。实际过鱼设施内流场条件十分复杂,会产生不利于鱼类上溯的水流形态。基于此原因,对某水电站工程坝下尾水流场进行了数值模拟。研究表明,在机组运行时,电站尾水渠左右两侧发电尾水主流的边缘是明显具有流速梯度分布的区域,符合鱼类聚集的水流特征,具备布置鱼道进口条件。这样可根据尾水位的变化开启两侧不同进口诱鱼,且在机组停运时,可开启左侧进口诱鱼。     

矩形明渠消力池水跃的水头损失研究

为了研究沿程水头损失与局部水头损失的变化规律,根据沿程水头损失的基本定义,推求矩形明渠消力池水跃区沿程水头损失与床面阻力系数、水跃共轭水深比、跃前断面宽高比及跃前断面水深的理论关系,提出了矩形明渠水跃区沿程水头损失及其系数和局部水头损失系数的理论公式,给出了沿程水头损失系数、局部水头损失系数和总水头损失系数的简单拟合公式。研究表明:沿程水头损失随着跃前断面水深和床面阻力系数的增大而增大,随着水跃共轭水深比和跃前断面宽高比的增大而减小;局部水头损失系数随着跃前断面弗劳德数的增大而增大;水跃区局部水头损失占比随着弗劳德数的增加而增加,弗劳德数为3时的局部水头损失占比达到90%,弗劳德数为6时的局部水头损失占比已达到95%以上。研究成果可进一步完善并丰富水跃理论体系。     

基于原型观测的输水渠道糙率取值及变化分析

为了研究长距离渠道糙率的合理取值,依据北疆输水工程总干渠2011—2016年逐日水位、流量数据,采用曼宁公式反算典型断面糙率,并构建一维非恒定流水动力模型对渠段糙率进行校核,分析长距离渠道糙率在渠段间的差异及边壁粗糙度随运行时间的变化情况。结果表明:断面的实测糙率与顺直渠段糙率相符,总干渠顺直段糙率在0.015～0.016,弯道明显的渠段,弯度校正因子在1.15～1.50,大小与弯道复杂程度相关;渠道糙率随运行时间呈增长趋势,总干渠等效粗糙度中期运行的年增幅约为18.54%。     

滴灌系统叠片过滤器离散型流道结构水力性能试验及内部流场模拟

为获得叠片流道内部水流流动特性,解决叠片过滤器水头损失较大的弊端,通过室内试验对比了传统叠片过滤器和具有离散型流道结构的叠片过滤器在不同流量下的水头损失,并采用Fluent19.0对清水条件下2种不同流道结构叠片过滤器内部流场分布规律进行数值模拟。结果表明:流道内部流量模拟值与试验设定值最大相对误差为4.8%;随着流量的增大,传统叠片过滤器产生的水头损失更为明显,与传统叠片过滤器相比,离散型流道叠片过滤器产生的水头损失在最大流量下降幅为20.8%;对不同流道进行内部流场分析,得出同一流量下离散型流道的平均过流断面面积大于直线型流道,过流断面面积越大,则流速越小,水头损失也越小,离散型流道内部局部水头损失占主导地位,凸台的离散排列降低了沿程水头损失。研究结果可为叠片流道的设计和结构优化提供参考。     

An environmental flow method applied in small and medium-sized mountainous rivers

In small and medium-sized mountainous rivers, there are usually hydropower stations in upper reaches as well as widened and heightened river sections in downstream reaches that are close to settlements. The environmental flow (EF) ensures river connectivity and the survival of aquatic organisms. The Tennant and wetted perimeter methods were used to calculate the minimum EF, and the R2CROSS criteria were used to evaluate the rationality of hydraulic parameters. The result shows that downstream areas with large cross-sections may suffer from shallow water depths, insufficient wetted perimeters, and poor overall connectivity of the water bodies, even under the standard EF discharges. A novel method was proposed to ensure EF and sustain suitable hydraulic conditions. The minimum EF calculated by the Tennant method is adopted as the design flow, and a small trapezoidal trough channel is excavated on the wide riverbed of an artificial river section. The width and depth of the small channel are calculated with Manning's equation. As a study case, this method was applied in the Fenglingang River in Zhejiang Province of China. A trapezoidal groove with a depth of 0.74 m and a bottom width of 0.52 m was excavated in the center of Fenglingang River to sustain EF and maintain river connectivity. This small channel not only prevents the river from cutoff, but also enables the water depth and wetted perimeter to meet the demand of aquatic organisms.     

Automatic Channel Detection Using DNN on 2D Seismic Data

Geologists interpret seismic data to understand subsurface properties and subsequently to locate underground hydrocarbon resources. Channels are among the most important geological features interpreters analyze to locate petroleum reservoirs. However, manual channel picking is both time consuming and tedious. Moreover, similar to any other process dependent on human intervention, manual channel picking is error prone and inconsistent. To address these issues, automatic channel detection is both necessary and important for efficient and accurate seismic interpretation. Modern systems make use of real-time image processing techniques for different tasks. Automatic channel detection is a combination of different mathematical methods in digital image processing that can identify streaks within the images called channels that are important to the oil companies. In this paper, we propose an innovative automatic channel detection algorithm based on machine learning techniques. The new algorithm can identify channels in seismic data/images fully automatically and tremendously increases the efficiency and accuracy of the interpretation process. The algorithm uses deep neural network to train the classifier with both the channel and non-channel patches. We provide a field data example to demonstrate the performance of the new algorithm. The training phase gave a maximum accuracy of 84.6% for the classifier and it performed even better in the testing phase, giving a maximum accuracy of 90%.     

放电故障紫外检测系统及其状态识别方法

紫外成像检测技术是一种检测高压设备故障的新方法;在此技术上研究设计了一种放电故障紫外检测系统,该系统能对实时采集的紫外图像进行相关的技术处理,同时可对故障点进行准确定位;根据数据建立了设备状态模型并提出一种基于人工神经网络的状态识别方法,应用MATLAB工具进行神经网络的设计和模拟,仿真结果达到预期效果;该系统可以准确地诊断设备的故障和运行状况,有较好运用前景和理论意义。     

Optimal tracking performance of MIMO discrete‐time systems with communication constraints

The optimal tracking problem for multiple‐input multiple‐output linear‐time‐invariant discrete‐time systems with communication constraints in the feedback path is studied in this paper. The tracking performance is measured by the energy of the error signal between the output of the plant and the reference signal. The objective is to obtain an optimal tracking performance, attainable by all possible stabilizing compensators. It is shown that the optimal tracking performance consists of two parts, one depends on the nonminimum phase zeros and zero direction of the given plant, as well as the reference input signal direction, and the other depends on the nonminimum phase zeros, unstable poles, and pole direction of the given plant, as well as the bandwidth and additive white Gaussian noise of the communication channel. It is also shown that, if the constraint of the communication channel does not exist, the optimal tracking performance reduces to the existing tracking performance of the control system without communication constraints. A typical example is given to illustrate the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Usable optimistic fair exchange

Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged.We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return for a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving an O(n) efficiency improvement when n blocks are exchanged between two peers. Our protocol uses very efficient cryptography, making it perfectly suitable for a p-2-p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields up to one-to-two orders of magnitude improvement in terms of both computation and communication (40 s vs. 42 min, 1.6 MB vs. 200 MB). Thus, for the first time, a provably secure (and privacy-respecting when payments are made using e-cash) fair exchange protocol can be used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance.