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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Reconstructing the world in 3D: Bringing games with a purpose outdoors

Reconstructing the world in 3D: Bringing games with a purpos...

引用

Human Computation Workshop 2010, HCOMP2010

作者： Tuite, Kathleen Snavely, Noah Hsiao, Dun-Yu Smith, Adam M. Popović, Zoran Center for Game Science Department of Computer Science and Engineering University of Washington United States Department of Computer Science Cornell University United States Department of Computer Science UC Santa Cruz United States

ISBN: (纸本)9781450302227

We are interested in reconstructing real world locations as detailed 3D models, but to achieve this goal, we require a large quantity of photographic data. We designed a game to employ the efforts and digital cameras of everyday people to not only collect this data, but to do so in a fun and effective way. The result is PhotoCity, a game played outdoors with a camera, in which players take photos to capture flags and take over virtual models of real buildings. The game falls into the genres of both games with a purpose (GWAPs) and alternate reality games (ARGs). Each type of game comes with its own inherent challenges, but as a hybrid of both, PhotoCity presented us with a unique combination of obstacles. This paper describes the design decisions made to address these obstacles, and seeks to answer the question: Can games be used to achieve massive data-acquisition tasks when played in the real world, away from standard game consoles? We conclude with a report on player experiences and showcase some 3D reconstructions built by players during gameplay. © 2010 ACM.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Reconstructing the world in 3D: Bringing games with a purpose outdoors 10

Reconstructing the world in 3D: Bringing games with a purpos...

引用

5th International Conference on the Foundations of Digital Games, FDG 2010

ISBN: (纸本)9781605589374

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Taming the Triangle Inequality Violations with network coordinate system on real Internet

Taming the Triangle Inequality Violations with network coord...

引用

2010 Workshop on Re-Architecting the Internet, ReArch'10, Held in Conjunction with 6th ACM International Conference on Emerging Networking EXperiments and Technologies, CoNEXT 2010

作者： Zhu, Yibo Chen, Yang Zhang, Zengbin Fu, Xiaoming Li, Dan Deng, Beixing Li, Xing Department of Electronic Engineering Tsinghua University Beijing China Institute of Computer Science University of Goettingen Goettingen Germany Department of Computer Science UC Santa Barbara United States Department of Computer Science Tsinghua University Beijing China

ISBN: (纸本)9781450304672

Network Coordinate (NC) systems are efficient in scalable Internet latency estimation. While most of the focus has been put on how to distort Triangle Inequality Violation (TIV) in metric spaces to relieve the inaccuracy caused by it, TIV is a persistently and widely existing phenomenon on the Internet and thus should be embraced by future NC systems rather than being eliminated. Besides high accuracy, such an NC system can also provide the benefit of reducing the data transmission time by use of proper relay routes. With that in mind, we design an NC system with a hierarchical architecture, which is motivated by the natural idea of partitioning the three TIV links into different autonomous NC systems, in order to make as many as TIVs inherently embeddable in metric space. We implement and deploy our work, named Toread, on real Internet. Evaluation results show that Toread's metric space can well characterize more than 60% TIVs, thus Toread is highly accurate (0.54 in Toread versus 1.06 in Pyxida at 90th percentile Relative Error) and effective in searching detour paths (succeeds in 58.2% cases). © 2010 ACM.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Limitations and possibilities of path trading between autonomous systems

Limitations and possibilities of path trading between autono...

引用

IEEE INFOCOM 2010

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

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 pseudopolynomial 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. ©2010 IEEE.

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

Convex optimizations for distance metric learning and pattern classification

Convex optimizations for distance metric learning and patter...

引用

作者： Weinberger, Kilian Sha, Fei Saul, Lawrence Department of Computer Science and Engineering Washington University St. Louis MO United States Computer Science Department University of Southern California Los Angeles CA United States Department of Computer Science and Engineering UC San Diego San Diego CA United States

The goal of machine learning is to build automated systems that can classify and recognize complex patterns in data. Not surprisingly, the representation of the data plays an important role in determining what types of patterns can be automatically discovered. Many algorithms for machine learning assume that the data are represented as elements in a metric space. For example, in popular algorithms such as nearest-neighbor classification, vector quantization, and kernel density estimation, the metric distances between different examples provide a measure of their dissimilarity [1]. The performance of these algorithms can depend sensitively on the manner in which distances are measured. © 2010 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Equilibrium-Independent Passivity: a New Definition and Implications

Equilibrium-Independent Passivity: a New Definition and Impl...

引用

American Control Conference

作者： George H. Hines Murat Arcak Andrew K. Packard Mechanical Engineering UC Berkeley Electrical Engineering and Computer Science UC Berkeley

ISBN: (纸本)9781424474264

