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

DEGAP: Dual Event-Guided Adaptive Prefixes for Templated-Based Event Argument Extraction with Slot Querying 31

学校读者我要写书评

暂无评论

DEGAP: Dual Event-Guided Adaptive Prefixes for Templated-Bas...

31st International Conference on Computational Linguistics, COLING 2025

作者： Wang, Guanghui Liu, Dexi Nie, Jian-Yun Wan, Qizhi Hu, Rong Liu, Xiping Liu, Wanlong Liu, Jiaming School of Information Management Jiangxi University of Finance and Economics China Canada School of Computer Science and Engineering University of Electronic Science and Technology of China China Department of Statistics Division of the Physical Sciences The University of Chicago United States

ISBN: (纸本)9798891761964

Recent advancements in event argument extraction (EAE) involve incorporating useful auxiliary information into models during training and inference, such as retrieved instances and event templates. These methods face two challenges: (1) the retrieval results may be irrelevant and (2) templates are developed independently for each event without considering their possible relationship. In this work, we propose DEGAP to address these challenges through a simple yet effective components: dual prefixes, i.e. learnable prompt vectors, where the instance-oriented prefix and template-oriented prefix are trained to learn information from different event instances and templates. Additionally, we propose an event-guided adaptive gating mechanism, which can adaptively leverage possible connections between different events and thus capture relevant information from the prefix. Finally, these event-guided prefixes provide relevant information as cues to EAE model without retrieval. Extensive experiments demonstrate that our method achieves new state-of-the-art performance on four datasets (ACE05, RAMS, WIKIEVENTS, and MLEE). Further analysis shows the impact of different components. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

Decoding the future: exploring and comparing ABE standards for cloud, IoT, blockchain security applications

学校读者我要写书评

暂无评论

Multimedia Tools and Applications 2025年第13期84卷 12299-12327页

作者： Singamaneni, Kranthi Kumar Yadav, Kusum Aledaily, Arwa N. Viriyasitavat, Wattana Dhiman, Gaurav Kaur, Amandeep Department of Computer Engineering and Technology Chaitanya Bharathi Institute of Technology T.S Gandipet Hyderabad500075 India College of Computer Science and Engineering University of Ha’il Hail Saudi Arabia Business Information Technology Division Department of Statistics Faculty of Commerce and Accountancy Chulalongkorn University Bangkok Thailand School of Sciences and Emerging Technologies Jagat Guru Nanak Dev Punjab State Open University Patiala India Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon Chitkara Centre for Research and Development Chitkara University Himachal Pradesh 173212 India Department of Computer Science and Engineering Graphic Era Deemed to be University Dehradun India Division of Research and Development Lovely Professional University Phagwara India Centre of Research Impact and Outcome Chitkara University Punjab Rajpura140417 India MEU Research Unit Middle East University Amman Jordan

Data security poses a significant challenge in cloud computing, the Internet of Things (IoT), and blockchain applications. Attribute-Based Encryption (ABE) has emerged as a promising cryptographic solution for secure data sharing and access management in these contexts. This research article focuses on enhancing security in cloud, IoT, and blockchain applications through a comprehensive examination and comparison of various ABE standards. The study begins with an in-depth literature review on ABE requirements, offering insights into the evolving landscape, challenges, and trends. This review serves as the foundation for the research, which aims to compare ABE standards based on cryptographic techniques, encryption/decryption processes, and access control rules, considering criteria like flexibility, efficiency, scalability, and security. Statistical analyses complement the comparative study, generating empirical data on ABE standard performance. Key metrics, including key size, storage overhead, encryption/decryption time, and computational complexity, are considered to identify trends and draw meaningful conclusions. The research also explores use cases for different ABE models within blockchain, IoT, and cloud computing applications, pinpointing scenarios where specific ABE models excel. The study contributes to advancing access control and secure data-sharing technologies in specified domains, aiding researchers, practitioners, and developers in selecting the most appropriate encryption method. By systematically outlining advantages and disadvantages of various Cipher Text ABE standards, the research facilitates informed decision-making. Additionally, practical use cases ensure alignment between ABE models and the distinctive traits and requirements of each domain, expanding the toolset for enhancing data security in blockchain, IoT, and cloud computing applications. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springe

