一种改进的各向异性扩散去噪模型

为了既能有效地去除噪声,又能够较好地保持图像的边缘以及重要的细节信息,在Perona和Malik提出的各向异性扩散模型(P-M模型)的基础上,通过对扩散方程中扩散函数的改进,提出了一种具备自适应性的去噪扩散模型,该模型对图像去噪处理更加高效。改进的扩散函数在梯度较小时为一个常数,大于某个阈值后变为单调递减函数,直至某个梯度时递减为零。以上扩散函数特性使各向异性扩散模型能够达到在同质区加速平滑、在边缘区停止平滑的目的。实验结果表明,改进的扩散模型是一种更为理想的保边缘平滑模型。     

基于兴趣分组的P2P网络文件共享系统信誉模型研究

为了降低P2P文件共享的交易风险,提高交易成功率,促进网络良性持续发展,构造了一种基于节点兴趣分组的信誉模型,并建立了与之相应的节点信誉计算方法、文件共享过程、访问控制策略。本模型借鉴人类社区的思想,利用节点兴趣聚簇的特性,避开现有的全局信任模型和局部信任模型的局限性,将节点按照所需资源的类型划分成兴趣组,以此达到提高资源定位率及交易成功率、增强网络安全的目的。通过模拟仿真和分析表明,本模型具有正确性、可行性的特点,并且较已有的信任模型在完备性和安全性等方面有较大改进,达到了预期的设计目标。     

基于组态软件监控的智能电梯群控系统设计

随着高层建筑的不断出现以及人们对电梯服务质量要求的持续增高,智能电梯群控系统已经广泛应用到人们生活的方方面面.提出了一种基于组态软件监控的智能群控电梯系统设计,并结合当今流行的组态监控软件设计出了上位机软件,用以监控电梯群的运行,实现了多电梯高效运行,提高了电梯系统的服务效率和控制水平.     

一种基于PSO&PAM的聚类算法

PAM是最早提出的k-medoids算法之一,该算法比较健壮,比k-means算法鲁棒性更强,但是PAM对初始值敏感,易陷入局部收敛。利用PSO算法对PAM进行优化,提出一种基于PSO和PAM的聚类方法,充分利用PAM和PSO两者对于不同问题的优势,来不断地更新PAM的聚类中心。通过建立基于熵的聚类有效性函数,对混合聚类算法的性能进行客观评价。从来自UCI的数据的测试结果表明,这种混合聚类的方法有较高的聚类正确率。     

地方高校本科计算机专业数据库系统课程体系建设

针对地方高校本科计算机专业数据库课程教学进行研究,首先详细分析了地方高校应用型本科该专业课程的培养目标;其次通过设置数据库课程群和课程链,制定了数据库相关系列课程的体系结构;最后对地方高校应用型本科计算机专业数据库系列课程的教学方法和考核方式进行了探讨.     

Approaches to extended non-quadratic stability and stabilization conditions for discrete-time Takagi–Sugeno fuzzy systems

This paper provides simple and effective linear matrix inequality (LMI) characterizations for the stability and stabilization conditions of discrete-time Takagi–Sugeno (T–S) fuzzy systems. To do this, more general classes of non-parallel distributed compensation (non-PDC) control laws and non-quadratic Lyapunov functions are presented. Unlike the conventional non-quadratic approaches using only current-time normalized fuzzy weighting functions, we consider not only the current-time fuzzy weighting functions but also the l-step-past (l?0) and one-step-ahead ones when constructing the control laws and Lyapunov functions. Consequently, by introducing additional decision variables, it can be shown that the proposed conditions include the existing ones found in the literature as particular cases. Examples are given to demonstrate the effectiveness of the approaches.     

Feedback control of nonlinear stochastic systems for targeting a specified stationary probability density

In the present paper, an innovative procedure for designing the feedback control of multi-degree-of-freedom (MDOF) nonlinear stochastic systems to target a specified stationary probability density function (SPDF) is proposed based on the technique for obtaining the exact stationary solutions of the dissipated Hamiltonian systems. First, the control problem is formulated as a controlled, dissipated Hamiltonian system together with a target SPDF. Then the controlled forces are split into a conservative part and a dissipative part. The conservative control forces are designed to make the controlled system and the target SPDF have the same Hamiltonian structure (mainly the integrability and resonance). The dissipative control forces are determined so that the target SPDF is the exact stationary solution of the controlled system. Five cases, i.e., non-integrable Hamiltonian systems, integrable and non-resonant Hamiltonian systems, integrable and resonant Hamiltonian systems, partially integrable and non-resonant Hamiltonian systems, and partially integrable and resonant Hamiltonian systems, are treated respectively. A method for proving that the transient solution of the controlled system approaches the target SPDF as t→∞ is introduced. Finally, an example is given to illustrate the efficacy of the proposed design procedure.     

Set-valued Lyapunov functions for difference inclusions

The paper relates set-valued Lyapunov functions to pointwise asymptotic stability in systems described by a difference inclusion. Pointwise asymptotic stability of a set is a property which requires that each point of the set be Lyapunov stable and that every solution to the inclusion, from a neighborhood of the set, be convergent and have the limit in the set. Weak set-valued Lyapunov functions are shown, via an argument resembling an invariance principle, to imply this property. Strict set-valued Lyapunov functions are shown, in the spirit of converse Lyapunov results, to always exist for closed sets that are pointwise asymptotically stable.     

Scheduling a batching machine with convex resource consumption functions

In various industries jobs undergo a batching, or burn in, process where different tasks are grouped into batches and processed simultaneously. The processing time of each batch is equal to the longest processing time among all jobs contained in the batch. All to date studies dealing with batching machines have considered fixed job processing times. However, in many real life applications job processing times are controllable through the allocation of a limited resource. The most common and realistic model assumes that there exists a non-linear and convex relationship between the amount of resource allocated to a job and its processing time. The scheduler?s task when dealing with controllable processing times is twofold. In addition to solving the sequencing problem, one must establish an optimal resource allocation policy. We combine these two widespread models on a single machine setting, showing that both the makespan and total completion time criteria can be solved in polynomial time. We then show that our proposed approach can be applied to general bi-criteria objective comprising of the makespan and the total completion time.