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

arXiv 2019年

作者： Hu, Zhixiong Xu, Yijun Korkali, Mert Chen, Xiao Mili, Lamine Tong, Charles H. Department of Statistics University of California-Santa Cruz Santa CruzCA95064 United States Department of Electrical and Computer Engineering Virginia Tech Northern Virginia Center Falls ChurchVA22043 United States Computational Engineering Division Lawrence Livermore National Laboratory LivermoreCA94550 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA94550 United States

The increasing penetration of renewable energy resources in power systems, represented as random processes, converts the traditional deterministic economic dispatch problem into a stochastic one. To solve this stochastic economic dispatch, the conventional Monte Carlo method is prohibitively time consuming for medium- and large-scale power systems. To overcome this problem, we propose in this paper a novel Gaussian-process-emulator-based approach to quantify the uncertainty in the stochastic economic dispatch considering wind power penetration. Based on the dimension-reduction results obtained by the Karhunen-Loève expansion, a Gaussian-process emulator is constructed. This surrogate allows us to evaluate the economic dispatch solver at sampled values with a negligible computational cost while maintaining a desirable accuracy. Simulation results conducted on the IEEE 118-bus system reveal that the proposed method has an excellent performance as compared to the traditional Monte Carlo method. Copyright © 2019, The Authors. All rights reserved.

关键词： Electric load dispatching

来源：评论

学校读者我要写书评

暂无评论

Ultra reliable, low latency vehicle-to-infrastructure wireless communications with edge computing

arXiv

引用

arXiv 2018年

作者： Mostofa Kamal Tareq, Md. Semiari, Omid Salehi, Mohsen Amini Saad, Walid Department of Electrical and Computer Engineering Georgia Southern University StatesboroGA United States School of Computing and Informatics University of Louisiana LafayetteLA United States Wireless@VT Bradley Department of Electrical and Computer Engineering Virginia Tech BlacksburgVA United States

Ultra reliable, low latency vehicle-to-infrastructure (V2I) communications is a key requirement for seamless operation of autonomous vehicles (AVs) in future smart cities. To this end, cellular small base stations (SBSs) with edge computing capabilities can reduce the end-to-end (E2E) service delay by processing requested tasks from AVs locally, without forwarding the tasks to a remote cloud server. Nonetheless, due to the limited computational capabilities of the SBSs, coupled with the scarcity of the wireless bandwidth resources, minimizing the E2E latency for AVs and achieving a reliable V2I network is challenging. In this paper, a novel algorithm is proposed to jointly optimize AVs-to-SBSs association and bandwidth allocation to maximize the reliability of the V2I network. By using tools from labor matching markets, the proposed framework can effectively perform distributed association of AVs to SBSs, while accounting for the latency needs of AVs as well as the limited computational and bandwidth resources of SBSs. Moreover, the convergence of the proposed algorithm to a core allocation between AVs and SBSs is proved and its ability to capture interdependent computational and transmission latencies for AVs in a V2I network is characterized. Simulation results show that by optimizing the E2E latency, the proposed algorithm substantially outperforms conventional cell association schemes, in terms of service reliability and latency. Copyright © 2018, The Authors. All rights reserved.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

PORCA: Modeling and planning for autonomous driving among many pedestrians

arXiv

引用

arXiv 2018年

作者： Luo, Yuanfu Cai, Panpan Bera, Aniket Hsu, David Lee, Wee Sun Manocha, Dinesh School of Computing National University of Singapore Department of Computer Science University of North Carolina at Chapel Hill United States Department of Computer Science and Electrical and Computer Engineering University of Maryland College Park United States

This paper presents a planning system for autonomous driving among many pedestrians. A key ingredient of our approach is PORCA, a pedestrian motion prediction model that accounts for both a pedestrian's global navigation intention and local interactions with the vehicle and other pedestrians. Unfortunately, the autonomous vehicle does not know the pedestrians' intentions a priori and requires a planning algorithm that hedges against the uncertainty in pedestrian intentions. Our planning system combines a POMDP algorithm with the pedestrian motion model and runs in real time. Experiments show that it enables a robot scooter to drive safely, efficiently, and smoothly in a crowd with a density of nearly one person per square meter. Copyright © 2018, The Authors. All rights reserved.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Correction to: Services and simulation frameworks for vehicular cloud computing: a contemporary survey

