基于OpenGL技术的集装箱仿真系统的研究与开发

对靠近海岸线的物流园区集装箱堆场进行研究,发现台风或大风经常造成集装箱吹落或倾覆,这样造成很大的经济损失.研究利用VC和OpenGL开发一个可视化的集装箱仿真系统,该系统通过气象部门所提供的风速,能够预测物流园区中的集装箱是否安全.系统使用OpenGL中的纹理映射和视点变换,并以一种直观的、可视化的方式呈现给现场操作人员.现场操作人员可以根据系统的提示信息,在台风来临之前对将会被台风吹落的集装箱做好加固措施,以达到减小经济损失的目的.     

视频图像在三维模型中的渲染

视频监控是大型安防工作中最重要的一个环节,传统的视频监控系统展示给用户的只是独立的二维平面图像,图像脱离环境,整体性不足,为了解决该问题,提出了将视频图像渲染显示于三维模型的思路.研究了纹理映射技术并结合视频图像渲染的特殊性分析研究了Z缓冲算法、Shadow map算法,根据实际应用提出Extend Shadow map算法以实现将视频图像与三维场景无缝贴合.实验结果表明,视频图像渲染显示于三维模型中所体现的优越性.     

基于DSOF的网格资源发现模型研究

为了解决传统资源发现机制不能很好地适应网格资源环境的问题,在有效组建网格资源虚拟组织的基础上,提出了资源虚拟组织中联系结点的选取原则和选取算法,通过该算法从具有相同资源类型的联系结点中选出管理结点.联系结点和管理结点之间采用类似二部图的方式进行连接,构成基于动态自组织覆盖架构的网格资源发现模型.从资源发现能力、资源发现效率和系统可扩展性等方面对该模型进行了综合评价,结果显示该模型适合网格资源的特征,在大规模网格系统中能够有效提高资源发现性能,仿真实验验证了该模型的有效性.     

悬索桥主缆初应力对桥梁动力特性的影响

为掌握主缆初应力对桥梁动力特性的影响,以悬索桥为例,采用静力非线性分析方法计算应力变化过程中悬索桥的跨中挠度、缆索轴力及加劲梁的轴力变化;将得到的内力作为结构的预加应力进行有预应力的模态分析. 应用ANSYS软件进行分析,其中有限元建模时采用4种单元类型:空间梁单元BEAM4用于模拟加劲梁和塔;空间杆单元LINK10用于模拟主缆及吊杆;通过设定BEAM4和LINK10单元初应变进行有预应力的模态分析;采用MASS21单元模拟横隔板、吊杆锚固装置和桥面上的栏杆,并分别考虑质量和质量惯性矩的作用. 分析表明,悬索桥主梁竖弯振动频率受主缆初应力的影响较大,而侧弯振动频率和扭转振动频率受此影响较小. 该结果为同类桥梁的动力特性分析提供参考.     

低成本的UTRV三维可视化仿真测试系统设计

相对于常规飞行器,倾转旋翼飞行器原本就对飞控系统有着更高的要求,而其无人化后的产品UTRV(无人倾转旋翼飞行器)对此的需要还要更上一层楼.为了满足开发UTRV飞控系统的需要,有必要开发更加方便的飞控系统仿真测试环境.使用现有货架商品构建了一套UTRV三维可视化仿真测试系统.系统内含可调整的UTRV全飞行包线非线性气动模型,用于提供控制律开发和动态仿真;系统可以方便的替换飞控模块程序进行仿真实验,以此验证控制律;同时,仿真实验全程数据以直观的实时三维视觉仿真方式显示,有利于发现飞控系统缺陷.使用货架商品还大大降低了成本,非常适合中小研究所和大学使用.     

水下刚性壁装药爆炸气泡简化模型和数值仿真

为预测沉底装药水下爆炸产生气泡的最大半径和脉动周期,建立了水下刚性壁上的装药爆炸产生气泡的动力学模型.从Bernoulli方程和能量守恒两个角度推导出描述半球形气泡径向运动的流体动力学方程,通过能量法确定了方程的初始条件.对方程数值求解得到第一脉动周期内气泡半径和径向运动速度随时间变化的曲线.利用ANSYS-AUTODYN软件的高精度Euler-Godunov求解器和计算结果映射技术,建立了水下刚性壁上装药爆炸产生气泡运动的数值仿真模型.计算得到了气泡膨胀、收缩、上浮和脉动压力时程曲线及其几何形状变化规律.理论模型与仿真计算得到的气泡半径、脉动周期和径向运动速度均吻合,说明该理论模型满足工程所需精度要求.     

Analogy and duality of texture analysis by harmonics or indicators

