Redundancy Elimination Research Articles

Fusion Model of Quantum Wavelet Transform and Neural Network for Video Coding on the Internet of Things Environment

Solving the video compression problem requires a multi-faceted approach, balancing quality, efficiency, and computational demands. By leveraging advancements in technology and adapting to the evolving needs of video applications, it is possible to develop compression methods that meet the challenges of the present and future digital landscape. To address these objectives, machine learning and AI approaches can be utilized to predict and remove redundancies more effectively, optimizing compression algorithms dynamically based on content. Still, state-of-the art neural network-based video compression models need large and diverse datasets to generalize well across different types of video content. Wavelets can provide both time (spatial) and frequency localization, making them highly effective for video compression. This dual localization allows wavelet transforms to handle both rapid changes in video content and slow-moving scenes efficiently, leading to better compression ratios. Yet, some wavelet coefficients may be more critical for maintaining visual quality than others. Inaccurate quantization can lead to noticeable degradation. For the first time, the suggested model combine Quantum Wavelet Transform (QWT) and Neural Networks (NN) for video compression. This fusion model aims to achieve higher compression ratios, maintain video quality, and reduce computational complexity by utilizing QWT’s efficient data representation and NN’s powerful pattern recognition and predictive capabilities. Quantum bits (qubits) can encode large amounts of information in their quantum states, enabling more efficient data representation. This is especially useful for encoding large video files. Furthermore, quantum entanglement allows for correlated data representation across qubits, which can be exploited to capture intricate details and redundancies in video data more effectively than classical methods. The experimental results reveal that QWT achieves a compression ratio of almost twice that of traditional WT for the same video, maintaining superior visual quality due to more efficient redundancy elimination.

Identification of Duplicates in Mulberry Germplasm Using Morphological Descriptors and SSR Markers

Germplasm collections invariably contain duplicate accessions, both within and between genebanks. These redundancies are a burden for curators because they do not contribute to the diversity in the collection, but do require genebank budget for maintenance. Thus, both from a genetic and economic point of view, identification and elimination of redundancies should be an important genebank objective. In field gene banks, duplicate accessions are widespread and their identification is required to facilitate germplasm administration and lower the maintenance costs. The goal of this study was to identify the duplicates in mulberry germplasm that has been morphologically and agronomically evaluated. Until now the identification of duplicate accessions had to rely on comparison of morphological characters which are subject to environmental variation. However, it is possible to make routine use of molecular markers based on genomic DNA for the identification of duplicate accessions of vegetatively propagated species. In the present study, among the mulberry germplasm 312 accessions were characterized using 17 qualitative morphological descriptors and identifiied 84 suspected duplicates using multivariate cluster analysis. Further, the suspected duplicates were screened using 12 SSR markers and scored the polymorphic alleles using binary format. The data matrix was subjected to multivariate cluster analysis and 14 mulberry accessions were confirmed as true duplicates. The identification of redundant accessions enables curators to concentrate their efforts on the characterization, evaluation, and regeneration of distinct genetic material. The molecular markers aids in giving priorities for the evaluation and regeneration of unique genetic materials in field genebank.

Enabling Efficient Deep Learning on MCU With Transient Redundancy Elimination

Enabling Efficient Deep Learning on MCU With Transient Redundancy Elimination

RT-GNN: Accelerating Sparse Graph Neural Networks by Tensor-CUDA Kernel Fusion

