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

2023 IEEE International Conference on Sensors, Electronics and computer Engineering, ICSECE 2023

作者： Zheng, Yantian Xing, Hangdi Yu, Zhi Zhang, Xinhua Gao, Feiyu Bu, Jiajun Zhejiang University Zhejiang Provincial Key Laboratory of Service Robot School of Software Technology Ningbo China Zhejiang University Zhejiang Provincial Key Laboratory of Service Robot College of Computer Science Hangzhou China Zhejiang School for the Blind Hangzhou China DAMO Academy Alibaba Group Hangzhou China

ISBN: (纸本)9798350313734

In the field of education, Teachers of Students with Visual Impairments need to read and review student's Braille homework. Reading Braille consumes a lot of teachers' time and energy. We propose an end-to-end solution to translate Braille into Chinese. Our approach uses a deep learning method to detect and recognize Braille in images and translate them into Chinese and mathematical formulas. Finally, we reconstruct the translation results into the style of the input Braille image. Our approach is able to adapt to more complex Braille images and make the translation results easier to read and understand, significantly improving the speed of reading Braille for non-disabled. © 2023 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Generating Redstone Style Cities in Minecraft 5

Generating Redstone Style Cities in Minecraft

引用

5th Annual IEEE Conference on Games, CoG 2023

作者： Huang, Shuo Hu, Chengpeng Togelius, Julian Liu, Jialin Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Shenzhen518055 China New York University Tandon School of Engineering Department of Computer Science and Engineering New York10012 United States

ISBN: (纸本)9798350322774

Procedurally generating cities in Minecraft provides players more diverse scenarios and could help understand and improve the design of cities in other digital worlds and the real world. This paper presents a city generator that was submitted as an entry to the 2023 Edition of Minecraft Settlement Generation Competition for Minecraft. The generation procedure is composed of six main steps, namely vegetation clearing, terrain reshaping, building layout generation, route planning, streetlight placement, and wall construction. Three algorithms, including a heuristic-based algorithm, an evolving layout algorithm, and a random one are applied to generate the building layout, thus determining where to place different redstone style buildings, and tested by generating cities on random maps in limited time. Experimental results show that the heuristic-based algorithm is capable of finding an acceptable building layout faster for flat maps, while the evolving layout algorithm performs better in evolving layout for rugged maps. A user study is conducted to compare our generator with outstanding entries of the competition's 2022 edition using the competition's evaluation criteria and shows that our generator performs well in the adaptation and functionality criteria. © 2023 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Multi-Stage Goal-Driven Network for Pedestrian Trajectory Prediction 5

A Multi-Stage Goal-Driven Network for Pedestrian Trajectory ...

引用

5th International Conference on computer Vision, Image and Deep Learning, CVIDL 2024

作者： Wu, Xiuen Wang, Tao Cai, Yuanzheng Liang, Lingyu Papageorgiou, George Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou China Fuzhou University College of Computer and Data Science Fuzhou China South China University of Technology School of Electronic and Information Engineering Guangzhou China European University Cyprus Department of Computer Science and Engineering Nicosia Cyprus

ISBN: (纸本)9798350373820

Pedestrian trajectory prediction plays a pivotal role in ensuring the safety and efficiency of various applications, including autonomous vehicles and traffic management systems. This paper proposes a novel method for pedestrian trajectory prediction, called multi-stage goal-driven network (MGNet). Diverging from prior approaches relying on stepwise recursive prediction and the singular forecasting of a long-term goal, MGNet directs trajectory generation by forecasting intermediate stage goals, thereby reducing prediction errors. The network comprises three main components: a conditional variational autoencoder (CVAE), an attention module, and a multi-stage goal evaluator. Trajectories are encoded using conditional variational autoencoders to acquire knowledge about the approximate distribution of pedestrians' future trajectories, and combined with an attention mechanism to capture the temporal dependency between trajectory sequences. The pivotal module is the multi-stage goal evaluator, which utilizes the encoded feature vectors to predict intermediate goals, effectively minimizing cumulative errors in the recursive inference process. The effectiveness of MGNet is demonstrated through comprehensive experiments on the JAAD and PIE datasets. Comparative evaluations against state-of-the-art algorithms reveal significant performance improvements achieved by our proposed method. © 2024 IEEE.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Negatively Correlated Search for Constrained Optimization

Negatively Correlated Search for Constrained Optimization

引用

2023 IEEE Congress on Evolutionary Computation, CEC 2023

作者： Li, Yuan Lu, Xiaofen Yao, Xin Southern University of Science and Technology The Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Shenzhen518055 China School of Computer Science University of Birmingham Edgbaston BirminghamB15 2TT United Kingdom

ISBN: (纸本)9798350314588

