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

13th International Conference on Information Technology in Asia, CITA 2023

作者： Abdulsalam, Nana Hauwa Muhammad, Sufri Mohamed, Raihani Universiti Putra Malaysia Department of Software Engineering and Information System Selangor Serdang43400 Malaysia Universiti Putra Malaysia Department of Computer Science Selangor Serdang43400 Malaysia

ISBN: (纸本)9798350326208

Technology has increased the interest and demand for pervasive systems which require contextual information to function at optimal capacity. There have been numbers of research in context-aware systems that has limited focused on the semantic-based approach in the crowdsourcing domain. Thus, it promotes challenges in the context and service acquisition and representation for reasoning control mechanism. This paper aims to review semantic-based reasoning framework with a focus on the mobile crowdsourcing domain. Different domains acquire different contextual information, either extrinsic or intrinsic. The review of the frameworks has help to formulate a process framework that applied semantic approach that has the important component for context-aware reasoning process. The framework can be used in the context-aware mobile crowdsourcing domain or can be generalized to other domain to aid reasoning control. Its advantage over other crowdsourcing frameworks which is focuses not only on context and service acquisition but also the representation on the acquired information. © 2023 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Multiobjective Feature Selection Assisted by Unselected Features 13

Evolutionary Multiobjective Feature Selection Assisted by Un...

引用

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

来源：评论

学校读者我要写书评

暂无评论

K-Banhatti Sombor Invariants of Certain computer Networks

引用

computers, Materials & Continua 2022年第10期73卷 15-31页

作者： Khalid Hamid Muhammad Waseem Iqbal Abaid Ur Rehman Virk Muhammad Usman Ashraf Ahmed Mohammed Alghamdi Adel A.Bahaddad Khalid Ali Almarhabi Department of Computer Science Superior UniversityLahore54000Pakistan Department of Software Engineering Superior UniversityLahore54000Pakistan Department of Mathematics University of SialkotSialkot51013Pakistan Department of Computer Science GC Women UniversitySialkot53310Pakistan Department of Software Engineering College of Computer Science and EngineeringUniversity of Jeddah21493Saudi Arabia Department of Information System Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of Computer Science College of Computing in Al-QunfudahUmm Al-Qura UniversityMakkah24381Saudi Arabia

Any number that can be uniquely determined by a graph is called a graph *** the last twenty years’countless mathematical graph invariants have been characterized and utilized for correlation ***,no reliable examination has been embraced to decide,how much these invariants are related with a network graph or molecular *** this paper,it will discuss three different variants of bridge networks with good potential of prediction in the field of computer science,mathematics,chemistry,pharmacy,informatics and biology in context with physical and chemical structures and networks,because k-banhatti sombor invariants are freshly presented and have numerous prediction qualities for different variants of bridge graphs or *** study solved the topology of a bridge graph/networks of three different types with two invariants KBanhatti Sombor Indices and its reduced *** deduced results can be used for the modeling of computer networks like Local area network(LAN),Metropolitan area network(MAN),and Wide area network(WAN),backbone of internet and other networks/structures of computers,power generation,bio-informatics and chemical compounds synthesis.

关键词： Bridge networks invariants k-banhatti sombor indices maple network graph molecular graph

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Graph-Based AU Relationship Learning for Facial Action Unit Detection

Spatial-Temporal Graph-Based AU Relationship Learning for Fa...

引用

2023 IEEE/CVF Conference on computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Wang, Zihan Song, Siyang Luo, Cheng Zhou, Yuzhi Wu, Shiling Xie, Weicheng Shen, Linlin Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology China University of Leicester School of Computing and Mathematical Sciences United Kingdom

ISBN: (纸本)9798350302493

This paper presents our Facial Action Units (AUs) detection submission to the fifth Affective Behavior Analysis in-the-wild Competition (ABAW). Our approach consists of three main modules: (i) a pre-trained facial representation encoder which produce a strong facial representation from each input face image in the input sequence;(ii) an AU-specific feature generator that specifically learns a set of AU features from each facial representation;and (iii) a spatio-temporal graph learning module that constructs a spatio-temporal graph representation. This graph representation describes AUs contained in all frames and predicts the occurrence of each AU based on both the modeled spatial information within the corresponding face and the learned temporal dynamics among frames. The experimental results show that our approach outperformed the baseline and the spatio-temporal graph representation learning allows our model to generate the best results among all ablated systems. Our model ranks at the 4th place in the AU recognition track at the 5th ABAW Competition. Our code is publicly available at https://***/wzh125/ABAW-5. © 2023 IEEE.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of computer science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