According to the classic harmonic approach, an orientation density function (odf)f is expanded into its corresponding Fourier orthogonal series with respect to generalized spherical harmonics, and a pole density function (pdf) into its corresponding Fourier orthogonal series with respect to spherical harmonics. While pdfs are even (antipodally symmetric) functions, odfs are generally not. Therefore, the part of the odf which cannot be determined from normal diffraction pdfs can be mathematically represented as the odd portion of its series expansion. If the odff is given, the even part can be mathematically represented explicitly in terms off itself. Thus, it is possible to render maps ofharmonic orientation ghosts, and to evaluatevariants of mathematical standard odfs resulting in identical pdfs independent of pdf data. However, if only normal diffraction pdfs are known, the data-dependentvariation width of feasible odfs remained unaccessible, and within the harmonic approach a measure of confidence in a solution of the pdf-to-odf inversion problem does not exist.According to any discrete approach, an odff defined on some setG of orientations is expanded into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofG, and a pdf defined on the upper (lower) unit hemisphereS ₊ ^{3 3} into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofS ₊ ³ . The ambiguity of the pdf-to-odf inversion problem is discussed in terms of column-rank deficiency of the augmented projection matrix. The implication of the harmonic approach to split an odf into auniquely determined and anundetermined part does no longer seem to be reasonable. However, it is possible to numerically determine data-dependent confidence intervals for the Fourier coefficients with respect to the indicator functions which can be immediately interpreted as mean orientation densities within the elements of the partition ofG. Doing so for all Fourier coefficients in the finite series expansion, i.e. for all elements of the partition of the setG, eventually results in the data-dependent variation width of odfs feasible with respect to given pdf data, and to the partitions ofG andS ₊ ³ .Thus it is confirmed that the appearance of orientation ghosts, in particular correlations oftrue andghost orientation components, depends on the representation of an odf. It may be questioned whether in practical applications the implicit assumption of the harmonic method that the even part can be determined uniquely and free of error is generally a reasonable initial condition to develop ghost correction procedures.     

Supervisory control using variable lookahead policies

This paper deals with the efficient on-line calculation of supervisory controls for discrete event systems (DES's) in the framework of limited lookahead control policies (or LLPs) that we introduced in previous papers. In the LLP scheme, the control action after a given trace of events has been executed is calculated on-line on the basis of anN-step ahead projection of the behavior of the DES. To compute these controls, one must calculate after the execution of each event the supremal controllable sublanguage of a finite language with respect to another finite larger language. In our previous work, we showed how the required supremal controllable sublanguage calculation can be performed by using a backward dynamic programming algorithm over the nodes of the tree representation of these two languages. In this paper, we pursue the same approach for the calculation of LLP controls, but instead we adopt a forward calculation procedure over theN-level tree of interest. This forward procedure improves upon previous work by avoiding the explicit consideration of all the nodes of theN-level tree, while still permitting tree-to-tree recursiveness as enabled events are executed by the system. The forward search ends whenever a control decision can be made unambiguously or whenever the boundary of theN-level tree is reached, whichever comes first. This motivates the name Variable Lookahead Policy (or VLP) for this implementation of the LLP supervisory control scheme. This paper presents a general VLP algorithm and studies the properties of several special cases of it. The paper also discusses the implementation of the VLP algorithms and presents computational results regarding the application of these algorithms to a time-varying DES.     

考虑EV充放电意愿的园区综合能源系统双层优化调度

随着电动汽车的普及度越来越高,工业园区的电动汽车用户日益增多,其充放电行为对园区综合能源系统规划和运行带来极大挑战。本文提出了考虑电动汽车充放电意愿的园区综合能源系统双层优化调度。首先基于动态实时电价、电池荷电量、电池损耗补偿、额外参与激励等因素建立充放电意愿模型,在此基础上得到改进的电动汽车充放电模型;然后,以园区综合能源系统总成本最小和电动汽车充电费用最小为目标建立双层优化调度模型,通过KKT条件将内层模型转化为外层模型的约束条件,从而快速稳定的实现单层模型的求解;最后,进行仿真求解,设置3种不同场景,对比了所提模型与一般充放电意愿模型,验证了文中所提引入EV充放电意愿模型的园区综合能源系统双层优化调度的有效性和可行性,具有一定的经济效益。     

Horizontal Voting Ensemble Based Predictive Modeling System for ColonCancer

Colon cancer is the third most commonly diagnosed cancer in the world. Most colon AdenoCArcinoma (ACA) arises from pre-existing benign polyps in the mucosa of the bowel. Thus, detecting benign at the earliest helps reduce the mortality rate. In this work, a Predictive Modeling System (PMS) is developed for the classification of colon cancer using the Horizontal Voting Ensemble (HVE) method. Identifying different patterns in microscopic images is essential to an effective classification system. A twelve-layer deep learning architecture has been developed to extract these patterns. The developed HVE algorithm can increase the system’s performance according to the combined models from the last epochs of the proposed architecture. Ten thousand (10000) microscopic images are taken to test the classification performance of the proposed PMS with the HVE method. The microscopic images obtained from the colon tissues are classified into ACA or benign by the proposed PMS. Results prove that the proposed PMS has ~8% performance improvement over the architecture without using the HVE method. The proposed PMS for colon cancer reduces the misclassification rate and attains 99.2% of sensitivity and 99.4% of specificity. The overall accuracy of the proposed PMS is 99.3%, and without using the HVE method, it is only 91.3%.