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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

1,395 篇 电子文献
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 篇 历史学

主题

24 篇 machine learning
21 篇 computer science
17 篇 computational mo...
16 篇 decoding
13 篇 costs
12 篇 polynomials
12 篇 testing
11 篇 voltage
11 篇 optical pulses
11 篇 silicon
11 篇 humans
11 篇 electrodes
11 篇 artificial intel...
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 el...
30 篇 department of ph...
29 篇 department of ph...
28 篇 department of ph...
28 篇 dunlap institute...
27 篇 lane department ...
27 篇 center for gravi...
26 篇 mit lincoln labo...
25 篇 department of el...
24 篇 department of ph...
24 篇 department of el...
24 篇 mit kavli instit...
23 篇 david a. dunlap ...

作者

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

语言

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

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

共 1395 条记录，以下是781-790 订阅

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

详细简洁

排序：

Upper bound on list-decoding radius of binary codes

Upper bound on list-decoding radius of binary codes

引用

IEEE International Symposium on Information Theory

作者： Yury Polyanskiy Department of Electrical Engineering and Computer Science MIT Cambridge MA USA

ISBN: (纸本)9781467377058

Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at most L. For odd L ≥ 3 an asymptotic upper bound on the rate of any such packing is proven. The resulting bound improves the best known bound (due to Blinovsky' 1986) for rates below a certain threshold. The method is a superposition of the linear- programming idea of Ashikhmin, Barg and Litsyn (that was used previously to improve the estimates of Blinovsky for L = 2) and a Ramsey-theoretic technique of Blinovsky. As an application it is shown that for all odd L the slope of the rate-radius tradeoff is zero at zero rate.

关键词： Upper bound Tin TV Decoding Joints Binary codes Polynomials

来源：评论

学校读者我要写书评

暂无评论

Converse and duality results for combinatorial source-channel coding in binary Hamming spaces

Converse and duality results for combinatorial source-channe...

引用

IEEE International Symposium on Information Theory

作者： Andrew J. Young Yury Polyanskiy Department of Electrical Engineering and Computer Science MIT Cambridge MA USA

This article continues the recent investigation of combinatorial joint source-channel coding. For the special case of a binary source and channel subject to distortion measured by Hamming distance, the lower (converse) bounds on achievable source distortion are improved for all values of channel noise. Operational duality between coding with bandwidth expansion factors ρ and 1 over ρ is established. Although the exact value of the asymptotic noise-distortion tradeoff curve is unknown (except at ρ = 1), some initial results on inter-relations between these curves for different values of ρ are shown and lead to statements about monotonicity and continuity in ρ.

关键词： Distortion Bandwidth Encoding Decoding Joints Upper bound Hamming distance

来源：评论

学校读者我要写书评

暂无评论

On the Quickest Flow Problem in Dynamic Networks - A Parametric Min-Cost Flow Approach 15

On the Quickest Flow Problem in Dynamic Networks - A Paramet...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Maokai Lin Patrick Jaillet Operations Research Center MIT Department of Electrical Engineering and Computer Science and Operations Research Center MIT

ISBN: (纸本)9781510813311

We consider the quickest flow problem in dynamic networks with a single source s and a single sink t: given an amount of flow F, find the minimum time needed to send it from s to t, and the corresponding optimal flow over time. We introduce new mathematical formulations and derive optimality conditions for the quickest flow problem. Based on the optimality conditions, we develop a new costscaling algorithm that leverages the parametric nature of the problem. The algorithm solves the quickest flow problem with integer arc costs in O(nm log(n~2/m) log(nC)) time, where n, m, and C are the number of nodes, arcs, and the maximum arc cost, respectively. Our algorithm runs in the same time bound as the costscaling algorithm by Goldberg and Tarjan [10, 11] for solving the min-cost flow problem. This result shows for the first time that the quickest flow problem can be solved within the same time bound as one of the fastest algorithms for the min-cost flow problem. As a consequence, our algorithm will remain one of the fastest unless the quickest flow problem can be shown to be simpler than the min-cost flow problem.

关键词： dynamic network algorithms optimality Flow arcs Parametric

来源：评论

学校读者我要写书评

暂无评论

Efficient mixed-integer planning for UAVs in cluttered environments

Efficient mixed-integer planning for UAVs in cluttered envir...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Robin Deits Russ Tedrake Computer Science and Artificial Intelligence Lab MIT Cambridge MA USA Faculty of Electrical Engineering and Computer Science MIT Cambridge MA USA

We present a new approach to the design of smooth trajectories for quadrotor unmanned aerial vehicles (UAVs), which are free of collisions with obstacles along their entire length. To avoid the non-convex constraints normally required for obstacle-avoidance, we perform a mixed-integer optimization in which polynomial trajectories are assigned to convex regions which are known to be obstacle-free. Prior approaches have used the faces of the obstacles themselves to define these convex regions. We instead use IRIS, a recently developed technique for greedy convex segmentation [1], to pre-compute convex regions of safe space. This results in a substantially reduced number of integer variables, which improves the speed with which the optimization can be solved to its global optimum, even for tens or hundreds of obstacle faces. In addition, prior approaches have typically enforced obstacle avoidance at a finite set of sample or knot points. We introduce a technique based on sums-of-squares (SOS) programming that allows us to ensure that the entire piecewise polynomial trajectory is free of collisions using convex constraints. We demonstrate this technique in 2D and in 3D using a dynamical model in the Drake toolbox for Matlab [2].

关键词： Trajectory Polynomials Iris Optimization Planning Linear programming Collision avoidance

来源：评论

学校读者我要写书评

暂无评论

Stormy Clouds - security in distributed cloud systems

Stormy Clouds - security in distributed cloud systems

引用

IEEE Conference on ALocal computer Networks Workshops (LCN Workshops)

作者： Muriel Medard Cecil H. Green Electrical Engineering and Computer Science Department MIT - Massachusetts Institute of Technology USA

Summary form only given. As massively distributed storage becomes the norm in cloud networks, they contend with new vulnerabilities imputed by the presence of data in different, possibly untrusted nodes. In this talk, we consider two such types of vulnerabilities. The first one is the risk posed to data stored at nodes that are untrusted. We show that coding alone can be substituted to encryption, with coded portions of data in trusted nodes acting as keys for coded data in untrusted ones. In general, we may interpret keys as representing the size of the list over which an adversary would need to generate guesses in order to recover the plaintext, leading to a natural connection between list decoding and secrecy. Under such a model, we show that algebraic block maximum distance separable (MDS) codes can be constructed so that lists satisfy certain secrecy criteria, which we define to generalize common perfect secrecy and weak secrecy notions. The second type of vulnerability concerns the risk of passwords' being guessed over some nodes storing data, as illustrated by recent cloud attacks. In this domain, the use of guesswork as a metric shows that the dominant effect on vulnerability is not necessarily from a single node, but that it varies in time according to the number of guesses issued. We also introduce the notion of inscrutability, as the growth rate of the average number of probes that an attacker has to make, one at a time, using his best strategy, until he can correctly guess one or more secret strings from multiple randomly chosen strings. Joint work with Ahmad Beirami, Joao Barros, Robert Calderbank, Mark Christiansen, Ken Duffy, Flavio du Pin Calmon, Luisa Lima, Paulo Oliveira, Stefano Tessaro, Mayank Varia, Tiago Vinhoza, Linda Zeger.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting Hyperlactatemia in the MIMIC II Database

Predicting Hyperlactatemia in the MIMIC II Database

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society

作者： Max Dunitz George Verghese Thomas Heldt the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT) Cambridge MA USA. the Institute for Medical Engineering and Science and the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT) Cambridge MA USA

