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

Proceedings of the 8th Annual Conference on the science of Dissemination and Implementation : Washington, DC, USA. 14-15 December 2015

引用

Implementation science : IS 2016年第2期11 Suppl 2卷 100页

作者： Chambers, David Simpson, Lisa Hill-Briggs, Felicia Neta, Gila Vinson, Cynthia Beidas, Rinad Marcus, Steven Aarons, Gregory Hoagwood, Kimberly Schoenwald, Sonja Evans, Arthur Hurford, Matthew Rubin, Ronnie Hadley, Trevor Barg, Frances Walsh, Lucia Adams, Danielle Mandell, David Martin, Lindsey Mignogna, Joseph Mott, Juliette Hundt, Natalie Kauth, Michael Kunik, Mark Naik, Aanand Cully, Jeffrey McGuire, Alan White, Dominique Bartholomew, Tom McGrew, John Luther, Lauren Rollins, Angie Salyers, Michelle Cooper, Brittany Funaiole, Angie Richards, Julie Lee, Amy Lapham, Gwen Caldeiro, Ryan Lozano, Paula Gildred, Tory Achtmeyer, Carol Ludman, Evette Addis, Megan Marx, Larry Bradley, Katharine VanDeinse, Tonya Wilson, Amy Blank Stacey, Burgin Powell, Byron Bunger, Alicia Cuddeback, Gary Barnett, Miya Stadnick, Nicole Brookman-Frazee, Lauren Lau, Anna Dorsey, Shannon Pullmann, Michael Mitchell, Shannon Schwartz, Robert Kirk, Arethusa Dusek, Kristi Oros, Marla Hosler, Colleen Gryczynski, Jan Barbosa, Carolina Dunlap, Laura Lounsbury, David O’Grady, Kevin Brown, Barry Damschroder, Laura Waltz, Thomas Ritchie, Mona Atkins, David Imel, Zac E. Xiao, Bo Can, Doğan Georgiou, Panayiotis Narayanan, Shrikanth Berkel, Cady Gallo, Carlos Sandler, Irwin Brown, C. Hendricks Wolchik, Sharlene Mauricio, Anne Marie Mehrotra, Sanjay Chandurkar, Dharmendra Bora, Siddhartha Das, Arup Tripathi, Anand Saggurti, Niranjan Raj, Anita Hughes, Eric Jacobs, Brian Kirkendall, Eric Loeb, Danielle Trinkley, Katy Yang, Michael Sprowell, Andrew Nease, Donald Lyon, Aaron Lewis, Cara Boyd, Meredith Melvin, Abigail Nicodimos, Semret Liu, Freda Jungbluth, Nathanial Flynn, Allen Landis-Lewis, Zach Sales, Anne Baloh, Jure Ward, Marcia Zhu, Xi Bennett, Ian Unutzer, Jurgen Mao, Johnny Proctor, Enola Vredevoogd, Mindy Chan, Ya-Fen Williams, Nathaniel Green, Phillip Bernstein, Steven Rosner, June-Marie DeWitt, Michelle Tetrault, Jeanette Dziura, James Hsiao, Allen Sussman, Scott O’Connor, Patrick Toll, Benjamin Jones, Michael Gassaway, Julie Tobin, Jonathan Zatzic Division of Cancer Control and Population Sciences National Cancer Institute National Institutes of Health Rockville USA AcademyHealth Washington USA Department of Medicine and Welch Center for Prevention Epidemiology and Clinical Research Johns Hopkins Medical Institutions Baltimore USA Psychiatry University of Pennsylvania Philadelphia USA Family Medicine and Community Health University of Pennsylvania Philadelphia USA School of Social Policy and Practice University of Pennsylvania Philadelphia USA Psychiatry UC San Diego La Jolla USA Child & Adolescent Psychiatry The Child Study Center at NYU Langone Medical Center New York NY New York USA Psychiatry and Behavioral Sciences MUSC Charleston USA DBHIDS City of Philadelphia Philadelphia USA CBH City of Philadelphia Philadelphia USA Psychiatry University of Pennsylvania Perelman School of Medicine Philadelphia USA Health Services Research & Development Department of Veterans Affairs & Baylor College of Medicine Houston USA Treatment Core Department of Veterans Affairs Waco USA National Center for PTSD Executive Division Department of Veterans Affairs White River Junction USA HSR&D HSR&D Center for Health Information and Communication Roudebush VA Medical Center Indianapolis USA Psychology Indiana University Purdue University Indianapolis Indianapolis USA Department of Psychiatric Rehabilitation and Counseling Rutgers University Newark USA Health Services Research & Development Richard L. Roudebush VAMC Indianapolis USA IUPUI Department of Psychology ACT Center of Indiana Indianapolis USA Human Development Washington State University Pullman USA Prevention Science Washington State University Pullman USA Group Health Research Institute Group Health Seattle USA Behavioral Health Services Group Health Seattle USA Preventive Care Group Health Seattle USA Health Services Research & Development Primary and Specialty Medical Care Service VA Puget Sound Seattle USA School of Social Work Un

