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

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Duan, Xuan Liu, Songbai Ji, Junkai Li, Lingjie Lin, Qiuzhen Tan, Kay Chen College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Shenzhen China The Hong Kong Polytechnic University Department of Computing Hong Kong

ISBN: (纸本)9798350308365

To enhance the generalization of multi-objective feature selection (MOFS) in classification, this paper proposes an evolutionary multitasking algorithm, diverging from previous approaches that exclusively target selected features. The algorithm integrates information from both selected and unselected features, introducing a novel objective to minimize the accuracy of unselected features. This objective, combined with the goal of minimizing classification errors for selected features, forms an auxiliary MOFS task. The paper presents a dual-population evolutionary multitasking framework that synergizes the main MOFS task with the auxiliary task. A knowledge transfer mechanism, based on accuracy preferences, seamlessly shares insights from the auxiliary to the main task, aiming to identify improved Pareto feature subsets. Empirical results demonstrate the superior performance of several state-of-the-art multi-objective algorithms within this framework, highlighting significant improvements across diverse datasets. © 2024 IEEE.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Improved Distributed Algorithms for Random Colorings 27

Improved Distributed Algorithms for Random Colorings

引用

27th International Conference on Principles of Distributed Systems, OPODIS 2023

作者： Carlson, Charlie Frishberg, Daniel Vigoda, Eric Department of Computer Science University of California Santa BarbaraCA United States Department of Computer Science and Software Engineering California Polytechnic State University San Luis ObispoCA United States

ISBN: (纸本)9783959773089

Markov Chain Monte Carlo (MCMC) algorithms are a widely-used algorithmic tool for sampling from high-dimensional distributions, a notable example is the equilibirum distribution of graphical models. The Glauber dynamics, also known as the Gibbs sampler, is the simplest example of an MCMC algorithm;the transitions of the chain update the configuration at a randomly chosen coordinate at each step. Several works have studied distributed versions of the Glauber dynamics and we extend these efforts to a more general family of Markov chains. An important combinatorial problem in the study of MCMC algorithms is random colorings. Given a graph G of maximum degree ∆ and an integer k ≥ ∆ + 1, the goal is to generate a random proper vertex k-coloring of G. Jerrum (1995) proved that the Glauber dynamics has O(n log n) mixing time when k > 2∆. Fischer and Ghaffari (2018), and independently Feng, Hayes, and Yin (2018), presented a parallel and distributed version of the Glauber dynamics which converges in O(log n) rounds for k > (2 + Ε)∆ for any Ε > 0. We improve this result to k > (11/6 − δ)∆ for a fixed δ > 0. This matches the state of the art for randomly sampling colorings of general graphs in the sequential setting. Whereas previous works focused on distributed variants of the Glauber dynamics, our work presents a parallel and distributed version of the more general flip dynamics presented by Vigoda (2000) (and refined by Chen, Delcourt, Moitra, Perarnau, and Postle (2019)), which recolors local maximal two-colored components in each step. © Charlie Carlson, Daniel Frishberg, and Eric Vigoda

关键词： Coloring

来源：评论

学校读者我要写书评

暂无评论

Light field depth estimation:A comprehensive survey from principles to future

引用

High-Confidence Computing 2024年第1期4卷 92-107页

作者： Tun Wang Hao Sheng Rongshan Chen Da Yang Zhenglong Cui Sizhe Wang Ruixuan Cong Mingyuan Zhao State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Zhongfa Aviation Institute Beihang UniversityHangzhou 311115China Faculty of Applied Sciences Macao Polytechnic UniversityMacao 999078China State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191China

Light Field(LF)depth estimation is an important research direction in the area of computer vision and computational photography,which aims to infer the depth information of different objects in threedimensional scenes by capturing LF *** this new era of significance,this article introduces a survey of the key concepts,methods,novel applications,and future trends in this *** summarize the LF depth estimation methods,which are usually based on the interaction of radiance from rays in all directions of the LF data,such as epipolar-plane,multi-view geometry,focal stack,and deep *** analyze the many challenges facing each of these approaches,including complex algorithms,large amounts of computation,and speed *** addition,this survey summarizes most of the currently available methods,conducts some comparative experiments,discusses the results,and investigates the novel directions in LF depth estimation.

关键词： Light field Depth estimation Deep learning Sub-aperture image Epipolar-plane image

来源：评论

学校读者我要写书评

暂无评论

MAML-TSC: Model-Agnostic Meta-Learning for Time Series Classification 7

MAML-TSC: Model-Agnostic Meta-Learning for Time Series Class...

引用

7th International Conference on Pattern Recognition and Artificial Intelligence, PRAI 2024

作者： Wang, Jiahao Sun, Zutong Yan, Hang Chen, Hao School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu610000 China School of Intelligent Manufacturing and Information Technology Yaan Polytechnic College Yaan625000 China

ISBN: (纸本)9798350350890

