Testing of dynamically substructured,base‐isolated systems using adaptive control techniques

Experimental techniques for testing dynamically substructured systems are currently receiving attention in a wide range of structural, aerospace and automotive engineering environments. Dynamic substructuring enables full‐size, critical components to be physically tested within a laboratory (as physical substructures), while the remaining parts are simulated in real‐time (as numerical substructures). High quality control is required to achieve synchronization of variables at the substructuring interfaces and to compensate for additional actuator system(s) dynamics, nonlinearities, uncertainties and time‐varying parameters within the physical substructures. This paper presents the substructuring approach and associated controller designs for performance testing of an aseismic, base‐isolation system, which is comprised of roller‐pendulum isolators and controllable, nonlinear magnetorheological dampers. Roller‐pendulum isolators are typically mounted between the protected structure and its foundation and have a fundamental period of oscillation far‐removed from the predominant periods of any earthquake. Such semi‐active damper systems can ensure safety and performance requirements, whereas the implementation of purely active systems can be problematic in this respect. A linear inverse dynamics compensation and an adaptive controller are tailored for the resulting nonlinear synchronization problem. Implementation results favourably compare the effectiveness of the adaptive substructuring method against a conventional shaking‐table technique. A 1.32% error resulted compared with the shaking‐table response. Ultimately, the accuracy of the substructuring method compared with the response of the shaking‐table is dependent upon the fidelity of the numerical substructure. Copyright © 2009 John Wiley & Sons, Ltd.     

抛物Radon变换法近偏移距波场外推

本文给出了抛物Radon变换的基本原理,以及部分动校正后的CMP道集抛物线近似有效性的证明,基于带限正反最小平方抛物Radon变换的Levinson递推算法,对缺失的近偏移距地震波场进行叠前重建和外推.给出了抛物Radon变换法地震道重建外推的基本原理和叠前地震数据规则化的处理流程,另外对于Radon域均匀采样的情形,本文给出了均匀层状介质和Marmousi模型的近偏移距外推结果,计算结果验证了算法的稳定性和适用性.     

姜寨一期文化遗迹属性数据的关联规则挖掘研究

在基于Apriori算法的单维布尔关联规则基础上,以姜寨遗址主要遗迹的属性数据为研究对象,利用该算法对姜寨一期文化遗迹的属性数据进行了关联挖掘分析。首先进行房屋遗迹属性的关联挖掘,然后进行土坑葬等的属性数据挖掘,找到了聚落遗址属性数据之间隐含的关系,为聚落考古遗址的资料分析提供了一种新技术。     

投影寻踪门限回归模型在年径流预测中的应用

为预测年径流这类同维复杂动力系统，提出了投影寻踪门限回归（PPTR）模型。构造了新的投影指标函数，用门限回归（TR）模型描述投影值与预测对象间的非线性关系，并用实码加速遗传算法优化投影指标指数函数和TR模型参数。实例的计算结果表明，用PPTR模型预测年径流是可行而有效的。PPRT模型简便、适用性强，克服了目前投影寻踪方法计算量大、编程实现困难的缺点，有利投影寻踪方法的推广应用，为解决高维非线性复杂预测问题提供了新途径。     

Emissions of Volatile Organic Compounds from Sunflower and Beech: Dependence on Temperature and Light Intensity

Emissions of volatile organic compounds (VOCs) from sunflower (Helianthus annuus L. cv. giganteus) were measured in a continuously stirred tank reactor. The compounds predominantly emitted from sunflower were: isoprene, the monoterpenes -pinene, -pinene, sabinene, 3-carene and limonene, an oxygenated terpene, not positively identified so far and the sesquiterpene -caryophyllene. Emission rates ranged from 0.8 x 10^–16 to 4.3 x 10 ^–15 mol cm^–2 s^–1 at a temperature of 25°C and at a light intensity of 820 µEm^–2 s^–1. A dependence of the emission rates on temperature as well as on light intensity was observed. The emission rates of -pinene, sabinene and thujene from beech (Fagus sylvatica L.) were also affected by temperature as well as by light intensity. Our results suggest that an emission algorithm for all compounds emitted from sunflower and beech has to consider temperature and light intensity simultaneously. The observations strongly indicate that the emissions of VOCs from sunflower and beech are in part closely coupled to the rate of biosynthesis and in part originate from diffusion out of pools. The emission rates can be described by an algorithm that combines the model given by Tingey and coworkers with the algorithm given by Guenther and coworkers after slight modification.     

基于C4.5决策树算法的道路结冰预报模型构建及应用

道路结冰是气象上规定的主要灾害性天气之一,准确认识道路结冰发生规律并科学有效地预报是防灾减灾的关键问题。以影响道路结冰的日积雪深度、日最低气温、日降水量等气象要素为主要因子,将是否结冰抽象成二元分类问题,借助数据挖掘中C4.5决策树算法进行分类分析,得到便于预报员使用的预报道路结冰规则集。在实验部分,选取2004—2013年连云港和嘉定为例,用前8 a的连云港(嘉定)地区道路结冰数据样本进行分类规则的学习,从而得到适合连云港(嘉定)地区的4(3)条预报道路结冰规则集,然后用剩下2 a的数据进行检验,准确率高达96.82%(94.87%)。实验表明采用C4.5决策树算法构建的道路结冰预报模型不仅预报准确率高、易解释、方便预报员直接使用,而且预报规则与道路结冰现象的天气过程及理论一致。     

