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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Hybrid CMOS/memristor circuits

Hybrid CMOS/memristor circuits

引用

2010 IEEE International Symposium on Circuits and Systems: Nano-Bio Circuit Fabrics and Systems, ISCAS 2010

作者： Strukov, D.B. Stewart, D.R. Borghetti, J. Li, X. Pickett, M. Medeiros Ribeiro, G. Robinett, W. Snider, G. Strachan, J.P. Wu, W. Xia, Q. Yang, J. Joshua Williams, R.S. Department of Electrical and Computer Engineering UC Santa Barbara Santa Barbara CA 93106 United States National Research Council of Canada 100 Sussex Dr Ottawa ON K1A 0R6 Canada Information and Quantum Science Laboratory Hewlett Packard Laboratories Palo Alto CA 94304 United States

ISBN: (纸本)9781424453085

This is a brief review of recent work on the prospective hybrid CMOS/memristor circuits. Such hybrids combine the flexibility, reliability and high functionality of the CMOS subsystem with very high density of nanoscale thin film resistance switching devices operating on different physical principles. Simulation and initial experimental results demonstrate that performance of CMOS/memristor circuits for several important applications is well beyond scaling limits of conventional VLSI paradigm. ©2010 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Limitations and Possibilities of Path Trading between Autonomous Systems

Limitations and Possibilities of Path Trading between Autono...

引用

2010 Proceedings IEEE INFOCOM

作者： Yuval Shavitt Yaron Singer School of Electrical Engineering Tel Aviv University Computer Science Division UC Berkeley Berkeley CA 94720

ISBN: (纸本)9781424458363

When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy known as hot-potato routing. As a result, paths in the Internet are suboptimal from a global perspective. For peering ASes who exchange traffic without payments, path trading - complementary deviations from hot-potato routing - appears to be a desirable solution to deal with these inefficiencies. In recent years, path trading approaches have been suggested as means for interdomain traffic engineering between neighboring ASes, as well as between multiple ASes to achieve global efficiency. Surprisingly, little is known on the computational complexity of finding path trading solutions, or the conditions which guarantee the optimality or even approximability of a path trading protocol. In this paper we explore the computational feasibility of computing path trading solutions between ASes. We first show that finding a path trading solution between a pair of ASes is NP-complete, and that path-trading solutions are even NP-hard to approximate. We continue to explore the feasibility of implementing policies between multiple ASes and show that, even if the bilateral path trading problem is tractable for every AS pair in the set of trading ASes, path trading between multiple ASes is NP-hard, and NP-hard to approximate as well. Despite the above negative results, we show a pseudo-polynomial algorithm to compute path trading solutions. Thus, if the range of the instances is bounded, we show one can compute solutions efficiently for peering ASes. We evaluate the path trading algorithm on pairs of ASes using real network topologies. Specifically, we use real PoP-level maps of ASes in the Internet to show that path trading can substantially mitigate the inefficiencies associated with hot-potato routing.

关键词： Nondeterministic polynomial-time hard Autonomous Systems Byways Internets Pairing Solutions Approximate

来源：评论

学校读者我要写书评

暂无评论

Lower bounds on minimax rates for nonparametric regression with additive sparsity and smoothness

Lower bounds on minimax rates for nonparametric regression w...

引用

23rd Annual Conference on Neural Information Processing Systems, NIPS 2009

作者： Raskutti, Garvesh Wainwright, Martin J. Yu, Bin UC Berkeley Department of Statistics United States UC Berkeley Department of Electrical Engineering and Computer Science United States

ISBN: (纸本)9781615679119

We study minimax rates for estimating high-dimensional nonparametric regression models with sparse additive structure and smoothness constraints. More precisely, our goal is to estimate a function f*: p → that has an additive decomposition of the form f*(X1,⋯, Xp) = ΣjΕS hj*(Xj), where each component function hj* lies in some class H of "smooth" functions, and S⊂ {1,⋯,p} is an unknown subset with cardinality s = |S|. Given n i.i.d. observations of f* (X) corrupted with additive white Gaussian noise where the covariate vectors (X1, X2, X3,⋯, Xp) are drawn with i.i.d. components from some distribution P, we determine lower bounds on the minimax rate for estimating the regression function with respect to squared-L2 () error. Our main result is a lower bound on the minimax rate that scales as max (s log(p/s)/n), s Εn2(H)). The first term reflects the sample size required for performing subset selection, and is independent of the function class H. The second term sΕn2(H) is an s-dimensional estimation term corresponding to the sample size required for estimating a sum of s univariate functions, each chosen from the function class H. It depends linearly on the sparsity index s but is independent of the global dimensionp. As a special case, if H corresponds to functions that are m-times differentiable (an mth-order Sobolev space), then the s-dimensional estimation term takes the form sΕn2(H) sΕ n-2m/ (2m+1). Either of the two terms may be dominant in different regimes, depending on the relation between the sparsity and smoothness of the additive decomposition.

