Exploring novice users' training needs in searching information on the WWW

Abstract Searching for information on the WWW involves locating a website and locating information on that site. A recent study implied that novice users' training needs exclusively relate to locating websites. The present case study tried to reveal the knowledge and skills that constitute these training needs. Fourteen pre‐university students, classified as novice (n = 7) or experienced WWW‐user (n = 7) performed three web search tasks. Their actions and verbalisations were recorded. Between‐group comparisons showed minimal performance differences. However, qualitative analyses of novice users' search performance suggest that their ability to locate websites could be enhanced by instructing monitoring skills and advanced system knowledge.     

基于Patran二次开发的飞机尾翼有限元建模方法

分析几种有限元建模的方法和平台的优缺点,用Patran的PCL通过增设特定的命令和窗体等开发飞机尾翼建模模块,并集成材料特性模块,形成一套由总体布局的几何信息直接生成,可进行应力分析的有限元建模系统.     

Algorithms for testing that sets of DNA words concatenate without secondary structure

We present an efficient algorithm for determining whether all moleculesin a combinatorial set of DNA or RNA strandsare structure free, and thus availablefor bonding to their Watson-Crick complements.This work is motivated by the goalof testing whether strands used in DNAcomputations or as molecular bar-codesare structure free, where the strands areconcatenations of short words. We alsopresent an algorithm for determining whetherall words in S*, for some finite setS of equi-length words, are structure free. This revised version was published online in June 2006 with corrections to the Cover Date.     

双推板炉自控系统方案探讨

该文介绍了推板炉计算机控制系统的控制方案及硬件、软件的具体设计。实现了推板炉各温控点采用单独的温控表进行独立控制,一点一表。并且采用热效率自寻优的方法自动调节风煤比,达到了经济燃烧的目的。系统运行表明:本系统大大提高了推板炉炉运行的稳定性、经济性,减轻了操作人员的劳动强度,收到了满意的控制效果。     

个性化信息推荐方法研究

随着信息技术和互联网的发展,人们进入了信息过量且愈发碎片化的时代。当前,个性化信息推送是用户获取网络信息的有效渠道。由于信息的更新速度快和用户兴趣更新等问题,传统的推荐算法很少关注甚至忽略上述因素,造成最终的推荐结果欠佳。为了给用户更好的个性化推荐服务,论文首次引入截取因子,提出了组合推荐算法（CR算法）。该算法的实质是将截取因子引入到基于内容的推荐算法与基于用户的协同过滤算法中,进而生成混合推荐算法。在推荐列表中,CR算法产生的推荐结果由两部分组成:一部分由混合推荐算法生成,另一部分由基于用户的协同过滤算法生成。根据信息的发布时间,决定该信息由哪类算法产生推荐:当浏览时间与当前时间的间隔不大于某个值时,采用混合推荐算法;否则,直接采用基于用户的协同过滤算法。基于真实数据的实验结果表明,CR算法优于同类算法。     

基于Raspberry Pi的可视化温湿度测量系统设计

二次设备必须在较为适宜的环境温湿度下运行,为了提高温湿度测量速度和准确性,基于Raspberry Pi嵌入式系统和Java语言,开发了一套对二次屏柜温湿度进行测量的系统.该系统具有GUI可视化界面,通过鼠标即可控制温湿度测量的启动和停止,在连续测量时,测量结果通过控件变化动态显示.该系统集合温湿度一起测量,可布置在重点屏柜内,有利于运维人员及时掌握二次屏柜温湿度变化,在温湿度超限时能及时采取处理措施.     

基于散列辞典的蛋白质二级结构预测方法

提出一种易于修改的蛋白质二级结构预测算法。以蛋白质数据银行中PDB文本数据作为数据源,提取所有蛋白质氨基酸序列并以此建立样本数据库,然后针对α-螺旋、β-折叠分别利用基于散列辞典的不同改进方法编程实现蛋白质二级结构序列片段预测,在预测过程中,随机抽取68421个蛋白质中部分样本作为测试集,对未知序列根据建立的散列辞典中的片段使用正向最大匹配分词法进行切分对比。从实验结果来看,对未知序列片段预测的准确度达到了83．9％,而且能够较好地体现片段之间的连接顺序。     

基于变权物元可拓模型的二次设备状态综合评价

针对二次设备状态评价的特点,提出了基于变权物元可拓的二次设备状态综合评价模型。结合物元可拓理论,确立二次设备的状态信息经典域,建立状态参量物元矩阵。同时,充分考虑权重确定过程的主观性,运用变权理论对各评价指标的权重进行修正,并比较了三种权重确定方法。结果表明,变权法对异常指标具有放大作用,更加符合设备管理要求。最后引入贴近度函数对二次设备的状态进行综合评判。以某220 kV变电站某二次装置为例,评价结果显示设备处于注意状态,偏向异常状态的程度较大,结果基本符合设备实际运行情况,从而验证了该方法的正确性。     

基于贝叶斯网络模型的用户兴趣联合推送

The association push of interesting information is implemented according to the information that other users with similar interests have read, the refore user can easily find high quality interesting information from the immense Web information. The association push of interesting information based on Bayesian network model ispresented in this paper, it stores the conditional probability and semantic meaning between the terms, so the similarity between the users' interests and the similarity between the user's interest and document can be computed according to the semantic meaning of the terms, therefore the association push of interesting information can beimplemented. The experience result indicates this method is effective.     

Two-machine open shop scheduling with secondary criteria

This paper considers two-machine open shop problems with secondary criteria where the primary criterion is the minimization of makespan and the secondary criterion is the minimization of the total flow time, total weighted flow time, or total weighted tardiness time. In view of the strongly NP-hard nature of these problems, two polynomially solvable special cases are given and constructive heuristic algorithms based on insertion techniques are developed. A strongly connected neighborhood structure is derived and used to develop effective iterative heuristic algorithms by incorporating iterative improvement, simulated annealing and multi-start procedures. The proposed insertion and iterative heuristic algorithms are empirically evaluated by solving problem instances with up to 80 jobs.