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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是771-780 订阅

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

详细简洁

排序：

Understanding the role of buildings in a smart microgrid

Understanding the role of buildings in a smart microgrid

引用

作者： Agarwal, Yuvraj Weng, Thomas Gupta, Rajesh K. Computer Science and Engineering UC San Diego San Diego CA 92093-0404 United States

ISBN: (纸本)9783981080179

A 'smart microgrid' refers to a distribution network for electrical energy, starting from electricity generation to its transmission and storage with the ability to respond to dynamic changes in energy supply through co-generation and demand adjustments. At the scale of a small town, a microgrid is connected to the wide-area electrical grid that may be used for 'baseline' energy supply;or in the extreme case only as a storage system in a completely self-sufficient microgrid. Distributed generation, storage and intelligence are key components of a smart microgrid. In this paper, we examine the significant role that buildings play in energy use and its management in a smart microgrid. In particular, we discuss the relationship that IT equipment has on energy usage by buildings, and show that control of various building subsystems (such as IT and HVAC) can lead to significant energy savings. Using the ucSD as a prototypical smart microgrid, we discuss how buildings can be enhanced and interfaced with the smart microgrid, and demonstrate the benefits that this relationship can bring as well as the challenges in implementing this vision. © 2011 EDAA.

关键词： Buildings

来源：评论

学校读者我要写书评

暂无评论

Incentive schemes for Internet congestion management: Raffles versus time-of-day pricing

Incentive schemes for Internet congestion management: Raffle...

引用

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

作者： Loiseau, Patrick Schwartz, Galina Musacchio, John Amin, Saurabh Technology and Information Management UC Santa Cruz CA United States Electrical Engineering and Computer Science UC Berkeley CA United States Department of Civil and Environmental Engineering MIT MA United States

ISBN: (纸本)9781457718168

The Internet is plagued with congestion problems of growing severity which are worst at peak periods. In this paper, we compare two schemes that incentivize users to shift part of their usage from the peak-time to the off-peak time. The traditional time-of-day pricing scheme gives a fixed reward per unit of shifted usage. Conversely, the raffle-based scheme provides a random reward distributed in proportion of each user's fraction of the total shifted usage. Using a game-theoretic model, we show that both schemes can achieve an optimal level of decongestion at a unique Nash equilibrium. We provide a comparison of the schemes' sensitivity to uncertainty of the users' utilities. © 2011 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Learning with missing features

Learning with missing features

引用

作者： Rostamizadeh, Afshin Agarwal, Alekh Bartlett, Peter Dept. of Electrical Engineering and Computer Science UC Berkeley United States Mathematical Sciences QUT and EECS and Statistics UC Berkeley United States

We introduce new online and batch algorithms that are robust to data with missing features, a situation that arises in many practical applications. In the online setup, we allow for the comparison hypothesis to change as a function of the subset of features that is observed on any given round, extending the standard setting where the comparison hypothesis is fixed throughout. In the batch setup, we present a convex relaxation of a non-convex problem to jointly estimate an imputation function, used to fill in the values of missing features, along with the classification hypothesis. We prove regret bounds in the online setting and Rademacher complexity bounds for the batch i.i.d. setting. The algorithms are tested on several ucI datasets, showing superior performance over baseline imputation methods.

关键词： Relaxation processes

来源：评论

学校读者我要写书评

暂无评论

A block-diagonal structured model reduction scheme for power grid networks

A block-diagonal structured model reduction scheme for power...

引用

作者： Zhang, Zheng Hu, Xiang Cheng, Chung-Kuan Wong, Ngai Department of Electrical Engineering and Computer Science MIT Cambridge MA United States Department of Electrical and Computer Engineering UC San Diego San Diego CA United States Department of Computer Science and Engineering UC San Diego San Diego CA United States Department of Electrical and Electronic Engineering University of Hong Kong Hong Kong

ISBN: (纸本)9783981080179

We propose a block-diagonal structured model order reduction (BDSM) scheme for fast power grid analysis. Compared with existing power grid model order reduction (MOR) methods, BDSM has several advantages. First, unlike many power grid reductions that are based on terminal reduction and thus error-prone, BDSM utilizes an exact column-by-column moment matching to provide higher numerical accuracy. Second, with similar accuracy and macromodel size, BDSM generates very sparse block-diagonal reduced-order models (ROMs) for massive-port systems at a lower cost, whereas traditional algorithms such as PRIMA produce full dense models inefficient for the subsequent simulation. Third, different from those MOR schemes based on extended Krylov subspace (EKS) technique, BDSM is input-signal independent, so the resulting ROM is reusable under different excitations. Finally, due to its blockdiagonal structure, the obtained ROM can be simulated very fast. The accuracy and efficiency of BDSM are verified by industrial power grid benchmarks. © 2011 EDAA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Divide-and-Conquer Matrix Factorization 11

Divide-and-Conquer Matrix Factorization

引用

Annual Conference on Neural Information Processing Systems

作者： Lester Mackey Ameet Talwalkar Michael I. Jordan Department of Electrical Engineering and Computer Science UC Berkeley Department of Electrical Engineering and Computer Science UC BerkeleyDepartment of Statistics UC Berkeley

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 subproblem in parallel using an arbitrary base matrix factorization algorithm, and combines the sub-problem 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.

关键词： matrix decomposition DFC simulated data PROBLEM SOLUTION Parallel Lines basis matrix Comparable

来源：评论

学校读者我要写书评

暂无评论

Online least-squares estimation of time varying systems with sparse temporal evolution and application to traffic estimation

Online least-squares estimation of time varying systems with...

引用

IEEE Conference on Decision and Control

