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

A survey for light field super-resolution

High-Confidence Computing 2024年第1期4卷 118-129页

作者： Mingyuan Zhao Hao Sheng Da Yang Sizhe Wang Ruixuan Cong Zhenglong Cui Rongshan Chen Tun Wang Shuai Wang Yang Huang Jiahao Shen State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Key Laboratory of Data Science and Intelligent Computing International Innovation InstituteBeihang UniversityHangzhou 311115China State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191China

Compared to 2D imaging data,the 4D light field(LF)data retains richer scene’s structure information,which can significantly improve the computer’s perception capability,including depth estimation,semantic segmentation,and LF ***,there is a contradiction between spatial and angular resolution during the LF image acquisition *** overcome the above problem,researchers have gradually focused on the light field super-resolution(LFSR).In the traditional solutions,researchers achieved the LFSR based on various optimization frameworks,such as Bayesian and Gaussian *** learning-based methods are more popular than conventional methods because they have better performance and more robust generalization *** this paper,the present approach can mainly divided into conventional methods and deep learning-based *** discuss these two branches in light field spatial super-resolution(LFSSR),light field angular super-resolution(LFASR),and light field spatial and angular super-resolution(LFSASR),***,this paper also introduces the primary public datasets and analyzes the performance of the prevalent approaches on these ***,we discuss the potential innovations of the LFSR to propose the progress of our research field.

关键词： Light field super-resolution Convolutional neural network Transformer Sub-aperture image Epipolar-plane image

来源：评论

学校读者我要写书评

暂无评论

Empowering Biomedical Named Entity Recognition Through Multi-Tagger Collaboration 27

Empowering Biomedical Named Entity Recognition Through Multi...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Zhao, Jin Xie, Jian Zhu, Tinghui Guo, Qian Li, Zhixu Xiao, Yanghua Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China Department of Computer Science and Engineering East China University of Science and Technology China

ISBN: (纸本)9781643685489

Biomedical Named Entity Recognition (BioNER) plays a crucial role in automatically identifying specific categories of entities from biomedical texts. Currently, region-based methods have shown promising performance in BioNER. However, existing paradigms in the region-based methods suffer from inherent limitations, including the generation of negative samples, and the ignorance of token dependencies. To overcome these limitations, we propose a new paradigm, implemented as Token Cascade Tagger (TCT), which combines span identification and category classification. The TCT utilizes category information to enhance the correlation between the heads and tails of entities, effectively reducing the generation of negative samples. Additionally, we introduce a Token Dependency Tagger (TDT) that captures token dependencies within entity spans by identifying the longest span in a sentence. The TDT filters out incorrect spans and further improves the accuracy of span detection obtained from the TCT. Furthermore, we employ a multi-task learning framework to optimize both the TCT and TDT, leading to superior performance in BioNER. Extensive experiments on publicly available biomedical datasets demonstrate our method outperforms the previous state-of-the-art methods, achieving 92.44%, 92.54%, and 81.26% on NCBI-Disease, BC5CDR, and GENIA, respectively, in terms of F1 score. © 2024 The Authors.

关键词： Multi-task learning

来源：评论

学校读者我要写书评

暂无评论

Evaluating Cryptocurrency Market Risk on the Blockchain: An Empirical Study Using the ARMA-GARCH-VaR Model

IEEE Open Journal of the Computer Society

引用

IEEE Open Journal of the computer Society 2024年 5卷 83-94页

作者： Huang, Yongrong Wang, Huiqing Chen, Zhide Feng, Chen Zhu, Kexin Yang, Xu Yang, Wencheng Fujian Normal University School of Computer and Cyberspace Security Fuzhou350117 China Department of Information Engineering Fuzhou Polytechnic Fuzhou350108 China Department of Computer Science and Engineering National Sun Yat-sen University Kaohsiung80424 Taiwan College of Computer and Data Science Minjiang University Fuzhou350108 China School of Mathematics Physics and Computing University of Southern Queensland ToowoombaQLD4350 Australia

