标准马蹄形断面正常水深的直接近似计算公式

针对目前标准马蹄形断面正常水深计算过程烦琐、公式复杂的缺陷,对标准马蹄形断面均匀流基本方程进行数学变换,根据水工隧洞设计规范的要求和工程实际应用情况确定公式的适用范围,应用拟合优化原理得到标准马蹄形断面正常水深的简捷、实用的计算公式。计算结果表明:在工程常用范围内计算的正常水深最大相对误差为0.585%,整个区间内95%以上的计算点相对误差小于0.20%,精度较高,能够满足工程实践的需要。     

Extracting Microfacet‐based BRDF Parameters from Arbitrary Materials with Power Iterations

We introduce a novel fitting procedure that takes as input an arbitrary material, possibly anisotropic, and automatically converts it to a microfacet BRDF. Our algorithm is based on the property that the distribution of microfacets may be retrieved by solving an eigenvector problem that is built solely from backscattering samples. We show that the eigenvector associated to the largest eigenvalue is always the only solution to this problem, and compute it using the power iteration method. This approach is straightforward to implement, much faster to compute, and considerably more robust than solutions based on nonlinear optimizations. In addition, we provide simple conversion procedures of our fits into both Beckmann and GGX roughness parameters, and discuss the advantages of microfacet slope space to make our fits editable. We apply our method to measured materials from two large databases that include anisotropic materials, and demonstrate the benefits of spatially varying roughness on texture mapped geometric models.     

Physically Meaningful Rendering using Tristimulus Colours

In photorealistic image synthesis the radiative transfer equation is often not solved by simulating every wavelength of light, but instead by computing tristimulus transport, for instance using sRGB primaries as a basis. This choice is convenient, because input texture data is usually stored in RGB colour spaces. However, there are problems with this approach which are often overlooked or ignored. By comparing to spectral reference renderings, we show how rendering in tristimulus colour spaces introduces colour shifts in indirect light, violation of energy conservation, and unexpected behaviour in participating media. Furthermore, we introduce a fast method to compute spectra from almost any given XYZ input colour. It creates spectra that match the input colour precisely. Additionally, like in natural reflectance spectra, their energy is smoothly distributed over wide wavelength bands. This method is both useful to upsample RGB input data when spectral transport is used and as an intermediate step for corrected tristimulus‐based transport. Finally, we show how energy conservation can be enforced in RGB by mapping colours to valid reflectances.     

Path‐space Motion Estimation and Decomposition for Robust Animation Filtering

Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation.     

Designing Camera Networks by Convex Quadratic Programming

In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera‐to‐camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade‐off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real‐world floorplans (garage, hotel, mall, and airport).     

Terrain Modelling from Feature Primitives

We introduce a compact hierarchical procedural model that combines feature‐based primitives to describe complex terrains with varying level of detail. Our model is inspired by skeletal implicit surfaces and defines the terrain elevation function by using a construction tree. Leaves represent terrain features and they are generic parametrized skeletal primitives, such as mountains, ridges, valleys, rivers, lakes or roads. Inner nodes combine the leaves and subtrees by carving, blending or warping operators. The elevation of the terrain at a given point is evaluated by traversing the tree and by combining the contributions of the primitives. The definition of the tree leaves and operators guarantees that the resulting elevation function is Lipschitz, which speeds up the sphere tracing used to render the terrain. Our model is compact and allows for the creation of large terrains with a high level o detail using a reduced set of primitives. We show the creation of different kinds of landscapes and demonstrate that our model allows to efficiently control the shape and distribution of landform features.     

试验训练使能体系结构(TENA)的进展与应用情况

未来的作战与训练概念高度依赖于以网络为中心的作战能力,美国国防部认为迫切需要在试验与训练领域建立一种能克服当前“烟囱式”设计、实现靶场资源之间互操作、重用和可组合的新技术。美军借鉴了多种体系结构的研究和应用成果,构建了试验训练使能体系结构(TENA)。本文对TENA的进展、在美军靶场中的最新应用情况及未来发展方向进行阐述,并描述了针对我国靶场资源现状所带来的启示。该体系结构将为未来开发精细强大的试验和训练系统提供必要的支撑。     

基于GA-BP的移动通信设备故障诊断

针对通信设备故障发生随机性强,影响因素多,对应的故障诊断有高度非线性和不确定性的特点,采用BP神经网络算法,优化的GA-BP神经网络算法和POS-BP神经网络算法分别搭建基站设备故障诊断模型,提取设备故障历史数据进行MATLAB仿真,准确预测设备故障类型,帮助提高代维公司调度管理的智能化水平,提高基站设备运维的执行效率。仿真结果表明：本文的BP,GA-BP和POS-BP神经网络算法都能够实现设备故障类别的预测,且GA-BP神经网络算法相比BP和POS-BP神经网络算法对通信设备故障诊断有更好的适应性。     

基于STM32的建筑物接地电阻检测仪的研制

针对目前建筑物接地电阻检测装置存在的缺陷,提出一种基于STM32的建筑物接地电阻检测的系统方案。该方案根据三极补偿原理,采用嵌入式系统控制的主从机软硬件实现接地电阻的精确测量。检测系统包括交流合成、信号采集和数据处理三部分。检测系统由STM32控制产生频率精度高、波形稳定的交流电流注入接地网,对地网中的电压电流信号经带通滤波、差分放大、同步AD转换、FFT处理得到精确地接地电阻值。本检测系统能够提高检测精度以及检测效率,实现检测工作的智能化。     

C波段无线网络通信技术及在飞行试验遥测中应用构想

在分析国内外C波段无线网络通信研究进展基础上,结合现行飞行试验遥测中遇到的技术瓶颈,提出了将C波段无线网络通信技术应用于飞行试验遥测中的构想,建立基于C波段的无线网络的空地一体化遥测网络体系。C波段空地网络化遥测链路的建立,扩展遥测数据传输可用频段的同时增加上行通道,建立机载网络系统与地面监控网络的网络通信链路,为未来空天地一体化遥测网络的建立建立技术基础;同时利用通用的网络管理流程,对整个测试资源动态配比,提高试飞效率。