Evolutionary algorithms (EAs) combined with constraint handling techniques (CHTs) are very effective in solving constrained optimization problems (COPs). Recently, negatively correlated search (NCS) has been shown to be powerful for real-world multimodal optimization problems (MMOP). However, there has been few works on utilizing NCS to solve COPs. In this paper, we present a novel constrained optimization evolutionary algorithm (COEA) named NCS-E which combined NCS with a new CHT ensemble method to deal with COPs. It integrates three complementary CHTs as voters, and individuals are first voted by each voter, then the individual with more weighted votes is considered better. In addition, the negative correlation information of the voted individuals is utilized to adaptively adjust the voting weights. To demonstrate the performance of NCS-E, NCS-E is compared with four NCS-based COEAs and two state-of-the-art methods, MAgES and MAgES-VMCH, on 57 real-world COPs. The statistical results show that NCS-E exhibits the best performance among the compared methods. Moreover, NCS-E was applied to solve the Deep Neural Network pruning problem and compared with the state-of-the-art pruning method OLMP on three reference models. Empirical results show that the proposed method improves the performance of OLMP on all three DNN pruning tasks. © 2023 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

NEAT-Net: An Unsupervised Cross-View Prior Inpainting Network for CBCT Metal Artifact Reduction 46

NEAT-Net: An Unsupervised Cross-View Prior Inpainting Networ...

引用

46th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBC 2024

作者： Yang, Yang Tong, Zhan Zhong, Xinyun Shi, Yijie Xi, Yan Yu, Wenxue Wu, Zhan Chen, Yang First-Imaging Tech Shanghai China Southeast University Laboratory of Image Science and Technology The School of Computer Science and Engineering Nanjing China Southeast University Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing The Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Nanjing China

ISBN: (纸本)9798350371499

Intraoperative Cone-Beam Computed Tomography (CBCT) facilitates intraoperative navigation for Minimally Invasive Spine Surgery (MISS). However, high-attenuation metal implants used in MISS often cause metal artifacts in the reconstructed CBCT images. Current algorithms do not consider the cross-view information in the projection-domain for metal artifact reduction (MAR). Inaccurate projection-domain inpainting results in CBCT MAR lead to tissue blurring and secondary artifacts, significantly compromising the accuracy of CBCT-guided MISS and increasing surgical risks. To address the above challenge, in this paper, we propose a novel unsupervised cross-view prior inpainting network for CBCT Metal Artifact Reduction named NEAT-Net. Firstly, a cross-view prior multi-scale inpainting module is constructed to learn the inter-view complementary information. Secondly, a hybrid feature attention module is proposed to adaptively fuse cross-view features. In addition, an unsupervised training approach is proposed to directly learn from metal-affected data. Extensive experiments are conducted to verify the effectiveness of our algorithm on a real clinical dataset. © 2024 IEEE.

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

A Multiple-Path Learning Neural Network Model for Code Completion

A Multiple-Path Learning Neural Network Model for Code Compl...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Liu, Yi Liu, Jianxun Zhang, Xiangping Hu, Haize Hunan University of Science and Technology Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Xiangtan411201 China Hunan University of Humanities Science and Technology School of Informationn Loudi417000 China Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan411201 China

ISBN: (纸本)9798350304855

Code completion, which can accelerate the software development process and improve the quality of software products, is an essential part of today's integrated development environments. It has become an important research topic in the field of software engineering. Recent studies have shown that the method of code completion based on the Abstract Syntax Tree (AST) learns syntactic information about the code, which helps to improve the accuracy of code completion. However, when modeling neural networks for ASTs, the sequencing operation of nodes leads to the loss of their hierarchical structure information. Meanwhile, traditional neural networks cannot predict many Out-of-Vocabulary (OoV) words in the terminal node values of AST. To alleviate the above problem, in this paper, we propose a Multiple-Path Learning neural network model for code completion (MPL) based on an AST by learning from a large-scale corpus. In this model, multiple paths such as context path, root path, and terminal node path are established to understand different code features required for node prediction and improve code representation ability. Based on the principle of program local repeatability, it also adopts a replication mechanism to copy the appropriate OoV words from the local terminal node path as the prediction result, further improving the prediction accuracy. The experimental results show that the MPL model has better performance than existing methods on the code completion task. © 2023 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

A Novel Association Rule Mining Method for Streaming Temporal Data

引用

Annals of Data science 2022年第4期9卷 863-883页

作者： Zheng, Hui Li, Peng He, Jing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Jiangsu Nanjing China School of Software and Electrical Engineering Swinburne University of Technology Melbourne Australia

Streaming temporal data contains time stamps and values, challenging to quantify relationships of time stamps and corresponding values. Moreover, the characteristics and relationships of streaming temporal data are not invariable. Thus, it is impossible to analyse all data by a trained model at the beginning of data streams. Practically, the trained model to analyse streaming temporal data should change according to the increasing volume of data. Association rule mining, on the other hand, can find potential relationships from given data. This paper proposes an association rule mining method for streaming temporal data to discover potential relationships from streaming temporal data. Our experiments verify our proposed method. A public data set is applied to compare the performance of the proposed method and its counterpart. A small data set is also applied for two case studies to further illustrate our proposed method mine association rules with streaming temporal data with time stamps and corresponding values. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Association rule mining Streaming data Potential relationships Timestamp Value Data mining Association rule learning

