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

International Conference on computer and Communications (ICCC)

作者： Qianxi Shi Yulong Wang Tongcun Liu Lei Zhang Jianxin Liao State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China School of Mathematics and Computer Science Zhejiang A&F University Hangzhou China

ISBN: (数字)9798331507077

ISBN: (纸本)9798331507084

Handwritten signature verification is a commonly used method of identity authentication, but given its relatively lower fabrication difficulty compared to other biometric characteristics like facial recognition, designing algorithms for this purpose poses greater challenges. Existing handwritten signature verification algorithms mainly suffer from two drawbacks: firstly, due to the private and confidentiality of signatures, there is often a lack of substantial high-quality signature images for model training. Secondly, the majority of existing algorithms are implemented using convolutional architectures, where the localized neighborhood operations of CNNs limit the model's ability to capture the global interrelationships of signature strokes. To address these challenges, we introduce a self-supervised learning algorithm grounded in the Transformer framework. This approach incorporates convolutional cropping and grayscale inversion for the preprocessing of input images. Additionally, we integrate a convolutional image block encoding module into the network to supplement the network with local contextual information. The superiority of our proposed algorithm over current state-of-the-art self-supervised algorithms is validated through t-SNE visualization modeling and comparative ablation studies, demonstrating its feasibility.

关键词： Training Representation learning Fabrication Handwriting recognition Visualization Image coding Face recognition Self-supervised learning Gray-scale Transformers

来源：评论

学校读者我要写书评

暂无评论

A Tree Structure for Local Diagnosis in Multiprocessor Systems Under Comparison Model 25th

A Tree Structure for Local Diagnosis in Multiprocessor Sys...

引用

25th International computer Symposium on New Trends in computer Technologies and Applications, ICS 2022

作者： Chen, Meirun Lin, Cheng-Kuan Pai, Kung-Jui School of Mathematics and Statistics Xiamen University of Technology Xiamen China Department of Computer Science National Yang Ming Chiao Tung University Hsinchu Taiwan Department of Industrial Engineering and Management Ming Chi University of Technology New Taipei City Taiwan

ISBN: (纸本)9789811995811

If we only care about the status of a particular vertex, instead of doing global diagnosis, Hsu and Tan introduced the concept of local diagnosis and proposed an extended star structure to diagnose a vertex under comparison model. Usually, there is a gap between the local diagnosability and the lower bound guaranteed by the extended star structure mentioned above. In this paper, we propose a new testing structure and corresponding diagnosis algorithm to diagnose a vertex under comparison model to better evaluate the local diagnosability. The local diagnosability of a vertex is upper bounded by its degree in the system. If the local diagnosability of each vertex equals to its degree in the system then we say this system has the strong local diagnosability property. Based on the new structure, we show that the n-dimensional star graph Sn with faulty links has the strong local diagnosability property provided that each vertex connects to at least three fault-free links. Simulations are presented to show the performance of our tree structure. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

DCHT: Deep Complex Hybrid Transformer for Speech Enhancement

DCHT: Deep Complex Hybrid Transformer for Speech Enhancement

引用

International Conference on Digital Data Processing (DDP)

作者： Jialu Li Junhui Li Pu Wang Youshan Zhang School of public policy Cornell University Ithaca NY USA Department of Mathematics School of Science University of Science and Technology Liaoning Anshan China Department of Artificial Intelligence and Computer Science Yeshiva University New York NY USA