A1 Introduction to the 8th Annual Conference on the science of Dissemination and Implementation: Optimizing Personal and Population Health David Chambers, Lisa Simpson D1 Discussion forum: Population health D&I research Felicia Hill-Briggs D2 Discussion forum: Global health D&I research Gila Neta, Cynthia Vinson D3 Discussion forum: Precision medicine and D&I research David Chambers S1 Predictors of community therapists’ use of therapy techniques in a large public mental health system Rinad Beidas, Steven Marcus, Gregory Aarons, Kimberly Hoagwood, Sonja Schoenwald, Arthur Evans, Matthew Hurford, Ronnie Rubin, Trevor Hadley, Frances Barg, Lucia Walsh, Danielle Adams, David Mandell S2 Implementing brief cognitive behavioral therapy (CBT) in primary care: Clinicians' experiences from the field Lindsey Martin, Joseph Mignogna, Juliette Mott, Natalie Hundt, Michael Kauth, Mark Kunik, Aanand Naik, Jeffrey Cully S3 Clinician competence: Natural variation, factors affecting, and effect on patient outcomes Alan McGuire, Dominique White, Tom Bartholomew, John McGrew, Lauren Luther, Angie Rollins, Michelle Salyers S4 Exploring the multifaceted nature of sustainability in community-based prevention: A mixed-method approach Brittany Cooper, Angie Funaiole S5 Theory informed behavioral health integration in primary care: Mixed methods evaluation of the implementation of routine depression and alcohol screening and assessment Julie Richards, Amy Lee, Gwen Lapham, Ryan Caldeiro, Paula Lozano, Tory Gildred, Carol Achtmeyer, Evette Ludman, Megan Addis, Larry Marx, Katharine Bradley S6 Enhancing the evidence for specialty mental health probation through a hybrid efficacy and implementation study Tonya VanDeinse, Amy Blank Wilson, Burgin Stacey, Byron Powell, Alicia Bunger, Gary Cuddeback S7 Personalizing evidence-based child mental health care within a fiscally mandated policy reform Miya Barnett, Nicole Stadnick, Lauren Brookman-Frazee, Anna Lau S8 Leveraging an existing

关键词： Veteran Affair Motivational Interview Qualitative Comparative Analysis Community That Care Supplemental Nutrition Assistance Program

来源：评论

学校读者我要写书评

暂无评论

Accelerating Value-at-Risk estimation on highly parallel architectures

Accelerating Value-at-Risk estimation on highly parallel arc...

引用

作者： Dixon, M.F. Chong, J. Keutzer, K. Department of Mathematics University of California One Shields Avenue Davis CA 95616 United States Parasians LLC 258 Ficus Terrace Sunnyvale CA 94086 United States Department of Electrical Engineering and Computer Science 576 Soda Hall UC Berkeley CA 94720 United States

Values of portfolios in modern financial markets may change precipitously with changing market conditions. The utility of financial risk management tools is dependent on whether they can estimate Value-at-Risk (VaR) of portfolios on-demand when key decisions need to be made. However, VaR estimation of portfolios uses the Monte Carlo method, which is a computationally intensive method often run as an overnight batch job. With the proliferation of highly parallel computing platforms such as multicore CPUs and manycore graphics processing units (GPUs), teraFLOPS of computation capability is now available on a desktop computer, enabling the VaR of large portfolios with thousands of risk factors to be computed within only a fraction of a second. Achieving such performance in practice requires the assimilation of expertise in the following three areas: (i) application domain;(ii) statistical analytics;and (iii) parallel computing. This paper demonstrates that these areas of expertise inform optimization perspectives that, when combined, lead to 127×speedup on our CPU-based implementation and 538×speedup on our GPU-based implementation. Copyright © 2011 John Wiley & Sons, Ltd.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Managing plug-loads for demand response within buildings 11

Managing plug-loads for demand response within buildings

引用

3rd ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Buildings, BuildSys 2011 - Held in Conjunction with ACM SenSys 2011

作者： Weng, Thomas Balaji, Bharathan Dutta, Seemanta Gupta, Rajesh Agarwal, Yuvraj Department of Computer Science and Engineering UC San Diego United States

ISBN: (纸本)9781450307499

