Souls on Ice: Incorporating Emotion in Web-Based Education

SUMMARY

Emotions have been neglected in education and online education, in favor of a heavy emphasis on cognition and rationality. This article explores the significance of emotion in learning and how recent research is identifying some pathways and dynamics in the way emotions impact on learning and on web-based learning. Online learners have not been considered as “emotional beings” and web-based education has not addressed this dimension in any significant way. A constructivist, emotionally-oriented (CEO) model of web-based education is introduced which emphasizes safety, challenge, and new thinking, and offers several strategies to enhance the emotional experience of learners.     

高校学籍管理系统的开发

VisualFoxPro是为数据库结构和应用程序开发而设计的功能强大的面向对象的环境。本设计将Visual FoxPro数据库技术于高校学籍管理系统的开发,利用其可视化的设计工具和表单向导,快速创建出应用程序“学生学籍表”。该表单反映了学生的基本情况和各门课程的成绩。在该表单中还可以进行查找、打印、添加、编辑等操作,具有一定的实用性。     

教育资源库检索结果的评价技术研究

对教育资源库的检索结果评价是各种教育资源库检索性能评价方案中最直接的方法。该文在总结目前教育资源库的四种主流检索方式的基础上,分析了传统信息检索的特征,结合教育资源库的网络化、海量化发展趋势,借鉴网络搜索引擎评价技术中的“相关性范畴”和“前X命中纪录查准率”概念,提出了一种基于考察替代查准率来对教育资源库检索结果进行评价的方法。     

Semi-online scheduling with “end of sequence” information

We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing time. Moreover, the last job is marked, and thus it is known for every new job whether it is the final job of the sequence. We explore this model on two uniformly related machines, that is, two machines with possibly different speeds. Two objectives are considered, maximizing the minimum completion time and minimizing the maximum completion time (makespan). Let s be the speed ratio between the two machines, we consider the competitive ratios which are possible to achieve for the two problems as functions of s. We present algorithms for different values of s and lower bounds on the competitive ratio. The proposed algorithms are best possible for a wide range of values of s. For the overall competitive ratio, we show tight bounds of ϕ + 1 ≈ 2.618 for the first problem, and upper and lower bounds of 1.5 and 1.46557 for the second problem. The authors would like to dedicate this paper to the memory of our colleague and friend Yong He who passed away in August 2005 after struggling with illness. D. Ye: Research was supported in part by NSFC (10601048).     

Searching for Elder Abuse: A Systematic Review of Database Citations

ABSTRACT

The aim of this review was to describe trends and patterns in elder abuse literature and research. All citations in PUB MED, CINAHL, and PsycINFO databases located using the search term “elder abuse” were retrieved (3,059 citations) and 2,418 unique references were identified. Using manifest content analysis, non-research material (1,986 references) was sorted by type and research references (34 dissertations and 398 research articles) were categorized. Research article references most commonly: (1) investigated prevalence, typology, and definitions of elder abuse; (2) utilized quantitative methodology; (3) had first author affiliations to medicine, nursing, and social sciences; and (4) sampled populations of professionals, personnel, cases, or charts. The USA was most frequently listed of 24 identified countries of origin. Elder abuse research shows lack of diversity, slow increase of qualitative research, limited involvement of older persons and family members as participants, and minimal research from developing countries. This review contributes to knowledge valuable for researchers and experts planning future studies or elder abuse projects.     

Online coupon consumption problem

Nowadays, it is popular that the dealer makes profits by selling a kind of discount coupons, which can be used as money to purchase commodities with total cost less than or equal to the face value of the coupon. We can purchase a coupon at a price of 0<s≤1 times its face value and the number of potential purchasable coupons is a given integer l. The customer has the option to buy the goods by cash completely or by a discount coupon. However, each piece of goods can only use one coupon and the coupon used must have enough balance for the goods. The objective is to minimize the total cost for purchasing all the goods. In this paper, we reduce the problem to a special bin packing model. We consider the online problems for all 0<s≤1 and 1≤l≤∞. We present optimal online algorithms for all 0<s≤1 when l=∞ and l=1. For 2≤l<∞, we give both a lower bound and an algorithm, and show the algorithm is optimal for l=2. A preliminary version of this paper appeared in the proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, Lecture Notes in Computer Science. Y. Jiang supported by Natural Science Foundation of Zhejiang Province (Y605316). Z. Tan supported by Natural Science Foundation of China (10671177, 60021201).     

我国企业开展电子商务的障碍分析

本文运用辨证唯物主义的观点对我国企业开展电子商务的障碍从内因和外因两个方面进行阐述 ,作为电子商务主体的企业 ,其内在动因不足才是我国企业电子商务发展缓慢的根本原因所在 ,即内部障碍 ,主要表现为组织结构转型的困难及企业目标与个人目标的冲突等方面 ;企业的外部环境因素如安全认证 ,支付系统等的缺乏和不完善又构成企业电子商务发展的外部障碍     

TARGETING WORKING PROFESSIONALS: A MASTER'S OF ARTS IN GERONTOLOGY

This overview of an online degree programme aims to develop a concrete illustration of an exploding array of courses and programmes. The approach at the Ethel Percy Andrus Gerontology Center, at the University of Southern California, seeks to address a targeted audience and to build on the special strengths and more unique degree programmes of the University.     

数据仓库技术与应用

数据仓库是９０年代初提出的概念，是一个作为决策支持系统和联机分析（ＯＬＡＰ）的结构化数据环境，数据仓库对传统数据库的数据进行清理、抽取和转换，并按决策主题的需要进行重新组织，它在发达国家的金融、电讯、证券、保险、零售业也广泛应用，随着我国经济体制的变化、在我国有广泛的应用前景。     

“满铁资料”发掘研究之探讨

“满铁资料”是日本军国主义侵略中国的铁证，也是研究当时历史和教育子孙后代的重要材料。对“满铁资料”进行发掘研究具有重要意义和学术价值。“满铁资料”数据库的建设可以比照CALIS专题特色数据库建设，遵循“分散建设、统一检索、资源共享”的原则。统一“满铁资料”数据库的建库标准和服务功能要求，构建统一的公共检索平台，鼓励“满铁资料”重点收藏单位积极参加“满铁资料数据库”的建设，建成一批各具特色的“满铁资料”子数据库。