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

A New hash algorithm Exploiting Triple-state Bucket Directory for Flash Storage Devices

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2016年第4期62卷 398-404页

作者： Kim, Bo-kyeong Kang, Joo-Young Lee, Dong-Ho Hanyang Univ Dept Comp Sci & Engn Seoul South Korea

Recently, the flash storage device becomes more important to the mobile consumer electronics that supports various functionalities because of its portability and reliability. The capacity of the flash storage device is becoming larger and its price is going down due to the mass production of the Triple-Level Cell (TLC) flash memory. Since TLC flash memories are very cheap, they are widely deployed in the mobile flash storage device although its durability is poor. In addition, it is difficult to handle the large-scale flash memories with limited memory resources in the mobile flash storage device. Therefore, TLC-based flash storage device requires to internally optimize the write and erase operations with small memory resources. This paper proposes a new hash-based mapping algorithm, which reduces the redundant write and erase operations and uses only a few memory resources, for the mobile flash storage device. The proposed hash algorithm also guarantees uniform performance regardless of various workload patterns. Through various experiments with related works, this paper shows the superiority of the proposed hash algorithm(1).

关键词： Flash Memory Flash Translation Layer hash algorithm Block Mapping

来源：评论

学校读者我要写书评

暂无评论

The Incremental Knowledge Acquisition Based on hash algorithm

引用

INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS 2016年第3期24卷 347-366页

作者： Zhang, Qing-Hua Yao, Long-Yang Zhang, Guan-Sheng Xin, Yu-Ke Chongqing Univ Posts & Telecommun Chongqing Key Lab Computat Intelligence Chongqing 40065 Peoples R China Chongqing Univ Posts & Telecommun Sch Sci 2 Chongwen Rd Chongqing 400065 Peoples R China Chongqing Univ Posts & Telecommun Res Ctr Intelligent Syst & Robot Chongqing 400065 Peoples R China

In this paper, a new incremental knowledge acquisition method is proposed based on rough set theory, decision tree and granular computing. In order to effectively process dynamic data, describing the data by rough set theory, computing equivalence classes and calculating positive region with hash algorithm are analyzed respectively at first. Then, attribute reduction, value reduction and the extraction of rule set by hash algorithm are completed efficiently. Finally, for each new additional data, the incremental knowledge acquisition method is proposed and used to update the original rules. Both algorithm analysis and experiments show that for processing the dynamic information systems, compared with the traditional algorithms and the incremental knowledge acquisition algorithms based on granular computing, the time complexity of the proposed algorithm is lower due to the efficiency of hash algorithm and also this algorithm is more effective when it is used to deal with the huge data sets.

关键词： Rough set hash algorithm attribute reduction knowledge acquisition uncertain knowledge

来源：评论

学校读者我要写书评

暂无评论

A Seven Tuple Firewall Rule Matching algorithm Based on hash Table 14

A Seven Tuple Firewall Rule Matching Algorithm Based on Hash...

引用

14th Asian Control Conference (ASCC)

作者： Teng, Yuc Li, Zhuohan Dalian Univ Technol Sch Control Sci & Engn Dalian Peoples R China

ISBN: (纸本)9798331540845;9789887581598

The traditional firewall packet filtering process primarily relies on five tuple firewall filtering rules for matching, encompassing the source IP address, destination IP, protocol type, source port, and destination port. However, due to the escalating sophistication of network attacks, the effectiveness of five tuple rules in safeguarding networks is constrained, thereby compromising the security of network communications. In this paper, a seven tuple firewall filtering rule is first proposed, which augments the existing five tuple by incorporating two additional elements: source Mac address and destination Mac address. Subsequently, a thorough analysis is conducted on potential conflicts among seven tuple firewall rules. Employing a divide and conquer strategy, the firewall rules are segmented into four subsets based on the network model: data link layer set, network layer set, transport and application layer set, and combined rule set. Furthermore, a method is proposed for achieving a conflict-free rule set by leveraging the relationships among the rules. Finally, a seven tuple firewall rule matching algorithm is introduced, which relies on a hash table built upon the conflict-free rule set. Compared to five tuple rules, seven tuple rules enable more targeted rule creation for specific devices within the network. Additionally, the algorithm outlined in this paper exhibits a straightforward data structure, facilitates easy rule updates, and boasts significantly faster matching speeds in comparison to traditional algorithms.

关键词： firewall packet filtering rule conflict divide and conquer hash algorithm

来源：评论

学校读者我要写书评

暂无评论

RETRACTED: Simulation of cross-modal image-text retrieval algorithm under convolutional neural network structure and hash method

引用

JOURNAL OF SUPERCOMPUTING 2022年第5期78卷 7106-7132页

作者： Yang, XianBen Zhang, Wei Beihua Univ Coll Comp Sci & Technol Jilin 132000 Jilin Peoples R China

