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

arXiv 2023年

作者： Si, Jiasheng Zhu, Yingjie Shi, Xingyu Zhou, Deyu He, Yulan School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China Department of informatics King’s College London United Kingdom Alan Turing Insitute United Kingdom

Given a controversial target such as "nuclear energy", argument mining aims to identify the argumentative text from heterogeneous sources. Current approaches focus on exploring better ways of integrating the target-associated semantic information with the argumentative text. Despite their empirical successes, two issues remain unsolved: (i) a target is represented by a word or a phrase, which is insufficient to cover a diverse set of target-related subtopics;(ii) the sentence-level topic information within an argument, which we believe is crucial for argument mining, is ignored. To tackle the above issues, we propose a novel explainable topic-enhanced argument mining approach. Specifically, with the use of the neural topic model and the language model, the target information is augmented by explainable topic representations. Moreover, the sentence-level topic information within the argument is captured by minimizing the distance between its latent topic distribution and its semantic representation through mutual learning. Experiments have been conducted on the benchmark dataset in both the in-target setting and the cross-target setting. Results demonstrate the superiority of the proposed model against the state-of-the-art baselines. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Enhanced SPS Velocity-Adaptive Scheme: Access Fairness in 5G NR V2I networks

arXiv

引用

arXiv 2025年

作者： Xu, Xiao Wu, Qiong Fan, Pingyi Wang, Kezhi School of Internet of Things Engineering Jiangnan University Wuxi214122 China Department of Electronic Engineering State Key laboratory of Space Network and Communications Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China Department of Computer Science Brunel University Middlesex LondonUB8 3PH United Kingdom

Vehicle-to-Infrastructure (V2I) technology enables information exchange between vehicles and road infrastructure. Specifically, when a vehicle approaches a roadside unit (RSU), it can exchange information with the RSU to obtain accurate data that assists in driving. As the 3rd Generation Partnership Project (3GPP) Release 16, which includes the 5G New Radio (NR) Vehicle-to-Everything (V2X) standards, vehicles typically adopt mode-2 communication using sensing-based semi-persistent scheduling (SPS). By this approach, vehicles identify resources through a selection window and exclude ineligible resources based on information from a sensing window. However, vehicles often drive at different speeds, resulting in varying amounts of data transmission with RSUs as they pass by, which leads to unfair access. Therefore, developing an scheme that accounts for different vehicle speeds to achieve fair access across the network is essential. This paper formulates an optimization problem for vehicular environment and proposes a multi-objective optimization scheme to address it by adjusting the selection window size. Experimental results validate the efficiency of the proposed method. © 2025, CC BY-NC-SA.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Descriptive Exam Evaluation through Semantic Mining and Analysis

Descriptive Exam Evaluation through Semantic Mining and Anal...

引用

Human-Centered Cognitive Systems (HCCS)

作者： Raybal Akhtar Muhammad Safyan Muddesar Iqbal Sohail Sarwar Department of Informatics and Systems University of Management and Technology Lahore Pakistan Department of Computer Science Government College University Lahore Lahore Pakistan Department of Communication & Network Engineering Prince Sultan University Riyadh Saudi Arabia Department of Computer Science Bahria University Islamabad Islamabad Pakistan

Online examination evaluation methods are used as an alternative to the traditional examination’s way of evaluation methods. They offer a number of advantages while addressing issues associated with outdated conventional approaches. Online evaluation methods are mainly used for objective and short answers based exams but may not suitable for assessing the depth knowledge in candidates. So, candidate’s descriptive examinations are conducted to assess their depth of knowledge. Descriptive evaluation methods have been put into practice for quite some time but they greatly rely on keyword-matching techniques between the questions and answers. Due to this limitation, the semantic meanings of these answers are ignored. In current research, the deficiencies in prevalent systems have been addressed by calculating the semantic and syntactic similarity between answers. Moreover, the repetitive words and similarity between counteractive answers has also been considered. We have used SQuAD 1 dataset in current research. Our model has achieved a value of 0.88 in terms of accuracy for while computing similarity among listed items.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AoI-Delay Tradeoff in Mobile Edge Caching: A Mixed-Order Drift-Plus-Penalty Method

