A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

Entry into force of the UN Watercourses Convention: why should it matter?

The United Nations Watercourses Convention entered into force on 17 August 2014, following a long and complex journey that dates back to 1970 when the UN referred the matter to its legal arm, the International Law Commission. This article follows the Convention through that long and turbulent road, examines its main provisions and analyses the reasons for the delay of its entry into force. It concludes by answering the question of why entry into force of the Convention should indeed matter.     

相关条件下基于N-P准则的分布式检测理论研究

本文针对并行网络、二元局部判决的情况,研究了在相关条件下基于N-P准则的分布式检测融合算法,给出了在联合概率密度已知和未知两种情况下的最优融合规则的理论推导及相应的解决方案,并在实验仿真的基础上,得到了部分有益的结论。     

WCDMA系统接口信令消息的描述与实现

WCDMA作为第三代移动通信系统的主流标准，能够提供多种类型的多媒体服务。为了实现各种用户平面数据的传输，系统会提前通过控制平面对所需的无线资源进行分配。由于配置过程是通过接口之间发送控制平面应用协议消息来实现的，因此能否正确有效地对信令消息进行编解码成为保证系统稳定工作的关键因素。3GPP标准中，ASN．1语言被用来描述接口信令消息。首先简要介绍了WCDMA系统结构以及主要接口协议，重点描述了ASN．1存在的意义及其编解码规则，最后给出了基于ASN．1的开发环境下应用层网络协议的开发流程。     

Data structure and algorithms for fast automatic differentiation

In this paper we discuss the data structure and algorithms for the direct application of generalized Leibnitz rules to the numerical computation of partial derivatives in forward mode. The proposed data structure provides constant time access to the partial derivatives, which accelerates the automatic differentiation computations. The interaction among elements of the data structure is explained by several numerical examples. The paper contains analysis of the developed data structure and algorithms. Copyright © 2003 John Wiley & Sons, Ltd.     

基于小波变换的不同融合规则的图像融合研究

图像融合是一种重要的增强图像信息的方法。提出了一种基于多尺度分解的像素图像融合方法。利用小波变换按照不同融合规则及融合算子构造融合图像对应的小波系数。通过对可见光图像与红外图像进行融合的实验比较表明，以像素的局部能量为准则的融合效果更好，既可避免传统融合规则的信息损失，又提高了融合图像的空间分辨率和清晰度，融合图像更符合人的视觉特性，也有利于机器视觉。     

基于Apriori算法改进的关联规则提取算法

通过对Apriori算法的基本思想和性能的研究分析，认为Apriori算法存在一些不足。并且根据这些不足提出了相应的改进算法对Apriori算法进行优化，从而得到一种改进的Apriori算法，与原算法相比运算效率大大提高。     

高效离心风机的设计研究

该文在总结国内外高效离心风机的设计经验基础上,掌握和利用已有的经验,遵循一系列离心风机优化准则,成功的完成了高效机车用牵引电机通风机的设计.性能样机经台架试验,比原风机的性能有较大幅度的提高,效率达到86%,在国内同样风机中效率是较高的.     

Conditions for the Acceptance of Deontic Conditionals.

Recent psychological research has investigated how people assess the probability of an indicative conditional. Most people give the conditional probability of q given p as the probability of if p then q. Asking about the probability of an indicative conditional, one is in effect asking about its acceptability. But on what basis are deontic conditionals judged to be acceptable or unacceptable? Using a decision theoretic analysis, we argue that a deontic conditional, of the form if p then must q or if p then may q, will be judged acceptable to the extent that the p & q possibility is preferred to the p & not-q possibility. Two experiments are reported in which this prediction was upheld. There was also evidence that the pragmatic suitability of permission rules is partly determined by evaluations of the not-p & q possibility. Implications of these results for theories of deontic reasoning are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)