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

Probabilistic Reliability via Subsystem Structures of Arrangement Graph Networks

IEEE Transactions on Reliability 2024年第1期73卷 279-289页

作者： Huang, Yanze Lin, Limei Xu, Li Hsieh, Sun-Yuan Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fuzhou350118 China Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou350117 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid growth of the number of processors in a multiprocessor system, faulty processors occur in it with a probability that rises quickly. The probability of a subsystem with an appropriate size being fault-free in a definite time interval is a significant and practical measure of the reliability for a multiprocessor system, which characterizes the functionality of a multiprocessor system well. Motivated by the study of subgraph reliability, as well as the attractive structure and fault tolerance properties of (n, k)-arrangement graph A n, k, we focus on the subgraph reliability for A n, k under the probabilistic fault model in this article. First, we investigate intersections of no more than four subgraphs in A n, k, and classify all the intersecting modes. Second, we focus on the probability P(q, A n, k n-1, k-1) with which at least one (n-1, k-1)-subarrangement graph is fault-free in A n, k, when given a uniform probability q with which a single vertex is fault-free, and we establish the P(q, A n, kn-1, k-1) by adopting the principle of inclusion-exclusion under the probabilistic fault model. Finally, we study the probabilistic fault model involving a nonuniform probability with which a single vertex is fault-free, and we prove that the P(q, A n, kn-1, k-1) under both models is very close to the asymptotic value by both theoretical arguments and experimental results. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

SCTAP: Supporting Scenario-Centric Trigger-Action Programming based on Software-Defined Physical Environments 23

SCTAP: Supporting Scenario-Centric Trigger-Action Programmin...

引用

2023 World Wide Web Conference, WWW 2023

作者： Sun, Bingkun Shen, Liwei Peng, Xin Wang, Ziming Fudan University China School of Computer Science Shanghai Key Laboratory of Data Science Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China

ISBN: (纸本)9781450394161

The physical world we live in is accelerating digitalization with the vigorous development of Internet of Things (IoT). Following this trend, Web of Things (WoT) further enables fast and efficient creation of various applications that perceive and act on the physical world using standard Web technologies. A popular way for creating WoT applications is Trigger-Action Programming (TAP), which allows users to orchestrate the capabilities of IoT devices in the form of "if trigger, then action". However, existing TAP approaches don't support scenario-centric WoT applications which involve abstract modeling of physical environments and complex spatio-temporal dependencies between events and actions. In this paper, we propose an approach called SCTAP which supports Scenario-Centric Trigger-Action Programming based on software-defined physical environments. SCTAP defines a structured and conceptual representation for physical environments, which provides the required programming abstractions for WoT applications. Based on the representation, SCTAP defines a grammar for specifying scenario-centric WoT applications with spatio-temporal dependencies. Furthermore, we design a service-based architecture for SCTAP which supports the integration of device access, event perception, environment representation, and rule execution in a loosely-coupled and extensible way. We implement SCTAP as a WoT infrastructure and evaluate it with two case studies including a smart laboratory and a smart coffee house. The results confirm the usability, feasibility and efficiency of SCTAP and its implementation. © 2023 ACM.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

A Unified Visual Prompt Tuning Framework with Mixture-of-Experts for Multimodal Information Extraction 28th

A Unified Visual Prompt Tuning Framework with Mixture-of-Ex...

引用

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Xu, Bo Huang, Shizhou Du, Ming Wang, Hongya Song, Hui Xiao, Yanghua Lin, Xin School of Computer Science and Technology Donghua University Shanghai China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China Fudan-Aishu Cognitive Intelligence Joint Research Center Shanghai China East China Normal University Shanghai China

ISBN: (纸本)9783031306747

Recently, multimodal information extraction has gained increasing attention in social media understanding, as it helps to accomplish the task of information extraction by adding images as auxiliary information to solve the ambiguity problem caused by insufficient semantic information in short texts. Despite their success, current methods do not take full advantage of the information provided by the diverse representations of images. To address this problem, we propose a novel unified visual prompt tuning framework with Mixture-of-Experts to fuse different types of image representations for multimodal information extraction. Extensive experiments conducted on two different multimodal information extraction tasks demonstrate the effectiveness of our method. The source code can be found at https://***/xubodhu/VisualPT-MoE. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

