Coding Algorithm Research Articles

Research on Enhanced Belief Propagation List Decoding Algorithm for Polar Codes in UAV Communications for 6G

The introduction of sixth-generation mobile communication technology (6G) poses new requirements for the capacity, rate, latency, and reliability of communication systems. As a vital component of 6G technology, unmanned aerial vehicle (UAV) communications also face various challenges, such as noise interference and limited hardware resources. To meet the high demands of 6G, advanced channel coding techniques need to be adopted. Polar codes, due to their theoretically achievable Shannon limit performance, have potential applications in UAV communication systems. Constructing reliable polar decoding schemes is currently a research hotspot in the field of communications. The Belief Propagation List (BPL) decoding algorithm for polar codes can effectively enhance the accuracy of polar code BP decoding. However, existing BPL decoding algorithms for polar codes face issues such as high hardware resource consumption and unsatisfactory decoding accuracy. Addressing the aforementioned issues, this paper proposes a BPL decoding algorithm for polar codes based on information geometry. An information geometry framework is constructed, where the soft information output by the BP decoder is treated as points on a statistical manifold, and their geometric properties are calculated. By introducing the concept of the soft information centroid and a path selection criterion based on the soft information centroid, combined with geometric distance as a weight, the decoding performance is improved, and hardware overhead is reduced. Simulation results show that under the conditions of a maximum of 60 iterations and 5 decoders, the proposed algorithm reduces the bit error rate by 16.2–74.9% compared to the classic BPL algorithm, providing strong technical support for the application of polar codes in scenarios such as UAV communications.

An interpretable algorithm unrolling network inspired by general convolutional sparse coding for intelligent fault diagnosis of machinery

When applied in Intelligent Fault Diagnosis (IFD) of machinery, most of generic deep learning models lack interpretability in architecture design. From a signal processing perspective, we unroll the Alternating Direction Method of Multipliers (ADMM), the iterative algorithm for a general convolutional sparse coding denoising problem, into a deep neural network called the General ADMM Network (GADMM-Net) using algorithm unrolling. GADMM-Net has an encoder-decoder architecture where the encoder extracts signal features (i.e., sparse coefficients) and the decoder reconstructs denoised signals. As the encoder-decoder architecture is derived from the denoising algorithm, GADMM-Net is interpretable in its backbone architecture and inherits the prior domain knowledge behind the signal denoising problem. Compared with conventional and state-of-the-art IFD models, GADMM-Net performs more excellently in diagnostic accuracy, number of parameters, training set size requirement, and noise robustness. In the IFD task across different operating conditions, GADMM-Net shows domain generalization capabilities, without using any transfer learning strategy.

Steganography Algorithms in Computed Tomography (CT) Scan Images

Steganography is a technique which allows to hide information or data inside a medium without giving an idea to people that the hidden data even existed. In the medical field, there are cases where patient’s medical images breached along with their sensitive and personal data because of poor security. This problem leads to a wanting of a good solution to have the medical image with secured patient data. Here is where the image steganography takes place to hide the patient data inside the medical images. This study is conducted to determine the effective image steganography algorithm to be used in the medical field to embed the patient information inside their medical images specifically in Computed Tomography (CT) scan images. The image steganography algorithms that will be used in this study are Least Significant Bit (LSB), Exploiting Modification Direction (EMD) and Discrete Wavelet Transform (DWT). The flow of the image steganography technique will be studied and analyzed and after that, the algorithms will be implemented with different file formats which are Portable Network Graphics (PNG), Bitmap (BMP) and Joint Photographic Experts Group (JPG) and different image sizes which are 1024x1024 and 2048x2048 pixels. After that, the results are evaluated with performance metrics which are Peak Signal-to-Noise Ratio (PSNR), Mean Squared Error (MSE), Structural Similarity Index Measure (SSIM) and Pairs Analysis. The results are then compared to determine the best image steganography algorithm along with the image file format which gives the highest robustness, visual quality, security and imperceptibility. The research result displays the EMD algorithm as the best paired with BMP file format in image steganography where it resulted in producing highest average of SSIM and PSNR which is 1.0 and 67.421 respectively and lowest MSE average of 0.012 with no traces in pairs analysis.

A Coverless Image Steganography Based on Huffman Encoding and Robust Image Wavelet Hashing