Most of the current deep learning-based approaches for speech enhancement only operate in the spectrogram or wave-form domain. Although a cross-domain transformer combining waveform- and spectrogram-domain inputs has been proposed, its performance can be further improved. In this paper, we present a novel deep complex hybrid transformer that integrates both spectrogram and waveform domains approaches to improve the performance of speech enhancement. The proposed model consists of two parts: a complex Swin-Unet in the spectrogram domain and a dual-path transformer network (DPTnet) in the waveform domain. We first construct a complex Swin- $V$ net network in the spectrogram domain and perform speech enhancement in the complex audio spectrum. We then introduce improved DPT by adding memory-compressed attention. Our model is capable of learning multi-domain features to reduce existing noise on different domains in a complementary way. The experimental results on the BirdSoundsDenoising dataset and the VCTK+DEMAND dataset indicate that our method can achieve better performance compared to state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DDCM: Cracking Anonymized Facial Images Using Denoising Diffusion Cryptanalytic Model

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Jiang, Donghua Ni, Jiangqun Alasbali, Nada Nafea, Ibtehal Liu, Qingliang Ahmad, Jawad Boulila, Wadii Sun Yat-sen University School of Computer Science and Engineering Guangzhou510006 China Sun Yat-sen University School of Cyber Science and Technology Shenzhen518107 China Peng Cheng Laboratory Department of New Networks Shenzhen518052 China King Khalid University College of Computer Science Department of Informatics and Computing Systems Abha61421 Saudi Arabia Taibah University College of Computer Science and Engineering Medina41477 Saudi Arabia Qingdao University of Science and Technology School of Mathematics and Physics Qingdao266061 China Prince Mohammad Bin Fahd University Cybersecurity Center Alkhobar Saudi Arabia Prince Sultan University Robotics and Internet-of-Things Laboratory Riyadh12435 Saudi Arabia

Currently, in consumer electronics industry, quite a number of E-healthcare products highly depend on consumers' facial biometrics for both disease diagnosis and identity authen-tication. In light of this, various facial privacy-preserving approa-ches oriented towards the internet of medical things have been proposed, including visual cryptography and desensitization tech-nique. Nevertheless, few attentions have been paid to investigating their countermeasure, i.e., facial privacy analysis, owning to significant distribution discrepancy between the original and anony-mized facial images. To this end, a general Denoising Diffusion Cryptanalytic Model (DDCM) is proposed in this paper to recon-struct the original facial images in a coarse-to-fine manner from their encrypted ones with diverse anonymous approaches. Spec-ifically, to accurately reconstruct the original facial image without any prior knowledge, a customized initial prediction module with an encoder-decoder structure is introduced by taking advantage of its leaked visual cues to generate the coarse face. Furthermore, the residual map between the original and coarse facial images is explicitly modeled with the output of the customized prediction module as a conditional prior, thereby obtaining a refined facial image. Finally, extensive experiments demonstrate that the propo-sed DDCM could not only effectively crack multiple handcrafted facial anonymization approaches, such as blurring, pixelation and thumbnail-preserving encryption, but also outperform the prev-ious works (e.g., Pix2Pix) in terms of image fidelity and attack success rate. © 1975-2011 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Dynamics of the Gierer–Meinhardt reaction–diffusion system: Insights into finite-time stability and control strategies

引用

Partial Differential Equations in Applied mathematics 2025年 14卷

作者： Qazza, Ahmad Bendib, Issam Hatamleh, Raed Saadeh, Rania Ouannas, Adel Department of Mathematics Faculty of Science Zarqa University Zarqa 13110 Jordan Brothers Mentouri University of Constantine Faculty of Exact Sciences Department of Mathematics Applied Mathematics and Modeling Laboratory Algeria Department of Mathematics Faculty of Science and Information Technology Jadara University P.O. Box 733 Irbid 21110 Jordan Department of Mathematics and Computer Science University of Oum EL-Bouaghi Oum El Bouaghi 04000 Algeria

This study delves into the dynamics of the Gierer–Meinhardt (GM) reaction–diffusion (RD) system, focusing on finite-time stability (FTS) and synchronization (FTSYN) within integer-order spatiotemporal partial differential frameworks. Unlike traditional studies emphasizing asymptotic stability, this work presents novel insights into achieving synchronization and equilibrium within a predefined finite time. By leveraging Lyapunov-based methodologies, sufficient conditions are derived to guarantee FTS and transient behavior control. A synchronization scheme for master–slave systems is developed, ensuring coherent dynamics within a finite time frame. Numerical simulations, employing the finite difference method, validate the theoretical findings and demonstrate the practical applications of the proposed strategies in systems requiring stringent temporal constraints. The results highlight significant advancements in RD modeling, with implications for biological pattern formation, robotics, and distributed networks, paving the way for innovative control solutions in complex dynamical systems. © 2025 The Authors