Graph Neural Networks (GNNs) have achieved remarkable successes in various graph-based learning tasks, thanks to their ability to leverage advanced GPUs. However, GNNs currently face challenges arising from the concurrent use of advanced Tensor Cores (TCs) and CUDA Cores (CDs) in GPUs. These challenges are further exacerbated due to repeated, inefficient, and redundant aggregations in GNN that result from the high sparsity and irregular non-zero distribution of real-world graphs. We propose RT-GNN, a GNN framework based on the fusion of advanced TC and CD units, to eliminate the aforementioned redundancies by exploiting the properties of an adjacency matrix. First, a novel GNN representation technique, hierarchical embedding graph (HEG) is proposed to manage the intermediate aggregation results hierarchically, which can further avoid redundancy in intermediate aggregations elegantly. Next, to address the inherent sparsity of graphs, RT-GNN places the blocks (a.k.a tiles) in HEG onto TCs and CDs according to their sparsity by a new block-based row-wise multiplication approach, which assembles TCs and CDs to work concurrently. Experimental results demonstrate that HEG outperforms HAG by an average speedup of 19.3 × for redundancy elimination performance, especially up to 72 × speedup on the dataset of ARXIV. Moreover, for overall performance, RT-GNN outperforms state-of-the-art GNN frameworks (including DGL, HAG, GNNAdvisor, and TC-GNN) by an average factor of 3.1 × while maintaining or even improving the task accuracy.

Radiomics Features from Positron Emission Tomography with [18F] Fluorodeoxyglucose Can Help Predict Cervical Nodal Status in Patients with Head and Neck Cancer.

Background: Detecting pathological lymph nodes (LNs) is crucial for establishing the proper clinical approach in patients with head and neck cancer (HNC). Positron emission tomography with [18F] fluorodeoxyglucose (FDG PET) has high diagnostic value, although it can yield false positives since FDG-avid LNs can also occur from non-cancerous diseases. Objectives: To explore if radiomics features from FDG PET can enhance the identification of pathological lymph nodes in head and neck cancer. Materials and methods: This study was carried out on n=51 cervical lymph nodes (26 negative, 25 positive) from a cohort of n=27 subjects, and the standard of reference was fine needle aspiration cytology or excisional biopsy. An initial set of 54 IBSI-compliant radiomics features, which was subsequently reduced to 31 after redundancy elimination, was considered for the analysis. Mann-Whitney U tests were performed to compare each feature between positive and negative LNs. Classification models based on two sets of features, PETBase (SUVmax, MTV and TLG) and PETRad (radiomics features), respectively, were trained using logistic regression, support vector machines and Gaussian naïve Bayes, and their performance was compared. Accuracy was estimated via leave-one-out cross-validation. Results: We identified via univariate analysis 21 features that were statistically different between positive and negative LNs. In particular, dispersion features indicated that positive LNs had higher uptake non-uniformity than the negative ones. AUC, sensitivity, specificity and accuracy obtained with logistic regression were, respectively, 0.840, 68.0%, 89.5% and 80.4% for PETBase and 0.880, 72.0%, 90.0% and 82.4% for PETRad. The other classification models showed the same trend. Conclusions: Radiomics features from FDG PET can improve the diagnostic accuracy of LN status in HNC.

MG+: Towards Efficient Context Inconsistency Detection by Minimized Link Generation

ABSTRACTSelf‐adaptive applications are becoming increasingly attractive, with the ability to smartly understand their runtime environments (or contexts) and deliver adaptive services, for example, location‐aware navigation or resource‐sensitive suggestions. However, due to inherent noises in the process of sensing and interpreting environmental information, there is a growing demand for guarding the consistency of collected contexts to avoid application misbehaviour and, at the same time, minimize extra costs. Existing work attempted to achieve this by speeding up the kernel constraint checking module inside the consistency guarding process. Most of these efforts were spent on reusing previous checking results or parallelizing the checking process, but they all leave one central step of constraint checking, that is, link generation, untouched. In this step, the checking engine provides reasons to explain the violation of constraints under check. It occupies a substantial part of the total time cost. Focusing on this key link generation step, we proposed MG, which deploys a rigourous analysis to automatically identify and avoid redundancy in the link generation without harming any correctness of the checking results. MG has been proven sound (always guaranteeing correctness) and complete (entirely removing redundancy). Moreover, based on our observation that MG's redundancy elimination also assists another core step of constraint checking to reduce unnecessary computation further, we additionally enhance MG with an escape‐condition optimization to escape unnecessary evaluation of truth values to further improve the efficiency of constraint checking in an aspect other than link generation. We call it MG+ for distinguishing. Our experiments with synthesized and real‐world consistency constraints reported that, compared with existing work, MG eliminates all link redundancy (83% to 0%), and based on it, MG+ further reduces significant truth value calculations (e.g., 49.74% reduction when combined with ECC and Con‐C). Generally, MG brought 14–500 speed‐ups in link generation, and MG+ further made 1.2–1.9 speed‐ups in truth value evaluation. Altogether, MG reduced the total constraint checking time up to 45.4%, and MG+ reduced it up to 61.0%.

