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

IEEE Global Humanitarian Technology Conference (GHTC)

作者： Brandie Nonnecke Sanjay Krishnan Jay Patel Mo Zhou Laura Byaruhanga Dorothy Masinde Maria Elena Meneses Alejandro Martin del Campo Camille Crittenden Ken Goldberg CITRIS Connected Communities Initiative UC Berkeley Electrical Engineering and Computer Science UC Berkeley Industrial Engineering and Operations Research UC Berkeley Uganda Program Iowa State University Global Resource Systems Iowa State University Tecnologico de Monterrey CITRIS Connected Communities Initiative UC Berkeley

The design and assessment of development initiatives is increasingly participatory, where decision makers consider feedback from affected populations. While digital data collection facilitates faster and more reliable analysis, existing data collection tools are not optimized for unstructured qualitative (textual) data and peer-to-peer participant collaboration. In this paper, we propose a system called the Development Collaborative Assessment and Feedback Engine version 1.0 (DevCAFE), a customizable participatory assessment platform that collects and integrates quantitative assessment, qualitative feedback and peer-to-peer collaborative filtering. DevCAFE incorporates a library of statistical analyses for researchers to quickly identify quantitative and qualitative trends while collecting field data. DevCAFE can run on any mobile device with a Web-browser and can work with or without Internet connectivity. We present results from two pilot projects: (1) 137 participants evaluating family planning education trainings at three Nutrition Education Centers in rural Uganda, and (2) 4,518 participants evaluating policy priorities for elected leaders in the June 2015 Mexico mid-term elections. DevCAFE collected over 19,000 peer-to-peer ratings of 336 submitted ideas. Feedback gathered through DevCAFE enabled targeted reforms to the family planning efforts in Uganda and the need for increased government attention to public safety in Mexico. Case studies and interactive demos are available at: http://***/devcafe/.

关键词： Data collection Filtering Collaboration Principal component analysis Peer-to-peer computing Internet Visualization

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017) of the Organization for Computational Neuroscience Antwerp, Belgium, July 15-20, 2017

引用

BMC NEUROscience 2017年第SUPPL 1期18卷 59-59页

作者： [Anonymous] Indiana University Purdue University Indianapolis Indianapolis IN 46032 USA Stark Neurosciences Research Institute Indiana University School of Medicine Indianapolis IN 46032 USA Department of Mathematics East Carolina University Greenville NC 27858 USA Jülich Supercomputing Centre Forschungszentrum Jülich 52425 Jülich Germany Future Systems Swiss National Supercomputing Centre 8092 Zurich Switzerland User Engagement and Support Swiss National Supercomputing Centre 6900 Lugano Switzerland Institut de Neurosciences des Systèmes Aix Marseille Univ 13005 Marseille France Simulation Lab Neuroscience Forschungszentrum Jülich Jülich Germany Department of Experimental Psychology Ghent University 9000 Ghent Belgium Donders Center for Cognitive Neuroimaging Radboud University 6525HR Nijmegen The Netherlands Department of Electrical Computer and Energy Engineering University of Colorado Boulder CO 80309 USA Department of Neurosurgery Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Neurology Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Otolaryngology Johns Hopkins School of Medicine Baltimore MD 21287 USA INSERM U968 Paris France Sorbonne Universités UPMC University Paris 06 UMR_S 968 Institut de la Vision Paris France CNRS UMR_7210 Paris France Department of Computer Architecture and Technology University of Granada (CITIC) Granada Spain Sorbonne Universités UPMC Univ Paris 06 INSERM CNRS Institut de la Vision Paris France Department of Adaptive Machine Systems Osaka University Osaka Japan Department of Computer Science University of Cergy-Pontoise Cergy-Pontoise France Department of Physics and Astronomy College of Charleston Charleston SC 29424 USA School of Physics Faculty of Science University of Sydney Sydney NSW 2006 Australia Center of Excellence for Integrative Brain Function Australian Research Council Sydney Australia Max Planck Institute for Human Cognitive and Brain Sciences Saxony Lei

来源：评论

学校读者我要写书评

暂无评论

A mathematical framework for delay analysis in single source networks

A mathematical framework for delay analysis in single source...

引用

American Control Conference

作者： Axel Parmentier Samitha Samaranayake Yiguang (Ethan) Xuan Alexandre Bayen Centre d'Enseignement et de Recherche en Mathmatiques et Calcul Scientifique at cole des Ponts ParisTech Department of Civil and Environmental Engineering at the UC Berkeley California Partners for Advanced Transportation Technology at UC Berkeley Department of Electrical Engineering and Computer Science and Civil and Environmental Engineering at UC Berkeley

ISBN: (纸本)9781479917730

