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

JOURNAL OF MOLECULAR AND CELLULAR CARDIOLOGY PLUS 2025年 11卷 100290-100290页

作者： Bastos, Jose Mesquita Colaco, Beatriz Baptista, Rui Gavina, Cristina Vitorino, Rui Univ Aveiro Inst Biomed iBiMED Dept Med Sci P-3810193 Aveiro Portugal Univ Porto Cardiovasc R&D Ctr UnICRISE Dept Surg & Physiol Fac Med P-4200319 Porto Portugal Hosp Infante D Pedro Ctr Hosp Baixo Vouga Cardiol Dept Aveiro Portugal Ctr Hosp Entre Douro & Vouga Dept Cardiol Santa Maria Feira Portugal Univ Coimbra Fac Med Coimbra Portugal Univ Coimbra Ctr Innovat Biomed & Biotechnol CIBB Coimbra Portugal Clin Acad Ctr Coimbra CACC Coimbra Portugal Pedro Hispano Hosp ULS Matosinhos Matosinhos Portugal Univ Porto Fac Med Cardiol Dept Oporto Portugal Univ Porto Fac Med RISE Hlth Res Network Oporto Portugal

Heart failure (HF) remains a major cause of morbidity and mortality worldwide and represents a major challenge for diagnosis, prognosis and treatment due to its heterogeneity. Traditional biomarkers such as BNP and NTproBNP are valuable but insufficient to capture the complexity of HF, especially phenotypes such as HF with preserved ejection fraction (HFpEF). Recent advances in multi-omics technology and novel biomarkers such as cell-free DNA (cfDNA), microRNAs (miRNAs), ST2 and galectin-3 offer transformative potential for HF management. This review explores the integration of these innovative biomarkers into clinical practice and highlights their benefits, such as improved diagnostic accuracy, enhanced risk stratification and non-invasive monitoring capabilities. By leveraging multi-omics approaches, including lipidomics and metabolomics, clinicians can uncover new pathways, refine the classification of HF phenotypes, and develop personalized therapeutic strategies tailored to individual patient profiles. Remarkable advances in proteomics and metabolomics have identified biomarkers associated with key HF mechanisms such as mitochondrial dysfunction, inflammation and fibrosis, paving the way for targeted therapies and early interventions. Despite the promising results, significant challenges remain in translating these findings into routine care, including high costs, technical limitations and the need for large-scale validation studies. This report argues for an integrative, multi-omics-based model to overcome these obstacles and emphasizes the importance of collaboration between researchers, clinicians and policy makers. By linking innovative science with practical applications, multi-omics approaches have the potential to redefine HF management and lead to better patient outcomes and more sustainable healthcare systems.

关键词： Multi-omics Biomarkers Proteomics Lipidomics Metabolomics data complexity Advanced bioinformatics Personalized medicine Diagnostic tools

来源：评论

学校读者我要写书评

暂无评论

Preliminary Evaluation of Classification complexity Measures on Imbalanced data

Preliminary Evaluation of Classification Complexity Measures...

引用

2013年中国智能自动化学术会议

作者： Yan Xing Hao Cai Yanguang Cai Ole Hejlesen Egon Toft School of Automation Guangdong University of Technology Department of Health Science and Technology Aalborg University

Classification complexity measures play an important role in classifier selection and are primarily designed for balanced *** on binary classification, this paper proposes a novel methodology to evaluate their validity on imbalanced *** twelve complexity measures composed by Ho are evaluated on synthetic imbalanced data sets with various probability distributions,various boundary shapes and various data *** experimental results demonstrate that most of the complexity measures are statistically changeable as data skewness *** need to be revised and improved for imbalanced data.

关键词： data complexity Imbalanced data Classification

来源：评论

学校读者我要写书评

暂无评论

Impossible Differential Cryptanalysis of Reduced-Round ARIA and Camellia

引用

Journal of Computer Science & Technology 2007年第3期22卷 449-456页

作者：吴文玲张文涛冯登国 State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences

This paper studies the security of the block ciphers ARIA and Camellia against impossible differential cryptanalysis. Our work improves the best impossible differential cryptanalysis of ARIA and Camellia known so far. The designers of ARIA expected no impossible differentials exist for 4-round ARIA. However, we found some nontrivial 4-round impossible differentials, which may lead to a possible attack on 6-round ARIA. Moreover, we found some nontrivial 8-round impossible differentials for Camellia, whereas only 7-round impossible differentials were previously known. By using the 8-round impossible differentials, we presented an attack on 12-round Camellia without FL/FL^-1 layers.

关键词： block cipher ARIA Camellia data complexity time complexity impossible differential cryptanalysis

来源：评论

学校读者我要写书评

暂无评论

Statistical Model on CRAFT

引用

Chinese Journal of Electronics 2022年第4期31卷 698-712页

作者： WANG Caibing GUO Hao YE Dingfeng WANG Ping State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences Tianjin Aerospace Zhongwei Data System Technology Co. Ltd.