The purpose of this work is to quickly find useful information from the massive image database in view of the images, videos, and other multimedia data generated on Internet platforms, such as Wechat, Sina Weibo and Twitter. The hash algorithm is utilized to map image high-dimensional features into binary code strings to deal with problems of traditional image retrieval algorithms, such as high feature dimension, large storage space, and low retrieval efficiency. Besides, an end-to-end deep hash learning network is designed based on semantic preservation, and the deep Convolutional Neural Network (CNN) is adopted for image feature extraction and hash function learning. Moreover, a binary-constrained regularization term is added to the loss function, and a semantic reservation layer is supplemented to optimize the generation of hash code. Furthermore, a semi-supervised hash learning network is proposed based on Generative Adversarial Network (GAN), which takes the hash network as a discriminator, and a discriminating node is introduced into the output layer to discriminate the true and false samples. For each innovation of the algorithm, retrieval experiments are carried out on several public datasets to further verify the performance of the proposed algorithm to prove the effectiveness. The results reveal that: the loss function of adaptive weight based on hash network reduces the influence of imbalances positive and negative sample on retrieval performance, the constrained regular terms reduce the error caused by quantization, avoids information loss caused by "Relaxation" strategy in traditional methods, and optimizes hash structure. In this way, the obtained hash code can retain semantic similarity and improve the retrieval accuracy. hash network based on GAN can improve the overall performance of the model by about 3%. Compared with the existing image retrieval algorithm, the deep hash learning algorithm has better effect in image retrieval than the current hash

关键词： Convolutional neural network hash algorithm Cross-modal image-text retrieval Semantic content constraints Adversarial network

来源：评论

学校读者我要写书评

暂无评论

High Performance Pipelined FPGA Implementation of the SHA-3 hash algorithm 4

High Performance Pipelined FPGA Implementation of the SHA-3 ...

引用