关键词： Control strategies Finite-time stability Finite-time synchronization Gierer–Meinhardt model Lyapunov functions Reaction–diffusion systems

来源：评论

学校读者我要写书评

暂无评论

Constructing cospectral hypergraphs

arXiv

引用

arXiv 2022年

作者： Abiad, Aida Khramova, Antonina P. Department of Mathematics and Computer Science Eindhoven University of Technology Netherlands Department of Mathematics: Analysis Logic and Discrete Mathematics Ghent University Belgium Department of Mathematics and Data Science Vrije Universiteit Brussel Belgium

Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be deduced from their spectra. In this paper, we show a new method for constructing cospectral uniform hypergraphs using two well-known hypergraph representations: adjacency tensors and adjacency matrices. © 2022, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of a Secured Phrase Searching Model Using Cipher Principles Over Cloud Computing Platform

Experimental Evaluation of a Secured Phrase Searching Model ...

引用

2024 International Conference on Intelligent Systems for Cybersecurity, ISCS 2024

作者： Geetha, R. Parameshwari, M. Kanniga Praveena, V. Venkatesan, T. Sindhu, M. Bhuvana, S. Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Saveetha University Department of Electrical and Electronics Engineering Tamil Nadu Chennai India Rmk Engineering College Department of Information Technology Tamil Nadu Chennai India Tamil Nadu Chennai India R. M. D. Engineering College Department of Mathematics Tamil Nadu Chennai India Prince Shri Venkateshwara Padmavathy Engineering College Department of Computer Science and Engineering Tamil Nadu Chennai India Sriram Engineering College Department of Computer Science and Engineering Tamil Nadu Chennai India

ISBN: (纸本)9798350375237

For many cloud-based IoT device learning applications, including sensible clinical data analytics, phrase search - which allows retrieval of files containing a given term - plays a crucial role. In order to prevent sensitive information from being exposed by third-party providers, data owners typically encrypt files (such as medical records) before sending them to the cloud. Having said that, this does make the search operation quite challenging and current searchable encryption systems for multiple keyword searches can't do word searches because they can't determine the location connection of multiple key phrases in a query word using encrypted data stored on the cloud server side. This study presents a model called MCLPS, which stands for 'Modified Cyber Law for Phrase Searching.' Its purpose is to identify specific phrases in a cloud environment. To test how well the model works, it is cross-validated with the traditional BET. The safety of information in the cloud has long been an important concern for cloud service providers and their clients, despite the fact that there are several elements that could affect data security during searches. The reason behind this is the presence of dangers posed by both external data sources and internal partners, namely, their employees. Therefore, due to its massive structure, maintaining this security perfect is an ongoing headache and difficult effort in the cloud. In most cases, this is achieved by encrypting data at all times and taking extra precautions to ensure that data is not compromised during the audition or any other internal exercises. For safe phrase search in cloud IoT, this study suggested the MCLPS model and the BET encryption technique. The data integration, recovery, indexing, sliding, encryption, decryption, and transfer processes are all encompassed in the suggested works. This proposed study introduces a new approach to encrypted searching that allows encrypted phrase searches, and the MCLPS ad BET proced

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Enhanced Image Concealment: Leveraging LSB and Brotli Compression

Enhanced Image Concealment: Leveraging LSB and Brotli Compre...

引用

Advancement in technology (ICONAT), International Conference for

作者： Shaik Yacoob Vikrant Sabnis Jay Kumar Jain Mansarovar Global University Bhopal MP India Department of Computer Science Faculty of Engineering and Technology Mansarovar Global University Bhopal MP India Department of Mathematics Bioinformatics and Computer Applications Maulana Azad National Institute of Technology Bhopal MP India

ISBN: (数字)9798350354171