Data hiding approaches are crucial in insecure communication to protect sensi- tive information from illegal access. The robustness of existing coverless image steganogra- phy methods that utilize mapping rules is derived from their ability to extract feature patterns within the spatial domain. In order to protect sensitive data more securely and to increase its durability against attacks, a new coverless steganography is introduced in this study. The me- thod used is based on the frequency domain. A coverless image steganography based on ro- bust image wavelet hashing and Huffman encoding. Initially, the confidential data is encoded through lossless compression using Huffman Encoding, which reduces the payload and en- hances the capacity for embedding. Second, segments of an 8-bit size are created from the compressed secret data. The efficient DWT hashing technique has been employed to generate a hash sequence for an image. An inverted index structure is established, allowing for the se- lection of the image whose hash corresponds to the secret data segment. Subsequently, all chosen images along with supplementary information are transmitted to the recipient. Testing has shown that the proposed method is robust against various image processing attacks, in- cluding scaling, low pass filtering, JPEG compression, rotation, noise introduction, and me- dian/mean filtering. Research findings and analysis indicate that this method enhances the latest coverless steganography algorithms in terms of capacity, resilience, and security.

Case Ascertainment in Pediatric Heart Failure Using International Classification of Disease Clinical Modification (ICD-CM) Codes.

Most epidemiological studies in pediatric heart failure (HF) use administrative database sources, defining patient cohorts by presence of a single HF ICD code. However, the ability of ICD codes to identify true HF patients is unknown in pediatrics.Here we describe the accuracy of HF ICD-10-CM code search algorithms, in identifying pediatric patients with HF from electronic data sources. Based on the adult HF literature, search algorithms were designed to incorporate HF ICD codes, imaging, and medications. Sensitivity, specificity, positive and negative predictive value and accuracy of the algorithms were tested among children in an advanced HF clinic ("Clinic cohort"). Top-performing algorithms were then tested in a large-scale regional electronic data warehouse (EDW), 01/2017 to 01/2020, generating the "EDW Cohort". False positive cases were identified and characterized by chart review. Within the Clinic Cohort, 78/378 patients (21%) had gold standard HF diagnoses. A search algorithm with one HF ICD coded visit was more sensitive but less specific than > 1 HF ICD coded visit, (sensitivity 94% and specificity 89% versus 69% and 97%, respectively). Correspondingly, > 1 ICD coded visit had a higher PPV than one ICD coded visit; 84% vs. 69%. Accuracy was similar (90% vs 91%). Presence of 1 HF ICD code combined with HF medication had high sensitivity, specificity, PPV, NPV and accuracy, all higher than the single ICD code algorithm. The "1 HF coded visit + any medication" algorithm resulted in highest accuracy (93%). Top-performing algorithms were tested in the EDW: the algorithm with > 1 HF ICD coded visit, and the algorithm with one HF ICD coded visit combined with HF medication. In the EDW Cohort, 133/248 (53.6%) patients had gold standard HF diagnoses though 115/248 (46.3%) were false positive cases; 41% of those had pulmonary over-circulation from congenital heart disease. Excluding children < 30days old and those with a history of an isolated VSD repair, complete AVSD repair, or PDA closure further reduced the proportion of false positives to 50/248 (20%). A search algorithm using a single HF ICD code can have acceptable sensitivity, specificity, PPV, NPV and accuracy in identifying children with HF from within electronic medical records. Similar to adult HF literature, specificity improves by including HF medication. When applied to large data sources, however, the search algorithms result in a high proportion of patients with pulmonary overcirculation related to congenital heart disease. To narrow the population to those with myocardial dysfunction, case identification may require use of ICD codes with linked of administrative, surgical, and/or imaging databases.

Optimizing Microservice Deployment in Edge Computing with Large Language Models: Integrating Retrieval Augmented Generation and Chain of Thought Techniques

