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

On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2016年第1期17卷

作者： Kevin Murphy Bernhard Schölkopf Vince Lyzinski Keith Levin Donniell E. Fishkind Carey E. Priebe Google MPI for Intelligent Systems Department of Applied Math and Statistics Johns Hopkins University Baltimore MD Department of Computer Science Johns Hopkins University Baltimore MD

Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a concentration of interesting vertices at the top of the list. Previous work has yielded several approaches to this problem, with theoretical results in the setting where the graph is drawn from a stochastic block model (SBM), including a vertex nomination analogue of the Bayes optimal classifier. In this paper, we prove that maximum likelihood (ML)-based vertex nomination is consistent, in the sense that the performance of the ML-based scheme asymptotically matches that of the Bayes optimal scheme. We prove theorems of this form both when model parameters are known and unknown. Additionally, we introduce and prove consistency of a related, more scalable restricted-focus ML vertex nomination scheme. Finally, we incorporate vertex and edge features into ML-based vertex nomination and briey explore the empirical effectiveness of this approach.

关键词： graph inference graph matching graph mining stochastic block model vertex nomination

来源：评论

学校读者我要写书评

暂无评论

Automatic Command Queue Scheduling for Task-Parallel Workloads in OpenCL

Automatic Command Queue Scheduling for Task-Parallel Workloa...

引用

IEEE International Conference on Cluster Computing

作者： Ashwin Mandayam Aji Antonio J. Peña Pavan Balaji Wu-chun Feng AMD Research Advanced Micro Devices Inc. +Math. and Comp. Sci. Division Argonne National Laboratory Department of Computer Science Virginia Tech

OpenCL is a portable interface that can be used to program cluster nodes with heterogeneous compute devices. The OpenCL specification tightly binds its workflow abstraction, or "command queue," to a specific device for the entire program. For best performance, the user has to find the ideal queue -- device mapping at command queue creation time, an effort that requires a thorough understanding of the match between the characteristics of all the underlying device architectures and the kernels in the program. In this paper, we propose to add scheduling attributes to the OpenCL context and command queue objects that can be leveraged by an intelligent runtime scheduler to automatically perform ideal queue - device mapping. Our proposed extensions enable the average OpenCL programmer to focus on the algorithm design rather than scheduling and automatically gain performance without sacrificing programmability. As an example, we design and implement an OpenCL runtime for task-parallel workloads, called MultiCL, which efficiently schedules command queues across devices. Within MultiCL, we implement several key optimizations to reduce runtime overhead. Our case studies include the SNU-NPB OpenCL benchmark suite and a real-world seismology simulation. We show that, on average, users have to apply our proposed scheduler extensions to only four source lines of code in existing OpenCL applications in order to automatically benefit from our runtime optimizations. We also show that MultiCL always maps command queues to the optimal device set with negligible runtime overhead.

关键词： Kernel Runtime Performance evaluation Processor scheduling Context Schedules Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Foreword

Proceedings of the 2016 International Conference on Image Pr...

引用

Proceedings of the 2016 International Conference on Image Processing, computer Vision, and Pattern Recognition, IPCV 2016 2016年

