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

China Communications 2022年第12期19卷 86-100页

作者： Fei Zhao Jun He Sanyou Zeng Changhe Li Qinghui Xu Zhigao Zeng School of Mechanical Engineering and Electronic Information China University of GeosciencesWuhan 430074China Science and Technology on Blind Signal Processing Laboratory Southwest Electronics and Telecommunication Technology Research InstituteChengdu 610041China School of Automation China University of GeosciencesWuhan 430074China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan 430074China College of Computer Hunan University of TechnologyZhuzhou CityHunan Province412007China

Pattern synthesise of antenna arrays is usually complicated optimization problems,while evolutionary algorithms(EAs)are promising in solving these *** paper does not propose a new EA,but does construct a new form of optimization *** new optimization formulation has two differences from the common *** is the objective function is the field error between the desired and the designed,not the usual amplitude error between the desired and the *** difference is beneficial to decrease complexity in some *** second difference is that the design variables are changed as phases of desired radiation field within shaped-region,instead of excitation *** difference leads to the reduction of the number of design variables.A series of synthesis experiments including equally and unequally spaced linear arrays with different pattern shape requirements are applied,and the effectiveness and advantages of the proposed new optimization problems are *** results show that the proposing a new optimization formulation with less complexity is as significant as proposing a new algorithm.

关键词： pattern synthesis evolutionary algorithms linear antenna arrays

Leveraging GPT-4 Capabilities for Developing Context-Aware, Personalized Chatbot Interfaces in E-commerce Customer Support Systems

学校读者我要写书评

暂无评论

Leveraging GPT-4 Capabilities for Developing Context-Aware, ...

International Conference on Communications and Signal Processing

作者： Kathari Santosh Timur Kholmukhamedov M Sandeep Kumar Mohd Aarif Iskandar Muda B Kiran Bala Department of MBA CMR Institute of Technology Bengaluru Bengaluru India Automatic Control and Computer Engineering Department Turin Polytechnic University in Tashkent Tashkent Uzbekistan Publishing Global Research Network Noida India Universitas Sumatera Utara Medan Indonesia Department of Artificial Intelligence and Data Science K.Ramakrishnan college of Engineering Trichy

ISBN: (数字)9798350353068

ISBN: (纸本)9798350353075

In the realm of e-commerce customer support, the adoption of chatbots is on the rise, driven by a quest for heightened user interactions. This study introduces an inventive approach harnessing the advanced capabilities of GPT-4 to construct chatbot interfaces that are both context-aware and personalized. The main aim of this work is to revolutionize ecommerce customer support by developing intelligent and adaptable chatbot interfaces that are context-aware, personalized, and significantly enhance user experiences. Existing chatbot models struggle with context retention and personalization, limiting effectiveness in dynamic e-commerce environments despite the promise of automation. This innovative approach leverages GPT-4’s robust language processing, integrating it with user profiling systems for personalized responses grounded in user preferences and historical interactions. The method gives, diverse e-commerce dataset undergoes collection and pre-processing, followed by fine-tuning GPT-4 with an emphasis on context-awareness and personalized responses. The model is seamlessly integrated with e-commerce backend systems for real-time information, multimodal input support caters to varied user preferences. Results exhibit a significant 95% accuracy improvement, affirming the chatbot’s enhanced ability to comprehend user queries. By integrating personalization and advanced context retention, this study enhances user engagement, paving way for revolutionary intelligent and adaptable chatbot interfaces in ecommerce customer support.

关键词： Ethics Limiting Automation Biological system modeling Customer services Companies Chatbots

SSD-MonoDETR: Supervised Scale-aware Deformable Transformer for Monocular 3D Object Detection

学校读者我要写书评

暂无评论

arXiv 2023年

作者： He, Xuan Yang, Fan Yang, Kailun Lin, Jiacheng Fu, Haolong Wang, Meng Yuan, Jin Li, Zhiyong The College of Computer Science and Electronic Engineering Hunan University Changsha410082 China The School of Robotics Hunan University China410012 China The National Engineering Research Center of Robot Visual Perception and Control Technology Hunan University Changsha410082 China The School of Computer Science Hefei University of Technology Hefei230009 China

