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.     

面向云计算基础课程的Paxos算法教学设计研究

云计算作为一种新型计算模型,自诞生以来受到了业界与学术界广泛关注,市场规模迅速扩大,国内许多大学的计算机专业都开始关注云计算课程教学。针对云计算课程技术内容新、涉及理论多、应用范围广,以及与商业运营模式结合紧密等特点,以谷歌公司的云计算核心技术分布式锁服务Chubby所采用的Paxos算法为例,对云计算教学内容与教学方法进行设计探究。详细阐述了Paxos算法工作原理,并设计了具体教学案例,该教学方案在实际教学实践中获得了良好的教学效果,加深了学生对Paxos算法的理解。     

示意图提示条件下小学生数学问题解决的研究

学生对示意图提示条件普遍持肯定态度;学校教学水平影响学生非视觉化题目上的态度反应,而不影响视觉化题目上的态度反应.从整体上看,示意图提示条件能显著地促进学生的解题,但是这种促进作用受题目视觉化程度、学校教学水平的制约.在一定范围里,随着非视觉化题目难度增加示意图提示条件的作用在增强.     

一种鲸鱼优化算法改进的加权质心定位算法

针对加权质心定位算法受 RSSI 测距误差影响导致定位结果不理想的问题,提出一种鲸鱼优化算法改进的加权质心算法,利用鲸鱼优化算法的快速收敛、不易陷入局部最优等优势对加权质心算法定位结果进行优化。首先,通过加权质心算法计算待测点位置;其次,根据锚节点位置信息、RSSI 测距信息及待测点位置信息建立适应度函数;最后,利用鲸鱼优化算法不断迭代寻优,对待测点定位结果进行优化,以提高定位精度。在通信半径相同、锚节点数为 30 的条件下,改进后的定位算法定位精度为 0.58m,而粒子群加权质心算法与人工鱼群加权质心算法定位精度分别为 0.64m 和 0.62m,且随着锚节点个数的增加或通信半径的增大,改进后的定位算法仍能获得更高的定位精度。因此,改进后的定位算法精度更高,具有一定可行性。     

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

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

一类投资组合模型的模糊两阶段算法

对多目标证券组合投资模型进行了研究，模型以风险损失率作为风险。该模型是一多目标线性优化问题．我们采用模糊折衷算法对模型进行了求解，算例给出了该模型的一个实例的最优解。     

G代码行PIDP编译算法

G代码的解释或编译是数控系统软件中的一个不可缺少的环节。对此,提出了一个新的算法,阐述了该算法的原理和实现方法。该算法将G代码编译成协议整型数据包PIDP,利用PIDP,使控制软件的实现更加方便。其算法软件是一种用于上下位机结构开放式数控系统的新型G代码编译器中的关键模块,它编译出的目标码为上下位机奠定了一个软件接口基础。     

组成于平行机和批处理机的二阶段混合流水作业问题

A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcases. Except for the following two subcases： （1） b≥ an, max{m, B} 〈 n; （2） a1 ≤ b ≤ an, m ≤ B 〈 n, for all other subcases, their NP-hardness was proved or pointed out, corresponding approximation algorithms were conducted and their worst-case performances were estimated. In all these approximation algorithms, the Multifit and PTAS algorithms were respectively used, as the jobs were scheduled in m identical parallel machines.     

一个新的两点梯度法

构造一个新的解无约束优化问题的两点梯度法,类似共轭梯度法,在构造搜索方向时,充分利用上次迭代点的信息·采用强Powell-Wolf搜索准则产生步长,在较弱条件下,算法总体收敛,并且至少线性收敛·数值实验表明,在计算量和结果精度方面明显优于最速下降法·     

Strategic transfer: A tool for academic problem solving

Within the context of classroom learning, strategic transfer can be viewed as a tool for academic problem solving. Strategic transfer is defined as the spontaneous access and retrieval (remembering) of previously learned formal procedures for the successful solution of a problem. The transfer-appropriate processing encoding model (Morris, Bransford, and Franks, 1977), and the transfer-appropriate procedures retrieval model (Roediger, Weldon, and Challis, 1989) are reviewed. An integration of the two models is proposed through the development of a training-for-transfer paradigm (Phye, 1990). By integrating encoding and retrieval processing in a single transfer paradigm the issue of accessing prior knowledge (Bransford, 1990) that is also referred to as the inert knowledge problem (Whitehead, 1929) can directly be addressed.