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

Frontiers in Education (FIE) Conference

作者： Reginaldo do Prado Leônidas O. Brandão Anarosa A. F. Brandäo Department of Informatics University of São Paulo São Paulo SP Brazil Department of Computer Science University of São Paulo São Paulo SP Brazil Dept. of Computer and Digital Systems Engineering University of São Paulo São Paulo - SP Brazil

ISBN: (纸本)9781479939237

This paper presents iPlan, a model to implement a system to support the creation of lesson plans. It was the result of a systematic review on tools that help teachers on authoring courses that must be delivered through the World Wide Web (Web). The iPlan system aims to simplify teachers' workload while preparing lessons that will be available online in some Learning Management System (LMS). It will provide authoring tools that enable teachers to create and edit lesson plans based on Pedagogical Patterns. By Pedagogical Patterns we mean tested lesson plans or roadmap lessons. Teachers will be empowered with means to create custom patterns, as well. The main feature that distinguishes this study from previous researches is the integrated approach with LMS, lesson plans and pedagogical patterns. In order to allow teachers to store new pedagogical patterns, iPlan uses iRepository, a repository of educational digital content which is also integrated with Moodle. iPlan is being developed for Moodle environment and will be distributed under the GNU Public License (GPL).

关键词： Pedagogical patterns Learning design Educational modeling Distance learning Blended learning Web learning

来源：评论

学校读者我要写书评

暂无评论

TheAdvisor: A webservice for ac ademic recommendation 13

TheAdvisor: A webservice for ac ademic recommendation

引用

13th ACM/IEEE-CS Joint Conference on Digital Libraries, JCDL 2013

作者： Küçüktunç, Onur Saule, Erik Kaya, Kamer Çatalyürek, Ümit V. Dept. of Biomedical Informatics Ohio State University United States Dept. of Computer Science and Engineering Ohio State University United States Dept. of Electrical and Computer Engineering Ohio State University United States

ISBN: (纸本)9781450320764

