基于循环维纳滤波的振动信号去噪算法研究

振动信号的去噪需要在滤除噪声的同时尽可能避免相位失真。传统的锐截止低通滤波器或FIR滤波器无法在去噪效果和线性相位之间取得平衡,难以满足振动信号的去噪需求。针对这一问题,将线性相位的维纳滤波算法引入到振动信号的去噪中,并结合振动信号的循环平稳特性,形成了振动信号的循环维纳滤波算法。文中以直接维纳滤波为基础对循环维纳滤波算法的原理进行了深入分析和仿真实现,并基于实测汽轮机振动信号对算法的去噪性能进行了讨论。理论分析及算法仿真表明,循环维纳滤波算法在保证线性相位的前提下有较好的去噪效果,能够解决传统去噪算法所存在的去噪效果与线性相位难以均衡的问题。     

Mobilising information systems scholarship for a circular economy: Review,synthesis, and directions for future research

One of today's grand societal challenges is to replace the current ‘take‐make‐waste’ economic model with a circular economic model that allows a gradual decoupling of economic activities from the consumption of finite virgin resources. While circular economy (CE) scholars have long lauded digital technologies such as sensors, distributed ledgers, or platforms as key enablers, our own community has not fully explored the potentials of information systems (IS) for a CE. Considering recent technological advances in software and hardware and our history of helping address wicked challenges, we believe the time is ripe to mobilise IS scholarship for a CE. Our findings from an interdisciplinary literature review show that research has primarily examined IS potentials for increasing efficiency of isolated intra‐organisational processes while neglecting the larger sustainability potential of IS to establish circular material flows—that is, slow down and close material loops across entire product lifecycles. In response, we propose directions for IS research that develop our knowledge of how IS can help understand and enact circular material flows to intensify and extend use of products and components and recycle waste materials. Our directions offer pathways to building and evaluating the problem‐solution pairing that could characterise a prolific CE‐IS relationship.     

蓝宝石高温光纤压力传感器的设计与仿真

针对高温环境下压力测量需求,提出采用蓝宝石材料来构造适用于特殊环境下的光纤高温法珀压力传感器。基于圆形膜片压力敏感原理设计了传感器敏感单元结构尺寸,通过Comsol有限元软件建立了敏感单元模型,对敏感膜片的表面位移及应力分布情况进行了仿真,验证了传感器设计的可靠性;同时分析了传感器的温敏效应,结果表明随温度升高,传感器的灵敏度会增大,会对压力测量产生误差,约为1.51kPa/℃,上述结果为蓝宝石高温压力传感器的结构和性能优化设计提供了有效指导。     

Specific energy optimization in sawing of rocks using Taguchi approah简

This work aims at selecting optimal operating variables to obtain the minimum specific energy （SE） in sawing of rocks. A particular granite was sampled and sawn by a fully automated circular diamond sawblades. The peripheral speed, the traverse speed, the cut depth and the flow rate of cooling fluid were selected as the operating variables. Taguchi approach was adopted as a statistical design of experimental technique for optimization studies. The results were evaluated based on the analysis of variance and signal-to-noise ratio （S/N ratio）. Statistically significant operating variables and their percentage contribution to the process were also determined. Additionally, a statistical model was developed to demonstrate the relationship between SE and operating variables using regression analysis and the model was then verified. It was found that the optimal combination of operating variables for minimum SE is the peripheral speed of 25 m/s, the traverse speed of 70 cm/min, the cut depth of 2 cm and the flow rate of cooling fluid of 100 mL/s. The cut depth and traverse speed were statistically determined as the significant operating variables affecting the SE, respectively. Furthermore, the regression model results reveal that the predictive model has a high applicability for practical applications.     

一种高增益宽频带圆极化微带阵列天线的研制

