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

16th IEEE PES Asia-Pacific Power and Energy Engineering Conference, APPEEC 2024

作者： Wang, Yingxiao Ou, Pengfei Wu, Jianghua Shenzhen Research Institute of Big Data The Chinese University of Hong Kong-Shenzhen Shenzhen China School of Mathematics Nanjing University Nanjing China School of Engineering The Hong Kong University of Science and Technology Hong Kong

ISBN: (纸本)9798350386127

Virtual Power Plants (VPPs) provide a promising direction for managing the complexities and uncertainties in operating Distributed Energy Resources (DERs). However, existing approaches rely on a 'source-following-load' static strategy, falling short in dynamically leveraging market opportunities and transferable demands. To pursue optimal economic performance, this paper introduces a novel price-oriented supply-demand interaction scheduling (SDIS) model for VPP operation. SDIS integrates transferable demands and price signals from the market, renewable generators, and storage systems, enabling VPPs to dynamically balance supply and demand while optimizing both operational efficiency and economic returns. Case studies sampled from the Shanghai energy market with uncertain climatic conditions demonstrate that our model improves the operational efficiency of VPP, reduces economic costs, and enhances the grid stability. Our model paves a way to deal with the complex VPP operation, e.g. grid scenarios involving solar generators, urban metro systems, and central air conditioning clusters. © 2024 IEEE.

关键词： Virtual Power Plants

来源：评论

学校读者我要写书评

暂无评论

Anomaly Correction of Business Processes Using Transformer Autoencoder

SSRN

引用

SSRN 2024年

作者： Gong, Ziyou Fang, Xianwen Wu, Ping School of Mathematics and Big Data Anhui University of Science and Technology Huainan China Anhui Province Engineering Laboratory for Big Data Analysis and Early Warning Technology of Coal Mine Safety Huainan China

Event log records all events that occur during the execution of business processes, so detecting and correcting anomalies in event log can provide reliable guarantee for subsequent process analysis. The previous works mainly include next event prediction based methods and autoencoder-based methods. These methods cannot accurately and efficiently detect anomalies and correct anomalies at the same time, and they all rely on the set threshold to detect anomalies. To solve these problems, we propose a business process anomaly correction method based on Transformer autoencoder. By using self-attention mechanism and autoencoder structure, it can efficiently process event sequences of arbitrary length, and can directly output corrected business process instances, so that it can adapt to various scenarios. At the same time, the anomaly detection is transformed into a classification problem by means of self-supervised learning, so that there is no need to set a specific threshold in anomaly detection. The experimental results on several real-life event logs show that the proposed method is superior to the previous methods in terms of anomaly detection accuracy and anomaly correction results while ensuring high running efficiency © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

A Novel Multi-Edge Cooperative Offloading Genetic Algorithm towards Environmental Monitoring System 5

A Novel Multi-Edge Cooperative Offloading Genetic Algorithm ...

引用

5th International Conference on Telecommunications and Communication Engineering, ICTCE 2022

作者： Fang, Jie Li, Wenzao Wang, Yue Sun, Xiulan College of Communication Engineering Chengdu University of Information Technology China Network and Data Security Key Lab of Sichuan Pro. University of Electronic Science and Technology of China China Institute of Data Application Research Educational Informalization and Big Data Center China

ISBN: (纸本)9781450397797

In environmental monitor architecture, the usual way of processing data is centralized. On the one hand, this leads to a long time of data processing, and with the increasing number of monitoring sensors, the pressure of data processing in data centers increases sharply. The edge computing provides a feasible solution to relieve the processing pressure and decrease the delay of data processing in data center. However, in the environmental monitor system, the edge servers are often load unbalance because of the nonuniform distribution of sensors. While, it is usually ignored in recently researches. In this paper, we proposed a cooperative offloading strategy (MECOGA) based on genetic algorithm (GA). It aims to ease the data processing pressure and reduce the data processing time in the data center. In addition, the load balance of edge servers is also one of our optimization goals. In this paper, we aim at decreasing task processing delay and improving the system load balancing. Contrast to other algorithms, our MECOGA decreases the delay near 20% before collaborative loading. And the balance variance is 15% smaller than the Balance strategy. © 2022 Association for Computing Machinery.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

THE BLESSING OF RANDOMNESS: SDE BEATS ODE IN GENERAL DIFFUSION-BASED IMAGE EDITING 12

THE BLESSING OF RANDOMNESS: SDE BEATS ODE IN GENERAL DIFFUSI...

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Nie, Shen Guo, Hanzhong Allan Lu, Cheng Zhou, Yuhao Zheng, Chenyu Li, Chongxuan Gaoling School of Artificial Intelligence Renmin University of China Beijing China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Department of Computer Science and Technology Tsinghua University Beijing China