Large Language Models (LLMs) have demonstrated impressive capabilities in autogenerating code based on natural language instructions provided by humans. We observed that in the microservice models of edge computing, the problem of deployment latency optimization can be transformed into an NP-hard mathematical optimization problem. However, in the real world, deployment strategies at the edge often require immediate updates, while human-engineered code tends to be lagging. To bridge this gap, we innovatively integrated LLMs into the decision-making process for microservice deployment. Initially, we constructed a private Retrieval Augmented Generation (RAG) database containing prior knowledge. Subsequently, we employed meticulously designed step-by-step inductive instructions and used the chain of thought (CoT) technique to enable the LLM to learn, reason, reflect, and regenerate. We decomposed the microservice deployment latency optimization problem into a collection of granular sub-problems (described in natural language), progressively providing instructions to the fine-tuned LLM to generate corresponding code blocks. The generated code blocks underwent integration and consistency assessment. Additionally, we prompted the LLM to generate code without the use of the RAG database for comparative analysis. We executed the aforementioned code and comparison algorithm under identical operational environments and simulation parameters, conducting rigorous result analysis. Our fine-tuned model significantly reduced latencies by 22.8% in handling surges in request flows, 37.8% in managing complex microservice types, and 39.5% in processing increased network nodes compared to traditional algorithms. Moreover, our approach demonstrated marked improvements in latency performance over LLMs not utilizing RAG technology and reinforcement learning algorithms reported in other literature. The use of LLMs also highlights the concept of symmetry, as the symmetrical structure of input-output relationships in microservice deployment models aligns with the LLM’s inherent ability to process and generate balanced and optimized code. Symmetry in this context allows for more efficient resource allocation and reduces redundant operations, further enhancing the model’s effectiveness. We believe that LLMs hold substantial potential in optimizing microservice deployment models.

A method to enhance privacy preservation in cloud storage through a three-layer scheme for computational intelligence in fog computing

Recent advancements in cloud computing have heightened concerns about data control and privacy due to vulnerabilities in traditional encryption methods, which may not withstand internal attacks from cloud servers. To overcome these issues about the data privacy and control of transfer on cloud, a novel three-tier storage model incorporating fog computing method has been proposed. This framework leverages the advantages of cloud storage while enhancing data privacy. The approach uses the Hash-Solomon code algorithm to partition data into distinct segments, distributing a portion of it across local machines and fog servers, in addition to cloud storage. This distribution not only increases data privacy but also optimises storage efficiency. Computational intelligence plays a crucial role by calculating the optimal data distribution across cloud, fog, and local servers, ensuring balanced and secure data storage.•Experimental analysis of this mathematical mode has demonstrated a significant improvement in storage efficiency, with increases ranging from 30 % to 40 % as the volume of data blocks grows.•This innovative framework based on Hash Solomon code method effectively addresses privacy concerns while maintaining the benefits of cloud computing, offering a robust solution for secure and efficient data management.

An Image Steganalysis Algorithm Based on Multi-Resolution Feature Fusion

The misuse of image steganography poses significant risks to societal security. Whether images include concealed data is a critical problem of information security. Traditional convolutional layers often fail to adequately capture the global correlation of steganographic features as network depth increases, leading to redundant model parameters and missing key features, thereby weakening steganographic signal detection. To solve the problems of highly covert steganographic algorithms and the weakness of traditional methods, a steganography detection solution using multi-resolution feature fusion is presented. This approach uses a multi-resolution network to increase the interactivity from higher to lower resolution. The results of the experiments confirm that the proposed algorithm allows for a maximum accuracy of 90.56% for the embedding rate of 0.4bpp. The overall results prove that the proposed model achieves higher accuracy and better performance than some leading steganalysis models available when applied to different steganographic algorithms and embedding rate conditions.

A Validated Algorithm to Identify Hepatic Decompensation in the Veterans Health Administration Electronic Health Record System.

Accurate identification of hepatic decompensation is essential for pharmacoepidemiologic research among patients with chronic liver disease. An algorithm using ≥ 1 inpatient or ≥ 2 outpatient International Classification of Diseases, 10th revision (ICD-10) codes for hepatic decompensation was developed in Veterans Health Administration data from October 2015 through July 2019. Medical records were reviewed by hepatologists to confirm cases. The positive predictive value (PPV) of the coding algorithm for confirmed hepatic decompensation was calculated. Hepatic decompensation was confirmed in 149/185 records meeting the algorithm (PPV 81%; 95% CI, 70%, 90%). The most common hepatic decompensation diagnosis was ascites. Only 56% of confirmed cases had an accompanying diagnosis code for cirrhosis. Our ICD-10-based coding algorithm identified hepatic decompensation with high PPV in Veterans Health Administration data.

