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

Towards Cache-Assisted Hierarchical Detection for Real-Time Health Data Monitoring in IoHT

computers, Materials & Continua 2023年第11期77卷 2529-2544页

作者： Muhammad Tahir Mingchu Li Irfan Khan Salman AAl Qahtani Rubia Fatima Javed Ali Khan Muhammad Shahid Anwar School of Software Technology Dalian University of Technology(DUT)Dalian116621China School of Software Technology Key Laboratory for Ubiquitous Network and Service Software of Liaoning ProvinceDalian116650China Department of Computer Engineering King Saud UniversityRiyadh11543Saudi Arabia School of Software Tsinghua UniversityBeijing100084China Department of Software Engineering University of Science and TechnologyBanu28100Pakistan Department of AI and Software Gachon UniversitySeongnamsi13120Korea

Real-time health data monitoring is pivotal for bolstering road services’safety,intelligence,and efficiency within the Internet of Health Things(IoHT)***,delays in data retrieval can markedly hinder the efficacy of big data awareness detection *** advocate for a collaborative caching approach involving edge devices and cloud networks to combat *** strategy is devised to streamline the data retrieval path,subsequently diminishing network *** an adept cache processing scheme poses its own set of challenges,especially given the transient nature of monitoring data and the imperative for swift data transmission,intertwined with resource allocation *** paper unveils a novel mobile healthcare solution that harnesses the power of our collaborative caching approach,facilitating nuanced health monitoring via edge *** system capitalizes on cloud computing for intricate health data analytics,especially in pinpointing health *** the dynamic locational shifts and possible connection disruptions,we have architected a hierarchical detection system,particularly during *** system caches data efficiently and incorporates a detection utility to assess data freshness and potential lag in response ***,we introduce the Cache-Assisted Real-Time Detection(CARD)model,crafted to optimize *** the inherent complexity of the NP-hard CARD model,we have championed a greedy algorithm as a *** reveal that our collaborative caching technique markedly elevates the Cache Hit Ratio(CHR)and data freshness,outshining its contemporaneous benchmark *** empirical results underscore the strength and efficiency of our innovative IoHT-based health monitoring *** encapsulate,this paper tackles the nuances of real-time health data monitoring in the IoHT landscape,presenting a joint edge-cloud caching strategy paired with a hierarchical detection *** methodology yields enh

关键词： Real-time health data monitoring Cache-Assisted Real-Time Detection(CARD) edge-cloud collaborative caching scheme hierarchical detection Internet of Health Things(IoHT)

来源：评论

学校读者我要写书评

暂无评论

MA-MFIF: When misaligned multi-focus Image fusion meets deep homography estimation

引用

Multimedia Tools and Applications 2025年第12期84卷 10877-10898页

作者： Zhao, Baojun Luo, Fei Fuentes, Joel Ding, Weichao Gu, Chunhua School of Information Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China Department of Computer Science and Information Technologies Universidad del Bio-Bio Chillán3780000 Chile

Multi-focus image fusion is a technique that combines multiple out-of-focus images to enhance the overall image quality. It has gained significant attention in recent years, thanks to the advancements in deep learning. However, one of the persistent challenges in this field is the processing of misaligned data, which can negatively impact the fusion results. To overcome this problem, a novel fusion framework with pre-registration is proposed for the fusion of misaligned multi-focus images. For pre-registration, content-aware deep homography estimation is used, which performs transfer learning on a real multi-focus image dataset to adapt to registration under defocused conditions. For fusion, a fusion module with dual-branch feature interaction is utilized to avoid invalid feature fusion and trained on real light field dataset to achieve better fusion performance. Qualitative and quantitative experimental results show that the proposed method has a 2-3 percentage point improvement in multiple evaluation metrics compared to existing advanced registration and fusion methods, and a maximum improvement of 4.83 percentage points in fusion performance when tested independently on the Lytro dataset. Additionally, We find that the value of the Qcv metric is greatly influenced by the alignment status of the input images, leading to its inability to reflect the fusion quality of aligned images. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

DisVAE: Disentangled Variational Autoencoder for High-Quality Facial Expression Features 17

DisVAE: Disentangled Variational Autoencoder for High-Qualit...

引用

17th IEEE International Conference on Automatic Face and Gesture Recognition, FG 2023