ISBN: (纸本)9781424492695

Sepsis, which occurs when an infection leads to a systemic inflammatory response, is believed to contribute to one in two to three hospital deaths in the United States. Using the Multiparameter Intelligent Monitoring in Intensive Care (MIMIC II) database of electronic medical records from Boston's Beth Israel Deaconess Medical Center (BIDMC), we worked to characterize sepsis at BIDMC's intensive care units. Additionally, we developed a real-time algorithm to stratify patients with infectious complaints into different risk categories for progressing to septic shock. From time series of heart rate and arterial blood pressure, as well as estimates of cardiac output and total peripheral resistance, we developed a variety of classifiers to predict high serum lactate levels, a proxy for hypoperfusion and imminent circulatory shock. The records from 146 patients met our selection criteria. In discriminating patients whose measured serum lactate stays below 2.5 mmol/L from those whose value drifts above, the best of our classifiers perform with area under the receiver operating characteristic exceeding 0.8 on test data.

关键词： MIMIC II BIDMC cardiac output

来源：评论

学校读者我要写书评

暂无评论

Combinatorial design of OLED-emitting materials

Combinatorial design of OLED-emitting materials

引用

2015 SID International Symposium

作者： Aspuru-Guzik, Alan Adams, Ryan Baldo, Marc Aguilera-Iparraguirre, Jorge Gómez-Bombarelli, Rafael Department of Chemistry and Chemical Biology Harvard University CambridgeMA United States School of Engineering and Applied Sciences Harvard University CambridgeMA United States Department of Electrical Engineering and Computer Science MIT CambridgeMA United States

We report the first results from a combinatorial design effort focused on new OLED emitters that exploit thermally-activated delayed fluorescence. Using quantum chemistry and machine learning techniques to prune a pool of over 400, 000 combinations of donor and acceptor subgroups, we demonstrate new dyes that are state-of-the-art, yet entirely computationally-derived. © 2015 SID.

关键词： Quantum chemistry

来源：评论

学校读者我要写书评

暂无评论

Monitoring and detecting atrial fibrillation using wearable technology

