基于VRS的GPS网络RTK差分改正方法

为实现网络差分系统的高精度差分定位,利用虚拟参考站技术提出一种网络RTK差分改正信息的生成方法。利用VRS技术建模生成了虚拟参考站的双频伪距观测值、双频载波相位观测值,重点推导了关键的载波相位数据项参数的算法公式,遵循RTCM2.3国际标准协议编码生成了RTCM3、RTCM18、RTCM19号差分改正电文,通过同步实验的方法与标准RTCM相应的主要参数进行了数值对比。实验表明,该方法生成的差分改正信息主要数据项与标准值的误差小于0.04cycle,当被用于GPS网络差分定位时,移动站的平面精度优于5cm.     

基于伪距宽巷组合的GPS模糊度固定方法

中长基线模糊度快速解算是GPS网络差分技术的核心内容。根据网络差分模糊度固定只用于基线解算而不用于定位的特点,通过对常用GPS原始观测数据组合方式的分析,提出伪距宽相组合的数据处理方法,有效消除了电离层、对流层传播误差,形成抗差性强、大气误差自由的GPS组合观测值;在此基础上引入双差伪距宽相组合进行模糊度浮点解并建立法方程,应用高度角与大气误差的关系构造权阵,对常规LAMBDA算法进行了改进,形成一种适合GPS网络差分的中长基线模糊度解算方法。对三个参考站同步观测数据的实际测试结果表明：使用该方法网络模糊度解算时间小于300s,基线长超过60km,并满足闭合性原则。     

基于GPRS的GPS实时差分系统研究与实现

介绍了GPS实时差分系统基本原理及实现过程，提出了基于GPRS的GPS实时差分系统的总体结构；完成了基于GR47的GPRS数据传输模块的硬件和软件设计；实现了服务器软件数据监控及处理功能；采用无缝技术实现GPRS与Internet链接，建立了GPS差分数据传输通道；提出了通讯链路时间延迟的测试方法，分析了过大时间延迟的原因并给出了解决方案。实际测试结果表明：基于GPRS的GPS实时差分系统达到了厘米级定位精度。     

顾及高程差异的网络差分对流层误差内插模型

在GPS网络差分定位技术中,用户站与参考站间的高程差异会引起对流层误差改正数中存在系统性偏差,造成对流层改正精度降低,影响用户定位的效果。在常规两维线性组合模型的基础上,考虑高程因素影响,利用三维位置信息对内插模型参数进行约束,将对流程延迟改正数分为距离相关和高程相关两部分,通过卡尔曼滤波器分别估计,提出了一种能修正高程偏差的对流层三维线性组合模型。以重庆连续运行参考站系统中5个站作为研究对象,实验验证结果表明,在地形起伏较大的地区,三维线性组合模型可将对流层改正精度从20～40 cm提高到5～6 cm,相对于常规方法提高了4～6倍,消除了网络差分定位中高程差引起的对流层改正系统偏差。     

基于射线穿透法的GPU并行阶梯型有限差分网格生成算法

三维大规模有限差分网格生成技术是三维有限差分计算的基础,网格生成效率是三维有限差分网格生成的研究热点。传统的阶梯型有限差分网格生成方法主要有射线穿透法和切片法。本文在传统串行射线穿透法的基础上,提出了基于GPU （graphic processing unit）并行计算技术的并行阶梯型有限差分网格生成算法。并行算法应用基于分批次的数据传输策略,使得算法能够处理的数据规模不依赖于GPU内存大小,平衡了数据传输效率和网格生成规模之间的关系。为了减少数据传输量,本文提出的并行算法可以在GPU线程内部相互独立的生成射线起点坐标,进一步提高了并行算法的执行效率和并行化程度。通过数值试验的对比可以看出,并行算法的执行效率远远高于传统射线穿透法。最后,通过有限差分计算实例可以证实并行算法能够满足复杂模型大规模数值模拟的需求。     

平稳随机振动荷载识别的逆虚拟激励法（二）

本文将逆虚拟激励法（ＩＰＥＭ）用于求解平稳随机振动的荷载谱识别问题，已知部分结构应变（或部分应变及部分位移）响应的自谱与互谱，反求多点激励间的自谱与互谱。     