作者： Abd-Wahab, Mohd Helmy Al-Bakry, Abbas Al-Holou, Nizar Arabnia, Hamid R. Bhattacharya, Mahua Martinez Castillo, Juan Jose Daimi, Kevin Deligiannidis, Leonidas Djoudi, Lamia Atma Duong, Trung Eshaghian-Wilner, Mary Mehrnoosh Gravvanis, George A. Huang, Ruizhu Jandieri, George Kim, Byung-Gyu Kim, Tai-hoon Korovin, Iakov Lai, Guoming Lee, Hyo Jong Bin Mansor, Muhammad Naufal Marsh, Andrew Mostafaeipour, Ali Park, James J. Patil, Shashikant Ponalagusamy, R. Schaefer, Gerald Singh, Akash Solo, Ashu M.G. Swee, Sim Kok Thomas, Jaya Tinetti, Fernando G. Vladimir, Hahanov Wang, Shiuh-Jeng Yang, Mary Yoe, Hyun You, Jane Zhao, Wenbing Department of Computer Engineering University Tun Hussein Onn Malaysia Malaysia University of IT and Communications Baghdad Iraq Electrical and Computer Engineering Department IEEE/SEM-Computer Chapter University of Detroit Mercy DetroitMI United States University of Georgia United States ABV Indian Institute of Information Technology and Management MHRD Government of India India Acantelys Alan Turing Nikola Tesla Research Group and GIPEB Universidad Nacional Abierta Venezuela Computer Science and Software Engineering Programs Department of Mathematics Computer Science and Software Engineering University of Detroit Mercy DetroitMI United States Department of Computer Information Systems Wentworth Institute of Technology BostonMA United States Synchrone Technologies France Rutgers University State University of New Jersey New Jersey United States University of Southern California California United States Electrical Engineering University of California Los Angeles Los Angeles [UCLA CA United States Advanced Scientific Computing Applied Math and Applications Research Group Applied Mathematics and Numerical Computing and Department of ECE School of Engineering Democritus University of Thrace Xanthi Greece Texas Advanced Computing Center University of Texas AustinTX United States Georgian Technical University Tbilisi Georgia Institute of Cybernetics Georgian Academy of Science Georgia Multimedia Processing CommunicationsLab.[MPCL Department of Computer Science and Engineering College of Engineering SunMoon University Korea Republic of School of Information and Computing Science University of Tasmania Australia Southern Federal University Russia Computer Science and Technology Sun Yat-Sen University Guangzhou China Center for Advanced Image and Information Technology Division of Computer Science and Engineering Chonbuk National University Korea Republic of Faculty of Engineering Technology Kampus Uniciti Alam Universiti Malaysia Perlis UniMAP Malaysi

来源：评论

学校读者我要写书评

暂无评论

FCA-Based Rule Generator, a framework for the genetic generation of fuzzy classification systems using formal concept analysis

FCA-Based Rule Generator, a framework for the genetic genera...

引用

IEEE International Conference on Fuzzy Systems

作者： Marcos E. Cintra Maria C. Monard Heloisa A. Camargo Natural and Exact Sciences Department Federal Territorial Uni. of the Semi-Arid Brazil Inst. of Math. and Computer Sciences Sao Paulo University Brazil Computer Science Department Federal Uni. of Sao Carlos Brazil

ISBN: (纸本)9781467374293

There is a number of frameworks for the general task of classification available for free usage on the Internet. However, software to generate fuzzy classification systems using the genetic approach is scarce. In this work, we present the FCA-Based Rule Generator framework to automatically generate fuzzy classification systems based on a genetic rule selection process. Such rules are extracted from data using a formal concept analysis approach. The FCA-Based Rule Generator framework includes modules for dataset preprocessing, automatic definition of fuzzy data bases from data, dataset optimization, a module based on formal concept analysis for rule extraction, a genetic algorithm module, as well as a rule base optimization module. The software is described and an example of use is presented.

关键词： FCA-Based Rule Generator genetic generation fuzzy classification systems

来源：评论

学校读者我要写书评

暂无评论

Advantages of computer simulation in enhancing students’ learning about landform evolution: A case study using the grand canyon

引用

Journal of Geoscience Education 2016年第1期64卷 60-73页

作者： Luo, Wei Pelletier, Jon Duffin, Kirk Ormand, Carol Hung, Wei-Chen Shernoff, David J. Zhai, Xiaoming Iverson, Ellen Whalley, Kyle Gallaher, Courtney Furness, Walter Department of Geography Northern Illinois University Davis Hall DeKalb 60115 IL United States Department of Geosciences University of Arizona 1040 E. Fourth Street Tucson 85721 AZ United States Department of Computer Science Northern Illinois University DeKalb 60115 IL United States Science Education Resource Center Carleton College W-SERC One North College Street Northfield 55057 MN United States Department of Educational Technology Research and Assessment (ETRA) Northern Illinois University DeKalb 60115 IL United States Graduate School of Applied and Professional Psychology Rutgers University 152 Frelinghuysen Road Piscataway 08854-8020 NJ United States Engineering Math and Physical Science Division College of Lake County 19351 West Washington Street Grayslake 60030-1198 IL United States

The long geological time needed for landform development and evolution poses a challenge for understanding and appreciating the processes involved. The Web-based Interactive Landform Simulation Model—Grand Canyon (WILSIM-GC, http://***/landform/) is an educational tool designed to help students better understand such processes, using the Grand Canyon as an example. Although the project is still ongoing, here, we present the I nitial results of using the WILSIM-GC in an introductory physical geography laboratory course. We used a quasiexperimental design to assess the efficacy of WILSIM-GC as a tool for teaching landform development and evolution. Students were assigned to a control group or a treatment group, alphabetically by last name. Pretests and posttests were administered to measure students’ understanding of the concepts and processes related to Grand Canyon formation and evolution. Results show that, although both the interactive simulation and a more-traditional, paper-based exercise were effective in helping students learn landform evolution processes, there were several advantages and affordances to the simulation approach. The improvement effect from pretest to posttest scores was large for the treatment group, but small to moderate for the control group. In addition, for those questions requiring higher-level thinking, the percentage of students answering correctly was higher in the treatment group than it was in the control group. Furthermore, responses to the attitudinal survey indicate that students generally favor the interactive simulation approach. We can leverage these advantages to enhance students’ learning by integrating interactive simulation exercises into curricular materials, including materials for online or hybrid courses and flipped classrooms. © 2016 National Association of Geoscience Teachers.

关键词： Grand Canyon Landform evolution Learning Simulation model Treatment/control experiment

来源：评论

学校读者我要写书评

暂无评论

An Alternative Technique for Imaging Registration in IVUS Images

An Alternative Technique for Imaging Registration in IVUS Im...

引用

International Conference on Computational science and Computational Intelligence (CSCI)

作者： M. A. Granero Mariana P. M. A. Baroni E. T. Costa P. I. Radeva sciences and Mathematics Department Federal Institute of Education São Paulo-SP Brazil Sci. & Math. Dept. Fed. Inst. of Educ. Sao Paulo Brazil Faculty of Electrical and Computer Engineering State University of Campinas Campinas SP Brazil Applied Mathematics and Analysis Department University of Barcelona Barcelona Spain

ISBN: (纸本)9781467397964

Image registration technique has played a major role due to the use of data from different medical imaging modalities in which your main goal is to find anatomical and/or functional matches in two or more images. SIFT algorithm was used to extract a set of descriptors in IVUS images of two different pullbacks and to determine the number of common features between each pair of images. Similarity map was created to establish correspondences between two PCI images. Our method, with saltatory condition, was proved be a good choice in the experiments and in the real case, showing great stability in the establishment of correspondences and reducing overall time used for the diagnosis and/or monitor the development of coronary heart disease.

关键词： Feature extraction Image registration Robustness Biomedical imaging Medical services Heart Image color analysis

来源：评论

学校读者我要写书评

暂无评论

Portable, MPI-interoperable Coarray Fortran 14

Portable, MPI-interoperable Coarray Fortran

引用

2014 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014

作者： Yang, Chaoran Bland, Wesley Mellor-Crummey, John Balaji, Pavan Department of Computer Science Rice University United States Math. and Comp. Sci. Division Argonne National Laboratory United States Mathematics and Computer Science Division Argonne National Laboratory United States

ISBN: (纸本)9781450326568

The past decade has seen the advent of a number of parallel programming models such as Coarray Fortran (CAF), Unified Parallel C, X10, and Chapel. Despite the productivity gains promised by these models, most parallel scientific applications still rely on MPI as their data movement model. One reason for this trend is that it is hard for users to incrementally adopt these new programming models in existing MPI applications. Because each model use its own runtime system, they duplicate resources and are potentially errorprone. Such independent runtime systems were deemed necessary because MPI was considered insufficient in the past to play this role for these languages. The recently released MPI-3, however, adds several new capabilities that now provide all of the functionality needed to act as a runtime, including a much more comprehensive one-sided communication framework. In this paper, we investigate how MPI-3 can form a runtime system for one example programming model, CAF, with a broader goal of enabling a single application to use both MPI and CAF with the highest level of interoperability. Copyright © 2014 ACM.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Portable, MPI-interoperable coarray fortran

Portable, MPI-interoperable coarray fortran

引用

The past decade has seen the advent of a number of parallel programming models such as Coarray Fortran (CAF), Unified Parallel C, X10, and Chapel. Despite the productivity gains promised by these models, most parallel scientific applications still rely on MPI as their data movement model. One reason for this trend is that it is hard for users to incrementally adopt these new programming models in existing MPI applications. Because each model use its own runtime system, they duplicate resources and are potentially error-prone. Such independent runtime systems were deemed necessary because MPI was considered insufficient in the past to play this role for these languages. The recently released MPI-3, however, adds several new capabilities that now provide all of the functionality needed to act as a runtime, including a much more comprehensive one-sided communication framework. In this paper, we investigate how MPI-3 can form a runtime system for one example programming model, CAF, with a broader goal of enabling a single application to use both MPI and CAF with the highest level of interoperability. © 2014 ACM.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Õ(√n)-space and polynomial-time algorithm for planar directed graph reachability

Õ(√n)-space and polynomial-time algorithm for planar direc...

引用

39th International Symposium on math.matical Foundations of computer science, MFCS 2014

作者： Asano, Tetsuo Kirkpatrick, David Nakagawa, Kotaro Watanabe, Osamu Japan Advanced Institute of Technology Japan Department of Computer Science University of British Columbia Canada Department of Math. and Comput. Sci. Tokyo Institute of Technology Japan

ISBN: (纸本)9783662444641

The directed graph reachability problem takes as input an n-vertex directed graph G=(V,E), and two distinguished vertices v 0, and vertex v *. The problem is to determine whether there exists a path from v 0 to v * in G. The main result of this paper is to show that the directed graph reachability problem restricted to planar graphs can be solved in polynomial time using only Õ(√n) space. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Asymptotically truthful equilibrium selection in large congestion games 14

Asymptotically truthful equilibrium selection in large conge...

引用

15th ACM Conference on Economics and Computation, EC 2014

作者： Rogers, Ryan M. Roth, Aaron Applied Math and Computational Science Department University of Pennsylvania Philadelphia PA United States Computer and Information Science Department University of Pennsylvania Philadelphia PA United States

ISBN: (纸本)9781450325653

Studying games in the complete information model makes them analytically tractable. However, large n player interactions are more realistically modeled as games of incomplete information, where players may know little to nothing about the types of other players. Unfortunately, games in incomplete information settings lose many of the nice properties of complete information games: the quality of equilibria can become worse, the equilibria lose their ex-post properties, and coordinating on an equilibrium becomes even more difficult. Because of these problems, we would like to study games of incomplete information, but still implement equilibria of the complete information game induced by the (unknown) realized player types. This problem was recently studied by Kearns et al [Kearns et al. 2014], and solved in large games by means of introducing a weak mediator: their mediator took as input reported types of players, and output suggested actions which formed a correlated equilibrium of the underlying game. Players had the option to play independently of the mediator, or ignore its suggestions, but crucially, if they decided to opt-in to the mediator, they did not have the power to lie about their type. In this paper, we rectify this deficiency in the setting of large congestion games. We give, in a sense, the weakest possible mediator: it cannot enforce participation, verify types, or enforce its suggestions. Moreover, our mediator implements a Nash equilibrium of the complete information game. We show that it is an (asymptotic) ex-post equilibrium of the incomplete information game for all players to use the mediator honestly, and that when they do so, they end up playing an approximate Nash equilibrium of the induced complete information game. In particular, truthful use of the mediator is a Bayes-Nash equilibrium in any Bayesian game for any prior. © 2014 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：