Aggregation Techniques Research Articles

Komunikasi Injil Lintas Budaya Mengenai Roh Kudus dalam Tradisi Ari-ari pada Masyarakat Jawa di Surakarta

The aim of this research is to find the communication of the gospel regarding the Holy Spirit in the ari-ari tradition in Javanese society. This research uses a qualitative approach with phenomenological methods. In this research, the data aggregation technique used by researchers is a literature study or written document review. The result of this research is the communication of the gospel regarding the Holy Spirit (local pneumatology) in the ari-ari tradition in the Javanese community in Surakarta.

Transformative Approach for Heart Rate Prediction from Face Videos Using Local and Global Multi-Head Self-Attention

Heart rate estimation from face videos is an emerging technology that offers numerous potential applications in healthcare and human–computer interaction. However, most of the existing approaches often overlook the importance of long-range spatiotemporal dependencies, which is essential for robust measurement of heart rate prediction. Additionally, they involve extensive pre-processing steps to enhance the prediction accuracy, resulting in high computational complexity. In this paper, we propose an innovative solution called LGTransPPG. This end-to-end transformer-based framework eliminates the need for pre-processing steps while achieving improved efficiency and accuracy. LGTransPPG incorporates local and global aggregation techniques to capture fine-grained facial features and contextual information. By leveraging the power of transformers, our framework can effectively model long-range dependencies and temporal dynamics, enhancing the heart rate prediction process. The proposed approach is evaluated on three publicly available datasets, demonstrating its robustness and generalizability. Furthermore, we achieved a high Pearson correlation coefficient (PCC) value of 0.88, indicating its superior efficiency and accuracy between the predicted and actual heart rate values.

Channel reconfiguration distributed interference alignment for multi-unit over-the-air computation

Over-the-air computation (AirComp) has been widely studied as an emerging technique for efficient data aggregation. In multi-unit AirComp networks, inter-unit interference seriously affects the data aggregation performance. To solve the above problem, in this paper, a novel scheme of channel reconfiguration distributed interference alignment (CRDIA) is proposed. We virtualize several devices within a unit as one transmitting device, reconstruct the channel matrix of the system, and iterate iteratively design the pre-processing and post-processing components. Based on the above, the pre-processing matrices of AirComp devices and the post-processing matrices of fusion centers are designed. The sum rate of the system is used as a metric for interference cancellation and mean-squared error (MSE) is used as a metric for data aggregation accuracy. We evaluate the proposed scheme by simulating a network with various numbers of AirComp devices and units. The simulation results show that the CRDIA scheme can achieve accurate computation of the AirComp objective function without inter-unit interference.

Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment

Urban logistics encompass transportation and delivery operations within densely populated urban areas. It faces significant challenges from the evolving dynamic and stochastic nature of on-demand and conventional logistics services. Further challenges arise with application doctrines shifting towards crowd-sourced platforms. As a result, “traditional” deterministic approaches do not adequately fulfil constantly evolving customer expectations. To maintain competitiveness, logistic service providers must adopt proactive and anticipatory systems that dynamically model and evaluate probable (future) events, i.e., stochastic information. These events manifest in problem characteristics such as customer requests, demands, travel times, parking availability, etc. The Stochastic Dynamic Vehicle Routing Problem (SDVRP) addresses the dynamic and stochastic information inherent in urban logistics. This paper aims to analyse the key concepts, challenges, and recent advancements and opportunities in the evolving urban logistics landscape and assess the evolution from classical VRPs, via DVRPs, to state-of-art SDVRPs. Further, coupled with non-reactive techniques, this paper provides an in-depth overview of cutting-edge model-based and model-free reactive solution approaches. Although potent, these approaches become restrictive due to the “curse of dimensionality”. Sacrificing granularity for scalability, researchers have opted for aggregation and decomposition techniques to overcome this problem and recent approaches explore solutions using deep learning. In the scope of this research, we observed that addressing real-world SDVRPs with a comprehensive resolution encounters a set of challenges, emphasising a substantial gap in the research field that warrants further exploration.