弹性力学问题的一种新解法

弹性力学问题的一种新解法邹广德，沈玉凤（山东工程学院，淄博２５５０１２）对于弹性力学问题，常常采用边界积分方程的间接解法，将假想作用在边界上的虚拟力作为未知量，故也称虚拟力法。这种方法与边界积分方程的直接解法一样，存在奇异积分，且边界附近精度较低。为...     

基于虚拟节点连接的道路网络模型

利用传统的基于节点连接的道路网络模型来表达真实世界中的道路网络,其存在的缺陷越来越突出,大大降低了导航系统的鲁棒性。为了消除这些缺陷,提出一个新的道路网络模型,即基于虚拟节点连接的道路网络模型;其虚拟节点是汇交路段的各个端点所围成的区域,具有真实道路路口的形状。与传统模型相比,该模型更能表达真实世界道路网络中的交通流,所以它能更好地满足地图匹配理论要求。另外,该模型能很好地表达真实道路路口参数,所以它在交通规划、交通管理和交通流模拟中都有着十分广阔的应用前景。     

虚拟层合单元在平面梁和拱形状优化中的应用

本文在虚拟层合单元的基础上,为适应形状优化时边界变化的特点,构造了曲线分层的虚拟层合梁单元,这样,求解优化问题时仅把特定的层厚作为设计变量,无须改变原始数据结构,有限元网格只在优化初始生成一次即可,具有单元数少、设计变量少的优点,算例表明此法计算简便,结果可靠,具有良好的工程应用前景。     

基于附加虚拟质量的结构损伤识别方法

针对大型土木结构的模态信息往往对局部损伤灵敏度较低的特点,提出通过在各个子结构上附加虚拟质量的方法提高局部灵敏度,实现整体结构的准确损伤识别。该方法无需在结构上布置真实质量,它首先利用虚拟变形法（VDM）可进行结构快速重分析的思想,由实测结构的激励和加速度响应,构造结构附加虚拟质量后虚拟结构的频率响应;然后结合灵敏度分析和附加质量与频率关系,确定所需附加质量和对应具有较高灵敏度的频率;最后分别在每个子结构上附加虚拟质量,联合所有虚拟结构和对应的频率即可准确快速地识别出整体结构各个子结构的损伤。本文通过两层平面框架有限元模型验证了附加质量损伤识别方法的有效性。     

Adaptive neural network control of bilateral teleoperation with constant time delay

This paper proposes a novel approach for bilateral teleoperation systems with a multi degrees-of-freedom (DOF) nonlinear robotic system on the master and slave side with constant time delay in a communication channel. We extend the passivity based architecture to improve position and force tracking and consequently transparency in the face of offset in initial conditions, environmental contacts and unknown parameters such as friction coefficients. The proposed controller employs a stable neural network on each side to approximate unknown nonlinear functions in the robot dynamics, thereby overcoming some limitations of conventional controllers such as PD or adaptive controllers and guaranteeing good tracking performance. Moreover, we show that this new neural network controller preserves the control passivity of the system. Simulation results show that NN controller tracking performance is superior to that of conventional controllers.     

软件系统的复杂网络研究进展

互联网给软件带来了革命性的转变------软件网络化,这种趋势使软件作为全局性的资源,以网络为媒介向大众用户提供各种信息资源的应用服务.软件的计算模式、应用模式、产品形态以及盈利模式都会发生很大的变化,例如今后软件的应用方式就像打电话一样, 通过网络租用软件来实现.网络化软件正会成为联接各种网络资源、数据资源、计算资源的核心,成为数据和数据交换的基础. 同时, 网络化软件系统也将成为复杂系统,而复杂性也是软件开发困难、质量难以保证的关键.软件工程是将系统化、规范化、可度量的方法应用于软件的开发、运行和维护.复杂网络理论的最新研究成果,为复杂系统的软件工程提供了新的数学基础和方法. 分析了软件的复杂性,介绍了复杂网络与软件复杂性结合的研究工作,包括软件系统的拓扑特性、形成机理、演化规律以及软件复杂性度量和评估,对软件网络的研究现状进行了小结, 并列举了需要进一步研究的问题.提出软件网络观(软件在网络中生长、可以用网络来刻画软件)将有助于我们深入理解和认识软件的复杂性本质.      

