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

Towards Context-aware Support for Color Vision Deficiency: An Approach Integrating LLM and AR

学校读者我要写书评

暂无评论

Towards Context-aware Support for Color Vision Deficiency: A...

IEEE Global Conference on Consumer Electronics (GCCE)

作者： Shogo Morita Yan Zhang Takuto Yamauchi Sinan Chen Jialong Li Kenji Tei School of Computing Tokyo Institute of Technology Tokyo Japan International Research Center for Neurointelligence University of Tokyo Tokyo Japan Department of Computer Science and Engineering Waseda University Tokyo Japan Center of Mathematical and Data Sciences Kobe University Kobe Japan

ISBN: (数字)9798350355079

ISBN: (纸本)9798350355086

People with color vision deficiency often face challenges in distinguishing colors such as red and green, which can complicate daily tasks and require the use of assistive tools or environmental adjustments. Current support tools mainly focus on presentation-based aids, like the color vision modes found in iPhone accessibility settings. However, offering context-aware support, like indicating the doneness of meat, remains a challenge since task-specific solutions are not cost-effective for all possible scenarios. To address this, our paper proposes an application that provides contextual and autonomous assistance. This application is mainly composed of: (i) an augmented reality interface that efficiently captures context; and (ii) a multi-modal large language model-based reasoner that serves to cognitize the context and then reason about the appropriate support contents. Preliminary user experiments with two color vision deficient users across five different scenarios have demonstrated the effectiveness and universality of our application.

关键词： Green products Color Faces Consumer electronics Augmented reality Context modeling

Efficient Meta Neural Heuristic for Multi-Objective Combinatorial Optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Jinbiao Wang, Jiahai Zhang, Zizhen Cao, Zhiguang Ye, Te Chen, Siyuan School of Computer Science and Engineering Sun Yat-sen University China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Sun Yat-sen University China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China School of Computing and Information Systems Singapore Management University Singapore

Recently, neural heuristics based on deep reinforcement learning have exhibited promise in solving multi-objective combinatorial optimization problems (MOCOPs). However, they are still struggling to achieve high learning efficiency and solution quality. To tackle this issue, we propose an efficient meta neural heuristic (EMNH), in which a meta-model is first trained and then fine-tuned with a few steps to solve corresponding single-objective subproblems. Specifically, for the training process, a (partial) architecture-shared multi-task model is leveraged to achieve parallel learning for the meta-model, so as to speed up the training;meanwhile, a scaled symmetric sampling method with respect to the weight vectors is designed to stabilize the training. For the fine-tuning process, an efficient hierarchical method is proposed to systematically tackle all the subproblems. Experimental results on the multi-objective traveling salesman problem (MOTSP), multi-objective capacitated vehicle routing problem (MOCVRP), and multi-objective knapsack problem (MOKP) show that, EMNH is able to outperform the state-of-the-art neural heuristics in terms of solution quality and learning efficiency, and yield competitive solutions to the strong traditional heuristics while consuming much shorter time. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

Graph Neural Networks for Wireless Networks: Graph Representation, Architecture and Evaluation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Lu, Yang Li, Yuhang Zhang, Ruichen Chen, Wei Ai, Bo Niyato, Dusit School of Computer and Technology China Collaborative Innovation Center of Railway Traffic Safety Beijing Jiaotong University Beijing100044 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China

Graph neural networks (GNNs) have been regarded as the basic model to facilitate deep learning (DL) to revolutionize resource allocation in wireless networks. GNN-based models are shown to be able to learn the structural information about graphs representing the wireless networks to adapt to the time-varying channel state information and dynamics of network topology. This article aims to provide a comprehensive overview of applying GNNs to optimize wireless networks via answering three fundamental questions, i.e., how to input the system parameters of wireless networks into GNNs, how to improve the expressive performance of GNNs, and how to evaluate GNNs. Particularly, two graph representations are given to transform wireless network parameters into graph-structured data. Then, we focus on the architecture design of the GNN-based models via introducing the basic message passing as well as model improvement methods including multi-head attention mechanism and residual structure. At last, we give task-oriented evaluation metrics for DL-enabled wireless resource allocation schemes. We also highlight certain challenges and potential research directions for the application of GNNs in wireless networks. © 2024, CC BY.

