Equivalence of the problems with quantile and integral quantile criteria

Consideration was given to the relation between the problems of stochastic programming with criteria in the form of quantile (VaR) and integral quantile (CVaR). Conditions were established for coincidence and distinction between their solutions. Different cases of the loss function and the distribution function of a random vector were discussed. In particular, the problem with bilinear loss function was explored to which the problem of generating the investment portfolio comes.     

On some universal methods of correction of the improper convex programming problems

Consideration was given to the methods of optimal correction of the improper problems of convex programming based on the Lagrange function regularized in both variables. The methods are independent of the kind of impropriety of the original problem. Approximation precision was estimated, and the relation of this approach to the existing methods of regularization of the incorrect extremal problems was discussed.     

数学概念的一种特殊形式化方法

数学定理的机器证明首先应将数学概念形式化(或称符号化 ) ,形式化的方法和技巧对于理论上的推理研究以及是否能够真正利用计算机进行推理将起关键作用。本文讨论了一种特殊形式化数学概念的方法 ,其主要特点就是仅引入两个谓词和有限个常项符号 ,按照某种规则生成公式后便可对众多数学概念进行描述。由于只有两个谓词和有限个常项符号出现 ,因此对利用计算机推理具有重要意义。     

Hopfield-型网络求解优化问题的一般演化规则

基于离散Hopfield-型网络和延迟离散Hopfield-型网络求解优化问题提出了两种一般 演化规则,演化序列的动态阈值是这些规则的重要特征,并获得了收敛性定理.推广了已有的 离散Hopfield-型网络和延迟离散Hopfield-型网络的收敛性结果,给出了能量函数局部极大值 点与延迟离散Hopfield-型网络的稳定态的关系的充分必要条件.鉴于延迟离散Hopfield-型网 络更有效地应用于优化计算问题,给出了一般分解策略.实验表明与离散Hopfield-型网络的 算法相比,文中提出的算法既有较高的收敛率又缩短了演化时间     

有界单向函数的通用求逆算法研究

有界单向函数是一个新的密码学概念．有界单向函数是为了研究设计更为灵活、更实用的密码系统的基础而提出的．该文的作者在以前的文章中，对有界单向函数与一般单向函数的关系进行了探讨，从而得到一般单向函数的一个刻画．由于单向函数的存在性与计算机科学中一系列重要未决的问题相联系，其本身的存在性是一个未决的问题．有界单向函数的研究对一般单向函数存在性的研究提供了一个新的途径．从它们之间的关系来看，如果对任意正整数c，存在c-单向函数，那么一定存在单向函数．鉴于现代密码学对单向函数的依赖性，对单向函数的存在性的研究具有重要的意义．该文进一步探讨有界单向函数的困难性． 由于单向函数的存在性被规约到了有界单向函数的存在性，该文章着眼于固定的有界单向函数的研究．文中的主要结果是：对任意正整数c，存在一个被称为关于所有c-有界单向函数的通用c-有界算法，满足对于充分大的”，这个算法求逆的成功概率是所有c-有界算法求逆的成功概率的上界．从而给出了一个关于c-单向函数的刻画．     

关系数据库上泛关系查询与中文查询语言的接口

本文初步探讨了实现关系数据库上泛关系查询与自然语言查询接口的一种方法, 文章对其中的若干问题如词典的组织、翻译算法等作了比较详细的讨论并通过实例进行了具体的说明。     

Monomial geometric programming with fuzzy relation inequality constraints with max-product composition

Monomials function has always been considered as a significant and most extensively used function in real living. Resource allocation, structure optimization and technology management can often apply these functions. In optimization problems the objective functions can be considered by monomials. In this paper, we present monomials geometric programming with fuzzy relation inequalities constraint with max-product composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and a few practical examples are presented to abbreviate and illustrate the steps of the problem resolution.     

The quadratic programming problem with fuzzy relation inequality constraints

The quadratic programming has been widely applied to solve real world problems. The quadratic functions are often applied in the inventory management, portfolio selection, engineering design, molecular study, and economics, etc. Fuzzy relation inequalities (FRI) are important elements of fuzzy mathematics, and they have recently been widely applied in the fuzzy comprehensive evaluation and cybernetics. In view of the importance of quadratic functions and FRI, we present a fuzzy relation quadratic programming model with a quadratic objective function subject to the max-product fuzzy relation inequality constraints. Some sufficient conditions are presented to determine its optimal solution in terms of the maximum solution or the minimal solutions of its feasible domain. Also, some simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. The simplified problem can be converted into a traditional quadratic programming problem. An algorithm is also proposed to solve it. Finally, some numerical examples are given to illustrate the steps of the algorithm.     

