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

An integratable verifiable secret sharing mechanism

International Journal of Network Security 2016年第4期18卷 617-624页

作者： Liu, Yanjun Chang, Chin-Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No. 111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No. 500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No. 100 Wenhwa Rd Seatwen Taichung413 Taiwan

Threshold secret sharing (SS), also denoted as (t, n) SS, has been used extensively in the area of information se- curity, such as for group authentication, cloud storage schemes, secure parallel communication and wireless mul- tipath routing protocols. However, a (t, n) SS cannot de- tect any deceptions among the dealer and shareholders. Veriable secret sharing (VSS) overcomes the weakness of (t, n) SS in such a way that it is able to detect cheaters by verifying the validity of shares or the correctness of the recovered secret under the condition that both shares and the secret are not compromised. Recently, two non- interactive VSSs based on Asmuth-Bloom's SS were pro- posed by Harn et al. and Liu et al., respectively. Both VSSs require shareholders to examine the range of values of some integers related to the secret before recovering the secret, which is a time-consuming operation. In this paper, we propose a novel integratable VSS mechanism that integrates the concepts of the generalized Chinese remainder theorem (GCRT), Shamir's SS and Asmuth- Bloom's SS. Our proposed VSS can verify that the secret reconstructed by any t or more shareholders is the same as the one that the dealer has generated. Analysis shows that our proposed VSS can provide perfect secrecy and better efficiency.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

A secure broadcasting method based on the generalized aryabhata remainder theorem

引用

Journal of Information Hiding and Multimedia signal processing 2014年第4期5卷 709-718页

作者： Liu, Yanjun Chang, Chin-Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No.111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No.500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No.100 Wenhwa Rd Seatwen Taichung407 Taiwan

With the prevalence of group communications, how to implement secure broadcasting among group members has become one of the most important issues. Broadcasting is a point-to-multipoint communication, and secure broadcasting should ensure that only authorized group members can obtain the correct content of the message that is broadcast by a sender. In this paper, we propose a secure broadcasting method based on the generalized Aryabhata remainder theorem (GART). By the use of the RSA public-key scheme, the proposed scheme allows the sender to send one copy of an encrypted message to all group members, but only the authorized members can recover the plaintext. Analysis showed that our scheme is secure and efficient. © 2014.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Dense Invariant Feature Based Support Vector Ranking for Person Re-identification

Dense Invariant Feature Based Support Vector Ranking for Per...

引用

IEEE Global Conference on signal and Information processing

作者： Shoubiao Tan Feng Zheng Ling Shao Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei 230039 China Department of Electronic and Electrical Engineering The University of Sheffield Mappin Street Sheffield S1 3JD UK Department of Computer Science and Digital Technologies Northumbria University Newcastle upon Tyne NE1 8ST UK

ISBN: (纸本)9781479975921

Recently, support vector ranking has been adopted to address the challenging person re-identification problem. However, the ranking model based on ordinary global features cannot represent the significant variation of pose and viewpoint across camera views. Thus, a novel ranking method which fuses the dense invariant features is proposed in this paper to model the variation of images across camera views. By maximizing the margin and minimizing the error score for the fused features, an optimal space for ranking has been learned. Due to the invariance of the dense invariant features and the fusion of the bidirectional features, the proposed method significantly outperforms the original support vector ranking algorithm and is competitive with state-of-the-art techniques on two challenging datasets, showing its potential for real-world person re-identification.

关键词： Person Re-identification Dense Invariant Feature Support Vector Ranking Feature Fusion

来源：评论

学校读者我要写书评

暂无评论

An Interpretable MRI Reconstruction Network with Two-grid-cycle Correction and Geometric Prior Distillation

arXiv

引用

arXiv 2022年

作者： Fan, Xiaohong Yang, Yin Chen, Ke Zhang, Jianping Dong, Ke The School of Mathematics and Computational Science Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Hunan National Applied Mathematics Center Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan411105 China Centre for Mathematical Imaging Techniques Department of Mathematical Sciences The University of Liverpool Merseyside LiverpoolL6972L United Kingdom The School of Mathematics and Computational Science Xiangtan University Hunan National Applied Mathematics Center Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan411105 China Department of Radiation Oncology Xiangtan Central Hospital Xiangtan411101 China

Although existing deep learning compressed-sensing-based Magnetic Resonance Imaging (CS-MRI) methods have achieved considerably impressive performance, explainability and generalizability continue to be challenging for such methods since the transition from mathematical analysis to network design not always natural enough, often most of them are not flexible enough to handle multi-sampling-ratio reconstruction assignments. In this work, to tackle explainability and generalizability, we propose a unifying deep unfolding multi-sampling-ratio interpretable CS-MRI framework. The combined approach offers more generalizability than previous works whereas deep learning gains explainability through a geometric prior module. Inspired by the multigrid algorithm, we first embed the CSMRI-based optimization algorithm into correction-distillation scheme that consists of three ingredients: pre-relaxation module, correction module and geometric prior distillation module. Furthermore, we employ a condition module to learn adaptively step-length and noise level, which enables the proposed framework to jointly train multi-ratio tasks through a single model. The proposed model not only compensates for the lost contextual information of reconstructed image which is refined from low frequency error in geometric characteristic k-space, but also integrates the theoretical guarantee of model-based methods and the superior reconstruction performances of deep learning-based methods. Therefore, it can give us a novel perspective to design biomedical imaging networks. Numerical experiments show that our framework outperforms state-of-the-art methods in terms of qualitative and quantitative evaluations. Our method achieves 3.18 dB improvement at low CS ratio 10% and average 1.42 dB improvement over other comparison methods on brain dataset using Cartesian sampling mask. Copyright © 2022, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

