Multimedia resources, such as instructional videos, are currently enjoying a certain popularity in training programmes for medical and dental students. The major challenge is to create such resources that have quality content and are acceptable to students. We investigated the opinions of a sample of 551 students from 4 medical universities in Romania in order to identify the characteristics of the instructional videos that students prefer and we comparatively analysed these characteristics according to gender, age group, but also according to their general preferences for using Internet services. We used univariate (hypothesis testing) and multivariate (Two-Step Clustering) data analysis techniques and revealed three clusters of students, primarily determined by perceptions of the visual appearance of instructional videos. The structure of the clusters by gender and age group is relatively similar, but we recorded differences between them associated with students' expressed preferences for certain Internet services compared to others. Students who prefer instructional videos to contain images used only for aesthetic purposes, to fill in breaks, use Internet services mainly for communication, while students who prefer in videos the use of already drawn explanatory diagrams are slightly younger than the others and use Internet services mainly for information and communication.

We describe a new approach for integrating multiple views of data into a common latent space using non-negative tensor factorization (NTF). This approach, which we refer to as the "Integrated Sources Model" (ISM), consists of two main steps: embedding and analysis. In the embedding step, each view is transformed into a matrix with common non-negative components. In the analysis step, the transformed views are combined into a tensor and decomposed using NTF. Noteworthy, ISM can be extended to process multi-view data sets with missing views. We illustrate the new approach using two examples: the UCI digit dataset and a public cell type gene signatures dataset, to show that multi-view clustering of digits or marker genes by their respective cell type is better achieved with ISM than with other latent space approaches. We also show how the non-negativity and sparsity of the ISM model components enable straightforward interpretations, in contrast to latent factors of mixed signs. Finally, we present potential applications to single-cell multi-omics and spatial mapping, including spatial imaging and spatial transcriptomics, and computational biology, which are currently under evaluation. ISM relies on state-of-the-art algorithms invoked via a simple workflow implemented in a Jupyter Python notebook.

Accurate cloud quantification is essential in climate change research. In this work, we construct an automated computer vision framework by synergistically incorporating deep neural networks and finite sector clustering to achieve robust whole sky image-based cloud classification, adaptive segmentation, and recognition under intricate illumination dynamics. A bespoke YOLOv8 architecture attains over 95% categorical precision across four archetypal cloud varieties curated from extensive annual observations (2020) at a Tibetan highland station. Tailor-made segmentation strategies adapted to distinct cloud configurations, allied with illumination-invariant image enhancement algorithms, effectively eliminate solar interference and substantially boost quantitative performance even in illumination-adverse analysis scenarios. Compared with the traditional threshold analysis method, the cloud quantification accuracy calculated within the framework of this paper is significantly improved. Collectively, the methodological innovations provide an advanced solution to markedly escalate cloud quantification precision levels imperative for climate change research, while offering a paradigm for cloud analytics transferable to various meteorological stations.

Purpose of publication: - Preparation of bibliometric data exported from the Scilit platform on energy efficiency and conservation for further analysis to identify relevant research topics. - To identify potential issues in the processing of data exported from the Scilit platform. - Providing colleagues with the opportunity to use the prepared data and examples of their analysis for independent research on topical issues of energy efficiency and energy conservation using materials provided by the Scilit platform. Research Materials: Files in CSV and RIS formats exported from Scilit for the query "energy conservation OR efficiency" in Common Fields [Title, Abstract, Keyword], using filters: Content Type → Journal Article; Year→2021-2023; Subject → Industrial Engineering (29.8K), Energy and Fuel Technology (9.8K), Manufacturing Engineering (9.2K). A total of 30K records sorted by their relevance (10K for each year) were exported. Data are current as of 14-03-2024. Methods: Preprocessing of title, annotation, and keyword field texts using lemmatization dictionaries collected on GitHub, removal of keywords taken from GATE and spaCy, and "manual" editing. Using VOSviewer to analyze publication topics by clustering keywords based on their co-occurrence. Using Scimago Graphica to build bubble diagrams.Application of the GSDMM algorithm for clustering bibliometric records by title and annotation texts. Creation of a dictionary for this algorithm using the keyword field.Use of the Carrot2 demo version and the NMF algorithm for a more detailed analysis of the topics of the record clusters obtained from GSDMM. Results: are presented in the form of initial and interim tables and graphs obtained in the course of this study. The full tables are provided as references to the attached materials. Supplementary material for this preprint on figshare: Chigarev, Boris (2024). Supplementary material for preprint "Analyzing the Possibilities of Using the Scilit Platform to Identify Current Energy Efficiency and Conservation Issues". figshare. Dataset. https://doi.org/10.6084/m9.figshare.25574058.v1

One of the industries with the fastest rate of growth is healthcare, and this industry's enormous data requires extensive cloud storage. The cloud may offer some protection, but there is no assurance that data owners can rely on it for refuge and privacy amenities. Therefore, it is essential to offer security and privacy protection. Increased customer satisfaction with security and privacy preservation is crucial since healthcare big data and its sources are stored in the cloud and contain increasingly private and sensitive information. However, maintaining privacy and security in an untrusted green cloud environment is difficult, thus the data owner should have complete data control. A new work SecPri-BGMPOP(security and privacy of Boost graph Convolutional Network -Pinpointing-Optimization Performance) is suggested that can offer a solution that involves several different steps in order to handle the numerous problems relating to security and protecting privacy. Initially Boost Graph Convolutional Network Clustering (BGCNC) algorithm, which reduces computational complexity in terms of time and memory measurements, is first applied to the input dataset to begin the clustering process. Second, enlarge by employing a piece of the magnifying bit string to generate a safe key, pinpointing based encryption avoids amplify leakage even if a rival or attacker decrypts the key or asymmetric encryption. Finally, to determine the accuracy of the method, an optimal key was created using a meta-heuristic algorithmic framework called Hybrid fragment horde bland lobo Optimization (HFHBLO). Our proposed method currently kept in a cloud environment, allowing analytics users to utilize it without risking their privacy or security.

In this project the EEG – electroencephalogram - channel(s) will be characterized to diagnose PTSD – Post-traumatic stress disorder – cases. For this aim, we applied boosting methods including a combination of K-mean and Support Vector Machine (SVM) models to find the feature weights to detect the PTSD cases. We classified 32 channels of 12 subjects including 6 PTSD and 6 healthy controls using a 6-mean classifier. The linear SVM found the weights of distinguished channels within each subject for each cluster. It was found that the significant SVM weights of F4, F8, and Pz are smaller in PTSD than in healthy subjects. This new method can be used as a tool to better understand the interaction of EEG signals and diagnosis.

The Upper Hunter Valley is a major coal mining area in New South Wales (NSW), Australia. Due to the ongoing increase of mining activities, PM10 (air-borne particle with an aerodynamic diameter less than 10 micrometres) pollution has become a major air quality concern in local communities. The early part of this study identified two air quality subregions in the valley. This paper aims to provide a holistic summarisation of the relationships between elevated PM10 pollution in two subregions and the local- and synoptic-scale meteorological conditions for spring and summer, when PM10 pollution is relatively high. A catalogue of twelve synoptic types and a set of six local meteorological patterns have been quantitatively derived and linked to each other using the self-organising map (SOM) technique. The complex meteorology-air pollution relationships have been visualised/interpretated on the SOM planes for two representative locations. It was found that the influence of local meteorological patterns differed significantly for mean PM10 levels vs the occurrence of elevated pollution events and between air quality subregions. In contrast, synoptic types showed generally similar relationships with mean vs elevated PM10 pollution in the valley. Two local meteorological patterns, the hot-dry-northwesterly wind conditions and the hot-dry-calm conditions, were found most PM10 pollution conducive in the valley when combined with a set of synoptic counterparts. These synoptic types are featured with the influence of eastward migrating continental high pressure system and westerly troughs, or a ridge extending northwest towards coastal northern NSW or southern Queensland from the Tasman Sea. The method and results can be used in air quality research for other locations of NSW, or similar regions elsewhere.

Grasping the spatial and temporal patterns of forest fires, along with the key factors that drive them and the ability to forecast such events accurately, is essential for the successful management of forests. In China's southern region, forest fires significantly endanger the ecological system, public safety, and economic well-being. Through the application of Geographic Information Systems (GIS) and LightGBM (Light Gradient Boosting Machine) model, this study investigates the determinants of fire incidents and formulates a predictive model for forest fire occurrences, alongside a zoning strategy, within the Central-South area. The results indicate: (i) Spatially, fire points exhibit significant clustering and autocorrelation characteristics; (ii) The Central-South Forest Fire Prediction Model shows exceptional accuracy, reliability, and predictive power, with high performance metrics across training and validation sets, including over 85% accuracy, precision, recall, and F1 scores, along with AUC values above 89%, underscoring its efficacy in forecasting forest fires and distinguishing between fire events; (iii) Throughout the year, forest fire risks in the Central-South region of China vary by region and season, with risk spikes from March to May in Guangdong, Guangxi, Hunan, Hubei, and Hainan. From June to August, localized risks are observed in Heyuan and Huangshi, while from September to November, an increase in risk is noted in Guangdong (Meizhou, Heyuan, Shaoguan), Guangxi (Nanning, Hezhou, Yulin), and Hunan (Binzhou, Yongzhou, Hengyang) due to cooler, drier conditions and leaf litter accumulation. From December to February, the risk continues in specific areas across Guangdong, Guangxi, Hunan, and Hubei.

Chinese texts often feature a substantial volume of normative content, and their analysis has increasingly become a focal point in recent semantic analysis endeavors. Enhancing the effectiveness of text classification and clustering is pivotal in unveiling the intricate semantics within extensive textual data. Empirical research within the realm of computational social science has underscored the need for improved explanatory power when it comes to general text clustering methods applied to normative texts. This study introduces an innovative hierarchical clustering method that incorporates part-of-speech (POS) features and pioneers a novel semantic network model. It achieves this by amalgamating a POS-based feature weight calculation method with hierarchical clustering techniques. To assess its efficacy, the method is rigorously evaluated across three diverse text datasets, encompassing normative reports, news articles, and social media content. The experimental results unequivocally demonstrate the superior performance of the POS-HC method, surpassing the traditional TF and TF-IDF feature extraction methods in terms of clustering accuracy, and surpassing some existing clustering methods. Furthermore, its classification effectiveness exhibits notable advantages, particularly in the semantic classification of normative texts.

The last-mile logistics in cities have become an indispensable part of the urban logistics system. This study aims to explore the effective selection of last-mile logistics nodes to enhance the efficiency of logistics distribution, strengthen the corporate distribution image, and further reduce corporate operating costs and alleviate urban traffic congestion. This paper proposes a clustering-based approach to identify urban logistics nodes from the perspective of geographic information fusion. This method comprehensively considers several key indicators, including the coverage, balance, and urban traffic conditions of logistics distribution. Additionally, we employed a greedy algorithm to identify secondary nodes around primary nodes, thus constructing an effective nodal network. To verify the practicality of this model, we conducted an empirical simulation study using the logistics demand and traffic conditions in the Xianlin District of Nanjing. This research not only identified the locations of primary and secondary logistics nodes but also provided a new perspective for constructing the urban last-mile logistics system, enriching the academic research related to logistics node construction. The results of this study are of significant theoretical and practical importance for optimizing urban logistics networks, enhancing logistics efficiency, and promoting the improvement of urban traffic conditions.

Wireless Sensor Networks are critical for modern applications ranging from environmental monitoring to smart city infrastructures. This research proposes a novel optimization learning and deployment strategy for Wireless Sensor Networks (WSNs) by 3D WUSN model is uniformly distributed M sensor nodes across diverse terrains, with clusters representing 20% of sensors, showcasing its ability to balance power consumption and extend network longevity, grounded in fuzzy clustering based protocol using the Fuzzy C-Means (FCM) method, called FCM-3DWUSN. Comparative analysis against established models including LEACH-C, K-Means and LEACH emphasized FCM-3DWUSN's outperformed performance, with average power consumption such as 134.990, 341.790, 143.895, and 192.984; respectively. The experimental result shows that FCM protocol in the 3D WUSN model can reduce energy consumption and improve the network lifetime to gather data and send the information.

