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

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Novelty of Different Distance Approach for Multi-Criteria Decision-Making Challenges Using q-Rung Vague Sets

引用

computer Modeling in Engineering & sciences 2024年第6期139卷 3353-3385页

作者： Murugan Palanikumar Nasreen Kausar Dragan Pamucar Seifedine Kadry Chomyong Kim Yunyoung Nam Saveetha School of Engineering Saveetha Institute of Medical and Technical SciencesChennai602105India Department of Mathematics Faculty of Arts and ScienceYildiz Technical UniversityEsenlerIstanbul34220Turkey Department of Operations Research and Statistics Faculty of Organizational SciencesUniversity of BelgradeBelgrade11000Serbia College of Engineering Yuan Ze UniversityTaoyuan City320315TaiwanChina Department of Applied Data Science Noroff University CollegeKristiansand4612Norway Artificial Intelligence Research Center(AIRC) Ajman UniversityAjman346United Arab Emirates Department of Electrical and Computer Engineering Lebanese American UniversityByblos1102-2801Lebanon ICT Convergence Research Center Soonchunhyang UniversityAsan31538South Korea Department of Computer Science and Engineering Soonchunhyang UniversityAsan31538South Korea

In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung normal vague weighted averaging(log q-rung NVWA),a log q-rung normal vague weighted geometric(log q-rung NVWG),a log generalized q-rung normal vague weighted averaging(log Gq-rung NVWA),and a log generalized q-rungnormal vagueweightedgeometric(logGq-rungNVWG)operator are discussed in this *** is provided of the scoring function,accuracy function and operational laws of the log q-rung *** algorithms underlying these functions are also described.A numerical example is provided to extend the Euclidean distance and the Humming ***,idempotency,boundedness,commutativity,and monotonicity of the log q-rung VS are examined as they facilitate recognizing the optimal alternative more quickly and help clarify *** chose five anemia patients with four types of symptoms including seizures,emotional shock or hysteria,brain cause,and high fever,who had either retrograde amnesia,anterograde amnesia,transient global amnesia,post-traumatic amnesia,or infantile *** numbers q are used to express the results of the *** demonstrate the effectiveness and accuracy of the models we are investigating,we compare several existing models with those that have been developed.

关键词： Vague set aggregating operators euclidean distance hamming distance decision making

来源：评论

学校读者我要写书评

暂无评论

ARSlice:Head-Mounted Display Augmented with Dynamic Tracking and Projection

引用

Journal of computer science & Technology 2022年第3期37卷 666-679页

作者： Yu-Ping Wang Sen-Wei Xie Li-Hui Wang Hongjin Xu Satoshi Tabata Masatoshi Ishikawa Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China Institute of Semiconductors Guangdong Academy of SciencesGuangzhou 510651China Data Science Research Division Information Technology CenterThe University of TokyoTokyo 113-8656Japan Core Network Department Advanced Operations Development DivisionKDDI CooperationTokyo 206-0034Japan Tokyo University of Science Tokyo 113-8601Japan

Computed tomography(CT)generates cross-sectional images of the *** CT images has been a challenging *** emergence of the augmented and virtual reality technology has provided promising ***,existing solutions suffer from tethered display or wireless transmission *** this paper,we present ARSlice,a proof-of-concept prototype that can visualize CT images in an untethered manner without wireless transmission *** ARSlice prototype consists of two parts,the user end and the projector *** employing dynamic tracking and projection,the projector end can track the user-end equipment and project CT images onto it in real *** user-end equipment is responsible for displaying these CT images into the 3D *** main feature is that the user-end equipment is a pure optical device with light weight,low cost,and no energy *** experiments demonstrate that our ARSlice prototype provides part of six degrees of freedom for the user,and a high frame *** interactively visualizing CT images into the 3D space,our ARSlice prototype can help untrained users better understand that CT images are slices of a body.

关键词： augmented and virtual reality computed tomography(CT)image visualization interactive visualization

来源：评论

学校读者我要写书评

暂无评论

Twin Transition or Competing Interests? Validation of the Artificial Intelligence and Sustainability Perceptions Inventory (AISPI)

arXiv

引用

arXiv 2025年

作者： Bush, Annika Research Center Trustworthy Data Science and Security University Alliance Ruhr Faculty of Computer Science Technical University Dortmund Dortmund Germany

As artificial intelligence (AI) and sustainability initiatives increasingly intersect, understanding public perceptions of their relationship becomes crucial for successful implementation. However, no validated instrument exists to measure these specific perceptions. This paper presents the development and validation of the Artificial Intelligence and Sustainability Perceptions Inventory (AISPI), a novel 13-item instrument measuring how individuals view the relationship between AI advancement and environmental sustainability. Through factor analysis (N = 105), we identified two distinct dimensions: ‘Twin Transition’ and ‘Competing Interests’. The instrument demonstrated strong reliability (α = .89) and construct validity through correlations with established measures of AI and sustainability attitudes. Our findings suggest that individuals can simultaneously recognize both synergies and tensions in the AI-sustainability relationship, offering important implications for researchers and practitioners working at this critical intersection. This work provides a foundational tool for future research on public perceptions of AI’s role in sustainable development. © 2025, CC BY-NC-ND.