AoI-Delay Tradeoff in Mobile Edge Caching: A Mixed-Order Dri...

引用

IEEE International Conference on Communications (ICC)

作者： Ran Li Chuan Huang Xiaoqi Qin Lei Yang Future Network of Intelligence Institute (FNii) The Chinese University of Hong Kong Shenzhen China Department of Information Engineering The Chinese University of Hong Kong Hong Kong School of Science and Engineering (SSE) The Chinese University of Hong Kong Shenzhen China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Computer Science and Engineering University of Nevada Reno NV USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Mobile edge caching (MEC) is a promising technique to improve the quality of service (QoS) for mobile users (MU) by bringing data to the network edge. However, optimizing the crucial QoS aspects of message freshness and service promptness, measured by age of information (AoI) and service delay, respectively, entails a tradeoff due to their competition for shared edge resources. This paper investigates this tradeoff by formulating their weighted sum minimization as a sequential decision-making problem, incorporating high-dimensional, discrete-valued, and linearly constrained design variables. First, to assess the feasibility of the considered problem, we characterize the corresponding achievable region by deriving its superset with the rate stability theorem and its subset with a novel stochastic policy, and develop a sufficient condition for the existence of solutions. Next, to efficiently solve this problem, we propose a mixed-order drift-plus-penalty algorithm by jointly considering the linear and quadratic Lyapunov drift and then optimizing them with dynamic programming (DP). Finally, by leveraging the Lyapunov optimization technique, we demonstrate that the proposed algorithm achieves an O(1/V) versus O(V) tradeoff for the average AoI and average service delay.

关键词： Sufficient conditions Heuristic algorithms Decision making Quality of service Minimization Information age Stability analysis

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Quantum Two-Party Geometric Intersection

arXiv

引用

arXiv 2023年

作者： Liu, Wen-Jie Xu, Yong Yang, James C.N. Yu, Wen-Bin Chi, Lian-Hua Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science & Technology Nanjing210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China Department of Computer Science and Information Engineering National Dong Hwa University Hualien974 Taiwan Department of Computer Science and Information Technology La Trobe University VIC3086 Australia

Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. As an important field, the privacy-preserving geometric intersection (PGI) problem is when each of the multiple parties has a private geometric graph and seeks to determine whether their graphs intersect or not without revealing their private information. In this study, through representing Alice’s (Bob’s) private geometric graph GA (GB ) as the set of numbered grids SA (SB ), an efficient privacy-preserving quantum two-party geometric intersection (PQGI) protocol is proposed. In the protocol, the oracle operation OA (OB ) is firstly utilized to encode the private elements of SA (a0, a1,, aM1) (SB (b0,b1,bN1)) into the quantum states, and then the oracle operation Of is applied to obtain a new quantum state which includes the XOR results between each element of SA and SB . Finally, the quantum counting is introduced to get the amount (t ) of the states ai bj equaling to 0, and the intersection result can be obtained by judging t 0 or not. Compared with classical PGI protocols, our proposed protocol not only has higher security, but also holds lower communication complexity. © 2023, CC BY.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Data structures for computing unique palindromes in static and non-static strings

arXiv

引用

arXiv 2022年

作者： Mieno, Takuya Funakoshi, Mitsuru Department of Computer and Network Engineering University of Electro-Communications Japan Department of Informatics Kyushu University Japan Japan Society for the Promotion of Science Japan