4th Mediterranean Conference on Embedded Computing (MECO

作者： Ioannou, Lenos Michail, Harris E. Voyiatzis, Artemios G. Cyprus Univ Technol Dept Elect Engn Comp Engn & Informat CY-3036 Lemesos Cyprus SBA Res Vienna Austria

ISBN: (纸本)9781479989997

The SHA-3 cryptographic hash algorithm is standardized in FIPS 202. We present a pipelined hardware architecture supporting all the four SHA-3 modes of operation and a high-performance implementation for FPGA devices that can support both multi-block and multi-message processing. Experimental results on different FPGA devices validate that the proposed design achieves significant throughput improvements compared to the available literature.

关键词： SHA-3 hash algorithm FPGA pipeline high performance

来源：评论

学校读者我要写书评

暂无评论

LBP feature and hash function based dual watermarking algorithm for database

引用

DATA & KNOWLEDGE ENGINEERING 2023年 148卷

作者： Li, De Ma, Chi Gao, Haoyang Jin, Xun Yanbian Univ Dept Comp Sci Yanji Peoples R China

In this paper, we propose a local binary pattern (LBP) feature and hash function based dual watermarking algorithm for database. Attribute feature columns are selected to generate zero watermarks using the Pearson correlation method. The zero watermarks are generated by the LBP. The attribute values of the selected feature columns are divided into two parts for embedding and extracting the watermark. Zero watermark feature code is embedded into the lowest significant bit of the selected attribute column by using the database watermarking algorithm with hash function for copyright authentication. The proposed method uses two-layer hashing method to improve the robustness. In the watermark extraction, a method of combining majority voting and Hamming error correction code is used to control the watermark error to ensure the correct extraction rate of the watermark. Experimental results show that the algorithm not only provides good availability of the database after embedding the watermark, but also ensures the correct extraction of the watermark after various attacks.

关键词： Database LBP feature Zero watermark hash algorithm Copyright protection

来源：评论

学校读者我要写书评

暂无评论

A hash Approach to Refine CNC Computation of Arc Length and Parameter of NURBS with High Efficiency and Precision

引用

INTERNATIONAL JOURNAL OF PRECISION ENGINEERING AND MANUFACTURING 2024年第6期25卷 1243-1256页

作者： Han, Xueting Zhu, Kongfeng Wang, Xingbo Foshan Univ Dept Mechatron 33 Guangyun Rd Foshan 528000 Guangdong Peoples R China GSK CNC Equipment Co Ltd R&D 22 Guanda Rd Guangzhou 510000 Guangdong Peoples R China Guangdong Coll Appl Sci & Technol Dept Intelligent Manufacture 20 Fengle Rd Zhaoqing 526000 Guangdong Peoples R China

A hash method is proposed to compute bi-directionally the arc length and the parameter of the NURBS curve in curve interpolation. By using a hash table that adopts a doubly linked circular list and a red-black tree, the method first computes the arc lengths corresponding to each initial knot value and stores the computed results in the hash table by means of an ingenious searching-and-computing technique. With the fast search capability of the hash algorithm, the stored data can be rapidly located to form a tiny interval for computing either the arc length or the parameter, greatly shortening the computation period and highly improving the computational precision. Experiments show that the proposed method is tens or even thousands of times more rapid and precise than the classical ones and is helpful to develop high-performance interpolators.

关键词： NURBS interpolation Arc length Knot parameter hash algorithm

来源：评论

学校读者我要写书评

暂无评论

Anew compact belief rule model for fault diagnosis

引用

CONTROL ENGINEERING PRACTICE 2025年 159卷

作者： Ming, Zhichao Zhou, Zhijie Hu, Changhua Feng, Zhichao Lian, Zheng Zhang, Chunchao Rocket Force Univ Engn Dept Missile Engn Xian 710025 Shaanxi Peoples R China

Amidst growing scrutiny of "black box" models in fault diagnosis applications that demand high interpretability, rule-based models are regaining prominence due to their inherent interpretability. Belief rule-based (BRB) models with belief distributions stand out in fault diagnosis. Nevertheless, the incorporation of multiple fault features introduces a substantial challenge for the BRB modeling, due to the phenomenon of combinatorial explosion, which leads to an exponential escalation in the number of rules required. To tackle the root cause of the exponential growth of rules in the BRB model, anew compact belief rule model (CBRM) for fault diagnosis is proposed. A flexible rule antecedent that leverages the similarity of reference values, eschewing the Cartesian product structure, is proposed to effectively diminish the complexity and size of the fault diagnosis model. Consequently, a rule activation method leveraging the hash algorithm has been proposed, wherein the spatial relationship between a sample and a rule is translated into binary code. The rule closest to the sample in each space is activated, and its corresponding activation weight is calculated combining the matching degree, fault features weights and rules weights. Subsequently, the reasoning and optimization of the CBRM are conducted to grab the diagnostic results and update parameters. Eventually, the fault diagnosis for relays is utilized to validate the proposed method.

关键词： Belief rule-based models Compact belief rule model Fault diagnosis hash algorithm Activation weight

来源：评论

学校读者我要写书评

暂无评论

Safeguarding confidentiality and privacy in cloud-enabled healthcare systems with spectrasafe encryption and dynamic k-anonymity algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2025年 279卷

作者： Dhinakaran, D. Kumar, N. Jagadish Ponnuviji, N. P. Kumar, B. Praveen Vel Tech Rangarajan Dr Sagunthala R&D Inst Sci & T Dept Comp Sci & Engn Chennai India SRM Inst Sci & Technol Dept Data Sci & Business Syst Chennai India RMK Coll Engn & Technol Dept Comp Sci & Engn Puduvoyal India GITAM Sch Technol Dept Comp Sci & Engn Bengaluru India

Healthcare is no exception to the requirement of cutting-edge solutions for healthcare data security and privacy: novel strategies need be formulated on a regular basis given contemporary threat in order to reliable shield over sensitive information. We therefore introduce in this paper a novel technique to increase the data security and privacy of cloud-based healthcare systems. We employ state-of-the-art encryption mechanisms such as Spectrasafe algorithm, Facile hash algorithm and Dynamic k-anonymity (DKA algorithm) to protect healthcare data at rest and during transit. Conducting a series of performance comparisons, using this high-quality data meticulously prepared from Kaggle to compare it with existing methods SMPC (Secure Multi-Party Computation), MSHC (Multi Server Homomorphic Encryption), AHC-ASS (Attribute-Hiding Cryptography with Attribute-Based Secret Sharing), MP-FHE(Multiparty Fully Homomorphic Encryption). Our encryption and decryption runtime are intensive computationally, with an average runtime of 99 ms and 108 ms, respectively. In terms of memory size our approach is 25 % smaller than existing state-of-the-art methods which indicates that it has a higher efficiency. Our method attains a detection accuracy of 95 %, which is also significant than results of previous methods. Moreover, the proposed method is shown to scale across a wide variety of healthcare datasets and updated requirements seen in modern healthcare systems. We intend to make a significant contribution towards secure and efficient healthcare data management in cloud environments, by extending the proposed privacy preservation mechanisms.

关键词： Data security Privacy Homomorphic Encryption Multi-Party Computation Cryptography hash algorithm

来源：评论

学校读者我要写书评

暂无评论

Illustration visual communication based on computer vision image retrieval algorithm

COMPUTER OPTICS

引用

COMPUTER OPTICS 2025年第1期49卷 132-140页

作者： Zhang, H. Z. Minnan Sci & Technol Coll Sch Art & Design Kangyuan Rd 8 Kangmei Town 362000 Quanzhou Peoples R China

In illustration design, good visual communication can make the audience resonate. Computer vision image retrieval algorithm provides important support and assistance for the visual communication of illustration. However, the traditional image retrieval algorithm has problems of subjectivity and inaccuracy in complex image classification. Therefore, this paper optimizes the feature extraction module of convolutional neural network and fuses hash algorithm to improve the efficiency and speed of image retrieval. The experimental results show that the accuracy of the improved convolutional neural network is 82.7 %, which is more than 6 percentage points higher than the traditional algorithm model. The recall rate of the volume neural network model improved by hashing algorithm is 94.1 %. Research is of great significance to the visual communication of illustration design, which helps designers to find relevant materials more accurately, improve the artistic quality and ornamental value of their works, and promote the innovation and development of illustration design.

关键词： visual communication image retrieval convolutional neural network hash algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：