关键词： Internet of things

Modelling and control of a multi-product pipeline transportation process

学校读者我要写书评

暂无评论

International Journal of Information Technology (Singapore) 2025年 1-11页

作者： Jiménez-Cabas, Javier Piñeres-Espitia, Gabriel Rodelo-Serrano, Esteban Pamucar, Dragan Ramirez-Leon, Hermes Butt, Shariq Aziz Naz, Sumera Simic, Vladimir Computer Science and Electronic Department Universidad de La Costa Barranquilla Colombia Departamento de Ingeniería Mecánica Universidad Simón Bolívar Barranquilla Venezuela Department of Operations Research and Statistics Faculty of Organizational Sciences University of Belgrade Belgrade Serbia Department of Industrial Engineering & Management Yuan Ze University Taoyuan Taiwan Department of Mechanics and Mathematics Western Caspian University Baku Azerbaijan Faculty of Transport and Traffic Engineering University of Belgrade Vojvode Stepe 305 Belgrade 11010 Serbia Department of Computer Science and Engineering College of Informatics Korea University Seoul 02841 South Korea School of Systems and Technology Department of Computer Science University of Management and Technology Lahore Pakistan Department of Mathematics Division of Science and Technology University of Education Lahore Pakistan

One of the most critical processes in the petroleum industry is transporting crude oil and its derivatives. Usually, it is done, due to easiness and economic aspects, through pipelines;several products, such as gasoline, kerosene, naphtha, and liquefied petroleum gas, among others, are moved in batch processes to both distribution and storage centers or transport ships. Since these transport systems transport different products, many works have focused on developing optimization strategies for scheduling these pipelines. That is, strategies that seek to optimize the use of the pipeline by establishing at what time points certain products must be transported. These strategies would be located at the planning level in the automation pyramid. In this work, on the other hand, different control strategies are proposed for a pipeline, but at the operation level. These strategies would be located at the control level, below the planning strategies in the automation pyramid. A pipeline of three pipe sections is modeled to develop the proposed control strategies, and the mathematical model is validated with actual data. The results show that, first, the proposed model approximates the actual behavior of the pipeline quite well and, second, that the combination of PID and feedforward control is an excellent alternative to implement control strategies for the operation of liquid transportation systems through pipelines. © Bharati Vidyapeeth's Institute of computer Applications and Management 2025.

关键词： control strategies liquid transportation modeling of system

Accelerating Medical Knowledge Discovery Through Automated Knowledge Graph Generation and Enrichment 6th

学校读者我要写书评

暂无评论

Accelerating Medical Knowledge Discovery Through Automated K...

6th International Conference on Knowledge Graphs and Semantic Web, KGSWC 2024

作者： Khalid, Mutahira Rahman, Raihana Abbas, Asim Kumari, Sushama Wajahat, Iram Bukhari, Syed Ahmad Chan TIB - Leibniz Information Centre for Science and Technology Lower Saxony Hannover30165 Germany Department of Statistics Harvard University CambridgeMA United States School of Computer Science University of Birmingham Edgbaston Birmingham United Kingdom Routing and Planning Amazon BellevueWA United States Institute for Biotechnology St. John’s University New York United States Division of Computer Science Mathematics and Science St. John’s University New York United States

ISBN: (纸本)9783031812200