关键词： Sobolev spaces

来源：评论

学校读者我要写书评

暂无评论

High-dimensional support union recovery in multivariate regression

High-dimensional support union recovery in multivariate regr...

引用

22nd Annual Conference on Neural Information Processing Systems, NIPS 2008

作者： Obozinski, Guillaume Wainwright, Martin J. Jordan, Michael I. Department of Statistics UC Berkeley United States Dept. of Electrical Engineering and Computer Science UC Berkeley United States

ISBN: (纸本)9781605609492

We study the behavior of block 1/2 regularization for multivariate regression, where a K-dimensional response vector is regressed upon a fixed set of p covariates. The problem of support union recovery is to recover the subset of covariates that are active in at least one of the regression problems. Studying this problem under high-dimensional scaling (where the problem parameters as well as sample size n tend to infinity simultaneously), our main result is to show that exact recovery is possible once the order parameter given by θ1/ 2 (n;p;s) := n=[2ψ (B*) log(p - s)] exceeds a critical threshold. Here n is the sample size, p is the ambient dimension of the regression model, s is the size of the union of supports, and ψ(B*) is a sparsity-overlap function that measures a combination of the sparsities and overlaps of the K-regression coefficient vectors that constitute the model. This sparsity-overlap function reveals that block 1/ 2 regularization for multivariate regression never harms performance relative to a naive 1-approach, and can yield substantial improvements in sample complexity (up to a factor of K) when the regression vectors are suitably orthogonal relative to the design. We complement our theoretical results with simulations that demonstrate the sharpness of the result, even for relatively small problems.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Making good points: Application-specific pareto-point generation for design space exploration using statistical methods

Making good points: Application-specific pareto-point genera...

引用

7th ACM SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA'09

作者： Sheldon, David Vahid, Frank Dept. of Computer Science and Engineering Univ. of California Riverside United States Center for Embedded Computer Systems UC Irvine United States

ISBN: (纸本)9781605584102

Field-programmable gate arrays (FPGAs) commonly implement system architectures composed from soft-core configurable components, such as a cache with configurable size or associativity, a processor with configurable datapath units, or a configurable network-on-chip connecting dozens of processors. Configurable components increasingly exist even on prefabricated platforms. Tuning configurable components to the particular application running on the architecture and to particular design constraints represents a challenging task often left to a designer. Knowledge of the Pareto-optimal points of a system for particular applications can be of benefit to designers seeking to make appropriate design tradeoffs for given constraints. Previous methods for generating Pareto points required extensive knowledge of an architecture's parameter interdependencies, used a simplistic approach that failed to find many parameters, or used randomized search algorithms that may have long runtimes. We introduce an algorithm for finding Pareto points, based on statistically rigorous methods derived from the Design of Experiments paradigm and extended for the purpose of finding Pareto points. The resulting DoE-based Pareto point Generator, or DPG, algorithm finds thorough Pareto points while running 3 times faster than randomized search algorithms, without requiring designer knowledge of parameter interdependencies-in fact, the approach determines those interdependencies automatically, representing an added bonus. We demonstrate DPG on Platune's configurable processor-bus-cache system-on-chip, Noxim's configurable network-on-chip, and the configurable Microblaze FPGA processor. Copyright 2009 ACM.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Forest fire detection and extinction software

Forest fire detection and extinction software

引用

2009 International Conference on Artificial Intelligence, ICAI 2009

作者： Crespo, Rubén González García, Victor Hugo Medina Escribano, Juan José Ramirez Franco, Enrique Torres Lovelle, Juan Manuel Cueva Department of Software Engineering UPSAM Madrid Spain Department of Computer Science UNIOVI Oviedo Asturias Spain Engineering Faculty UC Bogota Colombia

ISBN: (纸本)9781601321091

This paper shows the technologies used currently for applications that detect and extinguish forest fires. We will see the different methods used on the market and some examples. We will also expond briefly basic matters about the most influential parameters when it comes to a fire's extintion. Finally, after all the technologies are expounded, we make a suggestion of an intelligent system, which brings together forest fire detection as its extinction.

关键词： Geographic information systems

来源：评论

学校读者我要写书评

暂无评论

Acceleration of market value-at-risk estimation

Acceleration of market value-at-risk estimation

引用

2nd Workshop on High Performance Computational Finance, WHPCF '09

