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

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Yi, Jinhan Liu, Xin Cheung, Yiu-Ming Xu, Xing Fan, Wentao He, Yi Department of Computer Science and Technology Huaqiao University Xiamen361021 China Xiamen Key Lab. of Computer Vision and Pattern Recognition Fujian Key Lab. of Big Data Intelligence and Security China Department of Computer Science Hong Kong Baptist University Kowloon Hong Kong School of Computer Science and Engineering University of Electronic Science and Technology of China China Provincial Key Laboratory for Computer Information Processing Technology Soochow University China

ISBN: (纸本)9781665438643

Existing cross-modal hashing still faces three challenges: (1) Most batch-based methods are unsuitable for processing large-scale and streaming data. (2) Current online methods often suffer from insufficient semantic association, while lacking flexibility to learn the hash functions for varying streaming data. (3) Existing supervised methods always require much computation time or accumulate large quantization loss to learn hash codes. To address above challenges, we present an efficient Online label Consistent Hashing (OLCH) for cross-modal retrieval, which aims to incrementally learn hash codes for the current arriving data, while updating the hash functions at a streaming manner. To be specific, an online semantic representation learning framework is designed to adaptively preserve the semantic similarity across different modalities, and a mini-batch online gradient descent approach associated with forward-backward splitting is developed to optimize the hash functions. Accordingly, the hash codes are adaptively learned online with the high discriminative capability, while avoiding high computation complexity to process the streaming data. Experimental results show its outstanding performance in comparison with the-state-of-arts. © 2021 IEEE Computer Society. All rights reserved.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Finding Simplex Items in data Streams

Finding Simplex Items in Data Streams

引用

International Conference on data engineering

作者： Zhuochen Fan Jiarui Guo Xiaodong Li Tong Yang Yikai Zhao Yuhan Wu Bin Cui Yanwei Xu Steve Uhlig Gong Zhang School of Computer Science and National Engineering Laboratory for Big Data Analysis Technology and Application Peking University Beijing China Peng Cheng Laboratory Shenzhen China Theory Lab Central Research Institute 2012 Labs Huawei Technologies Co. Ltd. Hong Kong SAR China School of Electronic Engineering and Computer Science Queen Mary University of London London UK

In this paper, we propose a new type of item in data streams, called simplex items. Simplex items have frequencies in consecutive p windows that can be approximated by a polynomial of degree at most k, where k = 0, 1, 2. These low-order representable simplex items have a wide range of potential applications. For example, when k = 1, we can leverage these items whose frequency has obvious linear increase or decrease to speed up the running time of a class of machine learning models and detect network attacks such as distributed denial-of-service (DDoS), etc. To find k-degree simplex items in real time, we propose a novel sketch, namely X-Sketch, to accurately record simplex items in a compact space. The key idea of X-Sketch is to effectively filter out non-simplex items with less memory overhead, and then monitor the remaining potential simplex items and keep those items with more consecutive windows. We conduct extensive experiments, and the experimental results show that the F1 Score of X-Sketch is on average 68.6%, 57.9%, and 42.2% higher than the baseline solution for k = 0, 1, 2, respectively. Finally, we also provide a case study that applies X-Sketch to "accelerate" the two machine learning models through end-to-end experiments. We have released our source code at GitHub.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Foundation models in bioinformatics

引用

National Science Review 2025年第4期 400-418页

作者： Fei Guo Renchu Guan Yaohang Li Qi Liu Xiaowo Wang Can Yang Jianxin Wang Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Xiangjiang Laboratory Key Laboratory for Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Department of Computer Science Old Dominion University School of Life Sciences and Technology Tongji University Department of Automation Tsinghua University Department of Mathematics State Key Laboratory of Molecular Neuroscience and Big Data Bio-Intelligence Lab The Hong Kong University of Science and Technology

With the adoption of foundation models(FMs),artificial intelligence(AI) has become increasingly significant in bioinformatics and has successfully addressed many historical challenges,such as pre-training frameworks,model evaluation and *** demonstrate notable proficiency in managing large-scale,unlabeled datasets,because experimental procedures are costly and labor *** various downstream tasks,FMs have consistently achieved noteworthy results,demonstrating high levels of accuracy in representing biological entities.A new era in computational biology has been ushered in by the application of FMs,focusing on both general and specific biological *** this review,we introduce recent advancements in bioinformatics FMs employed in a variety of downstream tasks,including genomics,transcriptomics,proteomics,drug discovery and single-cell *** aim is to assist scientists in selecting appropriate FMs in bioinformatics,according to four model types:language FMs,vision FMs,graph FMs and multimodal *** addition to understanding molecular landscapes,AI technology can establish the theoretical and practical foundation for continued innovation in molecular biology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Syntax-enhanced pre-trained model 59