Reverse engineering is applied to identify optimum polymerization conditions for the synthesis of polymer with pre-defined properties. The proposed approach uses multi-objective optimization (MOO) and provides multiple candidate polymerization procedures to reach the targeted polymer property. The objectives for optimization include maximal similarity of molar mass distributions (MMD) compared to the target MMD, minimal reaction time, and maximal monomer conversion. The method is tested for vinyl acetate radical polymerizations and can be adopted to other monomers. The data for the optimization procedure is generated by an in-house developed kinetic Monte-Carlo (kMC) simulator for a selected recipe search space. The proposed reverse engineering algorithm comprises several steps: kMC simulations for the selected recipe search space to derive initial data, performing MOO for a targeted MMD, and identification of the Pareto optimal space. The last step uses a weighted sum optimization function to calculate the weighted score of each candidate polymerization conditions. To decrease the execution time clustering of the search space based on MMDs is applied. The performance of the proposed approach was tested for various target MMDs. The suggested MOO-based reverse engineering provides multiple recipe candidates depending on competing objectives.

This paper describes a memory model with 2 levels of information. The lower-level stores source data, is Markov-like and unweighted. Then an upper-level ontology is created from a further 3 phases of aggregating source information, by transposing from an ensemble to a hierarchy at each level. The ontology is useful for search processes and the aggregating process transposes the information from horizontal set-based sequences to more vertical typed-based clusters. The base memory is essentially neutral, where any weighted constraints or preferences should be sent by the calling module. This therefore allows different weight sets to be imposed on the same linking structure. The success of the ontology typing is open to interpretation, but the author would suggest that when clustering text, the result was types based more on use and context, for example, 'linking' with 'structure' or 'provide' with 'web,' for a document describing distributed service-based networks. This allows the system to economise over symbol use, where links to related symbols will be clustered together. The author then conjectures that a third level would be more neural in nature and would include functions or operations to be performed on the data, along with related memory information.

Vehicular traffic in urban areas continues to be a constant challenge today, due to the continuous population growth and the increase of vehicles in circulation. Vehicular congestion, as a recurrent problem, generates a negative impact on urban mobility and citizens’ quality of life. It is hypothesized that a dynamic clustering method of vehicle trajectory data can provide an accurate and up-to-date representation of real-time traffic behavior. To evaluate this hypothesis, data were collected from three different cities: San Francisco, Rome and Guayaquil. A dynamic clustering algorithm was applied to identify traffic congestion patterns and an indicator was applied to identify and evaluate the congestion conditions of the areas. The results show a high precision and recall in congestion classification compared to a method based on static cells.

Integrating photovoltaic (PV) systems plays a pivotal role in the global shift toward renewable energy, offering significant environmental benefits. In many instances, utility companies pay for both energy and peak demand. PV systems can effectively reduce energy consumption during their operational periods, while, their contribution during peak hours, particularly in the early morning and late evening, is often limited. To address this issue, battery storage systems are utilized for storing energy during off-peak hours and releasing it during peak times. However, finding the optimal size of PV-battery systems remains a challenge. This study proposes a novel statistical model to optimize PV-battery system sizing for enhanced peak demand reduction. The model aims to flatten 95% of peak demand days up to a certain demand threshold, ensuring consistent energy supply and financial benefit for utility companies. A straightforward and effective search methodology is employed to determine the optimal system sizes. Additionally, the model effectiveness is rigorously tested through a modified Monte Carlo simulation coupled with time series clustering to generate various scenarios to assess performance under different conditions. The results indicate that the optimal PV-battery system successfully flattens 95% of daily peak demand up to 2000 kW, yielding a financial benefit of $812,648 over 20 years.

Advances in technology have introduced remarkable capabilities, particularly in the realm of gathering and accessing vast amounts of data, which has led to the emergence of the "Big Data" era, presenting exciting opportunities to harness the wealth of the generated information. Traffic management centers comprise a stakeholder that can exploit such data towards improving road network operation. This research, explores the utilization of real traffic data, collected by distinct sources on an interurban motorway: static location based aggregate traffic data and probe vehicle data. The first is collected by traffic detectors, while the second involves patrol vehicles’ GNSS data. The traffic quantity analysed is vehicle speed, while specific emphasis has been given on the ap-plication of heatmaps to represent daily traffic patterns and the utilization of k-means clustering. The performed analysis demonstrates the importance of considering spatiotemporal variables as a unified entity when analysing speed in transportation networks. The limitations of using patrol vehicles as estimators of ambient speed, especially in low and heavy traffic conditions, are deline-ated, while the dual purpose of data gathered from these vehicles towards enhancing driving performance and enabling detector maintenance is emphasized. Valuable traffic insights are offered through comprehensive spatiotemporal speed behavior analysis and data combination. The inte-gration of these techniques enhances decision-making for a streamlined and secure transportation system

There are many applications of anomaly detection in IoT domain. IoT technology consists of large number of interconnecting digital devices not only generating huge data continuously but also making real-time computations. Since IoT devices are highly exposed due to Internet, they frequently meet with the challenges of illegitimate accesses in the form of intrusions, anomaly, fraud, etc. Identifying these illegitimate accesses in IoT domain can be an exciting research problem. In numerous applications fuzzy clustering and rough set theory have been successfully employed. As the data generated in IoT domains are high-dimensional, the clustering methods used for lower dimensional data cannot be applied efficiently. In this article, mixed approaches consisting of nano topology and fuzzy clustering techniques are proposed for anomaly detection. First of all, the nano topology is generated to find lower dimensional apace and then a couple of well-known fuzzy clustering techniques are employed on it for the efficient anomaly detection. The effectiveness of the proposed approaches is evaluated using time-complexity analysis, experimental studies with a synthetic dataset and a real-life dataset along with comparative studies with traditional fuzzy clustering approaches namely fuzzy c-means clustering (FCM) algorithm, Gustafson-Kessel (GK) Algorithm, Gath-Geva (GG) Algorithm, Mahalanobis Distance based Fuzzy C-Means algorithm (M-FCM), and Common Mahalanobis Distance based Fuzzy C-Means algorithm (CM-FCM). Experimentally, it has been found that the proposed approaches outperform the aforesaid algorithms in terms of detection rates, accuracy rates, false alarm rates and computational times.

The phenomenon of missing data can be seen everywhere in reality. Most typical attribute reduction models are only suitable for complete systems. But for incomplete systems, we can’t obtain the effective reduction rules. Even if there are a few reduction approaches, the classification accuracy of their reduction sets still needs to be improved. In order to overcome these shortcomings, this paper firstly defines the similarities of intra-cluster objects and inter-cluster objects based on the tolerance principle and the mechanism of knowledge granularity. Secondly, attributes are selected on the principle that the similarity of inter-cluster objects is small and the similarity of intra-cluster objects is large, and then the knowledge granularity attribute model is proposed under the background of clustering; Then, the IKAR algorithm program is designed. Finally, a series of comparative experiments about reduction size, running time and classification accuracy are conducted with twelve UCI data sets to evaluate the performance of IKAR algorithms, then the stability of Friedman test and Bonferroni-Dunn test are conducted. The experimental results indicate that the proposed algorithms are efficient and feasible.

The energy-intensive sector of the cement industry needs to find technologically advanced methods to produce cement with as little energy as possible, without polluting the environment and without sacrificing the quality (fineness) of the cement. In addition, the stress on the machines changes the behavior of the data. By combining the k-means method, two (2) feature selection methods, nine (9) machine learning methods, and the differential evolution (DE) method, a dynamic system is created where the user determines the key performance indicators (KPIs) each time. The user has the potential to control the distribution of the data, the input of machine learning models, and the ability to switch the system to the suggested values without damage. The selection of the best-performing models is based on the normalized root mean squared error (NRMSE). The DE method optimizes the dynamic objective function. The optimal values of the manipulated variables are evaluated compared to the value of the objective function from the actual values of the variables. In all experiments, the recommendations are acceptable. The final results show an improvement in the operation of both the cement mill and kiln compared to the current operating condition.

Clustering is a data mining task used for the data extraction from the data bases or files. Clustering is used to find unknown groups present in the data sources like files or data bases. This paper focuses on clustering algorithms performance dependency on the parallel clustering platforms and the clustering algorithms along with their clustering criteria. The problems with the present Traditional clustering algorithms were throughput and data source size changes (scalability). So they can’t address the big data. So for handling the huge volumes of data, parallel clustering algorithms along with clustering criteria were used. For processing the big Data Parallel clustering algorithms are of two types based on computing platforms used. They were the horizontal scaling platforms and vertical scaling platforms.

The process of testing software is examining the artifacts and behavior of the software under test by validating and verifying it. Testing can provide valuable information about the software. Given an input to the system, there is a challenge of distinguishing correct from potentially incorrect behavior, which is the test oracle problem. Although the combinatorial testing approach can effectively reduce the number of test cases, the manual inspection of the outputs is still required. In this paper, we propose an approach to automatically classify the return pages with conducting combinatorial testing based on page similarities and hierarchical clustering, by which potential output anomalies can be identified. In the experiment, we apply our approach to a real-world e-commerce website, an anomaly can be found with the visualization of the clustering hierarchy, which suggests the potential of the applicability of the approach.

The influence of a background vortex flow on clustering of floating tracer is addressed. The vortex flow considered is induced by an ellipsoidal vortex evolving in a deformation. The system exhibits various vortex motion regimes: (i) steady state, (ii) oscillation and (iii) rotation of the ellipsoidal vortex core. The latter two induce unsteady velocity field for the tracer thus leading to irregular (chaotic) tracer motion. Superimposing a stochastic divergent velocity field onto the deterministic vortex flow allows us to observe significantly different tracer evolution. We use the method of characteristics to integrate the floating tracer density evolution equation and the Euler-Ito scheme for obtaining the floating tracer trajectories with the random velocity field. The cluster area and cluster mass from the statistical topography were used as the quantitative diagnostics of floating-tracer’s clustering. For the case of the steady ellipsoidal vortex embedded into the deformation flow with a random velocity field component we found that clustering characteristics are weakened by the steady vortex. For the cases of an unsteady ellipsoidal vortex, we observed clustering in the floating-tracer density field if the contribution of the divergent component is higher or equal to that of the rotational (nondivergent) component. Even when the initial floating tracer patch was set on the boundary of oscillating ellipsoidal vortex, we observed formation of clusters. In the case of a rotating ellipsoidal vortex, we also observed pronounced clustering. Thus, we argue that unsteady ellipsoidal vortex regimes (oscillation and rotation), which induce chaotic motion of the nearby passive tracer’s trajectories, are still conducive to clustering of floating tracer observed in the density field despite the intense deformation introduced by strain and shear.

Addressing sustainable mobility in urban areas has become a priority in today’s society, given the growing population and increasing vehicular flow in these areas. Intelligent Transportation Systems have emerged as innovative and effective technological solutions to address these challenges. Research in this area has become crucial, as it contributes not only to improve mobility in urban areas, but also to positively impact the quality of life of its inhabitants. To address this, a dynamic clustering methodology for vehicular trajectory data is proposed which can provide an accurate representation of the traffic state. Data was collected for the city of San Francisco, a dynamic clustering algorithm was applied and then an indicator was applied to identify areas with traffic congestion. Several experiments were also conducted with different parameterizations of the forgetting factor of the clustering algorithm. The results showed in terms of precision that the dynamic clustering methodology achieved high match rates compared to the congestion indicator applied to static cells.

The spectrums of one type of object under different conditions have the same features (up, down, protruding, concave) at the same spectral positions, which can be used as primary parameters to evaluate the difference among remotely sensed pixels. Wavelet-feature correlation ratio Markov clustering algorithm (WFCRMCA) for the remotely sensed data is proposed based on an accurate description of abrupt spectral features and an optimized Markov clustering in the wavelet feather space. The peak points can be captured and identified by applying a wavelet transform to spectral data. The correlation ratio between two samples is a statistical calculation of the matched peak point positions on the wavelet feature within an adjustable spectrum domain or a range of wavelet scales. The evenly sampled data can be used to create class centers, depending on the correlation ratio threshold at each Markov step, accelerating the clustering speed by avoiding the computation of Euclidean distance for traditional clustering algorithms, such as K-means and ISODATA. Markov clustering applies several strategies, such as a simulated annealing method and gradually shrinking the clustering size, to control the clustering convergence. At each clustering tempera-ture, it can obtain the best class centers quickly. The experimental results of the Airborne Visible/ Infrared Imaging Spectrometer (AVIRIS) and Thermal Mapping (TM) data have verified its ac-ceptable clustering accuracy and high convergence velocity.

