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

arXiv 2022年

作者： Wen, Xiaofei Wei, Wei Mao, Xian-Ling Cognitive Computing and Intelligent Information Processing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology China China Department of Computer Science and Technology Beijing Institute of Technology China

Recently, topic-grounded dialogue system has attracted significant attention due to its effectiveness in predicting the next topic to yield better responses via the historical context and given topic sequence. However, almost all existing topic prediction solutions focus on only the current conversation and corresponding topic sequence to predict the next conversation topic, without exploiting other topic-guided conversations which may contain relevant topic-transitions to current conversation. To address the problem, in this paper we propose a novel approach, named Sequential Global Topic Attention (SGTA) to exploit topic transition over all conversations in a subtle way for better modeling post-to-response topic-transition and guiding the response generation to the current conversation. Specifically, we introduce a latent space modeled as a Multivariate Skew-Normal distribution with hybrid kernel functions to flexibly integrate the global-level information with sequence-level information, and predict the topic based on the distribution sampling results. We also leverage a topic-aware prior-posterior approach for secondary selection of predicted topics, which is utilized to optimize the response generation task. Extensive experiments demonstrate that our model outperforms competitive baselines on prediction and generation tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Meta-ZSDETR: Zero-shot DETR with Meta-learning

Meta-ZSDETR: Zero-shot DETR with Meta-learning

引用

International Conference on computer Vision (ICCV)

作者： Lu Zhang Chenbo Zhang Jiajia Zhao Jihong Guan Shuigeng Zhou Shanghai Key Lab of Intelligent Information Processing and School of Computer Science Fudan University China Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory China Department of Computer Science & Technology Tongji University China

Zero-shot object detection aims to localize and recognize objects of unseen classes. Most of existing works face two problems: the low recall of RPN in unseen classes and the confusion of unseen classes with background. In this paper, we present the first method that combines DETR and meta-learning to perform zero-shot object detection, named Meta-ZSDETR, where model training is formalized as an individual episode based meta-learning task. Different from Faster R-CNN based methods that firstly generate class-agnostic proposals, and then classify them with visual-semantic alignment module, Meta-ZSDETR directly predict class-specific boxes with class-specific queries and further filter them with the predicted accuracy from classification head. The model is optimized with meta-contrastive learning, which contains a regression head to generate the coordinates of class-specific boxes, a classification head to predict the accuracy of generated boxes, and a contrastive head that utilizes the proposed contrastive-reconstruction loss to further separate different classes in visual space. We conduct extensive experiments on two benchmark datasets MS COCO and PASCAL VOC. Experimental results show that our method outperforms the existing ZSD methods by a large margin.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimization of Memory March X Test Algorithm Based on Nuclear Safety Level DCS system Platform 1

引用

9th International Conference on Energy Engineering and Environmental Engineering, ICEEEE 2022

作者： Bai, Yongfei Wu, Zhiqiang Liu, Jie Jiang, Wei Zhong, Ke Han, Wenxing Chen, Zhi School of Computer Science University of South China Hengyang421200 China Nuclear Power Institute of China Chengdu610000 China Intelligent Equipment Software Evaluation Engineering Technology Research Center of Hunan Hengyang China CNNC Key Laboratory on High Trusted Computing Hunan Hengyang China

ISBN: (数字)9783031302336

ISBN: (纸本)9783031302329

At present, the testing algorithm of nuclear power safety level DCS system for memory is GALPAT algorithm. This algorithm has a high time complexity and low fault coverage for memory. During the testing process, additional storage space is required, and the security of additional memory cannot be guaranteed. Based on the memory fault testing theory, this paper analyzes and studies the March X algorithm. It is found that the algorithm can not meet the coverage requirements for memory faults when applied to the nuclear power safety level DCS system. A March X+ algorithm is proposed. The algorithm can meet the index requirements of the nuclear power safety level DCS system for memory testing algorithms, and the fault detection rate reaches more than 95%, And it innovatively proposes to save the data to the register during the detection process, which does not require additional memory and improves the security. To verify the feasibility of the algorithm designed in this paper, the algorithm test time and functionality were verified in the main control PBIST module under a nuclear power safety level DCS system platform. The results show that the proposed test algorithm has certain advantages in test time and memory fault coverage. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Nuclear energy

来源：评论

学校读者我要写书评

暂无评论

