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

A Power-System Economic Dispatching Based on Enhanced Group Search Optimizer 1

18th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2022

作者： Pan, Jeng-Shyang Nguyen, Trong-The Nguyen, Trinh-Dong Nguyen, Vinh-Tiep Dao, Thi-Kien College of Computer Science and Engineering Shandong University of Science and Technology Qing-Dao266590 China Department of Information Management Chaoyang University of Technology Taichung41349 Taiwan University of Information Technology Ho Chi Minh City700000 Viet Nam Vietnam National University Ho Chi Minh City700000 Viet Nam Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China

ISBN: (数字)9789819901050

ISBN: (纸本)9789819901043

Economic dispatch (ED) is one of the critical tasks in a power system’s optimization issues, but its characteristics with non-convex, high-dimensional, non-linear, and non-differentiable, so that caused solutions are more challenging in reality. This paper suggests an enhanced group search optimizer (EGSO) for solving the ED model with the valve-point effect and the different fuels. The EGSO adopts the original group search optimizer (GSO) by changing polar to Cartesian coordinate’s conversion and adding cyclic translation operators to the search behavior of the finder and walker to avoid falling into local optimal and slow convergence of the GSO. In the experiment section, the testing power systems of the ED model are used to validate the EGSO performance. The experimental results reveal that EGSO outperformed the other algorithms regarding convergence speed, the time required to complete calculations, and impacts with lower fuel cost. Additionally, with excellent outcomes in optimization issues involving multiple local optimal values show the EGSO is practical, quick, and efficient in addressing the challenging ED model. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

ROD: Reception-aware online distillation for sparse graphs

arXiv

引用

arXiv 2021年

作者： Zhang, Wentao Jiang, Yuezihan Li, Yang Sheng, Zeang Shen, Yu Miao, Xupeng Wang, Liang Yang, Zhi Cui, Bin School of EECS Key Laboratory of High Confidence Software Technologies Peking University Center for Data Science Peking University National Engineering Laboratory for Big Data Analysis and Applications Alibaba Group

Graph neural networks (GNNs) have been widely used in many graph-based tasks such as node classification, link prediction, and node clustering. However, GNNs gain their performance benefits mainly from performing the feature propagation and smoothing across the edges of the graph, thus requiring sufficient connectivity and label information for effective propagation. Unfortunately, many real-world networks are sparse in terms of both edges and labels, leading to sub-optimal performance of GNNs. Recent interest in this sparse problem has focused on the self-training approach, which expands supervised signals with pseudo labels. Nevertheless, the self-training approach inherently cannot realize the full potential of refining the learning performance on sparse graphs due to the unsatisfactory quality and quantity of pseudo labels. In this paper, we propose ROD, a novel reception-aware online knowledge distillation approach for sparse graph learning. We design three supervision signals for ROD: multi-scale reception-aware graph knowledge, task-based supervision, and rich distilled knowledge, allowing online knowledge transfer in a peer-teaching manner. To extract knowledge concealed in the multi-scale reception fields, ROD explicitly requires individual student models to preserve different levels of locality information. For a given task, each student would predict based on its reception-scale knowledge, while simultaneously a strong teacher is established on-the-fly by combining multi-scale knowledge. Our approach has been extensively evaluated on 9 datasets and a variety of graph-based tasks, including node classification, link prediction, and node clustering. The result demonstrates that ROD achieves state-of-art performance and is more robust for the graph sparsity. Copyright © 2021, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Differentiable Feature Aggregation Search for Knowledge Distillation 16th

Differentiable Feature Aggregation Search for Knowledge Dist...

引用

16th European Conference on Computer Vision, ECCV 2020

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

ISBN: (纸本)9783030585198

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. © 2020, Springer Nature Switzerland AG.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Research on patent recommendation method based on graph neural network

Research on patent recommendation method based on graph neur...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Enchao Zhang Weidong Liu Shi Liu Yan Cao College of Computer Science Inner Mongolia University China Institute of Scientific and Technical Information of China China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

Intellectual property transactions have shown a strong growth momentum in recent years, but the patent transaction market has been plagued by the matching degree of consumers and sellers, resulting in frequent problems such as low patent transformation efficiency and poor transaction quality. This paper proposes a method of recommending patents to consumers by experts to improve the environment of patent transactions. Through the analysis of the past transaction information of the patent, the effective path information of the target is extracted. The graph neural network is used to describe the characteristics and semantics among experts, patents and consumers, and then capture the potential weight among them through the common attention mechanism, and then dynamically integrate them to predict the occurrence of recommendation behavior. The paper makes reasonable use of social information and expert information in the transaction, which significantly improves the rationality and accuracy of expert recommendation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploring Patent Transformation Event: Forecasting Patent Transfer Time