Historic sites are important components of every city's cultural history because they preserve rich historical knowledge and distinctive values passed down from previous generations to the present. Due to the progress of urbanization and modernization, many historic sites face pressure from damage and transformation. In this paper, a method for assessing cultural heritage damage was developed to measure the extent of spatial damage in historic sites. Using sample data obtained in Xiyang, Qixian, and Xiaoyi, all historic cities in Shanxi Province, Mainland China, and combined weights were estimated using the Delphi technique and the CRITIC weight method. Following this, the Spatial Damage Degree Model (SDDM) based on K-means cluster analysis and K-nearest neighbor (KNN) classification was developed. The findings show that the model efficiently solves the problem of assessing spatial damage levels in historic sites. Through multiple linear regression analysis, it was shown that the damage to historic sites was predominantly caused by three factors: natural erosion, construction damage, and planning and policy. SDDM was used to calculate the spatial damage levels of historic sites, allowing conservators to fully comprehend the features and concerns related to historic sites. As a result, more scientific and rational preservation approaches may be developed, improving the efficiency of historic site restoration and conservation and encouraging the sustainable development of urban and rural heritage.

The Covid-19 crisis has been one of the most relevant economic shocks in the history of the modern economy, mainly due to the restrictions on travel and social interaction taken by the authorities (quarantines, closure of schools, artistic activities, bars, and restaurants, capacity in stores), to reduce the transmission of the virus (Sars-Cov2), having consequences on the national productions of all countries (about 7% for the loss of GDP worldwide). In our study, we analyze, through clustering methods, the effects of the level of contagion, economic projections, and economic mitigation measures taken by governments for managing the pandemic. According to the analyses, it can be concluded that a low infection rate implies a lower loss of product and economic savings when applying economic mitigation measures, taking relevance in the management of sanitary measures to reduce the transmission of the virus (and the temporality of these).

In this paper we compare the effects of forecasting demand using individual (disaggregated) components versus first aggregating the components either fully or into several clusters. Demand streams are assumed to follow autoregressive moving average (ARMA) processes. Using individual demand streams will always lead to a superior forecast compared to any aggregates, however we show that if several aggregated clusters are formed in a structured manner then these subaggregated clusters will lead to a forecast with minimal increase in mean-squared forecast error. We show this result based on theoretical MSFE obtained directly from the models generating the clusters as well as estimated MSFE obtained directly from simulated demand observations. We suggest a pivot-algorithm, that we call Pivot Clustering, to create these clusters. We also provide theoretical results to investigate sub-aggregation, including for special cases such as, aggregating MA(1) streams and ARMA streams with similar or same parameters.

Underwater wireless sensor networks (UWSNs) represent a specialized category of WSNs with versatile applications including acoustic monitoring, oil and gas exploration, and military surveillance. UWSNs face formidable challenges such as limited energy resources, extended propagation delays, and harsh conditions. Existing clustering and multi-hop routing protocols often unevenly distribute nodes geographically, causing network fragmentation and disproportionately draining the battery life of nodes near the sink due to higher data transmission demands. In this paper, we introduce an Energy-efficient Artificial Fish Swarm-based Clustering Protocol (EAFSCP), inspired by the collective behavior of fish swarms. EAFSCP is a decentralized clustering algorithm designed for acoustic monitoring in UWSNs. Its decentralized nature makes it particularly well-suited for large-scale UWSNs, where centralized algorithms may not be feasible. Through comprehensive comparisons with existing cluster-based routing protocols, our findings indicate that EAFSCP consistently outperforms them across multiple key performance metrics, including network lifetime, energy consumption, packet delivery ratio, packet loss rate, and throughput. According to the results, EAFSCP represents an effective clustering algorithm that enhances network performance, prolongs network lifespan by reducing energy consumption, promotes scalability, and provides valuable guidance for emergency response efforts.

In federated learning (FL), clients train models locally without sharing raw data, ensuring data privacy. In particular, federated distillation transfers knowledge to clients regardless of the model architecture. However, when groups of clients with different data distributions exist, sharing the same knowledge among all clients becomes impractical. To address this issue, this paper presents an approach that clusters clients based on the output of a client model trained using their own data. The clients are clustered based on the predictions of their models for each label on a public dataset. Prior knowledge of the number of groups is not required. Evaluations on the MNIST dataset showed that our method accurately identified these group structures and improved accuracy by 15–75% compared with traditional federated distillation algorithms when distinct group structures were present. Additionally, we observed significant performance improvements in smaller client groups, bringing us closer to fair FL.

Keywords: Requirements prioritization, Next release plan, Software product planning, Decision support, MoSCoW, AHP, K-Menas, GMM, BIRCH, PAM, Hierarchical, Clustering, Clusters Evaluation

The large quantity of information retrieved from communities, public data repositories, web pages, or data mining can be sparsed and poorly classified. This work shows how to employ unsupervised classification algorithms such as K-means proper to classify user reviews into their closest category, forming a balanced data set. Moreover, we found that the text vectorization technique significantly impacts the clustering formation, comparing TF-IDF and Word2Vec. The value for mapping a cluster with movie genre was 81.34% ± 20.48 of the cases when the TF-IDF was applied, whereas Word2Vec only yielded a 53.51% ± 24.1. In addition, we highlight the impact of the removal of stop-words. Thus, we detected that pre-compiled lists are not the best method to remove stop-words before clustering because there is much ambiguity, centroids are poorly separated, and only 57% of clusters could match a movie genre. Thus, our proposed approach achieved a 94% of accuracy. After analyzing the classifiers’ results, we appreciated a similar effect when divided by the stop-words method removal. Statistically significant changes were observed, especially in precision metric and Jaccard scores in both classifiers, using custom-generated stop lists rather than pre-compiled ones. Reclassifying sparse data is strongly recommended as using custom-generated stop lists.

Finding the ideal statistical method for grouping phenological data is always an important step for breeders to draw correct conclusions from it possibly. In this paper, K-cluster analysis is presented as a perfect tool for grouping phenological data. The present research was performed based on the phenological data of 61 strawberries (Fragaria × ananassa) cultivars of different geo-graphical origins grown in Estonian conditions. Groups of strawberry cultivars were deter-mined according to flowering and ripening time: early, middle and late, based on the sum of ef-fective temperatures above +5°C. The result of the K-cluster analysis carried out in this way makes it possible to precisely plan the ripening time of berries of different strawberry cultivars. Using such analysis data, it is possible to combine with different early, mid or late strawberry cultivars to extend the picking period. Also, this technique can be used to study the effect of cli-matic changes occurring over the years on the phenology of strawberry cultivars grown in the region.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

Data Extraction is a technique is called as clustering which is used to retrieve data either from the files or data bases or both. This paper focuses on the performance evaluation parameters of the clustering algorithms based on different parameters or conditions or constraints and parameters which are used to perform the clustering process to get the clusters on the data sets. Therefore best clusters are retrieved when best parameters or conditions or constraints or preferences which are applied on the data sources for the clustering process. These parameters or conditions or constraints are opted by the user called as user preferences.

The human interferon-induced transmembrane (IFITM) proteins inhibit the fusion of a broad spectrum of enveloped viruses, both when expressed in target cells and when present in infected cells. Upon expression in infected cells, IFITMs incorporate into progeny virions and reduce their infectivity by a poorly understood mechanism. Since only a few Env glycoproteins are present on HIV-1 particles, and Env clustering has been proposed to be essential for optimal infectivity, we asked if IFITM protein incorporation modulates HIV-1 Env clustering. The incorporation of two members of the IFITM family, IFITM1 and IFITM3, into HIV-1 pseudoviruses verified by Western blotting correlated with a marked reduction of infectivity. Super-resolution imaging of Env distribution on single HIV-1 pseudoviruses did not reveal significant effects of IFITMs on Env clustering. However, IFITM3 markedly reduced the Env processing and incorporation into virions relative to control and IFITM1-containing viruses. These results suggest that IFITM1 and IFITM3 restrict progeny HIV-1 infectivity via distinct mechanisms. We propose that IFITM1 interferes with viral fusion by altering the properties of the viral membrane or Env functionality by means other than disrupting Env clusters, while IFITM3 also targets Env processing and incorporation into progeny virions.

The article aims to explore social aspects in the area of energy research by using bibliometrics methods and tools. The study is based on the data of Energy Research & Social Science journal publications exported from ScienceDirect database during 2019-2023. Methodologically, the work included clustering of the bibliometric records under consideration. This allowed to identify the main topics of publications and those in which the research of social problems prevails. This stage of the work was carried out using carrot2, an engine for clustering search results. Next, the analysis of publication topics related to social issues research was carried out using VOSviewer — a software tool for visualizing scientific landscapes. The topics of the four clusters obtained at this stage were described by key terms with the maximum total link strength. For the principal ones, a definition was made on the basis of the texts of publications that most fully disclose the meaning of these terms. The 1537 publications in the journal during the period under review deal with many aspects of energy transition research, renewable energy, energy policy, energy justice and energy systems, but only 78 of them are dominated by social issues. The paper reveals the main social issues in the field of energy research: sociology of energy, socio-technical system, community energy, energy democracy, sociology of the future, energy sovereignty, socio-technical imaginary and shows the insufficient attention to this topic, especially to the investment of such research.

Spatiotemporal climate variability is a leading environmental constraint to the rain-fed agricultural productivity and food security of communities in the Abbay basin and elsewhere in Ethiopia. The previous one-size-fits-all approach to soil and water management technology targeting did not effectively address climate-induced risks to rain-fed agriculture. This study, therefore, delineates homogenous climatic regions and identifies climate-induced risks to rain-fed agriculture that are important to guide decisions and selection of site-specific technologies for green water management in the Abbay basin. The k-means spatial clustering method was employed to identify homogenous climatic regions in the study area, while the Elbow method was used to determine an optimum number of the climate clusters. The k-mean clustering used the Enhancing National Climate Services (ENACTS) daily rainfall, minimum and maximum temperatures, and other derived climate variables that include daily rainfall amount, length of growing period (LGP), rainfall onset and cessation dates, and rainfall intensity, temperature, potential evapotranspiration (PET), soil moisture and AsterDEM to define climate regions. Accordingly, 12 climate clusters or regions were identified and mapped for the basin. Clustering a given geographic region into homogenous climate classes is useful to accurately identify and target locally relevant green water management technologies to effectively address local-scale climate-induced risks. The study has also provides a methodological framework that can be used in the other river basins of Ethiopia and indeed elsewhere.

The global prevalence of type 2 diabetes mellitus (T2DM) has surged in recent decades and the identification of differential glycemic responders can aid tailored treatment for prevention of pre-diabetes and T2DM. A mixed meal tolerance test (MMTT) based on regular foods offers potential to uncover differential responders in dynamical postprandial events. We aimed to fit a simple mathematical model on dynamic postprandial glucose data from repeated MMTTs among partic-ipants with elevated T2DM risk, to identify response clusters and investigate their association with T2DM risk factors and gut microbiota. Data were used from a 12-week multi-center dietary inter-vention trial involving high-risk T2DM adults, comparing high- versus low-glycemic index foods within a Mediterranean diet context (MEDGICarb). Model-based analysis of MMTTs from 155 participants (81 females, 74 males) revealed two distinct plasma glucose response clusters that were associated with baseline gut microbiota. Cluster A, inversely associated with HbA1c and waist circumference and directly with insulin sensitivity, exhibited a contrasting profile to cluster B. Findings imply that a standardized breakfast MMTT using regular foods could effectively distin-guish non-diabetic individuals at varying risk levels for T2DM using a simple mechanistic model.

Data is present in the data sources like Files and Data bases, Retrieval of information from that data sources is one of the important issue nowadays. So for retrieval information from the data sources clustering is used. In the present market different types of clustering algorithms were available. But opting of the clustering is based on user requirements. This paper focuses on the study of hierarchical clustering approach on different conditions or measures or with customer choices like clustering process number of clusters generated at each level, number of levels, attributes range for performing the clustering on the given data set. In brief overview we discuss the hierarchical approach for clustering algorithm with the user opting choices.

