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

28th International Conference on Database systems for Advanced Applications, DASFAA 2023

作者： Chen, Junyang Fan, Ge Gong, Zhiguo Li, Xueliang Leung, Victor C. M. Wang, Mengzhu Yang, Ming College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen China Tencent Inc. Shenzhen China State Key Laboratory of Internet of Things for Smart City Department of Computer Information Science University of Macau China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9783031306716

User-generated content is daily produced in social media, as such user interest summarization is critical to distill salient information from massive information. While the interested messages (e.g., tags or posts) from a single user are usually sparse becoming a bottleneck for existing methods, we propose a topic-aware graph-based neural interest summarization method (UGraphNet), enhancing user semantic mining by unearthing potential user relations and jointly learning the latent topic representations of posts that facilitates user interest learning. Experiments on two datasets collected from well-known social media platforms demonstrate the superior performance of our model in the tasks of user interest summarization and item recommendation. Further discussions also show that exploiting the latent topic representations and user relations are conductive to the user automatic language understanding. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

A Memetic Algorithm Based Feature Weighting for Metabolomics Data Classification

引用

Chinese Journal of Electronics 2025年第4期23卷 706-711页

作者： Jiarui Zhou Zexuan Zhu Zhen Ji College of Biomedical Engineering and Instrument Science Zhejiang University Hangzhou China Shenzhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen China

A metaheuristic chain based memetic algorithm namely MCMA is proposed for the classification of metabolomics data. MCMA regards both global evolution and local search as equivalent elemental metaheuristics, and searches with a chain of metaheuristics performed alternatively on the target problem. A hidden Markov model based scheduling mechanism is employed in MCMA for the selection of metaheuristics. By using MCMA for optimizing the linkage weight vector, a feature weighting algorithm for metabolomics data is formed to identify relevant metabolite features and reveal their exact relationships with the given physiological states. An extreme learning machine based classifier is utilized in predicting the physiological states according to the weighted metabolite features. Experimental results on real metabolomics data of clinical liver transplantation demonstrate that the proposed feature weighting and classification method obtains better performance than the other compared algorithms.

关键词： Memetics Metabolomics Metaheuristics Urban areas Liver Prediction algorithms Search problems Physiology Vectors Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

BAT: Mining Binary-API Topic for Multi-service Application Development 26

BAT: Mining Binary-API Topic for Multi-service Application D...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： He, Pengfei Liu, Linlin You, Dianlong Shen, Limin Chen, Zhen Yanshan University School of Information Science and Engineering Qinhuangdao China Chinese Academy of Sciences National Science Libraries Beijing China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

ISBN: (纸本)9798350331684

With the growing popularity of API-driven multiservice application (mashup) development, the burgeoning web APIs have left developers drowning in the sea of web API selections. Matching developers with the most appropriate APIs is the key to improving user satisfaction and promoting more popular web applications. As a result, more and more researchers pay attention to web API recommender systems based on collaborative filtering. However, employing collaborative filtering to recommend APIs is challenging due to the severe sparsity of mashup and API interactions. To address this problem, we propose a probabilistic generative model, called the Binary-API Topic model (BAT), to parameterize mashups and APIs. Technically, BAT is equipped with a mechanism to extract binary-APIs and predict unknown pairwise interactions. To improve generality and capture more relevance from a limited number of interactions, we learn binary-API topics by directly modeling the generation of API co-occurrence patterns across the repository (all mashup collections from ***). The main advantage of BAT is that it preserves API co-occurrence patterns in model learning and exploits the rich global relevance. Finally, through extensive experiments, we demonstrate that BAT can achieve the highest performance on the sparse real-world data set. © 2023 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

A Survey on Indoor Visible Light Positioning systems: Fundamentals, Applications, and Challenges

引用

IEEE Communications Surveys and Tutorials 2024年第3期27卷 1656-1686页

作者： Zhu, Zhiyu Yang, Yang Chen, Mingzhe Guo, Caili Cheng, Julian Cui, Shuguang Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering and Institute for Data Science and Computing Coral GablesFL33146 United States Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China The University of British Columbia Faculty of Applied Science School of Engineering KelownaBCV1V 1V7 Canada 518172 Hong Kong

The growing demand for location-based services in areas like virtual reality, robot control, and navigation has intensified the focus on indoor localization. Visible light positioning (VLP), leveraging visible light communications (VLC), becomes a promising indoor positioning technology due to its high accuracy and low cost. This paper provides a comprehensive survey of VLP systems. In particular, since VLC lays the foundation for VLP, we first present a detailed overview of the principles of VLC. Then, we provide an in-depth overview of VLP algorithms. The performance of each positioning algorithm is also compared in terms of various metrics such as accuracy, coverage, and orientation limitation. Beyond the physical layer studies, the network design for a VLP system is also investigated, including multi-access technologies, resource allocation, and light-emitting diode (LED) placements. Next, the applications of the VLP systems are overviewed. Finally, this paper outlines open issues, challenges, and opportunities for the research field. In a nutshell, this paper constitutes the first holistic survey on VLP from state-of-the-art studies to practical uses. © 1998-2012 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A Coarse to Fine Detection Method for Prohibited Object in X-ray Images Based on Progressive Transformer Decoder 24

