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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

515 篇 会议
435 篇 期刊文献
5 册 图书

馆藏范围

955 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

659 篇 工学
- 438 篇 计算机科学与技术...
- 359 篇 软件工程
- 122 篇 控制科学与工程
- 101 篇 生物工程
- 84 篇 信息与通信工程
- 81 篇 电子科学与技术（可...
- 64 篇 电气工程
- 50 篇 生物医学工程（可授...
- 42 篇 动力工程及工程热...
- 40 篇 机械工程
- 35 篇 光学工程
- 28 篇 仪器科学与技术
- 28 篇 化学工程与技术
- 24 篇 建筑学
- 23 篇 材料科学与工程（可...
- 22 篇 安全科学与工程
429 篇 理学
- 234 篇 数学
- 116 篇 生物学
- 96 篇 物理学
- 85 篇 统计学（可授理学、...
- 58 篇 系统科学
- 29 篇 化学
131 篇 管理学
- 77 篇 管理科学与工程(可...
- 57 篇 图书情报与档案管...
- 49 篇 工商管理
43 篇 医学
- 40 篇 临床医学
- 33 篇 基础医学(可授医学...
- 23 篇 药学(可授医学、理...
33 篇 法学
- 29 篇 社会学
20 篇 经济学
- 20 篇 应用经济学
12 篇 教育学
12 篇 农学
3 篇 军事学
2 篇 文学
1 篇 艺术学

主题

22 篇 reinforcement le...
13 篇 deep neural netw...
13 篇 machine learning
12 篇 data mining
12 篇 hardware
11 篇 deep learning
11 篇 predictive model...
11 篇 forecasting
10 篇 computational mo...
10 篇 visualization
9 篇 semantics
9 篇 autonomous vehic...
9 篇 stochastic syste...
9 篇 training
8 篇 computer science
8 篇 task analysis
8 篇 algorithms
8 篇 convex optimizat...
8 篇 data models
7 篇 embedded systems

机构

29 篇 department of el...
24 篇 department of co...
17 篇 department of st...
17 篇 department of el...
16 篇 department of el...
16 篇 department of el...
15 篇 computer science...
14 篇 department of co...
13 篇 department of el...
10 篇 department of co...
9 篇 computer science...
9 篇 uc berkeley depa...
9 篇 department of co...
8 篇 center for embed...
8 篇 department of co...
8 篇 uc berkeley depa...
8 篇 department of el...
8 篇 department of el...
8 篇 openai
7 篇 department of el...

作者

21 篇 abbeel pieter
14 篇 jordan michael i...
13 篇 levine sergey
11 篇 rosing tajana
11 篇 wainwright marti...
10 篇 belkin mikhail
10 篇 mcauley julian
9 篇 yu bin
9 篇 vahid frank
8 篇 chen xi
7 篇 michael i. jorda...
7 篇 shonle macneil
7 篇 sadigh dorsa
7 篇 pedarsani ramtin
7 篇 tajana rosing
6 篇 darrell trevor
6 篇 kastner ryan
6 篇 gupta rajesh
6 篇 waller laura
6 篇 yin ming

语言

893 篇 英文
57 篇 其他
5 篇 中文

检索条件"机构=Computer Science and Engineering Uc"

共 955 条记录，以下是731-740 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A Stability-based Validation Procedure for Differentially Private Machine Learning 13

A Stability-based Validation Procedure for Differentially Pr...

引用

Annual Conference on Neural Information Processing Systems

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

ISBN: (纸本)9781632660244

Differential privacy is a cryptographically motivated definition of privacy which has gained considerable attention in the algorithms, machine-learning and data-mining 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.

关键词： Machine Learning Privacy histograms Artificial Intelligence Machine learning algorithms Training end-to-end Explosions

来源：评论

学校读者我要写书评

暂无评论

Distributed Battery Control for Peak Power Shaving in Datacenters

Distributed Battery Control for Peak Power Shaving in Datace...

引用

International Green Computing Conference

作者： Baris Aksanli Tajana Rosing Eddie Pettis Computer Science and Engineering Department UC San Diego La Jolla CA Google Inc. Mountain View CA

ISBN: (纸本)9781479906215

Datacenters are large cyber-physical systems with continuous performance and power measurements, and real-time control decisions related to workload placement, cooling and power subsystems etc. In our work we focus on the non-ideal UPS system used to shave peak power demands. Our novel distributed battery control design has no performance impact,reduces the peak power needs, and accurately estimates and maximizes the battery lifetime. We demonstrate that models which do not take into account physical characteristics of batteries overestimate their lifetime by 2.4x. In contrast, our design is within 3.3% of the centralized battery control in terms of battery lifetime with lOx reduction in the communication costs, while shaving 23MWhrs/week of energy in a 10MW datacenter, equivalent to adding 8760 more servers at no additional power cost.

关键词： datacenters peak power shaving batteries distributed control

来源：评论

学校读者我要写书评

暂无评论

Architecting Efficient Peak Power Shaving Using Batteries in Data Centers

Architecting Efficient Peak Power Shaving Using Batteries in...

引用

International Symposium on Modeling, Analysis and Simulation of computer and Telecommunication Systems (MASCOTS)

作者： Baris Aksanli Eddie Pettis Tajana Rosing Computer Science and Engineering Department UC San Diego La Jolla CA Google Inc. Mountain View CA

Peak power shaving allows data center providers to increase their computational capacity without exceeding a given power budget. Recent papers establish that machines may repurpose energy from uninterruptible power supplies (UPSs) to maintain power budgets during peak demand. Our paper demonstrates that existing studies overestimate cost savings by as much as 3.35x because they use simple battery reliability models, Boolean battery discharge and neglect the design and the cost of battery system communication in the state-of-the-art distributed UPS designs. We propose an architecture where batteries provide only a fraction of the data center power, exploiting nonlinear battery capacity properties to achieve longer battery life and longer peak shaving durations. This architecture demonstrates that a centralized UPS with partial discharge sufficiently reduces the cost so that double power conversion losses are not a limiting factor, thus contradicting the recent trends in warehouse-scale distributed UPS design. Our architecture increases battery lifetime by 78%, doubles the cost savings compared to the distributed design (corresponding to $75K/month savings for a 10MW data center) and significantly reduces the decision coordination latency by 4x relative to the state-of-the-art distributed designs.

关键词： Batteries Discharges (electric) Uninterruptible power systems Servers Power demand Power distribution US Department of Defense

来源：评论

学校读者我要写书评

暂无评论

Geographic Human-computer Interaction 31

Geographic Human-Computer Interaction

引用

31st Annual CHI Conference on Human Factors in Computing Systems:, CHI EA 2013

作者： Hecht, Brent Schöning, Johannes Haklay, Muki Capra, Licia Mashhadi, Afra J. Terveen, Loren Kwan, Mei-Po EECS Department Northwestern University United States Digital Media Hasselt University Dept. of Computer Science University College London United Kingdom Dept. of Civil Environmental and Geomatic Engineering University College London United Kingdom Dept. of Computer Science University College London United Kingdom Alcatel-Lucent Bell Labs United States Dept. of Comp. Sci. and Engineering University of Minnesota United States Department of Geography UC Berkeley United States

ISBN: (纸本)9781450318990

Geography is playing an increasingly important role in areas of HCI ranging from social computing to natural user interfaces. At the same time, research in geography has focused more and more on technology-mediated interaction with spatiotemporal phenomena. Despite the growing popularity of this geographic human-computer interaction (GeoHCI) in both fields, there have been few opportunities for GeoHCI knowledge sharing, knowledge creation or community building in either discipline, let alone between them. The goal of this workshop is thus two-fold. First, we will seek to sum up the state of GeoHCI knowledge and address GeoHCI core issues by inviting prominent researchers in the space to share and discuss the most important high-level findings from their work. Second, through our interdisciplinary organizing committee, we will bring together participants from both fields, with the goal of laying the groundwork for a community that works across intra- and interdisciplinary boundaries.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

State Estimation for the discretized LWR PDE using explicit polyhedral representations of the Godunov scheme

State Estimation for the discretized LWR PDE using explicit ...

引用

American Control Conference

作者： JEROME THAI BORIS PRODHOMME ALEXANDRE M. BAYEN Department of Electrical Engineering and Computer Science University of California Berkeley Assistant Specialist at UC Berkeley Institute of Transportation Studies Berkeley Associate Professor Systems Engineering Department of Electrical Engineering and Computer Sciences Department of Civil and Environmental Engineering University of California Berkeley

ISBN: (纸本)9781479901777

This article investigates the problem of estimating the state of discretized hyperbolic scalar partial differential equations. It uses a Godunov scheme to discretize the socalled Lighthill-Whitham-Richards equation with a triangular flux function, and proves that the resulting nonlinear dynamical system can be decomposed in a piecewise affine manner. Using this explicit representation, the system is written as a switching dynamical system (hybrid system), with an exponential number of modes. The estimation problem is posed using Kalman filtering in each of the linear mode, and the approach becomes computationally tractable by tracking the mode evolution as the estimation is performed at each time step. Numerical results are presented using the Mobile Millennium data set, and compared to results obtained using ensemble Kalman filtering, which is used for estimation in traffic monitoring.

关键词： Godunov scheme problem estimating

来源：评论

学校读者我要写书评

暂无评论

A variability-aware OpenMP environment for efficient execution of accuracy-configurable computation on shared-FPU processor clusters 13

A variability-aware OpenMP environment for efficient executi...

引用

International Conference on Hardware/Software Codesign and System Synthesis (CODES)

作者： Abbas Rahimi Andrea Marongiu Rajesh K. Gupta Luca Benini Department of Computer Science and Engineering UC San Diego La Jolla CA USA Dipartimento di Ingegneria dell'Energia Elettrica e dell'lnformazione Universita di Bologna Bologna Italy

ISBN: (纸本)9781479914173

We propose a tightly-coupled, multi-core cluster architecture with shared, variation-tolerant, and accuracy-reconfigurable floating-point units (FPUs). The resilient shared-FPUs dynamically characterize FP pipeline vulnerability (FPV) and expose it as metadata to a software scheduler for reducing the cost of error correction. To further reduce this cost, our programming and runtime environment also supports controlled approximate computation through a combination of design-time and runtime techniques. We provide OpenMP extensions (as custom directives) for FP computations to specify parts of a program that can be executed approximately. We use a profiling technique to identify tolerable error significance and error rate thresholds in error-tolerant image processing applications. This information guides an application-driven hardware FPU synthesis and optimization design flow to generate efficient FPUs. At runtime, the scheduler utilizes FPV metadata and promotes FPUs to accurate mode, or demotes them to approximate mode depending upon the code region requirements. We demonstrate the effectiveness of our approach (in terms of energy savings) on a 16-core tightly-coupled cluster with eight shared-FPUs for both error-tolerant and general-purpose error-intolerant applications.

关键词： Pipelines Timing Approximation methods Registers computer architecture Runtime Software

来源：评论

学校读者我要写书评

暂无评论

SyFi: A systematic approach for estimating stateful firewall performance

SyFi: A systematic approach for estimating stateful firewall...

引用

13th International Conference on Passive and Active Measurement, PAM 2012

作者： Beyene, Yordanos Faloutsos, Michalis Madhyastha, Harsha V. Department of Computer Science and Engineering UC Riverside United States

ISBN: (纸本)9783642285363

Due to the lack of a standardized methodology for reporting firewall performance, current datasheets are designed for marketing and provide inflated throughput measurements obtained under unrealistic scenarios. As a result, customers lack usable metrics to select a device that best meets their needs. In this paper, we develop a systematic approach to estimate the performance offered by stateful firewalls. To do so, we first conduct extensive experiments with two enterprise firewalls in a wide range of configurations and traffic profiles to identify the characteristics of a network's traffic that affect firewall performance. Based on the observations from our measurements, we develop a model that can estimate the expected performance of a particular stateful firewall when deployed in a customer's network. Our model ties together a succinct set of network traffic characteristics and firewall benchmarks. We validate our model with a third enterprise-grade firewall, and find that it predicts firewall throughput with less than 6-10% error across a range of traffic profiles. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： computer system firewalls

来源：评论

学校读者我要写书评

暂无评论

MS-DPR: An algorithm for computing statistical significance of spectral identifications of non-linear peptides

MS-DPR: An algorithm for computing statistical significance ...

引用

12th International Workshop on Algorithms in Bioinformatics, WABI 2012

作者： Mohimani, Hosein Kim, Sangtae Pevzner, Pavel A. Department of Electrical and Computer Engineering UC San Diego United States Department of Computer Science and Engineering UC San Diego United States

ISBN: (纸本)9783642331213

While non-linear peptide natural products such as Vanco- mycin and Daptomycin are among the most effective antibiotics, the computational techniques for sequencing such peptides are still in infancy. Previous methods for sequencing peptide natural products are based on Nuclear Magnetic Resonance spectroscopy, and require large amounts (milligrams) of purified materials. Recently, development of mass spectrometry based methods has enabled accurate sequencing of non-linear peptidic natural products using picograms of materials, but the question of evaluating statistical significance of Peptide Spectrum Matches (PSM) for these peptides remains open. Moreover, it is unclear how to decide whether a given spectrum is produced by linear, cyclic, or branch-cyclic peptide. Surprisingly, all previous mass spectrometery studies overlooked the fact that a very similar problem has been succesfully addressed in particle physics in 1951. In this paper we develop a method for estimating statistical significance of PSMs defined by non-linear peptides, which makes it possible to identify whether a peptide is linear, cyclic or branch-cyclic, an important step toward identification of peptidic natural products. © 2012 Springer-Verlag.

关键词： Peptides

来源：评论

学校读者我要写书评

暂无评论

Common knowledge and state-dependent equilibria

Common knowledge and state-dependent equilibria

引用

5th International Symposium on Algorithmic Game Theory, SAGT 2012

作者： Dalkiran, Nuh Aygun Hoffman, Moshe Paturi, Ramamohan Ricketts, Daniel Vattani, Andrea Department of Economics Bilkent University Turkey Rady School of Management Department of Computer Science and Engineering UC San Diego United States Department of Computer Science and Engineering UC San Diego United States

ISBN: (纸本)9783642339950

Many puzzling social behaviors, such as avoiding eye contact, using innuendos, and insignificant events that trigger revolutions, seem to relate to common knowledge and coordination, but the exact relationship has yet to be formalized. Herein, we present such a formalization. We state necessary and sufficient conditions for what we call state-dependent equilibria - equilibria where players play different strategies in different states of the world. In particular, if everybody behaves a certain way (e.g. does not revolt) in the usual state of the world, then in order for players to be able to behave a different way (e.g. revolt) in another state of the world, it is both necessary and sufficient for it to be common p-believed that it is not the usual state of the world, where common p-belief is a relaxation of common knowledge introduced by Monderer and Samet [16]. Our framework applies to many player r-coordination games - a generalization of coordination games that we introduce - and common (r,p)-beliefs - a generalization of common p-beliefs that we introduce. We then apply these theorems to two particular signaling structures to obtain novel results. © 2012 Springer-Verlag.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Foundations of garbled circuits 12

Foundations of garbled circuits

引用

2012 ACM Conference on computer and Communications Security, CCS 2012

作者： Bellare, Mihir Hoang, Viet Tung Rogaway, Phillip Dept. of CS and Engineering UC San Diego United States Dept of Computer Science UC Davis United States

ISBN: (纸本)9781450316507

Garbled circuits, a classical idea rooted in the work of Yao, have long been understood as a cryptographic technique, not a cryptographic goal. Here we cull out a primitive corresponding to this technique. We call it a garbling scheme. We provide a provable-security treatment for garbling schemes, endowing them with a versatile syntax and multiple security definitions. The most basic of these, privacy, suffices for two-party secure function evaluation (SFE) and private function evaluation (PFE). Starting from a PRF, we provide an efficient garbling scheme achieving privacy and we analyze its concrete security. We next consider obliviousness and authenticity, properties needed for private and verifiable outsourcing of computation. We extend our scheme to achieve these ends. We provide highly efficient blockcipher-based instantiations of both schemes. Our treatment of garbling schemes presages more efficient garbling, more rigorous analyses, and more modularly designed higher-level protocols. Copyright © 2012 ACM.

关键词： Function evaluation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共96页 << < 70 71 72 73 74 75 76 77 78 79 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：