A palindromic substring T[i..j] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [p, q] if T[i..j] is a shortest palindromic substring such that T[i..j] occurs only once in T, and [i, j] contains [p, q]. The SUPS problem is, given a string T of length n, to construct a data structure that can compute all the SUPSs for any given query interval. It is known that any SUPS query can be answered in O(α) time after O(n)-time preprocessing, where α is the number of SUPSs to output [Inoue et al., 2018]. In this paper, we first show that α is at most 4, and the upper bound is tight. We also show that the total sum of lengths of minimal unique palindromic substrings of string T, which is strongly related to SUPSs, is O(n). Then, we present the first O(n)-bits data structures that can answer any SUPS query in constant time. Also, we present an algorithm to solve the SUPS problem for a sliding window that can answer any query in O(log log W) time and update data structures in amortized O(log σ + log log W) time, where W is the size of the window, and σ is the alphabet size. Furthermore, we consider the SUPS problem in the after-edit model and present an efficient algorithm. Namely, we present an algorithm that uses O(n) time for preprocessing and answers any k SUPS queries in O(log n log log n + k log log n) time after single character substitution. Finally, as a by-product, we propose a fully-dynamic data structure for range minimum queries (RmQs) with a constraint where the width of each query range is limited to poly-logarithmic. The constrained RmQ data structure can answer such a query in constant time and support a single-element edit operation in amortized constant time. © 2022, CC BY.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Investigating TrustZone: A Comprehensive Analysis

引用

Security and Communication networks 2023年第1期2023卷

作者： Zhu, Qinyu Chen, Quan Liu, Yichen Akhtar, Zahid Siddique, Kamran Department of Information and Communication Technology School of Computing and Data Science Xiamen University Malaysia Sepang43900 Malaysia Department of Network and Computer Security State University New York Polytechnic Institute UticaNY13502 United States Department of Computer Science and Engineering University of Alaska Anchorage AnchorageAK99508 United States

The advent of the Internet and portable devices, including smartphones and watches, has brought unprecedented opportunities for embedded application systems developments. Along with these developments, there is an increasing need for embedded devices to handle important services, such as the ability to pay bills or manage bank accounts remotely via mobile phones. Such applications and developments have also highlighted the issues of cyberattacks and computing network security - these developments have made mobile phones a potential target for malware, trojans, and viruses, so it is critical to design a set of security technologies for embedded devices. In fact, security has become an essential requirement in the process of embedded system design. Thus, ARM has proposed system-level security solutions based on TrustZone technology. TrustZone technology is tightly integrated with Cortex™-A processors and extends the system through the AMBA® AXI bus and specific TrustZone system IP blocks to protect peripherals such as secure memory, encryption blocks, keyboards, and screens from software attacks. It divides the system into TEE (Trusted Execution Environment) and REE (Rich Execution Environment) by hardware and provides intrinsic software security services and interfaces. More precisely, it has built system security by combining hardware and software. It is worth noting that it does not influence performance, power consumption, and area as much as possible. Owing to such characteristics, the technology has gained the wide attention of researchers worldwide. There is lack of systematic documentation of the technology. Therefore, this paper documents the significant progress achieved in the field. In particular, this article mainly analyses the primary mechanism implementation, and how to build the Trusted Execution Environment in different environments. Then, this paper discusses the related research works in the academic field and business applications of the technolog

关键词： Cellular telephones

来源：评论

学校读者我要写书评

暂无评论

Research on Efficient Image Inpainting Algorithm Based on Deep Learning 7th

Research on Efficient Image Inpainting Algorithm Based on De...

引用

7th International Conference on Artificial Intelligence and Security, ICAIS 2021

作者： Qin, Tao Liu, Juanjuan Xue, Wenchao National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing100020 China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing100083 China Engineering Agent Construction Management Office of Navy Logistics Department Beijing100036 China

ISBN: (纸本)9783030786083

The rapid development of deep learning has brought a new development direction for image inpainting, changing the traditional image inpaiting algorithm, which can only repair the problem of small area damage based on the structure and texture of the damaged image. In recent years, image inpainting algorithm based on deep learning has received widespread attention from industry and academia so that it has made great progress. However, the current image inpainting algorithm based on deep learning still has the problem of consuming so much time. In order to solve the above problem, an end-to-end image inpainting algorithm suitable for real-time scene was proposed. The mask of the damaged image generated by D-linkNet network, the edge information of the damaged image, and damaged image were used to control the network input, which avoided the damage to the existing semantics of the image and retained the intact image outside the damaged. On this basis, in order to improve the performance of image inpainting, Convolutional Block Attention Module (CBAM) was used in the residual network. Experimental results show that, compared with edge information-based deep learning algorithm Edge Connect, the repair speed is twice as fast as Edge Connect while the repair results are similar. © 2021, Springer Nature Switzerland AG.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Predictive Models for Coronary Artery Disease