Multi‐stage high order semi‐Lagrangian schemes for incompressible flows in Cartesian geometries

Efficient transport algorithms are essential to the numerical resolution of incompressible fluid‐flow problems. Semi‐Lagrangian methods are widely used in grid based methods to achieve this aim. The accuracy of the interpolation strategy then determines the properties of the scheme. We introduce a simple multi‐stage procedure, which can easily be used to increase the order of accuracy of a code based on multilinear interpolations. This approach is an extension of a corrective algorithm introduced by Dupont & Liu (2003, 2007). This multi‐stage procedure can be easily implemented in existing parallel codes using a domain decomposition strategy, as the communication pattern is identical to that of the multilinear scheme. We show how a combination of a forward and backward error correction can provide a third‐order accurate scheme, thus significantly reducing diffusive effects while retaining a non‐dispersive leading error term. Copyright © 2016 John Wiley & Sons, Ltd.     

时滞耦合系统非线性动力学的研究进展

随着对自然界客观规律的深入认识,工程系统设计的精细化和复杂性要求也与日剧增.在许多耦合的动态系统设计过程中要考虑由耦合过程的时滞所引发的动力学行为,该时滞来自于与传感系统、作动系统和控制系统耦合的过程.耦合时滞也广泛存在于交通、系统生物学、电子通讯、神经和信息网络等技术中.本文首先从耦合时滞出发,在以时滞为中心的耦合系统复杂动力学机制、时滞镇定耦合系统的实验基础和实现、快慢变时滞耦合系统动力学和时滞神经网络同步和去同步4个方面,对耦合时滞诱发的动力学研究进展进行综述.着重介绍了时滞耦合系统中耦合时滞诱发的高余维分岔奇异性及新的定量分析方法、中立型时滞微分方程的规范型计算、具有耦合时滞的非线性系统中耦合时滞和非线性参数的辨识方法与实验实现、快慢变时滞耦合系统的张弛振荡、耦合时滞诱发的网络系统的同步模式切换等问题的研究进展;然后在应用方面重点介绍了车床磨削加工过程中耦合时滞诱发的颤振及其机理、具有惯性项和耦合时滞的神经网络系统中耦合时滞诱发的高余维分岔和复杂动力学、时滞动力吸振器与隔振装置的设计与实验实现.最后,从耦合时滞系统的一般性理论和工程应用两个方面展望了近期值得关注的一些问题.     

综合船桥系统的体系结构和信息流程设计

综合船桥系统是实施船舶导航和控制的集成系统,它通过相互连接以集中使用来自工作站的传感器信息、命令或控制以提高操作人员管理船舶的安全性和效率。分析了国外典型综合船桥系统的设备配置,研究了综合船桥系统的工作过程,分析了综合船桥系统的体系结构,在此基础上,提出了基于多功能台的综合船桥系统的体系结构和完全由标准组件组成的综合船桥系统的网络布局、设计了综合船桥系统的接口和信息流程。     

Linking Morphology of Porous Media to Their Macroscopic Permeability by Deep Learning

Flow, transport, mechanical, and fracture properties of porous media depend on their morphology and are usually estimated by experimental and/or computational methods. The precision of the computational approaches depends on the accuracy of the model that represents the morphology. If high accuracy is required, the computations and even experiments can be quite time-consuming. At the same time, linking the morphology directly to the permeability, as well as other important flow and transport properties, has been a long-standing problem. In this paper, we develop a new network that utilizes a deep learning (DL) algorithm to link the morphology of porous media to their permeability. The network is neither a purely traditional artificial neural network (ANN), nor is it a purely DL algorithm, but, rather, it is a hybrid of both. The input data include three-dimensional images of sandstones, hundreds of their stochastic realizations generated by a reconstruction method, and synthetic unconsolidated porous media produced by a Boolean method. To develop the network, we first extract important features of the images using a DL algorithm and then feed them to an ANN to estimate the permeabilities. We demonstrate that the network is successfully trained, such that it can develop accurate correlations between the morphology of porous media and their effective permeability. The high accuracy of the network is demonstrated by its predictions for the permeability of a variety of porous media.

     