Testing in context: framework and test derivation

The paper addresses the problem of testing a component embedded within a given modular system. A context of the component represents the rest of the system and serves as its operational or testing environment. A framework for testing in context is presented based on the model of a system of communicating finite state machines. In particular, the problems of test executability and fault propagation in the presence of the context are identified and discussed. The proposed solution to these problems consists in computing so-called approximation of the specification in context, i.e. the FSM model of the component's properties that can be controlled and observed through the context. The approximation assures executability of tests and fault propagation through the context and serves as a base for test derivation. A conformance relation used for test derivation is shown to be the reduction relation between an implementation and the approximation of the given specification. This relation requires that the implementation produces a (sub)set of output sequences that can be produced by its specification in response to every input sequence. An approach to test generation for the reduction relation and deterministic implementations is also presented.     

Modeling of industrial problems on high-performance polyprocessor computing systems

Issues are considered that are related to the use of modern high-performance computer systems for the solution of problems of science and engineering. Special attention is given to the relation of technical possibilities, including the means of communication, computational algorithms, and auxiliary software tools. Examples are given of the use of high-performance systems for modeling of complex problems.     

系统功能结构最简式分析方法

为使空间故障树理论具有分析离散可靠性数据的能力,基于因素空间理论提出了一种分析系统功能结构最简式的方法,主要用于了解系统功能与元件功能之间的因果关系和内涵。给出了系统功能结构最简式方法的步骤和相关定义;使用一个系统的32条故障状态组成背景空间,分析其中蕴涵的系统功能与元件功能关系。同时随机选择23条故障状态组成了一个背景空间子集,得到蕴涵的功能关系。对比两种功能关系的最简结构式差异,根据布尔代数,得到元件之间的隐含功能关系为：元件Z3的功能与Z1或Z2或Z1+Z2的功能相同。从而得到关于系统可靠性的元件等效和替换关系。同时背景空间的两个子集最简结构式的和不等于原背景空间最简结构式,给出了两者相等的条件。     

Compatibility measures and consensus models for group decision making with intuitionistic multiplicative preference relations

Compatibility is a very efficient tool for measuring the consensus level in group decision making (GDM) problems. The lack of acceptable compatibility can lead to unsatisfied or even incorrect results in GDM problems. Preference relations can be given in various forms, one of which called intuitionistic multiplicative preference relation is a new developed preference structure that uses an unsymmetrical scale (Saaty's 1–9 scale) to express the decision maker's preferences instead of the symmetrical scale in an intuitionistic fuzzy preference relation. This new preference relation can reflect our intuition more objectively. In this paper, we first develop some compatibility measures for intuitionistic multiplicative values and intuitionistic multiplicative preference relations in GDM. Their desirable properties are also studied in detail. Furthermore, based on compatibility measures, we further develop two different consensus models with respect to intuitionistic multiplicative preference relations for checking, reaching and improving the group consensus level. Finally, a numerical example is given to illustrate the effectiveness of our measures and models.     

Parallel and sequential transformations on digital images

In this paper, the relation between parallel and sequential algorithms is discussed. We regard algorithms as definitions of transformations and investigated the relation between the sets of transformations defined by parallel and sequential algorithms. Three problems are treated mainly. The problems and the results for the problems may be summarized as follows. (1) Characterization of transformations which are both parallel and sequential—A necessary and sufficient condition for a transformation to be both parallel and sequential has been established. (2) Equivalence problems—The equivalence problem for two algorithms, one of which is parallel, is decidable, hence, the equivalence problem for two sequential algorithms is undecidable, i.e. an algorithm for deciding whether or not two given algorithms, one of which is parallel, define the same transformation has been presented. However, we have shown there is no algorithm for deciding whether or not two given sequential algorithms define the same transformation. (3) Translation problems—An algorithm for translating a parallel (sequential) algorithm into an equivalent sequential (parallel) algorithm has been presented.     

函数s一粗集，函数粗集与信息系统规律拆分一合成

给出函数单向导粗集(function one direction singular rough sets)、函数单向导粗集对偶Cdual of function one direction singular rough sets)、函数双向S粗集(function two direction singular rough sets)与函数粗集(function rough sets)。它们都是把函数概念引入到S粗集中,改进S粗集得到的。函数粗集是把函数概念引入到Z. Pawlak粗集中,改进Z. Pawlak粗集得到的。函数单向导粗集、函数单向S粗集对偶、函数双向S粗集是函数导粗集的三类形式。给出函数导粗集与导粗集的关系;给出函数粗集与Z. Pawlak粗集的关系;给出函数S粗集与函数粗集的关系。利用这些结果,给出函数的区间离散与有限元素集的生成、函数离散一元素集合生成原理;给出函数导粗集生成的信息规律、函数等价类动态特性一属性补充与删除原理;给出数据拆分一合成原理、信息规律动态拆分一合成的属性特征;给出信息规律动态拆分一合成不变性原理;利用这些概念与结果,给出信息规律拆分一合成与信息图像嵌入一分离的应用,给出嵌入信息图像的分离一辫识。函数导粗集、函数粗集是粗集理论与应用研究中的一个新的研究方向。     