作者： Wang, Tianhao Zhang, Mingyue Shang, Lin Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Nanjing University Department of Computer Science and Technology Nanjing China

ISBN: (纸本)9798350345445

Facial expression feature extraction suffers from high inter-subject variations caused by identity-related personal attributes. The extracted expression features are consistently entangled with other identity-related features, which has an influence on related facial expression tasks such as recognition and editing. To achieve high-quality expression features, a Disentangled Variational Autoencoder (DisVAE) is proposed to disentangle expression and identity features. The identity features are removed from the facial features via facial image reconstruction firstly, and then the remaining features represent expression components. Extensive experiments on three public datasets have shown that the proposed DisVAE can effectively disentangle expression and identity features, and extract expression features without the interfere of identity attributes. The high-quality expression features improve the performance of facial expression recognition and can be well applied to facial expression editing. © 2023 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

AutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network 39

AutoAC: Towards Automated Attribute Completion for Heterogen...

引用

39th IEEE International Conference on Data Engineering, ICDE 2023

作者： Zhu, Guanghui Zhu, Zhennan Wang, Wenjie Xu, Zhuoer Yuan, Chunfeng Huang, Yihua Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Nanjing University Department of Computer Science and Technology Nanjing China

ISBN: (纸本)9798350322279

Many real-world data can be modeled as heterogeneous graphs that contain multiple types of nodes and edges. Meanwhile, due to excellent performance, heterogeneous graph neural networks (GNNs) have received more and more attention. However, the existing work mainly focuses on the design of novel GNN models, while ignoring another important issue that also has a large impact on the model performance, namely the missing attributes of some node types. The handcrafted attribute completion requires huge expert experience and domain knowledge. Also, considering the differences in semantic characteristics between nodes, the attribute completion should be fine-grained, i.e., the attribute completion operation should be node-specific. Moreover, to improve the performance of the downstream graph learning task, attribute completion and the training of the heterogeneous GNN should be jointly optimized rather than viewed as two separate processes. To address the above challenges, we propose a differentiable attribute completion framework called AutoAC for automated completion operation search in heterogeneous GNNs. We first propose an expressive completion operation search space, including topology-dependent and topology-independent completion operations. Then, we propose a continuous relaxation schema and further propose a differentiable completion algorithm where the completion operation search is formulated as a bi-level joint optimization problem. To improve the search efficiency, we leverage two optimization techniques: discrete constraints and auxiliary unsupervised graph node clustering. Extensive experimental results on real-world datasets reveal that AutoAC outperforms the SOTA handcrafted heterogeneous GNNs and the existing attribute completion method. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A prompt-based approach to adversarial example generation and robustness enhancement

引用

Frontiers of computer science 2024年第4期18卷 85-96页

作者： Yuting YANG Pei HUANG Juan CAO Jintao LI Yun LIN Feifei MA Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Computer Science Stanford UniversityCA 94305USA School of Computing National University of SingaporeSingapore 119077Singapore Laboratory of Parallel Software and Computational Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China

Recent years have seen the wide application of natural language processing(NLP)models in crucial areas such as finance,medical treatment,and news media,raising concerns about the model robustness and *** find that prompt paradigm can probe special robust defects of pre-trained language *** prompt texts are first constructed for inputs and a pre-trained language model can generate adversarial examples for victim models via *** results show that prompt paradigm can efficiently generate more diverse adversarial examples besides synonym ***,we propose a novel robust training approach based on prompt paradigm which incorporates prompt texts as the alternatives to adversarial examples and enhances robustness under a lightweight minimax-style optimization *** on three real-world tasks and two deep neural models show that our approach can significantly improve the robustness of models to resist adversarial attacks.

关键词： robustness adversarial example prompt learning pre-trained language model

来源：评论

学校读者我要写书评

暂无评论

Discriminative Word Alignment Over Multiple Word Segmentations

引用

Chinese Journal of Electronics 2025年第2期23卷 263-270页

作者： Ning Xi Xinyu Dai Shujian Huang Jiajun Chen Department of Computer Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