On-line pseudo-dynamic network testing on base-isolated bridges using Internet and wireless Internet

In this paper we present the results of the online pseudo-dynamic network testing using the Internet that were jointly conducted by several institutions in Korea and Japan. Example studies were performed on base-isolated bridges with four continous spans. Test facilities located at several institutions were interactively used to test the non-linear behaviors of the base isolators. At first, a series of international network tests was carried out between Japan and Korea, and the performance of two system configurations with different data communication schemes was compared. Then, network tests were repeated on a similar bridge structure between two institutions in Korea, and the overall performance was discussed. A web-based Java monitoring system was developed for checking the partners' testing conditions and for sharing the test results with the authorized observers. Wireless Internet technology using mobile phones was also investigated. The results indicate that the time to execute a single step varies widely, depending on the data communication/sharing schemes and the testing hardware, e.g., 0.2–15 s for data communication and 1–10 s for execution of the pseudo-dynamic tests for each time-step. The time required additionally for data communication in the on-line network testing is judged as reasonable in comparison with the time for the pseudo-dynamic test. The results also show that the wireless communication is very attractive for on-line network testing, owing to the mobility and Internet security.     

WiFi assisted NAT traversal scheme for surveillance patrol robot

With the advances in wireless communication technology and artificial intelligence, robots are gradually being introduced as part of our life. Previous research proposed a SIP-enabled Surveillance Patrol Robot (SSPR), which tracks a moving object actively and informs the householder of such security alarm. However, the underlying signaling protocol for communication and data streams suffer from the network address translation (NAT) traversal problem as most peer-to-peer (P2P) applications. NAT is a commonly adopted technique to share one public IPv4 address among several hosts located behind a NAT device for alleviating the exhaustion of IPv4 address. NAT devices typically block session requests originating from outside, prevent the establishment of peer-to-peer (P2P) sessions and cause NAT traversal problem. This study proposes WANTS, a WiFi Assisted NAT Traversal Scheme for SSPR. When SSPR is activated, it retrieves the topology information from a server to choose the candidate access point (AP) for handoff. Then SSPR uses the collected network context information to assist its NAT traversal procedure after handoff. Experimental results confirm that WANTS reduces not only connectivity check delay but also protocol messages as compared to the Interactivity Connectivity Establishment (ICE), which is the most acknowledged approach to creating a session across NATs.     

Pinning adaptive synchronization of complex dynamical network with multi-links

Networks with multi-links are universal in the real world such as communication networks, transport networks, and social networks. It is important for us to investigate the control of complex dynamical network with multi-links. In this paper, both local and global stabilities of dynamical network with multi-links are analyzed by applying adaptive control theory and mathematical tools, and some new criteria are proposed to ensure the pinning synchronization. We find that the number of pinned nodes satisfies an inequality for synchronization. Additionally, we solve the problem of how much the coupling strength we need to achieve network synchronization with one pinned node in the network system with multi-links. Finally, numerical examples are used to illustrate the effectiveness of the proposed method.     

Portable data‐parallel surface reconstruction on a uniform rectilinear grid

With the increasing heterogeneity and on‐node parallelism of high‐performance computing hardware, a major challenge is to develop portable and efficient algorithms and software. In this work, we present our implementation of a portable code to perform surface reconstruction using NVIDIA's Thrust library. Surface reconstruction is a technique commonly used in volume tracking methods for simulations of multimaterial flow with interfaces. We have designed a 3D mesh data structure that is easily mapped to the 1D vectors used by Thrust and at the same time is simple to use and uses familiar data structure terminology (such as cells, faces, vertices, and edges). With this new data structure in place, we have implemented a piecewise linear interface reconstruction algorithm in 3 dimensions that effectively exploits the symmetry present in a uniform rectilinear computational cell. Finally, we report performance results, which show that a single implementation of these algorithms can be compiled to multiple backends (specifically, multi‐core CPUs, NVIDIA GPUs, and Intel Xeon Phi processors), making efficient use of the available parallelism on each. We also compare performance of our implementation to a legacy FORTRAN implementation in Message Passing Interface (MPI) and show performance parity on single and multi‐core CPU and achieved good parallel speed‐ups on GPU. Our research demonstrates the advantage of performance portability of the underlying data‐parallel programming model.