This article presents a mathematical framework for modeling heterogeneous flow networks with a single source and multiple sinks. The traffic is differentiated by its destination (i.e. Lagrangian flow) and different flow groups are assumed to satisfy the first-in-first-out (FIFO) condition at each junction. We show that our model leads to a well-posed problem for computing the dynamics of the system and prove that the solution is unique through a mathematical derivation of the model properties. The framework is then used to analytically prescribe the delays at each junction of the network and across any sub-path, which is one of the contributions of the article. This is a critical requirement when solving control and optimization problems over the network, such as system optimal network routing and solving for equilibrium behavior. In fact, the framework provides analytical expressions for the delay at any node or sub-path as a function of the inflow at any upstream node. Furthermore, the model can be solved numerically using a very simple and efficient feed forward algorithm. We demonstrate the versatility of the framework by applying it to a diverge junction with complex junction dynamics.

关键词： Frameworks first-in first-out Network routing delay Traffic Network destination Line of nodes INFLUX

来源：评论

学校读者我要写书评

暂无评论

Adaptively constrained stochastic model predictive control applied to security constrained optimal power flow

Adaptively constrained stochastic model predictive control a...

引用

American Control Conference

作者： Frauke Oldewurtel Line Roald Goran Andersson Claire Tomlin Department of Electrical Engineering and Computer Science UC Berkeley USA Power Systems Laboratory Department of Electrical Engineering Swiss Federal Institute of Technology in Zurich (ETHZ) Switzerland

ISBN: (纸本)9781479917730

The number of renewable energy sources in electricity grids is growing and with it the associated uncertainty. For power system operation a good tradeoff between security and cost becomes increasingly important. We consider the problem of including uncertainty from renewable in-feed in a DC security constrained optimal power flow (SCOPF) by formulating chance constraints. The chance-constrained SCOPF is solved repeatedly and can be understood as a chance-constrained Model Predictive Control (MPC) problem, where the time coupling comes from storage in the system and the associated dynamics. The main focus of the paper is to reformulate the problem in a non-conservative way, i.e., to exploit the predefined violation level of the chance constraints based on their empirical closed-loop violations in order to achieve a good tradeoff between operational security and cost. We use and extend a recently proposed adaptive stochastic MPC scheme that starts with a standard conservative chance-constrained reformulation and then adapts the formulation of the constraints online based on the empirical violation level. The proposed approach is demonstrated on a 5-bus network.

关键词： Stochastic model predictive control Chance constraints Adaptive control Closed-loop violation optimal load flow adaptive control Predictive control Security nonlinear model predictive control Power grids Renewable energy Cache Memory System Stochastic models tradeoffs

来源：评论

学校读者我要写书评

暂无评论

BLAST: Battery lifetime-constrained adaptation with selected target in mobile devices

EAI Endorsed Transactions on Energy Web

引用

EAI Endorsed Transactions on Energy Web 2015年第5期15卷 1-10页

作者： Mercati, Pietro Hanumaiah, Vinay Kulkarni, Jitendra Bloch, Simon Rosing, Tajana Computer Science Department UC San Diego San DiegoCA United States Advanced Systems Engineering Lab Samsung Research America Mountain ViewCA United States

Mobile devices today contain many power hungry subsystems and execute different applications. Standard power management is not aware of the desired battery lifetime and has no visibility into which applications are executing. However, power consumption is strongly dependent on which applications are executed. In this work, we propose a novel power characterization strategy for mobile devices called application-dependent power states (AP-states). Based on that, we formulate a management problem to improve performance under battery lifetime constraints, and we implement the management framework on a real Android device. We call our framework BLAST: Battery Lifetime-constrained Adaptation with Selected Target. The goal of such framework is to maximize performance while letting the device battery to last at least for a certain required lifetime, and only requires the user to select the desired target lifetime. The implementation does not require OS modifications and can be ported and installed to any Android device. We experimentally verify that our strategy can still meets user experience requirements with a selected target battery lifetime extension of at least 25%. © 2015 ICST.

关键词： Power management

来源：评论

学校读者我要写书评

暂无评论

Simulation graphs for reverse engineering

Simulation graphs for reverse engineering

引用

Formal Methods in computer Aided Design (FMCAD)

作者： Mathias Soeken Baruch Sterin Rolf Drechsler Robert Brayton Faculty of Mathematics and Computer Science University of Bremen Germany Cyber-Physical Systems DFKI GmbH Bremen Germany Faculty of Engineering University of Freiburg Freiburg Germany Electrical Engineering and Computer Sciences UC Berkeley CA USA

Reverse engineering is the extraction of word level information from a gate-level netlist. It has applications in formal verification, hardware trust, information recovery, and general technology mapping. A preprocessing step finds blocks in a circuit in which word level components are expected. A second step searches for word level components in these blocks. For this second step, we propose two variants of equivalence checking that consider subfunction containment. We propose algorithms to solve these variants by using subgraph isomorphism. A simulation graph (SG) is constructed for the block and for each library component, using a set of permutation-invariant simulation vectors for that component. If a library component SG is a subgraph of the block SG, we have a candidate match, which is then checked by standard equivalence checking. We extend a state-of-the-art subgraph isomorphism algorithm, LAD, to handle simulation graphs efficiently and also propose a SAT-based formulation. Experimental evaluations show that our algorithms can efficiently find 32-bit arithmetic components in blocks with over 300 primary inputs.