关键词： Sustainable development goals

来源：评论

学校读者我要写书评

暂无评论

Improved Dwarf Mongoose Optimization for Constrained Engineering Design Problems

引用

Journal of Bionic Engineering 2023年第3期20卷 1263-1295页

作者： Jeffrey O.Agushaka Absalom E.Ezugwu Oyelade N.Olaide Olatunji Akinola Raed Abu Zitar Laith Abualigah School of Mathematics Statisticsand Computer ScienceUniversity of KwaZulu-NatalKing Edward AvenuePietermaritzburg CampusPietermaritzburg3201KwaZulu-NatalSouth Africa Department of Computer Science Federal University of LafiaLafia950101Nigeria Unit for Data Science and Computing North-West University11 Hoffman StreetPotchefstroom2520South Africa Sorbonne Center of Artificial Intelligence Sorbonne University-Abu Dhabi38044Abu DhabiUnited Arab Emirates Hourani Center for Applied Scientific Research Al-Ahliyya Amman UniversityAmman19328Jordan Faculty of Information Technology Middle East UniversityAmman11831Jordan Faculty of Information Technology Applied Science Private UniversityAmman11931Jordan School of Computer Sciences Universiti Sains Malaysia11800Pulau PinangMalaysia

This paper proposes a modified version of the Dwarf Mongoose Optimization Algorithm (IDMO) for constrained engineering design problems. This optimization technique modifies the base algorithm (DMO) in three simple but effective ways. First, the alpha selection in IDMO differs from the DMO, where evaluating the probability value of each fitness is just a computational overhead and contributes nothing to the quality of the alpha or other group members. The fittest dwarf mongoose is selected as the alpha, and a new operator ω is introduced, which controls the alpha movement, thereby enhancing the exploration ability and exploitability of the IDMO. Second, the scout group movements are modified by randomization to introduce diversity in the search process and explore unvisited areas. Finally, the babysitter's exchange criterium is modified such that once the criterium is met, the babysitters that are exchanged interact with the dwarf mongoose exchanging them to gain information about food sources and sleeping mounds, which could result in better-fitted mongooses instead of initializing them afresh as done in DMO, then the counter is reset to zero. The proposed IDMO was used to solve the classical and CEC 2020 benchmark functions and 12 continuous/discrete engineering optimization problems. The performance of the IDMO, using different performance metrics and statistical analysis, is compared with the DMO and eight other existing algorithms. In most cases, the results show that solutions achieved by the IDMO are better than those obtained by the existing algorithms.

关键词： Improved dwarf mongoose Nature-inspired algorithms Constrained optimization Unconstrained optimization Engineering design problems

来源：评论

学校读者我要写书评

暂无评论

LEARNING RELU networkS TO HIGH UNIFORM ACCURACY IS INTRACTABLE 11

LEARNING RELU NETWORKS TO HIGH UNIFORM ACCURACY IS INTRACTAB...

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Berner, Julius Grohs, Philipp Voigtlaender, Felix Faculty of Mathematics University of Vienna Austria Research Network Data Science @ Uni Vienna University of Vienna Austria RICAM Austrian Academy of Sciences Austria Catholic University of Eichstätt-Ingolstadt Germany

Statistical learning theory provides bounds on the necessary number of training samples needed to reach a prescribed accuracy in a learning problem formulated over a given target class. This accuracy is typically measured in terms of a generalization error, that is, an expected value of a given loss function. However, for several applications - for example in a security-critical context or for problems in the computational sciences - accuracy in this sense is not sufficient. In such cases, one would like to have guarantees for high accuracy on every input value, that is, with respect to the uniform norm. In this paper we precisely quantify the number of training samples needed for any conceivable training algorithm to guarantee a given uniform accuracy on any learning problem formulated over target classes containing (or consisting of) ReLU neural networks of a prescribed architecture. We prove that, under very general assumptions, the minimal number of training samples for this task scales exponentially both in the depth and the input dimension of the network architecture. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： network architecture

来源：评论

学校读者我要写书评

暂无评论

High-dimensional classification problems with Barron regular boundaries under margin conditions

arXiv

引用

arXiv 2024年

作者： García, Jonathan Petersen, Philipp Faculty of Mathematics University of Vienna Austria Faculty of Mathematics and Research Network Data Science @ Uni Vienna University of Vienna Austria

We prove that a classifier with a Barron-regular decision boundary can be approximated with a rate of high polynomial degree by ReLU neural networks with three hidden layers when a margin condition is assumed. In particular, for strong margin conditions, high-dimensional discontinuous classifiers can be approximated with a rate that is typically only achievable when approximating a low-dimensional smooth function. We demonstrate how these expression rate bounds imply fast-rate learning bounds that are close to n−1 where n is the number of samples. In addition, we carry out comprehensive numerical experimentation on binary classification problems with various margins. We study three different dimensions, with the highest dimensional problem corresponding to images from the MNIST data *** Codes 68T05, 62C20, 41A25, 41A46 © 2024, CC BY.