作者： A. Hofleitner L. El Ghaoui A. Bayen Electrical Engineering and Computer Science UC Berkeley CA Electrical Engineering and Computer Science and Civil and Environmental Engineering UC Berkeley

ISBN: (纸本)9781612848006

Using least-squares with an l_(1)-norm penalty is well-known to encourage sparse solutions. In this article, we propose an algorithm that performs online least-squares estimation of a time varying system with a l_(1)-norm penalty on the variations of the state estimate, leading to state estimates that exhibit few "jumps" over time. The algorithm analytically computes a path to update the state estimate as a new observation becomes available. The algorithm performs computationally efficient and numerically robust state estimation for time varying systems in which the dynamics are slow compared to the sampling rate. We use the algorithm for arterial traffic estimation with streaming probe vehicle data provided by the Mobile Millennium system and show a significant improvement in the estimation capabilities compared to a baseline model of traffic estimation. The estimation framework filters out the inherent noise of traffic dynamics and improves the interpretability and accuracy of the results. Results from an implementation in San Francisco on a network of more than 800 links using a fleet of 500 taxis sending their location every minute illustrate the possibility to use the algorithm to solve important practical estimation problems.

关键词： State estimation Traffic estimation time-varying systems Probe vehicles algorithms interpretability

来源：评论

学校读者我要写书评

暂无评论

Using metaphors from natural discussion to improve the design of arcum

Using metaphors from natural discussion to improve the desig...

引用

3rd ACM SIGPLAN Workshop on Evaluation and Usability of ProgrammingLanguages and Tools, PLATEAU'11

作者： Shonle, MacNeil Griswold, William G. Lerner, Sorin Department of Computer Science University of Texas at San Antonio San Antonio TX 78249-0667 United States Computer Science and Engineering Department UC San Diego San Diego CA 92093-0404 United States

ISBN: (纸本)9781450310246

In this paper we present an exploratory pair-programming study aimed at investigating how programmers use a tool and language designed for performing crosscutting change tasks. Through a qualitative analysis of the pairs' discussions, we identify the metaphors that the participants used to think about crosscutting change tasks, which allowed us to infer their expectations. The metaphors of particular interest were the comparisons participants used to describe their approach in terms of other meta and non-meta programming tasks. From this analysis, we identified challenges the participants encountered in writing custom checks and refactorings. © 2011 ACM.

关键词： language design refactoring user studies

来源：评论

学校读者我要写书评

暂无评论

An optimization-based framework for automated market-making 11

An optimization-based framework for automated market-making

引用

Proceedings of the 12th ACM conference on Electronic commerce

作者： Abernethy, Jacob Chen, Yiling Wortman Vaughan, Jennifer EECS Department UC Berkeley United States School of Engineering and Applied Sciences Harvard University United States Computer Science Department UCLA United States

ISBN: (纸本)9781450302616

We propose a general framework for the design of securities markets over combinatorial or infinite state or outcome spaces. The framework enables the design of computationally efficient markets tailored to an arbitrary, yet relatively small, space of securities with bounded payoff. We prove that any market satisfying a set of intuitive conditions must price securities via a convex cost function, which is constructed via conjugate duality. Rather than deal with an exponentially large or infinite outcome space directly, our framework only requires optimization over a convex hull. By reducing the problem of automated market making to convex optimization, where many efficient algorithms exist, we arrive at a range of new polynomial-time pricing mechanisms for various problems. We demonstrate the advantages of this framework with the design of some particular markets. We also show that by relaxing the convex hull we can gain computational tractability without compromising the market institution's bounded budget. © 2011 ACM.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Incentive-compatible distributed greedy protocols 11

Incentive-compatible distributed greedy protocols

引用

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

作者： Nisan, Noam Schapira, Michael Valiant, Gregory Zohar, Aviv School of Engineering and Computer Science Hebrew University Jerusalem Israel Department of Computer Science Princeton University Princeton NJ United States Department of Computer Science UC Berkeley Berkeley CA United States Microsoft Research Silicon Valley Lab. Mountain View CA United States

ISBN: (纸本)9781450307192

Under many distributed protocols, the prescribed behavior for participants is to behave greedily, i.e., to repeatedly "best respond" to the others' actions. We present recent work (Proc. ICS'11) where we tackle the following general question: "When is it best for a long-sighted participant to adhere to a distributed greedy protocol?". We take a game-theoretic approach and exhibit a class of games where greedy behavior (i.e., repeated best-response) is incentive compatible for all players. We identify several environments of interest that fall within this class, thus establishing the incentive compatibility of the natural distributed greedy protocol for each. These environments include models of the Border Gateway Protocol (BGP) [4], which handles routing on the Internet, and of the Transmission Control Protocol (TCP) [3], and also stable-roommates assignments [2] and cost-sharing [5], which have been extensively studied in economic theory. © 2011 Authors.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Best-response auctions 11

Best-response auctions

引用

Proceedings of the 12th ACM conference on Electronic commerce

ISBN: (纸本)9781450302616

We present a new framework for auction design and analysis that we term "best-response auctions". We use this framework to show that the simple and myopic best-response dynamics converge to the VCG outcome and are incentive compatible in several well-studied auction environments (Generalized Second Price auctions, and auctions with unit-demand bidders). Thus, we establish that in these environments, given that all other bidders are repeatedly best-responding, the best course of action for a bidder is to also repeatedly best-respond. Our results generalize classical results in economics regarding convergence to equilibrium and incentive compatibility of ascending-price English auctions. In addition, our findings provide new game-theoretic justifications for some well-studied auction rules. Best-response auctions provide a way to bridge the gap between the full-information equilibrium concept and the usual private-information auction theory. © 2011 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共96页 << < 74 75 76 77 78 79 80 81 82 83 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：