引用

SN computer Science 2021年第5期2卷 1-11页

作者： Muhammad, L.J. Al-Shourbaji, Ibrahem Haruna, Ahmed Abba Mohammed, I.A. Ahmad, Abdulkadir Jibrin, Muhammed Besiru Department of Mathematics and Computer Science Faculty of Science Federal University of Kashere P.M.B. 0182 Gombe Nigeria Department of Computer Science and Network Engineering Jazan University Jazan 828222-6649 Saudi Arabia College of Computer Science and Engineering University of Hafr Al Batin Al Jamiah Hafar Al Batin 39524 Saudi Arabia Computer Science Department Yobe State University Yobe State Damaturu Nigeria Department of Computer Science Kano University of Science and Technology Kano Wudil Nigeria

Coronary artery disease (CAD) is the commonest type of heart disease and over 80% of the deaths resulted from the diseases occurred in developing countries including Nigeria, with majority being in those victims are below 70 years of age. Though, CAD is not a well known disease in Nigeria but however in year 2014, 2.82% of the total of deaths occurred in the country were due to the disease. In this study, a machine leaning predictive models for CAD has been developed with diagnostic CAD dataset obtained in the two General Hospitals in Kano State—Nigeria. The dataset applied on machine learning algorithms which include support vector machine, K nearest neighbor, random tree, Naïve Bayes, gradient boosting and logistic regression algorithms to build the predictive models and the models were evaluated based accuracy, specificity, sensitivity and receiver operating curve (ROC) performance evaluation techniques. In terms of accuracy random forest-based machine learning model emerged to be the best model with 92.04%, for specificity Naive Bayes based machine learning model emerged to be the best model with 92.40%, while for sensitivity support vector machine based machine learning model emerged to be the best model with 87.34% and for ROC, random forest-based machine learning model emerged to be the best model with 92.20%. The decision tree generated with random forest machine learning algorithm which happened to be best model in terms accuracy and ROC can be converted into production rules and be used develop expert system for diagnosis of CAD patients in Nigeria. © 2021, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： CAD Disease Machine learning Predictive model

来源：评论

学校读者我要写书评

暂无评论

Reference-Based Iterative Interaction With P2-Matching for Stereo Image Super-Resolution

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 34卷 3779-3789页

作者： Runmin Cong Rongxin Liao Feng Li Ronghui Sheng Huihui Bai Renjie Wan Sam Kwong Wei Zhang School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education of China Hefei China School of Computer Science and Engineering Hefei University of Technology Hefei China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing China Institute of Information Science Beijing Jiaotong University Beijing China Department of Computer Science Hong Kong Baptist University Hong Kong China School of Data Science Lingnan University Hong Kong China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China

Stereo Image Super-Resolution (SSR) holds great promise in improving the quality of stereo images by exploiting the complementary information between left and right views. Most SSR methods primarily focus on the inter-view correspondences in low-resolution (LR) space. The potential of referencing a high-quality SR image of one view benefits the SR for the other is often overlooked, while those with abundant textures contribute to accurate correspondences. Therefore, we propose Reference-based Iterative Interaction (RIISSR), which utilizes reference-based iterative pixel-wise and patch-wise matching, dubbed $P^{2}$ -Matching, to establish cross-view and cross-resolution correspondences for SSR. Specifically, we first design the information perception block (IPB) cascaded in parallel to extract hierarchical contextualized features for different views. Pixel-wise matching is embedded between two parallel IPBs to exploit cross-view interaction in LR space. Iterative patch-wise matching is then executed by utilizing the SR stereo pair as another mutual reference, capitalizing on the cross-scale patch recurrence property to learn high-resolution (HR) correspondences for SSR performance. Moreover, we introduce the supervised side-out modulator (SSOM) to re-weight local intra-view features and produce intermediate SR images, which seamlessly bridge two matching mechanisms. Experimental results demonstrate the superiority of RIISSR against existing state-of-the-art methods.

关键词： Feature extraction Iterative methods Superresolution Electronic mail Image resolution Image reconstruction Modulation Estimation Data mining Merging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：