Effects of data aggregation (buffer) techniques on bicycle volume estimation

Effects of data aggregation (buffer) techniques on bicycle volume estimation

DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks

Dynamic Graph Neural Network (DGNN) has shown a strong capability of learning dynamic graphs by exploiting both spatial and temporal features. Although DGNN has recently received considerable attention by AI community and various DGNN models have been proposed, building a distributed system for efficient DGNN training is still challenging. It has been well recognized that how to partition the dynamic graph and assign workloads to multiple GPUs plays a critical role in training acceleration. Existing works partition a dynamic graph into snapshots or temporal sequences, which only work well when the graph has uniform spatio-temporal structures. However, dynamic graphs in practice are not uniformly structured, with some snapshots being very dense while others are sparse. To address this issue, we propose DGC, a distributed DGNN training system that achieves a 1.25× - 7.52× speedup over the state-of-the-art in our testbed. DGC's success stems from a new graph partitioning method that partitions dynamic graphs into chunks, which are essentially subgraphs with modest training workloads and few inter connections. This partitioning algorithm is based on graph coarsening, which can run very fast on large graphs. In addition, DGC has a highly efficient run-time, powered by the proposed chunk fusion and adaptive stale aggregation techniques. Extensive experimental results on 3 typical DGNN models and 4 popular dynamic graph datasets are presented to show the effectiveness of DGC.

Smart city design plan selection through single-valued neutrosophic probabilistic hesitant fuzzy rough aggregation information

One of the hottest areas for applying the solutions currently available is the internet of things-based smart housing society architecture and its uncertainty analysis. When intelligent parking, waste management, public transportation, public safety, and other automatic methods for housing society’s growth were implemented, it became even more crucial. An intelligent, smart system is necessary to manage these problems and provide smooth services. Additionally, it will be helpful in reducing issues with time waste and societal safety. However, the issue comes up when describing accurate, approximate, or questionable parking, transit, safety, and waste management areas. This paper discusses several mathematical solutions for the smart housing society that use fuzzy rough sets, probabilistic hesitant fuzzy sets, and their extensions with neutrosophic sets. For further growth, a few studies on the graphic display of the evolution of the smart housing society are also considered. The rough set theory can be useful when dealing with imprecise, incomplete, or indeterminate data sets. The core contribution of this work is the construction of a novel generalized notion of a single-valued neutrosophic probabilistic hesitant fuzzy rough set (SV-NPHFRS), which is a hybrid structure of the single-valued neutrosophic set, the probabilistic hesitant fuzzy set, and the rough set. In contrast to the present literature, the underlying idea of SV-NPHFRS is that it is a powerful mathematical tool for managing uncertainty and imperfect information. This method is particularly beneficial when there are a number of competing criteria to consider. The aggregation technique plays an important role in decision-making concerns, especially when more competing criteria are present. In the study’s comparison phase, the suggested decision support system is compared to relevant existing approaches. The results suggest that, in terms of choice flexibility, the suggested technique has the potential to outperform the drawbacks of the current decision-making tools. The proposed study is expected to be useful for a number of researchers conducting future work on housing societies, waste management, public safety diagnostics, and hybridization.

DAO2: Overcoming Overall Storage Overflow in Intermittently Connected Sensor Networks

Many emerging sensor network applications operate in challenging environments wherein the base station is unavailable. Data generated from such intermittently connected sensor networks (ICSNs) must be stored inside the network for some unpredictable time before uploading opportunities become available. Consequently, sensory data could overflow the limited storage capacity available in the entire network, making discarding valuable data inevitable. To overcome such overall storage overflow in ICSNs, we propose and study a new algorithmic framework called data aggregation for overall storage overflow ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\text{DAO}^2$</tex-math> </inline-formula> ). Utilizing spatial data correlation that commonly exists among sensory data, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\text{DAO}^2$</tex-math> </inline-formula> employs data aggregation techniques to reduce the overflow data size while minimizing the total energy consumption in data aggregation. At the core of our framework are two new graph theoretical problems that have not been studied. We refer to them as traveling salesmen placement problem ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\text{TSP}^2$</tex-math> </inline-formula> ) and quota traveling salesmen placement problem (Q- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\text{TSP}^2$</tex-math> </inline-formula> ). Different from the well-known multiple traveling salesman problem (mTSP) and its variants, which mainly focus on the routing of multiple salesmen initially located at fixed locations, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\text{TSP}^2$</tex-math> </inline-formula> and Q- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\text{TSP}^2$</tex-math> </inline-formula> must decide the placement as well as the routing of the traveling salesmen. We prove that both problems are NP-hard and design approximation, heuristic, and distributed algorithms. Our algorithms outperform the state-of-the-art data aggregation work with base stations by up to 71.8% in energy consumption.

