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

2023 International Conference on Intelligent Systems, communications, and Computer Networks, ISCCN 2023

作者： Qi, Longyun Liu, Wei Zhang, Xiao Zhao, Baohua Li, Ke Li, Xiangnan Wang, Hui Lin, Jiangnan State Grid Electric Power Research Institute Jiangsu Province Nanjing211106 China Nanjing Nanrui Information and Communication Technology Company Limited Jiangsu Province Nanjing210000 China State Grid Corporation of China Beijing100031 China Global Energy Interconnection Research Institute Company Limited Beijing102222 China Trusted Computing and Information Assurance Laboratory Institute of Software Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9781510666238

In the data era, encrypted storage of files is a basic requirement for data security. Because most computing devices and storage devices lack data protection functions or their own data protection ability is poor, the data stored in them are at risk of being stolen. To solve this problem, this paper proposes an authentication storage scheme based on embedded Internet of things devices, which uses the Trusted Cryptography Module (TCM), mutual authentication technology, asynchronous file transfer technology, and disk partition encryption technology to realize the security storage function of host-side files on the device-side storage device, and enhances the security through the three security mechanisms of mutual authentication technology, access control of encrypted partition and state inspection of the encrypted partition. The function modules of the system based on the hardware platform of the Internet of Things are implemented and evaluated in this paper. The average experiment time of two-way authentication is 3242.42 ms. The result shows that the system has strong security and a good transmission rate. © 2023 SPIE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Deep hybrid residual learning with statistic priors for single image super-resolution

Deep hybrid residual learning with statistic priors for sing...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Risheng Liu Xiangyu Wang Xin Fan Haojie Li Zhongxuan Luo Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Department of Computing The Hong Kong Polytechnic University DUT-RU International School of Information & Software Engineering Dalian University of Technology

ISBN: (纸本)9781509060689

This paper considers single image super-resolution (SISR), which is an important low-level vision task and has various applications in multimedia society. Recently, deep neural networks have archived good performance on this field. But most of existing deep models are based on the fully data-dependent network architecture, thus missing majority of domain-knowledge of the super-resolution task. To address this limitation, we develop a new hybrid residual learning approach to leverage priors of SISR within the maximum a posteriori framework for network architecture design. We demonstrate that it can incorporate both image priors and data fidelity into the network, leading to a novel cascaded residual learning system for SISR process. Extensive experimental results on real-world images show that the proposed algorithm performs favorably against state-of-the-art methods.

关键词： Image resolution Network architecture Radio frequency Training Degradation Dictionaries Convolution

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Links Generation for Inter Domain Routing System 12

Design and Implementation of Links Generation for Inter Doma...

引用

12th International Conference on Information Science and Technology, ICIST 2022

作者： Wang, Yu Qiao, Zhi Yin, Junru Zhang, Mingliang College of Software Henan University of Engineering Zhengzhou China College of Information and Electrical Engineering China Agriculture University Beijing China College of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Network Research Department Zhengzhou China

ISBN: (数字)9781665485821

ISBN: (纸本)9781665485821

Due to the inherent flaws of BGP protocol, the security of inter domain routing system has been regularly threatened. Since it is difficult to achieve collaborative defense against existing resources and strategies of multiple autonomous systems, this paper designs and organizes them into autonomous system community. Within the community, a precomputing multi-link generation mechanism is proposed based on genetic algorithm. Before the inter domain routing system is attacked, the link set can be generated as complete as possible in advance. Once an attack occurs, the community will quickly select proper precomputing links to replace the failed ones, in order to ensure the stability of inter domain communication. The effectiveness of the mechanism has been proved in function and performance through simulation experiments. © 2022 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Generating an Approximately Optimal Detector Set by Evolving Random Seeds

Generating an Approximately Optimal Detector Set by Evolving...

引用

IEEE International Symposium on Dependable, Autonomic and Secure computing (DASC)