Determining accurate PM2.5 pollution concentrations and understanding their dynamic patterns is crucial for scientifically informed air pollution control strategies. Traditional reliance on linear correlation coefficients for ascertaining PM2.5 related factors only uncovers superficial relationships. Moreover, the invariance of conventional prediction models restricts their accuracy. To enhance the precision of PM2.5 concentration prediction, this study introduces a novel integrated model that leverages feature selection and a clustering algorithm. Comprising three components - feature selection, clustering, and integrated prediction, the model first employs the non-dominated sorting Genetic Algorithm (NSGA-III) to identify the most impactful features affecting PM2.5 concentration within air pollutants and meteorological factors. This step offers more valuable feature data for subsequent modules. The model then adopts a two-layer clustering method (SOM+K-means) to analyze the multifaceted irregularity within the dataset. Finally, the model establishes the Extreme Learning Machine (ELM) weak learner for each classification, integrating multiple weak learners using the Adaboost algorithm to obtain a comprehensive prediction model. Through feature correlation enhancement, data irregularity exploration, and model adaptability improvement, the proposed model significantly enhances the overall prediction performance. Data sourced from 12 Beijing-based monitoring sites in 2016 were utilized for an empirical study, and the model's results compared with five other predictive models. The outcomes demonstrate that the proposed model significantly heightens prediction accuracy, offering useful insights and potential for broadened application to multifactor correlation concentration prediction methodologies for other pollutants.

As a consequence of applying advanced maintenance practices, the theoretical probability of failures is relatively low. However, observation of low market intelligence and maintenance management has been reported. The experimental investigation is supported by findings from a survey targeting asset-intensive companies applying hydraulic power systems. Next, the study incorporates multidimensional data analysis using CA-AHC (Correspondance Analysis with Agglomerative Hierarchical Clustering) approach. The non-parametric machine learning models are used from generated feature subspace to extract features affecting maintenance performance indicators. The results support empirical evidence that equipment age increases the probability of failures. However, the novel findings show that number of maintenance personnel, equipment size measured by nominal working energy consumption, and activities dedicated to maintaining fluid cleanliness impact regression results of companies utilising hydraulic applications.

The utilization of tempered blast furnace (BF) slag through the direct fiber forming process to create high-value thermal insulation materials offers a dual benefit: it efficiently harnesses the latent heat within unused slag and substantially enhances the value of blast-furnace slag utilization. However, gauging the melting properties of iron slag under high temperatures is a challenge. In this study, we explore the melting behavior of SiO2 within a high-temperature molten pool. We employ dynamic visual data (video stream) captured via a non-contact charge coupled device (CCD) video recording system to extract SiO2 contours through image processing. The change in image centroid characteristics is used to establish a convolution function relationship, and MATLAB's traversal search algorithm determines SiO2's centroid position. Given that SiO2 is proportionate to crucible pixels, the area of SiO2 is calculated through pixel statistics within these contours. Subsequently, we propose a new indirect method to process image information, yielding SiO2 volume and mass at different time points. An exponential fitting yields the melting rate function of SiO2. Finally, we compare this indirect method with shape from shading (SFS), quantitative characterization, and dimensional analysis techniques. We also discuss the strengths and limitations of each method. Our findings reveal that the indirect solution method presented here boasts straightforward calculation steps and imposes minimal image format requirements. This research provides theoretical and technical support for blast-furnace slag's direct fiber forming process.

Drug-induced pruritus triggers a desire to scratch, thereby diminishing one’s quality of life. Certain instances of this phenomenon follow complex mechanisms of action that diverge from histamine-mediated pathways, known contributors to pruritus. However, investigations into the relationship between drugs and pruritus are limited. In this study, data mining techniques were employed to comprehensively analyze the characteristics of drugs linked to pruritus, using the FDA Adverse Event Reporting System(FAERS) Data maintained in the United States. Reports linked to pruritus demonstrated noteworthy differences in gender, age, and weight when compared with non-pruritus cases. Among the leading candidates for drugs prompting pruritus were ophthalmic drugs, systemic antibacterials, contrast media, dermatological antifungals, and dermatological preparations. Principal component analysis showed that the second principal component served as an indicator for distinguishing between onsets at mucous membranes or the skin surface. Additionally, the third principal component functioned as an indicator for categorizing administration methods as either invasive or noninvasive. Furthermore, a hierarchical cluster analysis conducted on these obtained principal components revealed the potential for classifying drugs based on the site of pruritus onset and the method of drug administration. These findings contribute to the development of targeted prevention and treatment strategies for avoiding pruritus in clinical practice.

While there are several ways to identify customer behaviors, few extract this value from information already in a database, much less extract relevant characteristics. This paper presents the development of a prototype using the recency, frequency, and monetary attributes for customer segmentation of a retail database. For this purpose, the standard K-means, K-medoids, and MiniBatch K-means were evaluated. The standard K-means clustering algorithm was more appropriate for data clustering than other algorithms as it remained stable until solutions with 6 clusters. The evaluation of the clusters’ quality was obtained through the internal validation indexes: Silhouette, Calinski Harabasz, and Davies Bouldin. Once consensus was not obtained, three external validation indexes were applied: global stability, stability per cluster, and segment-level stability across solutions. Six customer segments were obtained, identified by their unique behavior: Lost customers, disinterested customers, recent customers, less recent customers, loyal customers, and best customers. Their behavior was evidenced and analyzed, indicating trends and preferences.

Due to the influence of background conditions, lighting conditions, occlusion issues and the image resolution, how to extract robust person features is one of the difficulties in ReID research. Vision in Transformers (ViT) has achieved significant results in the field of computer vision. However, the existing problems still limit its application in ReID due to slow extraction of person features and difficulty in utilizing local features of people. To solve the mentioned problems, we utilize Pyramid Vision Transformer (PVT) as the backbone of feature extraction and propose a PVT-based ReID method in conjunction with other studies. Firstly, some improvements suitable for ReID are used on the PVT backbone, and we establish a basic model by using powerful methods verified on CNN-based ReID. Secondly, in an effort to further promote the robustness of the person features extracted by the PVT backbone, two new modules are designed. (1) The local feature clustering (LFC) is recommend to enhance the robustness of person features by calculating the distance between local features and global feature to select the most discrete local features and clustering them. (2) The side information embeddings (SIE) are used to encode non-visual information and send it into the network for training to reduce its impact on person features. Finally, the experiments show that PVTReID has achieved excellent results in ReID datasets and are 20% faster on average than CNN-based ReID methods.

Semi-supervised consensus clustering is a promising strategy to compensate for the subjectivity of clustering and its sensitivity to design factors, with various techniques being recently proposed to integrate domain knowledge and multiple clustering partitions. In this article we present a new approach that makes double use of domain knowledge, namely to build the initial partitions as well as to combine them. In particular, we show how to model and integrate must-link and cannot-link constraints into the objective function of a generic consensus clustering (??) framework that maximizes the similarity between the consensus partition and the input partitions, which have, in turn, been enriched with the same constraints. In addition, borrowing from the theory of functional dependencies, the integrated framework exploits the notions of deductive closure and minimal cover to take full advantage of the logical implication between constraints. Using standard UCI benchmarks, we found that the resulting algorithm, termed ??? (double-Constrained Consensus Clustering), was more effective than plain ?? at combining base constrained partitions. We then argue that ??? is especially well-suited to profiling counterfeit e-commerce websites, because constraints can be acquired by leveraging specific domain features, and demonstrate its potential for detecting affiliate marketing programs. Taken together, our experiments suggest that ??? makes the process of clustering more robust and able to withstand changes in clustering algorithms, datasets, and features, with a remarkable improvement of average performance.

Studying and understanding the behavior of people and vehicles on public roads can be of utmost importance for supporting the activities of many institutional stakeholders. It may allow automated supervision of the ongoing situation in a given place, with warnings or alarms raised in case of anomalies. It may be used to plan their interventions on road and town organization. It may provide them with advanced support to decision-making. The number of involved entities and places to manage makes it infeasible to manually handle all the traffic-related tasks. Moreover, the complexity of the tasks to be carried out requires the adoption of advanced approaches. Many AI solutions are nowadays mature to support these requirements. In some cases, the motivations and objectives of traffic management require the AI outcomes to be understandable, interpretable and explainable. In this paper, we propose TrAnSIT (TRaffic ANalysis Supervision and Interpretation Tool), an AI-based framework that combines several modules, each aimed at tackling a specific traffic-related task, so as to cover a wide landscape of traffic-related issues, from overall urban or suburban traffic management to surveying specific road segments that fall under the scope of one camera. Most of these modules are based on AI techniques that support a human-level understanding of the outcomes.

In the clock network design, the trade-off between power consumption and timing closure is an important and difficult issue. To achieve this target, a hybrid clock network architecture that combines both clock tree and clock mesh seems to be a promising solution. In this paper, we propose a novel clock mesh architecture – cross-mesh, with the average dispersion of the overall driving force, our methodology creates small non-zero skew clock trees. In addition, we integrate clock gating and register clustering techniques to further reduce dynamic power consumption. The proposed algorithms have four stages: cross-mesh planning, register clustering, mesh line connecting, and load balancing. Experimental results show that our methodology and algorithms get feasible solution effectively and improve both power consumption and clock skew simultaneously.

With increasing power and speed of laser welding, in-process monitoring has become even more crucial to ensure process stability and weld quality. Due to its low cost and installation flexibility, acoustic process monitoring is a promising method and has demonstrated its effectiveness. Since its feasibility has been the focus of existing studies, the temporal resolution of acoustic emissions (AE) has not yet been addressed despite its utmost importance for realizing real-time systems. Aiming to provide a benchmark for further development, this study investigates the relationship between duration and informativeness of AE signals during high power (3.5kW) and high speed (12m/min) laser beam butt welding. Specifically, the informativeness of AE signals is evaluated based on the accuracy of detecting and quantifying joint gaps for various time windows of signals, yielding numerical comparison. The obtained results show that signals can be shortened up to a certain point without sacrificing their informativeness, encouraging to optimize the signal duration. Our results also suggest that large gaps (> 0.3mm) induce unique signal characteristics in AE, which are clearly identifiable from 1 ms signal segments, equivalent to 0.2mm weld seam.

Fusarium species are one of the filamentous fungal taxa with the most pronounced impact on agri-cultural production and human health. The mycotoxins produced by pathogenic Fusarium not on-ly attack various plants including crops, causing various plant diseases that lead to reduced yields and even death, but also penetrate into the food chain of humans and animals to cause food poi-soning and consequent health hazards. Although sporadic studies have revealed some of the bio-synthetic pathways of Fusarium toxins, they are insufficient to satisfy the need for a comprehen-sive understanding of Fusarium toxin production. In this study, we focused on 35 serious patho-genic Fusarium species with available genomes and systematically analyzed the ubiquity of the dis-tribution of identified Fusarium and non-Fusarium derived fungal toxin biosynthesis gene clusters (BGCs) in these species through the mining of core genes and comparative analysis of correspond-ing BGCs. Additionally, novel sesterterpene synthases and PKS_NRPS clusters were discovered and analysed. This work is the first to systematically analyze the distribution of related mycotoxin biosynthesis in pathogenic Fusarium species. These findings enhance the knowledge of mycotoxin production and provide a theoretical grounding for the prevention of fungal toxin production us-ing biotechnological approaches.

: Biological networks such as protein interaction networks, gene regulation networks and metabolic pathways are examples of complex networks which are large graphs with small-world and scale-free properties. Analysis of these networks has a profound effect on our understanding the origins of life, health and disease states of organisms, and diagnose diseases to aid the search for remedial processes. In this review, we describe main analysis methods of biological networks using graph theory by first defining main parameters such as clustering coefficient, modularity and centrality. We then survey fundamental graph clustering methods and algorithms followed by the network motif search algorithms with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function carried out by that small network and discovering such a function provides an insight to the overall function of the organism. Lastly, we review network alignment algorithms that achieve to find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor and finding such relationship may help researchers derive ancestral relationships and predict the future evolution of organisms to enable designing new drugs. We conclude by the current challenging areas of biological network analysis using graph theory and parallel processing for high performance analysis