High-Level Synthesis for Microfluidic Biochips Considering Actual Volume Management and Channel Storage

High-Level Synthesis for Microfluidic Biochips Considering A...

引用

IEEE International Symposium on Quality Electronic Design

作者： Zhengyang Chen Yuhan Zhu Zhen Chen Zhisheng Chen Genggeng Liu College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing (Fuzhou University) Fuzhou China School of Informatics Xiamen University Xiamen China

ISBN: (数字)9798350309270

ISBN: (纸本)9798350309287

In recent years, microfluidic biochips have been widely applied in various fields of human society. The emergence of distributed channel-storage architecture enables fluid to be directly cached within the flow channels without being transported to the dedicated storage. However, the volume of the flow channels is limited, it is important to carefully consider the fluid volume to be cached to ensure it can be accommodated within the appropriate flow channels. In this paper, we propose a high-level synthesis method considering actual volume management and channel storage through integer linear programming, providing a rational analysis of fluid caching and the temporal relationships between different fluid-handling tasks. Experimental results conducted on multiple benchmark tests demonstrate the effectiveness of the proposed method in reducing the completion time of bioassay, the number of caches, the maximum fluid caching volume, and the number of fluid-handling tasks.

关键词： Fluids Biochips Estimation Cells (biology) Integer linear programming Benchmark testing Task analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing Model-Driven Federated Learning for Rational and Data-Efficient in Social Mobile Network

引用

IEEE Network 2024年

作者： Lu, Jianfeng Zhang, Ying Cao, Shuqin Wang, Wei Tang, Changbing Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China Zhejiang Normal University College of Physics and Electronic Information Engineering Jinhua321004 China

With the rise of data-intensive services in mobile networks, the demand for intelligent and efficient learning frameworks has grown exponentially. Federated Learning (FL), as an emerging paradigm, enables decentralized edge devices to collaboratively train large models without sharing raw data, ensuring privacy preservation. However, deploying FL in resource-constrained mobile environments faces significant challenges, such as free-riding and malicious behavior. These challenges hinder model performance and raise concerns about data integrity and inter-user cooperation. To address these issues, we propose a layered dynamic framework for social mobile networks, called FedSMN, which aims to enhance the generalization ability of collaboratively trained large models in FL environments. FedSMN leverages Bayesian inference to evaluate user behavior and employs evolutionary game theory to simulate dynamic interactions, thereby optimizing cooperation strategies and reducing communication overhead. Unlike traditional approaches that assume fully rational actors, FedSMN accounts for irrational behavior and fluctuating resources, designing an efficient incentive mechanism to improve data utilization. Extensive experiments on large-scale datasets demonstrate that FedSMN increases model accuracy by 21% and reduces communication overhead by 49%, paving the way for scalable, intelligent mobile networks powered by large models. © 1986-2012 IEEE.

关键词： Collaborative learning

来源：评论

学校读者我要写书评

暂无评论

A Wideband Circularly Polarized Folded Transmitarray Antenna With Linearly Polarized Feed

A Wideband Circularly Polarized Folded Transmitarray Antenna...

引用

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)

作者： Xiangdong Sun Xulong Guo Yin Li Yongliang Zhang Yingsong Li School of Electronic Information Engineering Inner Mongolia University Hohhot China Inner Mongolia Branch of National Computer Network Emergency Response Technical Team/Coordination Center of China Inner Mongolia University Hohhot China Peng Cheng Laboratory Shenzhen China School of Transportation Institute Inner Mongolia University Hohhot China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

ISBN: (数字)9798350384437

ISBN: (纸本)9798350384444

A low-profile, high-gain, wideband circularly polarized folded transmitarray antenna (CPFTA) is proposed, and a polarization-selective linear-to-circular polarization (LP-CP) conversion element is introduced. The CPFTA consists of a linearly polarized (LP) magnetoelectric dipole antenna and a circularly polarized (CP) helical patch antenna. The CPFTA demonstrates excellent performance with a 3dB gain bandwidth of 29.5% and a 3dB axial ratio (AR) bandwidth of 40.9%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

Meta auxiliary learning for facial action unit detection

arXiv

引用

arXiv 2021年

作者： Li, Yong Shan, Shiguang Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences Institute of Computing Technology Cas Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Cas Center for Excellence in Brain Science and Intelligence Technology

Despite the success of deep neural networks on facial action unit (AU) detection, better performance depends on a large number of training images with accurate AU annotations. However, labeling AU is time-consuming, expensive, and error-prone. Considering AU detection and facial expression recognition (FER) are two highly correlated tasks, and facial expression (FE) is relatively easy to annotate, we consider learning AU detection and FER in a multi-task manner. However, the performance of the AU detection task cannot be always enhanced due to the negative transfer in the multi-task scenario. To alleviate this issue, we propose a Meta Auxiliary Learning method (MAL) that automatically selects highly related FE samples by learning adaptative weights for the training FE samples in a meta learning manner. The learned sample weights alleviate the negative transfer from two aspects: 1) balance the loss of each task automatically, and 2) suppress the weights of FE samples that have large uncertainties. Experimental results on several popular AU datasets demonstrate MAL consistently improves the AU detection performance compared with the state-of-the-art multi-task and auxiliary learning methods. MAL automatically estimates adaptive weights for the auxiliary FE samples according to their semantic relevance with the primary AU detection task. Copyright © 2021, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

Size-Invariance Matters: Rethinking Metrics and Losses for I...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：