Knowledge graphs (KGs) serve as powerful tools for organizing and representing structured knowledge. While their utility is widely recognized, challenges persist in their automation and completeness. Despite efforts in automation and the utilization of expert-created ontologies, gaps in connectivity remain prevalent within KGs. In response to these challenges, we propose an innovative approach termed "Medical Knowledge Graph Automation (M-KGA)". M-KGA leverages user-provided medical concepts and enriches them semantically using BioPortal ontologies, thereby enhancing the completeness of knowledge graphs through the integration of pre-trained embeddings. Our approach introduces two distinct methodologies for uncovering hidden connections within the knowledge graph: a cluster-based approach and a node-based approach. Through rigorous testing involving 300 frequently occurring medical concepts in Electronic Health Records (EHRs), our M-KGA framework demonstrates promising results obtained 50% accuracy, 57% F1-score, 50% recall and 65% precision on a cluster base approach. Similarly, we achieve 85% accuracy, 87% F1-score, 89% recall and 88% precision on a node base approach indicating its potential to address the limitations of existing knowledge graph automation techniques. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Knowledge graph

Capturing heterogeneous time-variation in covariate effects in non-proportional hazard regression models

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Hagemann, Niklas Kneib, Thomas Möllenhoff, Kathrin Institute of Medical Statistics and Computational Biology Faculty of Medicine University of Cologne Germany Division of Mathematics Department of Mathematics and Computer Science University of Cologne Germany Chair of Statistics and Campus Institute Data Science Georg August University Göttingen Germany

A central focus in survival analysis is examining how covariates influence survival time. These covariate effects are often found to be either time-varying, heterogeneous - such as being specific to patients, treatments, or subgroups - or exhibit both characteristics simultaneously. While the standard model, the Cox proportional hazards model, allows neither time-varying nor heterogeneous effects, several extensions to the Cox model as well as alternative modeling frameworks have been introduced. However, no unified framework for incorporating heterogeneously time-varying effects of covariates has been proposed. Such effects occur when a covariate influences survival not only in a heterogeneous and time-varying manner, but when the time-variation is also heterogeneous. We propose to model such effects by introducing heterogeneously time-varying coefficients to piecewise exponential additive mixed models. We deploy functional random effects, also known as factor smooths, to model such coefficients as the interaction effect of heterogeneity and timevariation. Our approach allows for non-linear time-effects due to being based on penalized splines and uses an efficient random effects basis to model the heterogeneity. Using a penalized basis prevents overfitting in case of absence of such effects. In addition, the penalization mostly solves the problem of choosing the number of intervals which is usually present in unregularized piecewise exponential approaches. We demonstrate the superiority of our approach in comparison to competitors by means of a simulation study. Finally, the practical application and relevance are outlined by presenting a brain tumor case study. © 2025, CC BY.

关键词： Regression analysis

Issues with Neural Tangent Kernel Approach to Neural Networks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Haoran Tai, Anthony Crandall, David J. Huang, Chunfeng Department of Statistics Indiana University Bloomington United States Naval Surface Warfare Center Crane Division United States Department of Computer Science Indiana University Bloomington United States

Neural tangent kernels (NTKs) have been proposed to study the behavior of trained neural networks from the perspective of Gaussian processes. An important result in this body of work is the theorem of equivalence between a trained neural network and kernel regression with the corresponding NTK. This theorem allows for an interpretation of neural networks as special cases of kernel regression. However, does this theorem of equivalence hold in practice? In this paper, we revisit the derivation of the NTK rigorously and conduct numerical experiments to evaluate this equivalence theorem. We observe that adding a layer to a neural network and the corresponding updated NTK do not yield matching changes in the predictor error. Furthermore, we observe that kernel regression with a Gaussian process kernel in the literature that does not account for neural network training produces prediction errors very close to that of kernel regression with NTKs. These observations suggest the equivalence theorem does not hold well in practice and puts into question whether neural tangent kernels adequately address the training process of neural networks. © 2025, CC BY.

关键词： Neural network models

RECOVERING SPARSE DFT FROM MISSING SIGNALS VIA INTERIOR POINT METHOD ON GPU

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Kuang, Wei Rao, Vishwas Montoison, Alexis Pacau, François Anitescu, Mihai Department of Statistics University of Chicago United States Mathematics and Computer Science Division Argonne National Laboratory United States Centre Automatique et Systèmes Mines Paris-PSL France