Translating Four-Character Structures in Chinese Literary Works on Traditional Architecture—A Case Analysis of Canal Towns South of the Yangtze and Folk Houses South of the Yangtze

Traditional Chinese architecture boasts a unique style and profound cultural connotations. Accordingly, the related literary works attain value for international dissemination. The four-character structures in these works serve as concise expressions for describing architectural details and design concepts. However, due to their linguistic implicitness, grammatical structure diversity, and rich cultural images, their translation into English requires multidimensional shift, redundancy elimination, and the avoidance of cultural defaults. This research has developed an effective translation workflow that leverages the synergistic strengths of Large Language Models (LLMs) and the human translator. By strategically employing tailored methods and techniques, it addresses the challenges in the translation process. Analysis suggests: It is recommended that the technique of shift be employed to address the implicit content and complex grammatical structures in translating four-character structures in Chinese literary works on traditional architecture into English. Besides, the selective application of combination and omission can help deal with information redundancy. Furthermore, it is advisable to apply foreignization and a combined method of literal translation and paraphrasing in conveying cultural images. These approaches will, to a certain extent, convert the untranslatability of four-character structures into translatability, enhancing the dissemination of the essence of traditional Chinese architecture.

К ассоциативной типологии в контексте изучения языка как достояния человека

The article discusses a number of fundamental for the development of associative typology propositions connected with systemogenesis of language as a human species- specific phenomenon. Using the example of the psychological meanings of lexical units that make up the ethnopolitically marked paradigm of the “national”, the author reflects on the patterns in the functioning of a living language, which are revealed on associative- verbal models of the Russian Language Personality (RLP) and can serve as the basis for the development of an associative typology of language. The article considers the problem of ontology and functional motivation of associative (active) grammar (as an inherent property of a linguistic personality) on a semantic basis. The hypothesis of associative grammar as a factor contributing to the integrative formation of meaningful units in the course of their being recruited for the inclusion into the speech flow through elimination of redundancy is proposed for consideration. It is stated that different functionally specific types of techniques aimed at elimination of redundancy and discovered via experiment can be considered as a subject for analysis in associative typology in the light of whole-systemic comparative analyses of network models of an average (national) linguistic personality. They can be described in terms of associative dominants (accentuations of a linguistic personality) and statistically formalized using vector models represented as psychoglosses and /or chronoglosses (in current diachrony).

PEO-Store: Delegation-Proof Based Oblivious Storage With Secure Redundancy Elimination

PEO-Store: Delegation-Proof Based Oblivious Storage With Secure Redundancy Elimination

GSAAN with War Strategy Optimization Algorithm for Cyber Security in a 5G Wireless Communication Network

In this paper, the graph sample and aggregate-attention network with war strategy optimization algorithm for cyber security in the 5G wireless communication network (CS-5GWCN-GSAAN-WSOA) is proposed in 5G mobile networks to identify cyber threats. Initially, the input data are amassed from the 5G-NIDD dataset. Then the input data are fed to preprocessing, here redundancy elimination and missing value replacement are performed utilizing the contrast limited adaptive histogram equalization filtering (CLAHEF) method. After preprocessing, optimal features are selected by the stochastic gradient boosting based recursive feature elimination process. The selected features are fed to the graph sample and aggregate-attention network (GSAAN) to detect cyber-attacks in 5G wireless communication. Generally, the GSAAN approach does not adopt any optimization techniques for determining optimal parameters and guaranteeing accurate attack detection. Therefore, the war strategy optimization algorithm (WSOA) contemplates to optimize the GSAAN weight parameters. The CS-5GWCN-GSAAN-WSOA method is activated on Python. The CS-5GWCN-GSAAN-WSOA method attains 22.51%, 20.35%, and 35.54% higher accuracy, 19.45%, 27.80%, and 18.93% higher sensitivity analysed with existing models, like cyber security attack identification in 5G wireless systems utilizing machine learning (CS-5GWCN-SVM), enhanced dropping attacks detection in 5G networks depending on deep learning models (CS-5GWCN-KNN), and cyber security issues in 5G enabled attack detection through deep learning (CS-5GWCN-RNN), respectively.