关键词： Integrated circuit modeling Boolean functions Libraries Adders Logic gates Labeling Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Large-scale phase retreival for metrology invited talk

Large-scale phase retreival for metrology invited talk

引用

IEEE/LEOS International Conference on Optical MEMS

作者： Laura Waller Lei Tian Jingshan Zhong Ziji Liu Department of Electrical Engineering and Computer Sciences UC Berkeley Berkeley CA USA School of Optoelectronic Information University of Electronic Science and Technology of China Chengdu China

This talk will describe two different microscope setups for achieving quantitative phase images in a commercial microscope using simple hardware. First, we discuss methods that use a stack of intensity images captured through focus in order to reconstruct phase, which can be related to surface height maps for applications in surface profiling and metrology. Second, we describe a new LED array microscope that enables phase profiling across a very large field-of-view (2mm) with high resolution (0.7 NA), by patterning the illumination angles with an LED array illuminator and implementing Fourier Ptychography. Both methods are implemented with simple hardware modifications to traditional microscopes and both exhibit stable, accurate and robust quantitative phase inversion algorithms.

关键词： Microscopy Arrays Light emitting diodes Lighting Optical microscopy Image resolution

来源：评论

学校读者我要写书评

暂无评论

Willow: A user-programmable SSD 11

Willow: A user-programmable SSD

引用

11th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2014

作者： Seshadri, Sudharsan Gahagan, Mark Bhaskaran, Sundaram Bunker, Trevor De, Arup Jin, Yanqin Liu, Yang Swanson, Steven Computer Science and Engineering UC San Diego United States

ISBN: (纸本)9781931971164

We explore the potential of making programmability a central feature of the SSD interface. Our prototype system, called Willow, allows programmers to augment and extend the semantics of an SSD with application-specific features without compromising file system protections. The SSD Apps running on Willow give applications low-latency, high-bandwidth access to the SSD's contents while reducing the load that IO processing places on the host processor. The programming model for SSD Apps provides great flexibility, supports the concurrent execution of multiple SSD Apps in Willow, and supports the execution of trusted code in Willow. We demonstrate the effectiveness and flexibility of Willow by implementing six SSD Apps and measuring their performance. We find that defining SSD semantics in software is easy and beneficial, and that Willow makes it feasible for a wide range of IO-intensive applications to benefit from a customized SSD interface. © 2014 by The USENIX Association. All Rights Reserved.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Bridging text spotting and SLAM with junction features

Bridging text spotting and SLAM with junction features

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Hsueh-Cheng Wang C. Finn L. Paull M. Kaess R. Rosenholtz S. Teller J. Leonard Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA USA Electrical Engineering and Computer Sciences UC Berkeley Robotics Institute Carnegie Mellon University Massachusetts Institute of Technology Cambridge MA US

Navigating in a previously unknown environment and recognizing naturally occurring text in a scene are two important autonomous capabilities that are typically treated as distinct. However, these two tasks are potentially complementary, (i) scene and pose priors can benefit text spotting, and (ii) the ability to identify and associate text features can benefit navigation accuracy through loop closures. Previous approaches to autonomous text spotting typically require significant training data and are too slow for real-time implementation. In this work, we propose a novel high-level feature descriptor, the "junction", which is particularly well-suited to text representation and is also fast to compute. We show that we are able to improve SLAM through text spotting on datasets collected with a Google Tango, illustrating how location priors enable improved loop closure with text features.

关键词： Simultaneous localization and mapping Junctions Feature extraction Navigation Image edge detection Real-time systems Text recognition

来源：评论

学校读者我要写书评

暂无评论

The complexity of fairness through equilibrium 14

The complexity of fairness through equilibrium

引用

15th ACM Conference on Economics and Computation, EC 2014

作者： Othman, Abraham Papadimitriou, Christos Rubinstein, Aviad Department of Electrical Engineering and Computer Science UC Berkeley Berkeley CA United States

ISBN: (纸本)9781450325653

Competitive equilibrium with equal incomes (CEEI) is a well-known fair allocation mechanism [Foley67:Resource, Varian74: Equity, Thomson85:Theories];however, for indivisible resources a CEEI may not exist. It was shown in Budish [2011] that in the case of indivisible resources there is always an allocation, called A-CEEI, that is approximately fair, approximately truthful, and approximately efficient, for some favorable approximation parameters. This approximation is used in practice to assign business school students to classes. In this paper we show that finding the A-CEEI allocation guaranteed to exist by Budish's theorem is PPAD-complete. We further show that finding an approximate equilibrium with better approximation guarantees is even harder: NP-complete. © 2014 ACM.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：