We propose a method to recover the sparse discrete Fourier transform (DFT) of a signal that is both noisy and potentially incomplete, with missing values. The problem is formulated as a penalized least-squares minimization based on the inverse discrete Fourier transform (IDFT) with an 1-penalty term, reformulated to be solvable using a primal-dual interior point method (IPM). Although Krylov methods are not typically used to solve Karush-Kuhn-Tucker (KKT) systems arising in IPMs due to their ill-conditioning, we employ a tailored preconditioner and establish new asymptotic bounds on the condition number of preconditioned KKT matrices. Thanks to this dedicated preconditioner — and the fact that FFT and IFFT operate as linear operators without requiring explicit matrix materialization — KKT systems can be solved efficiently at large scales in a matrix-free manner. Numerical results from a Julia implementation leveraging GPU-accelerated interior point methods, Krylov methods, and FFT toolkits demonstrate the scalability of our approach on problems with hundreds of millions of variables, inclusive of real data obtained from the diffuse scattering from a slightly disordered Molybdenum Vanadium Dioxide crystal. © 2025, CC BY.

关键词： Discrete Fourier transforms

Online Covariance Matrix Estimation in Sketched Newton Methods

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Kuang, Wei Anitescu, Mihai Na, Sen Department of Statistics The University of Chicago United States Mathematics and Computer Science Division Argonne National Laboratory United States School of Industrial and Systems Engineering Georgia Institute of Technology United States

Given the ubiquity of streaming data, online algorithms have been widely used for parameter estimation, with second-order methods particularly standing out for their efficiency and robustness. In this paper, we study an online sketched Newton method that leverages a randomized sketching technique to perform an approximate Newton step in each iteration, thereby eliminating the computational bottleneck of second-order methods. While existing studies have established the asymptotic normality of sketched Newton methods, a consistent estimator of the limiting covariance matrix remains an open problem. We propose a fully online covariance matrix estimator that is constructed entirely from the Newton iterates and requires no matrix factorization. Compared to covariance estimators for first-order online methods, our estimator for second-order methods is batch-free. We establish the consistency and convergence rate of our estimator, and coupled with asymptotic normality results, we can then perform online statistical inference for the model parameters based on sketched Newton methods. We also discuss the extension of our estimator to constrained problems, and demonstrate its superior performance on regression problems as well as benchmark problems in the CUTEst set. © 2025, CC BY.

关键词： Newton-Raphson method

Retraction Note: A Systematic Survey on Implementation of Fuzzy Regression Models for Real Life Applications

学校读者我要写书评

暂无评论

Archives of Computational Methods in Engineering 2025年 1-2页

作者： Khan, Mufala Kumar, Rakesh Aledaily, Arwa N. Kariri, Elham Viriyasitavat, Wattana Yadav, Kusum Dhiman, Gaurav Kaur, Amandeep Sharma, Ashutosh Vimal, S. Department of Mathematics Lovely Professional University Phagwara India College of Computer Science and Engineering University of Ha’il Hail Saudi Arabia College of Computer Science and Engineering Prince Sattam Bin Abdulaziz University Al‑Kharj Saudi Arabia Business Information Technology Division Department of Statistics Faculty of Commerce and Accountancy Chulalongkorn University Bangkok Thailand Department of Computer Science Government Bikram College of Commerce Patiala India Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon University Centre for Research and Development Department of Computer Science and Engineering Chandigarh University Gharuan India Department of Computer Science and Engineering Graphic Era Deemed to be University Dehradun India Chitkara University Institute of Engineering and Technology Chitkara University Rajpura India School of Computer Science University of Petroleum and Energy Studies Dehradun India Department of Artificial Intelligence and Data Science Ramco Institute of Technology Rajaplayam India