Cache-Efficient Top-k Aggregation over High Cardinality Large Datasets

Top-k aggregation queries are widely used in data analytics for summarizing and identifying important groups from large amounts of data. These queries are usually processed by first computing exact aggregates for all groups and then selecting the groups with the top-k aggregate values. However, such an approach can be inefficient for high-cardinality large datasets where intermediate results may not fit within the local cache of multi-core processors leading to excessive data movement. To address this problem, we have developed Zippy, a new cache-conscious aggregation framework that leverages the skew in the data distribution to minimize data movements. This is achieved by designing cache-resident data structures and an adaptive multi-pass algorithm that quickly identifies candidate groups during processing, and performs exact aggregations for these groups. The non-candidate groups are pruned cheaply using efficient hashing and partitioning techniques without performing exact aggregations. We develop techniques to improve robustness over adversarial data distributions and have optimized the framework to reuse computations incrementally for rolling (or paginated) top-k aggregate queries. Our extensive evaluation using both real-world and synthetic datasets demonstrate that Zippy can achieve a median speed-up of more than 3× for monotonic aggregation functions across typical ranges of k values (e.g., 1 to 100) and 1.4× for non-monotonic functions when compared with state-of-the-art cache-conscious aggregation techniques.

Impact of debt on sustainability reporting: a meta-analysis of the moderating role of country characteristics

PurposeAs of 2022, the scope of the engagement and interest of debt capital providers in ESG reporting is mainly untapped. However, a vast amount of literature has produced conflicting findings about the importance of debt capital (leverage) as a factor in sustainability reporting (SR). This is the first meta-analysis reconciling the mixed results of 85 single country studies containing 131 effect sizes across 24,482 firms conducted over past three decades (1999–2022) investigating the influence of leverage on SR. The study emphasizes the significance of contextualizing research by identifying the macro-environmental elements modifying debt's impact on SR, through the use of the institutional theory. Eleven country variables were tested on the collected dataset, spread across 36 countries.Design/methodology/approachMeta-analysis technique for aggregation of existing extant empirical work. Continuous and categorical variable-based moderator analysis to demystify the influence of country characteristics affecting the leverage–SR relationship.FindingsResults show positive significant impact of debt capital providers on SR. Country's level of development, GDP, extent of capital constraints in a country, financial sector development within a nation, country governance factors and corruption levels, country's culture, number of sustainability reporting instruments operational in a country and geographical location proved to be significant moderators.Research limitations/implicationsThe study details relevant meaningful research gaps, worthy of uptake by researchers to produce targeted research.Practical implicationsGovernments must increasingly go beyond their mandated disclosure role and acknowledge the important institutional factors that have contributed to the expansion of ESG reporting through the creation of nation-specific tools, incentive structures and disclosure-encouraging regulations. To secure a steady flow of funding and prevent negative effects on company value and cost of capital in the midst of prolonged global economic upheaval, businesses must address the information requirements of lenders. The limited total effect size emphasizes the necessity for debt providers to step up their ESG activism and exercise their maximum power and potential in stimulating extensive SR firm-level practices.Originality/valueThe present study is the first meta-analysis reconciling the mixed results of 85 single-country studies containing 131 effect sizes across 24,482 firms conducted over the past three decades (1999–2022) investigating the influence of leverage on SR and demystifying the macro-environmental factors affecting the leverage–SR association.

