检索结果-内蒙古大学图书馆

IADIS International Conference on Cognition and Exploratory Learning in Digital Age, CELDA 2005

作者： Monthienvichienchai, Rachada Conlan, Owen Seyedarabi, Faezeh London Knowledge Lab. Institute of Education University of London United Kingdom Knowledge and Data Engineering Group Department of Computer Science Trinity College Dublin Ireland

ISBN: (纸本)9781627483308

This paper proposes a novel approach in integrating seemingly contradictory approaches of teaching and learning via collaborative and personalised learning activities by using augmented reality museum exhibits. The paper highlights the benefits that computer supported collaborative learning and computer supported personalised learning bring or promise to bring to the learner. A proposal is given for a study that will setup a common ground for these two approaches via a location-aware augmented reality museum display. The principal aim of the study is to investigate how the process of learning collaboratively is intertwined with personalised experience of visiting the museum display. Ultimately, the result of the study will provide a new understanding of visitor's experience of museum displays, not only within the context of the museum's location, but also within the classroom where the visit truly begins and finishes.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

Key frame extraction based on shot coverage and distortion

Key frame extraction based on shot coverage and distortion

引用

6th Pacific Rim Conference on Multimedia - Advances in Mulitmedia Information Processing - PCM 2005

作者： Park, Ki Tae Lee, Joong Yong Rim, Kee Wook Moon, Young Shik Department of Computer Science and Engineering Hanyang University Ansan Korea Republic of Department of Knowledge and Industrial Engineering Sun Moon University Chung-Nam Korea Republic of

ISBN: (纸本)3540300406

Key frame extraction has been recognized as one of the important research issues in video information retrieval. Until now, in spite of a lot of research efforts on the key frame extraction for video sequences, existing approaches cannot quantitatively evaluate the importance of extracted frames in representing the video contents. In this paper, we propose a new algorithm for key frame extraction using shot coverage and distortion. The algorithm finds significant key frames from candidate key frames. When selecting the candidate frames, the coverage rate for each frame to the whole frames in a shot is computed by using the difference between adjacent frames. The frames with the coverage rate within 10% from the top are regarded as the candidates. Then, by computing the distortion rate of a candidate against all frames, the most representative frame is selected as a key frame in the shot. The performance of the proposed algorithm has been verified by a statistical test. Experimental results show that the proposed algorithm improves the performance by 13-50% over the existing methods. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

An implementation of the FP-growth algorithm

An implementation of the FP-growth algorithm

引用

1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, OSDM 2005, held in conjunction with the 11th ACM SIGKDD International Conference on knowledge Discovery and Data Mining

作者： Borgelt, Christian Department of Knowledge Processing and Language Engineering School of Computer Science Otto-von-Guericke-University of Magdeburg Universitätsplatz 2 39106 Magdeburg Germany

ISBN: (纸本)1595932100

The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of computing a projection of an FP-tree (the fundamental data structure of the FP-growth algorithm). In addition, projected FP-trees are (optionally) pruned by removing items that have become infrequent due to the projection (an approach that has been called FP-Bonsai). I report experimental results comparing this implementation of the FP-growth algorithm with three other frequent item set mining algorithms I implemented (Apriori, Eclat, and Relim). Copyright 2005 ACM.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Fuzzy frequent pattern discovering based on recursive elimination

Fuzzy frequent pattern discovering based on recursive elimin...

引用

ICMLA 2005: 4th International Conference on Machine Learning and Applications

作者： Xiaomeng, Wang Borgelt, Christian Kruse, Rudolf Department of Knowledge Processing and Language Engineering School of Computer Science Otto-von-Guericke-University of Magdeburg Universitätsplatz 2 39106 Magdeburg Germany

ISBN: (纸本)0769524958

Real life transaction data often miss some occurrences of items that are actually present. As a consequence some potentially interesting frequent patterns cannot be discovered, since with exact matching the number of supporting transactions may be smaller than the user-specified minimum. In order to allow approximate matching during the mining process, we propose an approach based on transaction editing. Our recursive algorithm relies on a step by step elimination of items from the transaction database together with a recursive processing of transaction subsets. This algorithm works without complicated data structures and allows us to find fuzzy frequent patterns easily. © 2005 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Keeping things simple: Finding frequent item sets by recursive elimination

Keeping things simple: Finding frequent item sets by recursi...

引用

ISBN: (纸本)1595932100