Split Lohmann computer holography: fast generation of 3D hologram in single-step diffraction calculation

引用

Advanced Photonics Nexus 2024年第3期3卷 1-13页

作者： Chenliang Chang Xian Ding Di Wang Zhizhou Ren Bo Dai Qi Wang Songlin Zhuang Dawei Zhang University of Shanghai for Science and Technology School of Optical-Electrical and Computer EngineeringEngineering Research Center of Optical Instrument and SystemMinistry of Education and Shanghai Key Laboratory of Modern Optics SystemShanghaiChina Beihang University School of Instrumentation and Optoelectronic EngineeringBeijingChina

Holographic display stands as a prominent approach for achieving lifelike three-dimensional(3D)reproductions with continuous depth ***,the generation of a computer-generated hologram(CGH)always relies on the repetitive computation of diffraction propagation from point-cloud or multiple depthsliced planar images,which inevitably leads to an increase in computational complexity,making real-time CGH generation ***,we report a new CGH generation algorithm capable of rapidly synthesizing a 3D hologram in only one-step backward propagation calculation in a novel split Lohmann lens-based diffraction *** introducing an extra predesigned virtual digital phase modulation of multifocal split Lohmann lens in such a diffraction model,the generated CGH appears to reconstruct 3D scenes with accurate accommodation abilities across the display *** with the conventional layer-based method,the computation speed of the proposed method is independent of the quantized layer numbers,and therefore can achieve real-time computation speed with a very dense of depth *** simulation and experimental results validate the proposed method.

关键词： computer holography holographic display diffraction calculation.

来源：评论

学校读者我要写书评

暂无评论

On Privacy-Preserving Task Assignment for Heterogeneous Users in Mobile Crowdsensing

On Privacy-Preserving Task Assignment for Heterogeneous User...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Ji Zhang Peng Li Weiyi Huang Lei Nie Haizhou Bao Qin Liu School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China School of Cyber Science and Engineering Wuhan University China

Task assignment is a key challenge in mobile crowd-sensing because of the varying capabilities of crowd users. Location-based task assignment schemes require users to upload their location to an untrusted platform, which raises many privacy concerns. However, stronger privacy preservation may lead to lower system utility. It is challenging to maximize system utility under privacy preservation for users. In this paper, we propose a privacy-preserving task assignment for heterogeneous users (PTAH) problem in mobile crowdsensing. Specifically, we divide users into two groups: private users with location privacy requirements and public users without location privacy requirements. We first design a privacy-preserving mechanism to obfuscate the actual location of private users. Then we construct a relationship graph based on the locations between users and tasks. We prove that the PTAH problem is an NP-hard problem, so to maximize the system utility, we propose an approximation algorithm based on the greedy algorithm. Then we propose a multi-thread cooperative simulated annealing algorithm to search for a better approximate solution. Finally, we conducted simulations based on the widely-used real-world Roma dataset. The results show that our proposed algorithm consistently outperforms other baseline algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A generalized reliability analysis of 3-ary n-cubes

A generalized reliability analysis of 3-ary n-cubes

引用

International Conference on Communication Software and Networks, ICCSN

作者： Zefang Bai Guijuan Wang Meijie Ma School of Mathematics and Statistics Qilu University of Technology (Shandong Academy of Sciences) Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331506322

ISBN: (纸本)9798331506339

Evaluating the reliability of interconnection networks is crucial. The edge-connectivity is a parameter used to assess reliability. In this paper, we discuss a conditional edge-connectivity called the h-extra g-component edge-connectivity. It combines the extra edge-connectivity and the component edge-connectivity. First, this paper proved that $c \lambda_{3}^{h}\left(Q_{n}^{3}\right)=4 n h-$ $4 e_{h}\left(Q_{n}^{3}\right)-h$ for $1 \leq h \leq \frac{1}{2} \cdot 3^{\left\lceil\frac{h}{2}\right\rceil}, n \geq 3$. Then, the paper given the upper bound of h-extra g-component edge-connectivity of the 3 -ary n-cubes for $g \in\left\{4,3^{c}+1\right\}, 1 \leq c \leq\left\lceil\frac{n}{2}\right\rceil-1, n \geq 3$.

关键词： Upper bound Multiprocessor interconnection Software Reliability

来源：评论

学校读者我要写书评

暂无评论