Detailed and accurate energy accounting is an important first step in improving energy efficiency within buildings. Based on this information, building managers can perform active energy management, especially during demand response situations that require load shedding over short time scales. While individual plug-loads are an important target for demand response, they pose significant challenges due to their distributed nature and the significant diversity of devices that are deployed. This paper presents the design and implementation of our energy accounting and management system which is specifically geared towards managing plug-loads within enterprise buildings. Our system provides fine-grained visibility and control of plug-loads to building managers, allowing them to deal with demand response situations through user-specified actuation policies. At its core, our system consists of our wireless smart energy meter with actuation capabilities, ZigBee-based wireless network infrastructure, and our Demand Response Server, an analysis engine that provides interfaces for initiating load-shedding policies. Our micro-benchmarks show the different methods that building managers can utilize to efficiently manage devices during demand response events. © 2011 ACM.

关键词： Buildings

来源：评论

学校读者我要写书评

暂无评论

Information flow isolation in I2C and USB 11

Information flow isolation in I2C and USB

引用

Proceedings of the 48th Design Automation Conference

作者： Oberg, Jason Hu, Wei Irturk, Ali Tiwari, Mohit Sherwood, Timothy Kastner, Ryan Computer Science and Engineering UC San Diego United States Automation Northwestern Polytechnical University Xi'an China Computer Science UC Santa Barbara United States

ISBN: (纸本)9781450306362

Flight control, banking, medical, and other high assurance systems have a strict requirement on correct operation. Fundamental to this is the enforcement of non-interference where particular subsystems should not affect one another. In an effort to help guarantee this policy, recent work has emerged with tracking information flows at the hardware level. This article uses a specific method known as gate-level information flow tracking (GLIFT) to provide a methodology for testing information flows in two common bus protocols, I 2C and USB. We show that the protocols do elicit unintended information flows and provide a solution based on time division multiple access (TDMA) that provably isolates devices on the bus from these flows. This paper also discusses the overheads in area and simulation time incurred by this TDMA based solution. © 2011 ACM.

关键词： Time division multiple access

来源：评论

学校读者我要写书评

暂无评论

Divide-and-conquer matrix factorization

Divide-and-conquer matrix factorization

引用

25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

作者： MacKey, Lester Talwalkar, Ameet Jordan, Michael I. Department of Electrical Engineering and Computer Science UC Berkeley United States Department of Statistics UC Berkeley United States

ISBN: (纸本)9781618395993

This work introduces Divide-Factor-Combine (DFC), a parallel divide-and-conquer framework for noisy matrix factorization. DFC divides a large-scale matrix factorization task into smaller subproblems, solves each subproblemin parallel using an arbitrary base matrix factorization algorithm, and combines the subproblem solutions using techniques from randomized matrix approximation. Our experiments with collaborative filtering, video background modeling, and simulated data demonstrate the near-linear to super-linear speed-ups attainable with this approach. Moreover, our analysis shows that DFC enjoys high-probability recovery guarantees comparable to those of its base algorithm.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Snap! (build your own blocks): tutorial presentation

Journal of Computing Sciences in Colleges

引用

Journal of Computing sciences in Colleges 2012年第4期27卷

作者： Dan Garcia Luke Segars Josh Paley Electrical Engineering and Computer Science UC Berkeley Computer Science Teacher Henry M. Gunn High School in Palo Alto

This workshop is for high school and college teachers of general-interest ("CS 0") computer science courses. It presents the programming environment used in two of the five initial AP CS Principles pilot ***! (Build Your Own Blocks) is a free, graphical, drag-and-drop extension to the Scratch programming language. Scratch, designed for 8--14 year olds, models programs as "scripts" without names, arguments, or return values. SNAP! supports older learners (14--20) by adding named procedures (thus recursion), procedures as data (thus higher order functions) structured lists, and sprites as first class objects with *** will learn SNAP! through discussion, programming exercises, and exploration. See http://*** for details. Laptop required.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Communication-avoiding QR decomposition for GPUs

Communication-avoiding QR decomposition for GPUs

引用

25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

作者： Anderson, Michael Ballard, Grey Demmel, James Keutzer, Kurt UC Berkeley Department of Electrical Engineering and Computer Science Berkeley CA United States

ISBN: (纸本)9780769543857