Recursive elimination is an algorithm for finding frequent item sets, which is strongly inspired by the FP-growth algorithm and very similar to the H-mine algorithm. It does its work without prefix trees or any other complicated data structures, processing the transactions directly. Its main strength is not its speed (although it is not slow, even outperforms Apriori and Eclat on some data sets), but the simplicity of its structure. Basically all the work is done in one simple recursive function, which can be written with relatively few lines of code. Copyright 2005 ACM.

关键词： Recursive functions

来源：评论

学校读者我要写书评

暂无评论

Implementation of global digital library grid platform using data grid technology

Implementation of global digital library grid platform using...

引用

作者： Yang, Chao-Tung Ho, Hsin-Chuan Yang, I.-Hsien High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Lizen High School Taichung Taiwan Knowledge and Service Information Corporation Taichung City Taiwan

Since the beginning of the 21st century, knowledge has been accumulating at a tremendous speed. The amount of global books, literature, and data available has increased in astounding quantities. The traditional library service system is no longer able to meet the requirements of the present reality. With the development of Internet and rapid advancement of information technology, a totally new knowledge transfer model has been developed: Books and other forms of data (including text, voice and images) are digitized and then provided to readers by way of a more convenient method, in order to search for and obtain the exact content they need from libraries. We propose a concept for a Global Digital Library Grid. This digital library organization would not only include new members (new libraries or new museums) but be flexible enough not to affect the systems and framework of the original Grid member. As the organization grows, it will form an enormous Virtual Grid Digital Library to provide readers with speedy knowledge Service that meets their requirements.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

An efficient virtual aesthetic surgery model based on 2D color photograph

An efficient virtual aesthetic surgery model based on 2D col...

引用

6th Pacific Rim Conference on Multimedia - Advances in Mulitmedia Information Processing - PCM 2005

作者： Park, Hyun Rim, Kee Wook Moon, Young Shik Department of Computer Science and Engineering Hanyang University 1271 Sa-Dong Ansan Kyunggi-Do 425-791 Korea Republic of Department of Knowledge and Industrial Engineering Sun Moon University Chung-Nam Korea Republic of

ISBN: (纸本)3540300406

In this paper, we propose a virtual aesthetic surgery (VAS) system using a deformation technique based on a radial basis function (RBF) and blending technique that combines the deformed facial component with the original face. The proposed VAS system is composed of three main steps. First, various deformation templates are matched to facial components by a multi-resolution active appearance model (MAAM), which is trained by 2D color face images. Next, the VAS system computes the degree of deformation for lattice cells on the free-form deformation (FFD) using the proposed RBF. The deformation error is compensated for by the coefficients of the mapping function, which is recursively solved by the singular value decomposition (SVD) technique using the sum of squared error (SSE) between the deformed control points and target control points on the base curves. Finally, the deformed facial component is blended with the original face using a blending ratio that is computed by the modified Euclidean distance transform. Experimental results show that the proposed deformation and blending techniques are very efficient in terms of smoothness, accuracy, and distortion. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Surgical equipment

来源：评论

学校读者我要写书评

暂无评论

ONE-TO-ONE TECHNOLOGY-ENHANCED LEARNING: AN OPPORTUNITY FOR GLOBAL RESEARCH COLLABORATION

引用

Research and Practice in Technology Enhanced Learning 2006年第1期1卷 3-29页

作者： TAK-WAI CHAN JEREMY ROSCHELLE SHERRY HSI KINSHUK MIKE SHARPLES TOM BROWN CHARLES PATTON JOHN CHERNIAVSKY ROY PEA CATHIE NORRIS ELLIOT SOLOWAY NICOLAS BALACHEFF MARLENE SCARDAMALIA PIERRE DILLENBOURG CHEE-KIT LOOI MARCELO MILRAD ULRICH HOPPE Research Center for Science and Technology for Learning National Central University 300 Jhongda Road Jhongli City 32001 Taiwan ROC Center for Technology in Learning SRI International 333 Ravenswood Ave BN-376 Menlo Park California 94025 USA Center for Learning and Teaching The Exploratorium 3601 Lyon Street San Francisco California 94123 USA Advanced Learning Technologies Research Centre Massey University Private Bag 11-222 Palmerston North New Zealand Learning Sciences Research Institute Nottingham University Jubilee Campus Wollaton Road Nottingham NG8 1BB UK University of Pretoria Telematic Learning & Education Innovation Lynnwood Road Hillcrest Pretoria South Africa 0002 South Africa National Science Foundation 4201 Wilson Boulevard Arlington Virginia 22230 USA Stanford Center for Innovations in Learning Stanford University Wallenberg Hall Building 160 450 Serra Mall Stanford CA 94305-205 USA Department of Cognition and Technology University of North Texas Matthews Hall 316-D PO Box 311337 Denton TX 76203-1337 USA Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109 USA Laboratoire Leibniz 46 Avenue Félix Viallet 38031 Grenoble Cedex France Institute for Knowledge Innovation and Technology OISE/University of Toronto 252 Bloor Street West Toronto Ontario M5S 1V6 Canada Swiss Federal Institute of Technology Ecole Polytechnique Fédérale de Lausanne 1015 Lausanne Switzerland Learning Sciences Lab National Institute of Education Nanyang Technological University 1 Nanyang Walk Singapore 637616 Singapore Center for Learning and Knowledge Technologies Växjö University MSI Växjö University Vejdes plats 6 och 7 351 95 Växjö Sweden Institute for Computer Science and Interactive Systems University Duisburg-Essen Building LF Lotharstr. 63/65 47048 Duisburg Germany

