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

International Conference on computer Supported Cooperative Work in Design

作者： Yingxian Zhang Yushui Geng Hu Liang Hai Zhong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China Graduate School Qilu University of Technology (Shandong Academy of Sciences) Jinan China Department of Radiology The Second Hospital of Shandong University Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

Multimodal medical image fusion technology provides more comprehensive and accurate image support for clinical diagnosis and treatment by integrating complementary information from different imaging modalities. Aiming at the problem that existing methods are still insufficient in detail feature extraction and inter-modal information fusion, this paper proposes a multimodal medical image fusion method combined with an adaptive attention mechanism. First, we design the Grouped Receptive Field Attentional Convolution (GRFAConv) to solve the problem of insufficient detail feature extraction capability. With the multi-head receptive field adaptive weighting strategy of grouped convolution, the range and weight of the receptive field of the convolution kernel can be adaptively adjusted according to the different demands of local and global features of the image to improve the effect of detail retention. Second, for the problem of information fusion between different modalities, we introduce an improved CBAM attention module in the feature fusion process, which adaptively selects and enhances the features in the key regions through the channel attention and spatial attention mechanisms, which greatly improves the clarity of the fused image details and the accuracy of the information expression in the key regions. Furthermore, experimental results on several medical image datasets show that the algorithm proposed in this paper can generate relatively high-quality fused images. It not only enriches the detailed features of the image, but also achieves significant advantages in several evaluation metrics.

关键词： Measurement Attention mechanisms Accuracy Convolution Federated learning Feature extraction Clinical diagnosis Kernel Medical diagnostic imaging Image fusion

来源：评论

学校读者我要写书评

暂无评论

Divide-Solve-Combine: An Interpretable and Accurate Prompting Framework for Zero-shot Multi-Intent Detection 39

Divide-Solve-Combine: An Interpretable and Accurate Promptin...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Qin, Libo Chen, Qiguang Zhou, Jingxuan Wang, Jin Fei, Hao Che, Wanxiang Li, Min School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Yunnan University China National University of Singapore Singapore

ISBN: (纸本)157735897X

Zero-shot multi-intent detection is capable of capturing multiple intents within a single utterance without any training data, which gains increasing attention. Building on the success of large language models (LLM), dominant approaches in the literature explore prompting techniques to enable zero-shot multi-intent detection. While significant advancements have been witnessed, the existing prompting approaches still face two major issues: lacking explicit reasoning and lacking interpretability. Therefore, in this paper, we introduce a Divide-Solve-Combine Prompting (DSCP) to address the above issues. Specifically, DSCP explicitly decomposes multi-intent detection into three components including (1) single-intent division prompting is utilized to decompose an input query into distinct sub-sentences, each containing a single intent;(2) intent-by-intent solution prompting is applied to solve each sub-sentence recurrently;and (3) multi-intent combination prompting is employed for combining each sub-sentence result to obtain the final multi-intent result. By decomposition, DSCP allows the model to track the explicit reasoning process and improve the interpretability. In addition, we propose an interactive divide-solve-combine prompting (Inter-DSCP) to naturally capture the interaction capabilities of large language models. Experimental results on two standard multi-intent benchmarks (i.e., MIXATIS and MIXSNIPS) reveal that both DSCP and Inter-DSCP obtain substantial improvements over baselines, achieving superior performance and higher interpretability. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Spectral Extrema of Bipartite Graphs: Forbidden an Even Cycle of Specified Length

SSRN

引用

SSRN 2024年

作者： Feng, Zhimin Luo, Xiaobing Wei, Wei School of Mathematics and Statistics Xinyang Normal University Xinyang China School of Computer Technology and Software Engineering Wuhan Polytechnic Wuhan China Center of Intelligent Computing and Applied Statistics School of Mathematics Physics and Statistics Shanghai University of Engineering Science Shanghai201620 China