The academic community has published millions of research papers to date, and the number of new papers has been increasing with time. To discover new research, researchers typically rely on manual methods such as keyword-based search, reading proceedings of conferences, browsing publication lists of known experts, or checking the references of the papers they are interested. Existing tools for the literature search are suitable for a first-level bibliographic search. However, they do not allow complex second-level searches. In this paper, we present a web service called theadvisor (http://***) which helps the users to build a strong bibliography by extending the document set obtained after a first-level search. The service makes use of the citation graph for recommendation. It also features diversification, relevance feedback, graphical visualization, venue and reviewer recommendation. In this work, we explain the design criteria and rationale we employed to make the theadvisor a useful and scalable web service along with a thorough experimental evaluation. Copyright © 2013 by the Association for Computing Machinery, Inc. (ACM).

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Towards a personalized, scalable, and exploratory academic recommendation service

Towards a personalized, scalable, and exploratory academic r...

引用

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013

ISBN: (纸本)9781450322409

Literature search is an integral part of the academic research. Academic recommendation services have been developed to help researchers with their literature search, many of which only provide a text-based search functionality. Such services are suitable for a first-level bibliographic search;however, they lack the benefits of today's recommendation engines. In this paper, we identify three important properties that an academic recommendation service could provide for better literature search: personalization, scalability, and exploratory search. With these objectives in mind, we present a web service called theadvisor which helps the users build a strong bibliography by extending the document set obtained after a first-level search. Along with an efficient and personalized recommendation algorithm, the service also features result diversification, relevance feedback, visualization for exploratory search. We explain the design criteria and rationale we employed to make the theadvisor a useful and scalable web service with a thorough evaluation. Copyright 2013 ACM.

关键词： Bibliographies

来源：评论

学校读者我要写书评

暂无评论

Shattering and compressing networks for betweenness centrality

Shattering and compressing networks for betweenness centrali...

引用

13th SIAM International Conference on Data Mining, SMD 2013

作者： Sanyüce, Ahmet Erdem Saule, Erik Kaya, Kamer Çatalyürek, Ümit V. Dept. of Biomedical Informatics Ohio State University United States Dept. of Computer Science and Engineering Ohio State University United States Dept. of Electrical and Computer Engineering Ohio State University United States

ISBN: (纸本)9781627487245

The betweenness metric has always been intriguing and used in many analyses. Yet, it is one of the most computationally expensive kernels in graph mining. For that reason, making betweenness centrality computations faster is an important and well-studied problem. In this work, we propose the framework, BADIOS, which compresses a network and shatters it into pieces so that the centrality computation can be handled independently for each piece. Although BADIOS is designed and tuned for betweenness centrality, it can easily be adapted for other centrality metrics. Experimental results show that the proposed techniques can be a great arsenal to reduce the centrality computation time for various types and sizes of networks. In particular, it reduces the computation time of a 4.6 million edges graph from more than 5 days to less than 16 hours.

关键词： Electric network analysis

来源：评论

学校读者我要写书评

暂无评论

Diversified recommendation on graphs: Pitfalls, measures, and algorithms 13

Diversified recommendation on graphs: Pitfalls, measures, an...

引用

22nd International Conference on World Wide Web, WWW 2013

作者： Küçüktunç, Onur Saule, Erik Kaya, Kamer Çatalyürek, Ümit V. Dept. Biomedical Informatics Ohio State University United States Dept. of Computer Science and Engineering Ohio State University United States Dept. of Electrical and Computer Engineering Ohio State University United States

ISBN: (纸本)9781450320351

Result diversification has gained a lot of attention as a way to answer ambiguous queries and to tackle the redundancy problem in the results. In the last decade, diversification has been applied on or integrated into the process of PageRankor eigenvector-based methods that run on various graphs, including social networks, collaboration networks in academia, web and product co-purchasing graphs. For these applications, the diversification problem is usually addressed as a bicriteria objective optimization problem of relevance and diversity. However, such an approach is questionable since a query-oblivious diversification algorithm that recommends most of its results without even considering the query may perform the best on these commonly used measures. In this paper, we show the deficiencies of popular evaluation techniques of diversification methods, and investigate multiple relevance and diversity measures to understand whether they have any correlations. Next, we propose a novel measure called expanded relevance which combines both relevance and diversity into a single function in order to measure the coverage of the relevant part of the graph. We also present a new greedy diversification algorithm called Best-Coverage, which optimizes the expanded relevance of the result set with (1-1/e)-approximation. With a rigorous experimentation on graphs from various applications, we show that the proposed method is efficient and effective for many use cases. Copyright is held by the International World Wide Web Conference Committee (IW3C2).

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

Redundant elements in SNOMED CT concept definitions

Redundant elements in SNOMED CT concept definitions

引用

14th Conference on Artificial Intelligence in Medicine, AIME 2013

作者： Dentler, Kathrin Cornet, Ronald Dept. of Computer Science VU University Amsterdam Netherlands Dept. of Medical Informatics Academic Medical Center University of Amsterdam Netherlands Department of Biomedical Engineering Linköping University Sweden

ISBN: (纸本)9783642383250

While redundant elements in SNOMED CT concept definitions are harmless from a logical point of view, they unnecessarily make concept definitions of typically large ontologies such as SNOMED CT hard to construct and to maintain. In this paper, we apply a fully automated method to detect intra-axiom redundancies in SNOMED CT. We systematically analyse the completeness and soundness of the results of our method by examining the identified redundant elements. In absence of a gold standard, we check whether our method identifies concepts that are likely to contain redundant elements because they become equivalent to their stated subsumer when they are replaced by a fully defined concept with the same definition. To evaluate soundness, we remove all identified redundancies, and test whether the logical closure is preserved by comparing the concept hierarchy to the one of the official SNOMED CT distribution. We found that 35,010 of the 296,433 SNOMED CT concepts (12%) contain redundant elements in their definitions, and that the results of our method are sound and complete with respect to our partial evaluation. We recommend to free the stated form from these redundancies. In future, knowledge modellers should be supported by being pointed to newly introduced redundancies. © 2013 Springer-Verlag.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Quantification of intra and inter-ventricular dyssynchrony in Ebstein's anomaly using cardiovascular magnetic resonance myocardial feature tracking

引用

Journal of Cardiovascular Magnetic Resonance 2014年第SUPPL 1期16卷 O108-O108页

作者： Steinmetz, Michael Alt, Sophie-Charlotte Kutty, Shelby Sohns, Jan M Unterberg-Buchwald, Christina Paul, Thomas Hasenfuss, Gerd Lotz, Joachim Lamata, Pablo Schuster, Andreas Department of Pediatric Cardiology and Intensive Care Medicine and Heart Research Center Georg-August-University Göttingen Germany Department of Cardiology and Pneumology and German Centre for Cardiovascular Research Georg-August-University Göttingen Germany University of Nebraska College of Medicine and Children's Hospital Medical Center Omaha Nebraska United States Institute for Diagnostic and Interventional Radiology Georg-August-University Göttingen Germany Department of Computer Science University of Oxford Oxford United Kingdom Dept. of Biomedical Engineering St Thomas' Hospital King's College London United Kingdom

来源：评论

学校读者我要写书评

暂无评论

GPU accelerated maximum cardinality matching algorithms for bipartite graphs

GPU accelerated maximum cardinality matching algorithms for ...

引用

19th International Conference on Parallel Processing, Euro-Par 2013

作者： Deveci, Mehmet Kaya, Kamer Uçar, Bora Çatalyürek, Ümit V. Dept. of Biomedical Informatics Ohio State University United States Dept. of Computer Science and Engineering Ohio State University United States CNRS LIP ENS Lyon France Dept. of Electrical and Computer Engineering Ohio State University United States

ISBN: (纸本)9783642400469

We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on the GPU implementation of the maximum cardinality matching algorithms. We compare the proposed algorithms with serial and multicore implementations from the literature on a large set of real-life problems where in majority of the cases one of our GPU-accelerated algorithms is demonstrated to be faster than both the sequential and multicore implementations. © 2013 Springer-Verlag.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

When do noisy votes reveal the truth? 13

When do noisy votes reveal the truth?

引用

14th ACM Conference on Electronic Commerce, EC 2013

作者： Caragiannis, Ioannis Procaccia, Ariel D. Shah, Nisarg Dept. of Computer Engineering and Informatics Computer Technology Institute University of Patras and CTI Greece Computer Science Department Carnegie Mellon University United States

ISBN: (纸本)9781450319621

A well-studied approach to the design of voting rules views them as maximum likelihood estimators;given votes that are seen as noisy estimates of a true ranking of the alternatives, the rule must reconstruct the most likely true ranking. We argue that this is too stringent a requirement, and instead ask: How many votes does a voting rule need to reconstruct the true ranking? We define the family of pairwise-majority consistent rules, and show that for all rules in this family the number of samples required from the Mallows noise model is logarithmic in the number of alternatives, and that no rule can do asymptotically better (while some rules like plurality do much worse). Taking a more normative point of view, we consider voting rules that surely return the true ranking as the number of samples tends to infinity (we call this property accuracy in the limit);this allows us to move to a higher level of abstraction. We study families of noise models that are parametrized by distance functions, and find voting rules that are accurate in the limit for all noise models in such general families. We characterize the distance functions that induce noise models for which pairwise-majority consistent rules are accurate in the limit, and provide a similar result for another novel family of position-dominance consistent rules. These characterizations capture three well-known distance functions. Copyright © 2013 ACM.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Reducing information redundancy in search results 13

Reducing information redundancy in search results

引用

28th Annual ACM Symposium on Applied Computing, SAC 2013

作者： Plegas, Yannis Stamou, Sofia Computer Engineering and Informatics Department University of Patras 26500 Greece Dept. of Archives and Library Science Ionian University Greece

ISBN: (纸本)9781450316569

It is well-known that the web contains many duplicate and near-duplicate documents. Despite the efforts that have been put towards equipping search engines with duplicate detection algorithms, still there are cases where the documents retrieved in response to web queries contain redundant information. In this paper, we are concerned with effectively identifying and reducing redundant information in search results. In particular, we describe how we automatically detect content that is lexically and/or semantically duplicated across search results and we introduce a novel algorithm that upon the detection of significant (i.e., above a given threshold) content duplication, it filters out redundant information. Information filtering takes place in two-steps depending on whether we are dealing with documents of (nearly) identical lexical content or with documents of lexically distinct but semantically equivalent content. In the first case, our algorithm retains in the result list the document that is the most relevant to the query intention and removes duplicates. In the second case, our algorithm merges into a single text, which we call SuperText, the documents of redundant information in a way that every document contributes diverse semantic content to the generated SuperText. Additionally, the algorithm re-ranks the remaining documents based on their contextual relevance to the query intention. The experimental evaluation of our approach demonstrates that it is very effective in identifying lexical and semantic information redundancy across search results. In addition, we have found that our algorithm manages to filter out successfully content duplication from the results list and the SuperTexts it generates for reducing information redundancy are syntactically and semantically coherent texts. Copyright 2013 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：