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

第三十八届中国控制会议

作者： Jun Hu Guo-Ping Liu Zidong Wang Hongxu Zhang School of Engineering University of South Wales Heilongjiang Provincial Key Laboratory of Optimization Control and Intelligent Analysis for Complex Systems Harbin University of Science and Technology CTGT center Harbin Institute of Technology Department of Computer Science Brunel University London School of Measurement and Communication Harbin University of Science and Technology

In this paper, the prediction-based distributed filtering problem is discussed for a class of time-varying stochastic systems with communication delay and different types of noises over sensor networks. The communication delay is characterized when the state estimations are transmitted between adjacent sensor nodes. In order to compensate the effects induced by the communication delay, the prediction-based idea is employed and then the active compensation estimation is provided when designing the time-varying distributed filter. In particular, both the prediction-based state estimation and its own innovation measurements are utilized in terms of the concerned sensor networks under given topological structure. Subsequently, a locally minimum upper bound of the filtering error covariance is given by determining the filter gain at each time step. Finally, the validity and advantages of the presented prediction-based distributed filtering method are illustrated by some simulations.

关键词： Time-varying stochastic systems Sensor networks Optimal distributed filtering Communication delay Prediction compensation

来源：评论

学校读者我要写书评

暂无评论

Why botnets work: distributed brute-force attacks need no synchronization

Why botnets work: Distributed brute-force attacks need no sy...

引用

作者： Salamatian, Salman Huleihel, Wasim Beirami, Ahmad Cohen, Asaf Medard, Muriel Department of Electrical Engineering and Computer Science MIT CambridgeMA02139 United States Research Laboratory of Electronics Massachusetts Institute of Technology CambridgeMA02139 United States Department of Electrical Engineering-Systems Tel-Aviv University Tel-Aviv6997801 Israel EA Digital Platform-Data and AI Electronic Arts Redwood CityCA94065 United States Department of Electrical Engineering Ben-Gurion University of the Negev Beersheba8410501 Israel

In September 2017, the McAfee Labs quarterly report estimated that brute-force attacks represent 20% of total network attacks, making them the most prevalent type of attack ex-aequo with browser-based vulnerabilities. These attacks have sometimes catastrophic consequences, and understanding their fundamental limits may play an important role in the risk assessment of password-secured systems and in the design of better security protocols. While some solutions exist to prevent online brute-force attacks that arise from one single IP address, attacks performed by botnets are more challenging. In this paper, we analyze these distributed attacks by using a simplified model. Our aim is to understand the impact of distribution and asynchronization on the overall computational effort necessary to breach a system. Our result is based on guesswork, a measure of the number of queries (guesses) before a correct sequence, such as a password, is found in an optimal attack. Guesswork is a direct surrogate for time and computational effort of guessing a sequence from a set of sequences with the associated likelihoods. We model the lack of synchronization by a worst-case optimization in which the queries made by multiple adversarial agents are received in the worst possible order for the adversary, resulting in a min-max formulation. We show that, even without synchronization, and for sequences of growing length, the asymptotic optimal performance is achievable by using randomized guesses drawn from an appropriate distribution. Therefore, randomization is key for the distributed asynchronous attacks. In other words, asynchronous guessers can asymptotically perform brute-force attacks as efficiently as synchronized guessers. © 2019 IEEE.

关键词： Botnet

来源：评论

学校读者我要写书评

暂无评论

Correction to: Type 2 Diabetes with Artificial Intelligence Machine Learning: Methods and Evaluation

引用

Archives of Computational Methods in Engineering 2021年第7期28卷 5039-5039页

作者： Ismail, Leila Materwala, Huned Tayefi, Maryam Ngo, Phuong Karduck, Achim P. Intelligent Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al Ain Abu Dhabi United Arab Emirates National Water and Energy Center United Arab Emirates University Al Ain Abu Dhabi United Arab Emirates Norwegian Centre for E-Health Research Tromsø Norway Faculty of Informatics Furtwangen University Furtwangen Germany

来源：评论

学校读者我要写书评

暂无评论

The Future of Cloud Computing: Opportunities, Challenges and Research Trends

The Future of Cloud Computing: Opportunities, Challenges and...

引用

International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)

作者： Amanpreet Kaur V.P. Singh Sukhpal Singh Gill Computer Science and Engineering Department Thapar Institute of Engineering and Technology Patiala Punjab India Cloud Computing and Distributed Systems (CLOUDS) Laboratory School of Computing and Information Systems The University of Melbourne Australia

ISBN: (纸本)9781538614433;9781538614426