Conventional bilingual word alignment is conducted on sentence pairs with single word segmentation for languages such as Chinese, viz. Single-segmentation-based word alignment (SSWA). However, SSWA may run the risk of losing optimal word segmentation granularities or causing data sparseness in word alignment. This paper proposes Multiple-segmentation-based word alignment (MSWA). In MSWA, diverse and complementary knowledge in multiple word segmentations can be employed to lower the above risks in word alignment. Given $k$ word segmentations of a Chinese sentence, a skeleton segmentation is firstly constructed. The alignment between the skele-ton segmentation and the parallel English sentence is log-linearly modeled, where various features defined over multiple word segmentations are incorporated. The Viterbi alignment, the alignment with the highest score, is mapped back to $k$ word alignments based on $k$ segmentations respectively. Experimentally, MSWA outperformed SSWA on all $k$ segmentations in both alignment quality and translation performance.

关键词： Translation Viterbi algorithm Social sciences Education Medical services Skeleton

来源：评论

学校读者我要写书评

暂无评论

A Security Model of Multihospital FHIR Database Authorization Based on Secret Sharing and Blockchain

引用

IEEE Internet of Things Journal 2024年第6期11卷 10325-10335页

作者： Yang, Ching-Nung Li, Peng Cheng, Hsiang-Han Kuo, Hsin-Chuan Lu, Ming-Chan Xiong, Lizhi National Dong Hwa University Department of Computer Science and Information Engineering Hualien97401 Taiwan North China Electric Power University Department of Mathematics and Physics Hebei Key Laboratory of Physics and Energy Technology Baoding071003 China Nanjing University of Information Science and Technology School of Computer and Software Nanjing210044 China

Secret sharing (SS) is a threshold technology that shares a secret value by generating and distributing n shares in the way that a set of any k shares can recover the secret. On the other hand, blockchain is a decentralized system establishing a secure data structure for storing data in the form of a hash chain. Combining SS and blockchain is definitely a promising paradigm in the data security field. Recently, the fast healthcare interoperability resources (FHIRs) standard is defined for medical data exchange across various medical institutions. In this article, we combine SS, ElGamal's encryption/decryption, and blockchain to propose a multihospital FHIR database authorization (MFDA). To achieve a secure MFDA, the group-based SS (GSS) and the notion using GSS on exponent (referred to as EGSS) are proposed. The secrets of GSS and EGSS have the discrete logarithm problem (DLP) relation, on which the secrets can be used as ElGamal's private key and public key, respectively. Also, their shares will have DLP relation. By uploading public shares of EGSS on blockchain and using private shares of GSS in a private network, we can recover ElGamal's public key from a deployed smart contract on blockchain and recover ElGamal's private key from a qualified set. Meantime, when recovering private key, the private shares of GSS can be authenticated by public shares on blockchain to check tampering and corrupted of private shares during the communication in a private network. Theorems, examples, and experiments demonstrate that the proposed MFDA has efficient and secure database authorization. © 2014 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Less Traces Are All It Takes: Efficient Side-Channel Analysis on AES

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2024年第6期44卷 2080-2092页

作者： Xiao, Zhiyuan Wang, Chen Shen, Jian Wu, Q. M. Jonathan He, Debiao Zhejiang Sci-Tech University School of Information Science and Engineering School of Cyber Science and Technology the Zhejiang Provincial Key Laboratory of Digital Fashion and Data Governance Zhejiang Provincial International Cooperation Base for Science and Technology on Cloud Computing Security and Data Aggregation Hangzhou310018 China University of Windsor Department of Electrical and Computer Engineering WindsorON Canada Wuhan University State Key Laboratory of Software Engineering Computer School Wuhan430072 China

In cryptography, side-channel analysis (SCA) is a technique used to recover cryptographic keys by examining the physical leakages that occur during the operation of cryptographic devices. Recent advancements in Deep Learning (DL) have greatly enhanced the extraction of crucial information from intricate leakage patterns. A considerable amount of research is dedicated to studying the SubByte (SB) operations of the advanced encryption standard (AES). This is because the SB process, which generates numerous transitions between 0s and 1s during encryption, results in significant energy leakage. However, traditional analysis models primarily focus on the initial round of SB operations in AES, which are less effective on mobile terminals where it is difficult to collect enough signals. These models often neglect additional operations and subsequent rounds, thus providing limited insights from small datasets. Consequently, this limitation has a direct impact on the accuracy and efficiency of key recovery. Our study uses ρ-test analysis to show that significant leakage occurs not only during the S-box operation but also during the AddRoundkey (AR) phase of AES. To address these challenges, we propose a new SCA method that is optimized for small sample sizes. This method includes a new comprehensive round trace labeling algorithm, which simultaneously analyzes the SB and AR stages of each AES round. Additionally, we introduce the peak precise localization algorithm to accurately identify the points of energy leakage during each encryption round. Our experiments, conducted with power and Electromagnetic (EM) datasets from the STM32F303 microcontroller, demonstrate that our method can reliably recover keys with as few as 20 traces. These results highlight the enhanced capability of our method in handling the complexities of small sample datasets in cryptographic analysis. © 2024 IEEE.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Quantum Pseudorandom Scramblers 22nd

