三个点并圈的匹配等价图类

计算了3K1∪Cm匹配等价图的个数,也刻画了3K1∪Cm以及它的补图的匹配等价图类.     

T（2，2，2）∪（∪i∈A Ci）的匹配等价图类

利用图的匹配多项式及其最大实数根的性质完整刻画了T（2,2,2）∪（∪i∈A Ci）（A是大于等于3的整数组成的有限可重集）的匹配等价图类．     

两个点并圈的匹配等价图类

计算了2K1UCm的匹配等价图的个数，也刻画了2K1UCm以及它的补图的匹配等价图类。     

D3,2∪ T(1,1,n)的匹配等价图类

利用图的匹配多项式及其最大实数根的性质完整刻画了D3,2∪T（1,1,n）的匹配等价图类.     

几类图的匹配多项式及其性质

本文刻画了Pm，Cn，Q(3，n)，Q(s，t)的路树的匹配多项式，并得到了有关Pm，Cn，Q(3，n)，Q(s，t)，Ti,j,k,Ti,j,k,i,m的匹配多项式之间的一些关系，这些关系在比较这些图的最大匹配根，寻找此类图以及它们的并的匹配等价图类有重要意义．     

T(1,2,n)∪(s∪i=0 CPi)及补图的匹配唯一性

本文研究了图的匹配唯一性，给出了T（1，2，n）∪（S∪i=0CPi）及补图匹配唯一的充要条件．     

两类伴随等价图的构造及色性分析

通过研究图的伴随多项式的因式分解,给出并证明了h（（TF（t）k（2m＋1）＋1）∪（2k-1）K1和h（（TF（t）k（2m＋1）＋1）∪（3k-2）K1两类图簇的色等价图的结构定理.     

T(1,2,n)∪(∪ from i=o to s C_(Pi))及补图的匹配唯一性

本文研究了图的匹配唯一性,给出了T(1,2,n)∪(s∪i=0CP i)及补图匹配唯一的充要条件.     

两类联图的边色数

两个不交图G与H的联G+H是指顶点集为V(G)∪V(H),边集为E(G)∪E(H)∪{xy|x∈V(G),y∈V(H)}的图.证明了当n=m+1时,联图Om+Cn是第二类图,否则,Om+Cn是第一类图;当|n-m|=1时,联图Cm+Cn是第二类图,否则,Cm+Cn是第一类图.     

残棱柱的排斥整和数

图G的排斥(整)和数ε(G)(ζ′(G))是使得G∪nK1是排斥(整)和图的非负整数n的最小值.图Cn×K2称为棱柱.文中给出了残棱柱的定义,并证明了残棱柱的排斥整和数等于4.     

语义相似度Web服务合成策略的应用研究——以物流信息平台为例

研究语义Web服务匹配问题,提高匹配效率。传统Web服务基于关键字匹配,灵活性差,查准率和查全率偏低;语义Web服务引入机器可理解的语义信息,提高了信息共享程度及服务检索成功率,但服务响应慢,系统开销大。为了提高Web服务匹配效率,降低系统成本,提出一种基于语义相似度的Web服务混合匹配策略。首先对语义Web服务匹配问题进行分析,然后建立基于语义相似度的Web服务混合匹配模型,最后在西江物流平台中设计了一个基于语义Web服务的混合匹配框架。实际应用效果表明,混合匹配策略实现了语义Web的更好匹配,为客户提供更为快捷、准确的“寻车配货”服务。     

谈企业人员管理的两个匹配层次

企业人员管理的实质是匹配,是两个层次的匹配:不仅是企业人员工作能力和工作的匹配,更是企业人员个性和企业共性的匹配。企业人员管理就是要实现这种匹配,使这种匹配达到最佳。     

A novel model for extending international co-operation in science and education

