Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences

In the paper a single machine time-dependent scheduling problem is considered. The processing time p_j of each job is described by a function of the starting time t of the job, p_j=1+α_jt, where the job deterioration rate α_j?0 for j=0,1,…,n and t?0. Jobs are nonpreemptable and independent, there are no ready times and no deadlines. The criterion of optimality of a schedule is the total completion time.First, the notion of a signature for a given sequence of job deterioration rates is introduced, two types of the signature are defined and their properties are shown. Next, on the basis of these properties a greedy polynomial-time approximation algorithm for the problem is formulated. This algorithm, starting from an initial sequence, iteratively constructs a new sequence concatenating the previous sequence with new elements, according to the sign of one of the signatures of this sequence.Finally, these results are applied to the problem with job deterioration rates which are consecutive natural numbers, α_j=j for j=0,1,…,n. Arguments supporting the conjecture that in this case the greedy algorithm is optimal are presented.     

一种多值Petri网及其应用

为了更好地将Petri网应用在基于多值逻辑的知识表示和推理中，以普通Petri网的基本定义为基础．结合模糊Petri网和有色Petri网各自的一些特点，将其进行必要的扩展和简化，从而提出一种多值Petri网，使托肯和变迁多值化，然后将它用于知识工程中多值产生式建模和推理中，并根据推理的需要提出了相应的算法。     

THE SOLVABILITY CONDITIONS FOR INVERSE EIGENVALUE PROBLEM OF ANTI-BISYMMETRIC MATRICES

AbstractThis paper is mainly concerned with solving the following two problems: Problem I. Given X Cnxm, A = diag( 1, 2, ..... , m) Cmxm . Find A ABSRnxn such thatAX = XAwhere ABSRnxn is the set of all real n x n anti-bisymmetric matrices. Problem II. Given A RnXn. Find A SE such thatwhere || || is Frobenius norm, and SE denotes the solution set of Problem I.The necessary and sufficient conditions for the solvability of Problem I have been studied. The general form of SB has been given. For Problem II the expression of the solution has been provided.     

Fuzzy logic in measurements

Our main interest in this paper is to translate from “natural language” into “system theoretical language”. This is of course important since a statement in system theory can be analyzed mathematically or computationally. We assume that, in order to obtain a good translation, “system theoretical language” should have great power of expression. Thus we first propose a new frame of system theory, which includes the concepts of “measurement” as well as “state equation”. And we show that a certain statement in usual conversation, i.e., fuzzy modus ponens with the word “very”, can be translated into a statement in the new frame of system theory. Though our result is merely one example of the translation from “natural language” into “system theoretical language”, we believe that our method is fairly general.     

Integral methods for computing solutions of a class of singular two-point boundary value problems

In this paper, we establish three iteration methods to compute solutions for a class of (weakly) singular two-point boundary value problems (xy^′)^′=f(x,y), where x(0,1) and <2. We obtain the sufficient conditions for existence of a unique solution on . Finally, we given some numerical examples.     

Theory of wire addition and removal in combinational Boolean networks

Let w_t be a wire in a combinational Boolean network. There may exist a wire w_a such that when w_a is added and w_t is removed, the overall circuit functionality is unchanged. Redundancy-addition-and-removal (RAR) is an efficient technique to find such a w_a. The idea is to add a redundant alternative wire w_a to make the target wire w_t redundant. However, as long as the addition of w_a together with the removal of w_t does not change the overall functionality of the circuit, wires that are added and removed do not necessarily need to be redundant. This raises a question about the existence of alternative wires. Why can one wire replace another wire in a combinational Boolean network? In this paper, we analyze theoretically the existence of alternative wires and model it as an error-cancellation problem. The two existing rewiring techniques, the redundancy-addition-and-removal and the global flow optimization, are unified under the proposed generalized model.     

基于数据表结构的FPN并行推理算法

通过对模糊产生式规则一般形式的研究，抽取出适用于FPN模糊推理的两类模糊产生式规则。定义并建立了FPN模型，将在图形结构上进行推理的传统Petri网模型映射到数据表结构上．在此基础上实现了对基于规则的正向推理和基于模糊Peari网的模糊推理算法。最后通过实例对该算法进行了检验．结果表明该算法不仅具有简单通用、容易实现和高效的特点，而且还适食于对比较复杂的模糊产生式知识库进行并行推理。     

用于综合评判的一种权重计算方法

在综合评判和决策过程中，属性权重的确定是其中一个重要环节。由于常用方法存在诸多缺点,为此根据信息具有粒度的思想，基于粗糙集两个近似精度来科学定义属性的重要性，并将之作为综合评判中的客观权重。此外考虑到客观经验因素，将客观扭值和主观权重相结合，最后得到有利于正确评价和决策的综合权重。流型识别仿真试验结果表明：文章提出的权重计算方法较为完备，其应用效果优于其它权重计算方法。     

基于D—S推理的雷达信号模糊识别方法

提出了一种将D－S证据理论与模糊理论组合应用的方法用于雷达信号的识别，通过对信号的积累和对信任度（模糊隶属度）的重新分配，有效地解决了雷达信号的不确定性问题以及如何利用信号在时间上的冗余信息问题，提出了信号的正确识别率。并用仿真实验和正确识别率的统计结果验证了这种方法的适用性。