Many cryptanalytic techniques for symmetric-key primitives rely on specific statistical analysis to extract some secrete key information from a large number of known or chosen plaintext-ciphertext pairs. For example, there is a standard statistical model for differential cryptanalysis that determines the success probability and complexity of the attack given some predefined configurations of the attack. In this work, we investigate the differential attack proposed by Guo et al. at Fast Software Encryption Conference 2020 and find that in this attack, the statistical behavior of the counters for key candidates deviate from standard scenarios, where both the correct key and the correct key xor specific difference are expected to receive the largest number of votes. Based on this bimodal behavior, we give three different statistical models for truncated differential distinguisher on CRAFT(a cryptographic algorithm name) for bimodal phenomena. Then, we provide the formulas about the success probability and data complexity for different models under the condition of a fixed threshold value. Also, we verify the validity of our models for bimodal phenomena by experiments on round-reduced of the versions distinguishers on CRAFT. We find that the success probability of theory and experiment are close when we fix the data complexity and threshold value. Finally, we compare the three models using the mathematical tool Matlab and conclude that Model 3 has better performance.

关键词： Differential cryptanalysis Statistical models Success probability data complexity Bimodal behavior CRAFT Differential fault analysis (DFA) attacks

来源：评论

学校读者我要写书评

暂无评论

STATE: A Clustering Algorithm Focusing on Edges Instead of Centers

引用

Chinese Journal of Electronics 2021年第5期30卷 902-908页

作者： ZHAO Boxiang WANG Shuliang LIU Chuanlu School of Computer Science and Technology Beijing Institute of Technology Institute of E-Government Beijing Institute of Technology

With the expansion of data scale and the increase in data complexity, it is particularly important to accurately identify clusters and efficiently save clustering results. To address this, we propose a novel clustering algorithm, Shape clustering based on data field(STATE),which can quickly identify clusters of arbitrary shapes and greatly reduce the storage space of clustering results in any datasets without reducing the accuracy. STATE mainly focuses on finding the edges of clusters and directions of edges instead of clustering centers through the data *** results of STATE are presented as the edges of clusters without data objects inside clusters and without *** experiments show that STATE can recognize complex data distribution in noisy environments without discrimination and greatly save the storage space of clustering results. When it is applied in a real-world scene,facial feature extraction, STATE can recognize eyes, nose,mouth, eyebrows and facial contours automatically without calibrating key features or training. Using the extracted facial features, we achieve facial recognition with high accuracy.

关键词： clustering algorithm focusing storage space data complexity data field complex data distribution data objects data scale pattern clustering Shape clustering edges instead face recognition feature extraction novel clustering algorithm

来源：评论

学校读者我要写书评

暂无评论

Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2014年第partb期259卷 592-598页

作者： Bogdanov, Andrey Kavun, Elif Bilge Tischhauser, Elmar Yalcin, Tolga Katholieke Univ Leuven ESAT COSIC Louvain Belgium Ruhr Univ Bochum Horst Gortz Inst IT Secur Bochum Germany

Linear cryptanalysis is one of the few major attack techniques in today's cryptography. Every new cipher comes with strong arguments against it. Still, some recent relevant ciphers such as the ISO/IEC lightweight block cipher PRESENT proved to be particularly vulnerable to linear cryptanalysis. Since most attacks published today - including the linear cryptanalysis have complexities beyond practical reach, the evaluation of their complexities has to rely on rather theoretical computational models. The latter are often based on unproven and not always precise assumptions that might result in inexact models. Very recently, in FSE'13, it has been demonstrated that the standard models the cryptanalysts - have been relying on for a long time in linear attacks, while being quite adequate for a wide range of parameters, tend to fail when the attack to be evaluated tries to recover a high number of bits in the secret key of the cipher. However, this is actually the top-priority goal of any adversary. To amend the standard models that proved somewhat inaccurate in this crucial parameter range, a new model has been proposed based on an enhanced wrong key randomization hypothesis. However, this model has been verified only for quite small ciphers of 20-bit block size. At the same time, in the real-world applications, the block size of a cipher is usually 32 bits and higher. Thus, the experimental verification of the model remains quite limited. In this article, we aim to bridge this gap and study this novel model for much bigger ciphers. We are able to perform its computational validation for cipher with up to 36 bits with meaningful resolution. Our work confirms that the new model of FSE'13 is significantly more accurate for a wide range of cipher parameters. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Block ciphers Linear cryptanalysis data complexity Wrong key randomization hypothesis

来源：评论

学校读者我要写书评

暂无评论

Foundations of modal deductive databases

引用

FUNDAMENTA INFORMATICAE 2007年第1-2期79卷 85-135页

作者： Nguyen, Linh Anh Warsaw Univ Inst Informat PL-02097 Warsaw Poland

We give formulations for modal deductive databases and present a modal query language called Mdatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the top-down evaluation algorithm, and the magic-set transformation for Mdatalog queries. The results of this paper like soundness and completeness of the top-down evaluation algorithm or correctness of the magic-set transformation are proved for the multimodal logics of belief K DI4(s)5, KDI45, KD4(s)5(s), KD45((m)), KD4I(g)5(a), and the class of serial context-free grammar logics. We also show that Mdatalog has PTIME data complexity in the logics KDI4(s)5, KDI45, KD4(s)5(s), and KD45((m)).