In a cloud computing environment, datacenter consists of number of servers, cooling and power delivery equipment's that require enormous measure of computational energy to drive complex frameworks. Due to the rising demand of the computation power, datacenter has become the hub for significant increase in the power consumption, heat dissipation and rise in temperature of the servers. Cloud datacenter's energy consumption has increased tremendously due to increase in the computation requirements of the user workload. Thus, saving energy has become an important concern to address. Researchers proposed different techniques to optimize the energy consumption. In this paper, we focus on different aspects of cloud computing for holistic management of cloud resources in an energy-efficient, reliable and sustainable manner. We recognized different opportunities, identified research challenges and propose possible future research directions for cloud computing.

关键词： Servers Cloud computing Energy efficiency Energy consumption Data centers Processor scheduling Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Blockchain technology Based Decentralized Energy Trading for Multiple-Microgrid systems

Blockchain Technology Based Decentralized Energy Trading for...

引用

IEEE Conference on Energy Internet and Energy System Integration (EI2)

作者： Ting Li Wei Zhang Ning Chen Minhui Qian Ying Xu School of Electrical Engineering and Automation Harbin Institute of Technology Harbin China State Key Laboratory of Operation and Control of Renewable Energy & Storage Systems China EPRI Nanjing China Department of Electrical Engineering & Computer Science University of Central Florida Orlando USA

ISBN: (数字)9781728131375

ISBN: (纸本)9781728131382

With the emerging technology for distributed generation and urge of improving quality of service of power supply for energy users, more and more Microgrids (MGs) are integrated into the distributed networks to serve the energy users. These Microgrids are gradually formulating a Multi-Microgrid System (MMGS, Multi-Microgrid System), which will play an important role for the future energy supply. Building a centralized control center not only increases the expense of investment, but also brings the issues of maintaining fairness among energy users. To address these problems, this paper proposes a peer-to-peer method for energy trading of MMGS, based on the idea of decentralized trading. An auction-based trading mechanism suitable for peer-to-peer energy trading is proposed first. For this mechanism, the MGs firstly declare their energy buying bids or selling quotations. Then, the market-clearing price is determined by using a unified weight clearing algorithm in a decentralized manner. By applying the edge technology of Blockchain, the implementation of the proposed peer-to-peer energy trading method, including the architecture, procedures, security check, etc., is also discussed. The proposed Blockchain-based energy trading platform can realize the decentralized and autonomous energy trading of MGs within an MMGS. A case study with an MMGS with 10 MG units is provided to demonstrate the effectiveness of the proposed approach.

关键词： Peer-to-peer computing Microgrids Blockchain distributed power generation Electronic commerce Power distribution economics Pricing

来源：评论

学校读者我要写书评

暂无评论

Energetic electron precipitation driven by electromagnetic ion cyclotron waves from ELFIN’s low altitude perspective

arXiv

引用

arXiv 2022年

