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

27th Annual Conference on Neural Information Processing Systems, NIPS 2013

作者： Chaudhuri, Kamalika Vinterbo, Staal Department of Computer Science and Engineering UC San Diego San Diego CA 92093 United States Division of Biomedical Informatics UC San Diego San Diego CA 92093 United States

Differential privacy is a cryptographically motivated definition of privacy which has gained considerable attention in the algorithms, machine-learning and datamining communities. While there has been an explosion of work on differentially private machine learning algorithms, a major barrier to achieving end-to-end differential privacy in practical machine learning applications is the lack of an effective procedure for differentially private parameter tuning, or, determining the parameter value, such as a bin size in a histogram, or a regularization parameter, that is suitable for a particular application. In this paper, we introduce a generic validation procedure for differentially private machine learning algorithms that apply when a certain stability condition holds on the training algorithm and the validation performance metric. The training data size and the privacy budget used for training in our procedure is independent of the number of parameter values searched over. We apply our generic procedure to two fundamental tasks in statistics and machine-learning-training a regularized linear classifier and building a histogram density estimator that result in end-to-end differentially private solutions for these problems.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Moment-based Uniform Deviation Bounds for k-means and Friends 13

Moment-based Uniform Deviation Bounds for k-means and Friend...

引用

Annual Conference on Neural Information Processing Systems

作者： Matus Telgarsky Sanjoy Dasgupta Computer Science and Engineering UC San Diego

ISBN: (纸本)9781632660244

Suppose k centers are fit to m points by heuristically minimizing the k-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with p ≥ 4 bounded moments; in particular, the difference between the sample cost and distribution cost decays with m and p as m~(min{-1/4,-1/2+2/p}) .The essential technical contribution is a mechanism to uniformly control deviations in the face of unbounded parameter sets, cost functions, and source distributions. To further demonstrate this mechanism, a soft clustering variant of k-means cost is also considered, namely the log likelihood of a Gaussian mixture, subject to the constraint that all covariance matrices have bounded spectrum. Lastly, a rate with refined constants is provided for k-means instances possessing some cluster structure.

关键词： Friends Cluster structure Costs Deviation variance covariance matrix Bound Bounded Uniform Uniforms Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

8th International Conference on Neonatal and Childhood Pulmonary Vascular Disease, San Francisco, CA, USA, March 26-28, 2015 Abstracts

引用

PULMONARY CIRCULATION 2015年第4期5卷 744-750页

作者： [Anonymous] Department of Pediatrics UCSF Benioff Children&#x02019 s Hospital University of California San Francisco California USA Department of Pediatric Cardiology Children&#x02019 s Hospital Colorado University of Colorado Denver Aurora Colorado USA Division of Neonatology Department of Pediatrics UC Davis Children&#x02019 s Hospital University of California at Davis Medical Center Sacramento California USA Pediatric Cardiology and Cardiac Critical Care Department of Pediatrics and Anaesthesia Stollery Children&#x02019 s Hospital and Mazankowski Alberta Heart Institute University of Alberta Edmonton Canada Pediatric Cardiology Department of Pediatrics Ram&#x000f3 n y Cajal University Hospital Madrid Spain Department of Neonatology La Paz University Hospital Madrid Spain Departments of Genetics Pediatric Cardiology and Histopathology La Paz University Hospital Madrid Spain Department of Pharmacology Faculty of Medicine Complutense University Madrid Spain Department of Haematology Ni&#x000f1 o Jesus University Hospital Madrid Spain Pediatric Cardiology and Surgery Seattle Children&#x02019 s Hospital and University of Washington Seattle Washington USA Children&#x02019 s Hospital of Wisconsin Medical College of Wisconsin Milwaukee Wisconsin USA Medical College of Wisconsin Milwaukee Wisconsin USA Primary Children&#x02019 s Hospital and the University of Utah Salt Lake City Utah USA Pediatric Cardiology Cohen Children&#x02019 s Medical Center of New York New Hyde Park New York USA Departments of General Pediatrics Pediatric Infectious Disease Neonatology and Perinatology and Pediatric Cardiology Columbia University Medical Center New York New York USA Divisions of Pediatric Cardiology and Hematology/Oncology/Stem Cell Transplantation Columbia University Medical Center New York New York USA Pediatric Cardiology Steven and Alexandra Cohen Children&#x02019 s Medical Center of New York New Hyde Park New York USA Department of Pediatrics Stollery Children&#x

The article presents abstracts on medical topics which include use of the drug treprostinil for infants with congenital diaphragmatic hernia, increase in nutritional intake for protection against oxygen-induced right ... 详细信息

关键词： CONGENITAL disorders CARDIAC hypertrophy STEM cell transplantation

来源：评论

学校读者我要写书评

暂无评论

Selfish resource allocation in optical networks

Selfish resource allocation in optical networks

引用

8th International Conference on Algorithms and Complexity, CIAC 2013