A graph is called $H$-free if the graph has no subgraph being isomorphic to $H$. The classical Tur\'an problem aims to determine the maximum size of an $H$-free graph with given order. In 2010, Nikiforov introduced the spectral Tur\'an-type problem: Determine the maximum spectral radius of an $H$-free graph with given order. He also presented the following conjecture: For sufficiently large $\nu$ and for $k\geq 2$, the graph $K_k\vee (\overline{K_{\nu-k-2}}\cup K_2)$ is the unique $\nu$-vertex $\{C_{2k+1}, C_{2k+2}\}$-free graph having the largest spectral radius and $K_k\vee \overline{K_{\nu-k}}$ is the unique $\nu$-vertex $C_{2k+2}$-free graph having the largest spectral radius. Recently, this conjecture was confirmed by Cioab\u{a}, Desai and Tait. In this contribution, we resolve the Nikiforov's even cycle conjecture for bipartite graphs. Let $\nu$ and $k$ be two integers satisfying $\nu\geq 1$ if $k=1,$ and $\nu \geq \left(\frac{7^22^{24}k\left(2k-1\right)^2(k+1)^{20}} {(2k-3)^2}\right)^{\frac{k+1}{k-1}}$ if $k\geq 2$. Then we show that the complete bipartite graph $K_{k,\nu-k}$ uniquely maximizes the spectral radius over the set of $C_{2k+2}$-free bipartite graphs of order $\nu$. © 2024, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

The relationship between brain atrophy and brain network connection in Alzheimer's disease

The relationship between brain atrophy and brain network con...

引用

IEEE/ICME International Conference on Complex Medical Engineering, CME

作者： Tong Wang Bin Wang Zhifeng Li Yunxiao Ma Department of Information and Computer Brain Science and Intelligence Computing Research Center Taiyuan University of Technology Taiyuan China School of Life Science Beijing Institute of Technology Beijing China

Purpose: Researchers found that the connectome structure of the brain spreads atrophy of cortical and subcortical gray matter in a series of dementia diseases. Many researchers study the transmission mode of brain atrophy through brain networks. However, most of the evidence related to atrophy and brain network connectivity is at the pathological level, and the evidence of correlation at the network level is *** and Methods: A total of 378 subjects were included in our study, including 173 AD (88 women, mean age 75.3±7.6 years), and 205 normal controls (NC) (106 women, mean age 76.1 ±4.8 years). All data of the subjects were from T1 weighted data of the public dataset ADNI. In this paper, we first use the VBM method to analyze the gray matter difference between AD and NC. Then, the AAL template is used to divide the t map into brain regions. The correlation between node atrophy and neighbor atrophy is used as the verification ***: It is found that the node atrophy of AD is significantly related to their neighbor atrophy. As a control, when the random matrix is used as the brain network connection, there is no significant correlation between the node atrophy of AD and their neighbor ***: This study found that brain atrophy in AD patients was significantly related to its network connection, indicating that the propagation of brain atrophy in AD can be explained by network connection.

关键词： Atrophy Pathology Nerve fibers Correlation Grey matter Alzheimer's disease

来源：评论

学校读者我要写书评

暂无评论

TarGF: Learning Target Gradient Field to Rearrange Objects without Explicit Goal Specification

arXiv

引用

arXiv 2022年

作者： Wu, Mingdong Zhong, Fangwei Xia, Yulong Dong, Hao Center on Frontiers of Computing Studies School of Computer Science Peking University China School of Intelligence Science and Technology Peking University China China Peng Cheng Laboratory China

Object Rearrangement is to move objects from an initial state to a goal state. Here, we focus on a more practical setting in object rearrangement, i.e., rearranging objects from shuffled layouts to a normative target distribution without explicit goal specification. However, it remains challenging for AI agents, as it is hard to describe the target distribution (goal specification) for reward engineering or collect expert trajectories as demonstrations. Hence, it is infeasible to directly employ reinforcement learning or imitation learning algorithms to address the task. This paper aims to search for a policy only with a set of examples from a target distribution instead of a handcrafted reward function. We employ the score-matching objective to train a Target Gradient Field (TarGF), indicating a direction on each object to increase the likelihood of the target distribution. For object rearrangement, the TarGF can be used in two ways: 1) For model-based planning, we can cast the target gradient into a reference control and output actions with a distributed path planner;2) For model-free reinforcement learning, the TarGF is not only used for estimating the likelihood-change as a reward but also provides suggested actions in residual policy learning. Experimental results in ball rearrangement and room rearrangement demonstrate that our method significantly outperforms the state-of-the-art methods in the quality of the terminal state, the efficiency of the control process, and scalability. The code and demo videos are on https://***/view/targf. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Identification Algorithm Framework and Structural model on Input Pattern of Metamorphic Relations 9