关键词： modal logics deductive databases modal logic programming relational algebra seminaive evaluation query-subquery evaluation magic-set transformation data complexity

来源：评论

学校读者我要写书评

暂无评论

Dinamite: internal differential match-in-the-end attack on eight-round PAEQ

引用

IET INFORMATION SECURITY 2019年第4期13卷 378-392页

作者： Saha, Dhiman Kakarla, Sourya Chowdhury, Dipanwita Roy IIT Bhilai Dept Elect Engn & Comp Sci Raipur Madhya Pradesh India Microsoft Corp Hyderabad India IIT Kharagpur Dept Comp Sci & Engn Crypto Res Lab Kharagpur W Bengal India

The authors explore a cryptanalysis strategy which seems to be particularly applicable to parallelisable ciphers where the key forms a part of the internal state. The proposed technique combines internal differentials with guess and determine analysis to come up with what is referred to as the match-in-the-end attack. The notion of difference here deviates from the classical differential where the difference is controllable via the plaintext/ciphertext. Here, they exploit the Hamming distance between parallel branches to devise the differential trail. They apply the strategy on full eight (out of 20) rounds of parallelisable authenticated cipher [parallelisable AE based on quadrupled AES (PAEQ)] to devise key recovery attacks with practical time complexities. They first show an initial attack on paeq-64/80/128 and then devise improvements which give us the best key-recovery attacks with time complexities of $2<^>{33}\comma \;2<^>{48}$233,248, and $2<^>{64}$264, respectively. While the best reported attacks on eight-round paeq-64/80/128 have a data complexity of $2<^>{89}$289 blocks, the result improves their time complexities by factors of $2\comma \;2<^>{18}$2,218, and $2<^>{34}$234, while preserving the data complexity. Finally, they present a nonce-based differential attack which works on paeq-128-t with $2<^>{64}$264 time complexity but uses just two single block known plaintexts making it the most practical attack on any round-reduced PAEQ variant reported so far.

关键词： computational complexity cryptography internal differential match-in-the-end attack eight-round PAEQ cryptanalysis strategy parallelisable ciphers internal differentials classical differential differential trail parallelisable authenticated cipher key recovery attacks key-recovery attacks data complexity nonce-based differential attack PAEQ variant plaintext-ciphertext time complexities time complexity Dinamite

来源：评论

学校读者我要写书评

暂无评论

Weak keys of the full MISTY1 block cipher for related-key amplified boomerang cryptanalysis

引用

IET INFORMATION SECURITY 2018年第5期12卷 389-397页

作者： Lu, Jiqiang Yap, Wun-She Wei, Yongzhuang Beihang Univ Sch Cyber Sci & Technol Beijing 100083 Peoples R China Univ Tunku Abdul Rahman Lee Kong Chian Fac Engn & Sci Sungai Long 43000 Malaysia Multimedia Univ Fac Informat Sci & Technol Melaka 75450 Malaysia Guilin Univ Elect Technol Guilin City 541004 Guangxi Provinc Peoples R China Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing 100093 Peoples R China

The MISTY1 block cipher has a 64-bit block size, a 128-bit master key, and a total of 8 rounds. It is an ISO international standard, a Japanese CRYPTREC-recommended e-government cipher, and a European NESSIE selected cipher. In this study, the authors show another cryptographic weakness of the full MISTY1 cipher: they describe four classes of 290 weak keys of the full MISTY1 cipher for a related-key amplified boomerang attack that has a data complexity of 260.5 chosen plaintexts and a time complexity of 287.33 encryptions under each class of weak keys. The result shows that the MISTY1 cipher can be distinguishable from an ideal cipher in terms of related-key amplified boomerang cryptanalysis, and users should be very careful when using MISTY1 for a full security in relevant application situations.

关键词： public key cryptography private key cryptography ISO standards full MISTY1 block cipher related-key amplified boomerang cryptanalysis block size master key ISO international standard Japanese CRYPTREC-recommended e-government cipher European NESSIE selected cipher cryptographic weakness data complexity time complexity 2(87) 33 encryptions 2(60) 5 chosen plaintexts 2(90) weak keys

来源：评论

学校读者我要写书评

暂无评论

complexity metrics for manufacturing control architectures based on software and information flow

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2005年第1期49卷 1-20页

作者： Phukan, A Kalava, M Prabhu, V Penn State Univ Harold & Inge Marcus Dept Ind & Mfg Engn University Pk PA 16802 USA

A number of architectures can be used to integrate different components of a manufacturing enterprise such as machine tools, robots, and guided vehicles. The choice of architecture has a significant impact on system complexity, which in turn determines properties such as scalability, flexibility, fault-tolerance and modifiability. There is a need to develop metrics that quantify the complexity of a system that can serve as a means for comparing alternative architecture at the design stage. In this paper, we propose metrics used in software engineering to characterize the complexity of manufacturing systems. These metrics have been applied for measuring the complexity of two software systems: material delivery system and distributed scheduling. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： software complexity inter-module intra-module cyclomatic complexity data complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：