作者： Jie Zhang Wenjian Luo Baoliang Xu Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China University of Science and Technology of China Hefei Anhui CN

The detector generation algorithm is the core of a negative selection algorithm (NSA). In most previous work, the NSAs generate the detector set randomly, which cannot guarantee to obtain an efficient detector set. To generate an approximately optimal detector set, in this paper, a novel detector generation algorithm for the real-valued negative selection algorithm (RNSA) is proposed. The proposed algorithm, named as the EvoSeedRNSA, adopts a genetic algorithm to evolve the random seeds to obtain an optimized detector set. The experimental results demonstrate that the EvoSeedRNSA has a better performance.

关键词： Detectors Genetic algorithms Shape software algorithms Computer science Laboratories Immune system Artificial immune systems Intrusion detection State-space methods

来源：评论

学校读者我要写书评

暂无评论

Leveraging geometric correlation for input-adaptive facial landmark regression

Leveraging geometric correlation for input-adaptive facial l...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yuyao Feng Risheng Liu Xin Fan Kang Huyan Zhongxuan Luo Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province DUT-RU International School of Information & Software Engineering Dalian University of Technology Department of Computing The Hong Kong Polytechnic University

ISBN: (纸本)9781509060689

Facial analysis plays very important role in many vision applications, such as authentication and entertainments. The very early works in the 1990s mostly focus on estimating geometric deformations of facial landmarks to address this task. While in the past several years, more and more efforts have been made to directly learn an appearance regression for facial analysis. Though training regressions on controlled facial images can successfully capture the appearance variations, the performance of these appearance-based models are tightly related to the quantity and quality of the training data. In this paper, we develop a novel framework, named geometric correlated landmark regression (GCLR), to inherit the advantages but overcome limitations of these two categories of methods. Specifically, we first establish a landmark-to-landmark regression to estimate the geometry of facial images. By further incorporating a sparse coding term into the regression framework, we can successfully leverage the geometric correlations between the test image and the shape dictionary, thus significantly enhance the geometry regression performance. Experimental results on various challenging facial data sets verify the effectiveness and efficiency of GCLR.

关键词： Training Correlation Shape Face Geometry Databases Encoding

来源：评论

学校读者我要写书评

暂无评论

Interpersonal Relationship Analysis with Dyadic EEG Signals via Learning Spatial-Temporal Patterns

arXiv

引用

arXiv 2024年

作者： Ji, Wenqi Liu, Fang Du, Xinxin Liu, Niqi Zhou, Chao Yu, Minjing Zhao, Guozhen Liu, Yong-Jin BNRist Department of Computer Science and Technology MOE Key Laboratory of Pervasive Computing Tsinghua University China State Key Laboratory of Media Convergence and Communication Communication University of China China Institute of Software Chinese Academy of Sciences China College of Intelligence and Computing Tianjin University China CAS Key Laboratory of Behavioral Science Institute of Psychology China

Interpersonal relationship quality is pivotal in social and occupational contexts. Existing analysis of interpersonal relationships mostly rely on subjective self-reports, whereas objective quantification remains challenging. In this paper, we propose a novel social relationship analysis framework using spatio-temporal patterns derived from dyadic EEG signals, which can be applied to quantitatively measure team cooperation in corporate team building, and evaluate interpersonal dynamics between therapists and patients in psychiatric therapy. First, we constructed a dyadic-EEG dataset from 72 pairs of participants with two relationships (stranger or friend) when watching emotional videos simultaneously. Then we proposed a deep neural network on dyadic-subject EEG signals, in which we combine the dynamic graph convolutional neural network for characterizing the interpersonal relationships among the EEG channels and 1-dimension convolution for extracting the information from the time sequence. To obtain the feature vectors from two EEG recordings that well represent the relationship of two subjects, we integrate deep canonical correlation analysis and triplet loss for training the network. Experimental results show that the social relationship type (stranger or friend) between two individuals can be effectively identified through their EEG data. Copyright © 2024, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Analysis of an M(λ1,λ2)/M/1/WV queue with controlled vacation interruption and variable arrival rate