Identification Algorithm Framework and Structural model on I...

引用

9th International Conference on Dependable Systems and Their Applications, DSA 2022

作者： Yan, Shiyu Yang, Xiaohua Lu, Zhongjian Li, Meng Gong, Helin Liu, Jie Computer School University of South China Hunan Hengyang China Intelligent Equipment Software Evaluation Engineering Technology Research Center of Hunan Hengyang China Cnnc Key Laboratory on High Trusted Computing Hunan Hengyang China Nuclear Power Institute of China Science and Technology on Reactor System Design Technology Laboratory Chengdu China

ISBN: (数字)9781665488778

ISBN: (纸本)9781665488778

Metamorphic Relation (MR) plays a crucial role in Metamorphic Testing (MT), which can be regarded as the implication relation from the input pattern to the output pattern. Based on MR's properties, the identification of Metamorphic Relations (MRs) can be from its input pattern and output pattern, respectively. However, the finding of the effective input pattern is very first and important. Especially for complicated mathematical function includes more than two input variables, we systematically analyze the structural model of input pattern in MR, propose the concept of the class of basic input pattern, as well as prove that any one input pattern can be expressed as a combination of basic input patterns in scientific computing programs. Moreover, the structural model of input pattern in MR is established based on previous proof. Finally, we put forward an identification algorithm framework and analysis its complexity. The core contribution of our method is to decompose the input pattern identification problem in multi-dimensional space into a single one-dimensional. For this reason, the examples show that the complexity of the algorithm is reduced significantly. © 2022 IEEE.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A generalized reliability analysis of 3-ary n-cubes

A generalized reliability analysis of 3-ary n-cubes

引用

International Conference on Communication Software and Networks, ICCSN

作者： Zefang Bai Guijuan Wang Meijie Ma School of Mathematics and Statistics Qilu University of Technology (Shandong Academy of Sciences) Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331506322

ISBN: (纸本)9798331506339

Evaluating the reliability of interconnection networks is crucial. The edge-connectivity is a parameter used to assess reliability. In this paper, we discuss a conditional edge-connectivity called the h-extra g-component edge-connectivity. It combines the extra edge-connectivity and the component edge-connectivity. First, this paper proved that $c \lambda_{3}^{h}\left(Q_{n}^{3}\right)=4 n h-$ $4 e_{h}\left(Q_{n}^{3}\right)-h$ for $1 \leq h \leq \frac{1}{2} \cdot 3^{\left\lceil\frac{h}{2}\right\rceil}, n \geq 3$. Then, the paper given the upper bound of h-extra g-component edge-connectivity of the 3 -ary n-cubes for $g \in\left\{4,3^{c}+1\right\}, 1 \leq c \leq\left\lceil\frac{n}{2}\right\rceil-1, n \geq 3$.

关键词： Upper bound Multiprocessor interconnection Software Reliability

来源：评论

学校读者我要写书评

暂无评论

The Propagation Background in Social Networks:Simulating and Modeling

引用

International Journal of Automation and computing 2020年第3期17卷 353-363页

作者： Kai Li Tong Xu Shuai Feng Li-Sheng Qiao Hua-Wei Shen Tian-Yang Lv Xue-Qi Cheng En-Hong Chen School of Computer Science and Technology University of Science and Technoloty of ChinaHefei 230027China IT Center of Chinese National Audit Office Beijing 100073China Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China