针对微带天线阻抗匹配带宽一般较窄的自身缺陷,基于相控阵雷达天线的应用背景,设计了一种工作在X波段的双层圆极化微带天线结构,且优化发现,其各电磁参数良好。为提高其增益,还在此基础上设计并最终制作了双层2×2结构的微带天线阵列,其实测性能与设计值相符,增益达到10.7dB,带宽1.2GHz,相应轴比为4dB,符合圆极化要求。     

Generating planar spiral by geometry driven subdivision scheme

Spirals are curves with one-signed, monotone increasing or decreasing curvature. They are commonly useful in a variety of applications, either for aesthetic or for engineering requirements. In this paper we propose a new iterative subdivision scheme for generating planar spiral segments from two points and their tangent vectors. The subdivision process consists of two main steps, computing new points and adjusting tangent vectors adaptively for each iteration. We categorize this iterative scheme as geometry...     

旋转圆锥网格及其在玻璃/钢结构中的应用

圆锥网格是计算机辅助建筑设计中一类新的平面四边形网格,具有良好的等距性质,非常适用于玻璃/钢结构,而旋转曲面是建筑设计中的常用形状.通过引入旋转圆锥网格的概念,并利用圆锥网格的定义,给出了构造旋转圆锥网格的简单方法.证明了只在旋转曲面r(u,v)=(f(u)cosv,f(u)sinv,g(u))的v参数方向进行均匀分割,而在U参数方向进行任意分割,则所产生的平面四边形网格为圆锥网格;并研究了旋转曲面为圆锥曲面和圆柱曲面的特殊情况;最后给出了基于旋转圆锥网格的玻璃结构造型实例.该方法简单易行,对计算机辅助建筑设计中的玻璃/钢结构造型有一定的实际应用价值.     

Probe compensated single feed circularly polarized fractal‐shaped microstrip antennas

A single feed circularly polarized fractal boundary microstrip antenna with improved axial ratio bandwidth is presented. The low‐axial ratio bandwidth of single feed circularly polarized microstrip antenna is due to its probe reactance. In this article, the inherent disadvantage of this low‐AR bandwidth is overcome by compensating the probe reactance by incorporating capacitance in the form of small patch between the radiating patch and the probe. The perturbation of the patch is done using fractal curve as boundary. The proposed antenna exhibits impedance and axial ratio bandwidths of 9 and 2.2% respectively at 2.4 GHz. © 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.     

GPU加速的圆弧轨迹Katsevich锥束CT重建算法

通过改进GPU的渲染到纹理策略加速锥束反投影计算,提高了圆弧轨迹Katsevich锥束CT重建算法的执行效率.在CPU中完成投影数据的滤波处理,并将其重排为四通道浮点纹理载人GPU内存;绑定2个浮点输出纹理到帧缓冲对象的不同绑定点,用于将渲染结果输出到纹理,并同时完成反投影数据的累加计算;将矩形网格编码为四叉树结构用于加速物体切片的绘制.实验结果表明,文中算法在较大锥角时仍能重建出高质量图像,并获得接近于实时的重建速度.     

Adaptive beam search lookahead algorithms for the circular packing problem

This paper addresses the circular packing problem (CPP), which consists in packing n circles C_i, each of known radius r_i, i∈N={1, …, n}, into the smallest containing circle C. The objective is to determine the radius r of C as well as the coordinates (x_i, y_i) of the center of C_i, i∈N. CPP is solved using two adaptive algorithms that adopt a binary search to determine r, and a beam search to check the feasibility of packing n circles into C when the radius is fixed at r. A node of level ?, ?=1, …, n, of the beam search tree corresponds to a partial packing of ? circles of N into C. The potential of each node of the tree is assessed using a lookahead strategy that, starting with the partial packing of the current node, assigns each unpacked circle to its maximum hole degree position. The beam search stops either when the lookahead strategy identifies a feasible packing or when it has fathomed all nodes. The computational tests on a set of benchmark instances show the effectiveness of the proposed adaptive algorithms.