Exploring Patent Transformation Event: Forecasting Patent Tr...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Jinchen Huo Weidong Liu Yang Li Yan Cao College of Computer Science Inner Mongolia University China Institute of Scientific and Technical Information of China China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

As the largest source of technical information around the world, patents are regarded as an essential crystallization and carrier of knowledge and technological innovation. Patent transformation is conducive not only to enhancing economic efficiency, but also to improving productivity and the rational utilization of resources. There is an imbalance between high patent ownership and low transformation rates. We try to predict the occurrence of transformation events from the patent assignment. However, there are some challenges in predicting patent transformation: (1) how to capture transformation features of patents, especially combined with the transfer time factor. (2) how to predict patent transfer time effectively. To address these challenges, a Patent Transfer Time Forecasting Model (PTTFM) is proposed. The model includes: (1) extraction of time-varying features of patents. (2) the patent transfer time is forecast using a Neural Temporal Point Process. By testing the model on patents under different classifications, the experimental results are obtained to show that the proposed model is applicable to predict the timing of patent assignment within a certain time frame, especially one month. Our work may facilitate patent transformation while interpretability is ensured for transformation events.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Simplify Implant Depth Prediction as Video Grounding: A Texture Perceive Implant Depth Prediction Network

arXiv

引用

arXiv 2024年

作者： Yang, Xinquan Li, Xuguang Luo, Xiaoling Zeng, Leilei Zhang, Yudi Shen, Linlin Deng, Yongqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China AI Research Center for Medical Image Analysis and Diagnosis Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Stomatology Shenzhen University General Hospital Shenzhen China

Surgical guide plate is an important tool for the dental implant surgery. However, the design process heavily relies on the dentist to manually simulate the implant angle and depth. When deep neural networks have been applied to assist the dentist quickly locates the implant position, most of them are not able to determine the implant depth. Inspired by the video grounding task which localizes the starting and ending time of the target video segment, in this paper, we simplify the implant depth prediction as video grounding and develop a Texture Perceive Implant Depth Prediction Network (TPNet), which enables us to directly output the implant depth without complex measurements of oral bone. TPNet consists of an implant region detector (IRD) and an implant depth prediction network (IDPNet). IRD is an object detector designed to crop the candidate implant volume from the CBCT, which greatly saves the computation resource. IDPNet takes the cropped CBCT data to predict the implant depth. A Texture Perceive Loss (TPL) is devised to enable the encoder of IDPNet to perceive the texture variation among slices. Extensive experiments on a large dental implant dataset demonstrated that the proposed TPNet achieves superior performance than the existing methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Research on Digital Identity Technology and Application Based on Identification Code and Trusted Account Blockchain fusion

Research on Digital Identity Technology and Application Base...

引用

Artificial Intelligence, Networking and Information Technology (AINIT), International Seminar on

作者： Wei Zhao Ning Yang Guangli Li Keli Zhang China Information Security Research Institute Co. Ltd Beijing China National Engineering Laboratory for Big Data Analysis and Applications Center for Data Science Beijing China

ISBN: (纸本)9781665412971

Digital identity is one of the key elements to build a trust system in the digital economy era. Digital identity has empowered social governance and public services in the new era in many fields, and promoted the rapid development of digital economy. In this paper, a trusted digital identity based on identification code and trusted account blockchain fusion is proposed. Through the unified standard, unified coding identifier, combined with identity-based cryptographic algorithm and blockchain, identification code and trusted account blockchain fusion is realized, and a real, effective, safe and credible digital identity technology system is constructed. Trusted digital identity is a bridge connecting the virtual world and the physical world. It plays a strong supporting role in realizing the identity fusion and ‘digital twin’ of the physical world offline and the virtual world. It is the core element of the construction of new smart cities and the development of digital economy.

关键词： Seminars Bridges Codes Smart cities big data Encoding Blockchains

来源：评论

学校读者我要写书评

暂无评论

Learning Human-Written Commit Messages to Document Code Changes

引用

Journal of Computer Science & Technology 2020年第6期35卷 1258-1277页

作者： Yuan Huang Nan Jia Hao-Jie Zhou Xiang-Ping Chen Zi-Bin Zheng Ming-Dong Tang National Engineering Research Center of Digital Life School of Data and Computer ScienceSun Yat-sen University Guangzhou 510006China School of Information Engineering Hebei GEO UniversityShijiazhuang 050031China Guangdong Key Laboratory for Big Data Analysis and Simulation of Public Opinion School of Communication and DesignSun Yat-sen UniversityGuangzhou 510006China School of Information Science and Technology Guangdong University of Foreign StudiesGuangzhou 510006China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou 510006China