基于函数依赖图的关系模式规范化方法

在关系型数据库设计过程中。关系模式规范化是关系型数据库逻辑设计的重要步骤。按关系模式的范式定义进行规范化存在不便于操作，分解构成效率低。本文提出了一种以函数依赖图为基础的图示化关系模式规范化方法。实例说明，利用这种方法进行关系模式分解。具有分解过程直观和效率高等特点。     

一类有理曲线—RB曲线

为了进一步丰富 Bézier曲线理论 ,首先从 Bernstein基函数出发 ,构造了一类新型函数—— Bernstein函数类 ,同时讨论了它的性质 ;然后用该类函数给出了 Bézier曲线类的生成方法 ;重点研究了一类基于有理形式调配函数的实用曲线—— RB曲线 ,结果表明 ,附加权因子的 RB曲线能部分克服常用的有理 Bézier曲线的权因子的选取没有统一的规则可以遵循的局限 ,提高了曲线设计的灵活性 ;最后给出了实例 ,并得到了可视化结果 .     

Extreme points and adjacency relationship in the flow polytope

Extreme flows, that is extreme points of the feasible set for network flow problems, play a fundamental role in most optimization problems. The adiacency relation between extreme flows is investigated, and a theorem is stated, which, for any extreme flow on a given network, defines a one-to-one correspondence between the set of its neighboring extreme flows and a set of cycles.     

Learning and optimization using the clonal selection principle

The clonal selection principle is used to explain the basic features of an adaptive immune response to an antigenic stimulus. It establishes the idea that only those cells that recognize the antigens (Ag's) are selected to proliferate. The selected cells are subject to an affinity maturation process, which improves their affinity to the selective Ag's. This paper proposes a computational implementation of the clonal selection principle that explicitly takes into account the affinity maturation of the immune response. The general algorithm, named CLONALG, is derived primarily to perform machine learning and pattern recognition tasks, and then it is adapted to solve optimization problems, emphasizing multimodal and combinatorial optimization. Two versions of the algorithm are derived, their computational cost per iteration is presented, and a sensitivity analysis in relation to the user-defined parameters is given. CLONALG is also contrasted with evolutionary algorithms. Several benchmark problems are considered to evaluate the performance of CLONALG and it is also compared to a niching method for multimodal function optimization     

多维进程行为评估模型建立及最优化方法

针对目前进程行为评估模型所存在的模型优化问题和模型选取问题,定义进程行为,采用隐马尔可夫模型(HMM)来描述进程行为。讨论了准确率与误报率的关系,提出多维进程行为评估模型,以弥补单一进程行为评估模型的不足,基于布尔运算对多维进程行为评估模型进行融合,提高了评估性能。并基于代价决策树理论,给出了选取最优进程行为评估模型的目标函数,用于在融合后的多维进程行为评估模型上选择最优进程行为评估模型。最后,对所提出的多维进程行为评估模型的性能进行了测试,并与传统的STIDE和HMM方法进行了比较,结果证明了其有效性和优越性。     

基于远程监督的藏文实体关系抽取

关系抽取任务是对句子中的实体对进行关系分类。基于远程监督的关系抽取是用预先构建的知识库来对齐朴素文本,自动标注数据,在一定程度上减少了人工标注的成本,缓解了藏文材料语料不足的问题。但是基于远程监督的实体关系抽取还存在错误标记、提取特征时出现噪声等问题。该文用远程监督方法进行藏文实体关系抽取,基于已经构建的藏文知识库,利用分段卷积神经网络结构,加入语言模型和注意力机制来改善语义歧义问题以及学习句子的信息;在训练过程中加入联合得分函数来动态修正错误标签问题。实验结果表明改进的模型有效提高了藏文实体关系抽取的准确率,且优于基线模型效果。