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

2024 IEEE International Conference on Imaging Systems and Techniques, IST 2024

作者： Jing, Xiuhan Zhang, Chenghong Zhang, He Lyu, Wenhao Fu, Bo Xu, Lijun School of Instrumentation and Optoelectronic Engineering Beihang University Key Laboratory of Precision Opto-Mechatronics Technology of Education Ministry Beijing China School of Engineering Medicine Beihang University Key Laboratory of Big Data-Based Precision Medicine Ministry of Industry and Information Technology Beijing China

ISBN: (纸本)9798350378214

Dual-comb spectroscopy is a competitive means of laser absorption spectroscopy owing to broad spectral range and high spectral resolution. Single-cavity dual-comb systems based on mode-locked lasers hold promising potential for further simplifying dual-comb spectroscopy. Two combs possess natural coherence because of common mode noise suppression. Herein, we proposed an all-fiber dispersion-managed dual-comb laser to broaden the spectra of dual combs. The output laser with a 3-dB bandwidth as broad as 9 nm at 1.5 μm was experimentally obtained. Dual combs were realized by the walk-off of orthogonal polarization modes and directly employed to absorption spec-troscopy due to their overlapped spectra. In order to improve the signal-to-noise ratio of dual-comb measurement, interferogram averaging was conducted, where the signal-to-noise ratio was generally proportional to the square root of averaging times. Besides, phase and frequency jitter was corrected by cross-correlation method. High resolution absorption lines of hydrogen cyanide from P18 to P26 were measured. Positions of measured absorption lines were in line with ones in HITRAN database, with an average error of approximate 1 pm. To the best of our knowledge, the 9-line result was the broadest bandwidth of polarization-multiplexed single-cavity dual combs without additional spectral spreading operation. The results demonstrate that the compact dual-comb spectrometer can be considered a potential candidate for quantitative measurements in practical applications. © 2024 IEEE.

关键词： Spectral resolution

来源：评论

学校读者我要写书评

暂无评论

Insights into the synergistic promotion of spin polarization over C_(3)N_(5.4) for enhancing cooperative hydrogen evolution and benzylamine oxidation coupling

引用

Nano Research 2023年第4期16卷 4225-4232页

作者： Qiuchen Wang Xiaoxu Deng Haiyan Pen Fei Liu Meiyang Song Peng Chen Shuang-Feng Yin Provincial Guizhou Key Laboratory of Green Chemical and Clean Energy Technology School of Chemistry and Chemical EngineeringGuizhou UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China College of Chemistry and Chemical Engineering Advanced Catalytic Engineering Research Center of the Ministry of EducationState Key Laboratory of Chemo/Biosensing and ChemometricsHunan UniversityChangsha 410082China

Polymers are usually restricted on the high exciton binding energies and sluggish electron transfer because of the low dielectric *** spin-polarized electrons is regarded as an attractive strategy,but often confined to the d-orbital ***,the nonmetal P and N elements co-mediated the spin polarization of carbon nitrides(PCN)have been elaborately *** optimized PCN-3 shows an outstanding hydrogen production(22.2 mmol·g^(-1)·h^(-1))coupled with selective benzylamine oxidation without using any solvent and cocatalysts,which is 200 times of original C_(3)N_(4)and superior to the photocatalysts has been reported to *** and theoretical results verified that the spin-orbital coupling of N 2p and P 2p remarkably increased the parallel spin states of charge and reduced the formation of singlet excitons to accelerate exciton dissociation in carbon *** addition,charge separation and surface catalysis can be significantly enhanced by the electron spin polarization of carbon nitride with the parallel arrangement,huge built-in electric field and disturbed electronic *** finding deepens the insight into the charge separation and exciton dissociation in spin polarization,and offers new tactics to develop high-efficiency catalysts.

关键词： spin polarization photocatalysis amine oxidative coupling hydrogen production C_(3)N_(5.4)

来源：评论

学校读者我要写书评

暂无评论

MECNet: Multi-Scale Exposure-Consistency Learning via Fourier Transform for Exposure Correction

MECNet: Multi-Scale Exposure-Consistency Learning via Fourie...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Qiao, Gaofei Zhang, Zhibin He, Liqiang Inner Mongolia University Key Laboratory of Wireless Networks and Mobile Computing Engineering Research Center of Ecological Big Data Ministry of Education Hohhot010021 China Geomechanica Inc Canada

ISBN: (纸本)9781665410205

In the real world, due to various challenging lighting conditions such as low light, underexposure, and overexposure, captured images often exhibit undesirable appearances. Given that images with different exposure levels require different correction processes, a single neural network struggles to produce satisfactory results. We propose a coarse-to-fine exposure correction model for learning exposure consistency representation to address underexposure and overexposure issues. Building upon the bilateral activation mechanism, we introduce the Fourier transform to capture global information and fuse it with locally extracted information through convolution to achieve superior feature representation. Additionally, we employ Laplacian pyramids to decompose the source image into different spatial frequency bands, then the image details are enhanced by denoising high-frequency layers. Experimental results on the MSEC and SICE datasets demonstrate the superiority of our proposed method over current state-of-the-art approaches. Our code will be made available on GitHub. © 2024 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