Commit messages are important complementary information used in understanding code changes. To address message scarcity, some work is proposed for automatically generating commit messages. However, most of these approaches focus on generating summary of the changed software entities at the superficial level, without considering the intent behind the code changes (e.g., the existing approaches cannot generate such message:"fixing 'null' pointer exception"). Considering developers often describe the intent behind the code change when writing the messages, we propose ChangeDoc, an approach to reuse existing messages in version control systems for automatical commit message generation. Our approach includes syntax, semantic, pre-syntax, and pre-semantic similarities. For a given commit without messages, it is able to discover its most similar past commit from a large commit repository, and recommend its message as the message of the given commit. Our repository contains half a million commits that were collected from SourceForge. We evaluate our approach on the commits from 10 projects. The results show that 21.5% of the recommended messages by ChangeDoc can be directly used without modification, and 62.8% require minor modifications. In order to evaluate the quality of the commit messages recommended by ChangeDoc, we performed two empirical studies involving a total of 40 participants (10 professional developers and 30 students). The results indicate that the recommended messages are very good approximations of the ones written by developers and often include important intent information that is not included in the messages generated by other tools.

关键词： commit message recommendation code syntax similarity code semantic similarity code change comprehension

来源：评论

学校读者我要写书评

暂无评论

EG-KGR: A Knowledge Graph Reasoning Model Based on Enhanced Graph Sample and Aggregate Inductive Learning Algorithm

EG-KGR: A Knowledge Graph Reasoning Model Based on Enhanced ...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Yuejia Wu Jian-Tao Zhou Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Knowledge Graph is an important research field that involves the storage and management of knowledge, but the incompleteness and sparsity of Knowledge Graphs hinder their application in many fields. Knowledge Graph Reasoning aims to alleviate this problem by completing missing paths or identifying wrong paths between entities. Graph Convolution Network (GCN) based methods are one of the state-of-the-art approaches to this work. However, it is difficult to directly generalize to unknown nodes and utilizes valid information from the local neighborhood which results in poor flexibility and extensibility and will loss of important information. This paper presents EG-KGR, a plug-and-play knowledge reasoning model based on enhanced graph sampling and aggregate inductive learning algorithm to relieve the above problems and enhance existing GCN-based methods. Specifically, EG-KGR supports incremental characteristics, uses inductive learning to replace transductive learning, and designs random sampling and local information sampling optimization methods to improve the model's generalization ability, prediction accuracy, and running speed. Extensive experimental results show that our EG-KGR can achieve optimal results.

关键词： Training Knowledge engineering Convolution Aggregates Optimization methods Knowledge graphs Learning (artificial intelligence)

来源：评论

学校读者我要写书评

暂无评论

BurstBalancer: Do Less, Better Balance for Large-scale data Center Traffic

BurstBalancer: Do Less, Better Balance for Large-scale Data ...

引用

International Conference on Network Protocols

作者： Zirui Liu Yikai Zhao Zhuochen Fan Tong Yang Xiaodong Li Ruwen Zhang Kaicheng Yang Zheng Zhong Yi Huang Cong Liu Jing Hu Gaogang Xie Bin Cui National Engineering Laboratory for Big Data Analysis Technology and Application School of Computer Science Peking University Beijing China Peng Cheng Laboratory Shenzhen China Huawei Technologies CNIC CAS

ISBN: (数字)9781665482349

ISBN: (纸本)9781665482356

Layer-3 load balancing is a key topic in the networking field. It is well acknowledged that flowlet is the most promising solution because of its good trade-off between load balance and packet reordering. However, we find its one significant limitation: it makes the forwarding paths of flows unpredictable. To address this limitation, this paper presents BurstBalancer, a simple yet efficient load balancing system with a sketch, named BalanceSketch. Our design philosophy is doing less changes to keep the forwarding path of most flows fixed, which guides the design of BalanceSketch and balance operations. We have fully implemented BurstBalancer in a small-scale testbed built with Tofino switches, and conducted large-scale NS-2 simulations. Our results show that BurstBalancer achieves 5%∼35% smaller FCT than LetFlow in symmetric topology and up to 30× smaller FCT in asymmetric topology, while 58× fewer flows suffer from path changing. All related codes are open-sourced at Github 2 2 https://***/BurstBalancer/Burst-Balancer.

关键词： data centers Philosophical considerations Protocols Codes Network topology Load management Topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：