Life in the modern century is heavily reliant on an enormous amount of electricity consumption as technology has become the most integral part of daily life. In this context, smart grid systems play a pivotal role to maintain the uninterrupted power supply which needs to be monitored in a timely fashion to keep track of the electric consumers’ usage pattern. The smart meter is the one of smart applications of the smart grid that collects huge amounts of consumer load data on a daily basis which has become a focus for various researchers and analyzers to study load characterization. In this paper, an approach has been proposed to recognize the energy consumption patterns among diverse types of consumers ranging from residential to industrial levels. This approach is worth considering not only for load pattern recognition but also for involving customers in different events such as demand response or peak shaving. In such a way, this analytical mechanism certainly assists in reducing power wastage and saving costs. The proposed methodology is based on a two-fold clustering algorithm with the use of state-of-the-art technology, machine learning. The primary goal is to classify electric customers' data collected from smart meters. Then, analyzing the classified results with an aim to predict power consumption patterns for the customers in the future and making the right energy policy that will benefit both the grid operator and consumers as well.

Applications for Wireless Sensor Networks (WSNs) range from monitoring the environment to automating factories. However, sustained and effective functioning is made more difficult by Sensor Nodes (SNs) limited energy supplies in which optimization is the main issue. So with the aim of increasing the lifespan by decreasing the energy consumption of WSN, Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol with Deep Learning (DL) algorithm is analyzed in this paper. LEACH is a hierarchical mechanism that elects Cluster Heads (CHs) and regularly rotates their positions in order to allocate energy use effectively by using the same amount of energy. However, Deep Learning (DL) method is used to further improve energy optimization. In many applications, the types of Deep Learning methods like Artificial Neural Networks (ANNs) have shown to be very useful. Using this method, WSNs may make more efficient decisions that reduce energy consumption. Data aggregation, duty cycling, and transmission protocols may all be optimized by Deep Learning model's ability to recognize patterns and forecast network behavior. This results in lower energy consumption, a longer lifespan for the network, and better overall performance.

Current State-of-the-Art (SotA) chatbots are able to produce high quality sentences, handling different conversation topics, and larger interaction times. Unfortunately, the generated responses highly depend on the data on which they have been trained, the specific dialogue history and current turn used for guiding the response, the internal decoding mechanisms, ranking strategies, among others. Therefore, it may happen that for semantically similar questions asked by users, the chatbot may provide a different answer, which can be considered as a form of hallucination or produce confusion in long-term interactions. In this research paper, we propose a novel methodology consisting of two main phases: a) hierarchical automatic detection of topics and subtopics in dialogue interactions using a Zero-Shot learning approach, and b) detecting inconsistent answers using K-Means and the Silhouette coefficient. To evaluate the efficacy of topic and subtopic detection, we used a subset of the DailyDialog dataset and real dialogue interactions gathered during the Alexa Socialbot Grand Challenge 5 (SGC5). The proposed approach enables detecting up to 18 different topics and 102 subtopics. For the purpose of detecting inconsistencies, we manually generate multiple paraphrased questions and employ several pre-trained SotA chatbot models to generate responses. Our experimental results demonstrate a weighted F-1 value of 0.34 for topic detection, a weighted F-1 value of 0.78 for subtopic detection in DailyDialog, then 81% and 62% accuracy for topic and subtopic classification in SGC5; finally, to predict the number of different responses, we obtained a mean squared error (MSE) of 3.4 when testing smaller generative models and 4.9 in recent large language models.

Several sun models suggest the radioactive balance where the concentration of greenhouse gases and the albedo effect are related to the Earth's surface temperature. There is a considerable increment of greenhouse gases due to anthropogenic activities. Climate change correlates with this alteration in the atmosphere and an increase in surface temperature. Efficient forecasting of climate change and its impacts of 1.5°C global warming above pre-industrial levels could be helpful to respond to the threat of c.c. and develop sustainably. Many studies have predicted the temperature change in the coming years. The global community has to create a model that can realize good predictions to ensure the best way to deal with the warming. Thus, we propose a finite-time thermodynamic (FTT) approach in the present work. The FTT can solve problems such as the faint young sun paradox. In addition, we use different machine learning models to evaluate our method and compare the experimental prediction and results.

The rising global population amidst the growing concerns of climate change will have a dire consequence on global food security and socio-economic activities. Wheat is one of the most important staple foods consumed by more than four billion people in the world, but climate change impacts account for a decline of 5.5% in wheat yield and predictions indicate that the production could further dwindle by nearly 30% in 2050, due to trends in temperature, precipitation, and carbon dioxide. An effective annual crop estimate is necessary not only to inform government the status of national food security, but also is used to determine the benchmark on which agricultural commodities are priced in the market. Thus, annual crop monitoring and yield estimate is paramount to determine the amount of wheat imports required to make up for the shortfalls in the national wheat production in South Africa, which has been a net importer of wheat since 1998. A joint project between South Africa and Poland investigated satellite based-crop growth monitoring using Sentinel 2 and determined the most distinguishable crop phenology for an accurate winter wheat classification during the growing season from August – December with Random Forest (RF) algorithm. The winter wheat crop was more accurately identified during the crop ‘heading’ stage in October yielding the highest user’s (75.56%) and producer’s (92.52%) accuracies, despite the relatively lower overall accuracy (78.14%) compared to that of December with OA of 83.58% obtained during the maturity stage. This study, therefore, confirms the suitability of sentinel 2 for an effective phenology-based winter wheat crop classification during the heading stage, reducing the ambiguity of spectral confusion created with surrounding grass and maize crops.

Vegetation identification using remote sensing is essential for understanding terrestrial ecosystems and monitoring climate change. This technology by providing high-resolution images of the Earth's surface from satellites, aircraft, and drones has revolutionized the way scientists study and un-derstand vegetation patterns, providing information on the distribution, structure, and health of plant communities in different regions and biomes. However, identifying vegetation in multi and hyperspectral images remains a difficult, time-consuming, and costly process. Traditional methods for vegetation mapping involve the in-terpretation of spectral indices such as the Normalized Difference Vegetation Index (NDVI), alt-hough they often suffer from limitations such as manual interpretation and limited spatial resolution of satellite images. Furthermore, machine learning techniques, artificial neural networks, decision trees, support vector machines, and random forests have shown promising results in identifying and classifying vegetation cover from hyperspectral images. However, due to the need for per-son-nel with specialized expertise, their application on a large scale is still challenging. On the other hand, correlation methods between curves have emerged as powerful and simplified tool for comparing spectral signatures of hyperspectral image pixels and efficiently classifying vegetation in a study area. Pearson's correlation coefficient and spectral angle mapper are among the most common correlation methods used in vegetation mapping. These correlation methods, among many others available, offer an easily implemented and computationally efficient approach, making them particularly useful for applications in developing countries or regions with limited resources. In this article, a comparative study of correlation/distance metrics was conducted for the detection of vegetation pixels in hyperspectral images. The study allowed for the comparison of five distance and/or correlation metrics: direct correlation, cosine similarity, normalized Euclidean distance, Bray-Curtis’s distance, and Pearson correlation. The two metrics that yielded the best accuracy results in vegetation pixel detection were direct correlation and Pearson correlation. Based on the selected methods, a vegetation detection algorithm was implemented and validated on a hyper-spectral image of the Manga neighborhood in Cartagena de Indias, Colombia. The spectral library was utilized for image processing, while the numpy and scipy libraries in the Python programming language were used for the mathematical calculation of correlations. Both the study's approach and the implemented algorithm aim to serve as a reference for conducting detection studies of various material types in hyperspectral images using open-access programming platforms.

Cell-free massive multiple input multiple output (MIMO) has the potential of providing joint services including joint initial access, efficient clustering of access points (APs) and pilot allocation to user equipments (UEs) over large coverage area with reduced interference. In cell-free massive MIMO, large coverage area corresponds to provision and maintenance of scalable quality of service requirements for infinitely large number of UEs. The research in cell free massive MIMO is mostly focused on time division duplex mode due to availability of channel reciprocity which aids in avoiding feedback overhead. However, frequency division duplex (FDD) protocol still dominates the current wireless standards and the provision of angle reciprocity aids in reducing this overhead. The challenge of providing a scalable cell-free massive MIMO system in FDD setting is also prevalent, since computational complexity regarding signal processing tasks such as channel estimation, precoding/combining and power allocation, becomes prohibitively high with increase in number of UEs. In this work, we consider an FDD based scalable cell-free network with angular reciprocity and dynamic cooperation clustering approach. We have proposed scalability for our FDD cell-free and perform comparative analysis with reference to channel estimation, power allocation and precoding/combining techniques. We present expressions for scalable spectral efficiency, angle based precoding/combining schemes and provide comparison of overhead between conventional and scalable angle based estimation as well as combining schemes. Simulations confirm that the proposed scalable cell-free network based on FDD scheme outperforms the conventional matched filtering scheme based on non-scalable precoding/combiming schemes. The angle based LP-MMSE in FDD cell-free network provides 14.3% improvement in spectral efficiency and 11.11% improvement in energy efficiency compared to non-scalable MF scheme.

In actuarial practice, the modeling of total losses tied to a certain policy is a non-trivial task. Traditional parametric models to predict total losses have limitations due to complex distributional features such as extreme skewness, zero inflation, multi-modality, etc., and the lack of explicit solutions for log-normal convolution. In the recent literature, the application of the Dirichlet process mixture for insurance loss has been proposed to eliminate the risk of model misspecification biases; however, the effect of covariates as well as missing covariates in the modeling framework is rarely studied. In this article, we propose novel connections among covariate-dependent Dirichlet process mixture, log-normal convolution, and missing covariate imputation. Assuming an individual loss is log-normally distributed, we develop a log skew-normal Dirichlet process to approximate the log-normal sum. As a generative approach, our framework models the joint of outcome and covariates, which allows to impute missing covariates under the assumption of missingness at random. The performance is assessed by applying our model to several insurance datasets, and the empirical results demonstrate the benefit of our model compared to the existing actuarial models such as the Tweedie-based generalized linear model, generalized additive model, or multivariate adaptive regression spline.

Pavement friction plays a crucial role in ensuring the safety of road networks. Accurately assessing friction levels is vital for effective pavement maintenance and management strategies employed by state highway agencies. Traditionally, friction evaluations have been conducted on a case-by-case basis, focusing on specific road sections. However, this approach fails to provide a comprehensive assessment of friction conditions across the entire road network. This paper introduces a hybrid clustering algorithm, namely the combination of density-based spatial clustering of applications with noise (DBSCAN) and Gaussian mixture model (GMM), to perform pavement friction performance rating across a statewide road network. A large, safety-oriented dataset is first generated by integrating network friction and vehicle crash data based on the attributes contributing possibly to friction related crashes. One-, two-, and multi-dimensional clustering analyses, respectively, are then performed to rate pavement friction. The Chi-square test is further employed to validate and identify the practical ratings. It is shown that by effectively capturing the hidden, intricate patterns within the integrated, complex dataset and prioritizing friction-related safety attributes, the hybrid clustering algorithm can produce pavement friction ratings that align effectively with the current practices of the Indiana Department of Transportation (INDOT) in friction management.

: Glaucoma is the most common cause of blindness, which significantly reduces quality of life. Most glaucoma cases are primary glaucoma; nevertheless, many patients suffer from glaucoma caused by drugs, such as corticosteroids. A comprehensive review of the risks associated with corticosteroid-induced glaucoma is limited. Therefore, we used the Japanese Adverse Drug Event Reporting Database (JADER) published by the Pharmaceuticals and Medical Devices Agency (PMDA) to analyze the risk factors associated with glaucoma and the trends and characteristics of corticosteroid-induced glaucoma. We did not find sex or age differences associated with the onset of glaucoma. Hierarchical clustering and principal component analysis revealed that triamcinolone acetonide and betamethasone sodium phosphate, which are used around the eyes in Japan, are more likely to induce intraocular pressure (IOP) elevation compared with other corticosteroids. Increased IOP is a direct cause of glaucoma. Based on these findings, it may be necessary to limit or avoid the use of these corticosteroids.