StoryLLaVA: Enhancing Visual Storytelling with Multi-Modal Large Language Models 31

StoryLLaVA: Enhancing Visual Storytelling with Multi-Modal L...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Yang, Li Xiao, Zhiding Huang, Wenxin Zhong, Xian Hubei Key Laboratory of Big Data Intelligent Analysis and Application School of Computer Science and Information Engineering Hubei University China Hubei Key Laboratory of Transportation Internet of Things School of Computer Science and Artificial Intelligence Wuhan University of Technology China

ISBN: (纸本)9798891761964

The rapid development of multi-modal large language models (MLLMs) has positioned visual storytelling as a crucial area in content creation. However, existing models often struggle to maintain temporal, spatial, and narrative coherence across image sequences and frequently lack the depth and engagement of human-authored stories. To address these challenges, we propose Story with Large Language and Vision Assistant (StoryLLaVA), a novel framework for enhancing visual storytelling. Our approach introduces a Topic-Driven Narrative Optimizer (TDNO) that improves both the training data and MLLM models by integrating image descriptions, topic generation, and GPT-4-based refinements. Furthermore, we employ a preference-based ranked story sampling method that aligns model outputs with human storytelling preferences through positive-negative pairing. These two phases of the framework differ in their training methods: the former uses supervised fine-tuning, while the latter incorporates reinforcement learning with positive and negative sample pairs. Experimental results demonstrate that StoryLLaVA outperforms current models in visual relevance, coherence, and fluency, with LLM-based evaluations confirming the generation of richer and more engaging narratives. The enhanced dataset and model are available at https://***/XxxZzD/StoryLLaVA. © 2025 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Broadband single-polarization single-mode low confinement loss hollow core anti-resonant fiber with semi-elliptical nested tube

引用

Optical and Quantum Electronics 2025年第4期57卷 1-12页

作者： Lin, Wen Fei, Yihong Wang, Ning Jia, Hongzhi Engineering Research Center of Optical Instruments and Systems Ministry of Education Shanghai Key Laboratory of Modern Optical Systems School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai200093 China

In this paper, a hollow-core anti-resonant optical fibre containing a semi-elliptical nested tube is proposed, which has the characteristics of single-polarization, large bandwidth, single-mode and low confinement loss. By optimizing the structural design, the polarization extinction ratio (PER) of the fiber reaches 21,0183 at a wavelength of 1.55 μm, and the y-polarized fundamental mode loss is only 0.00086 dB/m. By changing the material and thickness of the semi-ellipsoidal nested tube, a large bandwidth of 280 nm was achieved in the wavelength range of 1.51-1.78 μm, with loss limited to less than 0.001 dB/m within the bandwidth range. The PER and higher-order mode extinction ratio of 4870, 1487, respectively. The loss remains below 0.01 dB/m when the bending radius exceeds 4.5 cm. Therefore, it is expected that this optical fiber can be used in optical devices such as fiber optic sensors, fiber optic lasers and fiber optic gyroscopes. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Single mode fibers

来源：评论

学校读者我要写书评

暂无评论

Understanding and improving fairness in cognitive diagnosis

引用

science China(Information sciences) 2024年第5期67卷 99-114页

作者： Zheng ZHANG Le WU Qi LIU Jiayu LIU Zhenya HUANG Yu YIN Yan ZHUANG Weibo GAO Enhong CHEN Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology& School of Data Science University of Science and Technology of China State Key Laboratory of Cognitive Intelligence School of Computer Science and Information Engineering Hefei University of Technology

