软基上弹性基础板简化分析方法及适用性

软土地基上水闸、泵站底板的结构计算通常采用＂截条法＂简化成平面应变问题考虑,这种简化分析结果不能完全表征底板的受力特性。本文对半无限空间上不同基础模量条件下不同长宽比的弹性基础板的受力变形特性用半解析有限元法进行了分析,同时进行了相同力学参数条件下的平面应变分析。两者比较表明：当基础板两个方向长度相当时,用平面问题求解得到的最大拉应力比按空间问题求解得到的结果大33%。同时随着地基刚度的加大,增大的比值也加大。     

XMobile: A MB-UID environment for semi-automatic generation of adaptive applications for mobile devices

Ubiquitous Computing promises seamless access to information anytime, anywhere with different and heterogeneous devices. This kind of environment imposes new challenges to software development. For example, information and user interface should be adapted according to contextual characteristics such as user, environment, and access device. In case of device adaptation, the development challenge is related to the heterogeneity of the devices, which requires software engineers to create different versions for each type of device and every platform. This paper proposes a MB-UID (model-based user interface development) approach for semi-automatic generation of adaptive applications for mobile devices. An environment, called XMobile, offers a device-independent user interface framework and a code generation tool for providing fast development of multi-platform and adaptive applications according to device and platform features. A case study is also presented to illustrate how the environment can be used for constructing an application for heterogeneous devices with different network connectivity modes.     

基于模糊理论的椒盐噪声滤波算法

针对图像中的椒盐噪声,基于模糊理论设计了一种滤波算法。首先结合椒盐噪声特点,借助窗口进行噪声检测,其次设计了自适应的方法消除噪声,最后采用图像进行实验,定性和定量分析结果表明该方法对于椒盐噪声的消除可行有效。     

具有深度自适应估计的视觉伺服优化

在手眼机器人视觉伺服中,如何确定机器人末端摄像机移动的速度和对物体的深度进行有效的估计还没有较好的解决方法.本文采用一般模型法,通过求解最优化控制问题来设计摄像机的速度,同时,利用物体初始及期望位置的深度估计值,提出了一种自适应估计的算法对物体的深度进行估计,给出了深度变化趋势,实现了基于图像的定位控制.该方法能够使机器人在工作空间范围内从任一初始位置出发到达期望位置,实现了系统的全局渐近稳定且不需要物体的几何模型及深度的精确值.最后给出的仿真实例表明了本方法的有效性.     

ADALINE based robust control in robotics: a Riemann-Liouville fractional differintegration based learning scheme

This paper presents an approach to improve the performance of intelligent sliding model control achieved by the use of a fundamental constituent of soft computing, named Adaptive Linear Element (ADALINE). The proposed scheme is based on the fractional calculus. A previously considered tuning scheme is revised according to the rules of fractional order differintegration. After a comparison with the integer order counterpart, it is seen that the control system with the proposed adaptation scheme provides (1) better tracking performance, (2) suppression of undesired drifts in parameter evolution and (3) a very high degree of robustness and insensitivity to disturbances. The claims are justified through some simulations utilizing the dynamic model of a two degrees of freedom (DOF) direct drive robot arm and overall, the contribution of the paper is to introduce the fractional order calculus into a robust and nonlinear control problem with some outperforming features that are absent when the integer order differintegration operators are adopted.     

Improved sparsity adaptive matching pursuit algorithm based on compressed sensing

Traditional greedy algorithms need to know the sparsity of the signal in advance, while the sparsity adaptive matching pursuit algorithm avoids this problem at the expense of computational time. To overcome these problems, this paper proposes a variable step size sparsity adaptive matching pursuit (SAMPVSS). In terms of how to select atoms, this algorithm constructs a set of candidate atoms by calculating the correlation between the measurement matrix and the residual and selects the atom most related to the residual. In determining the number of atoms to be selected each time, the algorithm introduces an exponential function. At the beginning of the iteration, a larger step is used to estimate the sparsity of the signal. In the latter part of the iteration, the step size is set to one to improve the accuracy of reconstruction. The simulation results show that the proposed algorithm has good reconstruction effects on both one-dimensional and two-dimensional signals.     

Dual geometric perception for cross-domain road segmentation

Road segmentation plays an important role in navigation systems and autonomous driving. However, many methods in road segmentation are based on supervised learning and suffer from performance degradation in the real world. There is a certain domain gap (distribution shift problem) between the source domain (training data) and the target domain (testing data). In this paper, we propose a Dual-Geometric Perception (DGP) approach for cross-domain road segmentation, which jointly uses semantic and dual-geometric information to learn the domain-invariant feature for road segmentation. First, we propose an RGB-N dual stream network structure, which effectively fuses normal vector information and RGB information to reduce domain gap. Moreover, a dual geometric adversarial learning strategy is proposed to utilize depth-aware and normal vector features to perform better domain alignment. Furthermore, a self-training learning strategy is used to further improve the model’s generalizability in the target domain. Extensive experiments demonstrate that our proposed DGP achieves superior performance on lane-to-lane and lane-to-sidewalk road domain adaptation tasks.     

基于改进的GABP算法优化5G天线阵列

为了加快天线建模速度,针对现有天线设计软件天线参数优化速度过慢问题进行了建模研究。首先通过几种常用的启发式算法优化后的多层前馈（Back propagation,BP）神经网络对天线参数进行优化比较,并对其中最优的算法遗传算法优化BP（Genetic algorithm BP,GABP）神经网络算法进行深度改进。其次采用自适应算法和模拟退火算法优化算法对GABP进行优化。最终通过模拟试验验证出自适应GABP算法对于天线参数优化的误差最小。该研究为天线设计软件中天线优化方法提供了一种误差较小的新方法,拥有更高的预测准确度,拟合速度也大大提升。实验对比证明了该算法的可行性。     

Web service adaptation: A decade’s overview

With the exponential growth of communication and information technologies, adaptation has gained a significant attention as it becomes a key feature of service-based systems, allowing them to operate and evolve in highly dynamic and uncertain environments. Although several Web service standards and frameworks have been proposed and extended, existing solutions do not provide a suitable architecture, in which all aspects of monitoring and adaptation (e.g., proactive, cross-layer, and autonomic adaptation) can be expressed. In addition, the emergence of new computing environments to host and execute various types of services (Web/cloud services, big data-intensive services, mobile services, microservices, etc.) raises the need for more efficient monitoring and adaptation systems. This survey aims to bring a synthesis and a road-map to the adaptation of service-based systems. We also discuss adaptation solutions in emerging service models, such as cloud services and big services. Based on an adaptation taxonomy which we extracted from the surveyed approaches, and by identifying the main requirements and goals of service adaptation in Web, cloud and big data environments, detailed analysis and discussions, as well as the open issues, are provided.