UKRAINIAN PHD STUDENTS' ATTITUDES TOWARD AI LANGUAGE PROCESSING TOOLS IN THE CONTEXT OF ENGLISH FOR ACADEMIC PURPOSES

Mastering academic writing skills in English is essential for future researchers. At present, AI language processing tools provide high-quality, accessible, and fast assistance for translation, editing, and stylistic enhancement of scientific texts. However, their use within English for Academic Purposes (EAP) courses generates mixed reactions among educators and raises ethical concerns. Our study aimed to explore the predominant perceptions of AI language processing tools by PhD students of the National Academy of Sciences of Ukraine (NASU) from the viewpoint of their integration into the academic English course taught in the first year of their PhD studies. The study involved 52 PhD students from various NASU institutes. They completed a survey with both closed-ended and open-ended questions regarding their previous and expected use of online translators, writing enhancement tools, and ChatGPT for research writing purposes. The results of the survey show that NASU PhD students have extensive experience with online translators, but are less familiar with writing enhancement tools and less certain about their potential use in the future. Almost a third of the respondents expressed reservations about using ChatGPT for academic writing due to academic integrity concerns. Most of the respondents (66%) agree that the basics of ethical use of AI writing and editing tools should be incorporated into EAP courses. One subgroup of the participants (n = 11) took part in a small-scale additional intervention focused on writing enhancement tools. They were asked to apply Grammarly, QuillBot, and ChatGPT to edit their course projects (presentations of the current state of their dissertation research) and compare these tools according to various criteria. The feedback provided by this subgroup indicates that they were most satisfied with the quality of editing provided by ChatGPT but found Grammarly and QuillBot easier to use and more suitable for superficial grammar checks. We found out that the AI tools helped participants achieve improvements primarily in such aspects as the use of articles, punctuation, use of prepositions, and elimination of redundancy. The study has significant pedagogical implications, promoting the wider use of AI tools in the context of teaching English for Academic Purposes and addressing appropriate teaching techniques and methods.

Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem

A basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains. The SCP’s goal is to determine the smallest number of subsets, or sets, needed to cover every element precisely once given a finite set of items and a collection of subsets of these elements. Numerous practical uses for the SCP exist, such as crew scheduling, truck routing, and facility locating. This paper focuses on obtaining feasible solutions, applying to the obtained solutions constructive heuristics (CH), followed by a redundancy elimination procedure to remove unnecessary sets. To further optimize the quality of the solution, a local search method is also implemented based on the First and Best improvement algorithms. Additionally, the Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Search (VNS) metaheuristics are designed and implemented. Each implemented heuristic underwent testing across 42 instances, with the average deviation from the optimal solution calculated for each instance. The GRASP heuristic demonstrated the most favorable performance, achieving a maximum deviation of 2.26% from the optimal solution, while the VNS approach yielded a maximum deviation of 11.46% from the optimal solution at its best.

Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem

A basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains. The SCP’s goal is to determine the smallest number of subsets, or sets, needed to cover every element precisely once given a finite set of items and a collection of subsets of these elements. Numerous practical uses for the SCP exist, such as crew scheduling, truck routing, and facility locating. This paper focuses on obtaining feasible solutions, applying to the obtained solutions constructive heuristics (CH), followed by a redundancy elimination procedure to remove unnecessary sets. To further optimize the quality of the solution, a local search method is also implemented based on the First and Best improvement algorithms. Additionally, the Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Search (VNS) metaheuristics are designed and implemented. Each implemented heuristic underwent testing across 42 instances, with the average deviation from the optimal solution calculated for each instance. The GRASP heuristic demonstrated the most favorable performance, achieving a maximum deviation of 2.26% from the optimal solution, while the VNS approach yielded a maximum deviation of 11.46% from the optimal solution at its best.

