现役框架结构在改扩建工程中的安全性分析

结构安全性是结构可靠性最主要的要求,对现役框架结构及时地做出安全性评定,在安全的前提下延长其使用寿命,具有一定的社会意义和经济效益。结合改扩建工程实际情况,运用理论知识分析了现役框架结构的安全性,利用有限元SAP2000对原有结构和改建结构进行模态分析,通过对影响结构安全性的指标进行对比得出改建后的框架结构比原框架结构的安全性有一定提高。     

一种基于边缘与区域信息的先验水平集图像分割方法

传统的水平集图像分割方法仅考虑了图像的数据信息,因此对被遮盖的目标以及与背景灰度相近的目标无法达到理想的分割效果.针对这个问题,提出了一种基于边缘和区域信息的先验水平集图像分割方法.该方法首先将图像的区域信息融入基于边缘的水平集方法,然后将其与形状先验结合.对比实验表明该文方法由于综合考虑了多种信息,能够更好地完成被遮盖目标的分割,对于与背景灰度相近的目标也能达到更好的效果.     

基于新型无功和谐波电流检测方法的APF仿真研究

结合基于瞬时无功功率理论的ip-iq检测方法和基于传统功率理论的闭环自适应检测方法两者的优点,设计一种新的检测方法,该方法具有较好的鲁棒性和动态响应速度。同时由于逆变器采用三桥臂电容中点式结构,对其直流侧电压的稳定和上下电容的均压控制作了分析,与无功和谐波电流检测结合起来形成了双闭环结构,进一步增强补偿效果,然后对指令电流的合成和其跟踪控制作了简要阐述。最后利用Matlab/Simulink对系统进行了仿真,验证了该方法的正确性和有效性。     

基于极大似然准则和最大期望算法的自适应UKF 算法

针对噪声先验统计特性未知情况下的非线性系统状态估计问题,提出了基于极大似然准则和 最大期望算法的自适应无迹卡尔曼滤波(Unscented Kalman filter, UKF) 算法.利用极大似然准则构造含有噪声统计特性的对数似然函数,通 过最大期望算法将噪声估计问题转化为对数似然函数数学期望极大化问题,最终得到带次优递 推噪声统计估计器的自适应UKF算法.仿真分析表明,与传统UKF算法相比,提出的自适应UKF算法 有效克服了传统UKF算法在系统噪声统计特性未知情况下滤波精度下降的问题,并实现了系统噪 声统计特性的在线估计.     

基于凸松弛方法的医学 B 超图像快速分割

利用活动轮廓线方法进行图像分割的一个重要缺陷是目标函数是非凸的, 这不仅使得分割结果容易陷于局部极小, 而且还使得一些快速算法无法开展.本文首先从贝叶斯风险估计的方法出发,针对B超幅度图像, 给出一种基于Rayleigh分布的活动轮廓线模型. 然后结合凸松弛的方法,得到一个新的放松的凸模型.原有模型和放松后模型的关系可由定理1给出. 最后结合分裂Bregman算法, 给出基于B超分割模型的快速算法.与传统梯度下降法相比较,本文提出的算法不仅能得到全局最优解,而且在算法收敛速度上也 大大优于梯度下降法.     

Hybrid recommendations for mobile commerce based on mobile phone features

Mobile data communications have evolved as the number of third generation (3G) subscribers has increased. The evolution has triggered an increase in the use of mobile devices, such as mobile phones, to conduct mobile commerce and mobile shopping on the mobile web. There are fewer products to browse on the mobile web; hence, one‐to‐one marketing with product recommendations is important. Typical collaborative filtering (CF) recommendation systems make recommendations to potential customers based on the purchase behaviour of customers with similar preferences. However, this method may suffer from the so‐called sparsity problem, which means there may not be sufficient similar users because the user‐item rating matrix is sparse. In mobile shopping environments, the features of users' mobile phones provide different functionalities for using mobile services; thus, the features may be used to identify users with similar purchase behaviour. In this paper, we propose a mobile phone feature (MPF)‐based hybrid method to resolve the sparsity issue of the typical CF method in mobile environments. We use the features of mobile phones to identify users' characteristics and then cluster users into groups with similar interests. The hybrid method combines the MPF‐based method and a preference‐based method that uses association rule mining to extract recommendation rules from user groups and make recommendations. Our experiment results show that the proposed hybrid method performs better than other recommendation methods.     

On the combination of user-based and item-based collaborative filtering

In this paper, we propose two new filtering algorithms which are a combination of user-based and item-based collaborative filtering schemes. The first one, Hybrid-Ib, identifies a reasonably large neighbourhood of similar users and then uses this subset to derive the item-based recommendation model. The second algorithm, Hybrid-CF, starts by locating items similar to the one for which we want a prediction, and then, based on that neighbourhood, it generates its user-based predictions. We start by describing the execution steps of the algorithms and proceed with extended experiments. We conclude that our algorithms are directly comparable to existing filtering approaches, with Hybrid-CF producing favorable or, in the worst case, similar results in all selected evaluation metrics.     

An iterative algorithm based on the piecewise linear system for solving bilateral obstacle problems

In this paper, we derive the piecewise linear system (PLS) associated with the bilateral obstacle problem and illustrate the equivalence between the linear system and finite-dimensional complementary problem. The existence and the uniqueness of the solution to the PLS are also demonstrated. Based on the PLS, a Picard iterative algorithm is proposed. The convergence analysis is given and examples are presented to verify the effectiveness of the method.     

A Low‐Memory,Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain

In this work we present a new algorithm for accelerating the colour bilateral filter based on a subsampling strategy working in the spatial domain. The base idea is to use a suitable subset of samples of the entire kernel in order to obtain a good estimation of the exact filter values. The main advantages of the proposed approach are that it has an excellent trade‐off between visual quality and speed‐up, a very low memory overhead is required and it is straightforward to implement on the GPU allowing real‐time filtering. We show different applications of the proposed filter, in particular efficient cross‐bilateral filtering, real‐time edge‐aware image editing and fast video denoising. We compare our method against the state of the art in terms of image quality, time performance and memory usage.     

How to take into account general and contextual knowledge for interactive aiding design: Towards the coupling of CSP and CBR approaches

The goal of this paper is to show how it is possible to support design decisions with two different tools relying on two kinds of knowledge: case-based reasoning operating with contextual knowledge embodied in past cases and constraint filtering that operates with general knowledge formalized using constraints. Our goals are, firstly to make an overview of existing works that analyses the various ways to associate these two kinds of aiding tools essentially in a sequential way. Secondly, we propose an approach that allows us to use them simultaneously in order to assist design decisions with these two kinds of knowledge. The paper is organized as follows. In the first section, we define the goal of the paper and recall the background of case-based reasoning and constraint filtering. In the second section, the industrial problem which led us to consider these two kinds of knowledge is presented. In the third section, an overview of the various possibilities of using these two aiding decision tools in a sequential way is drawn up. In the fourth section, we propose an approach that allows us to use both aiding decision tools in a simultaneous and iterative way according to the availability of knowledge. An example dealing with helicopter maintenance illustrates our proposals.