关键词： Graph neural networks

Enhancing Cloud Image Retrieval Efficiency through Secure Optimization

学校读者我要写书评

暂无评论

Enhancing Cloud Image Retrieval Efficiency through Secure Op...

Knowledge engineering and Communication Systems (ICKECS), International Conference on

作者： N. BalaKrishna M. Sakthivel G.Sai Ushasri J.Naga Thanmai K.Bharath Kumar G.Venkaiah Swamy Department of AI/ML School of Computing Mohan Babu University Data science Tirupati AndhraPradesh India Department of Artificial Intelligence Sri Shanmugha College of Engineering and Technology Sankari Salem Tamilnadu India Department of CSE Sree Sree Vidyanikethan Engineering college Tirupati Andhra pradesh India

ISBN: (数字)9798350359688

ISBN: (纸本)9798350359695

There is a growing trend of using public clouds for image search outsourcing. However, privacy issues arise when image datasets are directly outsourced to untrusted clouds. Recently, a number of secure image retrieval techniques have been put forth. Nevertheless, the majority of them demand input from image owners in order to create secure indexes, wasting a significant amount of their computational power. Numerous approaches are put forth to address this issue; however, their search accuracy is poor when applied to large datasets. We present the first secure image retrieval scheme in this paper that addresses these two issues at the same time to achieve more precise search results. To reduce search time and image owner costs, we allow cloud servers to locally build a reliable hierarchical index graph using the encrypted image features. Moreover, parallel construction and updating of the secure index is possible. We offer a security analysis of the suggested plan.

关键词： Cloud computing Accuracy Image retrieval Market research Vectors Encryption Outsourcing

Monge-Ampere Regularization for Learning Arbitrary Shapes from Point Clouds

学校读者我要写书评

暂无评论

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年

作者： Yang, Chuanxiang Zhou, Yuanfeng Wei, Guangshun Ma, Long Hou, Junhui Liu, Yuan Wang, Wenping The School of Software Shandong University Jinan250100 China The Department of Computer Science City University of Hong Kong Hong Kong The College of Computing and Data Science Nanyang Technological University Singapore The Department of Computer Science and Engineering Texas A&M University College StationTX77843 United States

As commonly used implicit geometry representations, the signed distance function (SDF) is limited to modeling watertight shapes, while the unsigned distance function (UDF) is capable of representing various surfaces. However, its inherent theoretical shortcoming, i.e., the non-differentiability at the zero-level set, would result in sub-optimal reconstruction quality. In this paper, we propose the scaled-squared distance function (S2DF), a novel implicit surface representation for modeling arbitrary surface types. S2DF does not distinguish between inside and outside regions while effectively addressing the non-differentiability issue of UDF at the zero-level set. We demonstrate that S2DF satisfies a second-order partial differential equation of Monge-Ampere-type, allowing us to develop a learning pipeline that leverages a novel Monge-Ampere regularization to directly learn S2DF from raw unoriented point clouds without supervision from ground-truth S2DF values. Extensive experiments across multiple datasets show that our method significantly outperforms state-of-the-art supervised approaches that require ground-truth surface information as supervision for training. The code will be publicly available at https://***/chuanxiang-yang/S2DF. © 2025 IEEE. All rights reserved.

关键词： Supervised learning

Toward Democratized Generative AI in Next-Generation Mobile Edge Networks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Ruichen He, Jiayi Luo, Xiaofeng Niyato, Dusit Kang, Jiawen Xiong, Zehui Li, Yonghui Sikdar, Biplab The College of Computing and Data Science Nanyang Technological University Singapore The School of Automation Guangdong University of Technology Guangzhou510006 China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The School of Electrical and Information Engineering University of Sydney SydneyNSW2006 Australia The Department of Electrical and Computer Engineering College of Design and Engineering National University of Singapore Singapore

