Pointer instruments are widely used in the nuclear power industry. Addressing the issues of low accuracy and slow detection speed in recognizing pointer meter readings under varying types and distances, this paper pro...Pointer instruments are widely used in the nuclear power industry. Addressing the issues of low accuracy and slow detection speed in recognizing pointer meter readings under varying types and distances, this paper proposes a recognition method based on YOLOv8 and DeepLabv3+. To improve the image input quality of the DeepLabv3+ model, the YOLOv8 detector is used to quickly locate the instrument region and crop it as the input image for recognition. To enhance the accuracy and speed of pointer recognition, the backbone network of DeepLabv3+ was replaced with Mo-bileNetv3, and the ECA+ module was designed to replace its SE module, reducing model parameters while improving recognition precision. The decoder’s fourfold-up sampling was replaced with two twofold-up samplings, and shallow feature maps were fused with encoder features of the corresponding size. The CBAM module was introduced to improve the segmentation accuracy of the pointer. Experiments were conducted using a self-made dataset of pointer-style instruments from nuclear power plants. Results showed that this method achieved a recognition accuracy of 94.5% at a precision level of 2.5, with an average error of 1.522% and an average total processing time of 0.56 seconds, demonstrating strong performance.展开更多
Micro-nano Earth Observation Satellite(MEOS)constellation has the advantages of low construction cost,short revisit cycle,and high functional density,which is considered a promising solution for serving rapidly growin...Micro-nano Earth Observation Satellite(MEOS)constellation has the advantages of low construction cost,short revisit cycle,and high functional density,which is considered a promising solution for serving rapidly growing observation demands.The observation Scheduling Problem in the MEOS constellation(MEOSSP)is a challenging issue due to the large number of satellites and tasks,as well as complex observation constraints.To address the large-scale and complicated MEOSSP,we develop a Two-Stage Scheduling Algorithm based on the Pointer Network with Attention mechanism(TSSA-PNA).In TSSA-PNA,the MEOS observation scheduling is decomposed into a task allocation stage and a single-MEOS scheduling stage.In the task allocation stage,an adaptive task allocation algorithm with four problem-specific allocation operators is proposed to reallocate the unscheduled tasks to new MEOSs.Regarding the single-MEOS scheduling stage,we design a pointer network based on the encoder-decoder architecture to learn the optimal singleMEOS scheduling solution and introduce the attention mechanism into the encoder to improve the learning efficiency.The Pointer Network with Attention mechanism(PNA)can generate the single-MEOS scheduling solution quickly in an end-to-end manner.These two decomposed stages are performed iteratively to search for the solution with high profit.A greedy local search algorithm is developed to improve the profits further.The performance of the PNA and TSSA-PNA on singleMEOS and multi-MEOS scheduling problems are evaluated in the experiments.The experimental results demonstrate that PNA can obtain the approximate solution for the single-MEOS scheduling problem in a short time.Besides,the TSSA-PNA can achieve higher observation profits than the existing scheduling algorithms within the acceptable computational time for the large-scale MEOS scheduling problem.展开更多
The Heterogeneous Capacitated Vehicle Routing Problem(HCVRP),which involves efficiently routing vehicles with diverse capacities to fulfill various customer demands at minimal cost,poses an NP-hard challenge in combin...The Heterogeneous Capacitated Vehicle Routing Problem(HCVRP),which involves efficiently routing vehicles with diverse capacities to fulfill various customer demands at minimal cost,poses an NP-hard challenge in combinatorial optimization.Recently,reinforcement learning approaches such as 2D Array Pointer Networks(2D-Ptr)have demonstrated remarkable speed in decision-making by modeling multiple agents’concurrent choices as a sequence of consecutive actions.However,these learning-based models often struggle with generalization,meaning they cannot seamlessly adapt to new scenarios with varying numbers of vehicles or customers without retraining.Inspired by the potential of multi-teacher knowledge distillation to harness diverse knowledge from multiple sources and craft a comprehensive student model,we propose to enhance the generalization capability of 2D-Ptr through Multiple Teacher-forcing Knowledge Distillation(MTKD).We initially train 12 unique 2D-Ptr models under various settings to serve as teacher models.Subsequently,we randomly sample a teacher model and a batch of problem instances,focusing on those where the chosen teacher performed best.This teacher model then solves these instances,generating high-reward action sequences to guide knowledge transfer to the student model.We conduct rigorous evaluations across four distinct datasets,each comprising four HCVRP instances of varying scales.Our empirical findings underscore the proposed method superiority over existing learning-based methods in terms of both computational efficiency and solution quality.展开更多
Named Entity Recognition(NER)stands as a fundamental task within the field of biomedical text mining,aiming to extract specific types of entities such as genes,proteins,and diseases from complex biomedical texts and c...Named Entity Recognition(NER)stands as a fundamental task within the field of biomedical text mining,aiming to extract specific types of entities such as genes,proteins,and diseases from complex biomedical texts and categorize them into predefined entity types.This process can provide basic support for the automatic construction of knowledge bases.In contrast to general texts,biomedical texts frequently contain numerous nested entities and local dependencies among these entities,presenting significant challenges to prevailing NER models.To address these issues,we propose a novel Chinese nested biomedical NER model based on RoBERTa and Global Pointer(RoBGP).Our model initially utilizes the RoBERTa-wwm-ext-large pretrained language model to dynamically generate word-level initial vectors.It then incorporates a Bidirectional Long Short-Term Memory network for capturing bidirectional semantic information,effectively addressing the issue of long-distance dependencies.Furthermore,the Global Pointer model is employed to comprehensively recognize all nested entities in the text.We conduct extensive experiments on the Chinese medical dataset CMeEE and the results demonstrate the superior performance of RoBGP over several baseline models.This research confirms the effectiveness of RoBGP in Chinese biomedical NER,providing reliable technical support for biomedical information extraction and knowledge base construction.展开更多
A proposal for smooth aggressive location restoration by forwarding pointer is given in this paper. A mobile communication system＇s robustness in case of a location-database failure is improved without the need for p...A proposal for smooth aggressive location restoration by forwarding pointer is given in this paper. A mobile communication system＇s robustness in case of a location-database failure is improved without the need for periodic location update operations. Radio resources would be saved at the cost of wire signal and operation of location databases. Meanwhile, a chain of forwarding location pointers has been used during the period of HLR failure. So mobile stations are unconscious of the failure of HLR, and mobile subscribers can always make outgoing call.展开更多
Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper,...Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are classified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.展开更多
By introducing a mobility anchor point （MAP）, hierarchical mobile IPv6 （HMIPv6） reduces the binding update signaling cost associated with mobile IPv6, but there still exist deficiencies. For instance, a mobile no...By introducing a mobility anchor point （MAP）, hierarchical mobile IPv6 （HMIPv6） reduces the binding update signaling cost associated with mobile IPv6, but there still exist deficiencies. For instance, a mobile node （MN） needs to orderly accomplish two binding updates with the MAP and home agent （HA） when the MN performs inter-MAP mobility. This results in a high signaling cost, thus affecting network performance. To reduce the inter-MAP binding update cost of idle MN in HMIPv6, an optimization scheme based on pointer forwarding with a threshold is proposed. The scheme can reduces the binding update cost of idle MN by using the binding update between MAP to replace several home binding updates. The signaling cost difference is derived by analyzing the cost of the basic scheme and the optimization scheme between two successive sessions. Simulation results show that, the optimization scheme can reduce the binding update signaling cost and improve the network performance as long as a suitable threshold is chosen. The discussions on the sensitivity of tele-parameters are also given.展开更多
Few-shot named entity recognition(NER)aims to identify named entities in new domains using a limited amount of annotated data.Previous methods divided this task into entity span detection and entity classification,ach...Few-shot named entity recognition(NER)aims to identify named entities in new domains using a limited amount of annotated data.Previous methods divided this task into entity span detection and entity classification,achieving good results.However these methods are limited by the imbalance between the entity and non-entity categories due to the use of sequence labeling for entity span detection.To this end,a point-proto network(PPN)combining pointer and prototypical networks was proposed.Specifically,the pointer network generates the position of entities in sentences in the entity span detection stage.The prototypical network builds semantic prototypes of entity types and classifies entities based on their distance from these prototypes in the entity classification stage.Moreover,the low-rank adaptation(LoRA)fine-tuning method,which involves freezing the pre-trained weights and injecting a trainable decomposition matrix,reduces the parameters that need to be trained and saved.Extensive experiments on the few-shot NER Dataset(Few-NERD)and Cross-Dataset demonstrate the superiority of PPN in this domain.展开更多
Shuttle tankers scheduling is an important task in offshore oil and gas transportation process,which involves operating time window fulfillment,optimal transportation planning,and proper inventory management.However,c...Shuttle tankers scheduling is an important task in offshore oil and gas transportation process,which involves operating time window fulfillment,optimal transportation planning,and proper inventory management.However,conventional approaches like Mixed lnteger Linear Programming(MlLP)or meta heuristic algorithms often fail in long running time.In this paper,a Graph Pointer Network(GPN)based Hierarchical Curriculum Reinforcement Learning(HCRl)method is proposed to solve Shuttle Tankers Scheduling Problem(STSP)The model is trained to divide STSP into voyage and operation stages and generate routing and inventory management decisions sequentially.An asynchronous training strategy is developed to address the coupling between stages.Comparison experiments demonstrate that the proposed HCRL method achieves 12%shortel tour lengths on average compared to heuristic algorithms.Additional experiments validate its generalizability to unseen instances and scalability to larger instances.展开更多
在汉越低资源翻译任务中,句子中的实体词准确翻译是一大难点。针对实体词在训练语料中出现的频率较低,模型无法构建双语实体词之间的映射关系等问题,构建一种融入实体翻译的汉越神经机器翻译模型。首先,通过汉越实体双语词典预先获取源...在汉越低资源翻译任务中,句子中的实体词准确翻译是一大难点。针对实体词在训练语料中出现的频率较低,模型无法构建双语实体词之间的映射关系等问题,构建一种融入实体翻译的汉越神经机器翻译模型。首先,通过汉越实体双语词典预先获取源句中实体词的翻译结果;其次,将结果拼接在源句末端作为模型的输入,同时在编码端引入“约束提示信息”增强表征;最后,在解码端融入指针网络机制,以确保模型能复制输出源端句的词汇。实验结果表明,该模型相较于跨语言模型XLM-R(Cross-lingual Language Model-RoBERTa)的双语评估替补(BLEU)值在汉越方向提升了1.37,越汉方向提升了0.21,时间性能上相较于Transformer该模型在汉越方向和越汉方向分别缩短3.19%和3.50%,可有效地提升句子中实体词翻译的综合性能。展开更多
文摘Pointer instruments are widely used in the nuclear power industry. Addressing the issues of low accuracy and slow detection speed in recognizing pointer meter readings under varying types and distances, this paper proposes a recognition method based on YOLOv8 and DeepLabv3+. To improve the image input quality of the DeepLabv3+ model, the YOLOv8 detector is used to quickly locate the instrument region and crop it as the input image for recognition. To enhance the accuracy and speed of pointer recognition, the backbone network of DeepLabv3+ was replaced with Mo-bileNetv3, and the ECA+ module was designed to replace its SE module, reducing model parameters while improving recognition precision. The decoder’s fourfold-up sampling was replaced with two twofold-up samplings, and shallow feature maps were fused with encoder features of the corresponding size. The CBAM module was introduced to improve the segmentation accuracy of the pointer. Experiments were conducted using a self-made dataset of pointer-style instruments from nuclear power plants. Results showed that this method achieved a recognition accuracy of 94.5% at a precision level of 2.5, with an average error of 1.522% and an average total processing time of 0.56 seconds, demonstrating strong performance.
基金supported by the National Natural Science Foundation of China(No.62101587)the National Funded Postdoctoral Researcher Program of China(No.GZC20233578)。
文摘Micro-nano Earth Observation Satellite(MEOS)constellation has the advantages of low construction cost,short revisit cycle,and high functional density,which is considered a promising solution for serving rapidly growing observation demands.The observation Scheduling Problem in the MEOS constellation(MEOSSP)is a challenging issue due to the large number of satellites and tasks,as well as complex observation constraints.To address the large-scale and complicated MEOSSP,we develop a Two-Stage Scheduling Algorithm based on the Pointer Network with Attention mechanism(TSSA-PNA).In TSSA-PNA,the MEOS observation scheduling is decomposed into a task allocation stage and a single-MEOS scheduling stage.In the task allocation stage,an adaptive task allocation algorithm with four problem-specific allocation operators is proposed to reallocate the unscheduled tasks to new MEOSs.Regarding the single-MEOS scheduling stage,we design a pointer network based on the encoder-decoder architecture to learn the optimal singleMEOS scheduling solution and introduce the attention mechanism into the encoder to improve the learning efficiency.The Pointer Network with Attention mechanism(PNA)can generate the single-MEOS scheduling solution quickly in an end-to-end manner.These two decomposed stages are performed iteratively to search for the solution with high profit.A greedy local search algorithm is developed to improve the profits further.The performance of the PNA and TSSA-PNA on singleMEOS and multi-MEOS scheduling problems are evaluated in the experiments.The experimental results demonstrate that PNA can obtain the approximate solution for the single-MEOS scheduling problem in a short time.Besides,the TSSA-PNA can achieve higher observation profits than the existing scheduling algorithms within the acceptable computational time for the large-scale MEOS scheduling problem.
基金in part by the National Science Foundation of China under Grant No.62276238in part by the National Science Foundation for Distinguished Young Scholars of China under Grant No.62325602in part by the Natural Science Foundation of Henan,China under Grant No.232300421095.
文摘The Heterogeneous Capacitated Vehicle Routing Problem(HCVRP),which involves efficiently routing vehicles with diverse capacities to fulfill various customer demands at minimal cost,poses an NP-hard challenge in combinatorial optimization.Recently,reinforcement learning approaches such as 2D Array Pointer Networks(2D-Ptr)have demonstrated remarkable speed in decision-making by modeling multiple agents’concurrent choices as a sequence of consecutive actions.However,these learning-based models often struggle with generalization,meaning they cannot seamlessly adapt to new scenarios with varying numbers of vehicles or customers without retraining.Inspired by the potential of multi-teacher knowledge distillation to harness diverse knowledge from multiple sources and craft a comprehensive student model,we propose to enhance the generalization capability of 2D-Ptr through Multiple Teacher-forcing Knowledge Distillation(MTKD).We initially train 12 unique 2D-Ptr models under various settings to serve as teacher models.Subsequently,we randomly sample a teacher model and a batch of problem instances,focusing on those where the chosen teacher performed best.This teacher model then solves these instances,generating high-reward action sequences to guide knowledge transfer to the student model.We conduct rigorous evaluations across four distinct datasets,each comprising four HCVRP instances of varying scales.Our empirical findings underscore the proposed method superiority over existing learning-based methods in terms of both computational efficiency and solution quality.
基金supported by the Outstanding Youth Team Project of Central Universities(QNTD202308)the Ant Group through CCF-Ant Research Fund(CCF-AFSG 769498 RF20220214).
文摘Named Entity Recognition(NER)stands as a fundamental task within the field of biomedical text mining,aiming to extract specific types of entities such as genes,proteins,and diseases from complex biomedical texts and categorize them into predefined entity types.This process can provide basic support for the automatic construction of knowledge bases.In contrast to general texts,biomedical texts frequently contain numerous nested entities and local dependencies among these entities,presenting significant challenges to prevailing NER models.To address these issues,we propose a novel Chinese nested biomedical NER model based on RoBERTa and Global Pointer(RoBGP).Our model initially utilizes the RoBERTa-wwm-ext-large pretrained language model to dynamically generate word-level initial vectors.It then incorporates a Bidirectional Long Short-Term Memory network for capturing bidirectional semantic information,effectively addressing the issue of long-distance dependencies.Furthermore,the Global Pointer model is employed to comprehensively recognize all nested entities in the text.We conduct extensive experiments on the Chinese medical dataset CMeEE and the results demonstrate the superior performance of RoBGP over several baseline models.This research confirms the effectiveness of RoBGP in Chinese biomedical NER,providing reliable technical support for biomedical information extraction and knowledge base construction.
文摘A proposal for smooth aggressive location restoration by forwarding pointer is given in this paper. A mobile communication system＇s robustness in case of a location-database failure is improved without the need for periodic location update operations. Radio resources would be saved at the cost of wire signal and operation of location databases. Meanwhile, a chain of forwarding location pointers has been used during the period of HLR failure. So mobile stations are unconscious of the failure of HLR, and mobile subscribers can always make outgoing call.
基金the National Natural Science Foundation of China under grant No.69903003,Defence Science and Technology Key Laboratory Foundat
文摘Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are classified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.
基金supported by the Natural Science Foundation of Jiangsu Province (BK2009469)the Fundamental Research Funds for the Central Universities (BUPT2009RC0120)the National Natural Science Foundation of China (60772110)
文摘By introducing a mobility anchor point （MAP）, hierarchical mobile IPv6 （HMIPv6） reduces the binding update signaling cost associated with mobile IPv6, but there still exist deficiencies. For instance, a mobile node （MN） needs to orderly accomplish two binding updates with the MAP and home agent （HA） when the MN performs inter-MAP mobility. This results in a high signaling cost, thus affecting network performance. To reduce the inter-MAP binding update cost of idle MN in HMIPv6, an optimization scheme based on pointer forwarding with a threshold is proposed. The scheme can reduces the binding update cost of idle MN by using the binding update between MAP to replace several home binding updates. The signaling cost difference is derived by analyzing the cost of the basic scheme and the optimization scheme between two successive sessions. Simulation results show that, the optimization scheme can reduce the binding update signaling cost and improve the network performance as long as a suitable threshold is chosen. The discussions on the sensitivity of tele-parameters are also given.
基金supported by the National Key Research and Development Project(2021YFF0901701)。
文摘Few-shot named entity recognition(NER)aims to identify named entities in new domains using a limited amount of annotated data.Previous methods divided this task into entity span detection and entity classification,achieving good results.However these methods are limited by the imbalance between the entity and non-entity categories due to the use of sequence labeling for entity span detection.To this end,a point-proto network(PPN)combining pointer and prototypical networks was proposed.Specifically,the pointer network generates the position of entities in sentences in the entity span detection stage.The prototypical network builds semantic prototypes of entity types and classifies entities based on their distance from these prototypes in the entity classification stage.Moreover,the low-rank adaptation(LoRA)fine-tuning method,which involves freezing the pre-trained weights and injecting a trainable decomposition matrix,reduces the parameters that need to be trained and saved.Extensive experiments on the few-shot NER Dataset(Few-NERD)and Cross-Dataset demonstrate the superiority of PPN in this domain.
基金supported by the National Natural Science Foundation of China(Nos.22178383 and 21706282)Beijing Natural Science Foundation(No.2232021)Research Foundation of China University of Petroleum(Beijing)(No.2462020BJRC004).
文摘Shuttle tankers scheduling is an important task in offshore oil and gas transportation process,which involves operating time window fulfillment,optimal transportation planning,and proper inventory management.However,conventional approaches like Mixed lnteger Linear Programming(MlLP)or meta heuristic algorithms often fail in long running time.In this paper,a Graph Pointer Network(GPN)based Hierarchical Curriculum Reinforcement Learning(HCRl)method is proposed to solve Shuttle Tankers Scheduling Problem(STSP)The model is trained to divide STSP into voyage and operation stages and generate routing and inventory management decisions sequentially.An asynchronous training strategy is developed to address the coupling between stages.Comparison experiments demonstrate that the proposed HCRL method achieves 12%shortel tour lengths on average compared to heuristic algorithms.Additional experiments validate its generalizability to unseen instances and scalability to larger instances.
文摘在汉越低资源翻译任务中,句子中的实体词准确翻译是一大难点。针对实体词在训练语料中出现的频率较低,模型无法构建双语实体词之间的映射关系等问题,构建一种融入实体翻译的汉越神经机器翻译模型。首先,通过汉越实体双语词典预先获取源句中实体词的翻译结果;其次,将结果拼接在源句末端作为模型的输入,同时在编码端引入“约束提示信息”增强表征;最后,在解码端融入指针网络机制,以确保模型能复制输出源端句的词汇。实验结果表明,该模型相较于跨语言模型XLM-R(Cross-lingual Language Model-RoBERTa)的双语评估替补(BLEU)值在汉越方向提升了1.37,越汉方向提升了0.21,时间性能上相较于Transformer该模型在汉越方向和越汉方向分别缩短3.19%和3.50%,可有效地提升句子中实体词翻译的综合性能。