User portrait technology, involves analyzing historical usage records of household electronic devices, is evolving quickly. Traditional methods using LSTM or CNN for time series classification face challenges in achieving high accuracy with limited data. To address this, our study introduces MAML-TSC, which combines a dual-channel Transformer with model-agnostic meta-learning (MAML). This model features a dual-channel Transformer that leverages a multi-head self-attention mechanism to extract information from both time and channel axes effectively. By incorporating MAML, the model harnesses knowledge transfer to optimize initialization parameters for diverse training tasks, enhancing performance with fewer data samples. Experimental outcomes show MAML-TSC achieving 90% accuracy in the meta-learning phase and maintaining over 80% after 10 iterations, outperforming the DeepConvLSTM baseline by 12.5% and surpassing most current deep-learning approaches. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Zero-Knowledge Set Membership Proof Scheme Based on the SM2 Algorithm 24

A Zero-Knowledge Set Membership Proof Scheme Based on the SM...

引用

2024 Guangdong-Hong Kong-Macao Greater Bay Area International Conference on Digital Economy and Artificial Intelligence, DEAI 2024

作者： Zhou, Yin Dai, Bingrong Li, Chao School of Computer and Information Engineering Shanghai Polytechnic University My Street Shanghai201209 China Department of Computing Shanghai Development Center of Computer SoftWare Technology Shanghai201102 China

ISBN: (纸本)9798400717147

With the widespread application of blockchain technology, various range proof protocols based on zero-knowledge proofs have been proposed. However, existing range proof protocols suffer from issues such as high communication overhead and computational complexity. Therefore, this paper introduces an efficient and secure Zero-Knowledge Set Membership Proof Protocol (ZSMPP) to address these challenges. Building upon improvements to the proof structure of range proof protocols, the paper integrates the SM2 identity-based digital signature algorithm, effectively avoiding the time-consuming bilinear pairing operations and reducing computational costs. The proposed protocol offers an efficient and secure solution for the given problem. Experimental results demonstrate that, compared to protocols proposed by Bootle, Deng, Mao, and others, the protocol presented in this paper exhibits superior computational efficiency, providing an efficient and secure solution for data security and individual privacy protection in the digital age. © 2024 ACM.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

An Evaluation System for Large Language Models based on Open-Ended Questions 11

An Evaluation System for Large Language Models based on Open...

引用

11th IEEE International Conference on Cyber Security and Cloud Computing, CSCloud 2024

作者： Cao, Zhiyuan Ma, Zeyu Chen, Mingang Computer and Information Engineering College Shanghai Polytechnic University Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai Development Center of Computer Software Technology Shanghai China Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai Development Center of Computer software Technology Mathematical and Science College Shanghai Normal University Shanghai China Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai Development Center of Computer software Technology Shanghai China

ISBN: (纸本)9798350376982

We designed a large language model evaluation system based on open-ended questions. The system accomplished multidimensional evaluation of LLMs using open-ended questions, and it presented evaluation results with evaluation reports. Currently, the evaluation of large-scale language models often exists with two prominent limitations: (1) The evaluation methods are often single-minded, resulting in less credible results. (2) Most evaluations are based on datasets with closed-ended questions, treating generative large language models as discriminative models, which fails to adequately reflect the high output flexibility characteristic of these models. For these two limitations, we proposed an evaluation system for LLMs based on open-ended questions. Our experiments on the adapted open-source datasets demonstrated the effectiveness of this system. © 2024 IEEE.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

An effective fault localization approach for Verilog based on enhanced contexts

引用

Frontiers of Computer Science 2024年第5期18卷 223-225页

作者： Zhuo ZHANG Ya LI Lei XIA Jianxin XUE Jiang WU Xiaoguang MAO School of Computer Science and Engineering Xi'an University of TechnologyXi'an 710048China Ningbo Artificial Intelligence Institute Shanghai Jiao Tong UniversityNingbo 315000China No.83 Army Joint and Truma Disease Treatment Centre of PLA Xinxiang 453000China Department of Software Engineering Shanghai Second Polytechnic UniversityShanghai 201209China College of Computer National University of Defense TechnologyChangsha 410073China

New computer architecture innovationswith diverse functionalities and comprehensive features continue to emerge incessantly,resulting in a rising trend of incorporating a larger number of circuit devices into these products[1].In the case of a sophisticated and expansive integrated circuit chip,the presence of defective or malfunctioning components can significantly impact the overall performance of the *** situation may even result in costly repercussions.

关键词： Verilog computer circuit.

来源：评论

学校读者我要写书评

暂无评论

Computer-Vision-Based Non-Contact Paste Concentration Measurement*

Computer-Vision-Based Non-Contact Paste Concentration Measur...

引用

2024 International Conference on Automation in Manufacturing, Transportation and Logistics, ICaMaL 2024