We present a unified probabilistic formulation for diffusion-based image editing, where a latent variable is edited in a task-specific manner and generally deviates from the corresponding marginal distribution induced by the original stochastic or ordinary differential equation (SDE or ODE). Instead, it defines a corresponding SDE or ODE for editing. In the formulation, we prove that the Kullback-Leibler divergence between the marginal distributions of the two SDEs gradually decreases while that for the ODEs remains as the time approaches zero, which shows the promise of SDE in image editing. Inspired by it, we provide the SDE counterparts for widely used ODE baselines in various tasks including inpainting and image-to-image translation, where SDE shows a consistent and substantial improvement. Moreover, we propose SDE-Drag - a simple yet effective method built upon the SDE formulation for point-based content dragging. We build a challenging benchmark (termed DragBench) with open-set natural, art, and AI-generated images for evaluation. A user study on DragBench indicates that SDE-Drag significantly outperforms our ODE baseline, existing diffusion-based methods, and the renowned DragGAN. Our results demonstrate the superiority and versatility of SDE in image editing and push the boundary of diffusion-based editing methods. See the project page https://***/SDE-Drag-demo/for the code and DragBench dataset. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

Collusion Resistant Identity-based Proxy Re-encryption Scheme on Lattice 6

Collusion Resistant Identity-based Proxy Re-encryption Schem...

引用

6th International Conference on Computer Information science and Application technology, CISAT 2023

作者： Deng, Xiaohong Xie, Hua Xiong, Weizhi School of Electronics and Information Engineering Gannan University of Science and Technology Ganzhou341000 China College of Information Science Jiangxi University of Science and Technology Ganzhou341000 China Key Laboratory of Cloud Computing and Big Data Ganzhou341000 China

ISBN: (纸本)9781510668546

Proxy re-encryption plays an important role for data security in cloud computing and big data, but the traditional reencryption scheme based on the classical number theory problem cannot resist quantum attack, and the lattice based cryptosystem has been proved to have the ability to resist quantum attack, so the lattice based re-encryption scheme has always been a research hotspot. In view of the problem that collusion-resistance and multi-hop can not be satisfied at the same time in existing schemes, this paper proposes a new identity-based proxy re-encryption scheme on lattice. Firstly, the scheme uses trapdoors as private keys to achieve one-way anti-collusion. In addition, we constructs a variant of learning with errors (LWE), which uses a convert algorithm to transform the user matrix and replace the vector with a uniform matrix, so that the scheme can meet the requirements of multi-hop and encrypt multiple bits of messages at one time. Theoretical analysis and experimental simulation prove that the security of the new scheme can be reduced to a decision LWE problem, which can reach the IND-sID-CPA security in the standard model, and can improve the encryption efficiency while ensuring the security. © 2023 SPIE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

A Trajectory Tracking System for Zebrafish Based on Embedded Edge Artificial Intelligence 29

A Trajectory Tracking System for Zebrafish Based on Embedded...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Zang, Chuanhao Dong, Anming Yu, Jiguo School of Computer Science and Technology Jinan China Big Data Institute Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

Trajectory tracking of zebrafish is an important requirement in studying neurological disorders and developing new psychoactive drug. However, many challenges emerge for stable tracking, since zebrafish are similar in appearance, occlusion, agile, non-linear in moving and easy to swarm, all of which will lead to mistrack for multiple fish. And there is no precedent for tracking zebrafish through embedded edge artificial intelligence device. To overcome these difficulties, we present a tracking system for zebrafish based on RK3588-S. First, We construct an embedded edge AI hardware system consisting of two cameras driven by the RK3588-S, one for the front view and the other for top view of the fish. Then, we develop a 2D tracking algorithm based on YOLOv5 and the Observation-Centric Simple online and real-time tracking (OC-SORT) algorithm, which are transplanted to the RK3588-S for tracking the top and front views of the fish at the edge device. Compared with the previous methods, our method has fewer ID exchanges and highly real-time. Moreover, we apply the MQTT mechanism to establish communication links between the edge and the cloud to reliably transmit data to the cloud. The correspondence between cloud server and embedded AI is 1: N. Finally, we design a multi-view data fusion association algorithm to fuse the data of the two views in the cloud, which are further utilized to build the 3D tracklets of the zebrafish. © 2023 IEEE.

关键词： A Tracking System for Zebrafish Embedded edge artificial intelligence RK3588-S Zebrafish

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of Computer science & technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

Interference Characterization and Mitigation for Multi-Beam ISAC Systems in Vehicular Networks

引用

IEEE Transactions on Wireless Communications 2024年第10期23卷 14729-14742页