作者： Dixon, Matthew Chong, Jike Keutzer, Kurt Department of Computer Science 3060 Kemper Hall UC Davis CA 95616 United States Dept. of Electrical Engineering and Computer Science/Center for Innovative Financial Technologies 573 Soda Hall UC Berkeley CA 94720-1770 United States Dept. of Electrical Engineering and Computer Science/Center for Innovative Financial Technologies 576 Soda Hall UC Berkeley CA 94720-1770 United States

ISBN: (纸本)9781605587165

The proliferation of algorithmic trading, derivative usage and highly leveraged hedge funds necessitates the acceleration of market Value-at-Risk (VaR) estimation to measure the severity of portfolios losses. This paper demonstrates how solely relying on advances in computer hardware to accelerate market VaR estimation overlooks significant opportunities for acceleration. We use a simulation based delta-gamma Value-at-Risk (VaR) estimate and compute the loss function using basic linear algebra subroutines (BLAS). Our NVIDIA GeForce GTX280 graphics processing unit (GPU) based baseline implementation is a straight-forward port from the CPU implementation and only had a 8.21x speed advantage over a quadcore Intel Core2 Q9300 central processing unit (CPU) based implementation. We demonstrate three approaches to gain additional speedup over the baseline GPU implemention. Firstly, we reformulate the loss function to reduce the amount of necessary computation and achieved a 60.3x speedup. Secondly, we selected functionally equivalent distribution conversion modules to give the best convergence rate - providing an additional 2x speedup. Thirdly, we merged data-parallel computational kernels to remove redundant load store operations leading to an additional 1.85x speedup. Overall, we have achieved a speedup of 148x against the baseline GPU implementation, reducing the time of a VaR estimation with a standard error of 0.1% from minutes to less than one second. Copyright 2009 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Detecting, tracking and interacting with people in a public space 09

Detecting, tracking and interacting with people in a public ...

引用

International Conference on Multimodal Interfaces and the Workshop on Machine Learning for Multimodal Interfaces, ICMI-MLMI'09

作者： Cheamanunkul, Sunsern Ettinger, Evan Jacobsen, Matt Lai, Patrick Freund, Yoav Dept. of Computer Science and Engineering UC San Diego San Diego CA United States Computer Science Dept. Stanford University Stanford CA United States

ISBN: (纸本)9781605587721

We have built a system that engages naive users in an audio-visual interaction with a computer in an unconstrained public space. We combine audio source localization techniques with face detection algorithms to detect and track the user throughout a large lobby. The sensors we use are an ad-hoc microphone array and a PTZ camera. To engage the user, the PTZ camera turns and points at sounds made by people passing by. From this simple pointing of a camera, the user is made aware that the system has acknowledged their presence. To further engage the user, we develop a face classification method that identifies and then greets previously seen users. The user can interact with the system through a simple hot-spot based gesture interface. To make the user interactions with the system feel natural, we utilize reconfigurable hardware, achieving a visual response time of less than 100ms. We rely heavily on machine learning methods to make our system self-calibrating and adaptive. Copyright 2009 ACM.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Identifying suspicious URLs: An application of large-scale online learning 09

Identifying suspicious URLs: An application of large-scale o...

引用

26th International Conference On Machine Learning, ICML 2009

作者： Ma, Justin Saul, Lawrence K. Savage, Stefan Voelker, Geoffrey M. Department of Computer Science and Engineering UC San Diego 9500 Gilman Drive San Diego CA 92093-0404 United States

ISBN: (纸本)9781605585161

This paper explores online learning approaches for detecting malicious Web sites (those involved in criminal scams) using lexical and host-based features of the associated URLs. We show that this application is particularly appropriate for online algorithms as the size of the training data is larger than can be efficiently processed in batch and because the distribution of features that typify malicious URLs is changing continuously. Using a real-time system we developed for gathering URL features, combined with a real-time source of labeled URLs from a large Web mail provider, we demonstrate that recently-developed online algorithms can be as accurate as batch techniques, achieving classification accuracies up to 99% over a balanced data set.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

An Examination of Language Use in Online Dating Profiles 3

An Examination of Language Use in Online Dating Profiles

引用

3rd International AAAI Conference on Weblogs and Social Media, ICWSM 2009

作者： Nagarajan, Meenakshi Hearst, Marti A. Knoesis Dept. of Computer Science and Engineering Wright State University DaytonOH United States School of Information UC Berkeley BerkeleyCA United States

ISBN: (纸本)9781577354215

This paper contributes to the study of self-presentation in online dating systems by performing a factor analysis on the text portions of online profiles. Findings include a similarity in the overall factor structures between male and female profiles, including use of tentative words by men. Contrasts between sexes were also found in a cluster analysis of the profiles using their factor scores. Finally, we also found similarities in frequent words used by the gender groups. Copyright © 2009, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Factor analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共96页 << < 77 78 79 80 81 82 83 84 85 86 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：