引用

Mathematical and Computational Applications 2015年第1期20卷 39-49页

作者： Wu, Wenqing Tang, Yinghui Visual Computing and Virtual Reality Key Laboratory of Sichuan Province Sichuan Normal University ChengduSichuan China School of Mathematics and Software Science Sichuan Normal University ChengduSichuan China

This paper studies a Markovian queue with multiple working vacations and controlled vacation interruption. If there are at least N customers waiting upon completion of a service at a lower rate, the vacation is interrupted and the server returns to the system to resume the normal working level. Otherwise, the server continues the vacation until the system is non-empty after a vacation ends or there are at least N customers after a service ends. Moreover, the variable arrival rate of the customers is taken into account. Under such assumptions, by using the quasi-birth-and-death process, the matrix-geometric method and the difference equation theory, the steady-state queue length distribution along with various performance measures are derived. Additionally, under a certain cost structure, the optimal threshold N∗ that minimizes the long-run expected cost function per unit time is numerically determined. © 2015, Association for Scientific Research. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Asymmetric Group key Agreement Protocol from Short Signatures

Asymmetric Group Key Agreement Protocol from Short Signature...

引用

International Conference on Computer and communications (ICCC)

作者： Kunyu Shen Lei Zhang Rui Zhang Qihao Fang Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China Science and Technology on Communication Security Laboratory Chengdu Sichuan China

Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem.

关键词： Resistance Adaptation models Protocols Computational modeling Authentication Public key cryptography Encryption

来源：评论

学校读者我要写书评

暂无评论

An emotional harmony generation system

An emotional harmony generation system

引用

Congress on Evolutionary Computation

作者： Bin Xu Shangfei Wang Xian Li Key Laboratory of Computing Software of Anhui Province School of Computer Science and Technology University of Science and Technology China Department of Automation University of Science and Technology China

This paper proposes an emotional harmony composition system using a series of predefined rules and interactive genetic algorithm. Two kinds of rules are defined: One is harmony composition rules used for composing harmony and the other is harmony emotion rules which may indicate the mapping between harmonic elements and a specific emotion of either happiness or sadness. Interactive genetic algorithm is applied to incorporate users' subjective perception in the generated harmony. Both subjective and objective experiments are conducted to prove the effectiveness of our approach.

关键词： User interfaces Humans Harmonic analysis Converters Music Genetics Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

FACIAL ACTION UNIT RECOGNITION BY RELATION MODELING FROM BOTH QUALITATIVE KNOWLEDGE AND QUANTITATIVE DATA

FACIAL ACTION UNIT RECOGNITION BY RELATION MODELING FROM BOT...

引用

IEEE International Conference on Multimedia and Expo Workshops

作者： Zhen Gao Shangfei Wang Chongliang Wu Jun Wang Qiang Ji Key Lab of Computing and Communication Software of Anhui Province School of Computer Science and Technology University of Science and Technology of China Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute

ISBN: (纸本)9781479947164

In this paper, we propose to capture Action Unit (AU) relations existing in both qualitative knowledge and quantitative data through Credal Networks (CN). Each node of the CN represents an AU label, and the links and probability intervals capture the probabilistic dependencies among multiple AUs. The structure of CN is designed based on prior knowledge. The parameters of CN are learned from both knowledge and ground-truth AU labels. The AU preliminary estimations are obtained by an existing image-driven recognition method. With the learned credal network, we infer the true AU labels by combining the relationships among labels with the previous obtained estimations. Experimental results on the CK+ database and MMI database demonstrate that with complete AU labels, our CN model is slightly better than the Bayesian Network (BN) model, demonstrating that credal sets learned from data can capture uncertainty more reliably;With incomplete and error-prone AU annotations, our CN model outperforms the BN model, indicating that credal sets can successfully capture qualitative knowledge.

关键词： Prior knowledge Credal network AU recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：