Intelligent education is a significant application of artificial intelligence. One of the key research topics in intelligence education is cognitive diagnosis, which aims to gauge the level of proficiency among students on specific knowledge concepts(e.g., Geometry). To the best of our knowledge, most of the existing cognitive models primarily focus on improving diagnostic accuracy while rarely considering fairness issues; for instance, the diagnosis of students may be affected by various sensitive attributes(e.g., region). In this paper,we aim to explore fairness in cognitive diagnosis and answer two questions:(1) Are the results of existing cognitive diagnosis models affected by sensitive attributes?(2) If yes, how can we mitigate the impact of sensitive attributes to ensure fair diagnosis results? To this end, we first empirically reveal that several wellknown cognitive diagnosis methods usually lead to unfair performances, and the trend of unfairness varies among different cognitive diagnosis models. Then, we make a theoretical analysis to explain the reasons behind this phenomenon. To resolve the unfairness problem in existing cognitive diagnosis models, we propose a general fairness-aware cognitive diagnosis framework, FairCD. Our fundamental principle involves eliminating the effect of sensitive attributes on student proficiency. To achieve this, we divide student proficiency in existing cognitive diagnosis models into two components: bias proficiency and fair *** design two orthogonal tasks for each of them to ensure that fairness in proficiency remains independent of sensitive attributes and take it as the final diagnosed result. Extensive experiments on the Program for International Student Assessment(PISA) dataset clearly show the effectiveness of our framework.

关键词： fairness intelligent education cognitive diagnosis psychometrics adversarial learning

来源：评论

学校读者我要写书评

暂无评论

Prior-Boosted GRL: Microarchitecture Design Space Exploration via Graph Representation Learning

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 1141-1154页

作者： Wu, Zheng Shen, Jinyi Yi, Xiaoling Shang, Li Yang, Fan Zeng, Xuan Fudan University State Key Laboratory of Integrated Circuits and Systems The School of Microelectronics Shanghai200433 China Fudan University State Key Laboratory of Integrated Circuits and Systems Shanghai200433 China KU Leuven Department of Electrical Engineering Microelectronics Circuits and Systems Leuven3000 Belgium Fudan University State Key Laboratory of Integrated Circuits and Systems The School of Computer Science Shanghai200433 China

The design space exploration (DSE) of contemporary microprocessors faces a significant challenge of high-computational cost. In this context, we introduce Prior-boosted graph representation learning (GRL), a novel framework for the DSE of the microarchitectures the microprocessors underpinned by graph embeddings. Using GRL, Prior-boosted GRL constructs a compact and continuous vector space for design representation. This framework is further boosted by an efficient sampling algorithm informed by prior knowledge, which is instrumental in generating a superior set of initial designs to accelerate the exploration process. A well-designed ensemble surrogate model is combined with the multiobjective Bayesian optimization to explore the design space holistically within this graph-embedding domain. Rigorous experimental evaluations conducted on the RISC-V Berkeley-Out-of-Order Machine (BOOM) platform demonstrate that Prior-boosted GRL substantially surpasses preceding methods, achieving a 107.79% enhancement in Pareto front quality compared to the state-of-the-art DSE algorithm. It also outstrips manual designs on performance, power, and area metrics. As of this writing, Prior-boosted GRL holds the first place in the ICCAD 2022 CAD Contest evaluation platform. © 2024 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Solving Multiobjective Combinatorial Optimization via Learning to Improve Method

引用

IEEE Transactions on Emerging Topics in Computational Intelligence 2025年第3期9卷 2122-2136页

作者： Ye, Te Zhang, Zizhen Zhang, Qingfu Chen, Jinbiao Wang, Jiahai Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510275 China City University of Hong Kong Department of Computer Science Kowloon Hong Kong