Syntax-enhanced pre-trained model

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Xu, Zenan Guo, Daya Tang, Duyu Su, Qinliang Shou, Linjun Gong, Ming Zhong, Wanjun Quan, Xiaojun Jiang, Daxin Duan, Nan School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Microsoft Research Asia Beijing China Microsoft Search Technology Center Asia Beijing China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (纸本)9781954085527

We study the problem of leveraging the syntactic structure of text to enhance pre-trained models such as BERT and RoBERTa. Existing methods utilize syntax of text either in the pre-training stage or in the fine-tuning stage, so that they suffer from discrepancy between the two stages. Such a problem would lead to the necessity of having human-annotated syntactic information, which limits the application of existing methods to broader scenarios. To address this, we present a model that utilizes the syntax of text in both pre-training and fine-tuning stages. Our model is based on Transformer with a syntax-aware attention layer that considers the dependency tree of the text. We further introduce a new pre-training task of predicting the syntactic distance among tokens in the dependency tree. We evaluate the model on three downstream tasks, including relation classification, entity typing, and question answering. Results show that our model achieves state-of-the-art performance on six public benchmark datasets. We have two major findings. First, we demonstrate that infusing automatically produced syntax of text improves pre-trained models. Second, global syntactic distances among tokens bring larger performance gains compared to local head relations between contiguous tokens. © 2021 Association for Computational Linguistics

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

SFF-DA: Sptialtemporal Feature Fusion for Detecting Anxiety Nonintrusively

arXiv

引用

arXiv 2022年

作者： Mo, Haimiao Li, Yuchen Yang, Shanlin Zhang, Wei Ding, Shuai The School of Management Hefei University of Technology Anhui Hefei23009 China The Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of Education China The National Engineering Laboratory for Big Data Distribution and Exchange Technologies Shanghai200135 China The West China Hospital of Sichuan University Sichuan Chengdu610041 China

Early detection of anxiety is crucial for reducing the suffering of individuals with mental disorders and improving treatment outcomes. Utilizing an mHealth platform for anxiety screening can be particularly practical in improving screening efficiency and reducing costs. However, the effectiveness of existing methods has been hindered by differences in mobile devices used to capture subjects' physical and mental evaluations, as well as by the variability in data quality and small sample size problems encountered in real-world settings. To address these issues, we propose a framework with spatiotemporal feature fusion for detecting anxiety nonintrusively. We use a feature extraction network based on a 3D convolutional network and long short-term memory ("3DCNN+LSTM") to fuse the spatiotemporal features of facial behavior and noncontact physiology, which reduces the impact of uneven data quality. Additionally, we design a similarity assessment strategy to address the issue of deteriorating model accuracy due to small sample sizes. Our framework is validated with a crew dataset from the real world and two public datasets: the University of Burgundy Franche-Comté Psychophysiological (UBFC-Phys) dataset and the Smart Reasoning for Well-being at Home and at Work for Knowledge Work (SWELL-KW) dataset. The experimental results indicate that our framework outperforms the comparison methods. © 2022, CC BY-NC-SA.

关键词： mHealth

来源：评论

学校读者我要写书评

暂无评论

Improved Sparse Activity Detection Based on Optimized Measurement Matrix in mMTC

Improved Sparse Activity Detection Based on Optimized Measur...

引用

IEEE Conference on Vehicular technology (VTC)

作者： Jianyu Wang Liu Yang Chaoyuan Bai Heng Liu Communication and Sensor Network for Modern Transportation International Cooperation Center(CSNMT) Southwest Jiaotong University Chengdu P.R.China Key Lab of Information Coding & Transmission Institude of Mobile Communication Southwest Jiaotong University Chengdu P.R.China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu P.R.China

ISBN: (数字)9798331517786

ISBN: (纸本)9798331517793

Device activity detection and channel estimation are central problems in massive Machine Type Communication (mMTC) scenarios. Given the sparse distribution of active devices, compressive sensing (CS) emerges as a viable solution at the gNB to mitigate interference stemming from non-orthogonal preamble sets. This paper proposes an algorithm for optimizing measurement matrix, thereby elevating the performance of signal recovery in CS. Within the proposed algorithm, a optimization model that integrates eigenvalue averaging and equiangular tight frame (ETF) theory is formulated, and an iterative algorithm is devised to approximate the optimal solution utilizing singular value decomposition (SVD). Further, a weight-based strategie is discussed with respect to the feasibility of the proposed algorithm, accompanied by the introduction of iteration termination condition. Experimental results corroborate the algorithm’s swift convergence, underpinning the efficient production of high-performance matrices that refine the accuracy of joint device activity detection and channel estimation.

关键词： Vehicular and wireless technologies Optimization models Channel estimation Approximation algorithms Eigenvalues and eigenfunctions Sparse matrices Matrix decomposition Optimization Convergence Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised classification on data streams with recurring concept drift and concept evolution