Cryptocurrency, a novel digital asset within the blockchain technology ecosystem, has recently garnered significant attention in the investment world. Despite its growing popularity, the inherent volatility and instability of cryptocurrency investments necessitate a thorough risk evaluation. This study utilizes the Autoregressive Moving Average (ARMA) model combined with the Generalized Autoregressive Conditionally Heteroscedastic (GARCH) model to analyze the volatility of three major cryptocurrencies-Bitcoin (BTC), Ethereum (ETH), and Binance Coin (BNB)-over a period from January 1, 2017, to October 29, 2022. The dataset comprises daily closing prices, offering a comprehensive view of the market's fluctuations. Our analysis revealed that the value-at-risk (VaR) curves for these cryptocurrencies demonstrate significant volatility, encompassing a broad spectrum of returns. The overall risk profile is relatively high, with ETH exhibiting the highest risk, followed by BTC and BNB. The ARMA-GARCH-VaR model has proven effective in quantifying and assessing the market risks associated with cryptocurrencies, providing valuable insights for investors and policymakers in navigating the complex landscape of digital assets. © 2020 IEEE.

关键词： Investments

来源：评论

学校读者我要写书评

暂无评论

Improved Particle Swarm Algorithm Using Multiple Strategies 1

引用

14th International Symposium on Intelligence Computation and Applications, ISICA 2023

作者： Yi, Yunfei Wang, Zhiyong Shi, Yunying School of Big Data and Computer Hechi University Guangxi Yizhou546300 China College of Computer Science and Engineering Guangxi Normal University Guangxi Guilin541001 China

ISBN: (数字)9789819743933

ISBN: (纸本)9789819743926

In order to address the issues of premature convergence and low search efficiency in the basic particle swarm algorithm, this paper analyzes the improved particle swarm optimization algorithms proposed by previous researchers. Based on this analysis, a modified algorithm for particle swarm optimization is proposed. The enhanced algorithm adjusts the inertia weight parameter in a nonlinear manner and dynamically changes the self-learning factor using chaos, allowing it to continuously change during iterations and achieve better optimization results. Additionally, to prevent the algorithm from getting trapped in local optima, a mutation operation is introduced into the improved algorithm. Finally, several classical test functions are used to conduct experiments, and the results are compared with the improved particle swarm optimization algorithms described in related literature. The experimental results demonstrate that the newly proposed algorithm achieves a certain degree of improvement in optimization accuracy compared to the basic particle swarm algorithm. This indicates that the modified algorithm effectively avoids premature convergence and possesses high search efficiency. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

AMHF-TP:Multifunctional therapeutic peptides prediction based on multi-granularity hierarchical features

引用

Quantitative Biology 2025年第1期13卷 127-141页

作者： Shouheng Tuo YanLing Zhu Jiangkun Lin Jiewei Jiang School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’anChina Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’anChina Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anChina School of Electronic Engineering Xi’an University of Posts and TelecommunicationsXi’anChina

Multifunctional therapeutic peptides(MFTP)hold immense potential in diverse therapeutic contexts,yet their prediction and identification remain challenging due to the limitations of traditional methodologies,such as extensive training durations,limited sample sizes,and inadequate generalization *** address these issues,we present AMHF-TP,an advanced method for MFTP recognition that utilizes attention mechanisms and multi-granularity hierarchical features to enhance *** AMHF-TP is composed of four key components:a migration learning module that leverages pretrained models to extract atomic compositional features of MFTP sequences;a convolutional neural network and selfattention module that refine feature extraction from amino acid sequences and their secondary structures;a hypergraph module that constructs a hypergraph for complex similarity representation between MFTP sequences;and a hierarchical feature extraction module that integrates multimodal peptide sequence *** with leading methods,the proposed AMHF-TP demonstrates superior precision,accuracy,and coverage,underscoring its effectiveness and robustness in MFTP *** comparative analysis of separate hierarchical models and the combined model,as well as with five contemporary models,reveals AMHFTP’s exceptional performance and stability in recognition tasks.

关键词： deep learning hypergraph multifunctional therapeutic peptides multi-granularity hierarchical features