Over the next 10 years, we anticipate that personal, portable, wirelessly-networked technologies will become ubiquitous in the lives of learners — indeed, in many countries, this is already a reality. We see that ready-to-hand access creates the potential for a new phase in the evolution of technology-enhanced learning (TEL), characterized by "seamless learning spaces" and marked by continuity of the learning experience across different scenarios (or environments), and emerging from the availability of one device or more per student ("one-to-one"). One-to-one TEL has the potential to "cross the chasm" from early adopters conducting isolated design studies to adoption-based research and widespread implementation, with the help of research and evaluation that gives attention to the digital divide and other potentially negative consequences of pervasive computing. We describe technology-enhanced learning and the affordances of one-to-one computing and outline a research agenda, including the risks and challenges of reaching scale. We reflect upon how this compares with prior patterns of technology innovation and diffusion. We also introduce a community, called "G1:1," that brings together leaders of major research laboratories and one-to-one TEL projects. We share a vision of global research, inviting other research groups to collaborate in ongoing activities.

关键词： Technology-enhanced learning research collaboration pervasive computing wireless technologies

来源：评论

学校读者我要写书评

暂无评论

Evaluating the feasibility of learning student models from data

Evaluating the feasibility of learning student models from d...

引用

AAAI-05 Workshop

作者： Jonsson, Anders Johns, Jeff Mehranian, Hasmik Arroyo, Ivon Woolf, Beverly Barto, Andrew Fisher, Donald Mahadevan, Sridhar Autonomous Learning Laboratory Department of Computer Science University of Massachusetts Amherst MA 01003 United States Center for Knowledge Communication Department of Computer Science University of Massachusetts Amherst MA 01003 United States Human Performance Laboratory Department of Mechanical and Industrial Engineering University of Massachusetts Amherst MA 01003 United States

ISBN: (纸本)1577352386

Recent work on intelligent tutoring systems has used Bayesian networks to model students' acquisition of skills. In many cases, researchers have hand-coded the parameters of the networks, arguing that the conditional probabilities of models containing hidden variables are too difficult to learn from data. We present a machine learning approach that uses Expectation-Maximization to learn the parameters of a dynamic Bayesian network with hidden variables. We test our methodology on data that was simulated using a state-based model of skill acquisition. Results indicate that it is possible to learn the parameters of hidden variables given enough sequential data of training sessions on similar problems. Copyright © 2005, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Using probabilistic latent semantic analysis for personalized web search

Using probabilistic latent semantic analysis for personalize...

引用

7th Asia-Pacific Web Conference on Web Technologies Research and Development - APWeb 2005

作者： Lin, Chenxi Xue, Gui-Rong Zeng, Hua-Jun Yu, Yong Apex Data and Knowledge Management Lab. Department of Computer Science and Engineering Shanghai JiaoTong University Shanghai 200030 China Microsoft Research Asia 49 Zhichun Road Beijing 100080 China

Web users use search engine to find useful information on the Internet. However current web search engines return answer to a query independent of specific user information need. Since web users with similar web behaviors tend to acquire similar information when they submit a same query, these unseen factors can be used to improve search result. In this paper we present an approach that mines these unseen factors from web logs to personalized web search. Our approach is based on probabilistic latent semantic analysis, a model based technique that is used to analyze co-occurrence data. Experimental results on real data collected by MSN search engine show the improvements over traditional web search. © Springer-Verlag Berlin Heidelberg 2005.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：