多目标决策问题非支配解集的一种序列逼近方法

在多目标优化中,对非支配解集的估计是一项非常重要的工作.本文给出一种序列逼近非支配解集的方法.     

抗生素生产过程补料时机的Fuzzy识别与预报

本文就抗生素发酵生产过程,提出了一种补料时机的Fuzzy识别、预报的建模方法,并根据20m~3发酵罐工业数据的分析,选取了以总糖、总糖变化率、氨基氮和氨基氮变化率四个主要参数作为输入集因素,运用本文提出的方法,建立了一个实际的抗生素发酵生产过程补料时机的 Fuzzy 识别、预报模型。经现场调试效果良好,与富有经验的行家相比,准确率达90%以上。     

Onr-partition designs in hamming spaces

The concept of the combinatorial matrix of an unrestricted code and the notion of anr-partition design admitted by a code are introduced and discussed in detail. The theory includes a characterization of completely regular codes, and a combinatorial interpretation of the fact that the distinct rows of the distance distribution matrix of a code are linearly independent. In general, it is possible to compute the distance distribution matrix of any code admitting a given partition design by solving a well-defined system of linear equations; this is an efficient technique provided the number of classes in the partition is relatively small.     

Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization

In this article, we analyze a co-operative multi-thread search-based optimization strategy, where each solver thread represents a different optimization algorithm (or the same one with different settings), and they are all controlled by a centralized co-ordinator. We also propose the use of memory to keep track of both the state of the individual threads and the obtained solutions. Based on this memory, a very simple fuzzy rule base is used to control the system behavior.We also present the results of three computational experiments. The first of these checks the strategy by comparing it with an independent search strategy and a sequential algorithm, and the superiority of the co-operative scheme is confirmed. The second analyzes how definition of the threads affects the quality of the results, and the importance of there being a balanced set between intensification and diversification is corroborated. The third explores the use of memory with two different fuzzy rules, and the results indicate that the best combination is to use memory together with two rules (solver dependent and solver independent ones) (although this combination should not be activated at the beginning of the search in order to avoid premature convergence).     

基于粗糙集的生产环境数据挖掘系统方法

针对粗糙集确定性模型缺乏处理不确定信息的特点，Z．Pawlak等提出了粗糙集的概率模型，但该模型没有包括如何处理生产数据集纷繁复杂数据的方法，因此提出了应用粗糙集于生产环境数据挖掘的一种系统方法，并应用UCI的数据集对该方法进行了检验，实验结果体现了它的性能与有效性。     

Determination of the total concentration and speciation of Al(III) in tea infusions

The aluminium species in different tea infusions were investigated, by determining their stability constants and concentration. This was done for some particular samples using a simple experimental method based on the sorption of aluminium on the strongly sorbing resin Chelex 100, by a batch procedure. From the thermodynamic information obtained it is possible to calculate the concentration of the different species, and in particular that of the free metal ion, which is very important for evaluating the adsorption of aluminium on biological membranes. It was found that aluminium in the tea infusions here considered is present at high total concentration, approximately 0.1 mM, but mainly linked to strong complexes, for instance with side reaction coefficient higher than 10(5.11) at pH 3.95 in one case (tea 1). This could be the reason for the low toxicity of aluminium in tea. These strong complexes were not dissociated even in the presence of Chelex 100. In this case only a limiting value of the reaction coefficient could be evaluated. The presence of the very strong complexes was found in all the tea sample here considered. In two of the considered samples (one black and one green tea) a part of Al(III) was linked to less strong complexes, for example with a reaction coefficient 10(4.14) (tea 2, pH 4.20). The presence in the considered tea infusions of other substances able to complex aluminium was also detected, by the well known ligand titration procedure, at concentration ranging from 0.65 to 3.37 mM in three tea infusions, and at somewhat higher concentration in the case of the ready drink, which was also considered for comparison.     

Parameter identification for nonlinear systems: Guaranteed confidence regions through LSCR

In this paper we consider the problem of constructing confidence regions for the parameters of nonlinear dynamical systems. The proposed method uses higher order statistics and extends the LSCR (leave-out sign-dominant correlation regions) algorithm for linear systems introduced in Campi and Weyer [2005, Guaranteed non-asymptotic confidence regions in system identification. Automatica 41(10), 1751-1764. Extended version available at 〈http://www.ing.unibs.it/∼campi〉]. The confidence regions contain the true parameter value with a guaranteed probability for any finite number of data points. Moreover, the confidence regions shrink around the true parameter value as the number of data points increases. The usefulness of the proposed approach is illustrated on some simple examples.     

EXTENSION OF THE RELATIONAL DATABASE AND ITS ALGEBRA WITH ROUGH SET TECHNIQUES

This paper describes a database model based on the original rough sets theory. Its rough relations permit the representation of a rough set of tuples not definable in terms of the elementary classes, except through use of lower and upper approximations. The rough relational database model also incorporates indiscernibility in the representation and in all the operators of the rough relational algebra. This indiscernibility is based strictly on equivalence classes which must be defined for every attribute domain. There are several obvious applications for which the rough relational database model can more accurately model an enterprise than does the standard relational model. These include systems involving ambiguous, imprecise, or uncertain data. Retrieval over mismatched domains caused by the merging of one or more applications can be facilitated by the use of indiscernibility, and naive system users can achieve greater recall with the rough relational database. In addition, applications inherently “rough” could be more easily implemented and maintained in the rough relational database.     

Mining the change of customer behavior in fuzzy time-interval sequential patterns

Comprehending changes of customer behavior is an essential problem that must be faced for survival in a fast-changing business environment. Particularly in the management of electronic commerce (EC), many companies have developed on-line shopping stores to serve customers and immediately collect buying logs in databases. This trend has led to the development of data-mining applications. Fuzzy time-interval sequential pattern mining is one type of serviceable data-mining technique that discovers customer behavioral patterns over time. To take a shopping example, (Bread, Short, Milk, Long, Jam), means that Bread is bought before Milk in a Short period, and Jam is bought after Milk in a Long period, where Short and Long are predetermined linguistic terms given by managers. This information shown in this example reveals more general and concise knowledge for managers, allowing them to make quick-response decisions, especially in business. However, no studies, to our knowledge, have yet to address the issue of changes in fuzzy time-interval sequential patterns. The fuzzy time-interval sequential pattern, (Bread, Short, Milk, Long, Jam), became available in last year; however, is not a trend this year, and has been substituted by (Bread, Short, Yogurt, Short, Jam). Without updating this knowledge, managers might map out inappropriate marketing plans for products or services and dated inventory strategies with respect to time-intervals. To deal with this problem, we propose a novel change mining model, MineFuzzChange, to detect the change in fuzzy time-interval sequential patterns. Using a brick-and-mortar transactional dataset collected from a retail chain in Taiwan and a B2C EC dataset, experiments are carried out to evaluate the proposed model. We empirically demonstrate how the model helps managers to understand the changing behaviors of their customers and to formulate timely marketing and inventory strategies.     

Vague集的新模糊熵

本文指出了现有Vague集模糊熵定义的不足,分析了其存在不足的根本原因,给出了Vague集模糊熵的公理化定义,提出了一种新的Vague集模糊熵的计算方法,并证明了其合理性和有效性。