引用

EURASIP Journal on Wireless Communications and Networking 2019年第1期2019卷 1-1页

作者： Ahmed, Bilal Malik, Asad Waqar Hafeez, Taimur Ahmed, Nadeem Department of Computing School of Electrical Engineering and Computer Science (SEECS) National University of Sciences and Technology (NUST) Islamabad Pakistan

Following publication of the original article [1], the authors flagged that this reference is missing from the article:

关键词：

来源：评论

学校读者我要写书评

暂无评论

Statistical descriptors-based automatic fingerprint identification: Machine learning approaches

arXiv

引用

arXiv 2019年

作者： Jan, Hamid Ali, Amjad Mahmood, Shahid Srivastava, Gautam Department of Electrical Engineering Sarhad University of Science & Information Technology Ring Road Peshawar25000 Kpk Pakistan Department of Mechanical Engineering Sarhad University of Science & Information Technology Ring Road Peshawar25000 Kpk Pakistan Department of Mathematics and Computer Science Brandon University 270 18th Street BrandonR7A 6A9 Canada Research Center for Interneural Computing China Medical University Taichung40402 Taiwan

Identification of a person from fingerprints of good quality has been used by commercial applications and law enforcement agencies for many years, however identification of a person from latent fingerprints is very difficult and challenging. A latent fingerprint is a fingerprint left on a surface by deposits of oils and/or perspiration from the finger. It is not usually visible to the naked eye but may be detected with special techniques such as dusting with fine powder and then lifting the pattern of powder with transparent tape. We have evaluated the quality of machine learning techniques that has been implemented in automatic fingerprint identification. In this paper, we use fingerprints of low quality from database DB1 of Fingerprint Verification Competition (FVC 2002) to conduct our experiments. Fingerprints are processed to find its core point using Poincare index and carry out enhancement using Diffusion coherence filter whose performance is known to be good in the high curvature regions of fingerprints. Grey-level Co-Occurrence Matrix (GLCM) based seven statistical descriptors with four different inter pixel distances are then extracted as features and put forward to train and test REPTree, RandomTree, J48, Decision Stump and Random Forest Machine Learning techniques for personal identification. Experiments are conducted on 80 instances and 28 attributes. Our experiments proved that Random Forests and J48 give good results for latent fingerprints as compared to other machine learning techniques and can help improve the identification accuracy. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Greengenes2 unifies microbial data in a single reference tree

引用

Nature biotechnology 2024年第5期42卷 813页

作者： Daniel McDonald Yueyu Jiang Metin Balaban Kalen Cantrell Qiyun Zhu Antonio Gonzalez James T Morton Giorgia Nicolaou Donovan H Parks Søren M Karst Mads Albertsen Philip Hugenholtz Todd DeSantis Se Jin Song Andrew Bartko Aki S Havulinna Pekka Jousilahti Susan Cheng Michael Inouye Teemu Niiranen Mohit Jain Veikko Salomaa Leo Lahti Siavash Mirarab Rob Knight Department of Pediatrics University of California San Diego School of Medicine La Jolla CA USA. Department of Electrical and Computer Engineering University of California San Diego La Jolla CA USA. Bioinformatics and Systems Biology Program University of California San Diego La Jolla CA USA. Department of Computer Science and Engineering University of California San Diego La Jolla CA USA. School of Life Sciences Arizona State University Tempe AZ USA. Biodesign Center for Fundamental and Applied Microbiomics Arizona State University Tempe AZ USA. Biostatistics & Bioinformatics Branch Eunice Kennedy Shriver National Institute of Child Health and Human Development National Institutes of Health Bethesda MD USA. Halicioglu Data Science Institute University of California San Diego La Jolla CA USA. Australian Centre for Ecogenomics School of Chemistry and Molecular Biosciences The University of Queensland St Lucia Queensland Australia. Department of Obstetrics and Gynecology Columbia University New York NY USA. Department of Chemistry and Bioscience Aalborg University Aalborg Denmark. Department of Informatics Second Genome Brisbane CA USA. Center for Microbiome Innovation Jacobs School of Engineering University of California San Diego La Jolla CA USA. Finnish Institute for Health and Welfare Helsinki Finland. Institute for Molecular Medicine Finland FIMM-HiLIFE Helsinki Finland. Division of Cardiology Brigham and Women's Hospital Boston MA USA. Cedars-Sinai Medical Center Los Angeles CA USA. Cambridge Baker Systems Genomics Initiative Baker Heart and Diabetes Institute Melbourne Victoria Australia. Cambridge Baker Systems Genomics Initiative Department of Public Health and Primary Care University of Cambridge Cambridge UK. Division of Medicine Turku University Hospital and University of Turku Turku Finland. Sapient Bioanalytics LLC San Diego CA USA. Department of Computing University of Turku Turku Finland. Department of Pediatrics Uni

