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

8th IEEE International Conference on Intelligent Transportation Engineering, ICITE 2023

作者： Guo, Yuyan Liu, Tao Institute of System Science and Engineering School of Transportation and Logistics Southwest Jiaotong University National Engineering Laboratory of Integrated Transportation Big Data Application Technology Chengdu China

ISBN: (纸本)9798350314212

With the advantages of zero emission and comfortable riding experience, battery-electric buses (BEBs) are widely adopted in public transit agencies as a green alternative to conventional diesel buses. Battery swapping technology is an efficient and promising charging technology to address the issues of battery range anxiety and long battery charging time. This study developed a two-stage optimization model to optimize the single-line battery-electric bus scheduling problem considering battery swapping. At the first stage, a bi-objective integer programming model is established to determine the minimum BEB fleet size, together with the BEB-to-trip assignment and battery swapping schedule. At the second stage, an integer linear programming model is formulated to determine the required minimum number of batteries. An e-constraint method is designed to investigate the trade-off between the required minimum fleet size and the number of back-up batteries. Finally, a real-world case study of a BEB line in Chengdu, China, is conducted to demonstrate the effectiveness of the optimization model and solution method. Sensitivity analyses are further conducted to understand the impacts of some key parameters, including battery capacity, number of trips, cycle time, and battery swapping time. The results show that battery capacity and cycle time have significant influences on BEB-to-trip assignment results and battery swapping schedule. © 2023 IEEE.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Intelligent Model SFAHP-ANFIS-PSO for Technical Capability Evaluation of Manufacturing Enterprises 9th

A Hybrid Intelligent Model SFAHP-ANFIS-PSO for Technical Cap...

引用

19th International Conference on Advanced data Mining and Applications, ADMA 2023

作者： Liu, Tingting Ding, Xuefeng Jiang, Yuming Hu, Dasha College of Computer Science Sichuan University Chengdu610065 China Big Data Analysis and Fusion Application Technology Engineering Laboratory of Sichuan Province Chengdu610065 China

ISBN: (纸本)9783031466731

In the collaborative production environment of manufacturing tasks, the evaluation of enterprise technical capability in advance has a direct impact on the high-performance collaboration between the supplier and the demander of production tasks. In order to solve the problem of efficiency and accuracy in the past evaluation methods, this paper applies the adaptive neuro fuzzy inference system (ANFIS) to the field of enterprise technical capability evaluation for the first time, and proposes an improved hybrid intelligent model SFAHP-ANFIS-PSO based on fuzzy theory. The model takes the four key indexes which have the deepest impact on enterprise technical capability evaluation as the input variables of the model, and the input data are evaluated by ANFIS with high accuracy. Spherical fuzzy analytic hierarchy process (SFAHP) calculated the weight of each evaluation index to preprocess the ANFIS model. Particle swarm optimization algorithm (PSO) continuously optimized the model parameters in the training process, shortened the model training time, improved the evaluation efficiency, and further improved the accuracy of the evaluation results. The experimental results show that the SFAHP-ANFIS-PSO model has high convergence speed and accuracy of results, and can be used to evaluate the technical capability of enterprises with high efficiency and high accuracy. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Analytic hierarchy process

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Modeling Attack on Multiplexer PUFs via Kronecker Matrix Multiplication

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Wang, Hongfei Wan, Caixue Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China

The Physical Unclonable Function (PUF) is valued for its lightweight nature and unique functionality, making it a common choice for securing hardware products requiring authentication and key generation mechanisms. In response to the susceptibility of individual PUFs to modeling attacks, advanced PUF variants have been developed to improve security measures. One notable type in this regard is the multiplexer-based composition of arbiter PUFs, known as MPUF, which aims to meet high reliability and security standards simultaneously. Current research on attacking MPUF encounters challenges such as substantial demands for training CRPs and low success rates. In this work, we propose a novel numerical modeling attack strategy for MPUFs. Using Kronecker products from mathematical perspective, this method precisely describe the MPUF model without using complex network architectures, boosting attack accuracy and overall efficiency. Experiment comparison with state-of-the-art works demonstrates that our method achieves better performance in terms of attack accuracy, robustness, and efficiency. Our method is able to successfully attack a (512, 8)-MPUF in 32.71 minutes with 97.14% accuracy, outperforming all existing attack methods on MPUFs. More, we validate our method through experiments with hardware implementations on FPGAs. The advantages of our method also include the adaptability to be employed to attack other MPUF variations like cMPUF and rMPUF, and the capability to be integrated with an existing attack method for launching efficient attack on MPUFs leveraging reliability information. © 2025 IEEE.