Developing a collector system aggregation technique of a large-scale grid-connected wind farm

The increasing complexity of power systems necessitates the development of aggregation techniques to address specific issues. Model reduction is crucial to expand simulation capacity, ensuring the stability and reliability of power system design. This paper presents a collector system full aggregation technique based on the per unit system model and power loss-based aggregation technique applied to the impedance model of a large-scale grid-connected Wind Farm (WF). The purpose of the proposed technique is to obtain a fully aggregated equivalent representation of the WF collector system, which includes High Voltage (HV) three-winding transformer(s) or more than one HV two-winding transformer, to reduce the simulation time and the system complexity while maintaining similar performance compared to the Detailed Model (DM) and high-accuracy results in both steady-state and dynamic conditions. To be validated, the presented Per Unit Full Aggregation (PUFA) technique is used to obtain a Full Aggregated Equivalent Model (FAEM) of the existing Gabel El-Zeit WF, Egypt, Detailed Model (DM) that contains two HV three-winding transformers. The PUFA model is tested using the DIgSILENT PowerFactory software package, leading to a significant reduction in model order and simulation time with respect to the DM. The PUFA technique is compared to the DM and other aggregated models in terms of power flow using Quasi-Dynamic Simulation (QDS), dynamic response using Low Voltage Right Through (LVRT) simulation, Modal Analysis (MA), and small signal simulation. The comparison between the different models and the proposed one has confirmed that it realizes very competitive results with high accuracy in both steady-state and dynamic conditions with the least simulation time.

Non parametric maximin aggregation for data with inhomogeneity

Data are heterogeneous when recorded in different time regimes or taken from multiple sources to some degree. Varying-coefficient models or mixture models are suitable for solving this type of problem. On one hand, existing models are quite complicated and computationally cumbersome especially for large-scale data. On the other hand, common effects among different data sources are unknown. Additionally, some existing models are unable to search the non linear relationship between response and covariates. To address these challenges, we aim at estimating common effects about non parametric regression when data are heterogeneous. Our proposed estimation method is based on basis function expansion. Adaptive basis series and fixed basis series are considered, respectively. We exploit maximin aggregation technique to get a simple non linear model, also the common effects, from all possible grouped data. The mean squared error and asymptotic distribution of the estimator are investigated. Simulation studies and real-data analysis are conducted to verify the efficiency of the estimation procedure. Comparing with ordinary least square estimator and averaging ordinary least square estimator, our proposed estimator can reduce the complexity of data sources and is more robust.

KBD-Share: Key Aggregation, Blockchain, and Differential Privacy based Secured Data Sharing for Multi-User Cloud Computing

In today's era of widespread cloud computing and data sharing, the demand for secure and privacy-preserving techniques to facilitate multi-user data sharing is rapidly increasing. However, traditional approaches struggle to effectively address the twin objectives of ensuring privacy protection while preserving the utility of shared data. This predicament holds immense significance due to the pivotal role data sharing plays in diverse domains and applications. However, it also brings about significant privacy vulnerabilities. Consequently, innovative approaches are imperative to achieve a harmonious equilibrium between the utility of shared data and the protection of privacy in scenarios involving multiple users. This paper presents KBD-Share, an innovative framework that addresses the intricacies of ensuring data security and privacy in the context of sharing data among multiple users in cloud computing environments. By seamlessly integrating key aggregation, blockchain technology, and differential privacy techniques, KBD-Share offers an efficient and robust solution to protect sensitive data while facilitating seamless sharing and utilization. Extensive experimental evaluations convincingly establish the superiority of KBD-Share in aspects of data privacy preservation and utility, outperforming existing approaches. This approach achieves the highest R2 value of 0.9969 exhibiting best data utility, essential for multi-user data sharing in diverse cloud computing applications.

RETRACTED: An enhanced consortium blockchain diversity mining technique for IoT metadata aggregation

