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

arXiv 2024年

作者： Huang, Po-Han Chen, Shiqian Hartwig, Oliver Marschner, David E. Duesberg, Georg S. Stemme, Göran Li, Jiantong Gylfason, Kristinn B. Niklaus, Frank Division of Micro and Nanosystems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden Division of Electronics and Embedded Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Kista16440 Sweden Institute of Physics EIT 2 Faculty of Electrical Engineering and Information Technology University of the Bundeswehr Munich & SENS Research Center Neubiberg85577 Germany

Hierarchical structures are abundant in nature, such as in the superhydrophobic surfaces of lotus leaves and the structural coloration of butterfly wings. They consist of ordered features across multiple size scales, and their unique properties have attracted enormous interest in wide-ranging fields, including energy storage, nanofluidics, and nanophotonics. Femtosecond lasers, capable of inducing various material modifications, have shown promise for manufacturing tailored hierarchical structures. However, existing methods such as multiphoton lithography and 3D printing using nanoparticle-filled inks typically involve polymers and suffer from high process complexity. Here, we demonstrate 3D printing of hierarchical structures in inorganic silicon-rich glass featuring self-forming nanogratings. This approach takes advantage of our finding that femtosecond laser pulses can induce simultaneous multiphoton crosslinking and self-formation of nanogratings in hydrogen silsesquioxane (HSQ). The 3D printing process combines the 3D patterning capability of multiphoton lithography and the efficient generation of periodic structures by the self-formation of nanogratings. We 3D-printed micro-supercapacitors with large surface areas and a remarkable areal capacitance of 1 mF/cm2 at an ultrahigh scan rate of 50 V/s, thereby demonstrating the utility of our 3D printing approach for device applications in emerging fields such as energy storage. Copyright © 2024, The Authors. All rights reserved.

关键词： 3D printing

来源：评论

学校读者我要写书评

暂无评论

2021 Monthly Rice Production in Chinese Coastal Provinces 3

2021 Monthly Rice Production in Chinese Coastal Provinces

引用

3rd International Conference on Big Data Analytics and Practices, IBDAP 2022

作者： Parmar, Ajeet Munasinghe, Thilanka Tubbs, Heidi Anyamba, Assaf Rensselaer Polytechnic Institute Department of Electrical Computer and Systems Engineering Troy United States Rensselaer Polytechnic Institute Department of Information Technology and Web Science Troy United States Oak Ridge National Laboratory Geospatial Science and Human Security Division Oak Ridge United States

ISBN: (数字)9781665469388

ISBN: (纸本)9781665469388

This paper explores the dynamics of rice production in the Chinese provinces of Liaoning, Jilin, Heilongjiang, Shanghai, Jiangsu, and Zhejiang and seeks to predict monthly rice production in the months of April through October using precipitation and Normalized Difference Vegetation Index as the predictor variables available. We utilize ridge and lasso regression models to predict the rice yield. Results indicate that a lasso regression model with an R2 value of 0.9991501 with an adjusted R2 value of 0.9991502 and a ridge regression model with an R2 value of 0.9865443 with an adjusted R2 value of 0.9870637 are possible. The lasso regression model does not account for all predictor variables while the ridge regression model does. Both models could be expanded upon to include more observations. © 2022 IEEE.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Improved analysis of randomized SVD for top-eigenvector approximation

arXiv

引用

arXiv 2022年

作者： Tzeng, Ruo-Chun Wang, Po-An Adriaens, Florian Gionis, Aristides Lu, Chi-Jen Division of Theoretical Computer Science KTH Royal Institute of Technology Sweden Division of Decision and Control Systems KTH Royal Institute of Technology Sweden Institute of Information Science Academia Sinica Taiwan

Computing the top eigenvectors of a matrix is a problem of fundamental interest to various fields. While the majority of the literature has focused on analyzing the reconstruction error of low-rank matrices associated with the retrieved eigenvectors, in many applications one is interested in finding one vector with high Rayleigh quotient. In this paper we study the problem of approximating the top-eigenvector. Given a symmetric matrix A with largest eigenvalue λ1, our goal is to find a vector û that approximates the leading eigenvector u1 with high accuracy, as measured by the ratio R(û) = λ−11ûTAû/ûTû. We present a novel analysis of the randomized SVD algorithm of Halko et al. (2011b) and derive tight bounds in many cases of interest. Notably, this is the first work that provides non-trivial bounds for approximating the ratio R(û) using randomized SVD with any number of iterations. Our theoretical analysis is complemented with a thorough experimental study that confirms the efficiency and accuracy of the method. © 2022, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Safety Guaranteed Power-Delivered-to-Load Maximization for Magnetic Wireless Power Transfer