关键词： modeling attack multiplexer-based PUF Physical unclonable function

来源：评论

学校读者我要写书评

暂无评论

TCN Stock Price Prediction Model Based on Channel Attention Mechanism

TCN Stock Price Prediction Model Based on Channel Attention ...

引用

2023 IEEE International Conference on Control, Electronics and Computer technology, ICCECT 2023

作者： He, Jing Feng, Yuanliu Zhu, Jiayi Beihang University Institute for Advanced Studies in Humanities and Social Science Beijing China Beijing Qingbo Big Data Technology Co. Ltd. Beijing China

ISBN: (纸本)9798350399028

Since the stock price fluctuations of the concept stocks of the metaverse culture and media sector has the same sector correlation, this paper proposes an improved TCN (Temporal Convolutional Network) models based on the channel attention mechanism, which makes the model focus on effective feature channels. First draw the heat map of the Pearson correlation coefficient of the stock closing price, insert the channel attention module on the TCN basic model;then use the standardized method to process the sample data, unify the sample data dimension, and construct the data set. The experimental results show that the performance of the improved TCN model based on the channel attention mechanism on A shares and US stocks is the same as the RMSE (Root square error) of the prediction results of multiple stocks. Better than the TCN basic model, using the channel attention weights to correct each channel can help the model learn and converge better, and it is effective for the optimization of the prediction model. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Task-Aware Dynamic Transformer for Efficient Arbitrary-Scale Image Super-Resolution 27

Task-Aware Dynamic Transformer for Efficient Arbitrary-Scale...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Xu, Tianyi Zhou, Yijie Hu, Xiaotao Zhang, Kai Zhang, Anran Qiu, Xingye Xu, Jun School of Statistics and Data Science Nankai University Tianjin China College of Computer Science Nankai University Tianjin China School of Intelligence Science and Technology Nanjing University Suzhou China Tencent Data Platform Beijing China Zhejiang University Hangzhou China Systems Engineering Research Institute China State Shipbuilding Corporation Limited Beijing China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9781643685489

Arbitrary-scale super-resolution (ASSR) aims to learn a single model for image super-resolution at arbitrary magnifying scales. Existing ASSR networks typically comprise an off-the-shelf scale-agnostic feature extractor and an arbitrary scale upsampler. These feature extractors often use fixed network architectures to address different ASSR inference tasks, each of which is characterized by an input image and an upsampling scale. However, this overlooks the difficulty variance of super-resolution on different inference scenarios, where simple images or small SR scales could be resolved with less computational effort than difficult images or large SR scales. To tackle this difficulty variability, in this paper, we propose a Task-Aware Dynamic Transformer (TADT) as an input-adaptive feature extractor for efficient image ASSR. Our TADT consists of a multi-scale feature extraction backbone built upon groups of Multi-Scale Transformer Blocks (MSTBs) and a Task-Aware Routing Controller (TARC). The TARC predicts the inference paths within feature extraction backbone, specifically selecting MSTBs based on the input images and SR scales. The prediction of inference path is guided by a new loss function to trade-off the SR accuracy and efficiency. Experiments demonstrate that, when working with three popular arbitrary-scale upsamplers, our TADT achieves state-of-the-art ASSR performance when compared with mainstream feature extractors, but with relatively fewer computational costs. The code is available at https://***/Tillyhere/TADT. © 2024 The Authors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Constructing prediction intervals to explore uncertainty based on deep neural networks

引用

Journal of Intelligent and Fuzzy Systems 2024年第4期46卷 10441-10456页

作者： Yang, Jingling Chen, Liren Chen, Huayou Liu, Jinpei Han, Bing School of Big Data and Statistics Anhui University Hefei China School of Marine Science and Technology Tianjin University Tianjin China School of Business Anhui University Anhui Hefei China Department of Industrial and Systems Engineering North Carolina State University RaleighNC United States School of Mathematical Science Anhui University Hefei China

The conventional approaches to constructing Prediction Intervals (PIs) always follow the principle of 'high coverage and narrow width'. However, the deviation information has been largely neglected, making the PIs unsatisfactory. For high-risk forecasting tasks, the cost of forecast failure may be prohibitive. To address this, this work introduces a multi-objective loss function that includes Prediction Interval Accumulation Deviation (PIAD) within the Lower Upper Bound Estimation (LUBE) framework. The proposed model can achieve the goal of 'high coverage, narrow width, and small bias' in PIs, thus minimizing costs even in cases of prediction failure. A salient feature of the LUBE framework is its ability to discern uncertainty without explicit uncertainty labels, where the data uncertainty and model uncertainty are learned by Deep Neural Networks (DNN) and a model ensemble, respectively. The validity of the proposed method is demonstrated through its application to the prediction of carbon prices in China. Compared with conventional uncertainty quantification methods, the improved interval optimization method can achieve narrower PI widths. © 2024 - IOS Press. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Social recommendation model based on hypergraph deep representation learning 5