A Coarse to Fine Detection Method for Prohibited Object in X...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Ma, Chunjie Du, Lina Gao, Zan Zhuo, Li Wang, Meng Shandong Jinan China School of Computer Science and Technology Shandong Jianzhu University Shandong Jinan China Faculty of Information Technology Beijing University Of Technology Beijing China School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin300384 China

ISBN: (纸本)9798400706868

Currently, Transformer-based prohibited object detection methods in X-ray images appear constantly, but there are still some shortcomings such as poor performance and high computational complexity for prohibited object detection with heavily occlusion. Therefore, a coarse to fine detection method for prohibited object in X-ray images based on progressive Transformer decoder is proposed in this paper. Firstly, a coarse to fine framework is proposed, which includes two stages: coarse detection and fine detection. Through adaptive inference in stages, the computational efficiency of the model is effectively improved. Then, a position and class object queries method is proposed, which improves the convergence speed and detection accuracy of the model by fusing the position and class information of prohibited object with object queries. Finally, a progressive Transformer decoder is proposed, which distinguishes high and low score queries by decreasing confidence thresholds, so that high-score queries are not affected by low-score queries in the decoding stage, and the model can focus more on decoding low-score queries, which usually correspond to prohibited object with severe occlusion. The experimental results on three public benchmark datasets (SIXray, OPIXray, HiXray) demonstrate that compared with the baseline DETR, the proposed method achieves the state-of-the-art detection accuracy with a 21.6% reduction in model computational complexity. Especially for prohibited objects with heavily occlusion, accurate detection can be carried out. © 2024 ACM.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Pricing Policy for a Dynamic Spectrum Allocation Scheme with Batch Requests and Impatient Packets in Cognitive Radio Networks

引用

Journal of systems science and systems engineering 2022年第2期31卷 133-149页

作者： Haixing Wu Shunfu Jin Wuyi Yue School of Information Science and Engineering Yanshan UniversityQinhuangdao 066004China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan UniversityQinhuangdao 066004China Department of Intelligence and Informatics Konan UniversityKobe 658-8501Japan

In cognitive radio networks(CRNs),multiple secondary users may send out requests simultaneously and one secondary user may send out multiple requests at one time,i.e.,request arrivals usually show an aggregate ***,a secondary user packet waiting in the buffer may leave the system due to impatience before it is transmitted,and this impatient behavior inevitably has an impact on the system *** to investigate the influence of the aggregate behavior of requests and the likelihood of impatience on a dynamic spectrum allocation scheme in CRNs,in this paper a batch arrival queueing model with possible reneging and potential transmission interruption is *** constructing a Markov chain and presenting a transition rate matrix,the steady-state distribution of the queueing model along with a dynamic spectrum allocation scheme is derived to analyze the stochastic behavior of the ***,some important performance measures such as the loss rate,the balk rate and the average delay of secondary user packets are ***,system experiments are carried out to show the change trends of the performance measures with respect to batch arrival rates of secondary user packets for different impatience parameters,different batch sizes of secondary user packets,and different arrival rates of primary user ***,a pricing policy for secondary users is presented and the dynamic spectrum allocation scheme is socially optimized.

关键词： Cognitive radio networks dynamic spectrum scheme batch arrival impatient packets Markov chain social optimization

来源：评论

学校读者我要写书评

暂无评论

Vulnerability Detection Based on Adapter Tuning and Enhanced Feature Learning 36

Vulnerability Detection Based on Adapter Tuning and Enhanced...

引用

36th International Conference on Software engineering and Knowledge engineering, SEKE 2024

作者： Luo, Hui Lu, Lu Liang, Zhihong Suo, Siliang School of Computer Science and Engineering South China University of Technology Guangzhou China Pazhou Laboratory Guangzhou China PengCheng Laboratory Shenzhen China Electric Power Research Institute CSG Guangdong Guangzhou China Guangdong Provincial Key Laboratory of Power System Network Security Guangdong Guangzhou China

ISBN: (纸本)1891706594

Pre-trained code models have achieved promising results in the vulnerability detection field. The prevailing approach is to adapt these models with vulnerability datasets using inefficient full-model fine-tuning. These pre-trained models primarily capture the semantic features of code, while neglecting its structural characteristics. To address these issues, this paper proposes a vulnerability detection method with adapter tuning and enhanced feature learning. First, adapter modules are introduced to UniXcoder and tune only the parameters in the adapters to extract semantic features. This significantly reduces the number of training parameters and better adapts the model to downstream tasks. Then, structural features, including control and data flow information, are extracted from the Program Dependence Graph (PDG) to compensate for the limitations of pre-trained models that rely solely on semantic features. Finally, the semantic and structural features are integrated to train the detection model. The experimental results demonstrate that our proposed method outperforms state-of-the-art approaches and is highly efficient in terms of both training parameters and training data. © 2024 Knowledge systems Institute Graduate School. All rights reserved.