A prospective study of the proteome of equine pre-implantation embryo.

The present study was conducted to investigate the global proteome of 8-day-old equine blastocysts. Follicular dynamics of eight adult mares were monitored by ultrasonography and inseminated 24 h after the detection of a preovulatory follicle. Four expanded blastocysts were recovered, pooled, and subjected to protein extraction and mass spectrometry. Protein identification was conducted based on four database searches (PEAKS, Proteome Discoverer software, SearchGUI software, and PepExplorer). Enrichment analysis was performed using g:Profiler, Panther, and String platforms. After the elimination of identification redundancies among search tools (at three levels, based on identifiers, peptides, and cross-database mapping), 1977 proteins were reliably identified in the samples of equine embryos. Proteomic analysis unveiled robust metabolic activity in the 8-day equine embryo, highlighted by an abundance of proteins engaged in key metabolic pathways like the TCA cycle, ATP biosynthesis, and glycolysis. The prevalence of chaperones among highly abundant proteins suggests that regulation of protein folding, and degradation is a key process during embryo development. These findings pave the way for developing new strategies to improve equine embryo media and optimize invitro fertilization techniques.

The role of link redundancy and structural heterogeneity in network disintegration

While link redundancy has long been acknowledged as a critical factor in network robustness, current approaches frequently neglect the inherent heterogeneity of structure, thereby falling short of optimal network disintegration. This study introduces the novel Neighborhood Dissimilarity Community Heterogeneity (NDCH) framework, which systematically investigates redundancy elimination from a new perspective of neighborhood dissimilarity, while concurrently integrating structural heterogeneity derived from community structure. Extensive experiments on both synthetic and diverse real-world networks reveal that strategies developed under NDCH framework markedly outperform existing state-of-the-art methods in network disintegration, with performance improvements reaching up to 60.151% and 31.000% for Schneider R and the critical removal fraction fc, respectively. Notably, additional analysis consistently indicates low correlations (Kendall’s Tau < 0.6) and distinct value distributions between NDCH-based strategies and the state-of-the-art approaches. In summary, the novel framework underscores the significance of both redundancy and structural heterogeneity when devising network disintegration strategies, offering a substantial leap forward in enhancing network robustness against malicious attacks and various disruptions, especially in infrastructure networks.

The Distributed Multi Constrained Channel Access Mechanism By Using Framework For Mobile Adhoc Network

The Mobile Ad hoc Network (MANET) is an autonomous wireless communication system, and does not have any fixed infrastructure. The Network loads which arise due to application evolving using MANET environment has to balance using routing protocol. Networks are increasingly resource intensive to efficiently manage the bandwidth &amp; Energy in the group communication on basis of addressing the routing issues to provide the enhanced functionality of the network on basis of channel utilization and channel conditioning against load balancing. In this research, proposed a novel unified framework for Distributed multi constrained Channel Access Mechanism for mobile Adhoc Network on inclusion of Scheduled Throughput Discriminant Multi-Data synchronization Strategies for Channel Allocation in Mobile Adhoc Network on various traffic patterns, Multi Trajectory Particle Swarm Optimization towards Optimal Velocity Control against load balancing and band width controlling and finally Self Adaptive Redundancy Elimination Clustering and Distributed Load Bandwidth Management Constraints for Mobile Ad Hoc Network.

Sauron U-Net: Simple automated redundancy elimination in medical image segmentation via filter pruning