Over the last two decades, Internet of Things (IoT) networks have grown exponentially. Although the devices have relatively low memory, resource, and processing capability, the trend is that nodes generate a large volume of data. That is where cloud technology comes into play to provide storage space. Because of its centralized nature and robustness, a large network operating with cloud assistance may be vulnerable. Due to rigid access control policies, the devices may be vulnerable to malicious activity. On the other hand, cloud technology provides a platform for such a security system to operate. A centralized secure architecture fails to consider mobile and edge devices within the context of these criteria. This raises numerous concerns about trusting third-party cloud intermediaries, which cause security and privacy leaks. The goal of this research is to look into the problem of blockchain consensus algorithms and their applicability in IoT with cloud-native infrastructure in the Ethereum and MultiChain variants. The significant challenge is scaling the core layer without sacrificing decentralization, security, or public verifiability. This type of testbed is used to investigate the impact of architectural design and consensus models in a lightweight IoT environment. Consensus in each IoT transaction remains the most important aspect of blockchain-enabled IoT networks. When the ledger is updated without privacy protection, transaction-oriented breaches can occur. Current practices for integrating finite IoT network resources into infrastructure-oriented blockchain implementations are flawed due to they are willing to sacrifice data security and integrity in order to save time and energy. This encourages researchers to investigate an improved lightweight block verification approach to the blockchain functional framework, that decreases processing needs, network latency, and network overhead substantially. As a result, the layer-3 consensus promotes blockchain to include the block with a 35% improvement in base layer block time efficiency and a 56% increase in throughput.

FLRAM: Robust Aggregation Technique for Defense against Byzantine Poisoning Attacks in Federated Learning

In response to the susceptibility of federated learning, which is based on a distributed training structure, to byzantine poisoning attacks from malicious clients, resulting in issues such as slowed or disrupted model convergence and reduced model accuracy, we propose a robust aggregation technique for defending against byzantine poisoning attacks in federated learning, known as FLRAM. First, we employ isolation forest and an improved density-based clustering algorithm to detect anomalies in the amplitudes and symbols of client local gradients, effectively filtering out gradients with large magnitude and angular deviation variations. Subsequently, we construct a credibility matrix based on the filtered subset of gradients to evaluate the trustworthiness of each local gradient. Using this credibility score, we further select gradients with higher trustworthiness. Finally, we aggregate the filtered gradients to obtain the global gradient, which is then used to update the global model. The experimental findings show that our proposed approach achieves strong defense performance without compromising FedAvg accuracy. Furthermore, it exhibits superior robustness compared to existing solutions.

Feature Extraction Methods by Various Concepts using SOM

Image retrieval systems gained traction with the increased use of visual and media data. It is critical to understand and manage big data, lot of analysis done in image retrieval applications. Given the considerable difficulty involved in handling big data using a traditional approach, there is a demand for its efficient management, particularly regarding accuracy and robustness. To solve these issues, we employ content-based image retrieval (CBIR) methods within both supervised , unsupervised pictures. Self-Organizing Maps (SOM), a competitive unsupervised learning aggregation technique, are applied in our innovative multilevel fusion methodology to extract features that are categorised. The proposed methodology beat state-of-the-art algorithms with 90.3% precision, approximate retrieval precision (ARP) of 0.91, and approximate retrieval recall (ARR) of 0.82 when tested on several benchmark datasets.

An Improved Intuitionistic Fuzzy Decision-Theoretic Rough Set Model and Its Application