Safety Guaranteed Power-Delivered-to-Load Maximization for M...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Wangqiu Zhou Xinyu Wang Hao Zhou Shenyao Jiang Zhi Liu Yusheng Ji LINKE Lab School of Computer Science and Technology University of Science and Technology of China CAS Key Laboratory of Wireless-Optical Communications University of Science and Technology of China Deqing Alpha Innovation Institute Huzhou China Department of Computer and Network Engineering The University of Electro-Communications Tokyo Japan Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Electromagnetic radiation (EMR) safety has always been a critical reason for hindering the development of magneticenabled wireless power transfer technology. People focus on the actual received energy at charging devices while paying attention to their health. Thus, we study this significant problem in this paper, and propose a universal safety guaranteed power-delivered-to-load (PDL) maximization scheme (called SafeGuard). Technically, we first utilize the off-the-shelf electromagnetic simulator to perform the EMR distribution analysis to ensure the universality of the method. Then, we innovatively introduce the concept of multiple importance sampling for achieving efficient EMR safety constraint extraction. Finally, we treat the proposed optimization problem as an optimal boundary point search problem from the perspective of space geometry, and devise a brand-new grid-based multi-constraint parallel processing algorithm to efficiently solve it. We implement a system prototype for SafeGuard, and conduct extensive experiments to evaluate it. The results indicate that our SafeGuard can obviously improve the achieved PDL by up to 1.75× compared with the state-of-the-art baseline while guaranteeing EMR safety. Furthermore, SafeGuard can accelerate the solution process by 29.12× compared with the traditional numerical method to satisfy the fast optimization requirement of wireless charging systems.

关键词： Performance evaluation Monte Carlo methods System performance Inductive charging Prototypes Wireless power transfer Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of Mobile Model for DTN

引用

Chinese Journal of Electronics 2023年第4期18卷 635-638页

作者： Zhiting Lin Yugui Qu Yusheng Ji Baohua Zhao Department of Computer Science University of Science and Technology of China Hefei China Province Key Laboratory of Software in Computing and Communication Hefei China Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

Delay tolerant networks may become unexpectedly partitioned due to node mobility or variation in signal strength. However, most widely used models in some relative works are generally very simplistic. In order to exploit intelligent forwarding algorithms, a novel nodal mobile model of delay tolerant networks is presented to map reality with more accuracy. And several approaches are introduced to analyze the network structure, such as n-cliques, n-clans, degree, closeness and betweenness. Our research results showed that the centralizations became smaller when the wireless connections were concerned. It meant that quite a number of nodes became potential relays because of the new structure of networks.

关键词： Wireless communication Analytical models Wireless sensor networks Protocols Social networking (online) Sensitivity analysis Social network theory

来源：评论

学校读者我要写书评

暂无评论

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

引用

IFAC-PapersOnLine 2023年第2期56卷 270-275页

作者： Zishuo Li Muhammad Umar B. Niazi Changxin Liu Yilin Mo Karl H. Johansson Department of Automation Tsinghua University Beijing 100084 China Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm SE-100 44 Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts Avenue Cambridge MA 02139 USA

This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. At each time, the attacker has the freedom to choose an arbitrary set of no more than p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error irrespective of the attack signals subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observers for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. We show that our proposed scheme can effectively tolerate sparse attacks on an unknown set of sensors, ensuring a bounded estimation error and effectively detecting and resetting the attacked sensors.

关键词： Estimation and filtering Design of fault tolerant/reliable systems Estimation and fault detection

来源：评论

学校读者我要写书评

暂无评论

Eco-driving Incentive Mechanisms for Mitigating Emissions in Urban Transportation

arXiv

引用

arXiv 2024年

作者： Umar Niazi, M.B. Cho, Jung-Hoon Dahleh, Munther A. Dong, Roy Wu, Cathy Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Department of Civil and Environmental Engineering Massachusetts Institute of Technology CambridgeMA02139 United States Department of Industrial and Enterprise Systems Engineering University of Illinois at Urbana-Champaign UrbanaIL61801 United States