来源：评论

学校读者我要写书评

暂无评论

Self-Awareness for Autonomous Systems

引用

PROCEEDINGS OF THE IEEE 2020年第7期108卷 971-975页

作者： Dutt, Nikil Regazzoni, Carlo S. Rinner, Bernhard Yao, Xin Nikil Dutt (Fellow IEEE) received the Ph.D. degree from the University of Illinois at Urbana–Champaign Champaign IL USA in 1989.""He is currently a Distinguished Professor of computer science (CS) cognitive sciences and electrical engineering and computer sciences (EECS) with the University of California at Irvine Irvine CA USA. He is a coauthor of seven books. His research interests include embedded systems electronic design automation (EDA) computer architecture distributed systems healthcare Internet of Things (IoT) and brain-inspired architectures and computing.""Dr. Dutt is a Fellow of ACM. He was a recipient of the IFIP Silver Core Award. He has received numerous best paper awards. He serves as the Steering Committee Chair of the IEEE/ACM Embedded Systems Week (ESWEEK). He is also on the steering organizing and program committees of several premier EDA and embedded system design conferences and workshops. He has served on the Editorial Boards for the IEEE Transactions on Very Large Scale Integration (VLSI) Systems and the ACM Transactions on Embedded Computing Systems and also previously served as the Editor-in-Chief (EiC) for the ACM Transactions on Design Automation of Electronic Systems. He served on the Advisory Boards of the IEEE Embedded Systems Letters the ACM Special Interest Group on Embedded Systems the ACM Special Interest Group on Design Automationt and the ACM Transactions on Embedded Computing Systems. Carlo S. Regazzoni (Senior Member IEEE) received the M.S. and Ph.D. degrees in electronic and telecommunications engineering from the University of Genoa Genoa Italy in 1987 and 1992 respectively.""He is currently a Full Professor of cognitive telecommunications systems with the Department of Electrical Electronics and Telecommunication Engineering and Naval Architecture (DITEN) University of Genoa and a Co-Ordinator of the Joint Doctorate on Interactive and Cognitive Environments (JDICE) international Ph.D. course started initially as EU Erasmus Mundus Project and

Autonomous systems are able to make decisions and potentially take actions without direct human intervention, which requires some knowledge about the system and its environment as well as goal-oriented reasoning. In computer systems, one can derive such behavior from the concept of a rational agent with autonomy (“control over its own actions”), reactivity (“react to events from the environment”), proactivity (“act on its own initiative”), and sociality (“interact with other agents”) as fundamental properties \n[1]\n. Autonomous systems will undoubtedly pervade into our everyday lives, and we will find them in a variety of domains and applications including robotics, transportation, health care, communications, and entertainment to name a few. \nThe articles in this month’s special issue cover concepts and fundamentals, architectures and techniques, and applications and case studies in the exciting area of self-awareness in autonomous systems.

关键词： Special issues and sections Autonomous systems Self-aware Robot sensing systems Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Set stability for switched Boolean networks with open-loop and closed-loop switching signals

引用

中国科学（信息科学） 2018年第9期61卷 226-234页