Recent years have witnessed the booming of online social network and social media platforms,which leads to a state of information *** extensive efforts have been made by publishers to struggle for the limited attention of audiences,still,only a few of information items will be received and ***,for simulating the information propagation process,competition among propagating items should be considered,which has been largely ignored by prior works on propagation *** possible reason may be that,it is almost impossible to identify the influence of propagation background from real diffusion *** that end,in this paper,we design a comprehensive framework to simulate the propagation process with the characteristics of user behaviors and network ***,we propose a propagation background simulating(PBS)algorithm to simulate the propagation background by using users′behavior dynamics and *** this line,an ICPB(independent cascade with propagation background)model is adapted to relieve the impact of propagation background by using users′*** experiments on kinds of synthetic and real networks have demonstrated the effectiveness of our methods.

关键词： Social network information overload propagation background simulating modeling

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Approaches for Road Damage Detection Using YOLOv8 and Custom Convolutional Neural Network

Deep Learning Approaches for Road Damage Detection Using YOL...

引用

Frontiers technology of Information and computer (ICFTIC), IEEE International Conference on

作者： Muhammad Waseem Khan Khalid Mahmood Israr Hussain Muhammad Talha Qureshi Hafiz Muhammad Sanaullah Badar Wu Gao Center for Bio-inspired System-on-Chip School of Computer Science Northwestern Poly technical University Xi'an P. R. China Graduate School of Intelligent Data Science National Yunlin University of Science and Technology Taiwan R.O.C Institute of Computing MNS University of Agriculture Multan Pakistan Henan University Kaifeng China

ISBN: (数字)9798331541750

ISBN: (纸本)9798331541767

The identification of road damage is deemed very important to the preservation of infrastructure. Since recent development in deep learning provide great potential approaches, in this paper, three deep learning models, namely EfficientNet, CNN and YOLOv8 are considered and their performance is evaluated on a dataset with 8,586 images with labelled road damages consisting of seven subclasses including longitudinal cracks and potholes. Besides, other issues like class imbalance and variabilities in the environment were studied and considered in its assessment based on the Models accuracy, precision, recall, and F1-score. With an accuracy of 64%, YOLOv8 is the most accurate model for identifying various types of damages, particularly in identifying multiple damages present in one or more types of damage, as was seen in the high accuracy rate of a split sample of 44 images of multiple damages. Our findings showcase YOLOv8 as a strong contender for real-time road damage detection with potential of enhancement with better augmentation and fine-tuning.

关键词： Deep learning Location awareness Accuracy Roads Image edge detection Transfer learning Real-time systems Data models Convolutional neural networks Reliability

来源：评论

学校读者我要写书评

暂无评论

AsyncSC: An Asynchronous Sidechain for Multi-Domain Data Exchange in Internet of Things

arXiv

引用

arXiv 2024年

作者： Yang, Lingxiao Dong, Xuewen Wan, Zhiguo Gao, Sheng Tong, Wei Lu, Di Shen, Yulong Du, Xiaojiang The School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'An710071 China The Zhejiang Lab Hangzhou311121 China The School of Information Central University of Finance and Economics Beijing100081 China The School of Information Science and Engineering Zhejiang Sci-Tech University Hangzhou310018 China The School of Computer Science and Technology Xidian University China The Shaanxi Key Laboratory of Network and System Security Xi'An710071 China The School of Engineering and Science Stevens Institute of Technology Hoboken07030 United States

Sidechain techniques improve blockchain scalability and interoperability, providing decentralized exchange and cross-chain collaboration solutions for Internet of Things (IoT) data across various domains. However, current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks, hindering efficient cross-chain interactions in discontinuous networks and leading to suboptimal data exchange. In this paper, we propose AsyncSC, a novel asynchronous sidechain construction. It employs a committee to provide Cross-Blockchain as a Service (C-BaaS) for data exchange in multi-domain IoT. To fulfill the need for asynchronous and efficient data exchange, we combine the ideas of aggregate signatures and verifiable delay functions to devise a novel cryptographic primitive called delayed aggregate signature (DAS), which constructs asynchronous cross-chain proofs (ACPs) that ensure the security of cross-chain interactions. To ensure the consistency of asynchronous transactions, we propose a multilevel buffered transaction pool that guarantees the transaction sequencing. We analyze and prove the security of AsyncSC, simulate an asynchronous communication environment, and conduct a comprehensive evaluation. The results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：