Quantum Pseudorandom Scramblers

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Lu, Chuhan Qin, Minglong Song, Fang Yao, Penghui Zhao, Mingnan Computer Science Department Portland State University Portland United States State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Hefei National Laboratory Hefei230088 China

ISBN: (纸本)9783031780165

Quantum pseudorandom state generators (PRSGs) have stimulated exciting developments in recent years. A PRSG, on a fixed initial (e.g., all-zero) state, produces an output state that is computationally indistinguishable from a Haar random state. However, pseudorandomness of the output state is not guaranteed on other initial states. In fact, known PRSG constructions provably fail on some initial states. In this work, we propose and construct quantum Pseudorandom state Scramblers (PRSSs), which can produce a pseudorandom state on an arbitrary initial state. In the information-theoretical setting, we obtain a scrambler which maps an arbitrary initial state to a distribution of quantum states that is close to Haar random in total variation distance. As a result, our scrambler exhibits a dispersing property. Loosely, it can span an ϵ-net of the state space. This significantly strengthens what standard PRSGs can induce, as they may only concentrate on a small region of the state space provided that the average output state approximates a Haar random state. Our PRSS construction develops a parallel extension of the famous Kac’s walk, and we show that it mixes exponentially faster than the standard Kac’s walk. This constitutes the core of our proof. We also describe a few applications of PRSSs. While our PRSS construction assumes a post-quantum one-way function, PRSSs are potentially a weaker primitive and can be separated from one-way functions in a relativized world similar to standard PRSGs. © International Association for Cryptologic Research 2025.

关键词： Distribution functions

来源：评论

学校读者我要写书评

暂无评论

User story clustering in agile development:a framework and an empirical study

引用

Frontiers of computer science 2023年第6期17卷 43-59页

作者： Bo YANG Xiuyin MA Chunhui WANG Haoran GUO Huai LIU Zhi JIN School of Information Science and Technology Beijing Forestry UniversityBeijing 100083China Engineering Research Center for Forestry Oriented Intelligent Information Processing National Forestry and Grassland AdministrationBeijing 100083China School of Information Science and Technology North China University of TechnologyBeijing 100144China College of Computer Science and Technology Inner Mongolia Normal UniversityHohhot 010020China Department of Computer Science and Software Engineering Swinburne University of TechnologyHawthorn VIC 3122Australia Key Laboratory of High Confidence Software Technologies(Peking University) Ministry of EducationBeijing 100871China Institute of Software School of Computer SciencePeking UniversityBeijing 100871China

Agile development aims at rapidly developing software while embracing the continuous evolution of user requirements along the whole development *** stories are the primary means of requirements collection and elicitation in the agile development.A project can involve a large amount of user stories,which should be clustered into different groups based on their functionality’s similarity for systematic requirements analysis,effective mapping to developed features,and efficient ***,the current user story clustering is mainly conducted in a manual manner,which is time-consuming and subjective to human *** this paper,we propose a novel approach for clustering the user stories automatically on the basis of natural language ***,the sentence patterns of each component in a user story are first analysed and determined such that the critical structure in the representative tasks can be automatically extracted based on the user story *** similarity of user stories is calculated,which can be used to generate the connected graph as the basis of automatic user story *** evaluate the approach based on thirteen datasets,compared against ten baseline *** results show that our clustering approach has higher accuracy,recall rate and F1-score than these *** is demonstrated that the proposed approach can significantly improve the efficacy of user story clustering and thus enhance the overall performance of agile *** study also highlights promising research directions for more accurate requirements elicitation.

关键词： user story agile development user story mapping clustering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：