We introduce Sauron, a filter pruning method that eliminates redundant feature maps of convolutional neural networks (CNNs). Sauron optimizes, jointly with the loss function, a regularization term that promotes feature maps clustering at each convolutional layer by reducing the distance between feature maps. Sauron then eliminates the filters corresponding to the redundant feature maps by using automatically adjusted layer-specific thresholds. Unlike most filter pruning methods, Sauron requires minimal changes to typical neural network optimization because it prunes and optimizes CNNs jointly, which, in turn, accelerates the optimization over time. Moreover, unlike with other cluster-based approaches, the user does not need to specify the number of clusters in advance, a hyperparameter that is difficult to tune. We evaluated Sauron and five state-of-the-art filter pruning methods on four medical image segmentation tasks. This is an area where little attention has been paid to filter pruning, but where smaller CNN models are desirable for local deployment, mitigating privacy concerns associated with cloud-based solutions. Sauron was the only method that achieved a reduction in model size of over 90% without deteriorating substantially the performance. Sauron also achieved, overall, the fastest models at inference time in machines with and without GPUs. Finally, we show through experiments that the feature maps of models pruned with Sauron are highly interpretable, which is essential for medical image segmentation.

Proposed fog computing-enabled conceptual model for semantic interoperability in internet of things

Semantic interoperability has emerged as a key barrier amidst the major developments and challenges brought about by the rapid expansion of internet of things (IoT) applications. Establishing interoperability is essential for IoT systems to function optimally, especially across diverse organizations. Despite extensive research in achieving semantic interoperability, dynamic interoperability, a vital facet, remains inadequately addressed. This paper addresses this gap by presenting a fog-based conceptual model designed to facilitate dynamic semantic interoperability in IoT. The model incorporates a single-tier fog layer, providing the necessary processing capabilities to achieve this goal. The study conducts a comprehensive literature review on semantic interoperability, emphasizing latency, bandwidth, total cost, and energy consumption. Results demonstrate the proposed double skin façade (DSF) model’s remarkable 88% improvement in service delay over IoT-SIM and Open IoT, attributed to its efficient load-offloading mechanism and optimized fog layer, offering a 50% reduction in service delay, power consumption, and 86% reduction in network usage compared to existing approaches through data redundancy elimination via pre-processing at the fog layer.

A fragmentation-aware redundancy elimination scheme for inline backup systems

Data deduplication is a widely employed technique in backup systems to enhance storage efficiency by eliminating duplicate chunks. Delta compression is a technique that complements deduplication by removing redundant data between similar chunks. However, when integrated into deduplication-based backup systems, delta compression can considerably decrease backup throughput due to the additional I/Os for fetching base chunks. Moreover, data deduplication can lead to chunk fragmentation, causing continuous chunks in a backup to become fragmented. We observe that the number of additional I/Os for fetching base chunks when delta compression is applied depends on the degree of chunk fragmentation. When chunk fragmentation is not significant, delta compression can improve storage efficiency without significantly impacting backup throughput. Based on this observation, we propose a redundancy elimination approach called Fragmentation-aware Redundancy Elimination (FaRE) for in-line backup systems.The main idea behind FaRE is the combined use of three techniques: fragmentation estimation for assessing the degree of chunk fragmentation, sequential deduplication to significantly reduce chunk fragmentation by only deduplicating against chunks with sequential layout when fragmentation is severe, and local redundancy elimination to greatly enhance storage efficiency by performing both deduplication and delta compression when chunk fragmentation is not significant. Our evaluation results demonstrate that FaRE achieves higher storage efficiency and restoration performance compared to traditional approaches that only adopt deduplication for redundancy elimination, while achieving comparable backup throughput due to the limited number of additional I/Os required.

A Class Specific Feature Selection Method for Improving the Performance of Text Classification

Recently, a significant amount of research work has been carried out in the field of feature selection. Although these methods help to increase the accuracy of the machine learning classification, the selected subset of features considers all the classes and may not select recommendable features for a particular class. The main goal of our paper is to propose a new class-specific feature selection algorithm that is capable of selecting an appropriate subset of features for each class. In this regard, we first perform class binarization and then select the best features for each class. During the feature selection process, we deal with class imbalance problems and redundancy elimination. The Weighted Average Voting Ensemble method is used for the final classification. Finally, we carry out experiments to compare our proposed feature selection approach with the existing popular feature selection methods. The results prove that our feature selection method outperforms the existing methods with an accuracy of more than 37%.