We describe an implementation of the Communication-Avoiding QR (CAQR) factorization that runs entirely on a single graphics processor (GPU). We show that the reduction in memory traffic provided by CAQR allows us to outperform existing parallel GPU implementations of QR for a large class of tall-skinny matrices. Other GPU implementations of QR handle panel factorizations by either sending the work to a general-purpose processor or using entirely bandwidth-bound operations, incurring data transfer overheads. In contrast, our QR is done entirely on the GPU using compute-bound kernels, meaning performance is good regardless of the width of the matrix. As a result, we outperform CULA, a parallel linear algebra library for GPUs by up to 17x for tall-skinny matrices and Intel's Math Kernel Library (MKL) by up to 12x. We also discuss stationary video background subtraction as a motivating application. We apply a recent statistical approach, which requires many iterations of computing the singular value decomposition of a tall-skinny matrix. Using CAQR as a first step to getting the singular value decomposition, we are able to get the answer 3x faster than if we use a traditional bandwidth-bound GPU QR factorization tuned specifically for that matrix size, and 30x faster than if we use Intel's Math Kernel Library (MKL) singular value decomposition routine on a multicore CPU. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Separating metagenomic short reads into genomes via clustering

Separating metagenomic short reads into genomes via clusteri...

引用

Lecture Notes in computer science

作者： Tanaseichuk, Olga Borneman, James Jiang, Tao Department of Computer Science and Engineering UC Riverside CA United States Department of Plant Pathology and Microbiology UC Riverside CA United States

ISBN: (纸本)9783642230370

The metagenomics approach allows the simultaneous sequencing of all genomes in an environmental sample. This results in high complexity datasets, where in addition to repeats and sequencing errors, the number of genomes and their abundance ratios are unknown. Recently developed next-generation sequencing (NGS) technologies significantly improve the sequencing efficiency and cost. On the other hand, they result in shorter reads, which makes the separation of reads from different species harder. In this work, we present a two-phase heuristic algorithm for separating short paired-end reads from different genomes in a metagenomic dataset. We use the observation that most of the l-mers belong to unique genomes when l is sufficiently large. The first phase of the algorithm results in clusters of l-mers each of which belongs to one genome. During the second phase, clusters are merged based on l-mer repeat information. These final clusters are used to assign reads. The algorithm could handle very short reads and sequencing errors. Our tests on a large number of simulated metagenomic datasets concerning species at various phylogenetic distances demonstrate that genomes can be separated if the number of common repeats is smaller than the number of genome-specific repeats. For such genomes, our method can separate NGS reads with a high precision and sensitivity. © 2011 Springer-Verlag.

关键词： Phylogenetic

来源：评论

学校读者我要写书评

暂无评论

Overclocking the Yahoo!: CDN for faster web page loads 11

Overclocking the Yahoo!: CDN for faster web page loads

引用

2011 ACM SIGCOMM Internet Measurement Conference, IMC'11

作者： Al-Fares, Mohammad Elmeleegy, Khaled Reed, Benjamin Gashinsky, Igor Computer Science and Engineering UC San Diego United States Yahoo Research UC San Diego United States Yahoo Inc. UC San Diego United States

ISBN: (纸本)9781450310130

Fast-loading web pages are key for a positive user experience. Unfortunately, a large number of users suffer from page load times of many seconds, especially for pages with many embedded objects. Most of this time is spent fetching the page and its objects over the Internet. This paper investigates the impact of optimizations that improve the delivery of content from edge servers at the Yahoo! Content Delivery Network (CDN) to the end users. To this end, we analyze packet traces of 12.3M TCP connections originating from users across the world and terminating at the Yahoo! CDN. Using these traces, we characterize key user-connection metrics at the network, transport, and the application layers. We observe high Round Trip Times (RTTs) and inflated number of round trips per page download (RTT multipliers). Due to inefficiencies in TCP's slow start and the HTTP protocol, we found several opportunities to reduce the RTT multiplier, e.g. increasing TCP's Initial Congestion Window (ICW), using TCP Appropriate Byte Counting (ABC), and using HTTP pipelining. Using live workloads, we experimentally study the micro effects of these optimizations on network connectivity, e.g. packet loss rate. To evaluate the macro effects of these optimizations on the overall page load time, we use realistic synthetic workloads in a closed laboratory environment. We find that compounding HTTP pipelining with increasing the ICW size can lead to reduction in page load times by up to 80%. We also find that no one configuration fits all users, e.g. increasing the TCP ICW to a certain size may help some users while hurting others. © 2011 ACM.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

Does an efficient calibrated forecasting strategy exist?

Does an efficient calibrated forecasting strategy exist?

引用

24th International Conference on Learning Theory, COLT 2011

作者： Abernethy, Jacob Mannor, Shie UC Berkeley Div. of Computer Science United Kingdom Technion Department of Electrical Engineering United Kingdom

We recall two previously-proposed notions of asymptotic calibration for a forecaster making a sequence of probability predictions. We note that the existence of efficient algorithms for calibrated forecasting holds only in the case of binary outcomes. We pose the question: do there exist such efficient algorithms for the general (non-binary) case? © 2011 J. Abernethy & S. Mannor.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：