High-precision ground point cloud data has a wide range of applications in various fields, and the separation of ground points from non-ground points is a crucial preprocessing step. Therefore, designing an efficient, accurate, and stable ground extraction algorithm is of great significance for improving the processing efficiency and analysis accuracy of point cloud data. The study area in this article was a Park in Guilin, Guangxi, China. The point cloud was obtained by utilizing the UAV platform. In order to improve the stability and accuracy of the Filter algorithm, this article proposed a triangular grid filter based on Slope Filter, found violation points by the spatial position relationship within each point in the triangulation network, improved KD-Tree-Based Euclidean Clustering, and applied it to the non-ground points extraction, this method has good accuracy, stability and achieves good results in separating ground points from non-ground points. At first, using Slope Filter to remove some non-ground points, to reduce the error of taking ground points as non-ground points; Secondly, established a triangular grid based on the triangular relationship between each point, the violation-triangle can determin through the grid, and then the corresponding violation points were found in the violation-triangle; Thirdly, according to the three-point collinear method to extract the regular points, used these points to extract the regular landmarks by KD-Tree-Based Euclidean Clustering and Convex Hull Algorithm; Finally, removed disperse points and irregular landmarks by Clustering Algorithm. In order to confirm the superiority of this algorithm, this article compared the filter effects of various algorithms on the study area and filtered the 15 sample data provided by ISPRS, and obtained an average error of 3. 46%. The results showed that the algorithm in this article have a high processing efficiency and accuracy, which can greatly improve the processing efficiency of point cloud data in practical applications.

The goal of this study is to categorize stakeholders in Internet of Things (IoT) security based on their roles in order to address the challenges associated with managing the large amount of data generated by IoT devices. With the increasing number of connected devices, the security risks also escalate, necessitating skilled stakeholders to mitigate these risks and prevent potential attacks. This study proposes a two-part approach that involves clustering stakeholders according to their responsibilities and determining relevant features to enhance decision-making. By grouping stakeholders into shared categories, the study aims to provide a more efficient and effective method for managing IoT security. The insights gained from this research will not only benefit stakeholders involved in IoT security but also assist policymakers and regulators in developing effective strategies.

We present a hierarchical reinforcement learning (RL) architecture that employs various low-level agents to act in the trading environment, i.e. the market. The highest level agent selects among a group of specialised agents, and then the selected agent decides when to sell or buy a single asset for some period. This period can be variable according to a termination function. We hypothesized that due to different market regimes, more than one single agent is needed when trying to learn from such heterogeneous data, and instead, multiple agents will perform better, with each one specialising in a subset of the data. We use $k-means$ clustering to partition the data and train each agent with a different cluster. Partitioning the input data also helps model-based RL (MBRL), where models can be heterogeneous. We also add two simple decision-making models to the set of low-level agents, diversifying the pool of available agents and thus increasing overall behaviour flexibility. We perform multiple experiments showing the strengths of a hierarchical approach and test various prediction models at both levels. We also use a risk-based reward at the high level, which transforms the overall problem into a risk-return optimization. This type of reward shows a significant reduction in risk while minimally reducing profits. Overall, the hierarchical approach shows significant promise, especially when the pool of low-level agents is highly diverse.

Nonnegative matrix factorization (NMF) has been shown to be a strong data representation technique, with applications in text mining, pattern recognition, image processing, clustering and other fields. In this paper, we propose a hypergraph regularized Lp smooth nonnegative matrix factorization (HGSNMF), by incorporating hypergraph regularization and Lp smoothing constraint terms into the standard NMF. The hypergraph regularization term can capture the intrinsic geometry structure of the high dimension space data more comprehensively than simple graph, the Lp smoothing constraint may yield a smooth and more accurate solution to the optimization problem. The updating rules are given using multiplicative update techniques, and the convergence of HGSNMF is theoretically investigated. The experimental results on four different data sets show that the proposed method has better clustering effect than the related state-of-the-art methods in the vast majority of cases.

Nonconventional luminescent materials (NLMs) that do not contain traditional aromatic chromophores are of great interest due to their unique chemical structures, optical properties and their potential applications in various areas such as cellular imaging and chemical sensing. However, most reported NLMs show weak or no emission in dilute solutions, severely limiting their applications. In this work, the dynamic hydrogen bonds were utilized to design NLMs with efficient emission in dilute solutions. To further validate the results, polymers P1 and P2 were successfully prepared and investigated. It was found that luminescence quantum efficiency of P1 and P2 at concentration of 0.1 mg/mL in water solution is 8.9 and 0.6%, respectively. The high efficiency can be attributed to the fact that polymer P1 has more intra- or intermolecular dynamic hydrogen bonds and other short interactions than P2 in dilute solutions, allowing P1 to achieve the through-space conjugation effect to increase the degree of system conjugation, restrict molecular motion, and decrease non-radiative transitions, which can effectively improve luminescence. In addition, polymer P2 exhibits the characteristics of clustering-triggered emission, excitation wavelength-dependent and concentration-dependent fluorescence properties, excellent photobleaching resistance, low cytotoxicity and selective recognition of Fe3+. This work is a preliminary study of the luminescence properties of NLMs in dilute solutions via modulating dynamic hydrogen bonds, which can be used as a semi-empirical method to design and construct novel NLMs in future.

A better understanding of background tropospheric ozone delivers multiple benefits. Robust estimates of regional background ozone assist policy makers to understand the limits to reducing ozone by controlling anthropogenic emissions alone and assist in characterising changes in the atmospheric environment and its composition. Long time series of background ozone measurements can also help quantify the influence of human activity on the global and regional atmosphere. Background tropospheric ozone measurements representative of continental air masses are however scarce in Australia, limiting our knowledge of background atmospheric composition. Here we use k-means clustering to identify a cluster of measurements from the long-term monitoring station at Oakdale, NSW which are likely to be representative of background air. The cluster is associated with NOx-limited air masses of continental origin. From this analysis we estimate background ozone representative of Eastern Australia. We find recent (2017-2022) mean ozone mixing ratios of 28.5 ppb and identify a statistically significant (α=0.05) trend in the mean of +1.8 (1.0 – 2.8) ppb/decade. Our methods demonstrate that some long-term monitoring stations within or near urban areas can provide suitable conditions and datasets for regional Global Atmosphere Watch monitoring.

In today's world, news events are emerging incessantly. Classifying the same event reported by different countries is of significant importance for public opinion control and intelligence gathering. Due to the diverse types of news, relying solely on translators would be costly and inefficient, while depending solely on translation systems would incur considerable performance overheads in invoking translation interfaces and storing translated texts. To address this issue, we mainly focus on the clustering problem of cross-lingual news. To be specific, we use a combination of sentence vector representations of news headlines in a mixed semantic space and the topic probability distributions of news content to represent a news article. In the training of cross-lingual models, we employ knowledge distillation techniques to fit two semantic spaces into a mixed semantic space. We abandon traditional static clustering methods like K-Means and AGNES in favor of the incremental clustering algorithm Single-Pass, which we further modify to better suit cross-lingual news clustering scenarios. Our main contributions are as follows: (1) We adopt the English standard BERT as the teacher model and XLM-Roberta as the student model, training a cross-lingual model through knowledge distillation that can represent sentence-level bilingual texts in both Chinese and English. (2) We use the LDA topic model to represent news as a combination of cross-lingual vectors for headlines and topic probability distributions for content, introducing concepts such as topic similarity to address the cross-lingual issue in news content representation. (3) We adapt the Single-Pass clustering algorithm for the news context to make it more applicable. Our optimizations of Single-Pass include adjusting the distance algorithm between samples and clusters, adding cluster merging operations, and incorporating a news time parameter.

Commercial banks usually classify customers according to their credit reports when making loans. In this study, we put our focus on classifying customers based on their credit reports from the People's Bank of China (PBC). Since there are no target labels of users in the credit report of the People's Bank of China, we put forward the fuzzy clustering method for the initial label, and then Construct ant colony search to optimize intelligent recognition. Finally, this study uses SVM, BP neural network, and random forest to classify users and compare their results. The research re-sults indicate that using ant colony clustering algorithm and random forest for classification is the most effective method with the PBC credit reports.

Video behavior recognition often needs to focus on object motion processes. In this work, a self-organizing computational system oriented to behavioral clustering recognition is proposed, which achieves the extraction of motion change patterns by binary encoding and completes motion pattern summarization using a similarity comparison algorithm. And in the face of unknown behavioral video data, a self-organizing structure with layer-by-layer accuracy progression is used to achieve motion law summarization by using a multi-layer agent design approach. Finally, the real-time feasibility is verified in the prototype system using real scenes to provide a new feasible solution for unsupervised behavior recognition and space-time scenes.

The notion of luck clustering has gained traction in recent years due to its potential influence on performance and decision-making across a range of domains. This study concentrates on the application of luck clustering in sports, with an emphasis on its consequences for performance metrics and strategic decision-making. We employ time series analysis to investigate the presence of luck clustering in sports data, such as win-loss records, scoring, and player rankings, while considering the role of the Principle of Luck Conservation in the observed clustering patterns. Our findings provide evidence of luck clustering in sports, implying that periods of high luck tend to be followed by more high luck events, and vice versa for low luck events. These insights carry significant implications for coaches, players, and teams, who can utilize the understanding of luck clustering to develop more effective strategies, manage resources efficiently, and ultimately enhance their performance. By enriching our comprehension of luck's nature and its effects on sports outcomes, this study contributes valuable knowledge for practitioners and researchers in sports analytics and performance management.

The safe and reliable operation of autonomous vehicles in complex and dynamic environments is heavily dependent upon exteroceptive and proprioceptive sensors. A LiDAR system generates accurate 3D point clouds, which are crucial for the detection, classification, and tracking of multiple targets. LiDAR data, however, presents significant challenges due to its density, noise, and varying sampling rates. In this study, various clustering and MTT techniques for LiDAR point clouds will be identified and classified within the context of autonomous driving to assess the state-of-the-art methods’ key challenges and their performances. We have categorized clustering and MTT methods used in AV applications, identified research gaps and challenges and analyzed existing algorithms and their challenges in detail. Researchers and practitioners in the field of autonomous driving will find this review to be a valuable resource.

Examining the similarity of event environments or surroundings, more precisely settings, provides additional insight in analyzing event sequences as it provides information about the context and potential common factors that may have influenced them. This article proposes a new similarity measure for event setting sequences, which involve the space and time in which events occur. While similarity measures for spatiotemporal event sequences have been studied, the settings and setting sequences have not yet been studied. While modeling event setting sequences we consider spatial and temporal scales to define the bounds of the setting and incorporates dynamic variables alongside static variables. Using a matrix-based representation and an extended Jaccard index we developed new similarity measures that allow for the use of all variable data types. We successfully used these similarity measures coupled with other multivariate statistical analysis approaches in a case study involving setting sequences and pollution event sequences associated with the same monitoring stations, which validate the hypothesis that more similar spatial-temporal settings or setting sequences may generate more similar events or event sequences. In conclusion, these similarity measures have many potential real-world applications, and offer researchers a powerful tool for understanding different factors and their dynamics corresponding to occurrences of spatiotemporal event sequences.

Recently, the Integrated Air Defense System (IADS) has become vital for the defense system as the military defense system is vital for national security. Placing Integrated Air Defense System batteries among locations to protect locations assets is a crucial problem because optimal solutions are needed for interceptor missiles to intercept attacker missiles for maximizing protection of assets across locations or places. In this research, the procedures of using network algorithms along with developing several network algorithms are going to be demonstrated to develop a model for sequential development of seven network securing strategies of placing Surface to Air Missile (SAM) batteries to maximize the protection of assets across locations (based on given asset values) by generating optimal solutions through computation to destroy maximum attacker missiles by using minimum interceptor missiles with given intercept probability. This network securing strategies can be implemented not only for Integrated Air Defense System (IADS) planning but also Counter Air (CA) planning as Integrated Air Defense System (IADS) is conducted with defensive counter air supported by attack operations in offensive counter air.

In recent decades, the Variational AutoEncoder (VAE) model has shown good potential and capabilities in image generation and dimensionality reduction. The combination of VAE and various machine learning frameworks has also worked effectively in different daily life applications, however its possibility and effectiveness in modern game design has seldom been explored nor assessed. The use of its feature extractor for data clustering was minimally discussed in literature neither. This paper first attempts to explore different mathematical properties of the VAE model, in particular, the theoretical framework of the encoding and decoding processes, the possible achievable lower bound and loss functions of different applications; then applies the established VAE model into generating new game levels within two well-known game settings; as well as validating the effectiveness of its data clustering mechanism with the aid of the Modified National Institute of Standards and Technology (MNIST) database. Respective statistical metrics and assessments were also utilized for evaluating the performance of the proposed VAE model in aforementioned case studies. Based on the statistical and spatial results, several potential drawbacks and future enhancement of the established model were outlined, with the aim of maximizing the strengths and advantages of VAE for future game design tasks and relevant industrial missions.

