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

Sharing Economy in Local Energy Markets

学校读者我要写书评

暂无评论

Journal of Modern Power Systems and Clean Energy 2023年第3期11卷 714-726页

作者： Zhaoyuan Wu Jianxiao Wang Haiwang Zhong Feng Gao Tianjiao Pu Chin-Woo Tan Xiupeng Chen Gengyin Li Huiru Zhao Ming Zhou Qing Xia School of Economics and Management North China Electric Power UniversityBeijing 102206China State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power UniversityBeijing 102206China National Engineering Laboratory for Big Data Analysis and Applications Peking UniversityBeijing 100871China State Key Lab of Power Systems Department of Electrical EngineeringTsinghua UniversityBeijing 100084China Department of Industrial Engineering and Management College of EngineeringPeking UniversityBeijing 100871China China Electric Power Research Institute Beijing 100192China Department of Civil and Environmental Engineering Stanford UniversityPalo AltoCA 94305USA Engineering and Technology Institute Groningen University of Groningen9742 AG Groningenthe Netherlands

With an increase in the electrification of end-use sectors,various resources on the demand side provide great flexibility potential for system operation,which also leads to problems such as the strong randomness of power consumption behavior,the low utilization rate of flexible resources,and difficulties in cost *** the core idea of“access over ownership”,the concept of the sharing economy has gained substantial popularity in the local energy market in recent ***,we provide an overview of the potential market design for the sharing economy in local energy markets(LEMs)and conduct a detailed review of research related to local energy sharing,enabling technologies,and potential *** paper can provide a useful reference and insights for the activation of demand-side flexibility ***,this paper can also provide novel insights into the development and further integration of the sharing economy in LEMs.

关键词： Energy sharing flexibility potential local energy market information and communication technology sharing economy

Differentiable Feature Aggregation Search for Knowledge Distillation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Guan, Yushuo Zhao, Pengyu Wang, Bingxuan Zhang, Yuanxing Yao, Cong Bian, Kaigui Tang, Jian Peking University China Technology Inc National Engineering Laboratory for Big Data Analysis and Applications DiDi AI Labs

Knowledge distillation has become increasingly important in model compression. It boosts the performance of a miniaturized student network with the supervision of the output distribution and feature maps from a sophisticated teacher network. Some recent works introduce multi-teacher distillation to provide more supervision to the student network. However, the effectiveness of multi-teacher distillation methods are accompanied by costly computation resources. To tackle with both the efficiency and the effectiveness of knowledge distillation, we introduce the feature aggregation to imitate the multi-teacher distillation in the single-teacher distillation framework by extracting informative supervision from multiple teacher feature maps. Specifically, we introduce DFA, a two-stage Differentiable Feature Aggregation search method that motivated by DARTS in neural architecture search, to efficiently find the aggregations. In the first stage, DFA formulates the searching problem as a bi-level optimization and leverages a novel bridge loss, which consists of a student-to-teacher path and a teacher-to-student path, to find appropriate feature aggregations. The two paths act as two players against each other, trying to optimize the unified architecture parameters to the opposite directions while guaranteeing both expressivity and learnability of the feature aggregation simultaneously. In the second stage, DFA performs knowledge distillation with the derived feature aggregation. Experimental results show that DFA outperforms existing distillation methods on CIFAR-100 and CINIC-10 datasets under various teacher-student settings, verifying the effectiveness and robustness of the design. Copyright © 2020, The Authors. All rights reserved.

关键词： Distillation

An Experimental Evaluation of Large Scale GBDT Systems

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Fu, Fangcheng Jiang, Jiawei Shao, Yingxia Cui, Bin Peking University Center for Data Science & National Engineering Laboratory for Big Data Analysis and Applications Peking University Beijing University of Posts and Telecommunications Tencent Inc