来源：评论

学校读者我要写书评

暂无评论

CPAKE: Dynamic Batch Authenticated key Exchange with Conditional Privacy 24th

CPAKE: Dynamic Batch Authenticated Key Exchange with Condit...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Xiang, Axin Tian, Youliang Xiong, Jinbo Ying, Zuobin Peng, Changgen State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China Guizhou Provincial Key Laboratory of Cryptography and Blockchain Technology Guiyang550025 China Industrial School of Joint Innovation Quanzhou Vocational and Technical University Quanzhou362268 China Faculty of Data Science City University of Macau 999078 China

ISBN: (纸本)9789819615247

Authenticated key exchange (AKE) needs to be designed for realizing point-to-multipoint secure communications in blockchain networks (BNet). However, since BNet is open, untrusted and decentralized, traditional certificateless AKE schemes are difficult to overcome two technical bottlenecks, i.e., private distribution of partial keys and accurate identification of anonymous traitors. This paper proposes a conditionally private and dynamic batch AKE scheme (CPAKE) in BNet. We first develop a privacy-preserving certificateless key generation algorithm to prevent the disclosure of nodes’ privacy during partial key distribution. Then, we design a simple anonymous traitor tracing mechanism against Byzantine adversaries to accurately identify and trace the traitor’s identity. Finally, we build a dynamic batch authentication protocol with decentralized node management to ensure the final validity of honest nodes. Moreover, performance analysis indicates that our scheme reduces the signing and batch-verifying time by approximately 193.10 ms and 10.93 ms respectively over state-of-the-art. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Efficient Task Offloading in Double Roadside RIS-assisted Vehicular Edge Computing networks Using Deep Reinforcement Learning

引用

IEEE Transactions on Vehicular technology 2025年

作者： Xie, Yibin Shi, Lei Li, Zhehao Ding, Xu Fan, Yuqi Hefei University of Technology School of Computer Science and Information Engineering Anhui Provincial Key Laboratory of Industry Safety and Emergency Technology Hefei230601 China

The concept of vehicular edge computing (VEC) has recently been envisioned as a promising paradigm to satisfy the quality of service (QoS) requirement of delay-sensitive intelligent applications in future networks. However, the limited radio frequency communication range necessitates the dense deployment of communication infrastructures to accommodate the increasing number of connected vehicles and data traffic. This could lead to growing equipment and energy costs, hindering the full realization of the VEC system. To address such limitations, we introduce a double roadside reconfigurable intelligent surface (RIS) assisted VEC network in this paper, where RISs are deployed inside the coverage gaps between two RSUs to extend the service range. The research goal is to maximize the sum offloading efficiency by jointly optimizing offloading decisions, computation resource allocation, and phase shift vectors of RISs. Since the original problem is a challenging mixed-integer non-linear problem (MINLP), we decompose it into a top-problem for optimizing offloading destinations and phase shift vectors, and a sub-problem for optimizing offloading ratios and computation resources. We propose a deep reinforcement learning (DRL)-based algorithm for quickly obtaining near-optimal offloading decisions and phase shift vectors, alongside a Dinkelbach-based method for obtaining optimal offloading ratios and computation resource allocation. Simulation results demonstrate that our proposed algorithm achieves near-optimal performance compared to other benchmarks and enables real-time decision-making. © 1967-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A New Method for Predefined-Time Synchronization Control of Memristive Cohen-Grossberg Neural networks

A New Method for Predefined-Time Synchronization Control of ...

引用

2023 IEEE International Conference on Memristive Computing and Applications, ICMCA 2023

作者： Liu, Aidi Yu, Wenyue Huang, Lili Guo, Jian Lei, Tengfei Zhao, Hui School of Computer and Information Engineering Qilu Institute of Technology Jinan China School of Computer and Information Engineering Qilu Institute of Technology China Collaborative Innovation Center of Memristive Computing Application School of Computer and Information Engineering Qilu Institute of Technology China School of Information Science and Engineering University of Jinan Shandong Provincial Key Laboratory of Network Based Intelligent Computing Jinan China

ISBN: (纸本)9798350316230

This article mainly conducts a series of research on the synchronization control of Cohen-Grossberg neural networks. Firstly, a memristive Cohen-Grossberg neural network model with time-varying delay was constructed, and an equivalent system was obtained by combining inverse function theory, differential inclusion, and set-valued mapping. Secondly, a new predefined-time stability theorem was proposed, and sufficient conditions were obtained to ensure that the drive-response system achieves predefined-time synchronization by designing appropriate control strategy. The simulation results show that the stability time of the error system can be adjusted by the user, verifying the correctness and of the theory. © 2023 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：