Traveling salesman problems (TSPs) are well-known combinatorial optimization problems, and most existing algorithms are challenging for solving TSPs when its scale is large. To improve the efficiency of solving large-scale TSPs, this work presents a novel adaptive layered clustering framework with improved genetic algorithm (ALC\_IGA). The primary idea behind ALC\_IGA is to break down a large-scale problem into a series of small-scale problems. First, the $k$-means and improved genetic algorithm are used to segment the large-scale TSPs layer by layer and generate the initial solution. Then, the developed two phases simplified $2$-opt algorithm is applied to further improve the quality of the initial solution. The analysis reveals that the computational complexity of the ALC\_IGA is between $O(n\log n)$ and $O(n^2)$. The results of numerical experiments on various TSP instances indicate that, in most situations, the ALC\_IGA surpasses the state-of-the-art algorithms in convergence speed, stability, and solution quality. Specifically, the ALC\_IGA can solve instances with $2 \times 10^5$ nodes within 0.15h, $1.4 \times 10^6$ nodes within 1h, and $2 \times 10^6$ nodes in three dimensions within 1.5h.

Mobile phones have become an integral part of our lives in the last two decades, leaving a digital trace of our activities and communication. This study aims to develop a data processing framework to evaluate human mobility and socioeconomic status based on call detail records. The methodology proposed first calculates radius of gyration and entropy for each user, then estimates the socioeconomic status by the price and age of the subscribers' phones. Finally, an unsupervised machine learning algorithm was used to group the cells into clusters based on their mobility and socioeconomic metrics. The research showed differences between Buda and Pest during a large scale social event using mobile phone ages and prices. Additionally, the clustering results revealed homogenous groups of cells around Budapest, with similar mobility and socioeconomic metrics. The main conclusion is that mobile network data combined with mobile phone properties offer a useful tool for characterising urban mobility and socioeconomic status.

The exploration of heath data by clustering algorithms allows to better describe the populations of interest by seeking the sub-profiles that compose it. This therefore reinforces medical knowledge, whether it is about a disease or a targeted population in real life. Nevertheless, contrary to the so-called conventional biostatistical methods where numerous guidelines exist, the standardization of data science approaches in clinical research remains a little discussed subject. This results in a significant diversity in the execution of data science projects, whether in terms of algorithms used, reliability and credibility of the designed approach. Taking the path of parsimonious and judicious choice of both algorithms and implementations at each stage, this paper proposes Qluster, a practical workflow for performing clustering tasks. Indeed, this workflow makes a compromise between (1) genericity, as it is suitable regardless of the data volume (small/big) and regardless of the nature of the variables (continuous/qualitative/mixed), (2) ease of implementation, as it is based on few easy-to-use software packages, and (3) robustness, through the stability evaluation of the final clusters and through recognized algorithms and implementations. This workflow can be easily automated and/or routinely applied on a wide range of clustering projects. A synthesis of the literature on data clustering as well as the scientific rationale supporting the proposed workflow is also provided. Finally, a detailed application of the workflow on a concrete use case is provided, along with a practical discussion for data scientists. An implementation on the Dataiku platform is available upon request to the authors.

Herein, a chemophenetic significance, based on phenolic metabolite profiling of three Senecio (S. hercynicus, S. ovatus and S. rupestris) and two Jacobaea species (J. pancicii and J. maritima) coupled to morphometric data, is presented. A set of twelve morphometric characters were recorded from each plant species and used as predictor variables in a Linear Discriminant Analysis (LDA) model. From a total 75 observations (15 from each of the five species), the model correctly assumed their species' membership, except 2 observations. Among the studied species, S. hercynicus and S. ovatus presented the greatest morphological similarity. A phytochemical profiling of phenolic specialized metabolites by UHPLC-Orbitrap-HRMS revealed 46 hydroxybenzoic, hydroxycinnamic, acylquinic acids and their derivatives, 1 coumarin, and 21 flavonoids. Hierarchical and PCA clustering applied to the phytochemical data corroborated the similarity of S. hercynicus and S. ovatus, observed in the morphometric analysis. This study contributes to the phylogenetic relationships between the tribe Senecioneae taxa and highlights the chemophenetic similarity/dissmilarity of the studied species belonging to Senecio and Jacobaea genera.

The characteristics of the eddy mass transport are estimated depending on the values of the parameters of a large-scale flow that forms under the conditions of the shelf seas in the Arctic. For this, the results of numerical simulation of the Kara Sea with a horizontal resolution permitting the development of mesoscale eddies are used. The parameters resulting from numerical experiment are considered as a statistical sample and are analyzed using methods of sensitivity study and clustering of sample elements. Functional dependencies are obtained that are closest to the simulated distributions of quantities. These expressions make it possible, within the framework of large-scale models, to evaluate the characteristics of the cross-isobatic eddy mass transport in the diffusion approximation with a counter-gradient flux. Numerical experiments using the SibCIOM model showed that areas along the Fram branch of the Atlantic waters trajectory in the Arctic as well as the shelf of the East Siberian and Laptev seas with adjacent deep water areas are most sensitive to proposed parameterization of eddy exchanges. Accounting for counter-gradient eddy fluxes turned out to be less important.

The agricultural sector in Palestine has a significant role in its economy. However, the production of this sector is affected by different kinds of plant diseases, specifically leaf diseases. Automatic agricultural leaf disease detection is essential for the early diagnosis and controls the overall health of fields. Image segmentation techniques, clustering, and deep learning are often used to detect diseased leaves. This study proposes a novel hybrid approach based on image classification. The hybrid approach combines the k-means clustering algorithm with Convolutional Neural Network (CNN), where k-means is used to detect the leaf’s infected area, then CNN is used for specifying the disease. We used the PlantVillage dataset for experimental verification as it contains several crops with different kinds of challenging diseases. We also examined the selection of optimal k-value using the Silhouette coefficient, Elbow method, and Kneedle Algorithm. The Silhouette technique was analyzed using three distance metrics; Euclidean, Manhattan, and Cosine. Its scores for the three-distance metrics were low, near-zero, and failed to produce the optimum k value. Besides, the Elbow method was complicated to use in image segmentation in terms of executing and visualizing the k value in its graph plot. Based on verification results, the Kneedle Algorithm produced better results in the consistency of choosing the optimal k value and showed superiority over other approaches. Therefore, the processed images were segmented with the k-means clustering algorithm with a Kneedle algorithm-based k value. Finally, a Convolutional Neural Network (CNN) is trained to classify the type of disease based on analyzing and testing leaf images. The hybrid model achieved high accuracy of 93.79% in disease identification, confirming the proposed model’s robustness.

As a model for economic and ecological systems, replicator dynamics represents a basic form of agent competition for finite resources. Here, we investigate the effects of stochastic resetting in this kind of processes. Random reset events abruptly lead individual resources to a small value from which dynamics must start anew. Numerical results show that resource distribution over the population of competing agents develops highly nonuniform profiles, exhibiting clustering and fluctuations with anomalous dependence on the population size. This non-standard statistical behavior jeopardizes an analytical treatment based on mean-field assumptions. We propose alternative simplified analytical approaches which provide a stylized description of entropy evolution for the clustered distribution of resources and explain the unusually slow decrease of fluctuations.

The increasing number of people living with Long COVID requires the development of more personalized care, as for now limited treatment options and rehabilitation programs adapted to the variety of Long COVID presentations are available. Our objective was to design an easy-to-use Long COVID classification to help stratifying people with Long COVID. Individual characteristics and a detailed set of 62 self-reported persisting symptoms together with quality of life indexes 12 months after initial COVID-19 infection were collected in a cohort of SARS-CoV-2 infected people in Luxembourg. A hierarchical ascendant classification (HAC) was used to identify clusters of people. We identified 3 patterns of Long COVID symptoms with a gradient in disease severity. Cluster-Mild encompassed almost 50% of the study population and was composed of participants with less severe initial infection, fewer comorbidities, and fewer persisting symptoms (mean=2.9). Cluster-Moderate was characterized by a mean of 11 persisting symptoms and a poor sleep and respiratory quality of life. Cluster-Severe was characterized by a higher proportion of women and smokers as in the other clusters, with a higher number of Long COVID symptoms, in particular of vascular, urinary, and skin symptoms. Our study evidenced that Long COVID can be stratified in 3 sub-categories in terms of severity. If replicated in other populations, this simple classification will help clinicians to personalize the care of people with Long COVID.

Multilabel learning goes beyond standard supervised learning models by associating a sample with more than one class label. Among the many techniques developed in the last decade to handle multilabel learning best approaches are those harnessing the power of ensembles and deep learners. This work proposes merging both methods by combining a set of gated recurrent units, temporal convolutional neural networks, and long short-term memory networks trained with variants of the Adam optimization approach. We examine many Adam variants, each fundamentally based on the difference between present and past gradients, with step size adjusted for each parameter. We also combine Incorporating Multiple Clustering Centers and a bootstrap-aggregated decision trees ensemble, which is shown to further boost classification performance. In addition, we provide an ablation study for assessing the performance improvement that each module of our ensemble produces. Multiple experiments on a large set of datasets representing a wide variety of multilabel tasks demonstrate the robustness of our best ensemble, which is shown to outperform the state-of-the-art. The MATLAB code for generating the best ensembles in the experimental section will be made available at https://github.com/LorisNanni.

Extensive growth in the volume of irregular brain cells is known as brain tumor. Human brain is surrounded by stiff skull. There are various issues that occur due to the growth of any tumor inside this restricted space. The malignant and benign are two main categories of the brain tumor. The skull is pressurized to enlarge from inside in case of growth of any benign or malignant tumor. This tumor leads to harm in brain and it may be dangerous to life also. The brain tumor is divided into two kinds - primary or secondary. The brain tumor detection techniques have various phases. In this paper, comparative study of CNN with GLCM approach and superpixel based spectral clustering is done tumor. This work takes into account metrics like accuracy, sensitivity and specificity for drawing the comparison between both the techniques.

In this paper, a new method is proposed to detect traffic regulations at intersections using GPS traces. The knowledge of traffic rules of regulated locations can help various location-based applications in the context of Smart Cities, such as the accurate estimation of travel time and fuel consumption from a starting point to a destination. Traffic regulations as map features, however, are surprisingly still largely absent from maps, although they do affect traffic flow which in turn affects vehicle idling time at intersections, fuel consumption, CO_2 emissions and arrival time. In addition, mapping them using surveying equipment is costly and any update process has severe time constraints. This fact is precisely the motivation for this study. Therefore, its objective is to propose an automatic, fast, scalable and inexpensive way to identify the type of intersection control (e.g. traffic lights, stop signs). A new method based on summarizing the collective behavior of vehicles crossing intersections is proposed. A modification of a well-known clustering algorithm for detecting stopping and decelerating events is presented. These detected events are then used to categorize vehicle crossing of intersections into four possible traffic categories (p1: free flow, p2: deceleration without stopping events, p3: only one stopping event, p4: more than one stopping event). The percentages of crossings of each class per junction arm, together with other speed/stop/deceleration features, extracted from trajectories, are then used as features to classify the junction arms according to their traffic control type dynamic model). The classification results of the dynamic model are compared with those of the static model, where the classification features are extracted from OpenStreetMap. Finally, a hybrid model is also tested, where a combination of dynamic and static features is used, which outperforms the other two models. For each of the three models, two variants of the feature vector are tested: one where only features associated with a single junction arm are used (one-arm model) and another where features also from neighbouring junction arms of the same junction are used to classify an arm (all-arm model). The methodology was tested on three datasets and the results show that all-arm models perform better than single-arm models with an accuracy of 94\% to 97\%.

Context: Anomaly detection in a data center is a challenging task, having to consider different services on various resources. Current literature shows the application of artificial intelligence techniques to either log files or monitoring data: the former created by services at run time, while the latter produced by specific sensors directly on the physical or virtual machine. Objectives: We propose a model that exploits information both in log files and monitoring data to identify patterns and detect anomalies over time. Methods: The key idea is to use on one side natural language processing solutions to detect problems at service level, extracting words that represent anomalies. Clustering and topic modeling techniques have been used to identify patterns and group them with respect to topics. On the other side time series anomaly detection technique has been applied to sensors data in order to combine problems found in the log files with problems stored in the monitoring data. Results: We have tested our approach on a real data center equipped with log files and monitoring data that can characterize the behaviour of physical and virtual resources in production. We have observed a correspondence between anomalies in log files and monitoring data, e.g. an increase in memory usage or machine load. The results are extremely promising. Conclusion: Our model requires to integrate site administrators' expertise in order to consider all critical scenario in the data center and understand results properly.