Transformer-based methods have demonstrated superior performance for monocular 3D object detection recently, which aims at predicting 3D attributes from a single 2D image. Most existing transformer-based methods leverage both visual and depth representations to explore valuable query points on objects, and the quality of the learned query points has a great impact on detection accuracy. Unfortunately, existing unsupervised attention mechanisms in transformers are prone to generate low-quality query features due to inaccurate receptive fields, especially on hard objects. To tackle this problem, this paper proposes a novel "Supervised Scale-aware Deformable Attention" (SSDA) for monocular 3D object detection. Specifically, SSDA presets several masks with different scales and utilizes depth and visual features to adaptively learn a scale-aware filter for object query augmentation. Imposing the scale awareness, SSDA could well predict the accurate receptive field of an object query to support robust query feature generation. Aside from this, SSDA is assigned with a Weighted Scale Matching (WSM) loss to supervise scale prediction, which presents more confident results as compared to the unsupervised attention mechanisms. Extensive experiments on the KITTI and Waymo Open datasets demonstrate that SSDA significantly improves the detection accuracy, especially on moderate and hard objects, yielding state-of-the-art performance as compared to the existing approaches. Our code will be made publicly available at https://***/mikasa3lili/SSD-MonoDETR. Copyright © 2023, The Authors. All rights reserved.

关键词： Object detection

Deconfound Semantic Shift and Incompleteness in Incremental Few-shot Semantic Segmentation 39

学校读者我要写书评

暂无评论

Deconfound Semantic Shift and Incompleteness in Incremental ...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wu, Yirui Xia, Yuhang Li, Hao Yuan, Lixin Chen, Junyang Liu, Jun Lu, Tong Wan, Shaohua Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing China College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Computing and Communication Lancaster University Lancaster United Kingdom National Key Lab for Novel Software Technology Nanjing University Nanjing China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Shenzhen China

ISBN: (纸本)157735897X

Incremental few-shot semantic segmentation (IFSS) expands segmentation capacity of the trained model to segment new-class images with few samples. However, semantic meanings may shift from background to object class or vice versa during incremental learning. Moreover, new-class samples often lack representative attribute features when the new class greatly differs from the pre-learned old class. In this paper, we propose a causal framework to discuss the cause of semantic shift and incompleteness in IFSS, and we deconfound the revealed causal effects from two aspects. First, we propose a Causal Intervention Module (CIM) to resist semantic shift. CIM progressively and adaptively updates prototypes of old class, and removes the confounder in an intervention manner. Second, a Prototype Refinement Module (PRM) is proposed to complete the missing semantics. In PRM, knowledge gained from the episode learning scheme assists in fusing features of new-class and old-class prototypes. Experiments on both PASCAL-VOC 2012 and ADE20k benchmarks demonstrate the outstanding performance of our method. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Semantic Segmentation

Perceptual Quality Assessment of Trisoup-Lifting Encoded 3D Point Clouds

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Long, Juncheng Su, Honglei Liu, Qi Yuan, Hui Gao, Wei Song, Jiarun Wang, Zhou The College of Electronics and Information Qingdao University Qingdao266071 China The School of Control Science and Engineering Shandong University Ji'nan250061 China The School of Electronic and Computer Engineering Peking University Shenzhen518055 China The Peng Cheng Laboratory Shenzhen518066 China The School of Telecommunications Engineering Xidian University Xi'An710071 China The Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