Recently, neural combinatorial optimization (NCO) methods have been prevailing for solving multiobjective combinatorial optimization problems (MOCOPs). Most NCO methods are based on the "Learning to Construct"(L2C) paradigm, where the trained model(s) can directly generate a set of approximate Pareto optimal solutions. However, these methods still suffer from insufficient proximity and poor diversity towards the true Pareto front. In this paper, following the "Learning to Improve"(L2I) paradigm, we propose weight-related policy network (WRPN), a learning-based improvement method for solving MOCOPs. WRPN is incorporated into multiobjective evolutionary algorithm (MOEA) frameworks to effectively guide the search direction. A shared baseline for proximal policy optimization is presented to reduce variance in model training. A quality enhancement mechanism is designed to further refine the Pareto set during model inference. Computational experiments conducted on two classic MOCOPs, i.e., multiobjective traveling salesman problem and multiobjective vehicle routing problem, indicate that our method achieves remarkable results. Notably, our WRPN module can be easily integrated into various MOEA frameworks such as NSGA-II, MOEA/D and MOGLS, providing versatility and applicability across different problem domains. © 2025 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Fine extraction of multi-crop planting area based on deep learning with Sentinel- 2 time-series data

引用

Environmental science and Pollution Research 2025年第19期32卷 11931-11949页

作者： Jiang, Jingmin Zhang, Jiahua Wang, Xue Zhang, Shichao Kong, Delong Wang, Xiaopeng Ali, Shawkat Ullah, Hidayat Space Information and Big Earth Data Research Center School of Computer Science and Technology Qingdao University Qingdao266071 China Key Laboratory of Digital Earth Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China

Accurate and timely access to the spatial distribution of crops is crucial for sustainable agricultural development and food security. However, extracting multi-crop areas based on high-resolution time-series data and deep learning still faces challenges. Therefore, this study aims to provide an effective model for multi-crop classification using high-resolution remote sensing time-series data. We designed two deep learning models based on convolutional neural network-long short-term memory (CNN-LSTM) and bidirectional long short-term memory (Bi-LSTM). The monthly synthetic time series of the normalized difference vegetation index (NDVI) from Sentinel-2 data will be used as input features to extract the multi-crop planting area in Shandong province’s northwestern, southwestern, and eastern regions. The results showed that deep learning models achieved higher accuracy compared to the random forest (RF) and extreme gradient boosting (XGBoost) models, with CNN-LSTM achieving the highest overall accuracy of 96.48%. At the county level, the coefficients of determination (R2) for the CNN-LSTM model were 0.91 for wheat, 0.88 for maize, and 0.73 for spring cotton. This study demonstrates that the CNN-LSTM model combined with monthly synthetic time-series NDVI provides a feasible approach for accurately mapping high-resolution multi-crop planting areas and also contributes significantly to decision support and resource management in agricultural production. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Deep learning High-resolution Monthly synthetic time-series NDVI Multi-crop classification Remote sensing Sentinel- 2

来源：评论

学校读者我要写书评

暂无评论

Automatic ICD Coding Based on Segmented ClinicalBERT with Hierarchical Tree Structure Learning 28th

Automatic ICD Coding Based on Segmented ClinicalBERT with ...

引用

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Kang, Beichen Wang, Xiaosu Xiong, Yun Zhang, Yao Zhou, Chaofan Zhu, Yangyong Zhang, Jiawei Tang, Chunlei Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China IFM Lab Department of Computer Science University of California DavisCA United States Harvard Medical School BostonMA United States

ISBN: (纸本)9783031306778

Automatic ICD coding aims at assigning the international classification of disease (ICD) codes to clinical notes documented by clinicians, which is crucial for saving human resources and has attracted much research attention in recent years. However, facing the challenges brought by the complex long textual narratives in clinical notes and the long-tailed data distribution in ICD codes, existing studies are ineffectual in the struggle to extract key information from the clinical notes and handle large amounts of small-data learning problems on the tail codes, which makes it hard to achieve satisfactory performance. In this paper, we present a ClinicalBERT-based model for automatic ICD coding, which can effectively cope with complex long clinical narratives via a segmentation learning mechanism and take advantage of the tree-like structure of ICD codes to transmit information among code nodes. Specifically, a novel hierarchical tree structure learning module is proposed to enable each code to utilize information both from upper and lower nodes of the tree, so that better code classifiers are learned for both head and tail codes. Experiments on MIMIC-III dataset show that our model outperforms current state-of-the-art (SOTA) ICD coding methods. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Clinical research

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：