An one-time pad cryptographic algorithm with Huffman Source Coding based energy aware sensor node design

Recently, the security-based algorithms for energy-constrained sensor nodes are being developed to consume less energy for computation as well as communication. For the mission critical wireless sensor network (WSN) applications, continuous and secure data collection from WSN nodes is an essential task on the deployed field. Therefore, in this manuscript, One-Time Pad Cryptographic Algorithm with Huffman Source Coding Based Energy Aware sensor node Design is proposed (EA-SND-OTPCA-HSC). Before transmission, the distance among transmitter and receiver is rated available in mission critical WSN for lessen communication energy consume of sensor node. For the mission critical WSN applications, continuous and secure data collection from WSN nodes is an essential task on the deployed field. The periodic sleep/wake up scheme with Huffman source coding algorithm is used to save energy at the node level. Then, one-time pad cryptographic algorithm in each sensor node, the vernam cipher encryption technique is applied to the compact payload. The proposed technique is executed and efficacy of proposed method is assessed using Payload Vs Energy consume for one sensor node, communication energy consume for one sensor node with different distances, energy consume for one sensor node under various methods, Throughput, delay and Jitter are analyzed. Then the proposed method provides 90.12 %, 89.78 % and 91.78 % lower delay and 88.25 %, 95.34 % and 94.12 % lesser energy consumption comparing to the existing EA-SND-Hyb-MG-CUF, EA-SND-PVEH and EA-SND-PIA techniques respectively.

Quantum search algorithm for binary constant weight codes

A binary constant weight code is a type of error-correcting code with a wide range of applications. The problem of finding a binary constant weight code has long been studied as a combinatorial optimization problem in coding theory. In this paper, we propose a quantum search algorithm for binary constant weight codes. Specifically, the search problem is formulated as a polynomial binary optimization problem and Grover adaptive search is used for providing the quadratic speedup. Focusing on the inherent structure of the problem, we derive an upper bound on the minimum of the objective function value and a lower bound on the exact number of solutions. By exploiting these two bounds, we successfully reduced the constant overhead of the algorithm, although the overall query complexity remains exponential due to the NP-complete nature of the problem. In our algebraic analysis, it was found that this proposed algorithm is capable of reducing the number of required qubits, thus enhancing the feasibility. Additionally, our simulations demonstrated that it reduces the average number of classical iterations by 63% as well as the average number of total Grover rotations by 31%. The proposed approach may be useful for other quantum search algorithms and optimization problems.

Case Ascertainment in Pediatric Heart Failure Using International Classification of Disease Clinical Modification (ICD-CM) Codes.

Most epidemiological studies in pediatric heart failure (HF) use administrative database sources, defining patient cohorts by presence of a single HF ICD code. However, the ability of ICD codes to identify true HF patients is unknown in pediatrics. Here we describe the accuracy of HF ICD-10-CM code search algorithms, in identifying pediatric patients with HF from electronic data sources. Based on the adult HF literature, search algorithms were designed to incorporate HF ICD codes, imaging, and medications. Sensitivity, specificity, positive and negative predictive value and accuracy of the algorithms were tested among children in an advanced HF clinic ("Clinic cohort"). Top-performing algorithms were then tested in a large-scale regional electronic data warehouse (EDW), 01/2017 to 01/2020, generating the "EDW Cohort". False positive cases were identified and characterized by chart review. Within the Clinic Cohort, 78/378 patients (21%) had gold standard HF diagnoses. A search algorithm with one HF ICD coded visit was more sensitive but less specific than >1 HF ICD coded visit, (sensitivity 94% and specificity 89% versus 69% and 97%, respectively). Correspondingly, >1 ICD coded visit had a higher PPV than one ICD coded visit; 84% vs. 69%. Accuracy was similar (90% vs 91%). Presence of 1 HF ICD code combined with HF medication had high sensitivity, specificity, PPV, NPV and accuracy, all higher than the single ICD code algorithm. The "1 HF coded visit + any medication" algorithm resulted in highest accuracy (93%). Top-performing algorithms were tested in the EDW: the algorithm with > 1 HF ICD coded visit, and the algorithm with one HF ICD coded visit combined with HF medication. In the EDW Cohort, 133/248 (53.6%) patients had gold standard HF diagnoses though 115/248 (46.3%) were false positive cases; 41% of those had pulmonary over-circulation from congenital heart disease. Excluding children < 30 days old and those with a history of an isolated VSD repair, complete AVSD repair, or PDA closure further reduced the proportion of false positives to 50/248 (20%). A search algorithm using a single HF ICD code can have acceptable sensitivity, specificity, PPV, NPV and accuracy in identifying children with HF from within electronic medical records. Similar to adult HF literature, specificity improves by including HF medication. When applied to large data sources, however, the search algorithms result in a high proportion of patients with pulmonary overcirculation related to congenital heart disease. To narrow the population to those with myocardial dysfunction, case identification may require use of ICD codes with linked of administrative, surgical, and/or imaging databases.