Safe Probabilistic Invariance Verification for Stochastic Discrete-Time Dynamical systems

Safe Probabilistic Invariance Verification for Stochastic Di...

引用

IEEE Conference on Decision and Control

作者： Yiqing Yu Taoran Wu Bican Xia Ji Wang Bai Xue Department of Information Science School of Mathematical Sciences Peking University China State Key Laboratory of Computer Science Institute of Software CAS China State Key Laboratory of High Performance Computing and College of Computer Science and Technology National University of Defense Technology China

Ensuring safety through set invariance has proven a useful method in a variety of applications in robotics and control. In this paper, we focus on the safe probabilistic invariance verification problem for discrete-time dynamical systems subject to stochastic disturbances over the infinite time horizon. Our goal is to compute the lower and upper bounds of the liveness probability for a given safe set and set of initial states. This probability represents the likelihood that the system will remain within the safe set for all time. To address this problem, we draw inspiration from stochastic barrier certificates for safety verification and build upon the findings in [21], where an equation was presented for exact probability analysis. We present two sets of optimizations and demonstrate their effectiveness through two examples, using semi-definite programming tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Gearbox Fault Diagnosis Based on Semi-Supervised Prototypical Network and Contrastive Learning

Few-Shot Gearbox Fault Diagnosis Based on Semi-Supervised Pr...

引用

Chinese Automation Congress (CAC)

作者： Shulie Cheng Yingjie Liang Zuowei Ping Xuechao Liao Maolin Wang Yong Zhang School of Information Science and Engineering Wuhan University of Science and Technology Wuhan China National Key Laboratory of Science and Technology on Vessel Integrated Power System Naval University of Engineering Wuhan China School of Computer Science and Technology Wuhan University of Science and Technology Wuhan China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

Due to the scarcity of labeled faulty data in industrial practice, fault diagnosis models often face challenges related to overfitting and limited accuracy. This article introduces a novel solution to tackle the problem—a fault diagnosis method that leverages a combination of a semi-supervised prototype network and contrastive learning. Firstly, a limited number of labeled samples is employed to construct pairs of positive and negative samples. And the training method of contrastive learning is used to provide appropriate initial parameters for the autoencoder. Secondly, the autoencoder is employed as a feature mapping function within the prototype network and obtains the prototype using a limited number of labeled samples. Finally, a prototype refinement method fine-tunes the prototype through unlabeled data, reducing the impact of anomalous data and obtaining a more stable and accurate prototype. The effectiveness of the proposed method is evaluated using gearbox data as a validation dataset. Through comparative analysis with other methods, the results demonstrate that the proposed approach achieves superior diagnostic accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Multi-modal Multi-objective Path Planning by Improved Ant Colony Algorithm 1

引用

17th International Conference on Bio-Inspired computing: Theories and Applications, BIC-TA 2022

作者： Jing, Juan Zhang, Ling Shen, Chaonan Zhang, Kai School of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan University of Science and Technology Wuhan430065 China

ISBN: (数字)9789819915491

ISBN: (纸本)9789819915484

A research about the path planning problem has been popular topic nowadays and some effective algorithms have been developed to solve this kind of problem. However, the existing algorithms to solve the path problem can only find a single optimal path, cannot satisfactorily find multiple groups of optimal solutions at the same time, and it is very necessary to propose as many solutions as possible. So this paper carries out a research on the Multi-modal Multi-Objective Path Planning (MMOPP), the objective is to find all sets of Pareto optimal path solutions from the start point to the end point in a grid map. This paper proposes a multi-modal multi-objective ant colony path planning optimization algorithm based on matrix preprocessing technology and Dijkstra algorithm (MD-ACO). Firstly, a new method of storing maps that reduces the size of the map and reduces the size of the decision space has been proposed in this paper. Secondly, using the characteristics of the Dijkstra algorithm that can quickly find the optimal path, generate an initial feasible solution about the problem, and improve the problem that the initial pheromone of ant colony algorithm is insufficient and searching for solutions is slow. Thirdly, a reasonable threshold is set for the pheromone to avoid algorithm getting stuck in local optimal solution. Finally, the algorithm is tested on the MMOPP test sets to evaluate the performance of the algorithm, and the results show that MD-ACO algorithm can solve MMOPP and get the optimal solution set. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Memristive computing and Applications (ICMCA), IEEE International Conference on

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：