A Social recommendation model based on hypergraph deep repre...

引用

5th International Conference on Computer Vision and data Mining, ICCVDM 2024

作者： Huang, Shan Liu, Yanan Wu, Yufan Wang, Jinlan Duan, Xiaodong College of Computer Science and Engineering Dalian Minzu University Dalian116600 China State Ethnic Affairs Commission Key Laboratory of Big Data Applied Technology Dalian Minzu University Dalian116600 China

ISBN: (纸本)9781510682863

In social recommendation, user's interest preference is influenced by multiple factors. It is a challenging problem to mine data information effectively in multiple types of interaction behaviors between users and items to obtain more accurate embedding of user items. Existing social recommendation models tend to take a homogeneous approach to the interaction effects of neighbourhood nodes on target nodes. We propose a social recommendation model based on deep representation learning of hypergraphs. The model aims to learn embedded representations of users and items from multi-type user-item interaction data efficiently. An attention mechanism that integrating time interval information is introduced for computing the preference weights of each item to the user. Messages are generated with time-interval attention weights the inter-user and inter-item hypergraph information is combined to update the messages and aggregate the information from multiple layers. Extensive experiments on two real datasets show that the proposed models are superior to other advanced recommendation methods in improving the recommendation performance. © 2024 SPIE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Text-Image Scene Graph Fusion for Multimodal Named Entity Recognition

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2828-2839页

作者： Cheng, Jian Long, Kaifang Zhang, Shuang Zhang, Tian Ma, Lianbo Cheng, Shi Guo, Yinan State Key Laboratory for Intelligent Coal Mining and Strata Control Research Institute of Mine Big Data Chinese Institute of Coal Science Beijing100013 China Northeastern University College of Software Shenyang110819 China Shaanxi Normal University College of Computer Science Xi'an710062 China China University of Mining and Technology Xuzhou221116 China

With the popularity and widespread use of social media platforms, such as Twitter and Facebook, massive amounts of text and image information posted by a variety of users have flooded these social media platforms. Thus, multimodal named entity recognition (MNER) has become a research hotspot for the task of extracting named entities from multimodal data. Empirically, the visual clues unrelated to text data may introduce uncertain or even negative impacts on the named entity recognition. The considerations of the relevance of multimodal data have been ignored in the previous studies. In this article, to effectively measure the relationship between text data and visual cues for improving the accuracy of named entities, we propose a text-image scene graph fusion (TISGF) approach with a text-image similarity assessment module (TISA) and a text-image fusion module (TIF) for MNER. Specifically, we first construct two (visual and textual) scene graphs to exploit the joint features of objects and relations in text and image and encode the two scene graphs separately using a specific encoder pair. In this way, we can obtain both object-level and relationship-level cross-modal features. Subsequently, TISA is used to compute the similarity of the image and text data and to determine the proportion of visual information that will be retained for fusion. Finally, we use TIF to achieve a unified multimodal representation of each word and predict the entity type using conditional random fields. Extensive experiment results on two public datasets demonstrate the effectiveness and competitiveness of our proposed method for the MNER task. © 2020 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Analysis of MFCC and Chromagram Features in Lightweight Bidirectional LSTM and Attention Models for Music Genre Classification 21

Analysis of MFCC and Chromagram Features in Lightweight Bidi...

引用

21st International Computer Conference on Wavelet Active Media technology and Information Processing, ICCWAMTIP 2024

作者： Huang, Renxiang Li, Xu Li, Jianping School of Artificial Intelligence and Big Data Sichuan University of Arts and Science China Khoury College of Computer Science Northeastern university BostonMA02115 United States School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu610054 China

ISBN: (纸本)9798331519254

Music genre classification is essential for organizing music libraries and enhancing recommendation systems. This paper evaluates four lightweight models combining Mel Frequency Cepstral Coefficients (MFCCs) and Chromagram features with Bidirectional LSTM and Multi-head Attention architectures. Using the GTZAN dataset, we found that models with Multi-head Attention, outperformed with MFCCs features, achieving a test accuracy of 85.6%. MFCCs excel in capturing timbral characteristics critical for genre classification, while Chromagram features proved less effective. Although overfitting occurred, future studies can focus on incorporating methods like data augmentation and regularization to improve performance. These lightweight models offer a balance between accuracy and computational efficiency, making them suitable for real-time applications. © 2024 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：