作者： Xiaohua LI Jianquan LU Jianlong QIU Xiangyong CHEN Xiaodi LI Fuad E.ALSAADI School of Automation and Engineering and Key Laboratory of Complex Systems and Intelligent Computing in Universities of Shandong Linyi University Linyi 276005 China School of Mathematics and Statistics Shandong Normal University Jinan 250014 China School of Mathematics Southeast University Nanjing 210096 China School of Automation and Engineering and Key Laboratory of Complex Systems and Intelligent Computing in Universities of Shandong Linyi University Linyi 276005 China School of Automation and Engineering and Key Laboratory of Complex Systems and Intelligent Computing in Universities of Shandong Linyi University Linyi 276005 China School of Mathematics Southeast University Nanjing 210096 China School of Mathematics and Statistics Shandong Normal University Jinan 250014 China Department of Electrical and Computer Engineering King Abdulaziz University Jeddah 21589 Saudi Arabia

This paper mainly analyzes the set stability of switched Boolean networks (SBNs) by considering two different methods of switching signals in the form of open-loop and closed-loop ***,the definitions of set stability are proposed for SBNs with such switching ***,we propose two different algorithms to find the largest open-loop switching invariant set and largest closed-loop switching invariant ***,the corresponding set stability conditions for SBNs are given in each *** addition,the constructive procedures are presented to design the switching signal sequence to achieve set stability under the two different methods of switching ***,the effectiveness of the proposed algorithms and research results are demonstrated using two numerical examples.

关键词： switched Boolean network set stability semi-tensor product switching signal design

来源：评论

学校读者我要写书评

暂无评论

Understanding co-run performance on CPU-GPU integrated processors： observations, insights, directions

引用

Frontiers of computer Science 2017年第1期11卷 130-146页

作者： Qi ZHU Bo WU Xipeng SHEN Kai SHEN Li SHEN Zhiying WANG National Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 China Department of Computer Science North Carolina State University Raleigh NC 27695 USA Department of Electrical Engineering & Computer Science Colorado School of Mines Golden CO 80401 USA Department of Computer Science University of Rochester Rochester NY 14627 USA

Recent years have witnessed a processor develop- ment trend that integrates central processing unit （CPU） and graphic processing unit （GPU） into a single chip. The inte- gration helps to save some host-device data copying that a discrete GPU usually requires, but also introduces deep re- source sharing and possible interference between CPU and GPU. This work investigates the performance implications of independently co-running CPU and GPU programs on these platforms. First, we perform a comprehensive measurement that covers a wide variety of factors, including processor ar- chitectures, operating systems, benchmarks, timing mecha- nisms, inputs, and power management schemes. These mea- surements reveal a number of surprising observations. We an- alyze these observations and produce a list of novel insights, including the important roles of operating system （OS） con- text switching and power management in determining the program performance, and the subtle effect of CPU-GPU data copying. Finally, we confirm those insights through case studies, and point out some promising directions to mitigate anomalous performance degradation on integrated heteroge- neous processors.

关键词： performance analysis GPGPU co-run degrada-tion fused processor program transformation

来源：评论

学校读者我要写书评

暂无评论

Incremental Task Modification via Corrective Demonstrations

Incremental Task Modification via Corrective Demonstrations

引用

IEEE International Conference on Robotics and Automation

作者： Reymundo A. Gutierrez Vivian Chu Andrea L. Thomaz Scott Niekum Department of Computer Science University of Texas at Austin Austin Texas School of Interactive Computing Georgia Institute of Technology Atlanta Georgia Department of Electrical and Computer Engineering University of Texas at Austin Austin Texas

In realistic environments, fully specifying a task model such that a robot can perform a task in all situations is impractical. In this work, we present Incremental Task Modification via Corrective Demonstrations (ITMCD), a novel algorithm that allows a robot to update a learned model by making use of corrective demonstrations from an end-user in its environment. We propose three different types of model updates that make structural changes to a finite state automaton (FSA) representation of the task by first converting the FSA into a state transition auto-regressive hidden Markov model (STARHMM). The STARHMM's probabilistic properties are then used to perform approximate Bayesian model selection to choose the best model update, if any. We evaluate ITMCD Model Selection in a simulated block sorting domain and the full algorithm on a real-world pouring task. The simulation results show our approach can choose new task models that sufficiently incorporate new demonstrations while remaining as simple as possible. The results from the pouring task show that ITMCD performs well when the modeled segments of the corrective demonstrations closely comply with the original task model.

关键词： Hidden Markov models Task analysis Robots Computational modeling Adaptation models Probabilistic logic Bayes methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：