In September 1994 the University of Twente, the Netherlands, and Zhejiang University, China, decided to cooperate in the field of science, education and management. After several visits of delegations from both sides it was considered worthwhile to explore further opportunities for mutual cooperation. The directors of international cooperation on each side jointly commissioned a project to investigate the potential in a systematic way and to establish further contacts where appropriate. This paper reports on the results of the research cum matching project.To reveal promising matches between multiple departments of both academic institutions a matching model for universities was designed. The study was carried out along two parallel lines. In the research line the theoretical framework was developed into a model for international university co-operation. Moreover, an analysis was carried out on internal, external and cultural aspects resulting in a set of thirty four influencing factors.In the matching line a total of seventy interviews were held in order to identify promising matches between units at both universities. This line resulted in eleven promising matches for further co-operation.The novel model appeared useful in analyzing the variety of factors and in developing matches between both universities. In the further implementation of the model the issues of "level of co-operation" and "top-down versus bottom-up" need to be addressed in more detail.     

天然肠衣搭配的数学优化模型

以2011年高教社杯全国大学生数学建模竞赛赛题为背景,针对天然肠衣搭配问题,利用LINGO软件,建立关于天然肠衣组装成品捆数最多的线性规划模型和对应的原料搭配方案数学模型,求出各规格模型的最优解,提供各规格原料的具体搭配方案,使资源分配得到最优化,企业效益达到最大化。     

课堂多媒体演示课件色彩的选择与应用

该文结合色彩心理学和环境心理学理论,分析讨论了课堂多媒体演示课件色彩的选择与应用问题。     

Heuristic decision-making in foster care matching: Evidence from a think-aloud study

Complex decisions are often based on heuristics, which are shortcuts or simple ‘rules of thumb’. Since the matching decision in family foster care is often made in a less-than-ideal setting and riddled with uncertainty, heuristics are expected to be applied in that field of child and youth care on a daily basis. However, the use of heuristics in the matching decision has not been studied empirically until now. This research explores how decision-making heuristics are used by practitioners to determine which foster family is the best fit for a child. A number of 20 matching practitioners from the Netherlands were interviewed using vignettes and a ‘think-aloud’ methodology to generate an understanding of their reasoning. Two types of vignettes were created: hypothetical children and hypothetical foster families. The interviews were analyzed using a qualitative deductive content analysis focusing on key indicators of three classes of heuristics: recognition heuristics, one-reason heuristics, and trade-off heuristics. The results show that recognition heuristics did not play a decisive role in the matching process; practitioners considered more than one family before making a final decision. The findings for the one-reason heuristics reveal conjunctive decision-making rules; families were rejected based on one negative premise. The analysis of the trade-off heuristics demonstrates that the number of positive premises and the ratio between positive and negative premises predicted the matching decision. However, the total number of premises also predicted the matching decision, which might indicate confirmation bias.     

基于正则表达式的协议识别方案

随着网络服务大量使用随机端口号,传统的基于端口号的协议识别方法不再适用。设计了一种基于正则表达式的协议识别方案。将NFA匹配引擎转换为DFA匹配引擎,提出了构造最优DFA状态数的算法,该算法保证在任意有限的系统资源下具有最小的时间复杂度和空间复杂度。     

复数小波变换在图像匹配中的应用

本语言介绍了一种新的基于多分辩率的层次分配方法,即利用复数小波变换作为分层的手段。小波变换的聚焦作用,可以分析到图像的任何细节,而复数小波变换所具有Gabor变换的特征,可以考察经分层后的信号的各个方向的细节。     

论武术套路音乐的选配

运用文献资料法,观察法,逻辑分析法等对中国各种比赛武术套路演练中音乐的选配进行分析发现,武术套路和音乐的配置,逐渐由不成熟逐渐走向成熟。但在这一逐渐发展的过程中．会不可避免的出现一些问题,尤其在近年来武术套路比赛中音乐的配置问题越来越多,急需解决。本文提出了武术套路与相应音乐选配的若干方法．以使音乐与套路更有效的结合．增加其观赏性和普及性。