基于Web挖掘的高校德育管理决策系统的设计

随着数据挖掘技术的不断发展,Web挖掘技术已经在社会上得到了广泛运用,但将此技术运用到高校德育管理决策中还比较少.基于远程教育技术和传统的德育管理手段,运用Web挖掘技术动态追踪学生历程信息,利用关联规则算法,提出高校德育管理决策系统的结构模型及其解决方案.     

异构电子商务集成平台的本体模型构建

针对电子商务数据异构的特点,研究用本体技术实现异构电子商务的集成平台.通过不同电子商务本体特征的挖掘和抽取,提出异构电子商务集成平台的本体模型构建方法.实现电子商务本体协同的"即插即用"互操作集成模型.     

PPDM中面向k-匿名的MI Loss评估模型

隐私保护数据挖掘（PPDM）利用匿名化等方法使数据所有者在不泄露隐私信息的前提下,安全发布在数据挖掘中有效可用的数据集。k-匿名算法作为PPDM研究使用最广泛的算法之一,具有计算开销低、数据形变小、能抵御链接攻击等优点,但是在一些k-匿名算法研究中使用的数据可用性评估模型的权重设置不合理,导致算法选择的最优匿名数据集在后续的分类问题中分类准确率较低。提出一种使用互信息计算权重的互信息损失（MI Loss）评估模型。互信息反映变量间的关联关系,MI Loss评估模型根据准标识符和标签之间的互信息计算权重,并通过Loss公式得到各个准标识符的信息损失,将加权后的准标识符信息损失的和作为数据集的信息损失,以弥补评估模型的缺陷。实验结果证明,运用MI Loss评估模型指导k-匿名算法能够明显降低匿名数据集在后续分类中的可用性丢失,相较于Loss模型和Entropy Loss模型,该模型分类准确率提升了0.73%~3.00%。     

Reducing control selection errors associated with underground bolting equipment

Selecting the incorrect control during the operation of underground bolting and drilling equipment causes serious injuries. Shape coding and the layout of dual control banks are two aspects of control design which require further examination. The aims of this research were: (i) to determine whether arbitrary shape coding was effective in reducing selection error rates in a virtual analogy of roof-bolting; and (ii) to determine whether any advantages exist for mirror or place layouts for dual control situations in this situation. Two experiments were conducted to address these questions. No benefits of arbitrary shape coding were evident while control location remained constant. When control location was altered, shape coding did provide a significant reduction in selection error rate. No differences between mirror or place arrangements were detected and this question remains open.     

Sleep in a live-in mining operation: The influence of start times and restricted non-work activities

The amount of sleep obtained between shifts is influenced by numerous factors including the length of work and rest periods, the timing of the rest period relative to the endogenous circadian cycle and personal choices about the use of non-work time. The current study utilised a real-world live-in mining environment to examine the amount of sleep obtained when access to normal domestic, family and social activities was restricted. Participants were 29 mining operators (26 male, average age 37.4 ± 6.8 years) who recorded sleep, work and fatigue information and wore an activity monitor for a cycle of seven day shifts and seven night shifts (both 12 h) followed by either seven or fourteen days off. During the two weeks of work participants lived on-site. Total sleep time was significantly less (p < 0.01) while on-site on both day (6.1 ± 1.0 h) and night shifts (5.7 ± 1.5 h) than days off (7.4 ± 1.4 h). Further, night shift sleep was significantly shorter than day-shift sleep (p < 0.01). Assessment of subjective fatigue ratings showed that the sleep associated with both days off and night shifts had a greater recovery value than sleep associated with day shifts (p < 0.01). While on-site, participants obtained only 6 h of sleep indicating that the absence of competing domestic, family and social activities did not convert to more sleep. Factors including shift start times and circadian influences appear to have been more important.     

3G用户在WLANs间的快速认证方法

EAP-AKA协议可以实现用户和3G网络的双向认证,但缺乏对无线局域网(WLAN)接入网络的认证和用户主密钥的更新机制,并且3G用户在WLAN间漫游时代价较高。针对上述问题,利用身份加密技术和门票技术改进EAP-AKA协议,设计无需3G网络参与的WLAN间快速漫游协议,实现对WLAN接入网络的认证和主密钥更新。     

Tree pattern mining with tree automata constraints

Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structures, XML and Web log databases and social networks, require much more sophisticated data structures such as trees and graphs. In these contexts, interesting patterns involve not only frequent object values (labels) appearing in the graphs (or trees) but also frequent specific topologies found in these structures. Recently, several techniques for tree and graph mining have been proposed in the literature. In this paper, we focus on constraint-based tree pattern mining. We propose to use tree automata as a mechanism to specify user constraints over tree patterns. We present the algorithm CoBMiner which allows user constraints specified by a tree automata to be incorporated in the mining process. An extensive set of experiments executed over synthetic and real data (XML documents and Web usage logs) allows us to conclude that incorporating constraints during the mining process is far more effective than filtering the interesting patterns after the mining process.     

CAN总线网络层协议栈开发测试

对ISO15765协议进行分析,依据协议在基于MC9S12DP512芯片的整车控制器上完成CAN网络层协议栈的开发,给出开发过程。在VC环境下开发测试程序,对协议栈进行测试。结果表明,实现的CAN网络层协议栈符合ISO15765协议的规定,可满足车辆故障诊断系统等具体应用中系统对CAN网络层通信的需求。     

Computing integrals over polynomially defined regions and their boundaries in 2 and 3 dimensions

We use the cylindrical algebraic decomposition algorithms implemented in Mathematica to produce procedures to analytically compute integrals over polynomially defined regions and their boundaries in two and three dimensions. Using these results, we can implement the divergence theorem in three dimensions or the Green's theorems in two dimensions. These theorems are of central importance in the applications of multidimensional integration. They also provide a strong correctness test for the implementation of our results in a computer algebra system. The resulting software can solve many of the two and some of the three dimensional integration problems in vector calculus textbooks. The three dimensional results are being extended. The results in this paper are being included in an automated student assistant for vector calculus.