一个基于加权和组合降维的web文本分类系统

设计了一个web文本分类系统,采用了基于统计分析和粗糙集组合的方法进行降维;降维时考虑了属性的位置信息,采用加权方式标注属性的不同重要性,以达到提高分类速度和分类准确度的目的。     

Combinatorial optimization under uncertainty

In this paper, the general problem of Euclidean combinatorial optimization under uncertainty is formulated for the first time and the concepts of a stochastic multiset, a multiset of fuzzy numbers, a stochastic Euclidean combinatorial set, and general Euclidean combinatorial set of fuzzy stochastic numbers that combines the properties of both types of uncertainty are introduced. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 35–44, September–October 2008.     

Emotional agent based on rough set

To improve the ability of agent for handling emotions, a new architecture for emotion agent is presented, based on the traditional BDI agent model and the rough set theory. By a new emotional reasoning algorithm based on rough set, the architecture performs emotion reasoning and implements the emotion treatment. An emotional agent grid based on this architecture has been realized, experiment results show that it is efficient to transact simple emotions by emotional agents.     

The forwarding indices of augmented cubes

For a given connected graph G of order n, a routing R in G is a set of n(n−1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of G is the maximum number of paths in R passing through any vertex (resp. edge) in G. Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2002) 71-84] proposed a variant of the hypercube Qn, called the augmented cube AQn and presented a minimal routing algorithm. This paper determines the vertex and the edge forwarding indices of AQn as and ²n−1, respectively, which shows that the above algorithm is optimal in view of maximizing the network capacity.     

轮廓字网格编织带修饰效果的实现

利用计算机进行设计各种字形修饰效果一直是计算机图形学的重要内容之一.本文给出了在轮廓字表面上构造网格点,基于这些网格点进行Delaunay三角剖分,并转换为3-4网格,最后在网格上实现编织带修饰效果的具体实现方法.其中3-4网格由良构的四边形单元和少量辅助三角形单元构成,在其上实现了较好的编织带修饰的效果.     

单苯环氯取代指数法预测二噁类化合物PCDDs的正辛醇/水分配系数

采用单苯环氯取代指数作为氯代二苯并二口恶口英类化合物 (PCDDs)的分子结构描述符 ,通过正向逐步线性回归方法建立了PCDDs的logKow与分子结构描述符之间的定量关系模型。与文献报道的MOD模型相比 ,该模型不仅具有显著的相关性 (n =43,Radj=0 898,SE =0 195 ,在α =0 0 5时 ,F =2 0 45 5 ,p =0 0 0 0 0 ) ,而且对于分子结构具有更好的区分能力。利用建立的模型 ,对没有logKow文献值的其他 33种PCDDs化合物给出了预测值     

基于心态指标的区间灰数关联度模型

针对已有的灰色关联度模型仅适用于实数序列而不能应用于区间灰数序列的情况,通过引入决策者心态指标,将区间灰数序列转化为决策者心态指标序列,并且当决策者的心态指标确定时,心态指标序列就转化为实数序列,于是通过对体现决策者心态的实数序列建立灰色关联度模型,得到了反映出决策者心态的灰色关联度,从而构建了基于心态指标的区间灰数关联度模型。决策者处于不同心态时,可以通过调整其心态计算灰关联度,从而使建立的关联度模型更加符合实际。最后,通过计算实例说明了模型的可行性。     

Livelocks in parallel programs

This paper is the second of a two-part series exploring the subtle correctness criterion of the absence of livelocks in parallel programs. In this paper we are concerned with the issue of proving this correctness criterion. It is shown that livelocks are not preserved by reduction, implying that reduction cannot be used directly in proving the absence of livelocks. Two applicable proof techniques are also presented. One is based on the notion of establishing sufficient conditions for livelock-freedom; the other is an extension of the well-founded set method for proving termination in sequential programs.     

An iterative algorithm based on the piecewise linear system for solving bilateral obstacle problems

In this paper, we derive the piecewise linear system (PLS) associated with the bilateral obstacle problem and illustrate the equivalence between the linear system and finite-dimensional complementary problem. The existence and the uniqueness of the solution to the PLS are also demonstrated. Based on the PLS, a Picard iterative algorithm is proposed. The convergence analysis is given and examples are presented to verify the effectiveness of the method.     

时空结构视野下旅游客源市场定量初探——以浙江嘉兴乌镇为例

在客源时间分布上,计算乌镇游客游览时间强度指数,得到游客游览时间主要集中在二、三季度,并以7、8月份为最高峰。而在客源市场的分布上,鸟镇已经形成了以浙江为核心,上海、北京等地为一级,安徽、河南等地为二级的国内客源市场。在长三角古村落旅游发展迅速的今天,乌镇与周边的周庄、同里等古镇的竞争日益激烈,而旅游产品的创新、加大宣传迅速占领国内二级客源市场等措施将有助于乌镇在竞争中脱颖而出,占领主导地位。