关键词： Data flow graphs

来源：评论

学校读者我要写书评

暂无评论

From laboratory to Field:Unsupervised Domain Adaptation for Plant Disease Recognition in the Wild

引用

Plant Phenomics 2023年第2期5卷 195-208页

作者： Xinlu Wu Xijian Fan Peng Luo Sruti Das Choudhury Tardi Tjahjadi Chunhua Hu College of Information Science and Technology Nanjing Forestry UniversityNanjing 210037China Institute of Forest Resource Information Techniques Chinese Academy of ForestryBeijing 100091China Key Laboratory of Forestry Remote Sensing and Information System National Forestry and Grassland AdministrationBeijing 100091China Department of Computer Science and Engineering University of Nebraska-LincolnLincolnNE 68588USA School of Engineering University of WarwickCoventry CV47ALUK

Plant disease recognition is of vital importance to monitor plant development and predicting crop ***,due to data degradation caused by different conditions of image acquisition,e.g.,laboratory *** environment,machine learning-based recognition models generated within a specific dataset(source domain)tend to lose their validity when generalized to a novel dataset(target domain).To this end,domain adaptation methods can be leveraged for the recognition by learning invariant representations across *** this paper,we aim at addressing the issues of domain shift existing in plant disease recognition and propose a novel unsupervised domain adaptation method via uncertainty regularization,namely,Multi-Representation Subdomain Adaptation Network with Uncertainty Regularization for Cross-Species Plant Disease Classification(MSUN).Our simple but effective MSUN makes a breakthrough in plant disease recognition in the wild by using a large amount of unlabeled data and via nonadversarial ***,MSUN comprises multirepresentation,subdomain adaptation modules and auxiliary uncertainty *** multirepresentation module enables MSUN to learn the overall structure of features and also focus on capturing more details by using the multiple representations of the source *** effectively alleviates the problem of large interdomain *** adaptation is used to capture discriminative properties by addressing the issue of higher interclass similarity and lower intraclass ***,the auxiliary uncertainty regularization effectively suppresses the uncertainty problem due to domain *** was experimentally validated to achieve optimal results on the PlantDoc,Plant-Pathology,Corn-Leaf-Diseases,and Tomato-Leaf-Diseases datasets,with accuracies of 56.06%,72.31%,96.78%,and 50.58%,respectively,surpassing other state-of-the-art domain adaptation techniques considerably.

关键词： Plant breakthrough details

来源：评论

学校读者我要写书评

暂无评论

A Node Confidence Determination Based Moving Target Defense Strategy for SDN 15

A Node Confidence Determination Based Moving Target Defense ...

引用

15th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2023

作者： Sun, Shimin Xu, Guowei Han, Li Tianjin Key Laboratory of Autonomous Intelligent Technology and System School of Software Tiangong Tianjin China Tianjin Univ. of Technol. Natl. Eng. Laboratory for Computer Virus Prevention and Control Technology School of Computer Science and Engineering Tianjin China

ISBN: (纸本)9798350308693

With the rapid development of Internet technology, network assets have become an indispensable part of modern society. Especially in the face of high-value network assets, the attacker is faced with paying a greater cost to study the network structure. Due to the unknown attacker and attack means, the attacker has an advantage in the attack and defense situation. The moving target defense technique can flexibly change the static characteristics of the network attack surface and increase the difficulty for the attacker to detect the network, thus achieving the purpose of enhancing network security. Based on this technique, this paper proposes a defense strategy based on node confidence. It puts forward stricter constraints on the differential selection of address/port hopping paths, dynamically selects the hopping objects according to the node's confidence, and implements the defense strategy of differential complexity. This further increases the network's uncertainty and the difficulty for the attacker to detect the network structure. The experimental results show that in the path differentiation comparison, the maximum improvement is about 18% compared to the Dynamic Random Route Hopping strategy. In the CPU load experiment, the CPU load rate is reduced by about 4.625% on average compared to the Double Address Hopping strategy. Moreover, for larger hopping period, the proposed strategy also performs well in terms of CPU load rate. The proposed strategy also exhibits good performance in terms of CPU load ratio for large hopping cycles. © 2023 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Generation of tunable superchiral spot in metal-insulator-metal waveguide

引用

Chinese Optics Letters 2023年第1期21卷 125-130页

作者：庄涛胡海峰詹其文 School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China Zhangjiang Laboratory Shanghai 201204China Shanghai Key Laboratory of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China

The chiral feature of an optical field can be evaluated by the parameter of g-factor enhancement,which is helpful to enhance chiroptic signals from a chiral *** this work,the superchiral spot has been theoretically proposed in metal-insulator-metal *** g-factor enhancement of the superchiral spot can be enhanced by 67-fold more than that of circularly polarized light,and the spot is confined in the deep wavelength scale along each spatial ***,the position of the superchiral spot can be tuned by manipulating the incident *** tunable superchiral spot may find applications in chiral imaging and sensing.

关键词： circular dichroism superchiral spot radially polarized beam metal-insulator-metal waveguide

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：