作者： Bampas, Evangelos Pagourtzis, Aris Pierrakos, George Syrgkanis, Vasilis School of Elec. and Comp. Engineering National Technical University of Athens Greece School of Electrical Engineering and Computer Sciences UC Berkeley United States Computer Science Dept. Cornell University United States

ISBN: (纸本)9783642382321

We introduce Colored Resource Allocation Games as a new model for selfish routing and wavelength assignment in multifiber all-optical networks. Colored Resource Allocation Games are a generalization of congestion and bottleneck games where players have their strategies in multiple copies (colors). We focus on two main subclasses of these games depending on the player cost: in Colored Congestion Games the player cost is the sum of latencies of the resources allocated to the player, while in Colored Bottleneck Games the player cost is the maximum of these latencies. We investigate the pure price of anarchy for three different social cost functions and prove tight bounds for each separate case. We first consider a social cost function which is particularly meaningful in the setting of multifiber all-optical networks, where it captures the objective of fiber cost minimization. Additionally, we consider the two usual social cost functions (maximum and average player cost) and obtain improved bounds that could not have been derived using earlier results for the standard models for congestion and bottleneck games. © 2013 Springer-Verlag.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

A hybrid shared memory heterogeneous execution platform for PCIe-based GPGPUs

A hybrid shared memory heterogeneous execution platform for ...

引用

International Conference on High Performance Computing

作者： Sambit K. Shukla Laxmi N. Bhuyan Computer Science and Engineering UC Riverside Riverside CA

The disparity between the CPU and GPU domains has forced the programmers to adhere to the traditional driver-based GPU programming approach. The negative implications of this approach are inter-domain data transfer overhead, host memory pressure and CPU underutilization. In this paper, we propose a novel hybrid shared memory-based execution approach to enhance the throughput of the General Purpose GPU(GPGPU) applications. To achive optimal GPU execution, we adopted a midway approach between the shared memory and traditional disjoint memory GPU programming approach. Our design involves OS enhancements and extensions to an OS-integrated open-source GPU driver(GDev) which together provide the GPU application a shared memory execution platform. Our design not only eliminates several drawbacks associated with the traditional GPU programming approach, but allows data-parallel execution across CPUs and GPU.

关键词： Graphics processing units Kernel Programming Resource management Coherence Support vector machines Data transfer

来源：评论

学校读者我要写书评

暂无评论

Evaluating student understanding of core concepts in computer architecture 13

Evaluating student understanding of core concepts in compute...

引用

18th ACM Conference on Innovation and Technology in computer science Education, ITiCSE 2013

作者： Porter, Leo Garcia, Saturnino Tseng, Hung-Wei Zingaro, Daniel Department of Mathematics and Computer Science Skidmore College Saratoga Springs NY United States Department of Mathematics and Computer Science University of San Diego San Diego CA United States Computer Science and Engineering Department UC San Diego San Diego CA United States Department of Computer Science University of Toronto Toronto ON Canada

ISBN: (纸本)9781450320788

Many studies have demonstrated that students tend to learn less than instructors expect in CS1. In light of these studies, a natural question is: to what extent do these results hold for subsequent, upper-division computer science courses? In this paper we describe our work in creating high-level concept questions for an upper-division computer architecture course. The questions were designed and agreed upon by subject-matter and teaching experts to measure desired minimum proficiency of students post-course. These questions were administered to four separate computer architecture courses at two different institutions: a large public university and a small liberal arts college. Our results show that students in these courses were indeed not learning as much as the instructors expected, performing poorly overall: the per-question average was only 56%, with many questions showing no statistically significant improvement from pre-course to post-course. While these results follow the trend from CS1 courses, they are still somewhat surprising given that the courses studied were taught using research-based pedagogy that is known to be effective across the CS curriculum. We discuss implications of our findings and offer possible future directions of this work. Copyright 2013 ACM.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Open problem: Adversarial multiarmed bandits with limited advice

Open problem: Adversarial multiarmed bandits with limited ad...

引用

26th Conference on Learning Theory, COLT 2013

作者： Seldin, Yevgeny Crammer, Koby Bartlett, Peter Mathematical Sciences School Queensland University of Technology Brisbane QLD Australia Department of Electical Engineering and Computer Sciences UC Berkeley CA United States Department of Computer Science University College London United Kingdom Department of Electrical Engineering Technion Haifa Israel Dept. of Statistics UC Berkeley CA United States

Adversarial multiarmed bandits with expert advice is one of the fundamental problems in studying the exploration-exploitation trade-off. It is known that if we observe the advice of all experts on every round we can achieve O(√KT ln N) regret, where K is the number of arms, T is the number of game rounds, and N is the number of experts. It is also known that if we observe the advice of just one expert on every round, we can achieve regret of order O(√NT). Our open problem is what can be achieved by asking M experts on every round, where 1

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Flop and Roll: Learning Robust Goal-Directed Locomotion for a Tensegrity Robot