来源：评论

学校读者我要写书评

暂无评论

Multi-level Knowledge Integration with Graph Convolutional Network for Cancer Molecular Subtype Classification

Multi-level Knowledge Integration with Graph Convolutional N...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Huang, Sujia Xiao, Shunxin Liu, Wenzhe Lu, Jielong Wu, Zhihao Wang, Shiping Rajapakse, Jagath C. Fuzhou University College of Computer and Data Science Fuzhou China Huzhou University School of Information Engineering Huzhou China Nanyang Technological University School of Computer Science and Engineering Singapore

ISBN: (纸本)9798350337488

Multi-omics data provides a wealth of information concerning disease mechanisms, which benefits the exploration of the intricate molecular phenomena underlying diseases. In recent years, considerable endeavors have been directed towards the combination of graph convolutional network, which has the powerful ability to gather information, with multi-omics learning methods to obtain more reliable results. For achieving this pursuit, an essential challenge is data integration. Against this backdrop, we propose a unified framework named multi-level knowledge integration with graph convolutional network, which effectively incorporates multiple prior knowledge and omics data to learn an intrinsic representation. In specific, the model consists of two subnetworks: an attribute-level module and a sample-level module. The former firstly aggregates the knowledge given by the prior biological graphs into low-dimensional embeddings, and then maximizes the consistency between these prior views via optimizing a contrastive loss for attaining the attribute-based representations. The latter leverages an encoder to dimensionalize the original multi-omics data to attain more dominant sample knowledge, and subsequently utilizes another contrastive loss to align these representations between multiple omics for learning the global sample-level information. Comprehensive experiments are performed to show that the proposed model surpasses other state-of-the-art methods. © 2023 IEEE.

关键词： cancer molecular subtype classification contrastive learning graph convolutional network Multi-omics data

来源：评论

学校读者我要写书评

暂无评论

Barrier Function-Based Backstepping Fractional-Order Sliding Mode Control for Quad-Rotor Unmanned Aerial Vehicle under External Disturbances

引用

IEEE Transactions on Aerospace and Electronic Systems 2024年第1期60卷 716-728页

作者： Liu, Bowen Wang, Yingxun Mofid, Omid Mobayen, Saleh Khooban, Mohammad Hassan Beihang University School of Automation Science and Electrical Engineering Beijing100191 China University of Zanjan Department of Electrical Engineering Zanjan45371-38791 Iran National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliou64002 Taiwan Aarhus University Department of Electrical and Computer Engineering Aarhus8200 Denmark

The main control objective for the quad-rotor system is the attitude and position tracking control which is accomplished in this article using the backstepping fractional-order sliding mode control approach combined with the adaptive tuning based barrier function theory. The quad-rotor's dynamical model is obtained at the appearance of the disturbance that is entered to the quad-rotor system by an exterior force. Hence, the attitude and position tracking errors between the quad-rotor's actual states and their desired trajectory are defined. Afterward, the fractional-order sliding surfaces are defined to guarantee finite-time reachability of the defined tracking error. The designed fractional-order surface eases the control process due to the removal of the high-derivative of virtual controllers. Then, the extended adaptive barrier function laws named fractional-order-based adaptive barrier function laws are employed to eliminate the knowledge of the upper bounds of external disturbances. The Lyapunov theory concept mixed with the backstepping control strategy is used to demonstrate that the fractional-order sliding surface reaches the neighborhood of origin in the finite time. Finally, simulation results in various scenarios on the MATLAB/ Simulink environment are provided to show that the designed control procedure in this article is an efficient control technique to assure that attitude and position's trajectories of the quad-rotor system track desired trajectories properly in the existence of the external disturbances. Moreover, the designed method is compared to the existing method to validate the efficiency of the proposed method. Lastly, experimental results using the Speedgoat real-time target machine is implemented to assure validity of the recommended method. © 1965-2011 IEEE.

关键词： Backstepping

来源：评论

学校读者我要写书评

暂无评论

On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs

引用

Frontiers of computer Science 2023年第4期17卷 97-107页