ISBN: (纸本)9798350354188

Steganography a cryptographic technique enables the concealment of confidential data within multimedia files like images and videos. This method facilitates the exchange of encrypted information through unconventional means, ensuring that only intended recipients can decipher the hidden message. The LSB technique has attracted significant attention in the literature due to its capability to conceal secret message bits within the least significant parts of image pixels. Although LSB has performed well in image steganography, there is some way to go in terms of its development, especially in the ways in which messages are dealt with. This paper presents a new technique of image steganography basing on the LSB method and the BROTLI algorithm. It uses the compression algorithm to compress message text. After that, to scramble the text, one LSB embedding technique is then used to hide the compressed text in the cover image. Applying the methods of data analysis on the benchmark images, the new approach developed outperforms the standard methods that exist at the present stage. This supports the idea of performing BROTLI on data with a view of compressing the data to be embedded in LSBs.

关键词： Measurement Steganography Image coding Data analysis Streaming media Benchmark testing Compression algorithms Standards Videos

来源：评论

学校读者我要写书评

暂无评论

Conceptual Implementation of LSTM-Improved LA Based Smart Electric Vehicle Battery Management System 2

Conceptual Implementation of LSTM-Improved LA Based Smart El...

引用

2nd International Conference on Augmented Intelligence and Sustainable Systems, ICAISS 2023

作者： Kumar, Kundan Sadhu, Pradeep Kumar Farkhad, Durdana Rustamova Gracious, L.A. Anto Ramachandran, S. Devi, V. Chithra Ism Department of Electrical Engineering Jharkhand Dhanbad India Western Caspian University Department of Mechanics and Mathematics Azerbaijan Rmk College of Engineering and Technology Department of Computer Science and Engineering Tamilnadu Puduvoyal India Paavai Engineering College Electrical and Electronics Engineering Tamilnadu Namakkal India Psna College of Engineering and Technology Department of English Tamilnadu Dindigul India

ISBN: (纸本)9798350325799

The importance of green energy is growing in the modern world. That's why, in terms of environmental impact, electric vehicles are the best option for commuters and car owners alike. Lithium-ion batteries are commonly utilized in EVs because of their high energy and current density. Lithium-ion batteries pose a risk if used outside of their Safe Operating Area (SOA). This necessitates the incorporation of BMS technology into all lithium-ion batteries, not just those used in EVs. It delves deeply into the nature, function, and structure of BMS. A literature review also covers early battery models as well as the hardware and system architecture for BMS. The simulation results are then used to show how well the updated model of the battery performs. Preprocessing, feature selection, and model training are all included in the research article. It employs a PCC for feature selection and an LSTM- ILA for model training. The proposed method achieves better results than both the LSTM and LSTM-LA models. © 2023 IEEE.

关键词： Electric vehicles

来源：评论

学校读者我要写书评

暂无评论

On the existence of small strictly Neumaier graphs

arXiv

引用

arXiv 2023年

作者： Abiad, Aida De Boeck, Maarten Zeijlemaker, Sjanne Department of Mathematics and Computer Science Eindhoven University of Technology Netherlands Department of Mathematics: Analysis Logic and Discrete Mathematics Ghent University Belgium Department of Mathematics and Data Science of Vrije Universiteit Brussel Belgium Department of Mathematical Sciences University of Memphis United States Department of Mathematics: Algebra and Geometry Ghent University Flanders Belgium

A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In particular, we present a theoretical proof of the uniqueness of the smallest strictly Neumaier graph with parameters (16, 9, 4;2, 4), we establish the existence of a strictly Neumaier graph with parameters (25, 12, 5;2, 5), and we disprove the existence of strictly Neumaier graphs with parameters (25, 16, 9;3, 5), (28, 18, 11;4, 7), (33, 24, 17;6, 9), (35, 22, 12;3, 5), (40, 30, 22;7, 10) and (55, 34, 18;3, 5). Our proofs use combinatorial techniques and a novel application of integer programming methods. © 2023, CC BY.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：