A model-based deep learning approach to interpretable impact force localization and reconstruction

Model-based and deep learning-based methods have been widely studied for force identification. However, model-based methods usually have high computational complexity and face challenges in parameter setting, while the generic network structures in deep learning methods are mostly designed empirically. In this paper, a model-based deep learning network is proposed to simultaneously localize and reconstruct impact f[orces. The proposed network, dubbed NSC-Net, is obtained by unrolling the iterative shrinkage-thresholding algorithm (ISTA) for the non-negative sparse coding (NSC) model. NSC-Net combines the interpretability of the model-based ISTA with the powerful parameter learning capability of deep learning. The transfer matrix is embedded into the network as physical information through learnable scaling. The structure of NSC-Net is based on explicit theoretical analysis, which enhances its interpretability in terms of structural design. In contrast to ISTA, the parameters in NSC-Net can be trained end-to-end from the training data without manual setting. Simulations and experiments on composite panels are conducted to validate the performance of the proposed method. The results demonstrate that NSC-Net accurately localizes and reconstructs impact forces, outperforming both ISTA and learned iterative shrinkage-thresholding algorithm (LISTA) network. Additionally, NSC-Net exhibits excellent noise immunity. Furthermore, the systematic approach of constructing an algorithm unrolling network for impact force identification is summarized, aiming to facilitate further related research.

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees

Validating claims-based algorithms for a systemic lupus erythematosus diagnosis in Medicare data for informed use of the Lupus Index: a tool for geospatial research

ObjectiveThis study aimed to validate claims-based algorithms for identifying SLE and lupus nephritis (LN) in Medicare data, enhancing the use of the Lupus Index for geospatial research on SLE prevalence...

Stegocrypt: A robust tri‐stage spatial steganography algorithm using TLM encryption and DNA coding for securing digital images

AbstractThis research work presents a novel secured spatial steganography algorithm consisting of three stages. In the first stage, a secret message is divided into three parts, each is encrypted using a tan logistic map encryption key with a unique seed value. In the second stage, the encrypted parts are transformed into quick response codes, serving as a layer of channel coding. Subsequently, the quick response codes are decoded back into bit‐streams. To enhance security, a uniquely‐seeded Mersenne Twister key is generated and employed to apply DNA coding onto each bit‐stream. The resulting bit‐streams are then embedded in the least significant bits of the RGB channels of a cover image. Finally, the RGB channels are merged to form a single stego image. A comprehensive set of experimental analyses is conducted to evaluate the performance of the proposed secure steganography algorithm. The experimental results demonstrate the algorithm's robustness against various attacks and its ability to achieve high embedding capacity while maintaining imperceptibility. The proposed algorithm offers a promising solution for secure information hiding in the spatial domain, with potential applications in areas such as data transmission, digital forensics, and covert communication.

Improvement of Lossless Text Compression Methods using a Hybrid Method by the Integration of RLE, LZW and Huffman Coding Algorithms

In the field of computer science, data compression is essential in the process of data transfer because it reduces file size without losing information. Issues that depend on the characteristics of the text can greatly affect the effectiveness of any compression algorithm. Consequently, each traditional compression algorithm has its own strengths and limitations. Therefore, a highly efficient compression method that achieves higher compression ratio is needed. In this paper, based on the sequential implementation of Huffman, RLE and LZW algorithms, a hybrid data compression method has been proposed. The algorithms have been individually evaluated and compared in terms of compression ratio and compressed file size. We conclude that in terms of compression ratio and compressed file size, LZW is better than Huffman and RLE. The results show that the proposed hybrid algorithm achieves the highest average compression ratio is 2.42 and the lowest average compressed file size is 1138.5 or less compared to the individual implementations of the algorithms. Thus, it can be concluded that the proposed hybrid method enhances lossless text compression in terms of compression ratio and file size according to compression metrics.

Robust Reversible Watermarking Scheme in Video Compression Domain Based on Multi-Layer Embedding

Most of the existing research on video watermarking schemes focus on improving the robustness of watermarking. However, in application scenarios such as judicial forensics and telemedicine, the distortion caused by watermark embedding on the original video is unacceptable. To solve this problem, this paper proposes a robust reversible watermarking (RRW)scheme based on multi-layer embedding in the video compression domain. Firstly, the watermarking data are divided into several sub-secrets by using Shamir’s (t, n)-threshold secret sharing. After that, the chroma sub-block with more complex texture information is filtered out in the I-frame of each group of pictures (GOP), and the sub-secret is embedded in that frame by modifying the discrete cosine transform (DCT) coefficients within the sub-block. Finally, the auxiliary information required to recover the coefficients is embedded into the motion vector of the P-frame of each GOP by a reversible steganography algorithm. In the absence of an attack, the receiver can recover the DCT coefficients by extracting the auxiliary information in the vectors, ultimately recovering the video correctly. The watermarking scheme demonstrates strong robustness even when it suffers from malicious attacks such as recompression attacks and requantization attacks. The experimental results demonstrate that the watermarking scheme proposed in this paper exhibits reversibility and high visual quality. Moreover, the scheme surpasses other comparable methods in the robustness test session.

An Algorithm for Coding an Additive Manufacturing File from the Pressure Distribution of a Baropodometric Board for 3D Printing Customised Orthopaedic Insoles

Customised orthotic insoles play a critical role in addressing foot pathologies and improving comfort and biomechanical alignment for patients with specific needs. The use of 3D printing technology for the manufacturing of orthotic insoles has received considerable attention in recent years due to its potential for customisation, rapid prototyping, and cost-effectiveness. This paper presents the implementation of an algorithm purposely developed to generate an Additive Manufacturing File (AMF) containing the geometry of a patient-specific insole and the stiffness distribution based on pressure analysis from a baropodometric board. The generated file is used to 3D print via Fused Deposition Modelling an insole with a variable infill percentage depending on the pressure distribution on the patient’s foot. Three inputs are used as source data for the AMF file coding: (i) the 3D model that defines the geometry of the insole designed by the orthopaedist; (ii) the pressure map of the patient’s feet obtained with a baropodometric board; and (iii) the stiffness of the material that will be used to fabricate the insole. The proposed approach allows the fabrication of a patient-specific insole, capable of restoring the correct pressure distribution on the foot by varying the infill percentage. Two types of insoles were successfully fabricated using the implemented algorithm: the first was 3D printed, adding a top layer to be ready-to-use; the second was 3D printed without a top surface to be further customised with different coatings. The method described in this paper is robust for the fabrication of customised insoles and aims at overcoming the limitations of the traditional approach based on milling machining (e.g., time, costs, and path planning) since it can be easily integrated into any orthopaedic workshop.

A novel theoretical analysis on optimal pipeline of multi-frame image super-resolution using sparse coding

Super-resolution is the process of obtaining a high-resolution (HR) image from one or more low-resolution (LR) images. Single image super-resolution (SISR) deals with one LR image while multi-frame super-resolution (MFSR) employs several LR ones to reach the HR output. MFSR pipeline consists of alignment, fusion, and reconstruction. We conduct a theoretical analysis using sparse coding (SC) and iterative shrinkage-thresholding algorithm to fill the gap of mathematical justification in the execution order of the optimal MFSR pipeline. Our analysis recommends executing alignment and fusion before the reconstruction stage (whether through deconvolution or SISR techniques). The suggested order ensures enhanced performance in terms of peak signal-to-noise ratio and structural similarity index. The optimal pipeline also reduces computational complexity compared to intuitive approaches that apply SISR to each input LR image. Also, we demonstrate the usefulness of SC in analysis of computer vision tasks such as MFSR, leveraging the sparsity assumption in natural images. Simulation results support the findings of our theoretical analysis, both quantitatively and qualitatively.