作者： Angelopoulos, V. Zhang, X.-J. Artemyev, A.V. Mourenas, D. Tsai, E. Wilkins, C. Runov, A. Liu, J. Turner, D.L. Li, W. Khurana, K. Wirz, R.E. Sergeev, V.A. Meng, X. Wu, J. Hartinger, M.D. Raita, T. Shen, Y. An, X. Shi, X. Bashir, M.F. Shen, X. Gan, L. Qin, M. Capannolo, L. Ma, Q. Russell, C.L. Masongsong, E.V. Caron, R. He, I. Iglesias, L. Jha, S. King, J. Kumar, S. Le, K. Mao, J. McDermott, A. Nguyen, K. Norris, A. Palla, A. Roosnovo Tam, J. Xie, E. Yap, R.C. Ye, S. Young, C. Adair, L.A. Shaffer, C. Chung, M. Cruce, P. Lawson, M. Leneman, D. Allen, M. Anderson, M. Arreola-Zamora, M. Artinger, J. Asher, J. Branchevsky, D. Cliffe, M. Colton, K. Costello, C. Depe, D. Domae, B.W. Eldin, S. Fitzgibbon, L. Flemming, A. Frederick, D.M. Gilbert, A. Hesford, B. Krieger, R. Lian, K. McKinney, E. Miller, J.P. Pedersen, C. Qu, Z. Rozario, R. Rubly, M. Seaton, R. Subramanian, A. Sundin, S.R. Tan, A. Thomlinson, D. Turner, W. Wing, G. Wong, C. Zarifian, A. Earth Planetary and Space Sciences Department Institute of Geophysics and Planetary Physics University of California Los Angeles Los AngelesCA90095 United States University of Texas at Dallas RichardsonTX75080 United States CEA DAM DIF Arpajon France Atmospheric and Oceanic Sciences Departments University of California Los AngelesCA United States Johns Hopkins University Applied Physics Laboratory LaurelMD United States Department of Astronomy Center for Space Physics Boston University BostonMA United States Mechanical and Aerospace Engineering Department Henry Samueli School of Engineering University of California Los AngelesCA90095 United States School of Mechanical Industrial Manufacturing Engineering Oregon State University CorvallisOR97331 United States University of St. Petersburg St. Petersburg Russia Jet Propulsion Laboratory California Institute of Technology PasadenaCA91109 United States Space Science Institute BoulderCO80301 United States Sodankylä Geophysical Observatory University of Oulu Sodankylä Finland Materials Science and Engineering Department Henry Samueli School of Engineering University of California Los AngelesCA90095 United States Deloitte Consulting New YorkNY10112 United States Computer Science Department Henry Samueli School of Engineering University of California Los AngelesCA90095 United States Microsoft RedmondWA98052 United States Physics and Astronomy Department University of California Los AngelesCA90095 United States Department of Astronomy and Astrophysics The University of Chicago ChicagoIL60637 United States Raybeam Inc. Mountain ViewCA94041 United States SpaceX HawthorneCA90250 United States Reliable Robotics Corporation Mountain ViewCA94043 United States Los Alamos National Laboratory Los AlamosNM87545 United States Mathematics Department University of California Los AngelesCA90095 United States Planet Labs PBC San FranciscoCA94107 United States KSAT Inc. De

We review comprehensive observations of electromagnetic ion cyclotron (EMIC) wave-driven energetic electron precipitation using data from the energetic electron detector on the Electron Losses and Fields InvestigatioN (ELFIN) mission, two polar-orbiting low-altitude spinning CubeSats, measuring 50-5000 keV electrons with good pitch-angle and energy resolution. EMIC wave-driven precipitation exhibits a distinct signature in energy-spectrograms of the precipitating-to-trapped flux ratio: peaks at >0.5 MeV which are abrupt (bursty) (lasting ∼17s, or ∆L ∼ 0.56) with significant substructure (occasionally down to sub-second timescale). We attribute the bursty nature of the precipitation to the spatial extent and structuredness of the wave field at the equator. Multiple ELFIN passes over the same MLT sector allow us to study the spatial and temporal evolution of the EMIC wave - electron interaction region. Case studies employing conjugate ground-based or equatorial observations of the EMIC waves reveal that the energy of moderate and strong precipitation at ELFIN approximately agrees with theoretical expectations for cyclotron resonant interactions in a cold plasma. Using 2 years of ELFIN data uniformly distributed in local time, we assemble a statistical database of ∼50 events of strong EMIC wave-driven precipitation. Most reside at L ∼ 5 − 7 at dusk, while a smaller subset exists at L ∼ 8 − 12 at post-midnight. The energies of the peak-precipitation ratio and of the half-peak precipitation ratio (our proxy for the minimum resonance energy) exhibit an L-shell dependence in good agreement with theoretical estimates based on prior statistical observations of EMIC wave power spectra. The precipitation ratio’s spectral shape for the most intense events has an exponential falloff away from the peak (i.e., on either side of ∼ 1.45 MeV). It too agrees well with quasi-linear diffusion theory based on prior statistics of wave spectra. It should be noted though that this diffusive

关键词： Radiation belts

来源：评论

学校读者我要写书评

暂无评论

Quantized frank-wolfe: Faster optimization, lower communication, and projection free

arXiv

引用

arXiv 2019年

作者： Zhang, Mingrui Chen, Lin Mokhtari, Aryan Hassani, Hamed Karbasi, Amin Department of Statistics and Data Science Yale University New HavenCT06511 United States Yale Institute for Network Science Department of Electrical Engineering Yale University New HavenCT06511 United States Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Electrical and Systems Engineering University of Pennsylvania PhiladelphiaPA19104 United States Department of Electrical Engineering and Computer Science Yale University New HavenCT06511 United States