Gradient boosting decision tree (GBDT) is a widely-used machine learning algorithm in both data analytic competitions and real-world industrial applications. Further, driven by the rapid increase in data volume, efforts have been made to train GBDT in a distributed setting to support large-scale workloads. However, we find it surprising that the existing systems manage the training dataset in different ways, but none of them have studied the impact of data management. To that end, this paper aims to study the pros and cons of different data management methods regarding the performance of distributed GBDT. We first introduce a quadrant categorization of data management policies based on data partitioning and data storage. Then we conduct an in-depth systematic analysis and summarize the advantageous scenarios of the quadrants. Based on the analysis, we further propose a novel distributed GBDT system named Vero, which adopts the unexplored composition of vertical partitioning and row-store and suits for many large-scale cases. To validate our analysis empirically, we implement different quadrants in the same code base and compare them under extensive workloads, and finally compare Vero with other state-of-the-art systems over a wide range of datasets. Our theoretical and experimental results provide a guideline on choosing a proper data management policy for a given workload. Copyright © 2019, The Authors. All rights reserved.

关键词： Decision trees

IoT-U: Cellular internet-of-things networks over unlicensed spectrum

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Hongliang Di, Boya Bian, Kaigui Song, Lingyang National Engineering Laboratory for Big Data Analysis and Applications School of Electronics Engineering and Computer Science Peking University Beijing China

In this paper, we consider an uplink cellular Internet-of-Things (IoT) network, where a cellular user (CU) can serve as the mobile data aggregator for a cluster of IoT devices. To be specific, the IoT devices can either transmit the sensory data to the base station (BS) directly by cellular communications, or first aggregate the data to a CU through Machine-to-Machine (M2M) communications before the CU uploads the aggregated data to the BS. To support massive connections, the IoT devices can leverage the unlicensed spectrum for M2M communications, referred to as IoT Unlicensed (IoT-U). Aiming to maximize the number of scheduled IoT devices and meanwhile associate each IoT devices with the right CU or BS with the minimum transmit power, we first introduce a single-stage formulation that captures these objectives simultaneously. To tackle the NP-hard problem efficiently, we decouple the problem into two subproblems, which are solved by successive linear programming and convex optimization techniques, respectively. Simulation results show that the proposed IoT-U scheme can support more IoT devices than that only using the licensed spectrum. Copyright © 2019, The Authors. All rights reserved.

关键词： Internet of things

MULTI-SCALE CONTEXT-GUIDED LUMBAR SPINE DISEASE IDENTIFICATION WITH COARSE-TO-FINE LOCALIZATION AND CLASSIFICATION

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chen, Zifan Zhao, Jie Yu, Hao Zhang, Yue Zhang, Li Center for Data Science Peking University China National Engineering Laboratory for Big Data Analysis and Applications Peking University China National Biomedical Imaging Center Peking University China

Accurate and efficient lumbar spine disease identification is crucial for clinical diagnosis. However, existing deep learning models with millions of parameters often fail to learn with only hundreds or dozens of medical images. These models also ignore the contextual relationship between adjacent objects, such as between vertebras and intervertebral discs. This work introduces a multi-scale context-guided network with coarse-to-fine localization and classification, named CCFNet, for lumbar spine disease identification. Specifically, in learning, we divide the localization objective into two parallel tasks, coarse and fine, which are more straightforward and effectively reduce the number of parameters and computational cost. The experimental results show that the coarse-to-fine design presents the potential to achieve high performance with fewer parameters and data requirements. Moreover, the multi-scale context-guided module can significantly improve the performance by 6.45% and 5.51% with ResNet18 and ResNet50, respectively. Our code is available at Github. Copyright © 2022, The Authors. All rights reserved.

关键词： Deep learning

Lithium-Ion Battery Storage Dispatch with Embedded Analytical Cycle Aging Mechanism

学校读者我要写书评

暂无评论

Lithium-Ion Battery Storage Dispatch with Embedded Analytica...

International Conference on Power and Energy Technology (ICPET)

作者： Yilin Long Jingsi Huang Jianxiao Wang Department of Industrial Engineering and Management Peking University Beijing China National Engineering Laboratory for Big Data Analysis and Applications Peking University Beijing China

ISBN: (数字)9798350375855

ISBN: (纸本)9798350375862