MacroTrend: A Write-Efficient Cache Algorithm for NVM-Based Read Cache

引用

Journal of Computer Science & Technology 2022年第1期37卷 207-230页

作者： Ning Bao Yun-Peng Chai Xiao Qin Chuan-Wen Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of EducationBeijing 100872China School of Information Renmin University of ChinaBeijing 100872China Samuel Ginn College of Engineering Auburn UniversityAlabama 36830U.S.A.

The future storage systems are expected to contain a wide variety of storage media and layers due to the rapid development of NVM(non-volatile memory)*** NVM-based read caches,many kinds of NVM devices cannot stand frequent data updates due to limited write endurance or high energy consumption of ***,traditional cache algorithms have to update cached blocks frequently because it is difficult for them to predict long-term popularity according to such limited information about data blocks,such as only a single value or a queue that reflects frequency or *** this paper,we propose a new MacroTrend(macroscopic trend)prediction method to discover long-term hot blocks through blocks'macro trends illustrated by their access count *** then a new cache replacement algorithm is designed based on the MacroTrend prediction to greatly reduce the write amount while improving the hit *** conduct extensive experiments driven by a series of real-world traces and find that compared with LRU,MacroTrend can reduce the write amounts of NVM cache devices significantly with similar hit ratios,leading to longer NVM lifetime or less energy consumption.

关键词： non-volatile memory(NVM) solid state disk(SSD) cache endurance

来源：评论

学校读者我要写书评

暂无评论

Automatic Fusion for Multimodal Entity Alignment: A New Perspective from Automatic Architecture Search

Automatic Fusion for Multimodal Entity Alignment: A New Pers...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Chenyang Bu Yunpeng Hong Shiji Zang Guojie Chang Xindong Wu Key Laboratory of Knowledge Engineering With Big Data (the Ministry of Education of China) School of Computer Science and Engineering HeFei University of Technology

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Integrating multimodal data from diverse sources is crucial for enhancing various applications. Multimodal entity alignment (MMEA), which discovers equivalent entities across different sources and modalities, aims to eliminate data silos for comprehensive integration. A key challenge in MMEA is effectively fusing vector representations from different modalities of the same entity for optimal entity matching. Existing fusion methods involve individual fusion operators (e.g., concatenation and summation) or the manual design of complex network structures, incurring significant human resource costs. In this paper, for the first time, we introduce the research question of automatic fusion for MMEA and propose an efficient approach from the perspective of automated architecture search. Experimental comparisons with state-of-the-art methods on real-world datasets demonstrate the effectiveness of the proposed approach.

关键词： Costs Search methods Complex networks Vectors

来源：评论

学校读者我要写书评

暂无评论

Short Text Topic Modeling Techniques, Applications, and Performance: A Survey

引用

IEEE Transactions on knowledge and data engineering 2022年第3期34卷 1427-1445页

作者： Qiang, Jipeng Qian, Zhenyu Li, Yun Yuan, Yunhao Wu, Xindong Department of Computer Science Yangzhou University Jiangsu225009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230026 China Mininglamp Academy of Sciences Minininglamp Beijing China

Analyzing short texts infers discriminative and coherent latent topics that is a critical and fundamental task since many real-world applications require semantic understanding of short texts. Traditional long text topic modeling algorithms (e.g., PLSA and LDA) based on word co-occurrences cannot solve this problem very well since only very limited word co-occurrence information is available in short texts. Therefore, short text topic modeling has already attracted much attention from the machine learning research community in recent years, which aims at overcoming the problem of sparseness in short texts. In this survey, we conduct a comprehensive review of various short text topic modeling techniques proposed in the literature. We present three categories of methods based on Dirichlet multinomial mixture, global word co-occurrences, and self-aggregation, with example of representative approaches in each category and analysis of their performance on various tasks. We develop the first comprehensive open-source library, called STTM, for use in Java that integrates all surveyed algorithms within a unified interface, benchmark datasets, to facilitate the expansion of new methods in this research field. Finally, we evaluate these state-of-the-art methods on many real-world datasets and compare their performance against one another and versus long text topic modeling algorithm. © 2020 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Learning Inter-Entity Interaction for Few-Shot knowledge Graph Completion

Learning Inter-Entity Interaction for Few-Shot Knowledge Gra...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Li, Yuling Yu, Kui Huang, Xiaoling Zhang, Yuhong Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei China School of Computer Science and Information Enginerring Hefei University of Technology China