作者： Liang, Tailin Yuan, Zhaolin School of Computer Science and Engineering Beihang University State Key Laboratory of Software Development Environment Beijing China Research Institute of Advanced Manufacturing Hong Kong Polytechnic University Department of Industrial and Systems Engineering Hong Kong Hong Kong

ISBN: (纸本)9798350378658

For monitoring the paste concentration, existing techniques, such as ultrasonic concentration meters and neutron meters, suffer from radiation hazards and low precision in high concentrations. This paper proposes a novel non-contact concentration measurement method based on deep learning. With the dataset collected by preparing the paste with different concentrations and taking photographs from the paste surface, a convolutional neural network is trained to extract the features from images and predict the concentration. The experiments indicate that the measurement accuracy is close to 88.79 % for the manual stirring paste dataset and 91.42 % for the automatic stirring paste dataset, which are sufficient in industrial applications. As a substitution of traditional concentration measurement instruments, the proposed vision-based concentration measurement method is non-contact and its accuracy is sufficient in industrial applications. © 2024 IEEE.

关键词： Radiation hazards

来源：评论

学校读者我要写书评

暂无评论

A Scheme Library-Based Ant Colony Optimization with 2-Opt Local Search for Dynamic Traveling Salesman Problem

引用

Computer Modeling in engineering & Sciences 2023年第5期135卷 1209-1228页

作者： Chuan Wang Ruoyu Zhu Yi Jiang Weili Liu Sang-Woon Jeon Lin Sun Hua Wang College of Software Henan Normal UniversityXinxiang453007China College of Computer and Information Engineering Henan Normal UniversityXinxiang453007China School of Computer Science and Engineering South China University of TechnologyGuangzhou510006China School of Computer Science Guangdong Polytechnic Normal UniversityGuangzhou510665China Department of Military Information Engineering Hanyang UniversityAnsan15588South Korea College of Engineering and Science Institute for Sustainable Industries and Liveable CitiesVictoria UniversityMelbourneVIC 8001Australia

The dynamic traveling salesman problem(DTSP)is significant in logistics distribution in real-world applications in smart cities,but it is uncertain and difficult to *** paper proposes a scheme library-based ant colony optimization(ACO)with a two-optimization(2-opt)strategy to solve the DTSP *** work is novel and contributes to three aspects:problemmodel,optimization framework,and ***,in the problem model,traditional DTSP models often consider the change of travel distance between two nodes over time,while this paper focuses on a special DTSP model in that the node locations change dynamically over ***,in the optimization framework,the ACO algorithm is carried out in an offline optimization and online application framework to efficiently reuse the historical information to help fast respond to the dynamic *** framework of offline optimization and online application is proposed due to the fact that the environmental change inDTSPis caused by the change of node location,and therefore the newenvironment is somehowsimilar to certain previous *** way,in the offline optimization,the solutions for possible environmental changes are optimized in advance,and are stored in a mode scheme *** the online application,when an environmental change is detected,the candidate solutions stored in the mode scheme library are reused via ACO to improve search efficiency and reduce computational ***,in the algorithm design,the ACO cooperates with the 2-opt strategy to enhance search *** evaluate the performance of ACO with 2-opt,we design two challenging DTSP cases with up to 200 and 1379 nodes and compare them with other ACO and genetic *** experimental results show that ACO with 2-opt can solve the DTSPs effectively.

关键词： Dynamic traveling salesman problem(DTSP) offline optimization and online application ant colony optimization(ACO) two-optimization(2-opt)strategy

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Search Method for Accelerating Convolutional Neural Architecture Search 23

A Hybrid Search Method for Accelerating Convolutional Neural...

引用

15th International Conference on Machine Learning and Computing, ICMLC 2023

作者： Xun, Zhou Songbai, Liu Ka-Chun, Wong Qiuzhen, Lin Kaychen, Tan The Department of Computer Science City University of Hong Kong Hong Kong College of Computer Science and Software Engineering Shenzhen University KA-CHun Wong China College of Computer Science and Software Engineering Shenzhen University China The Department of Computing The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781450398411

The performance evaluation of candidate architectures is a key step in evolution-based neural architecture search (ENAS). Generally, high-fidelity evaluation is desired for finding the optimal architecture but suffers from expensive computational cost while low-fidelity evaluation can reduce search cost but may influence the search performance. In this work, a hybrid search method, HybridNAS, is proposed by synergizing these two evaluation strategies to improve the search effectiveness of ENAS. This method consists of two stages: global exploration and local exploitation. The former applies low-fidelity evaluation to explore the promising architectures efficiently. As for the latter, it exploits the most promising ones identified by the former to generate the better-performancing architectures. Those two stages are iteratively repeated toward the optimal architecture. Extensive experiments on NAS-Bench-101 and NAS-Bench-201 reflect that HybridNAS can achieve comparable accuracy compared to existing popular NAS but at the expense of only 60%-80% computational cost. © 2023 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：