Flop and Roll: Learning Robust Goal-Directed Locomotion for ...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Atil Iscen Adrian Agogino Vytas SunSpiral Kagan Tumer Electrical Engineering and Computer Science Department Oregon State University Corvallis OR 97331 USA UC Santa Cruz and NASA Ames Research Center MS 269-3 Moffett Field CA 94035 USA SGT Inc. and NASA Ames Research Center MS 269-3 Moffett Field CA 94035 USA Mechanical Engineering Department Oregon State University Corvallis OR 97331 USA

ISBN: (纸本)9781479969357

Tensegrity robots are composed of compression elements (rods) that are connected via a network of tension elements (cables). Tensegrity robots provide many advantages over standard robots, such as compliance, robustness, and flexibility. Moreover, sphere-shaped tensegrity robots can provide non-traditional modes of locomotion, such as rolling. While they have advantageous physical properties, tensegrity robots are hard to control because of their nonlinear dynamics and oscillatory nature. In this paper, we present a robust, distributed, and directional rolling algorithm, "flop and roll". The algorithm uses coevolution and exploits the distributed nature and symmetry of the tensegrity structure. We validate this algorithm using the NASA Tensegrity Robotics Toolkit (NTRT) simulator, as well as the highly accurate model of the physical SUPERBall being developped under the NASA Innovative and Advanced Concepts (NIAC) program. Flop and roll improves upon previous approaches in that it provides rolling to a desired location. It is also robust to both unexpected external forces and partial hardware failures. Additionally, it handles variable terrain (hills up to 33% grade). Finally, results are compatible with the hardware since the algorithm relies on realistic sensing and actuation capabilities of the SUPERBall.

关键词： Robot ROLLED Locomotion algorithms computer hardware Coevolution highly accurate Nonlinear Dynamics Robustness Hardware Failure

来源：评论

学校读者我要写书评

暂无评论

A social crowd-controlled orchestra 13

A social crowd-controlled orchestra

引用

2013 2nd ACM Conference on computer Supported Cooperative Work Companion, CSCW 2013

作者： Savage, Saiph Chavez, Norma Elva Toxtli, Carlos Medina, Salvador Alvarez, David Hollerer, Tobias Computer Science Department UC Santa Barbara United States Department of Computer Engineering Universidad Nacional Autonoma de Mexico Mexico Centro de Investigacion en Computacion Instituo Politecnico Nacional Mexico

ISBN: (纸本)9781450313322

We present a novel social interactive system that brings music creation to the crowds. It allows anyone with a personal electronic device and regardless of their musical expertise to participate in the music an orchestra generates, while also encouraging social interactions among participants. Users can be either musicians or conductors. The latter drive the group's music production, while the others follow simple game-like instructions on their device for playing the conductor's selected songs. The primary mode of interaction for playing songs, consists of rotating one's electronic device in different ways. Our system also provides different social interaction cues that aim for novice and expert users to start conversations with each other and improve the group's performance as well as construct a community among participants. We report on a qualitative analysis, which suggests that users appreciate the system's versatility in providing service to a variety of devices and enjoy participating in the orchestra with their own personal device. Users judged the social interaction cues the system provided to be effective. We believe our findings aid the design of future social intelligent environments that seek to build communities with participants through music. Copyright © 2012 by the Association for Computing Machinery, Inc. (ACM).

关键词： Thermoelectric equipment

来源：评论

学校读者我要写书评

暂无评论

Efficient near-duplicate document detection using FPGAs

Efficient near-duplicate document detection using FPGAs

引用

IEEE International Conference on Big Data

作者： Xi Luo Walid Najjar Vagelis Hristidis Computer Science and Engineering UC Riverside Riverside CA USA

ISBN: (纸本)9781479912940

Detecting duplicate and near-duplicate documents is critical in applications like Web crawling since it helps save document processing resources. Simhash is a state-of-art method to assign a bit-string fingerprint to a document, such that similar documents have similar fingerprints. Finding the near-duplicates in a large collection of documents consists of two stages: (a) compute the simhash fingerprint of each document, and (b) find pairs of similar fingerprints by computing their Hamming distance. Previous work has focused on optimizing the second stage, i.e., avoiding the quadratic number of comparisons to compute the all to all Hamming distance. However, our experiments show that the total time is dominated by the first stage (the fingerprints computation), which is the focus of this paper. We propose an implementation of simhash on Field Programmable Gate Arrays (FPGAs), by implementing a customized fingerprint computing engine in hardware that exploits parallelization and pipelining opportunities. We present a comprehensive experimental evaluation on large diverse real document datasets. Our experiments show a speedup of 362× in the simhash computation, and savings of up to 98% in overall near-duplicate detection execution time compared to using multi-core CPUs.

关键词： Fingerprint recognition Field programmable gate arrays Hardware Software Engines Logic gates Encyclopedias

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：