No-reference bitstream-layer point cloud quality assessment (PCQA) can be deployed without full decoding at any network node to achieve real-time quality monitoring. In this work, we develop the first PCQA model dedicated to Trisoup-Lifting encoded 3D point clouds by analyzing bitstreams without full decoding. Specifically, we investigate the relationship among texture bitrate per point (TBPP), texture complexity (TC) and texture quantization parameter (TQP) while geometry encoding is lossless. Subsequently, we estimate TC by utilizing TQP and TBPP. Then, we establish a texture distortion evaluation model based on TC, TBPP and TQP. Ultimately, by integrating this texture distortion model with a geometry attenuation factor, a function of trisoupNodeSizeLog2 (tNSL), we acquire a comprehensive NR bitstream-layer PCQA model named streamPCQ-TL. In addition, this work establishes a database named WPC6.0, the first and largest PCQA database dedicated to Trisoup-Lifting encoding mode, encompassing 400 distorted point clouds with both 4 geometric multiplied by 5 texture distortion levels. Experiment results on M-PCCD, ICIP2020 and the proposed WPC6.0 database suggest that the proposed streamPCQ-TL model exhibits robust and notable performance in contrast to existing advanced PCQA metrics, particularly in terms of computational cost. The dataset and source code will be publicly released at https://***/qdushl/Waterloo-Point-Cloud-Database-6.0. Copyright © 2024, The Authors. All rights reserved.

关键词： Encoding (symbols)

Performance Analysis of Distributed Filtering under Mismatched Noise Covariances

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Lyu, Xiaoxu Wen, Guanghui Shi, Ling Duan, Peihu Duan, Zhisheng The Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong The Laboratory of Security Operation and Control for Intelligent Autonomous Systems Department of Systems Science School of Mathematics Southeast University Nanjing211189 China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden State Key Laboratory for Turbulence and Complex Systems Department of Mechanics and Engineering Science College of Engineering Peking University Beijing100871 China

This paper systematically investigates the performance of consensus-based distributed filtering under mismatched noise covariances. First, we introduce three performance evaluation indices for such filtering problems, namely the standard performance evaluation index, the nominal performance evaluation index, and the estimation error covariance. We derive difference expressions among these indices and establish one-step relations among them under various mismatched noise covariance scenarios. We particularly reveal the effect of the consensus fusion on these relations. Furthermore, the recursive relations are introduced by extending the results of the one-step relations. Subsequently, we demonstrate the convergence of these indices under the collective observability condition, and show this convergence condition of the nominal performance evaluation index can guarantee the convergence of the estimation error covariance. Additionally, we prove that the estimation error covariance of the consensus-based distributed filter under mismatched noise covariances can be bounded by the Frobenius norms of the noise covariance deviations and the trace of the nominal performance evaluation index. Finally, the effectiveness of the theoretical results is verified by numerical simulations. Copyright © 2024, The Authors. All rights reserved.

关键词： Wiener filtering

Perceptual Quality Assessment of Octree-RAHT Encoded 3D Point Clouds

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Duan, Dongshuai Su, Honglei Liu, Qi Yuan, Hui Gao, Wei Song, Jiarun Wang, Zhou College of Electronics and Information Qingdao University Qingdao266071 China School of Control Science and Engineering Shandong University Ji’nan250061 China School of Electronic and Computer Engineering Peking University Shenzhen518055 China Peng Cheng Laboratory Shenzhen518066 China School of Telecommunications Engineering Xidian University Xi’an710071 China Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

No-reference bitstream-layer point cloud quality assessment (PCQA) can be deployed without full decoding at any network node to achieve real-time quality monitoring. In this work, we focus on the PCQA problem dedicated to Octree-RAHT encoding mode. First, to address the issue that existing PCQA databases have a small scale and limited distortion levels, we establish the WPC5.0 database which is the first one dedicated to Octree-RAHT encoding mode with a scale of 400 distorted point clouds (PCs) including 4 geometric multiplied by 5 attitude distortion levels. Then, we propose the first PCQA model dedicated to Octree-RAHT encoding mode by parsing PC bitstreams without full decoding. The model introduces texture bitrate (TBPP) to predict texture complexity (TC) and further derives the texture distortion factor. In addition, the Geometric Quantization Parameter (PQS) is used to estimate the geometric distortion factor, which is then integrated into the model along with the texture distortion factor to obtain the proposed PCQA model named streamPCQ-OR. The proposed model has been compared with other advanced PCQA methods on the WPC5.0, BASICS and M-PCCD databases, and experimental results show that our model has excellent performance while having very low computational complexity, providing a reliable choice for time-critical applications. To facilitate subsequent research, the database and source code will be publicly released at https://***/qdushl/Waterloo-Point-Cloud-Database-5.0. Copyright © 2024, The Authors. All rights reserved.

关键词： Database systems