We extend the traditional notion of passivity to a forced system whose equilibrium is nontrivially dependent on the control input by defining equilibrium-independent passivity, a system property characterized by a dissipation inequality centered at an arbitrary equilibrium point. We also provide input/output tests to certify this property which can be performed analytically or empirically. An example from network stability analysis is presented which demonstrates the utility of this new definition. Finally, through a numerical example we show that equilibrium-independent passivity is less restrictive than incremental passivity.

关键词： Force control Control systems Mechanical engineering Feedback Sufficient conditions Contracts computer science Mechanical factors Testing Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

A design pattern language for engineering (parallel) software: Merging the PLPP and OPL projects 10

A design pattern language for engineering (parallel) softwar...

引用

Proceedings of the 2010 Workshop on Parallel Programming Patterns

作者： Keutzer, Kurt Massingill, Berna L. Mattson, Timothy G. Sanders, Beverly A. Dept. of Electrical Engineering and Computer Sciences UC Berkeley Berkeley CA United States Dept. of Computer Science Trinity University San Antonio TX United States Intel Corp. DuPont WA United States Dept. of Computer and Information Sciences University of Florida Gainesville FL United States

ISBN: (纸本)9781605588735

Parallel programming is stuck. To make progress, we need to step back and understand the software people wish to engineer. We do this with a design pattern language. This paper provides background for a lively discussion of this pattern language. We present the context for the problem, the layers in the design pattern language, and descriptions of the patterns themselves. Copyright 2010 is held by the author(s).

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

SeqHive: A reconfigurable computer cluster for genome re-sequencing

SeqHive: A reconfigurable computer cluster for genome re-seq...

引用

20th International Conference on Field Programmable Logic and Applications, FPL 2010

作者： Stevens, Kristian Chen, Henry Filiba, Terry McMahon, Peter Song, Yun S. Department of Computer Science University of California Davis Davis CA 95616 United States Berkeley Wireless Research Center 2108 Allston Way Berkeley CA 94704 United States Department of Electrical Engineering Stanford University Stanford CA 94305 United States Department of Electrical Engineering and Computer Sciences UC Berkeley Berkeley CA 94720 United States

ISBN: (纸本)9780769541792

We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-throughput sequencing technologies. Advances in sequencing technology allow researchers to generate immense amounts of raw data in the form of short reads with high error rates. A prerequisite to effectively utilizing this data for most applications is accurate alignment to a reference genome. While dynamic programming (DP) alignment algorithms are generally avoided on conventional architectures due to their computational complexity, they can be tailored for efficient implementation on systolic architectures. We describe and implement the first system capable of assembling large genomes using DP. We implemented application-specific DP algorithms for aligning data from ultra-high-throughput sequencers in a reconfigurable computing cluster. To obtain the necessary throughput while maintaining scoring integrity, we extended the compact encoding scheme of Lipton and Lopresti for our application. Each FPGA is capable of rapidly aligning multiple reads in parallel against a long reference genome. The reconfigurable cluster proves to be scalable and capable of processing real world datasets with a sustained performance of 11 tera cell updates per second. We examine the advantages and practicality of our system by benchmarking real genomic data from a large sequencing project. Our exhaustive validation confirms that application specific computing hardware can provide more accurate results than current heuristic methods and remain practical. While directly addressing the important problem of genomic assembly, particularly in circumstances where error rates or evolutionary divergence is high, the methods presented are also relevant to many other current applications for this type of data. © 2010 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

COVER SONG DETECTION: FROM HIGH SCORES TO GENERAL CLASSIFICATION

COVER SONG DETECTION: FROM HIGH SCORES TO GENERAL CLASSIFICA...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Suman Ravuri Daniel P.W. Ellis Intl. Computer Science Inst. UC Berkeley Dept. of Electrical Engineering Berkeley CA LabROSA Columbia University Dept. of Electrical Engineering New York NY

ISBN: (纸本)9781424442959;9781424442966

Existing cover song detection systems require prior knowledge of the number of cover songs in a test set in order to identify cover(s) to a reference song. We describe a system that does not require such prior knowledge. The input to the system is a reference track and test track, and the output is a binary classification of whether the inputs are either a reference and a cover or a reference and a non-cover. The system differs from state-of-the-art detectors by calculating multiple input features, performing a novel type of test song normalization in order to combat against "impostor" tracks, and performing classification using either a support vector machine (SVM) or multi-layer perceptron (MLP). On the covers80 test set, the system achieves an equal error rate of 10percent, compared to 21.3percent achieved by the 2007 LabROSA cover song detection system.

关键词： Cover songs music information retrieval Music information retrieval Songs Support Vector Network Detection systems Error analysis Prior Learning Test tracks TEST SETS

来源：评论

学校读者我要写书评

暂无评论

Advances in computer science and engineering 1

引用

丛书名： Communications in computer and Information science

2009年

作者： Hamid Sarbazi-Azad Behrooz Parhami Seyed-Ghassem Miremadi Shaahin Hessabi

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：