作者： Wang, Yi Zhang, Qixun Zhang, J. Andrew Wei, Zhiqing Feng, Zhiyong Peng, Jinlin The School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu611731 China University of Electronic Science and Technology of China Quzhou324003 China The Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing100876 China The Global Big Data Technologies Centre University of Technology Sydney SydneyNSW2007 Australia The Artificial Intelligence Research Center National Innovation Institute of Defense Technology Beijing100071 China

— Millimeter-wave Integrated Sensing and Communications (ISAC) with multi-beam design holds significant promise for vehicular networks, offering multi-target omnidirectional sensing and high-capacity communication services concurrently. Nonetheless, the considerable challenge of potential mutual interference arises due to the high mobility and density of transmitters in such networks. To address this challenge effectively, we propose leveraging inter-vehicle communication to schedule communication and sensing signals for vehicles, thereby enhancing networked sensing capabilities. We first introduce an analytical framework to characterize the mutual interference among multiple vehicles. Subsequently, we evaluate the effectiveness of our proposed interference mitigation method in terms of interference probability, duration, and the achievable detectable density. Additionally, recognizing the different performance requirements of communication and sensing functions, we investigate a joint resource allocation problem catering to both aspects. Simulation results demonstrate a notable enhancement in the proposed ISAC-based interference mitigation, with a 58% reduction in interference probability compared to benchmarking schemes. © 2002-2012 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

An Effective Security Comparison Protocol in Cloud Computing

引用

Computers, Materials & Continua 2023年第6期75卷 5141-5158页

作者： Yuling Chen Junhong Tao Tao Li Jiangyuan Cai Xiaojun Ren State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550000China Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic TechnologyGuilin550000China POWERCHINA Guizhou Electric Power Engineering Co. Ltd.Guiyang550000China Blockchain Laboratory of Agricultural Vegetables Weifang University of Science and TechnologyWeifang261000China

With the development of cloud computing technology,more and more data owners upload their local data to the public cloud server for storage and *** this can save customers’operating costs,it also poses privacy and security *** challenges can be solved using secure multi-party computation(SMPC),but this still exposes more security *** cloud computing using SMPC,clients need to process their data and submit the processed data to the cloud server,which then performs the calculation and returns the results to each *** client and server must be *** there is cooperation or dishonest behavior between clients,some clients may profit from it or even disclose the private data of other *** paper proposes the SMPC based on a Partially-Homomorphic Encryption(PHE)scheme in which an addition homomorphic encryption algorithm with a lower computational cost is used to ensure data comparability and Zero-Knowledge Proof(ZKP)is used to limit the client’s malicious *** addition,the introduction of Oblivious Transfer(OT)technology also ensures that the semi-honest cloud server knows nothing about private data,so that the cloud server of this scheme can calculate the correct data in the case of malicious participant models and safely return the calculation results to each ***,the security analysis shows that the scheme not only ensures the privacy of participants,but also ensures the fairness of the comparison protocol data.

关键词： Secure comparison protocols zero-knowledge proof homomorphic encryption cloud computing

来源：评论

学校读者我要写书评

暂无评论

Three Preemption Approaches towards EDF Scheduling for Homogeneous Multiprocessors 29

Three Preemption Approaches towards EDF Scheduling for Homog...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Wu, Peng Li, Zhi Zhang, Zhicai Yan, Tao Chen, Lu Shanxi University Institute of Big Data Science and Industry Taiyuan030006 China Shanxi University School of Computer and Information Technology Taiyuan030006 China Hainan University School of Computer Science and Technology Haikou570228 China

ISBN: (纸本)9798350330717

When scheduling a set of real-time tasks, researchers can choose between preemptive and non-preemptive algorithms. However, these algorithms each have their own advantages and drawbacks, necessitating specific analysis in different contexts. In contrast to these two extremes, researchers have proposed the concept of limited-preemption algorithms. Such limited-preemption algorithms serve as feasible alternatives to the former two approaches. Currently, research on this algorithm is based on a homogenous computing *** this paper, we investigate the fixed-preemption point method in limited-preemption algorithms. We compare the impact of limited-preemption EDF algorithm on the performance of homogenous multiprocessors under different fixed-preemption strategies. We introduce a preemptive strategy where high-priority tasks can only be preempted at the most suitable fixed-preemption points, and we provide an effective schedulability analysis for this strategy. The EDF scheduling algorithm based on the best-fit fixed preemption strategy is called the Best Preemptive EDF(BP-EDF). We have introduced an effective schedulability analysis for BP-EDF. Experimental results indicate that the strategy with the most suitable fixed-preemption points demonstrates superior schedulability compared to the other two strategies. Furthermore, its performance in terms of task preemption frequency closely approaches that of the strategy employing fixed-preemption at the lowest priority points. © 2023 IEEE.

关键词： EDF scheduling algorithm fixed preemption points homogeneous multiprocessors limited-preemption Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：