不同闪电跃增算法在北京地区应用效果对比

基于S波段多普勒天气雷达基数据、北京闪电定位网全闪定位数据和北京地区降雹的人工观测结果,对比分析Gatlin和σ两种闪电跃增算法在不同配置下对北京地区2015—2018年共177次冰雹天气过程的预警效果。结果表明：不同倍数的σ算法预警结果差别很大,2σ（要求当前闪电频数变化率超过之前平均闪电频数变化率两倍标准差）在σ算法中的预警效果最佳;不同N（总闪频数变化率的数量）配置下的Gatlin算法的预警结果差别不大,其中当N=6时的预警效果最佳。2σ算法的命中率、虚警率和临界成功指数分别为80.2%,41.6%和51.1%,N=6的Gatlin算法的相应结果分别为82.5%,62.0%和35.2%。另外,详细分析了一次多单体雷暴过程和一次飑线过程中两种算法的应用情况,结果也表明Gatlin算法比2σ算法的命中率略高,但虚警率偏高很多,临界成功指数偏低。综合Gatlin算法和σ算法对冰雹预报结果评估情况,发现2σ闪电跃增算法更适于对北京冰雹天气的预警,对提升闪电数据在北京地区冰雹预报业务的可用度有一定参考价值。     

探空仪湿度测量误差研究现状及其对云识别的影响

云在地球系统能量平衡和水循环中扮演着至关重要的作用,其特征的准确获取对于理解大气物理过程、改进天气和气候模拟具有重要意义。地基云遥感反演是了解云特征、评估卫星云观测能力的重要手段。自20世纪80年代以来,地基云遥感反演获得快速发展,各种地基云遥感反演方法涌现,在2010年前后达到一个相对瓶颈期,已有的地基云遥感反演方法有几十种之多。从遥感手段上来说,地基云遥感包括主动遥感和被动遥感。从遥感对象上来说,地基云遥感包括宏观特征遥感反演和微观特征遥感反演。就宏观特征来说,可以分为三个类别：云识别或云量的探测方法、云边界的确定方法以及云相态的反演方法。就微观特征来说,地基云遥感反演方法基本分为两大类型,最优化求解法和经验参数化方法。任何一种云遥感反演方法都有其相对优势和不足,对其进行b了总结归纳,论述地基云遥感反演的进展。不同地基云遥感反演产品直接存在着巨大差异,远大于单个遥感反演方法所给定的不确定性信息,表明现有地基云遥感反演仍然存在巨大挑战,归纳提出了云遥感反演中存在的若干挑战,以期为未来云遥感的发展提供了方向参考。

     

基于陆路交通网的空间通达性分析——以兰州-西宁城市区域为例

以兰州-西宁城市区域交通路网为例,基于空间句法模型、日常可达性模型和等时圈通过特征点算法,试图运用GIS技术将节点、轴线和域面结合起来对通达性进行全面阐述,多视角综合测度区域路网通达性的空间格局。研究结果表明:1.区域路网体系较为完善,路网线段集聚相对明显;线段式空间伸展格局呈"点-轴"状,轴线式空间伸展格局呈"干-枝"状,初步形成核心、过渡、外围三大等级圈层以及"X"字型路网骨架,区域交通运输与城镇发展水平表现出较强的共轭协同发展关系。2.等时圈沿国道、省道、县道扩散表现连续,沿封闭铁路、高速公路扩散出现跳跃,其等时圈空间特征多呈现"枝-叶"状。城镇日常可达性在较大程度上取决于区域中心性、周边路网发达程度和城镇密集程度,区域路网单中心极化现象比较明显,兰州市对整个区域路网的控制作用较为突出。3.区域通达度空间分布各异,核心板块破碎而外围板块连片。区域通达性差异极其显著,出现极高值区和极低值区;兰州与西宁通达度中高值区出现断裂,区域南部通达度极低值区连片成带。因此,应当构建兰州地区绕城高速和环状路网,实现路网交通的适度分流;加快兰州-西宁高等级快速交通建设,推进兰州-西宁区域一体化进程;建设兰成铁路和兰州至云南磨憨口岸高速通道,培育临夏为南部区域性中心城市。     

Finding shortest paths on real road networks: the case for A*

The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is as efficient as possible. Based upon past research, it is generally accepted that several efficient implementations of the Dijkstra algorithm are the fastest at optimally solving the ‘one‐to‐one’ shortest path problem (Cherkassky et al. 1996 Cherkassky, B. V., Goldberg, A. V. and Radzik, T. 1996. Shortest paths algorithms: theory and experimental evaluation.. Mathematical Programming: Series A and B, 73: 129–174. [Crossref], [Web of Science ®] , [Google Scholar]). We show that the most efficient state‐of‐the‐art implementations of Dijkstra can be improved by taking advantage of network properties associated with GIS‐sourced data. The results of this paper, derived from tests of different algorithmic approaches on real road networks, will be extremely valuable for application developers and researchers in the GIS community.