Battery aging is a major hindrance to the advancement of batteries, particularly in their use for deep peaking and auxiliary services in the electricity market. Although existing literature recognizes battery aging in dispatch scenarios, the analysis of aging mechanisms often depends on statistical methods such as the rainflow algorithm, which may result in empirical formulas that do not fully consider the complex coupling mechanisms involved in battery aging. In this paper, we innovatively propose a lithium-ion battery(LIB) storage dispatch model with embedded cycle aging mechanism: Firstly, the essay delves into three primary side reactions responsible for battery degradation: solid electrolyte interphase (SEI) film formation and thickening, lithium precipitation, and active particle cracking. Following this exploration, this paper delineates the impacts of these three side-reaction rates on the electrochemical model parameters. Thirdly, a pioneering model is introduced, which integrates side-reaction rates and furnishes analytical expressions for the non-uniform distributions of primary and side-reaction rates. In conclusion, the battery aging model was employed in simulations to engage in power market arbitrage, enabling a comprehensive study of the battery’s aging pattern over the course of a year.

关键词： Degradation Lithium-ion batteries Economics Analytical models Solid modeling Precipitation Statistical analysis Aging Solids data models

KVSAgg: Secure Aggregation of Distributed Key-Value Sets 39

学校读者我要写书评

暂无评论

KVSAgg: Secure Aggregation of Distributed Key-Value Sets

39th IEEE International Conference on data engineering, ICDE 2023

作者： Wu, Yuhan Dong, Siyuan Zhou, Yi Zhao, Yikai Fu, Fangcheng Yang, Tong Niu, Chaoyue Wu, Fan Cui, Bin Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai China

ISBN: (纸本)9798350322279

In global data analysis, the central server needs the global statistic of the user data stored in local clients. In such cases, an Honest-but-Curious central server might put user privacy at risk in trying to collect individual statistics of each user. In response, the secure aggregation provides a solution for calculating global statistics without revealing users' privacy data. However, existing secure aggregation protocols only focus on the data in the form of vectors or common sets, which limits their application scope. We formalize a general problem - key-value set secure aggregation - that not only includes secure vector aggregation and private set union but also supports more applications. To address the proposed problem, we devise our solution (called the KVSAgg framework) that promises satisfactory performance in security, efficiency, and accuracy. Our key technique is a homomorphic transform algorithm (called HyperIBLT) that is not only capable of bidirectionally transforming data between key-value sets and vectors, but also able to transform sum operation of sets to addition of vectors. We implement KVSAgg on both CPU and GPU platforms and perform the evaluation on three use cases including federated learning, distributed data counting, and finding global hot items. Compared with our baselines, KVSAgg simultaneously achieves the best security, efficiency higher by orders of magnitude, and zero-error in nearly all cases. All codes are open-source anonymously. © 2023 IEEE.

关键词： Vectors

Lithium-ion Battery Storage Dispatch with Embedded Analytical Cycle Aging Mechanism 6

学校读者我要写书评

暂无评论

Lithium-ion Battery Storage Dispatch with Embedded Analytica...

6th International Conference on Power and Energy Technology, ICPET 2024

作者： Long, Yilin Huang, Jingsi Wang, Jianxiao Department of Industrial Engineering and Management Peking University Beijing China National Engineering Laboratory for Big Data Analysis and Applications Peking University Beijing China

ISBN: (纸本)9798350375855

关键词： Commerce

REncoder: A Space-Time Efficient Range Filter with Local Encoder 39

学校读者我要写书评

暂无评论

REncoder: A Space-Time Efficient Range Filter with Local Enc...

39th IEEE International Conference on data engineering, ICDE 2023

作者： Wang, Ziwei Zhong, Zheng Guo, Jiarui Wu, Yuhan Li, Haoyu Yang, Tong Tu, Yaofeng Zhang, Huanchen Cui, Bin Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China Zte Corporation Beijing China Tsinghua University Beijing China

ISBN: (纸本)9798350322279

A range filter is a data structure to answer range membership queries. Range queries are common in modern applications, and range filters have gained rising attention for improving the performance of range queries by ruling out empty range queries. However, state-of-the-art range filters, such as SuRF and Rosetta, suffer either high false positive rate or low throughput. In this paper, we propose a novel range filter, called REncoder. It organizes all prefixes of keys into a segment tree, and locally encodes the segment tree into a Bloom filter to accelerate queries. REncoder supports diverse workloads by adaptively choosing how many levels of the segment tree to store. We theoretically prove that the error of REncoder is bounded and derive the asymptotic space complexity under the bounded error. We conduct extensive experiments on both synthetic datasets and real datasets. The experimental results show that REncoder outperforms all state-of-the-art range filters. © 2023 IEEE.

关键词： data structures