SWPFOPLD: A Profiling and Optimizing Loader for SW26010Pro Processors 8

SWPFOPLD: A Profiling and Optimizing Loader for SW26010Pro P...

引用

8th International Conference on computer and Communication systems, ICCCS 2023

作者： Qian, Hong Wu, Wei Zhu, Qi Wang, Fei Zhao, Jinwei Zheng, Yan School of Computer Science and Technology University of Science and Technology of China Hefei China Jiangnan Institute of Computing Technology System Software Research Department Wuxi China Tsinghua University Department of Computer Science and Technology Beijing China National Research Center of Parallel Computer Engineering and Technology Beijing China

ISBN: (纸本)9781665456128

The Sunway family supercomputers have achieved a series of remarkable achievements. However, the toolchains provided by them are not perfect, which has brought great challenges to the development of high-performance application software. In this paper, a profiling and optimizing tool is proposed to assist people to analyze and optimize the performance of their programs. SWPFOPLD is independent of the application program and gathers the runtime performance data through the PMUs, an automatically hot functions rearrange optimization based on the performance data is furtherly accomplished. The evaluation shows that SWPFOPLD can be easily and effectively used to analyze and optimize the performance of the application programs. © 2023 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion 38

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent D...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RSP-gcForest: A Distributed Deep Forest via Random Sample Partition

RSP-gcForest: A Distributed Deep Forest via Random Sample Pa...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Li, Mark Junjie Cai, Wenzhu Lin, Yigang Huang, Sunjie Huang, Joshua Zhexue Peng, Patrick Xiaogang Shenzhen University College of Computer Science and Software Engineering Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Shenzhen Academy of Inspection and Quarantine China

ISBN: (纸本)9798350324457

Deep Forest, a powerful alternative to deep neural networks, has gained much attention due to its advantages, such as low complexity, minimal hyperparameter requirements, and strong application performance. In the current big data environment, where data volumes and model complexities are growing rapidly, distributed computing is needed to increase computational efficiency. Recently, a distributed deep forest approach, called BLB-gcForest (Bag of Little Bootstraps-gcForest), has been successful in reducing training instances within cascade forests, combining BLB and granularity segmentation, thus improving the computational efficiency and scalability of distributed deep forests. However, it still transmits the entire data set between layers and requires double sampling with BLB, limiting the amount of data and the scalability of resource utilization. This paper introduces a novel algorithm, RSP-gcForest, based on Random Sample Partition (RSP) to improve distributed deep forests computational efficiency and scalability. RSP-gcForest uses block-level samples that replace the full dataset, significantly reducing interlayer instance transmission and prediction within cascade forests. Additionally, RSP blocks are integrated with the segmentation granularity of cascade forests for ensemble learning, effectively addressing computational efficiency and resource constraints. We conducted experiments on four extensive datasets using Spark and evaluated performance across five key metrics. The results clearly show that RSP-gcForest, while maintaining high classification quality, surpasses state-of-the-art methods in terms of computational efficiency and resource utilization. Furthermore, it achieves superior load balancing, demonstrating its potential as a powerful tool in big data and distributed computing. © 2023 IEEE.

关键词： Deep forest Distributed Computing Ensemble Learning Random Sample Partition

来源：评论

学校读者我要写书评

暂无评论

Ant: An Efficient Lossless Compression Algorithm for IoT Time Series Data 21

Ant: An Efficient Lossless Compression Algorithm for IoT Tim...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Li, Junhui Xu, Guangping Yang, Hongzhang Wu, Yulei Tianjin University of Technology School of Computer Science and Engineering Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China University of Bristol Faculty of Science and Engineering Bristol United Kingdom

ISBN: (纸本)9798350329223

In various applications in Internet of Things like industrial monitoring, large amounts of floating-point time series data are generated at an unprecedented rate. Efficient compression algorithms can effectively reduce the size of data, enhance transmission performance and storage efficiency, and simultaneously lower storage costs. Therefore, there is a need for lightweight and efficient stream compression algorithms. In this paper, we propose a novel lossless floating-point data compression algorithm called Ant. The main idea is to encode double-precision floating-point numbers into integer form, calculate the delta between adjacent values, and then convert the delta into unsigned integers. This encoding method effectively reduces storage costs and improves data compression efficiency. Extensive experiments on real-world datasets demonstrate that our algorithm achieves compression speeds at least as fast as state-of-the-art streaming methods, and a 63% relative improvement in average compression rate. © 2023 IEEE.

关键词： Storage efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：