作者： Jia LI Wenjun LI Yongjie YANG Xueying YANG School of Information Engineering Hunan Industry PolytechnicChangsha 410036China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha 410015China Chair of Economic Theory Saarland UniversitySaarbrücken 66123Germany

In the minimum degree vertex deletion problem,we are given a graph,a distinguished vertex in the graph,and an integer κ,and the question is whether we can delete at most κ vertices from the graph so that the distinguished vertex has the unique minimum *** maximum degree vertex deletion problem is defined analogously but here we want the distinguished vertex to have the unique maximum *** is known that both problems areΨ-hard and fixed-parameter intractable with respect to some natural *** this paper,we study the(parameterized)complexity of these two problems restricted to split graphs,p-degenerate graphs,and planar *** study provides a comprehensive complexity landscape of the two problems restricted to these special graphs.

关键词： minimum degree maximum degree vertex deletion split graphs planar graphs parameterized complexity

来源：评论

学校读者我要写书评

暂无评论

Causal fMRI-Mamba: Causal State Space Model for Neural Decoding and Brain Task States Recognition

Causal fMRI-Mamba: Causal State Space Model for Neural Decod...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Deng, Weihao Han, Fei Ling, Qinghua Liu, Qing Han, Henry School of Computer Science and Communication Engineering JiangSu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications China School of Computer Jiangsu University of Science and Technology China School of Electronic and Information Engineering West Anhui University China School of Engineering and Computer Science Baylor University United States

ISBN: (纸本)9798350368741

Deep learning advances neural decoding in functional magnetic resonance imaging (fMRI) tasks with convolution and attention-based methods. However, these methods struggle with capturing global spatiotemporal information due to high dimensionality, noise and inter-individual difference of fMRI, which also increase computational complexity and prior bias. To this end, a novel causal state space model, Causal fMRI-Mamba, is proposed for neural decoding and task state mapping. It effectively captures global spatiotemporal information via eliminating local redundancies and capturing long-distance dependencies. Meanwhile, a causal representation framework is designed to extract invariant high-order features and disentangle related causal features, enhancing model performance. Furthermore, a dense connection module is expanded to prevent significant causal information loss in hidden states of inter layers. On the HCP brain task state classification task, Causal fMRI-Mamba achieves better performance and generalization than comparison methods. © 2025 IEEE.

关键词： causal representation learning Neuro-decoding state space model task-based fMRI

来源：评论

学校读者我要写书评

暂无评论

Latent Logic Tree Extraction for Event Sequence Explanation from LLMs 41

Latent Logic Tree Extraction for Event Sequence Explanation ...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Song, Zitao Yang, Chao Wang, Chaojie An, Bo Li, Shuang School of Computer Science and Engineering Nanyang Technological University Singapore School of Data Science The Chinese University of Hong Kong Shenzhen China Skywork AI Singapore

Modern high-stakes systems, such as healthcare or robotics, often generate vast streaming event sequences. Our goal is to design an efficient, plug- and-play tool to elicit logic tree-based explanations from Large Language Models (LLMs) to provide customized insights into each observed event sequence. Built on the temporal point process model for events, our method employs the likelihood function as a score to evaluate generated logic trees. We propose an amortized Expectation-Maximization (EM) learning framework and treat the logic tree as latent variables. In the E-step, we evaluate the posterior distribution over the latent logic trees using an LLM prior and the likelihood of the observed event sequences. LLM provides a high-quality prior for the latent logic trees, however, since the posterior is built over a discrete combinatorial space, we cannot get the closed-form solution. We propose to generate logic tree samples from the posterior using a learnable GFlowNet, which is a diversity-seeking generator for structured discrete variables. The M-step employs the generated logic rules to approximate marginalization over the posterior, facilitating the learning of model parameters and refining the tunable LLM prior parameters. In the online setting, our locally built, lightweight model will iteratively extract the most relevant rules from LLMs for each sequence using only a few iterations. Empirical demonstrations showcase the promising performance and adaptability of our framework. Copyright 2024 by the author(s)

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：