二型Fuzzy集代数结构的若干性质

本文指出了文[4]的一个错误,改进了此文中的一个结果。此外,我们还得到了关于二型Fuuy集的许多有用的代数性质。     

L—fuzzy拓扑空间中的I型强连通性

利用准闭集和Ｐ远域引入和研究了Ｌｆｕｚｙ拓扑空间中的Ｉ＊型强连通性概念,它保持了一般拓扑空间连通集的若干重要性质．     

基于ASP的网络高中数学试题库的设计与实现

在分析了目前高中老师和学生对题库的需求的基础上,确定了建立高中数学题库的目标.介绍了题库系统的数据库设计和系统功能模块,并且详细讨论了系统实现的关键技术和系统安全问题.试验结果表明,该题库能满足不同用户的多样化需求.     

权重分析系统

本文利用加权模糊区间统计方法,对决策指标权重进行了讨论,并引入关联度的概念讨论了各专家的偏离度及一致性。     

非完全竞争的买方行为

将消费者行为理论推广到非完全竞争的买方行为。首先证明了预算映射和需求映射的连续性，并得到了需求集单值的条件；接着推广了数学规划的对偶性；最后证明了支付集的连续性和可微性。     

Rough sets bankruptcy prediction models versus auditor signalling rates

Both international and US auditing standards require auditors to evaluate the risk of bankruptcy when planning an audit and to modify their audit report if the bankruptcy risk remains high at the conclusion of the audit. Bankruptcy prediction is a problematic issue for auditors as the development of a cause–effect relationship between attributes that may cause or be related to bankruptcy and the actual occurrence of bankruptcy is difficult. Recent research indicates that auditors only signal bankruptcy in about 50% of the cases where companies subsequently declare bankruptcy. Rough sets theory is a new approach for dealing with the problem of apparent indiscernibility between objects in a set that has had a reported bankruptcy prediction accuracy ranging from 76% to 88% in two recent studies. These accuracy levels appear to be superior to auditor signalling rates, however, the two prior rough sets studies made no direct comparisons to auditor signalling rates and either employed small sample sizes or non‐current data. This study advances research in this area by comparing rough set prediction capability with actual auditor signalling rates for a large sample of United States companies from the 1991 to 1997 time period. Prior bankruptcy prediction research was carefully reviewed to identify 11 possible predictive factors which had both significant theoretical support and were present in multiple studies. These factors were expressed as variables and data for 11 variables was then obtained for 146 bankrupt United States public companies during the years 1991–1997. This sample was then matched in terms of size and industry to 145 non‐bankrupt companies from the same time period. The overall sample of 291 companies was divided into development and validation subsamples. Rough sets theory was then used to develop two different bankruptcy prediction models, each containing four variables from the 11 possible predictive variables. The rough sets theory based models achieved 61% and 68% classification accuracy on the validation sample using a progressive classification procedure involving three classification strategies. By comparison, auditors directly signalled going concern problems via opinion modifications for only 54% of the bankrupt companies. However, the auditor signalling rate for bankrupt companies increased to 66% when other opinion modifications related to going concern issues were included. In contrast with prior rough sets theory research which suggested that rough sets theory offered significant bankruptcy predictive improvements for auditors, the rough sets models developed in this research did not provide any significant comparative advantage with regard to prediction accuracy over the actual auditors' methodologies. The current research results should be fairly robust since this rough sets theory based research employed (1) a comparison of the rough sets model results to actual auditor decisions for the same companies, (2) recent data, (3) a relatively large sample size, (4) real world bankruptcy/non‐bankruptcy frequencies to develop the variable classifications, and (5) a wide range of industries and company sizes. Copyright © 2003 John Wiley & Sons, Ltd.     

关于闭集的距离及分离性的讨论

章主要指出[1]中一种不确切的说法，并就R^D中闭集的距离及分离分有界和无界情形进行了讨论，同时给出了较直观的证明。     

具有经典参数的差集与Bent函数

利用GF（2^d）上乘法群的具有经典参数差集，构造了一类2d个变量的Bent函数。     

篮球比赛中“频繁换人”浅谈

本文通过国际男子篮球邀请赛的统计数据,分析和证实了临场比赛中的频繁换人是现代篮球运动发展的方向和必然趋势。     

挖掘Web日志中连续可重复频繁访问路径的新算法

提出了一种从Web日志中快速挖掘连续可重复频繁访问路径的新算法ICAP.该算法通过构造以频繁项目p为根的SAP树,能一次挖掘出所有以p为前缀的连续可重复频繁访问路径.最后通过实验验证了算法的正确性和有效性.