关键词： Multilayer neural networks

来源：评论

学校读者我要写书评

暂无评论

ATTACKING GRAPH NEURAL networkS WITH BIT FLIPS: WEISFEILER AND LEHMAN GO INDIFFERENT

arXiv

引用

arXiv 2023年

作者： Kummer, Lorenz Moustafa, Samir Kriege, Nils M. Gansterer, Wilfried N. Faculty of Computer Science University of Vienna Vienna Austria UniVie Doctoral School Computer Science University of Vienna Vienna Austria Research Network Data Science University of Vienna Vienna Austria

Prior attacks on graph neural networks have mostly focused on graph poisoning and evasion, neglecting the network’s weights and biases. Traditional weight-based fault injection attacks, such as bit flip attacks used for convolutional neural networks, do not consider the unique properties of graph neural networks. We propose the Injectivity Bit Flip Attack, the first bit flip attack designed specifically for graph neural networks. Our attack targets the learnable neighborhood aggregation functions in quantized message passing neural networks, degrading their ability to distinguish graph structures and losing the expressivity of the Weisfeiler-Lehman test. Our findings suggest that exploiting mathematical properties specific to certain graph neural network architectures can significantly increase their vulnerability to bit flip attacks. Injectivity Bit Flip Attacks can degrade the maximal expressive Graph Isomorphism networks trained on various graph property prediction datasets to random output by flipping only a small fraction of the network’s bits, demonstrating its higher destructive power compared to a bit flip attack transferred from convolutional neural networks. Our attack is transparent and motivated by theoretical insights which are confirmed by extensive empirical results. © 2023, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Medical Entity Disambiguation with Medical Mention Relation and Fine-grained Entity Knowledge 30

Medical Entity Disambiguation with Medical Mention Relation ...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Lu, Wenpeng Zhang, Guobiao Peng, Xueping Guan, Hongjiao Wang, Shoujin Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia Data Science Institute University of Technology Sydney Sydney Australia Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9782493814104

Medical entity disambiguation (MED) plays a crucial role in natural language processing and biomedical domains, which is the task of mapping ambiguous medical mentions to structured candidate medical entities from knowledge bases (KBs). However, existing methods for MED often fail to fully utilize the knowledge within medical KBs and overlook essential interactions between medical mentions and candidate entities, resulting in knowledge- and interaction-inefficient modeling and suboptimal disambiguation performance. To address these limitations, this paper proposes a novel approach, MED with Medical Mention Relation and Fine-grained Entity Knowledge (MMR-FEK). Specifically, MMR-FEK incorporates a mention relation fusion module and an entity knowledge fusion module, followed by an interaction module. The former employs a relation graph convolutional network to fuse mention relation information between medical mentions to enhance mention representations, while the latter leverages an attention mechanism to fuse synonym and type information of candidate entities to enhance entity representations. Afterwards, an interaction module is designed to employ a bidirectional attention mechanism to capture interactions between medical mentions and entities to generate the matching representation. Extensive experiments on two publicly available real-world datasets demonstrate MMR-FEK's superiority over state-of-the-art(SOTA) MED baselines across all metrics. Our source code is publicly available. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Soliton Solutions for Coupled Nonlinear Generalized Zakharov Equations with Anti-cubic Nonlinearity Using Various Techniques

引用

International Journal of Applied and Computational Mathematics 2024年第1期10卷 1-30页

作者： AlQahtani, Salman A. Alngar, Mohamed E. M. New Emerging Technologies and 5G Network and Beyond Research Chair Department of Computer Engineering College of Computer and Information Sciences King Saud University Riyadh Saudi Arabia Basic Science Department Faculty of Computers and Artificial Intelligence Modern University for Technology and Information Cairo 11585 Egypt

This study introduces novel exact solutions for the coupled nonlinear generalized Zakharov equations with anti-cubic nonlinearity. Utilizing a variety of mathematical approaches, including the extended trial function method, the rational exp (-ψ(ξ))-expansion method, and three well-known auxiliary equation methods, a spectrum of solutions is derived. These solutions encompass dark solitons, bright solitons, singular solitons, Jacobi elliptic functions, periodic waves, and rational solutions. The unique contribution lies in the use of a phase variable θ(ξ) instead of a phase constant, providing fresh insights into wave behavior. A comparative analysis underscores the originality of the derived solutions, setting this work apart from prior studies. These findings advance our understanding of nonlinear dynamics and mathematical modeling, with potential applications in various domains. © 2023, The Author(s), under exclusive licence to Springer Nature India Private Limited.

关键词： Coupled nonlinear generalized Zakharov equations Extended trial function method Rational exp(- ψ(ξ))-expansion method Soliton solutions Three famous auxiliary equation methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：