Few-shot knowledge graph completion (FKGC) aims to infer unknown fact triples of a relation using its few-shot reference entity pairs. Recent FKGC studies focus on learning semantic representations of entity pairs by separately encoding the neighborhoods of head and tail entities. Such practice, however, ignores the inter-entity interaction, resulting in low-discrimination representations for entity pairs, especially when these entity pairs are associated with 1-to-N, N-to-1, and N-to-N relations. To address this issue, this paper proposes a novel FKGC model, named Cross-Interaction Attention Network (CIAN) to investigate the inter-entity interaction between head and tail entities. Specifically, we first explore the interactions within entities by computing the attention between the task relation and each entity neighbor, and then model the interactions between head and tail entities by letting an entity to attend to the neighborhood of its paired entity. In this way, CIAN can figure out the relevant semantics between head and tail entities, thereby generating more discriminative representations for entity pairs. Extensive experiments on two public datasets show that CIAN outperforms several state-of-the-art methods. The source code is available at https://***/cjlyl/FKGC-CIAN. © 2022 Association for Computational Linguistics.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Partial Label Feature Selection: An Adaptive Approach

引用

IEEE Transactions on knowledge and data engineering 2024年第8期36卷 4178-4191页

作者： Zan Zhang Jialu Yao Lin Liu Jiuyong Li Lei Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei Anhui China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei Anhui China UniSA STEM University of South Australia Adelaide SA Australia Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei Anhui China

As an emerging weakly supervised learning framework, partial label learning aims to induce a multi-class classifier from ambiguous supervision information where each training example is associated with a set of candidate labels, among which only one is the true label. Traditional feature selection methods, either for single label and multiple label problems, are not applicable to partial label learning as the ambiguous information contained in the label space obfuscates the importance of features and misleads the selection process. This makes the selection of a proper feature subset from partial label examples particularly challenging, and therefore has rarely been investigated. In this paper, we propose a novel feature selection algorithm for partial label learning, named PLFS, which considers not only the relationships between features and labels, but also exploits the relationships between instances to select the most informative and important features to enhance the performance of partial label learning. PLFS constructs an adaptive weighted graph to exploit the similarity information among instances, differentiate the label space and weight the feature space, which leads to the selection of a proper feature subset. Extensive experiments over a broad range of benchmark data sets clearly validate the effectiveness of our proposed feature selection approach.

关键词： Feature extraction Supervised learning Training knowledge engineering Labeling Classification algorithms big data

来源：评论

学校读者我要写书评

暂无评论

High-Dimensional Multi-Label data Stream Classification With Concept Drifting Detection

引用

IEEE Transactions on knowledge and data engineering 2023年第8期35卷 8085-8099页

作者： Li, Peipei Zhang, Haixiang Hu, Xuegang Wu, Xindong Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Second People's Hospital of Hefei Anhui Hefei230011 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education of China School of Computer Science and Information Engineering Anhui Hefei230002 China

Multi-label data streams such as Web texts and images have been popular on the Web. These data present the characteristics of multiple label, high dimensionality, high volume, high velocity and especial concept drift etc. Thus, multi-label data stream classification is a very challenging and significant task especially in the handling of high-dimensional data with concept drifts. However, this challenge has received little attention from the research community. Therefore, we propose the max-relevance and min-redundancy based algorithm adaptation approach for the efficient and effective classification on multi-label data streams with high-dimensional attributes and concept drifts. In order to reduce the impact from the high-dimensional data with noisy attributes, we first refine the minimal-redundancy-maximal-relevance criterion based on mutual information to select qualified features in multi-label data streams. Second, we propose the data distribution based concept drifting detection approach to distinguish concept drifts hidden in data streams. Finally, we build an incremental ensemble classification model for efficiently classifying multi-label data streams. Extensive studies show that our approach can get optimal subsets of features while maintaining a good performance in the multi-label classification, as compared to several state-of-the-art multi-label feature selection algorithms using two efficient multi-label classification methods as base classifiers. Meanwhile, our approach is superior to three well-known multi-label data stream classification approaches in the effectiveness and efficiency. © 1989-2012 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Graph Prompt Clustering

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第7期47卷 5794-5805页

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning530219 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Beijing100816 China South China Technology Commercialization Center Guangzhou510006 China Guangdong University of Technology School of Information Engineering Guangzhou510006 China Guangdong Key Laboratory of Information Security Technology Guangzhou510033 China Ministry of Education Beijing100044 China

Due to the wide existence of unlabeled graph-structured data (e.g., molecular structures), the graph-level clustering has recently attracted increasing attention, whose goal is to divide the input graphs into several disjoint groups. However, the existing methods habitually focus on learning the graphs embeddings with different graph reguralizations, and seldom refer to the obvious differences in data distributions of distinct graph-level datasets. How to characteristically consider multiple graph-level datasets in a general well-designed model without prior knowledge is still challenging. In view of this, we propose a novel Graph Prompt Clustering (GPC) method. Within this model, there are two main modules, i.e., graph model pretraining as well as prompt and finetuning. In the graph model pretraining module, the graph model is pretrained by a selected source graph-level dataset with mutual information maximization and self-supervised clustering regularization. In the prompt and finetuning module, the network parameters of the pretrained graph model are frozen, and a groups of learnable prompt vectors assigned to each graph-level representation are trained for adapting different target graph-level datasets with various data distributions. Experimental results across six benchmark datasets demonstrate the impressive generalization capability and effectiveness of GPC compared with the state-of-the-art methods. © 1979-2012 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：