This article presents an estimation of the hypertension risk based on a dataset on 1007 individuals. The application of a Tobit Model shows that “Hypertension” is positively associated to “Age”, “BMI-Body Mass Index”, and “Heart Rate”. The data show that the element that has the greatest impact in determining inflation risk is “BMI-Body Mass Index”. An analysis was then carried out using the fuzzy c-Means algorithm optimized with the use of the Silhouette coefficient. The result shows that the optimal number of clusters is 9. A comparison was then made between eight different machine-learning algorithms for predicting the value of the Hypertension Risk. The best performing algorithm is the Gradient Boosted Trees Regression according to the analyzed dataset. The results show that there are 37 individuals who have a predicted hypertension value greater than 0.75, 35 individuals who have a predicted hypertension value between 0.5 and 0.75, while 227 individuals have a hypertension value between 0.0 and 0.5 units.

This article identifies promising research areas on the PETROLEUM SCIENCE topic via bibliometric analysis of the 2018-2021 publications in the highly cited Journal of Petroleum Science and Engineering, which is included in the Journal Citation Reports Section: ENERGY & FUELS — Q2 Quartile, ENGINEERING, PETROLEUM — Q1 Quartile. Bibliometric metadata from Web of Science were used for 866 articles in 2018, 1,142 — in 2019, 1,138 — in 2020, and 1,832 in 2021. The clustering of articles was performed using the texts of the Title, Abstract, Keywords, and Keywords Plus fields. The demo version of the Lingo3G algorithm was used. For the two major clusters, the most promising research topics were determined by comparing the titles of the 350 most cited and 350 least cited articles for each year. The hypothesis that low-cited papers often have the same subject matter as high-cited papers of previous years is discussed.

Brain tissue segmentation is an important component of clinical diagnosis of brain diseases by means of multi-modal magnetic resonance imaging (MR). Brain tissue segmentation is developed by many unsupervised methods in literature. The most commonly used unsupervised methods are: K-Means, Expectation Maximization and Fuzzy Clustering. Fuzzy clustering methods offer considerable benefits compared with the aforementioned methods as they are capable of handling brain images which are complex, largely uncertain and imprecise in nature. However, this approach suffers from the intrinsic noise and intensity inhomogeneity (IIH) in the data resulted from the acquisition process. To resolve these issues, we propose a fuzzy consensus clustering algorithm that defines a membership function resulted from a voting schema to cluster the pixels. In particular, we first pre-process the MRI data and employ several segmentation techniques based on traditional fuzzy sets and intuitionistic sets. Then, we adopted a voting schema to fuse the results of the applied clustering methods. Finally, to evaluate the proposed method, we used the well-known performance measures (boundary measure, overlap measure and volume measure) on two publicly available datasets (OASIS and IBSR18). The experimental results show the superior performance of the proposed method in comparison with the recent state of the arts.

The article presents a bibliometric analysis of conference proceedings 2019-2021 indexed in Scopus and related to the topic "Artificial Intelligence and Energy". The relevance of the topic is considered in the context of the energy transition and the application of artificial intelligence for the rational use of energy resources. A comparative analysis of the publication activity of researchers from Russia, China, India, the United States, and Indonesia on the topic in question is given. Methodologically, the emphasis for determining the subject is not on the co-occurrence of keywords, but on the clustering of documents based on the thesis that the titles of publications most briefly and fully reveal the content of the publication and allow the subject specialist to do a relevant selection of publications necessary for their research. Two tools were used in this work: Carrot2 and Clustering App (CSV Explorer). It is shown that Russian researches are characterized by the tendency of prevailing engineering problems and insufficient attention is paid to environmental, economic and social problems of using AI in the energy sector. Studies from China and the United States are of the greatest informative interest, both in terms of the relevance of their topics and the actuality of their content. Studies from India and Indonesia are more general in nature; of interest are the efforts of these countries to engage in global scientific activities.

Premature ventricular contraction (PVC) is one of the common ventricular arrhythmias, which may cause stroke or sudden cardiac death. Automatic long-term electrocardiogram (ECG) analysis algorithms could provide diagnosis suggestion even early warning for physicians, however, they are mutually-exclusive in terms of robustness, generalization and low complexity. In this study, a novel PVC recognition algorithm that combines deep learning-based heartbeat template clusterer and expert system-based heartbeat classifier is proposed. Long short-term memory-based auto-encoder (LSTM-AE) network was used to extract features from ECG heartbeats for K-means clustering. Thus, the templates were constructed and determined based on clustering results. Finally, the PVC heartbeats were recognized based on a combination of multiple rules, including template matching and rhythm characteristics. Three quantitative parameters, sensitivity (Se), positive predictive value (P+) and accuracy (ACC), were used to evaluate the performances of the proposed method on the MIT-BIH Arrhythmia database and the St. Petersburg Institute of Cardiological Technics database. Se on the two test databases was 87.51% and 87.92%, respectively; P+ was 92.47% and 93.18%, respectively; and ACC was 98.63% and 97.89%, respectively. The PVC scores on the 3rd China Physiological Signal Challenge 2020 training set and hidden test set were 36,256 and 46,706, respectively, which could rank first in the open-source codes. The results showed that the combination strategy of expert system and deep learning can provide new insights for robust and generalized PVC identification from long-term single-lead ECG recordings.

Positron-emission tomography is powerful but costly tool for various medical investigations. In particular, it is used in Parkinson’s disease and essential tremor diagnostics. However, yet there is no standardized figures of the references, for it. We examined the PET efficiency for the analysis of development and degradation of dophaminergic neurons in Parkinson’s disease. The informative indices are determined from the observed PET data. Also, high efficiency of PET for Parkinson’s disease as approved.

A comprehensive presentation of a variety of biologically sounding properties of genomes is present; chloroplast genomes are used as a biological matter. Triplet frequency composition is the general issue standing behind the properties. Besides, the new alignment-free error-tolerant method of sequences comparison highly efficient for in/del mismatches is present, for transposons search. Triplet frequency dictionaries determined for a genome, or for a part of that latter were studied through various clustering techniques. The interplay between triplet composition and function reveals on tRNA genes unambiguously shows the prevalence of the function encoded in tRNA gene over the phylogeny: the genes gather into the clusters comprising the genes encoding the same amino acid; more exactly, few gene families exhibit fine cluster pattern corresponding the synonymous codons of amino acid. Previously reported symmetry in chloroplast genomes is shown for a set of gymnosperm: that is mirror symmetry, rotational symmetry, and the second Chargaff's parity rule asymmetry. A family of transposons was found in gymnosperm chloroplast genomes. This family is revealed through the novel comparison method based on convolution calculation, for a set of DNA sequences.

This paper describes a stochastic clustering architecture that is used in the paper for making predictions over energy data. The design is discrete, localised optimisations based on similarity, followed by a global aggregating layer, which can be compared with the recent random neural network designs, for example. The topic relates to the IDEAS Smart Home Energy Project, where a client-side Artificial Intelligence component can predict energy consumption for appliances. The proposed data model is essentially a look-up table of the key energy bands that each appliance would use. Each band represents a level of consumption by the appliance. This table can replace disaggregation from more complicated methods, usually constructed from probability theory, for example. Results show that the table can accurately disaggregate a single source to a set of appliances, because each appliance has quite a unique energy footprint. As part of predicting energy consumption, the model could possibly reduce costs by 50% and more than that if the proposed schedules are also included. The hyper-grid has been changed to consider rows as single units, making it more tractable. A second case study considers wind power patterns, where the grid optimises over the dataset columns in a self-similar way to the rows, allowing for some level of feature analysis.

Titanium dioxide nanoparticles have risen concerns about their possible toxicity and the European Food Safety Authority recently banned the use of TiO2 nano-additive in food products. Following the intent of relating nanomaterials atomic structure with their toxicity without having to conduct large scale experiments on living organisms, we investigate the aggregation of titanium dioxide nanoparticles using a multi-scale technique: starting from ab initio Density Functional Theory to get an accurate determination of the energetics and electronic structure, we switch to classical Molecular Dynamics simulations to calculate the Potential of Mean Force for the connection of two identical nanoparticles in water; the fitting of the latter by a set of mathematical equations is the key for the upscale. Lastly, we perform Brownian Dynamics simulations where each nanoparticle is a spherical bead. This coarsening strategy allows studying the aggregation of a few thousand nanoparticles. Applying this novel procedure, we find three new molecular descriptors, namely, the aggregation free energy and two numerical parameters used to correct the observed deviation from the aggregation kinetic described by the Smoluchowski theory. Molecular descriptors can be fed into QSAR models to predict the toxicity of a material knowing its physicochemical properties, without having to conduct large scale experiments on living organisms.

Time series data are significant and are derived from temporal data, which involve real numbers representing values collected regularly over time. Time series have a great impact on many types of data. However, time series have anomalies. We introduce hybrid algorithm named novel matrix profile (NMP) to solve the all-pairs similarity search problem for time series data. The proposed NMP inherits the features from two state-of-the art algorithms: similarity time-series automatic multivariate prediction (STAMP), and short text online microblogging protocol (STOMP). The proposed algorithm caches the output in an easy-to-access fashion for single- and multidimensional data. The proposed NMP algorithm can be used on large data sets and generates approximate solutions of high quality in a reasonable time. The proposed NMP can also handle several data mining tasks. It is implemented on a Python platform. To determine its effectiveness, it is compared with the state-of-the-art matrix profile algorithms i.e., STAMP and STOMP. The results confirm that the proposed NMP provides higher accuracy than the compared algorithms.

Software reliability is an important characteristic for ensuring the qualities of software products. Predicting the potential number of bugs from the beginning of a development project allows practitioners to make the appropriate decisions regarding testing activities. In the initial development phases, applying traditional software reliability growth models (SRGMs) with limited past data does not always provide reliable prediction result for decision making. To overcome this, herein we propose a new software reliability modeling method called deep cross-project software reliability growth model (DC-SRGM). DC-SRGM is a cross-project prediction method that uses features of previous projects’ data through project similarity. Specifically, the proposed method applies cluster-based project selection for training data source and modeling by a deep learning method. Experiments involving 15 real datasets from a company and 11 open source software datasets show that DC-SRGM can more precisely describe the reliability of ongoing development projects than existing traditional SRGMs and the LSTM model.

The aim of this work is to explain the behaviour of the multiresistance percentage of Pseudomona aeruginosa in some countries of Europe through a multivariate statistical analysis and machine learning validation, using data from the European Antimicrobial Resistance Surveillance System, the World Health Organization and the World Bank. First, we will use a descriptive analysis and a principal components analysis. Then, we use a k-means clustering to determine the countries and regions that are most affected by the antibiotic resistance. Second, we expand the database by adding some socioeconomic, governance and antibiotic-consumption variables. We then run a data panel regression analysis to determine some functions that relates the multiresistance percentage with those new variables. Finally, we use machine learning techniques to validate a pooling panel data case, using XGBoost and random forest algorithms. The results of the data panel analysis indicate that the most important variables for the multiresistance percentage are corruption control and the rule of law. Similar results are found with the machine learning validation analysis, where the human development index is an additional important variable for the multiresistance percentage.

In this paper we formally define the hierarchical clustering network problem (HCNP) as the problem to find a good hierarchical partition of a network. This new problem focuses on the dynamic process of the clustering rather than on the final picture of the clustering process. To address it, we introduce a new hierarchical clustering algorithm in networks, based on a new shortest path betweenness measure. To calculate it, the communication between each pair of nodes is weighed by the importance of the nodes that establish this communication. The weights or importance associated to each pair of nodes are calculated as the Shapley value of a game, named as the linear modularity game. This new measure, (the node-game shortest path betweenness measure), is used to obtain a hierarchical partition of the network by eliminating the link with the highest value. To evaluate the performance of our algorithm, we introduce several criteria that allow us to compare different dendrograms of a network from two point of view: modularity and homogeneity. Finally, we propose a faster algorithm based on a simplification of the node-game shortest path betweenness measure, whose order is quadratic on sparse networks. This fast version is competitive from a computational point of view with other hierarchical fast algorithms, and, in general, it provides better results.