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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

702 篇 期刊文献
691 篇 会议
4 册 图书

馆藏范围

1,397 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

856 篇 工学
- 338 篇 计算机科学与技术...
- 267 篇 软件工程
- 244 篇 电子科学与技术（可...
- 209 篇 电气工程
- 150 篇 光学工程
- 138 篇 信息与通信工程
- 112 篇 材料科学与工程（可...
- 100 篇 控制科学与工程
- 93 篇 生物工程
- 83 篇 生物医学工程（可授...
- 78 篇 化学工程与技术
- 62 篇 仪器科学与技术
- 59 篇 力学（可授工学、理...
- 37 篇 机械工程
- 37 篇 动力工程及工程热...
- 27 篇 土木工程
711 篇 理学
- 380 篇 物理学
- 240 篇 数学
- 114 篇 生物学
- 93 篇 统计学（可授理学、...
- 85 篇 化学
- 61 篇 系统科学
- 40 篇 地球物理学
101 篇 管理学
- 71 篇 管理科学与工程(可...
- 35 篇 工商管理
- 32 篇 图书情报与档案管...
60 篇 医学
- 43 篇 临床医学
- 39 篇 基础医学(可授医学...
- 28 篇 药学(可授医学、理...
29 篇 法学
16 篇 经济学
13 篇 教育学
10 篇 文学
10 篇 农学
5 篇 军事学
1 篇 哲学
1 篇 历史学

主题

25 篇 machine learning
21 篇 computer science
17 篇 computational mo...
16 篇 decoding
13 篇 costs
12 篇 polynomials
12 篇 artificial intel...
12 篇 testing
11 篇 voltage
11 篇 optical pulses
11 篇 silicon
11 篇 humans
11 篇 electrodes
11 篇 forecasting
10 篇 nonlinear optics
10 篇 laboratories
10 篇 optimization
10 篇 trajectory
10 篇 hardware
9 篇 qubits

机构

71 篇 department of el...
62 篇 department of el...
53 篇 department of el...
50 篇 department of el...
45 篇 department of el...
41 篇 mit dep of elect...
35 篇 research laborat...
31 篇 department of ph...
31 篇 department of el...
29 篇 dunlap institute...
29 篇 department of ph...
28 篇 department of ph...
27 篇 lane department ...
27 篇 center for gravi...
26 篇 mit lincoln labo...
25 篇 department of el...
24 篇 david a. dunlap ...
24 篇 department of ph...
24 篇 department of el...
24 篇 mit kavli instit...

作者

30 篇 oliver william d...
26 篇 jaillet patrick
24 篇 gustavsson simon
23 篇 bandura kevin
23 篇 mena-parra juan
22 篇 niedzielski beth...
21 篇 leung calvin
20 篇 cassanelli tomas
19 篇 gaensler b.m.
19 篇 adalsteinsson el...
19 篇 rahman mubdi
19 篇 brar charanjot
19 篇 orlando terry p.
18 篇 pearlman aaron b...
18 篇 rafiei-ravandi m...
18 篇 shin kaitlyn
18 篇 vanderlinde keit...
18 篇 yoder jonilyn l.
17 篇 sanghavi pranav
17 篇 dobbs matt

语言

1,221 篇 英文
165 篇 其他
11 篇 中文

检索条件"机构=Electrical Engineering and Computer Science/MIT"

共 1397 条记录，以下是871-880 订阅

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

详细简洁

排序：

Learning k-modal distributions via testing

Learning k-modal distributions via testing

引用

23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012

作者： Daskalakis, Constantinos Diakonikolas, Ilias Servedio, Rocco A. Electrical Engineering and Computer Science Department MIT United States Computer Science Division UC Berkeley United States Department of Computer Science Columbia University United States

ISBN: (纸本)9781611972108

A k-modal probability distribution over the domain {1,..., n} is one whose histogram has at most k "peaks" and "valleys." Such distributions are natural generalizations of monotone (k = 0) and unimodal (k = 1) probability distributions, which have been intensively studied in probability theory and statistics. In this paper we consider the problem of learning an unknown k-modal distribution. The learning algorithm is given access to independent samples drawn from the k-modal distribution p, and must output a hypothesis distribution pˆ such that with high probability the total variation distance between p and pˆ is at most Ε. We give an efficient algorithm for this problem that runs in time poly(k, log(n), 1/Ε). For k ≤ Õ(√log n), the number of samples used by our algorithm is very close (within an Õ(log(1/Ε)) factor) to being information- theoretically optimal. Prior to this work computationally efficient algorithms were known only for the cases k = 0,1 [Bir87b, Bir97]. A novel feature of our approach is that our learning algorithm crucially uses a new property testing algorithm as a key subroutine. The learning algorithm uses the property tester to efficiently decompose the k-modal distribution into k (near)-monotone distributions, which are easier to learn. Copyright © SIAM.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

High-throughput mutiplexed protease activity measurement using a droplet based microfluidic platform with picoinjector

High-throughput mutiplexed protease activity measurement usi...

引用

16th International Conference on Miniaturized Systems for Chemistry and Life sciences, MicroTAS 2012

作者： Chen, Chia-Hung Miller, Miles A. Sarkar, Aniruddh Beste, Michael T. Lauffenburger, Douglas A. Griffith, Linda G. Han, Jongyoon Department of Bioengineering National University of Singapore Singapore Department of Biological Engineering MIT United States Department of Electrical Engineering and Computer Science MIT United States

ISBN: (纸本)9780979806452

In this study, we integrated several components, including a droplet generator, a pico-injector, and an analytical inference technique, Proteolytic Activity Matrix Analysis (PrAMA), to create a platform for assessing multiple specific protease activity assays with minimal liquid handling and sample-requirement for personal medicine analysis. The microfluidic platform enables the direct measurements of protease enzyme activity, which is more physiologically informative than the standard measurements to determine the enzyme concentration alone. By tracking hundreds of picoliter droplets containing biological samples mixed with unique FRET-based protease substrates and inhibitors, the assay simultaneously infers multiple specific protease activities with minimal (

关键词： Drops

来源：评论

学校读者我要写书评

暂无评论

Phase-locking of a 3.4-THz Quantum Cascade Laser using a harmonic super-lattice mixer

Phase-locking of a 3.4-THz Quantum Cascade Laser using a har...

引用

International Conference on Infrared and Millimeter Waves

作者： A.V. Khudchenko D. J. Hayton D. G. Pavelyev J. N. Hovenier A.M. Baryshev J. R. Gao T-Y. Kao Q. Hu J.L. Reno V. L. Vaks SRON The Netherlands Institute for Space Research Radiophysics department of Nizhny Novgorod State University Russia Kavli Institute of Nanoscience Delft University of Technology The Netherlands NOVA/Kapteyn Astronomical Institute The Netherlands Department of Electrical Engineering and Computer Science MIT USA Sandia National Laboratories Albuquerque USA Institute for Physics of Microstructures of the Russian Academy of Sciences Russia

We report on a phase locking experiment of a 3.4 THz Quantum Cascade Laser (QCL) by using only room temperature electronics. A super-lattice harmonic mixer was used to produce a bit signal between the QCL signal and the 18 th harmonic of a 190 GHz reference generator. The beat signal more than 30 dB above the noise level for 1 MHz RBW was observed. Such a signal to noise ratio was sufficient to provide high quality phase-locking and synchronize to a microwave reference up to 99% of the emitted QCL power.

关键词： Quantum cascade lasers Harmonic analysis Mixers Educational institutions Noise level Signal to noise ratio Microwave oscillators

来源：评论

学校读者我要写书评

暂无评论

Orion 2.0: A power-area simulator for interconnection networks

Orion 2.0: A power-area simulator for interconnection networ...

引用

作者： Kahng, Andrew B. Li, Bin Peh, Li-Shiuan Samadi, Kambiz Departments of Computer Science and Engineering and of Electrical and Computer Engineering University of California at San Diego San Diego CA 92093-0404 United States Intel Corporation Hillsboro OR 97124 United States Department of Electrical Engineering and Computer Science MIT Cambridge MA 02139-4309 United States Department of Electrical and Computer Engineering University of California at San Diego San Diego CA 92093-0409 United States

As industry moves towards multicore chips, networks-on-chip (NoCs) are emerging as the scalable fabric for interconnecting the cores. With power now the first-order design constraint, early-stage estimation of NoC power has become crucially important. In this work, we present ORION 2.0, an enhanced NoC power and area simulator, which offers significant accuracy improvement relative to its predecessor, ORION 1.0. © 2006 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Retroactivity to the Input in Complex Gene Transcription Networks

Retroactivity to the Input in Complex Gene Transcription Net...

引用

IEEE Annual Conference on Decision and Control

作者： Andras Gyorgy Domitilla Del Vecchio Department of Electrical Engineering and Computer Science MIT Department of Mechanical Engineering MIT

ISBN: (纸本)9781467320658

Synthetic biology is a bottom-up engineering discipline: biological modules are systematically designed with predefined behavior and then combined to build up larger circuits. Although the modules produce the desired behavior in isolation, they fail to operate properly when they are connected due to retroactivity, an effect which extends the notion of impedance to biomolecular systems. Despite playing a central role, retroactivity is not yet characterized in complex gene transcription networks. In this paper, we mathematically describe and quantify this effect. This result is obtained by applying singular perturbation on the finite time interval. We identify the biomolecular counterpart of impedance and introduce the effective retroactivity to the input of a gene. Furthermore, we provide a theorem describing how modules affect each other when connected. We restore modular composition of synthetic circuits by extending the characterization of modules with internal and input retroactivities. We illustrate the implications of the results by investigating crosstalk in a simple genetic system.

关键词： Genetic Transcription impedance Time intervals synthetic biology ENTERING Theorem BIOPAKS Electric circuits engineering discipline

来源：评论

学校读者我要写书评

暂无评论

Decentralized data fusion and active sensing with mobile sensors for modeling and predicting spatiotemporal traffic phenomena

Decentralized data fusion and active sensing with mobile sen...

引用

28th Conference on Uncertainty in Artificial Intelligence, UAI 2012

作者： Chen, Jie Low, Kian Hsiang Tan, Colin Keng-Yan Oran, Ali Jaillet, Patrick Dolan, John Sukhatme, Gaurav Singapore-MIT Alliance for Research and Technology Singapore Dept. Computer Science National University of Singapore Singapore Dept. Electrical Engineering and Computer Science MIT United States Robotics Institute Carnegie Mellon University United States Dept. Computer Science University of Southern California USA United States

ISBN: (纸本)9780974903989

The problem of modeling and predicting spatiotemporal traffic phenomena over an urban road network is important to many traffic applications such as detecting and forecasting congestion hotspots. This paper presents a decentralized data fusion and active sensing (D2FAS) algorithm for mobile sensors to actively explore the road network to gather and assimilate the most informative data for predicting the traffic phenomenon. We analyze the time and communication complexity of D2FAS and demonstrate that it can scale well with a large number of observations and sensors. We provide a theoretical guarantee on its predictive performance to be equivalent to that of a sophisticated centralized sparse approximation for the Gaussian process (GP) model: The computation of such a sparse approximate GP model can thus be parallelized and distributed among the mobile sensors (in a Google-like MapReduce paradigm), thereby achieving efficient and scalable prediction. We also theoretically guarantee its active sensing performance that improves under various practical environmental conditions. Empirical evaluation on real-world urban road network data shows that our D2FAS algorithm is significantly more time-efficient and scalable than state-ofthe- art centralized algorithms while achieving comparable predictive performance.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

The AAAI-13 conference workshops

The AAAI-13 conference workshops

引用

作者： Agrawal, Vikas Archibald, Christopher Bhatt, Mehul Bui, Hung Cook, Diane J. Cortés, Juan Geib, Christopher Gogate, Vibhav Guesgen, Hans W. Jannach, Dietmar Johanson, Michael Kersting, Kristian Konidaris, George Kotthoff, Lars Michalowski, Martin Natarajan, Sriraam O'Sullivan, Barry Pickett, Marc Podobnik, Vedran Poole, David Shastri, Lokendra Shehu, Amarda Sukthankar, Gita IBM Research India Mississippi State University United States University of Bremen Germany Laboratory for Natural Language Understanding Sunnyvale CA United States Washington State University United States University of Toulouse France Drexel University United States Department of Computer Science University of Texas Dallas United States Massey University New Zealand TU Dortmund Germany University of Alberta in Edmonton Canada Fraunhofer IAIS and the University of Bonn Germany MIT United States INSIGHT Centre for Data Analytics University College Cork Ireland Adventium Labs Minneapolis MN United States Indiana University Bloomington IN United States Naval Research Laboratory Washington DC United States Telecommunication Department of the Faculty of Electrical Engineering and Computing University of Zagreb Croatia Department of Computer Science University of British Columbia Vancouver Canada Infosys India George Mason University United States University of Central Florida United States

The AAAI-13 Workshop Program, a part of the 27th AAAI Conference on Artificial Intelligence, was held Sunday and Monday, July 14-15, 2013, at the Hyatt Regency Bellevue Hotel in Bellevue, Washington, USA. The program included 12 workshops covering a wide range of topics in artificial intelligence, including Activity Context-Aware System Architectures (WS-13-05);Artificial Intelligence and Robotics Methods in Computational Biology (WS-13-06);Combining Constraint Solving with Mining and Learning (WS-13-07);computer Poker and Imperfect Information (WS-13-08);Expanding the Boundaries of Health Informatics Using Artificial Intelligence (WS-13-09);Intelligent Robotic Systems (WS-13-10);Intelligent Techniques for Web Personalization and Recommendation (WS- 13-11);Learning Rich Representations from Low-Level Sensors (WS-13-12);Plan, Activity, and Intent Recognition (WS-13-13);Space, Time, and Ambient Intelligence (WS-13-14);Trading Agent Design and Analysis (WS-13-15);and Statistical Relational Artificial Intelligence (WS-13-16). Copyright © 2013, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Teaching oral communication at mit: The proposal module

Teaching oral communication at MIT: The proposal module

引用

International Conference on computer science & Education (ICCSE)

作者： Tony L Eng Department of Electrical Engineering & Computer Science MIT Cambridge USA

This paper is the third in a series of papers describing the teaching modules used in an oral communication course at mit called ***. This course is offered in the Department of electrical engineering and computer science (EECS), the largest department at mit, and is required for all EECS undergraduates. The third module is centered around an oral presentation assignment that introduces students to proposals and to persuasive presentations. We discuss the module and what we've learned, hoping that fellow practitioners will (1) adapt the module for use in their home institution, and (2) suggest modifications/improvements.

关键词： Proposals Education Oral communication computer science Employment Materials electrical engineering

来源：评论

学校读者我要写书评

暂无评论

A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size

A near-optimal sublinear-time algorithm for approximating th...

引用

23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012

作者： Onak, Krzysztof Ron, Dana Rosen, Michal Rubinfeld, Ronitt School of Computer Science Carnegie Mellon University United States School of Electrical Engineering Tel Aviv University Israel Blavatnik School of Computer Science Tel Aviv University Israel CSAIL MIT Cambridge MA 02139 United States

ISBN: (纸本)9781611972108

We give a nearly optimal sublinear-time algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the ith neighbor of v. Letting VCopt(G) denote the minimum size of vertex cover in G, the algorithm outputs, with high constant success probability, an estimate VC(G) such that VCopt(G) ≤ VC(G) ≤ 2VCopt(G) + Εn, where Ε is a given additive approximation parameter. We refer to such an estimate as a (2, Ε)-estimate. The query complexity and running time of the algorithm are Õ(d¯ ·poly(1/Ε)), where d¯ denotes the average vertex degree in the graph. The best previously known sublinear algorithm, of Yoshida et al. (STOC 2009), has query complexity and running time O(d4/Ε2) , where d is the maximum degree in the graph. Given the lower bound of Ω(d) (for constant Ε) for obtaining such an estimate (with any constant multiplicative factor) due to Parnas and Ron (TCS 2007), our result is nearly optimal. In the case that the graph is dense, that is, the number of edges is Θ(n2), we consider another model, in which the algorithm may ask, for any pair of vertices u and v, whether there is an edge between u and v. We show how to adapt the algorithm that uses neighbor queries to this model and obtain an algorithm that outputs a (2, Ε)-estimate of the size of a minimum vertex cover whose query complexity and running time are Õ(n)·poly(1/Ε). Copyright © SIAM.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A scalable FPGA-based design for field programmable large-scale ion channel simulations

A scalable FPGA-based design for field programmable large-sc...

引用

22nd International Conference on Field Programmable Logic and Applications, FPL 2012

作者： Coapes, Graeme Mak, Terrence Luo, Jun Wen Yakovlev, Alex Poon, Chi-Sang School of Electrical and Electronic Engineering Newcastle University United Kingdom Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Harvard-MIT Division of Health Sciences and Technology United States

ISBN: (纸本)9781467322560

The design of systems to replicate complex neural functionality is a requirement for the development of next-generation prosthetic devices. The demands of such neural models are growing exponentially as we discover more about how brain systems function. It is therefore important for the electronic architectures involved to scale effectively in terms of latency, area and power usage in order to be able to process more advanced neural models. Within this paper a design is proposed that utilises the parallel nature and the resources available upon modern FPGAs to achieve a scalable and efficient method for the implementation of complex neural models, allowing for the simulation of 150000 ion channels concurrently. © 2012 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共140页 << < 84 85 86 87 88 89 90 91 92 93 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：