Revealing future research capacity from an analysis of a national database of discipline-coded Australian PhD thesis records

This article reports how statistical analyses of PhD thesis records can reveal future research capacities for disciplines beyond their primary fields. The previous research showed that most theses contributed to and/or used methodologies from more than one discipline. In Australia, there was a concern for declining mathematical teaching and research capacity. We decided to investigate the ‘hidden’ mathematics research capacity in PhDs outside of mathematics. Australian PhD records were re-coded with up to three fields. Records with mathematics as one of their codes were selected and analysed for their relationships to disciplines in their other codes. Triple-coding revealed ‘hidden’ mathematical research capacity that had previously been single-coded in another field had mathematics as one of their subsequent fields. Our findings have implications for policy and planning for mathematics in Australia, and multiple coding of PhD theses records enables analyses for other disciplines to be undertaken to show their research capacities.     

福建师范大学图书馆藏中琉关系史料述略——明清文献之二

本文系《福建师范大学图书馆藏中琉关系史料述略-明清文献之一》的续作，并承上文中体例，分为：一、册封使的著作；二、历史、地理类典籍；三、诗文集、类书、笔记、杂著等三个部分。将馆藏有关中琉关系的17种明清文献，分别述其要略，以便向学术界提供史料参考。     

基于视频的数据挖掘系统的研究

研究了一种视频数据挖掘的系统结构.介绍了该系统中各主要模块的功能;描述了视频数据预处理和视频数据立方体;讨论了视频数据挖掘方法并探讨了典型的视频挖掘技术.     

To tag or not to tag? How to support organizing and classifying bookmarks from the Web (¿Con etiquetas o sin etiquetas? Cómo asistir en la organización y clasificación de los marcadores de páginas Web) (¿Con etiquetas o sin etiquetas? Cómo asistir en la organización y clasificación de los marcadores de páginas Web)

ABSTRACT

When searching for information on the Internet, it can be stored in a bookmarking system. The ability to organize this information in such a system depends on one’s own prior knowledge to create an appropriate classification scheme. Providing a classification system for bookmarks might support people with low prior knowledge. Even though different bookmarking systems exist, hierarchical menus and tagging are being most widely used. In the current exploratory study with 95 ninth-grade students, a 2 × 2 between-subjects design was used to investigate the influence of providing classification support (or not) for either a tagging or a hierarchical system. Results showed that despite the low familiarity with tagging systems, using a hierarchical system is not necessarily a better approach than using a tagging system to organize previously found information. Rather, a tagging system seems to yield storage of fewer but higher-quality information sources. The most important conclusion is that, despite the low familiarity with tagging systems, using a hierarchical system was not beneficial over using a tagging system to organize previously found information.     

论畲族文献资源数据库的构建

在分析建立畲族文献资源数据库之必要性与可行性的基础上,论述了畲族文献资源数据库的构建框架和内容,并对如何着手构建问题作了探讨。     

基于支持向量机的数据挖掘技术

随着数据库技术的迅速发展以及数据库管理系统的广泛应用,人们积累的数据越来越多.激增的数据背后隐藏着许多重要的信息,人们希望能够对其进行更高层次的分析,以便更好地利用这些数据.将目前先进的机器学习技术支持向量机,与数据挖掘结合起来,提出了一个改进的支持向量机训练算法,进行了支持向量机自动分类的模拟试验.试验结果显示,新算法的训练速度明显提高,并获得了比较理想的分类结果.     

数据移动技术的选择与实现

数据移动技术是分布式数据库中非常重要的技术之一。本归纳总结了分布式数据库中的数据移动技术，从本质上将现有的数据移动技术分为在线、同步、复制三类技术。在线技术系统可以达到绝对的一致性，但该技术对网络要求很高，且在节点较少时才比较有效。同步技术可以支持大量节点，异构和级联环境，要求有效的网络连接，存在一定的一致性延时。复制技术比较灵活，支持大量节点，异构和级联环境；可以在较好的网络环境，也可以在无直接或网络环境恶劣的情况下使用；存在一定的一致性延时，也可达到准实时的一致性。这三类数据移动技术的应用和选择，主要取决于业务需求和可用的技术架构以及系统对一致性和延时的要求。     

试论说明文语言的准确性

语言的准确性是说明文教学的重要内容之一.说明文语言的准确性,体现在数据的使用、概念的限制、语序的安排和修辞的运用等方面.     

企业新计量信息流转模型和新自动计量模型设计与实施的应用研究

文章讨论了基于信息化数据通讯流转原理和现场自动控制理论,研究了冶金制造企业大宗原燃料、成品、半成品和产品新计量信息流转模型和新自动计量模型设计与实施的现代信息流转和自动称量达到自动、稳定、正确、可靠、合理、可追溯的问题,通过在本钢集团公司ERP、EMS系统配套运行和现场轧钢线计量称重实施等线上操作的手段来实现应用研究。解决了企业新计量信息流转模型和新自动计量模型设计与实施的问题,达到了计量信息系统的提出"数出一门,量出一家"和"网络化自动运行"要求,为冶金制造行业解决此类问题提供了新的思路和方法,具有极大的推广和应用价值。     

Super-proximity routing in structured peer-to-peer overlay networks

Peer-to-Peer systems are emerging as one of the most popular Internet applications. Structured Peer-to-Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super-proximity routing algorithms presented in this paper combine Internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer-to-Peer routing.