Research on Student Big Data Portrait Method Based on Improved K-means Algorithm

学校读者我要写书评

暂无评论

Research on Student Big Data Portrait Method Based on Improv...

Science and Technology Innovation (IAECST), International Academic Exchange Conference on

作者： Suzhi Zhang Minzhe Shen Yirang Yu College of Software Zhengzhou University of Light Industry Zhengzhou China College of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou China

ISBN: (纸本)9781665402682

In the application of student big data portraits, the use of k-means algorithm has the shortcomings that the K value and initial centers need to be selected manually. To solve this problem, two improvements are made to the k-means. On the one hand, the canopy algorithm is used for preliminary clustering, and the results are provided to k-means as a reference for the K value, which eliminates the uncertainty in the selection of the K value. On the other hand, using the max-min distance algorithm to select K samples with relatively far distances as the initial centers of k-means, avoiding the problem of randomly selecting the initial centers to fall into the local optimum. Using the six-month campus data of 826 students in a university to perform cluster analysis from the two dimensions of consumption and learning, and evaluate the clustering effect through the silhouette coefficient. The experimental results verify that k-means based on canopy and the principle of max-min distance can effectively distinguish students with different behavior characteristics, and provide corresponding decision support for college education managers.

关键词： Technological innovation Uncertainty Education Clustering algorithms Big Data Data mining

Locally Weighted DTW Method Based on Sparse Path Matrix 3

学校读者我要写书评

暂无评论

Locally Weighted DTW Method Based on Sparse Path Matrix

3rd IEEE International Conference on Information Systems and computer Aided Education, ICISCAE 2020

作者： Sun, Maobin Zhang, Lisheng College of Computer Science and Technology Chong Qing University of Post and Telecommunications Chongqing China College of Software Engineering Chong Qing University of Post and Telecommunications Chongqing China

ISBN: (纸本)9781728183039

Dynamic time warping algorithm is one of the most effective time series similarity measures. The LDTW algorithm solves the problem that the dynamic time warping algorithm timing alignment method treats the instance features equally and ignores its local discriminative characteristics, but the time complexity of the LDTW generation of the weight matrix is too high. This paper proposes a LDTW algorithm based on sparse path matrices. In the process of iteratively generating a weight matrix from the training set, a sparse path matrix between homogeneous sequences and a sparse path matrix between different types of sequences are generated according to the type of sequence in the training set. Weight matrix over a sparse path matrix. The proposed algorithm is simulated and verified on the UCR dataset. The LDTW algorithm based on the sparse path matrix has the same classification error rate as LDTW, but the time cost of generating the weight matrix is significantly lower than the LDTW algorithm. It proves the effectiveness of path matrix LDTW in reducing time consumption. © 2020 IEEE.

关键词： Iterative methods

BNN-DP: Robustness Certification of Bayesian Neural Networks via Dynamic Programming

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Adams, Steven Patanè, Andrea Lahijanian, Morteza Laurenti, Luca Delft Center for Systems and Control Technical University of Delft Delft2628 CD Netherlands School of Computer Science and Statistics Trinity College Dublin Dublin 2 Ireland Departement of Aerospace Engineering Sciences and Computer Science University of Colorado Boulder BoulderCO80303 United States

In this paper, we introduce BNN-DP, an efficient algorithmic framework for analysis of adversarial robustness of Bayesian Neural Networks (BNNs). Given a compact set of input points T ⊂ Rn, BNN-DP computes lower and upper bounds on the BNN’s predictions for all the points in T. The framework is based on an interpretation of BNNs as stochastic dynamical systems, which enables the use of Dynamic Programming (DP) algorithms to bound the prediction range along the layers of the network. Specifically, the method uses bound propagation techniques and convex relaxations to derive a backward recursion procedure to over-approximate the prediction range of the BNN with piecewise affine functions. The algorithm is general and can handle both regression and classification tasks. On a set of experiments on various regression and classification tasks and BNN architectures, we show that BNN-DP outperforms state-of-the-art methods by up to four orders of magnitude in both tightness of the bounds and computational efficiency. © 2023, CC BY.

关键词： Dynamic programming