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

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

来源：评论

学校读者我要写书评

暂无评论

Planning for decentralized control of multiple robots under uncertainty

Planning for decentralized control of multiple robots under ...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Christopher Amato George Konidaris Gabriel Cruz Christopher A. Maynor Jonathan P. How Leslie P. Kaelbling Department of Computer Science at the University of New Hampshire Durham Department of Computer Science and the Department of Electrical and Computer Engineering at Duke University Durham CSAIL at MIT Cambridge MA LIDS at MIT Cambridge MA

ISBN: (纸本)9781479969241

This paper presents a probabilistic framework for synthesizing control policies for general multi-robot systems that is based on decentralized partially observable Markov decision processes (Dec-POMDPs). Dec-POMDPs are a general model of decision-making where a team of agents must cooperate to optimize a shared objective in the presence of uncertainty. Dec-POMDPs also consider communication limitations, so execution is decentralized. While Dec-POMDPs are typically intractable to solve for real-world problems, recent research on the use of macro-actions in Dec-POMDPs has significantly increased the size of problem that can be practically solved. We show that, in contrast to most existing methods that are specialized to a particular problem class, our approach can synthesize control policies that exploit any opportunities for coordination that are present in the problem, while balancing uncertainty, sensor information, and information about other agents. We use three variants of a warehouse task to show that a single planner of this type can generate cooperative behavior using task allocation, direct communication, and signaling, as appropriate. This demonstrates that our algorithmic framework can automatically optimize control and communication policies for complex multi-robot systems.

关键词： Robot kinematics History Robot sensing systems Joints Uncertainty Multi-robot systems

来源：评论

学校读者我要写书评

暂无评论

Assessing the Perceived Predictability of Functions 37

Assessing the Perceived Predictability of Functions

引用

37th Annual Meeting of the Cognitive science Society: Mind, Technology, and Society, CogSci 2015

作者： Schulz, Eric Tenenbaum, Joshua B. Reshef, David N. Speekenbrink, Maarten Gershman, Samuel J. Department of Experimental Psychology University College London LondonWC1H 0AP United Kingdom Department of Brain and Cognitive Sciences MIT CambridgeMA02139 United States Department of Electrical Engineering and Computer Science MIT CambridgeMA02139 United States

ISBN: (纸本)9780991196722

How do we perceive the predictability of functions? We derive a rational measure of a function's predictability based on Gaussian process learning curves. Using this measure, we show that the smoothness of a function can be more important to predictability judgments than the variance of additive noise or the number of samples. These patterns can be captured well by the learning curve for Gaussian process regression, which in turn crucially depends on the eigenvalue spectrum of the covariance function. Using approximate bounds on the learning curve, we model participants' predictability judgments about sampled functions and find that smoothness is indeed a better predictor for perceived predictability than both the variance and the sample size. This means that it can sometimes be preferable to learn about noisy but smooth functions instead of deterministic complex ones. © Cognitive science Society, CogSci *** rights reserved.

关键词： Additive noise

来源：评论

学校读者我要写书评

暂无评论

Automated Vulnerability Analysis of AC State Estimation under Constrained False Data Injection in Electric Power Systems

Automated Vulnerability Analysis of AC State Estimation unde...

引用

IEEE Annual Conference on Decision and Control

作者： Sicun Gao Le Xie Armando Solar-Lezama Dimitrios Serpanos Howard Shrobe MIT Computer Science and Artificial Intelligence Lab Department of Electrical and Computer Engineering Texas A&M University Qatar Computing Research Institute

ISBN: (纸本)9781479978878

We introduce new methods for the automatic vulnerability analysis of power grids under false data injection attacks against nonlinear (AC) state estimation. We encode the analysis problems as logical decision problems that can be solved automatically by SMT solvers. To do so, we propose an analysis technique named "symbolic propagation," which is inspired by symbolic execution methods for finding bugs and exploits in software programs. We show that the proposed methods can successfully analyze vulnerability of AC state estimation in realistic power grid models. Our approach is generalizable towards many other applications such as power flow analysis and state estimation.

关键词： power systems State estimation Power grids Power flow analysis False Vulnerability AUTOMATIC

来源：评论

学校读者我要写书评

暂无评论

Beating the random assignment on constraint satisfaction problems of bounded degree

Beating the random assignment on constraint satisfaction pro...

引用

18th International Workshop on ApproximationAlgorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015

作者： Barak, Boaz Moitra, Ankur O'Donnell, Ryan Raghavendra, Prasad Regev, Oded Steurer, David Trevisan, Luca Vijayaraghavan, Aravindan Witmer, David Wright, John Microsoft Research New England United States MIT Mathematics Department United States Department of Computer Science Carnegie Mellon University United States UC Berkeley Department of Electrical Engineering and Computer Sciences United States Courant Institute of Mathematical Sciences New York University United States Cornell University United States

ISBN: (纸本)9783939897897

We show that for any odd k and any instance = of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a 1/2 +Ω (1/√ D) fraction of ß's constraints, where D is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a quantum algorithm to find an assignment satisfying a 1/2 +Ω (D-3/4) fraction of the equations. For arbitrary constraint satisfaction problems, we give a similar result for "triangle-free" instances;i.e., an efficient algorithm that finds an assignment satisfying at least a μ + Ω (1/√ D) fraction of constraints, where μ is the fraction that would be satisfied by a uniformly random assignment. © Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, and John Wright.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