Monitoring and detecting atrial fibrillation using wearable ...

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： Shamim Nemati Mohammad M. Ghassemi Vaidehi Ambai Nino Isakadze Oleksiy Levantsevych Amit Shah Gari D. Clifford Dept of Biomedical Informatics Emory University Atlanta GA Dept. of Electrical Engineering and Computer Science MIT Cambrige MA Philadelnhia Collece of Osteonathic Medicine Suwanee GA Dept of Medicine School of Medicine Atlanta GA Division of Cardiolosv Veterans Affairs Hosoital Atlanta GA Dept of Epidemiology Emory University Atlanta GA Dept of Biomedical Engineering Georgia Institute of Technology Atlanta GA

Atrial fibrillation (AFib) is diagnosed by analysis of the morphological and rhythmic properties of the electrocardiogram. It was recently shown that accurate detection of AFib is possible using beat-to-beat interval variations. This raises the question of whether AFib detection can be performed using a pulsatile waveform such as the Photoplethysmogram (PPG). The recent explosion in use of recreational and professional ambulatory wrist-based pulse monitoring devices means that an accurate pulse-based AFib screening algorithm would enable large scale screening for silent or undiagnosed AFib, a significant risk factor for multiple diseases. We propose a noise-resistant machine learning approach to detecting AFib from noisy ambulatory PPG recorded from the wrist using a modern research watch-based wearable device (the Samsung Simband). Ambulatory pulsatile and movement data were recorded from 46 subjects, 15 with AFib and 31 non symptomatic. Single channel electrocardiogram (ECG), multi-wavelength PPG and tri-axial accelerometry were recorded simultaneously at 128 Hz from the non-dominant wrist using the Simband. Recording lengths varied from 3.5 to 8.5 minutes. Pulse (beat) detection was performed on the PPG waveforms, and eleven features were extracted based on beat-to-beat variability and waveform signal quality. Using 10-fold cross validation, an accuracy of 95 % on out-of-sample data was achieved, with a sensitivity of 97%, specificity of 94%, and an area under the receiver operating curve (AUROC) of 0.99. The described approach provides a noise-resistant, accurate screening tool for AFib from PPG sensors located in an ambulatory wrist watch. To our knowledge this is the first study to demonstrate an algorithm with a high enough accuracy to be used in general population studies that does not require an ambulatory Holter electrocardiographic monitor.

关键词： Biomedical monitoring Electrocardiography Feature extraction Hospitals Monitoring Sensitivity Standards

来源：评论

学校读者我要写书评

暂无评论

LCN 2015 keynote by Prof. Muriel MÙdard, professor at mit, USA

LCN 2015 keynote by Prof. Muriel MÙdard, professor at MIT, ...

引用

Conference on Local computer Networks (LCN)

作者： Muriel Médard Green Professor Electrical Engineering and Computer Science Department MIT Massachusetts Institute of Technology USA

As massively distributed storage becomes the norm in cloud networks, they contend with new vulnerabilities imputed by the presence of data in different, possibly untrusted nodes. In this talk, we consider two such types of vulnerabilities. The first one is the risk posed to data stored at nodes that are untrusted. We show that coding alone can be substituted to encryption, with coded portions of data in trusted nodes acting as keys for coded data in untrusted ones. In general, we may interpret keys as representing the size of the list over which an adversary would need to generate guesses in order to recover the plaintext, leading to a natural connection between list decoding and secrecy. Under such a model, we show that algebraic block maximum distance separable (MDS) codes can be constructed so that lists satisfy certain secrecy criteria, which we define to generalize common perfect secrecy and weak secrecy notions. The second type of vulnerability concerns the risk of passwords' being guessed over some nodes storing data, as illustrated by recent cloud attacks. In this domain, the use of guesswork as a metric shows that the dominant effect on vulnerability is not necessarily from a single node, but that it varies in time according to the number of guesses issued. We also introduce the notion of inscrutability, as the growth rate of the average number of probes that an attacker has to make, one at a time, using his best strategy, until he can correctly guess one or more secret strings from multiple randomly chosen strings. Joint work with Ahmad Beirami, Joao Barros, Robert Calderbank, Mark Christiansen, Ken Duffy, Flavio du Pin Calmon, Luisa Lima, Paulo Oliveira, Stefano Tessaro, Mayank Varia, Tiago Vinhoza, Linda Zeger.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Separation architectures for lossy compression

Separation architectures for lossy compression

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Ying-zong Huang Gregory W. Wornell Dept. of Electrical Engineering Computer Science Cambridge MA Research Affiliate at MIT.

High-performance Model-Code Separation (MCS) architectures for lossless compression are practically viable with graphical message-passing in the decoder. This paper extends separation architectures to lossy compression by constructing model-free but semantics-aware encoders and contributes a new inference-friendly low-density hashing quantizer (LDHQ) to support decoding.

关键词： Encoding Decoding Data models Cryptography Indium tin oxide Radio access networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共140页 << < 75 76 77 78 79 80 81 82 83 84 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：