How can we efficiently mitigate the overhead of gradient communications in distributed optimization? This problem is at the heart of training scalable machine learning models and has been mainly studied in the unconstrained setting. In this paper, we propose Quantized Frank-Wolfe (QFW), the first projection-free and communication-efficient algorithm for solving constrained optimization problems at scale. We consider both convex and non-convex objective functions, expressed as a finite-sum or more generally a stochastic optimization problem, and provide strong theoretical guarantees on the convergence rate of QFW. This is accomplished by proposing novel quantization schemes that efficiently compress gradients while controlling the noise variance introduced during this process. Finally, we empirically validate the efficiency of QFW in terms of communication and the quality of returned solution against natural baselines. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Personalized gesture interactions for cyber-physical smart-home environments

引用

science China(Information sciences) 2017年第7期60卷 144-158页

作者： Yihua LOU Wenjun WU Radu-Daniel VATAVU Wei-Tek TSAI State Key Laboratory of Software Development Environment Beihang University Mint Viz Research Lab Integrated Center for Research Developmentand Innovation in Advanced MaterialsNanotechnologies and Distributed Systems for Fabrication and Control (MANSiD) & Department of Computer Science University Stefan cel Mare of Suceava

A gesture-based interaction system for smart homes is a part of a complex cyber-physical environment, for which researchers and developers need to address major challenges in providing personalized gesture interactions. However, current research efforts have not tackled the problem of personalized gesture recognition that often involves user identification. To address this problem, we propose in this work a new event-driven service-oriented framework called gesture services for cyber-physical environments(GS-CPE) that extends the architecture of our previous work gesture profile for web services(GPWS). To provide user identification functionality, GS-CPE introduces a two-phase cascading gesture password recognition algorithm for gesture-based user identification using a two-phase cascading classifier with the hidden Markov model and the Golden Section Search, which achieves an accuracy rate of 96.2% with a small training dataset. To support personalized gesture interaction, an enhanced version of the Dynamic Time Warping algorithm with multiple gestural input sources and dynamic template adaptation support is implemented. Our experimental results demonstrate the performance of the algorithm can achieve an average accuracy rate of 98.5% in practical scenarios. Comparison results reveal that GS-CPE has faster response time and higher accuracy rate than other gesture interaction systems designed for smart-home environments.

关键词： gesture interaction personalization gesture recognition user identification event-driven architec ture

来源：评论

学校读者我要写书评

暂无评论

Exponential convergence for distributed smooth optimization under the restricted secant inequality condition

arXiv

引用

arXiv 2019年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Johansson, Karl H. Chai, Tianyou Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers the distributed smooth optimization problem in which the objective is to minimize a global cost function formed by a sum of local smooth cost functions, by using local information exchange. The standard assumption for proving exponential/linear convergence of first-order methods is the strong convexity of the cost functions, which does not hold for many practical applications. In this paper, we first show that the continuous-time distributed primal-dual gradient algorithm converges to one global minimizer exponentially under the assumption that the global cost function satisfies the restricted secant inequality condition. This condition is weaker than the strong convexity condition since it does not require convexity and the global minimizers are not necessary to be unique. We then show that the discrete-time distributed primal-dual algorithm constructed by using the Euler's approximation method converges to one global minimizer linearly under the same condition. The theoretical results are illustrated by numerical simulations. Copyright © 2019, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Incentive Announcement System for Internet of Vehicles

Blockchain-Based Incentive Announcement System for Internet ...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yang Yang Jialiang Chen Xianghan Zheng Ximeng Liu Wenzhong Guo Hairong Lv College of Mathematics and Computer Science Fuzhou University Fuzhou China Guangxi Key Laboratory of Cryptography and Information Security Guangnxi China Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Guangzhou China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control (Minjiang University) Fuzhou China Ministry of Education Key Laboratory of Bioinformatics Bioinformatics Division and Center for Synthetic and Systems Biology Beijing National Research Center for Information Science and TechnologyDepartment of Automation Tsinghua University Beijing China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

With the rapid development of computation and communication technologies, the traditional vehicle ad hoc networks (VANETs) are changing to Internet of vehicle (IoV). Vehicular announcement networks in IoV have been widely used in the communication of vehicles. Generally, we need to solve two problems while establishing a vehicular announcement system. First, we need to protect user's privacy when broadcasting the message. Second, participants usually lack the enthusiasm to reply to the announcement. To solve these two problems, we propose a novel blockchain-based incentive announcement system that not only allows participants to anonymously announce their message on the blockchain in a non-trusted environment, but also motivates witnesses to respond to the request of the traffic information with incentive mechanism. Meanwhile, traffic messages and signatures in our system are tamper-resistant, which are recorded on the blockchain. According to the security and performance analysis, it shows that our system is privacy-preserving and efficient in computation cost.

关键词： Blockchain Privacy Smart contracts Authentication Internet Remuneration Hash functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：