This paper proposes incentive mechanisms that promote eco-driving in transportation networks with the overarching objective of minimizing emissions. The transportation system operator provides the drivers with energy-efficient driving guidance throughout their trips, and their eco-driving levels are measured by how closely they follow this guidance via vehicle telematics. Drivers choose their eco-driving levels to optimize a combination of their travel times and their emissions. To obtain optimal budget allocation and recommendations for the incentive mechanism, the system operator gathers drivers’ preferences, or types, to assess each driver’s trip urgency and natural willingness to eco-drive. In a setting where drivers truthfully report their types, we introduce the first-best incentive mechanism and show that the obedience condition holds (i.e., drivers find it optimal to comply with the system operator’s recommendations) when the recommended eco-driving profile constitutes a Nash equilibrium. Moreover, in a setting where drivers can strategically report their types, we introduce the second-best incentive mechanism and show that the proposed mechanism is incentive-compatible (i.e., drivers find it optimal to be truthful). Under this mechanism, we also show that all equilibrium outcomes are at least as good as the recommended eco-driving profile in terms of the system operator’s objective. Overall, this work offers a framework for designing eco-driving incentive mechanisms while considering both the strategic behavior of individual drivers and the network effects of collective decision-making. © 2024, CC BY.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Holding Strategy Using Torso to Enable Humanoid Robots to Carry Heavier Objects

Holding Strategy Using Torso to Enable Humanoid Robots to Ca...

引用

2024 IEEE/SICE International Symposium on System Integration, SII 2024

作者： Tsuichihara, Satoki Yamada, Masayuki Hara, Kaito Garcia Ricardez, Gustavo A. Yuguchi, Akishige Takamatsu, Jun Wada, Takahiro Takahashi, Yasutake Ogasawara, Tsukasa University of Fukui Faculty of Engineering Department of Human and Artificial Intelligent Systems 3-9-1 Bunkyo Fukui Fukui910-8507 Japan Nara Institute of Science and Technology Division of Information Science 8916-5 Takayama Nara Ikoma630-0192 Japan College of Information Science and Engineering Ritsumeikan University 1-1-1 Noji Higashi Shiga Kusatsu525-8577 Japan Tokyo University of Science Faculty of Advanced Engineering Department of Medical and Robotic Engineering Design 6-3-1 Niijuku Katsushika-ku Tokyo125-8585 Japan

ISBN: (纸本)9798350312072

To alleviate the lack of workforce endemic in contemporary societies, inventory management can be delegated to robots. However, current robotic solutions cannot operate effectively in narrow spaces that have limited unoccupied pathways, such as storage rooms. Humanoid robots can work in facilities designed for humans, including narrow spaces with partially obstructed pathways, as they can overcome small obstacles on the floor by stepping over them. However, their limited torque makes it difficult for the robots to carry many of the objects typically found in storage rooms such as boxes. On the other hand, when holding an object, using multiple body parts can help to distribute the object's load. In this research, we propose a holding strategy for humanoid robots using both arms in conjunction with the torso to prevent exceeding the joint torque limit. We formulate the hands' force and the coordinates of the robot's center of gravity when holding an object with and without using the torso. Using the humanoid robot HRP-4, we compare the torque on the robot's joints when holding an object with two and three contact points. The results show that the three-point holding reduces the torque load on the shoulder and the chest joints. Moreover, we measure the torque of all joints in various torso-bending/leaning and arm-up/down postures while holding a 2-kg object using both arms and the torso. The results show that the leaning torso posture using the chest joint reduces the torque load on the shoulder and chest joints. © 2024 IEEE.

关键词： Anthropomorphic robots

来源：评论

学校读者我要写书评

暂无评论

Non-Orthogonal Multiple Access Based Multi-Objective Optimization in Emergency Task Offloading

Non-Orthogonal Multiple Access Based Multi-Objective Optimiz...

引用

IEEE Conference on Wireless Communications and Networking

作者： Caijuan Chen Chaofeng Zhang Gaolei Li Yuchen Liu The Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan Advanced Institute of Industrial Technology Tokyo Japan School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Department of Computer Science NC State University North Carolina US

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

The escalating frequency of geological disasters, local conflicts, and public health crises necessitates robust emergency communication systems within Internet of Things (IoT) frameworks to ensure public safety. Employing Power-Domain NOMA (PD-NOMA) and Successive Interference Cancellation (SIC) enables effective multi-device communication that is crucial for emergency responses. However, the practical implementation of NOMA technologies in emergency scenarios is hindered by existing resource constraints and the requirement of prioritizing critical emergency information. To address these limitations, we propose a multi-objective optimization-based NOMA framework to maximize network throughput while ensuring quality of service (QoS) and energy efficiency. This framework incorporates a novel communication grouping algorithm based on queue penalty optimization and an Actor-Critic-based dynamic updating algorithm for multiple resource allocation. Our study proposes a practical approach to enhance emergency communication in disaster areas, ensuring efficient and reliable network performance under various constraints.

关键词： NOMA Interference cancellation Heuristic algorithms Disasters Quality of service Throughput Dynamic scheduling Internet of Things Resource management Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：