引用

Knowledge-Based Systems 2021年 215卷 106749-106749页

作者： Zheng, Xiulin Li, Peipei Hu, Xuegang Yu, Kui Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei 230601 Anhui China

Mining non-stationary stream is a challenging task due to its unique property of infinite length and dynamic characteristics let alone the issues of concept drift, concept evolution and limited labeled data. Although more attention has been attracted on the issues of concept drift and evolution in data streams, however, most of existing methods are supervised in nature, which probably result in a worse classification performance and lower efficiency in the case with scarcity of labeled data. Thus, in this paper, we proposed a semi-supervised framework with recurring concept drift and novel class detection called ESCR, which aims to detect recurring concept drift and concept evolution in data streams with partially labeled data. It is firstly built on an ensemble model consisted of several clustering-based classifiers. In terms of this framework, we adopt Jensen–Shannon divergence based change detection technique on classifier confidence score instead of classification error rate to detect recurring concept drifts. Meanwhile, we take concept evolution into consideration by monitoring the outliers with strong cohesion. Moreover, we further improve the execution efficiency of our framework by exploiting the recursive function and dynamic programming. Finally, extensive experiments conducted on both benchmark and synthetic data sets demonstrate the effectiveness and efficiency of our proposed semi-supervised framework in the handling of data streams with recurring concept drifts and concept evolution, as compared to several well-known semi-supervised data stream classification methods. © 2021 Elsevier B.V.

关键词： Concept evolution data stream classification Recurring concept drift

来源：评论

学校读者我要写书评

暂无评论

Research on DNS Resolution technology based on Blockchain

Research on DNS Resolution Technology based on Blockchain

引用

Chinese Automation Congress (CAC)

作者： Wang Hu-qing Zhang Ying-jiao Zhang Xu Sun Zhi-xin Post Industry Technology Research and Development Center of the State Posts Bureau(Intemet of Things Technology) Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing China School of Modern Posts Nanjing University of Posts and Telecommunications Nanjing China Aahui Yougu Express Intelligent Technology Co. LTD Nanjing China

DNS completes the resolution of domain names to IP addresses, which is an effective means to realize various In-ternet applications, and is also an indispensable part of Internet infrastructure, playing an important role. However, the resolution efficiency and security of DNS have always been a hot spot in the industry. This study deeply discusses the principle of Blockchain-based DNS resolution and conducts extensive re-search on Blockchain-based DNS resolution schemes. Based on compatibility with traditional DNS, these schemes are divided into two categories: compatible and incompatible. For different scenarios, we conduct a detailed analysis and comparison, focusing on the technical characteristics and performance of each so-lution. Finally, the future research direction is looked forward to, and the full text is summarized.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Suppress content shift: better diffusion features via off-the-shelf generation techniques 24

Suppress content shift: better diffusion features via off-th...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Benyuan Meng Qianqian Xu Zitai Wang Zhiyong Yang Xiaochun Cao Qingming Huang Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Peng Cheng Laboratory Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Key Laboratory of Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9798331314385

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at https://***/Darkbblue/diffusion-content-shift.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Renal Cell Carcinoma Detection and Subtyping with Minimal Point-Based Annotation in Whole-Slide Images 23rd

Renal Cell Carcinoma Detection and Subtyping with Minimal Po...

引用

23rd International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2020

作者： Gao, Zeyu Puttapirat, Pargorn Shi, Jiangbo Li, Chen School of Computer Science and Technology Xian Jiaotong University XianShaanxi710049 China National Engineering Lab for Big Data Analytics Xian Jiaotong University XianShaanxi710049 China

ISBN: (纸本)9783030597214

Cancerous region detection and subtyping in whole-slide images (WSIs) are fundamental for renal cell carcinoma (RCC) diagnosis. The main challenge in the development of automated RCC diagnostic systems is the lack of large-scale datasets with precise annotations. In this paper, we propose a framework that employs a semi-supervised learning (SSL) method to accurately detect cancerous regions with a novel annotation method called Minimal Point-Based (Min-Point) annotation. The predicted results are efficiently utilized by a hybrid loss training strategy in a classification model for subtyping. The annotator only needs to mark a few cancerous and non-cancerous points in each WSI. The experiments on three significant subtypes of RCC proved that the performance of the cancerous region detector trained with the Min-Point annotated dataset is comparable to the classifiers trained on the dataset with full cancerous region delineation. In subtyping, the proposed model outperforms the model trained with only whole-slide diagnostic labels by 12% in terms of the testing f1-score. We believe that our "detect then classify" schema combined with the Min-Point annotation would set a standard for developing intelligent systems with similar challenges. © 2020, Springer Nature Switzerland AG.

关键词： Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：