The rapid development of generative AI technologies, including large language models (LLMs), has brought transformative changes to various fields. However, deploying such advanced models on mobile and edge devices remains challenging due to their high computational, memory, communication, and energy requirements. To address these challenges, we propose a model-centric framework for democratizing generative AI deployment on mobile and edge networks. First, we comprehensively review key compact model strategies, such as quantization, model pruning, and knowledge distillation, and present key performance metrics to optimize generative AI for mobile deployment. Next, we provide a focused review of mobile and edge networks, emphasizing the specific challenges and requirements of these environments. We further conduct a case study demonstrating the effectiveness of these strategies by deploying LLMs on real mobile edge devices. Experimental results highlight the practicality of democratized LLMs, with significant improvements in generalization accuracy, hallucination rate, accessibility, and resource consumption. Finally, we discuss potential research directions to further advance the deployment of generative AI in resource-constrained environments. © 2024, CC BY.

关键词： Generative adversarial networks

Curvature Graph Generative Adversarial Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Jianxin Fu, Xingcheng Sun, Qingyun Ji, Cheng Tan, Jiajun Wu, Jia Peng, Hao Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China School of Computer Science and Engineering Beihang University Beijing100191 China School of Computing Macquarie University Sydney Australia

Generative adversarial network (GAN) is widely used for generalized and robust learning on graph data. However, for non-Euclidean graph data, the existing GAN-based graph representation methods generate negative samples by random walk or traverse in discrete space, leading to the information loss of topological properties (e.g. hierarchy and circularity). Moreover, due to the topological heterogeneity (i.e., different densities across the graph structure) of graph data, they suffer from serious topological distortion problems. In this paper, we proposed a novel Curvature Graph Generative Adversarial Networks method, named CurvGAN, which is the first GAN-based graph representation method in the Riemannian geometric manifold. To better preserve the topological properties, we approximate the discrete structure as a continuous Riemannian geometric manifold and generate negative samples efficiently from the wrapped normal distribution. To deal with the topological heterogeneity, we leverage the Ricci curvature for local structures with different topological properties, obtaining to low-distortion representations. Extensive experiments show that CurvGAN consistently and significantly outperforms the state-of-the-art methods across multiple tasks and shows superior robustness and generalization. Copyright © 2022, The Authors. All rights reserved.

关键词： Generative adversarial networks

Contamination-resilient anomaly detection via adversarial learning on partially-observed normal and anomalous data 24

学校读者我要写书评

暂无评论

Contamination-resilient anomaly detection via adversarial le...

Proceedings of the 41st International Conference on Machine Learning

作者： Wenxi Lv Qinliang Su Hai Wan Hongteng Xu Wenchao Xu School of Computer Science and Engineering Sun Yat-sen University Guangzhou China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Gaoling School of Artifical Intelligence Renmin University of China Beijing China Department of Computing The Hong Kong Polytechnic University Hong Kong SAR

Many existing anomaly detection methods assume the availability of a large-scale normal dataset. But for many applications, limited by resources, removing all anomalous samples from a large unlabeled dataset is unrealistic, resulting in contaminated datasets. To detect anomalies accurately under such scenarios, from the probabilistic perspective, the key question becomes how to learn the normal-data distribution from a contaminated dataset. To this end, we propose to collect two additional small datasets that are comprised of partially-observed normal and anomaly samples, and then use them to help learn the distribution under an adversarial learning scheme. We prove that under some mild conditions, the proposed method is able to learn the correct normal-data distribution. Then, we consider the overfitting issue caused by the small size of the two additional datasets, and a correctness-guaranteed flipping mechanism is further developed to alleviate it. Theoretical results under incomplete observed anomaly types are also presented. Extensive experimental results demonstrate that our method outperforms representative baselines when detecting anomalies under contaminated datasets.

关键词：

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado SpringsCO United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China JinYinHu Laboratory Wuhan China

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter-Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulnerability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. Copyright © 2024, The Authors. All rights reserved.

关键词： Open source software