The Decision-Theoretic Rough Set model stands as a compelling advancement in the realm of rough sets, offering a broader scope of applicability. This approach, deeply rooted in Bayesian theory, contributes significantly to delineating regions of minimal risk. Within the Decision-Theoretic Rough Set paradigm, the universal set undergoes a tripartite division, where distinct regions emerge and losses are intelligently distributed through the utilization of membership functions. This research endeavors to present an enhanced and more encompassing iteration of the Decision-Theoretic Rough Set framework. Our work culminates in the creation of the Generalized Intuitionistic Decision-Theoretic Rough Set (GI-DTRS), a fusion that melds the principles of Decision-Theoretic Rough Sets and intuitionistic fuzzy sets. Notably, this synthesis bridges the gaps that exist within the conventional approach. The innovation lies in the incorporation of an error function tailored to the hesitancy grade inherent in intuitionistic fuzzy sets. This integration harmonizes seamlessly with the contours of the membership function. Furthermore, our methodology deviates from established norms by constructing similarity classes based on similarity measures, as opposed to relying on equivalence classes. This shift holds particular relevance in the context of aggregating information systems, effectively circumventing the challenges associated with the process. To demonstrate the practical efficacy of our proposed approach, we delve into a concrete experiment within the information technology domain. Through this empirical exploration, the real-world utility of our approach becomes vividly apparent. Additionally, a comprehensive comparative analysis is undertaken, juxtaposing our approach against existing techniques for aggregation and decision modeling. The culmination of our efforts is a well-rounded article, punctuated by the insights, recommendations, and future directions delineated by the authors.

Using the Ordered Weighted Average Operator to Gauge Variation in Agriculture Commodities in India

Agricultural product prices are subject to various uncertainties, including unpredictable weather conditions, pest infestations, and market fluctuations, which can significantly impact agricultural yields and productivity. Accurately assessing and understanding price is crucial for farmers, policymakers, and stakeholders in the agricultural sector to make informed decisions and implement appropriate risk management strategies. This study used the ordered weighted average (OWA) operator and its extensions as mathematical aggregation techniques incorporating ordered weights to capture and evaluate the factors influencing price variation. By generating different vectors related to different inputs to the traditional formulation, it is possible to aggregate information to calculate and provide a new view of the outcomes. The results of this research can help enhance risk management practices in agriculture and support decision-making processes to mitigate the adverse effects of price.

Z-DNMASort: A double normalization-based multiple aggregation sorting method with Z-numbers for multi-criterion sorting problems

Extensive multi-criterion sorting (MCS) methods have been developed to address problems encountered in real-world scenarios. Nevertheless, these methods did not take into account the reliability of the information given by experts, and neglected the preferences of decision-makers when calculating the comprehensive performances of alternatives. To overcome these limitations, this paper proposes a double normalization-based multiple aggregation sorting method with Z-numbers (Z-DNMASort), which can depict both the reliability and uncertainty of any available information. The method considers both quantitative and qualitative criteria in forms of benefit, cost or target types in the sorting process, and also considers the reliability of information given by experts. Furthermore, this method takes into account three aggregation techniques to reflect the preferences of decision-makers when calculating the comprehensive performances of alternatives. A case study regarding battery electric vehicle (BEV) evaluation is given to validate the proposed method. The paper concludes by providing a comprehensive analysis and discourse on the proposed method.

Fuzzy clustering and optimal routing in wireless sensor network

A wireless sensor network (WSN) is a collection of numerous independent sensor nodes that can sense, process, and manipulate data. WSN is grouped into clusters for energy-efficient data collection. A clustering and aggregation technique automatically extends the lifetime of a WSN by collecting data within the cluster to the cluster head, reduces the amount of data through processing, and transmitting. WSN routing protocols are also required for completing all types of operations in a Internet of things (IOT) environment, such as sensing, controlling, and transmitting packets. In this paper, a novel Fuzzy Clustering and Optimal Routing (FCOR) method is proposed in order to lessen the energy consumption, delay, and improve network lifetime and node density. The proposed FCOR method is executed in two stages. The initial stage consists of clustering and cluster head selection using modified Fuzzy c-means algorithm (MFCM). This algorithm will efficiently cluster the nodes and select the optimal cluster head. The second phase consists of optimal routing using a normalized whale optimization algorithm (NWOA), that select the optimal route and thus improve the lifetime of the nodes. The efficiency of the proposed FCOR approach has been determined using the evaluation metrics such as energy efficiency, packet delivery, and network lifetime. The experimental results reveals that the proposed FCOR model achieves less energy consumption of 67.8%, 54.4%, 60% and 6.67% than existing FRNSEER, E-ALWO, ACI-GSO and CRSH respectively.