The growth of low wafer bow AlGaN/GaN structure on 200mm Si(111) 30

The growth of low wafer bow AlGaN/GaN structure on 200mm Si(...

引用

30th International Conference on Compound Semiconductor Manufacturing Technology, CS MANTECH 2015

作者： Huang, Chieh-Chih Ried, Frank Palacios, Tomas Chua, Soo Jin Fitzgerald, Eugene A. Singapore-MIT Alliance for Research and Technology Center 1 Create Way Singapore138602 Singapore AIXTRON SE Herzogenrath52134 Germany Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States National University of Singapore Engineering Drive 3 Singapore117576 Singapore Department of Materials Science and Engineering Massachusetts Institute of Technology CambridgeMA02139 United States

In this study, we would like to find out the simplest way to achieve the lowest wafer bow in the GaN HEMT on 200mm Si wafer. The simplest refit that we found involved using 12 sapphire blocks distributed around the periphery of the flat susceptor. The final wafer bow can reach around 22um for the GaN HEMT on 1mm thick 200mm Si wafer. The sheet resistance of the sample with the sapphire blocks will measure 34% lower than the sample without the sapphire blocks.

关键词： III-V semiconductors

来源：评论

学校读者我要写书评

暂无评论

Particle computation: Device fan-out and binary memory

Particle computation: Device fan-out and binary memory

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Hamed Mohtasham Shad Rose Morris-Wright Erik D. Demaine Sándor P. Fekete Aaron T. Becker MIT the Computer Science and Artificial Intelligence Laboratory Cambridge MA USA Dept. of Computer Science TU Braunschweig Braunschweig Germany Dept. of Electrical and Computer Engineering University of Houston Houston TX USA

ISBN: (纸本)9781479969241

We present fundamental progress on the computational universality of swarms of micro- or nano-scale robots in complex environments, controlled not by individual navigation, but by a uniform global, external force. Consider a 2D grid world, in which all obstacles and robots are unit squares, and for each actuation, robots move maximally until they collide with an obstacle or another robot. In previous work, we demonstrated components of particle computation in this world, designing obstacle configurations that implement AND and OR logic gates: by using dual-rail logic, we designed NOT, NOR, NAND, XOR, XNOR logic gates. However, we were unable to design a FAN-OUT gate, which is necessary for simulating the full range of complex interactions that are present in arbitrary digital circuits. In this work we resolve this problem by proving unit-sized robots cannot generate a FAN-OUT gate. On the positive side, we resolve the missing component with the help of 2×1 robots, which can create fan-out gates that produce multiple copies of the inputs. Using these gates we are able to establish the full range of computational universality as presented by complex digital circuits. As an example we connect our logic elements to produce a 3-bit counter. We also demonstrate how to implement a data storage element.

关键词： Logic gates computers Clocks Robot kinematics Radiation detectors Wiring

来源：评论

学校读者我要写书评

暂无评论

Silicon Nanoparticles: Porous Silicon Nanoparticle Delivery of Tandem Peptide Anti‐Infectives for the Treatment ofPseudomonas aeruginosaLung Infections (Adv. Mater. 35/2017)

引用

Advanced Materials 2017年第35期29卷

作者： Ester J. Kwon Matthew Skalak Alessandro Bertucci Gary Braun Francesco Ricci Erkki Ruoslahti Michael J. Sailor Sangeeta N. Bhatia Koch Institute for Integrative Cancer Research and Harvard‐MIT Division of Health Sciences and Technology Massachusetts Institute of Technology Cambridge MA 02139 USA Department of Chemistry and Biochemistry University of California at San Diego La Jolla CA 92093 USA Dipartimento di Scienze e Tecnologie Chimiche University of Rome Tor Vergata Via della Ricerca Scientifica Rome 00133 Italy Cancer Research Center Sanford Burnham Prebys Medical Discovery Institute La Jolla CA 92037 USA Koch Institute for Integrative Cancer Research Institute for Medical Engineering and Science Harvard‐MIT Division of Health Sciences and Technology Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge MA 02139 USA Howard Hughes Medical Institute Massachusetts Institute of Technology Cambridge MA 02139 USA

来源：评论

学校读者我要写书评

暂无评论

Measurement of shear and slip with a GelSight tactile sensor

Measurement of shear and slip with a GelSight tactile sensor

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Wenzhen Yuan Rui Li Mandayam A. Srinivasan Edward H. Adelson Department of Mechanical Engineering MIT Cambridge MA USA Department of Electrical Engineering and Computer Science (EECS) and CSAIL MIT Cambridge MA USA Massachusetts Institute of Technology Cambridge MA US Department of Brain and Cognitive Sciences and CSAIL MIT Cambridge MA USA

Artificial tactile sensing is still underdeveloped, especially in sensing shear and slip on a contact surface. For a robot hand to manually explore the environment or perform a manipulation task such as grasping, sensing of shear forces and detecting incipient slip is important. In this paper, we introduce a method of sensing the normal, shear and torsional load on the contact surface with a GelSight tactile sensor [1]. In addition, we demonstrate the detection of incipient slip. The method consists of inferring the state of the contact interface based on analysis of the sequence of images of GelSights elastomer medium, whose deformation under the external load indicates the conditions of contact. Results with a robot gripper like experimental setup show that the method is effective in detecting interactions with an object during stable grasp as well as at incipient slip. The method is also applicable to other optical based tactile sensors.

关键词： Force Surface topography Tactile sensors Entropy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：