The $k$-means problem is to compute a set of $k$ centers (points) that minimizes the sum of squared distances to a given set of $n$ points in a metric space. Arguably, the most common algorithm to solve it is $k$-means++ which is easy to implement, and provides a provably small approximation factor in time that is linear in $n$. We generalize $k$-means++ to support: (i) non-metric spaces and any pseudo-distance function. In particular, it supports M-estimators functions that handle outliers, e.g. where the distance $\mathrm{dist}(p,x)$ between a pair of points is replaced by $\min {\mathrm{dist}(p,x),1}$. (ii) $k$-means clustering with $m\geq 1$ outliers, i.e., where the $m$ farthest points from the $k$ centers are excluded from the total sum of distances. This is the first algorithm whose running time is linear in $n$ and polynomial in $k$ and $m$.

Hyper spectral imaging (HSI) is a technique that is used to obtain the spectrum for each pixel in the image. It helps in finding objects and identifying materials etc. Such an identification is very difficult using other imaging techniques. It allows the researchers to investigate the documents without any physical contact. Nowadays detection of unequal Ink mismatch based on HSI has shown vast improvement in distinguishing the inks. Detection of unequal Ink mismatch is an unbalanced clustering problem. This paper used K-means Clustering for ink mismatch detection. K-means Clustering find same subgroups in the data based on Euclidean distance. This paper demonstrates performance in unequal Ink mismatch based on HSI.

Various type of soils have been identified based on their electrical and magnetic properties, especially with regards to peat soils. Peat soils are commonly considered as partly decomposed vegetation. In this study, electrical and magnetic properties have been used in K-means clustering to identify layers of peat soils. K-means clustering is a partitioning method that treats observations in the data. Data cores were obtained at every centimeter and examined for their electrical conductivity (σ) and magnetic susceptibility (χ_m) properties. A 291 cm core was obtained at Tegal Arum Village in South Kalimantan, Indonesia. The K-means clustering results indicate two different layers at 148 cm, and this is supported by loss on ignition (LOI) measurements. In the first layers, a 87.65% LOI was found associated with peat soils (above 248 cm). Whereas, in the second layers, there was a 26.11% LOI associated with mineral soils (below 248 cm). The results of this study using K-means clustering can be used to delineate soil layers.

Myocarditis is the form of an inflammation of the middle layer of the heart wall which is caused by a viral infection and can affect the heart muscle and its electrical system. It has remained as one of the most challenging diagnoses in cardiology. Myocardial is the prime cause of unexpected death in approximately 20% of adults less than 40 years of age. Cardiac MRI (CMR) has been considered as a noninvasive and golden standard diagnostic tool for suspected myocarditis and plays an indispensable role in diagnosing various cardiac diseases. However, the performance of CMR is heavily dependent on the clinical presentation and non-specific features such as chest pain, arrhythmia, and heart failure. Besides, other imaging factors like artifacts, technical errors, pulse sequence, acquisition parameters, contrast agent dose, and more importantly qualitatively visual interpretation can affect the result of the diagnosis. This paper introduces a new deep learning-based model called Convolutional Neural Network-Clustering (CNN-KCL) to diagnose the Myocarditis. The hybrid CNN-KCL method performs the early and accurate diagnosis of Myocarditis. To the best-of-our-knowledge, a Convolutional neural network has never been used before for the diagnosis of Myocarditis. In this study, we used 47 subjects to diagnose myocarditis patients from Tehran's Omid Hospital. The total number of data examined is 10425. Our results demonstrate that CNN-KCL achieves 92.3% in terms of diagnosis myocarditis prediction accuracy which is significantly better than those reported in previous studies.

The power system has rapidly grown and expanded over the past decades and has been experiencing major changes and challenges. The increase in energy demand and the modern advancements in the smart grid, such as solar and wind energies and electric vehicles, have led to complexity and complications for utilities. A further layer of complexity and difficulty was added by the rapid expansion of behind-the-meter (BTM) photovoltaic (PV) systems with various designs and characteristic features. The rapid increase and the invisible solar power (BTM) have led to fluctuations in power grid stability and reliability and to inefficiency. Accurate forecasting of load generation will help to assure optimal planning, minimize the negative effects of the PV systems, and minimize the operational and maintenance costs. The authors propose a solution that uses combinations of K-means clustering with neural network machine learning models, AMI real-world PV load generation, and weather data to forecast the generation load at customer locations to achieve a 2.49% error between actual and predicted generation load.

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.

The determination and classification of seafloor sediment types are crucial for the exploitation of marine resources, construction of marine engineering, and maintenance of marine ecological en-vironments. Automatic classification of seafloor sediment based on acoustic telemetry data is an important method to quickly understand the type of a large range of sediment. Currently, most studies on sediment classification are based on multi-beam backscattering intensity data, which is a relatively single data type. Besides, the low-dimensional details of standard U-Net gradually weaken in the propagation process, limiting the accuracy of sediment classification. Therefore, this study proposes an automatic classification method of seafloor sediment types based on an im-proved U-Net and K-means clustering algorithm, using multi-beam water depth, sub-bottom profile, and sample test data in the Northern Slope of the South China Sea. Six sediment types, including gravelly muddy sand, sand, silty sand, less muddy silt, muddy silt, and silty mud, were identified in the study area. Additionally, the study area was divided into four sedimentary en-vironment zones, including the shelf sedimentary area, the upper shelf slope break sedimentary area, the lower shelf slope break mixed sedimentary area, and the slope deposition area, based on the results of sediment classification and geological background. The sedimentary environment zones were found to be distributed along the trend of the shelf slope break line. The results of this study not only provide an important supplement to the existing classification methods of seafloor sediments but also contribute to the understanding of the sedimentary environment and process of the Northern Slope of the South China Sea.

Optimal planning and design of microgrids is a priority for electrification of off-grid areas. Indeed, according to one of the Sustainable Development Goals (SDG) 7, the UN recommends universal access to electricity for all but, at the lowest cost. To achieve this goal, several optimization methods with different strategies have been proposed in the literature. This paper proposes a microgrid installation and planning model based on a combination of several techniques. Python 3.10, the programming language, has been used in conjunction with machine learning techniques such as unsupervised learning based on K-means clustering and deterministic optimization methods based on mixed linear programming. These methods were complemented by the open-source spatial method for optimal electrification planning: onsset. The results obtained enabled us to simulate the model obtained, with a cluster considered as a case study, based on the elbow and k-means clustering method; then, in a second phase, to size the microgrid with a capacity of 40 kW, by optimizing all the resources available on the site: the example of the various resources in the case of Togo was considered (solar, wind, hydropower). This study therefore highlighted the optimal resources obtained by integrating battery systems by the optimization model formulated on the basis of the various technology costs, such as investment, maintenance and operating costs, based on the technical limits of the various technologies. For the optimum results obtained, solar systems account for 80% of the maximum load considered, compared with 7.5% for wind systems and 12.5% for battery systems. Next, an optimal microgrid connection model was proposed, based on the constraints of a voltage stability limit estimated at 10% of the maximum voltage drop. The substation capacity limit was also taken into account. The results obtained from the case studied enabled us again, to present selective results for load nodes in relation to the substation node. And finally, the spatial technology planning tool made it possible to obtain results on the different strategies for the various technologies required for the electrification planning study of the Togo case. The various results obtained from the different techniques provide the leads needed for a feasibility study for optimal electrification of off-grid areas, using microgrid systems.

Clustering, or otherwise known as cluster analysis, is a learning problem that takes place without any human supervision. This technique has often been utilized, much efficiently, in data analysis, and serves for observing and identifying interesting, useful, or desired patterns in the said data. The clustering technique functions by performing a structured division of the data involved, in similar objects based on the characteristics that it identifies. This process results in the formation of groups, and each group that is formed, is called a cluster. A single said cluster consists of objects from the data, that have similarities among other objects found in the same cluster, and resemble differences when compared to objects identified from the data that now exist in other clusters. The process of clustering is very significant in various aspects of data analysis, as it determines and presents the intrinsic grouping of objects present in the data, based on their attributes, in a batch of unlabeled raw data. A textbook or otherwise said, good criteria, does not exist in this method of cluster analysis. That is because this process is so different and so customizable for every user, that needs it in his/her various and different needs. There is no outright best clustering algorithm, as it massively depends on the user’s scenario and needs. This paper is intended to compare and study two different clustering algorithms. The algorithms under investigation are k-mean and mean shift. These algorithms are compared according to the following factors: time complexity, training, prediction performance and accuracy of the clustering algorithms.

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.

The visualization of hyperspectral images in display devices, having RGB colour composition channels is quite difficult due to the high dimensionality of these images. Thus, principal component analysis has been used as a dimensionality reduction algorithm to reduce information loss, by creating uncorrelated features. To classify regions in the hyperspectral images, K-means clustering has been used to form clusters/regions. These two algorithms have been implemented on the three datasets imaged by AVIRIS and ROSIS sensors.

In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms (Fuzzy C-means (FCM) and Possibilistic c-means (PCM)) are applied. Afterward, VAT is used to investigate the clustering tendency visually, and then in order of checking cluster validation, three types of indices (e.g., PC, DI, and DBI) were used. After observing the clustering algorithms, it was evident that each of them has its limitations; however, PCM is more robust to noise than FCM as in case of FCM a noise point has to be considered as a member of any of the cluster.

In document forensic, Ink mismatch relays very important information about forgeries in this way we can find out the authenticity of documents. Finding out and distinguishing these unique inks from the multispectral document is very challenging task. In this paper we proposed the method to identify the inks using clustering. We used K-Mean clustering instead of widely known Fuzzy C-Means Clustering (FCM) and successfully identity the number of inks. For the purpose of optimizing and improving our results we used two optimization techniques such as Elbow and silhouette optimization techniques.

In this article we investigate the determinants of the European “Most Cited Publications”. We use data from the European Innovation Scoreboard-EIS of the European Commission for the period 2010-2019. Data are analyzed with Panel Data with Fixed Effects, Panel Data with Random Effects, WLS, and Pooled OLS. Results show that the level of “Most Cited Publications” is positively associated, among others, to “Innovation Index” and “Enterprise Birth” and negatively associated, among others, to “Government Procurement of Advanced Technology Products” and “Human Resources”. Furthermore, we perform a cluster analysis with the k-Means algorithm either with the Silhouette Coefficient and the Elbow Method. We find that the Elbow Method shows better results than the Silhouette Coefficient with a number of clusters equal to 3. In adjunct we perform a network analysis with the Manhattan distance, and we find the presence of 4 complex and 2 simplified network structures. Finally, we present a confrontation among 10 machine learning algorithms to predict the level of “Most Cited Publication” either with Original Data-OD either with Augmented Data-AD. Results show that the best machine learning algorithm to predict the level of “Most Cited Publication” with Original Data-OD is SGD, while Linear Regression is the best machine learning algorithm for the prediction of “Most Cited Publications” with Augmented Data-AD.

Aiming at the problem of low charging efficiency caused by the scattered sensor nodes in traditional wireless rechargeable sensor networks (WRSNs), a UAV-assisted WRSN Online Charging Strategy Based on Dynamic Queue and Improved K-means (UOCS) is proposed. The scheme assumes that the energy consumption of nodes is unpredictable, and only generates charging requests when the energy is lower than a threshold, and performs on-demand responses to nodes that issue charging requests. The scheme combines the characteristics of one-to-one charging of UAVs, the selection and allocation timing of waiting queues and the number of UAVs, and the improved K-means partitioning based on space-time coordination(SPKM), which simplifies the problem of coordinated charging of multiple UAVs and maximizes energy. Using the efficiency and charging success rate, the optimal charging trajectory can be found under the constraint that the node will not starve to death due to power shortage. Finally, a simulation comparison experiment is carried out with the existing UAV charging scheduling strategy. UOCS achieves the optimal node survival rate with low algorithm complexity.

Cardiovascular disease is the number one cause of death in the world and Quoting from WHO, around 31% of deaths in the world are caused by cardiovascular diseases and more than 75% of deaths occur in developing countries. The results of patients with cardiovascular disease produce many medical records that can be used for further patient management. This study aims to develop a method of data mining by grouping patients with cardiovascular disease to determine the level of patient complications in the two clusters. The method applied is principal component analysis (PCA) which aims to reduce the dimensions of the large data available and the techniques of data mining in the form of cluster analysis which implements the K-Medoids algorithm. The results of data reduction with PCA resulted in five new components with a cumulative proportion variance of 0.8311. The five new components are implemented for cluster formation using the K-Medoids algorithm which results in the form of two clusters with a silhouette coefficient of 0.35. Combination of techniques of Data reduction by PCA and the application of the K-Medoids clustering algorithm are new ways for grouping data of patients with cardiovascular disease based on the level of patient complications in each cluster of data generated.

We apply hierarchical clustering (HC) of DNA k-mer counts on multiple Fastq files. The tree structures produced by HC may reflect experimental groups and thereby indicate experimental effects, but clustering of preparation groups indicates the presence of batch effects. Hence, HC of DNA k-mer counts may serve as an unspecific diagnostic device. In order to provide a simple applicable tool we implemented sequential analysis of Fastq reads with low memory usage in an R package (seqTools) available on Bioconductor. The approach is validated by analysis of Fastq file batches containing RNAseq data. Analysis of three Fastq batches downloaded from ArrayExpress indicated experimental effects. Analysis of RNAseq data from two cell types (dermal fibroblasts and Jurkat cells) sequenced in our facility indicate presence of batch effects. The observed batch effects were also present in reads mapped to the human genome and also in reads filtered for high quality (Phred > 30). We propose, that hierarchical clustering of DNA k-mer counts provides an unspecific diagnostic tool and a quality criterion and for RNAseq experiments.

The impact of nutrients on the environment, particularly on water bodies, has led to extensive studies for nutrient control. Within this context, studies have been focused on source separation of human urine from domestic wastewater to recover nutrients. Potassium is one of the most important components of human urine. However, data on potassium removal or recovery are quite limited except for some indirect information through use of zeolites for mostly ammonia removal. Potassium struvite or K-struvite (MgKPO₄·6H₂O) is a sparingly soluble salt belonging to struvite and has the potential of being used as a means of potassium and phosphate recovery from segregated human urine. This study aimed to assess the potential of K-struvite precipitation for control and recovery of nutrients. Within this context, K-struvite precipitation experiments were performed on both synthetically prepared samples and synthetic human urine solution to determine effect of operation parameters i.e. pH, stoichiometry, and temperature on potassium recovery performance. Results indicated that process performance as well as type of solid phases co-precipitated with K-struvite were closely related to initial potassium concentration, pH and reaction stoichiometry. At pH 10, the potassium recovery efficiency was maximized up to 87% by application of 100% excess dose of Mg and P for both synthetic samples and synthetic human urine solution. On the other hand, application of excess dose of K did not provide any improvement in K recovery efficiency. The effect of temperature on solubility of K-struvite was insignificant at the temperature of 24-90°C. Solid phase analyses confirmed that K-struvite was co-precipitated with either Mg₃(PO₄)₂, MgNaPO₄·7H₂O, or MgHPO₄·7H₂O depending on pH and stoichiometry instead of a pure compound.

Cardiovascular disease (CVD) and obesity are prevalent public health concerns with grave implications for morbidity and mortality, necessitating tailored interventions. This research explores the utility of fuzzy c-means clustering paired with principal component analysis (PCA) in detecting at-risk groups and personalizing health strategies for these conditions. Fuzzy c-means clustering allows for the dynamic classification of individuals into groups based on unique risk factors and intervention outcomes, while PCA aids in distilling complex data sets to uncover underlying patterns. The conjoined use of these methods has shown promise in identifying diverse risk profiles and in forecasting intervention success rates. The study acknowledges limitations, including possible biases stemming from data set composition and analytical parameter selection. Future research aims to refine these tools for clinical application. The results support implementing fuzzy c-means clustering and PCA for delineating specific target populations for health interventions, emphasizing careful use of these analytical approaches. Subsequent studies should focus on correlating these techniques with concrete clinical results to enhance public health measures.

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.

In this paper, we present sums and partial sums of Horadam sequences via generating functions which extends a recent result of Prodinger.

In this paper, closed forms of the sum formulas $\sum_{k=0}^{n}x^{k}W_{k}^{3}$ and $\sum_{k=1}^{n}x^{k}W_{-k}^{3}$ for the cubes of generalized Fibonacci numbers are presented. As special cases, we give sum formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers.

Feature selection is a crucial step to overcome the curse of dimensionality problem in data mining. This work proposes Recursive k-means Silhouette Elimination (RkSE) as a new unsupervised feature selection algorithm to reduce dimensionality in univariate and multivariate time-series datasets. Where k-means clustering is applied recursively to select the cluster representative features, following a unique application of silhouette measure for each cluster and a user-defined threshold as the feature selection or elimination criteria. The proposed method is evaluated on a hydraulic test rig, multi sensor readings in two different fashions: (1) Reduce the dimensionality in a multivariate classification problem using various classifiers of different functionalities. (2) Classification of univariate data in a sliding window scenario, where RkSE is used as a window compression method, to reduce the window dimensionality by selecting the best time points in a sliding window. Moreover, the results are validated using 10-fold cross validation technique. As well as, compared to the results when the classification is pulled directly with no feature selection applied. Additionally, a new taxonomy for k-means based feature selection methods is proposed. The experimental results and observations in the two comprehensive experiments demonstrated in this work reveal the capabilities and accuracy of the proposed method.

Major (exo)planetary and satellite bodies seem to concentrate at intermediate areas of the radial 1 distributions of all the objects orbiting in each (sub)system. We show that angular-momentum transport during secular evolution of (exo)planets and satellites necessarily results in the observed intermediate accumulation of the massive objects. We quantify the ‘middle’ as the mean of mean motions (orbital angular velocities) when three or more massive objects are involved. Radial evolution of the orbits is expected to be halted when the survivors settle near mean-motion resonances and angular-momentum transfer between them ceases (gravitational Landau damping). This dynamical behavior is opposite in direction to what has been theorized for viscous and magnetized accretion disks, in which gas spreads out and away from either side of any conceivable intermediate area. We present angular momentum transfer simulations in few-body systems, and we calculate the tidal dissipation timescales and the physical properties of the mean tidal field in planetary and satellite (sub)systems.

In the paper, the authors generalize the notion "k-Mittag-Leffler function'', establish some integral transforms of the generalized k-Mittag-Leffler function, and derive several special and known conclusions in terms of the generalized Wright function and the generalized k-Wright function.

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 aim of this work is to study generalizations of the notion of mean. Kolmogorov proposed a generalization based on an improper integral with a decay rate for the tail probabilities. This weak or Kolmogorov mean relates to the Weak Law of Large Numbers in the same way that the ordinary mean relates to the Strong Law. We propose a further generalization, also based on an improper integral, called the doubly weak mean, applicable to heavy-tailed distributions such as the Cauchy distribution and the other symmetric stable distributions, We also consider generalizations arising from Abel-Feynman type mollifiers that damp the behavior at infinity and alternative formulations of the mean in terms of the cumulative distribution and the characteristic function.

Hox gene clusters are crucial in Embryogenesis. It was observed that some Hox genes are located in order along the telomeric to centromeric direction of the DNA sequence: Hox1, Hox2, Hox3…. These genes are expressed in the same order in the ontogenetic units of the Drosophila embryo along the Anterior-Posterior axis. The two entities (genome and embryo) differ significantly in linear size and in-between distance. This strange phenomenon was named Spatial Collinearity (SP). Later, it was observed that, particularly in the Vertebrates, a Temporal Collinearity (TC) coexists: first is Hox1 expressed, later Hox2 and even later Hox3,…,. According to a Biophysical Model (BM), pulling forces act at the anterior end of the cluster while a cluster fastening applies at the posterior end. Hox clusters are irreversibly elongated along the force direction. During Evolution, the elongated Hox clusters are broken at variable lengths thus split clusters may be created. An Empirical Rule was formulated distinguishing development due to a complete Hox cluster from development due to split Hox clusters. BM can ‘explain’ this Empirical Rule. In a spontaneous mutation where the cluster fastening is dismantled, a weak pulling force automatically shifts the cluster inside the Hox activation domain. This cluster translocation can probably explain the absence of Temporal Collinearity in Drosophila.

We review time expansion wave theory and refine our model showing it to accurately match observed cosmological luminosity data. The theory augments general relativity to create a container within which quantum effects can be explained by treating time as an artefact of a fourth spatial dimension that we observe as the expansion of the universe. This leads us to explain mass creation, the speed of light limit, gravity, black holes without singularities and other macroscopic effects. Our model leads to an expansion velocity of 6.87 0.36 × 106 ms-1, which results in a Hubble expansion rate constant of 71.3 3.7 km/s/Mpc. Because of the finite window of time in which we exist, an extra a degree of freedom is available leading to interesting interpretations at the subatomic level. At this size range, then a spin is allowed within the time dimension explaining why wave particle duality occurs and explains the electromagnetic force and other quantum mechanical properties. It provides a solution to the double slit conundrum and can explain how quantum entangled partners can behave in a quantum way and pass seemingly time-defying information. The potential quantitative origin of the fine structure constant which governs the size of the electromagnetic force is also strongly indicated by this theory.

This paper will explore analogs of groups formed by the transformations of two ropes as presented by Minh-Tam Quang Trinh.1 The two operations acting on these ropes are T and S, defined as twists and clockwise turns, respectively. These actions intertwine the ropes, creating tangles. T and S also have the ability to untangle the rope when used in certain combinations. In the two-rope case, these actions expressed as a group presentation were shown to be isomorphic to SL₂(Z). We explored the analog of these opera- tions, T and S, and conjectured the corresponding group to which they are isomorphic. Partial proofs for this conjecture are included and future work would include proving our conjecture as well as generalizing results to k ropes.

Nonlinear nonparametric statistics (NNS) algorithm offers new tools for curve fitting. A relationship between k-means clustering and NNS regression points is explored with graphics showing a perfect fit in the limit. The goal of this paper is to demonstrate NNS as a form of unsupervised learning, and supply a proof of its limit condition. The procedural similarity NNS shares with vector quantization is also documented, along with identical outputs for NNS and a k nearest neighbours classification algorithm under a specific NNS setting. Fisher's iris data and artificial data are used. Even though a perfect fit should obviously be reserved for instances of high signal to noise ratios, NNS permits greater flexibility by offering a large spectrum of possible fits from linear to perfect.

The KcsA is a prokaryotic potassium-oriented channel, which is sourced from the Streptomyces lividans soil bacteria. From extensive studies that have been carried over the KcsA potassium channel, it has been proved that various factors enable the gating and shuttling of the potassium ions into and out of the cells. Some of the factors include the different concentration of protons in the inside and outside membrane. The other factor is the existence of the selectivity filter equipped in the exit of channel pore, which enables the movement of the K⁺ ions. Not only are potassium ions present in the channel but also sodium ions. Potassium and sodium ions are the ions that are essential in the conductivity of a cell because of their charge. An intuitive idea about why K⁺ ions are at least 10,000 times more permeant than Na⁺ ions is presented in various entities. The hypothesis is that the selectivity ratio is probably related to the successive entry of Na⁺ ions, based on the premise that the ratio seems to be relevant to unpredictable quantities caused by Brownian corrosion of ions.

The excessive intake of sodium (Na) and insufficient intake of potassium (K) are major concerns to prevent hypertension. Using low-Na/K seasonings (reducing 25% of the NaCl and adding K salt) may improve the dietary Na/K ratio and help prevent hypertension. To devise an intervention study using low-Na/K seasonings at a company cafeteria, we calculated the Na and K contents of the meals served at the cafeteria and estimated changes in the intakes when suitable low-Na/K seasonings were used. We also considered using milk as a good source of K. We used an ingredient list of a company cafeteria and calculated Na and K contents in each dish. The average amounts of NaCl and K per use were 5.04 g and 718 mg, respectively. Seasonings contributed 70.9% of the NaCl. With the use of low-Na/K seasonings, an estimated reduction in NaCl of 0.8 g/day and an estimated increase in K of 308 mg/day was achieved. An additional serving (200 mL) of milk, NaCl was reduced by 0.57 g/day and K was increased by 610 mg/day, with an overall decrease in the dietary Na/K ratio from 3.20 to 2.40. The use of low-Na/K seasonings and dairy may improve the dietary Na/K ratio among cafeteria users and help prevent hypertension.

Nanoporous membranes promise energy-efficient water desalination. Hexagonal boron nitride (h-BN), like graphene, exhibits outstanding physical and chemical properties, making it a promising candidate for water treatment. We employed Car–Parrinello molecular dynamics simulations to establish accurate modeling of Na+ and Cl- permeation through hydrogen passivated nanopores in graphene and h-BN membranes. In these complex systems the classical potentials cannot properly account for the physics at play. We demonstrate that ion separation works well for the h-BN by imposing a barrier of 0.13 eV and 0.24 eV for Na+ and Cl- permeation respectively, compared to the graphene where the Cl- ion faces a negative barrier of 0.68 eV and is prone toward blockade and Na+ permeation is associated with a slightly negative barrier of 0.03 eV. From the change in the solvation shell, we get the following trend: Na/h-BN > Na/G > Cl/G > Cl/h-BN. We argue that the trend in the permeation barrier changes to Cl-h-BN > Na-h-BN > Na-G > Cl-G due to a combination of several interactions, including the distortion of the water network induced by the ions, the ion-water interaction, and the ion-nanopore interaction. Overall, the desalination performance of h-BN surpasses that of their graphene counterparts.

Principal Component Analysis (PCA) is a method that identifies common directions within multivariate data and presents the data in as few dimensions as possible. One of the advantages of PCA is its objectivity, as the same results can be obtained regardless of who performs the analysis. However, PCA is not a robust method and is sensitive to noise. Consequently, the directions identified by PCA may deviate slightly. If we can teach PCA to account for this deviation and correct it, the results should become more comprehensible. The methods for doing this and an issue with this are presented.

Clustering coefficient measures are key complex network analysis tools. We examine local and global clustering coefficient measures with respect to the lexicographic graph product. As a preliminary condition, we analyze the $K_3$ subgraph structure focused on vertex inclusion with respect to the product graph. From this structure, we determine both the clustering coefficient for the product graph vertices and the average clustering coefficient for the product graph.

Recent data suggest that K-Ras4B (hereafter K-Ras) can drive cancer cell stemness via calmodulin (CaM)-dependent, non-canonical Wnt-signalling. Here we examined whether another Ca2+-binding protein, the CaM-related centrin1, binds to K-Ras and could mediate some K-Ras functions that were previously ascribed to CaM. While CaM and centrin1 appear to distinguish between peptides that were derived from their classical targets, they both bind to K-Ras in cells. Cellular BRET-data suggest that CaM engages more with K-Ras than centrin1 and that the interaction with the C-terminal membrane anchor of K-Ras is sufficient for this. Surprisingly, binding of neither K-Ras nor its membrane anchor alone to CaM or centrin1 is sensitive to inhibition of prenylation. In support of an involvement of the G-domain of K-Ras in cellular complexes with these Ca2+-binding proteins, we find that oncogenic K-RasG12V displays increased engagement with both CaM and centrin1. This is abrogated by addition of the D38A effector-site mutation, suggesting that K-RasG12V is held together with CaM or centrin1 in complexes with effectors. When treated with CaM-inhibitors the BRET-interaction of K-RasG12V with centrin1 was also disrupted in the low micromolar range, comparable to that with CaM. While CaM predominates in regulating functional membrane anchorage of K-Ras, it has a very similar co-distribution with centrin1 on mitotic organelles. Given these results, a significant overlap of the CaM- and centrin1-dependent functions of K-Ras is suggested.

Vitamin K occupies a unique and often obscured place among its fellow fat-soluble vitamins. Evidence is mounting however, that vitamin K (VK) may play an important role in the visual system apart from the hepatic carboxylation of hemostatic related proteins. However, to our knowledge, no review covering the topic has appeared in the medical literature. Recent studies have confirmed that matrix Gla protein (MGP), a vitamin K-dependent protein (VKDP), is essential for the regulation of intraocular pressure in the mouse. The PREDIMED (Prevención con Dieta Mediterránea) study, a randomized trial involving 5860 adults at risk for cardiovascular disease, demonstrated a 29% reduction in the risk of cataract surgery in participants with the highest tertile of dietary vitamin K1 (PK) intake compared with the lowest tertile. However, the specific requirements of the eye and visual system (EVS) for VK, and what might constitute an optimized VK status, is currently unknown and largely unexplored. It is the intention therefore of this narrative review to provide an introduction concerning VK and the visual system, review ocular VK biology, and to provide some historical context to recent discoveries. Potential opportunities and gaps in current research efforts will be touched upon, in the hope of raising awareness, and encouraging continued VK related investigations in this important and highly specialized sensory system.

Using geometric considerations, we provide a clear derivation of the integral representation for the error function, known as the Craig formula. We calculate the corresponding power series expansion and prove the convergence. The same geometric means finally help to systematically derive handy formulas that approximate the inverse error function. Our approach can be used for applications in e.g. high-speed Monte Carlo simulations where this function is used extensively.

In the particular configuration of the scalar field K-essence in the Wheeler-DeWitt quantum equation, for some age in the Bianchi type I anisotropic cosmological model, a fractional differential equation for the scalar field arises naturally. The order of the fractional differential equation is $\beta=\frac{2\alpha}{2\alpha - 1}$. This fractional equation belongs to different intervals, depending on the value of the barotropic parameter; when $\omega_{X} \in [0,1]$, the order belongs to the interval $1\leq \beta \leq 2$, and when $\omega_{X}\in[-1,0)$, the order belongs to the interval $0<\beta \leq 1$. In the quantum scheme, we introduce the factor ordering problem in the variables $(\Omega,\phi)$ and its corresponding momenta $(\Pi_\Omega, \Pi_\phi)$, obtaining a linear fractional differential equation with variable coefficients in the scalar field equation, then the solution is found using a fractional power series expansion. The corresponding quantum solutions are also given. We found the classical solution in the usual gauge N obtained in the Hamiltonian formalism and without a gauge. In the last case, the general solution is presented in a transformed time $T(\tau)$, however in the dust era we found a closed solution in the gauge time $\tau$.

The main objective of this paper is to introduce k-fractional derivative operator by using the definition of k-beta function. We establish some results related to the newly defined fractional operator such as Mellin transform and relations to k-hypergeometric and k-Appell's functions. Also, we investigate the k-fractional derivative of k-Mittag-Leffler and Wright hypergeometric functions.

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.

Currently, maritime traffic is increasing with economic growth in several regions worldwide. However, this growth in maritime traffic has led to increased risk of marine accidents. These accidents have a higher probability of occurring in regions where geographical features, such as islands, are present. Further, the positioning of rescue ships in a particular ocean region with a high level of maritime activity is critical for rescue operations. This paper proposes a method for determining an optimal set of locations for stationing rescue ships in an ocean region with numerous accident sites in the Wando islands of South Korea. The computational challenge in this problem is identified as the positioning of numerous islands of varying sizes located in the region. Thus, the proposed method combines a clustering-based optimization method and an image processing approach that incorporates flood filling to calculate the shortest distance between two points in the ocean that detours around the islands. Experimental results indicate that the proposed method reduces the distance from rescue ships and each accident site by 5.0 km compared to the original rescue ship locations. Thus, rescue time is reduced.

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.

Concept Knowledge (C-K) theory has been used in engineering and science-based research for more than a decade. Design of an Information Technology (IT) artefact is mostly pragmatic in nature. Design Science Research (DSR) methodology applied and studied in many Information Systems (IS) research. Many sub design decisions involved through the design of an IT artefact from a concept (idea) to a working prototype. A DSR artefact is based on a combination of decisions made during several sub-design stages. Artefacts are built based on the selection of elements in each sub-design space. Recording the design decisions on each sub-design space would be beneficial for future researchers. By knowing the design decisions on each sub-design space, researchers would be able to try different combinations of the design. C-K theory provides the ability to capture the design processes’ several sub-design spaces. In this paper, we discuss the DSR research methodology by looking at the stages proposed in the literature, and the application of C-K theory in an IT-based DSR. This paper also proposed a C-K theory-based protocol called Concept Tree for tracking and reporting artefact design steps. The application of C-K theory in DSR is exhibited using the implementation of the Concept Tree for a prototype design IT artefact.

In this paper, some convexity properties and some inequalities for the (p,k)-analogue of the Gamma function, Г_p,k(x) are given. In particular, a (p,k)-analogue of the celebrated Bohr-Mollerup theorem is given. Furthermore, a (p,k)-analogue of the Riemann zeta function, ζ_p,k(x) is introduced and some associated inequalities are derived. The established results provide the (p,k)-generalizations of some known results concerning the classical Gamma function.

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.

A systematic investigation of the dynamic clustering behavior of active particles under confinement, including the effects of both particle density and active driving force is presented based on a hybrid coarse-grained molecular dynamics simulation. First, a series of scaling laws were derived with power relationships for the dynamic clustering time as a function of both particle density and active driving force. Notably, the average number of clusters N ̅ assembled from active particles in the simulation system exhibits a scaling relationship with clustering time t described by N ̅∝t^(-m). Simultaneously, the scaling behavior of the average cluster size S ̅ is characterized by S ̅∝t^m. Our findings reveals the presence of up to four distinct dynamic regions concerning clustering over time, with transitions contingent upon the particle density within the system. Furthermore, as the active driving force increases, the aggregation behavior also accelerates, while an increase in density of active particles induce alterations in the dynamic procession of the system.

Here we present a fast and highly scalable community structure preserving network module detection that recursively integrates graph sparsification and clustering. Our algorithm, called SparseClust, participated in the most recent DREAM community challenge on disease module identification, an open competition to comprehensively assess module identification methods across a wide range of biological networks.

The current study aims to produce a material that has a dual effect of healing and anti-inflammatory. For this target k-carrageenan/polyacrylamide hydrogel film loaded with cetrimide (k-CAR/PAAm/CI) was performed by manual casting technique. Definite concentrations of k-CAR and AAm was heated at 80°C for 2 hours, CI and glycerol were added. The solution was cast without using initiator and cross-linker. The reaction of the sulfonic acid group -SO3H of k-CAR with -CONH2 group of PAAm lead to the formation of a sulfonamide (-SO2NH-) linkage. The characteristics of the produced films were investigated by FTIR, TGA, contact angle, and mechanical properties. Improvement in the thermal stability was performed in k-CAR/PAAm/CI2 film containing 1.5% CI compared to the film has 0.5% CI (k-CAR/PAAm/CI1). The contact angle measurement proved the films are hydrophobic that enhanced by increasing CI content. The tensile strength and elongation percent values are considered adequate for materials used in wound care. k-CAR/PAAm/CI2 (1.5% CI) film showed superior antimicrobial activity against P. aeruginosa, moderate activity against S. aureus, and low activity against E. coli. The film k-CAR/PAAm/CI2 was effectively inhibiting the heat-induced hemolysis and may offer a promising approach for the development of effective wound dressings.

This work is developed over the question ”How to automatically create a good clustering on spatial dataset with high different local densities?” opened by previus work of Berzi [5]. To answer the main question, this work describe a approach of recursive clustering process based on a technique of finding ”vague-solution”, where the output is an hierarchical clustering of initial dataset. In particularly the the approach is developed and tested on DBSCAN algorithm [11] with large dataset gathered by Google Place in Metropolitan Area of Milan. The core solutions developed in this algorithm are condensed in the capacity of generation a Hierarchical Clustering with a recursive select the best solutions in according tothe our goals, previously dfined by some sets of rules. The algorithm described here, and developed in my Master Thesis, rosolve two problem: - When we use an algorithm of clustering that can create a set of differents clustering, but equally valid and don’t know exctly what we must have as good solution, we areled to ask ourselves: ”What are the better?” This obviously depends by our goals, sonow the question is: ”What are our goals?”; - The second problem is condensed in the sentence ”Not all clusters can be found in one-shot clustering process, more often we must reapply the process to some part of datataset”, so there we have a second question that this paper answering: ”How to create clustering of data with ad-hoc processing for each different part of input dataset?”; These questions are resolved by the approaches named in this work as: Space of Solutions, Vague-Solution, Vague-Solution finding Method and finaly Recursive Clustering. All of these approaches was drafted and tested in mine Master Thesis titled ”Geospatial data analysis for Urban informatics applications: the case of the Google Place of the City of Milan” [25].

While lidar-based forest inventory methods have been widely demonstrated, prediction of tree diameters with lidar is not well understood. The performance metrics typically used in studies for prediction of diameters can be difficult to interpret and may not support comparative inferences between sampling designs or study areas. We evaluate a variety of lidar and k nearest neighbor (k-NN) strategies for prediction of tree diameter distributions using two indices which are easier to interpret and compare. The indices are based on the coefficient of determination (R²), and root mean square deviation (RMSD). These indices facilitate comparisons with alternative (non-lidar) inventory strategies, and with other project areas. We evaluate k nearest neighbors (k-NN) dbh density (relative frequency by dbh class) prediction strategies with lidar for 190 training plots distribute across the 800 km² Savannah River Site in South Carolina, USA. We evaluate the performance of k-NN with respect to distance metrics, number of neighbors, predictor sets, and response sets. Amongst the examined strategies we found Mahalanobis distance with k = 3 neighbors performed best according to a number of criteria.

A temperature-modulated pyroelectricity measurement system for a small single crystal is developed and applied to standard sample measurements performed on a thin single crystal of lithium niobate. The modulation measurement is based on the AC technique, in which the temperature of the sample is periodically oscillated, and the synchronized pyroelectric signal is extracted using a lock-in amplifier. Temperature modulation is applied by irradiating periodic light on the sample placed in the heat exchange gas. To apply this technique to the transparent reference sample, a commercially available black resin is coated on the sample’s surface to absorb the light energy and transmits it to the specimen. The experimental results are analyzed using a two-layer heat transfer model to verify the effect of the light-absorbing layer as well as the non-contact temperature modulation system.

(1) Background: Vitamin K deficiency is a common feature of chronic kidney disease (CKD), leading to impaired bone quality and increased risk of vascular calcifications. A method to indirectly measure Vitamin K status is measuring the blood level of Vitamin K dependent proteins (VKDP)- osteocalcin (OC) and matrix GLA protein (MGP). The aim of this study is to correlate the level of OC and MGP with markers of CKD mineral bone disorder (CKD-MBD). (2) Methods: We conducted a single-center cross-sectional study that included 45 CKD G5D patients and measured blood biochemistry, complete blood count and intact osteocalcin and matrix GLA protein. (3) Results: We found a strong statistically significant correlation of OC with the markers of CKD-MBD such as: iPTH , serum calcium and serum phosphorus and a strong indirect statistically significant correlation with abdominal circumference. There was also a statistically significant correlation of MGP with markers of inflammation (CRP). Higher levels of MGP were found in patients treated with vitamin K antagonists, non-calcium based phosphate binders and vitamin D receptor activator- paricalcitol. (4) Conclusions: In our study, we found that vitamin K deficiency, measured indirectly using the level of VKDP is associated to CKD-MBD. The use of medication such as phosphate binders, that reduce vitamin K absorbtion, Vitamin D that increases Vitamin K requirements and also vitamin K antagonists, seem to have an influence on the blood level of VKDPs.

We know that the classical Mittag-Leffler function play an important role as solution of fractional order differential and integral equations. We introduce the j-generalized p - k Mittag-Leffler function. We evaluate the second order differential recurrence relation and four different integral representations and introduce a homogeneous linear differential equation whose one of the solution is the j-generalized p-k Mittag-Leffler function. Also we evaluate the certain relations that exist between j-generalized p - k Mittag-Leffler function and Riemann-Liouville fractional integrals and derivatives. We evaluate Mellin-Barnes integral representation of j-generalized p-k Mittag-Le er Function. The relationship of j-generalized p-k Mittag-Leffler Function with Fox H-Function and Wright hypergeometric function is also establish. we obtained its Euler transform, Laplace Transform and Mellin transform. Finally we derive some particular cases.

We introduce and discuss a generalization of the classical multi-objective optimization to pairs of functions. This procedure is referred to as bi-multi-objective optimization. A justification of this general optimization procedure is presented, related both to multi-objective optimization under ambiguity concerning individual preferences and to Pareto optimality for a family of preferences with nontransitive indifference. Incidentally, the binary relation naturally associated to a bi-multi-objective optimization problem is represented by a finite bi-multi-utility, which generalizes to the nontransitive case the classical finite multi-utility representation. An important application is presented to Markowitz portfolio selection under ambiguity concerning both the vector of returns and the covariance matrix.

This paper discusses a means of making an extremely bright path entangled source. An initial laser source is preferred but any source of light: LED, sub-critical laser, coherent or thermal can be used. The light is dimmed by a beam expander until the relative number of |1> or |2> photons increases compared to higher photon states. The expanded beam is then passed through a 1:1 beamsplitter to generate path entanglement on the |1> and |2> photons. A further stage of “purification” can remove the non-entangled higher states by passing the output beams from the beamsplitter through one another, such that the correlated entangled photon electrical fields cancel in some region. In the said region, the uncorrelated non-entangled fields can be Faraday rotated and then absorbed by a polariser. The entangled photons pass through the region without rotation and attenuation. The output from the device then has copious quantities of 1 and 2 photon path entangled suitable for use in telecommunications engineering, secure transmission of data and quantum metrology. The wide beams can be beam-contracted to a thin bright beam and will keep the path entanglement of individual photons, as photons are bosons and so don’t interact, furthermore, all operations are unitary and linear, as by Maxwell’s equations.

Aim: The aim of the paper is to assess the usefulness of sectoral means in financial analyses of enterprises. Research methods: The article uses an inductive-deductive approach to assess the suitability of sectoral means used in analyses of financial standings of enterprises. The method of analysis and logical construction was used for literature review. The methods of descriptive statistics such as, arithmetic means, standard deviation and coefficient of variation were used in order to analyze the data and draw conclusions based on the results. Contribution: The assessment of the usefulness of sectoral means in the context of their variability seems to be a crucial aspect for the analysis of a company’s financial situation. When assessing the financial standing of an enterprise, it is necessary to use a comparative analysis method, based on, inter alia, a comparison in space. This type of comparison requires the use of sectoral means, whose assessment is extremely important to drawing reliable and correct conclusions of the financial situation of a company.

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.

Assessment of drugs toxicity and associated biomarker genes is one of the most important tasks in the pre-clinical phase of drug development pipeline as well as in the toxicogenomic studies. There are few statistical methods for the assessment of doses of drugs (DDs) toxicity and their associated biomarker genes. However, these methods consume more time for computation of the model parameters using the EM (Expectation-Maximization) based iterative approaches. To overcome this problem, in this paper, an attempt is made to propose an alternative approach based on hierarchical clustering (HC) for the same purpose. There are several types of HC approaches whose performance depends on different similarity/distance measures. Therefore, we explored suitable combinations of distance measures and HC methods based on Japanese Toxicogenomics Project (TGP) datasets for better clustering/co-clustering between DDs and genes as well as to detect toxic DDs and their associated biomarker genes. We observed that Word’s HC method with each of Euclidean, Manhattan and Minkowski distance measures produces better clustering/co-clustering results. For an example, in case of glutathione metabolism pathway (GMP) dataset LOC100359539/Rrm2, Gpx6, RGD1562107, Gstm4, Gstm3, G6pd, Gsta5, Gclc, Mgst2, Gsr, Gpx2, Gclm, Gstp1, LOC100912604/Srm, Gstm4, Odc1, Gsr, Gss are the biomarker genes and Acetaminophen_Middle, Acetaminophen_High, Methapyrilene_High, Nitrofurazone_High, Nitrofurazone_Middle, Isoniazid_Middle, Isoniazid_High are their regulatory (associated) DDs explored by our proposed co-clustering algorithm based on the distance and HC method combination Euclidean: Word. Similarly, for the PPAR signaling pathway (PPAR-SP) dataset Cpt1a, Cyp8b1, Cyp4a3, Ehhadh, Plin5, Plin2, Fabp3, Me1, Fabp5, LOC100910385, Cpt2, Acaa1a, Cyp4a1, LOC100365047, Cpt1a, LOC100365047, Angptl4, Aqp7, Cpt1c, Cpt1b, Me1 are the biomarker genes and Aspirin_Low, Aspirin_Middle, Aspirin_High, Benzbromarone_Middle, Benzbromarone_High, Clofibrate_Middle, Clofibrate_High, WY14643_Low, WY14643_High, WY14643_Middle, Gemfibrozil_Middle, Gemfibrozil_High are their regulatory DDs. These results are validated by the available literature and functional annotation.

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.

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.

Collective spread of aggregated viral particles may have beneficial effects on viral capability to survive in the external environment, to counteract immune responses, and to successfully colonize host cells. Here we ask whether SARS-Cov-2 particles, responsible for COVID-19, display collective clustering behavior. Looking at microphotographs and movies of SARS-Cov-2 particles emerging from the surface of cultured cells, we describe single virions that tend to aggregate in progressively larger globular assemblies, until a network-like appearance is achieved. When SARS-Cov-2 particles stick into each other, the squeezing of single virions leads to improved viral package in host’s fluids. We discuss how these findings might explain both the ability to spread of SARS-Cov-2 and the clinical severity of COVID-19 in humans, paving the way to novel therapeutic strategies to mechanically disrupt collective clustering.

Clustering is an important task in data mining that has become more challenging due to the ever-increasing size of available datasets. To cope with these big data scenarios, a high-performance clustering approach is required. Sparse grid clustering is a density-based clustering method that uses a sparse grid density estimation as its central building block. The underlying density estimation approach enables the detection of clusters with non-convex shapes and without a predetermined number of clusters. In this work, we introduce a new distributed and performance-portable variant of the sparse grid clustering algorithm that is suited for big data settings. Our compute kernels were implemented in OpenCL to enable portability across a wide range of architectures. For distributed environments, we added a manager-worker scheme that was implemented using MPI. In experiments on two supercomputers, Piz Daint and Hazel Hen, with up to 100 million data points in a 10-dimensional dataset, we show the performance and scalability of our approach. The dataset with 100 million data points was clustered in 1198s using 128 nodes of Piz Daint. This translates to an overall performance of 352TFLOPS. On the node-level, we provide results for two GPUs, Nvidia's Tesla P100 and the AMD FirePro W8100, and one processor-based platform that uses Intel Xeon E5-2680v3 processors. In these experiments, we achieved between 43% and 66% of the peak performance across all compute kernels and devices, demonstrating the performance portability of our approach.

In this paper, closed forms of the sum formulas $\sum_{k=0}^{n}W_{k}^{2}$ \ for the squares of generalized Tetranacci numbers are presented. We also present the sum formulas $\sum_{k=0}^{n}W_{k+1}W_{k},$ $\sum_{k=0}^{n}W_{k+2}W_{k},$ and $\sum_{k=0}^{n}W_{k+3}W_{k}.$ As special cases, we give summation formulas of the of Tetranacci, Tetranacci-Lucas and some other fourth order linear recurrance sequences.

The paper proposes an innovative solution for managing and ensuring high energy efficiency of power supply systems at high non-linear loads. This is realized by maintaining optimal value of reliability indicators and high quality of power supply. The validation is carried out using analyzes and tests of quality of electromagnetic compatibility (EMC) for increased number of powered frequency converters. It has been proven that the effective use and reduction of energy consumption can be achieved thanks to the unique technological features of the employed electrical devices. This enables a normal operation of the system with decreased power and adequate control of energy processes. The problem of predicting power losses under changing conditions in a decentralized electrical network has been solved based on the theory of electromagnetic compatibility. The influence of the mains mode parameters and the indices of instantaneous distortion of current and voltage waveforms caused by the operation of converters on the resonance phenomena in power supply systems were investigated. Recommendations were developed for the selection of proper parameters of compensators for 6-10 kV and 0.4-0.66 kV circuits based on the analysis of the optimization problem when minimizing active power losses. Results of our findings may aid parties involved in designing and maintaining power networks in various applications, such as mines, etc.

The present study comprises the second part of our previous work that dealt mainly with the phytochemical and physicochemical characterization of green coffee, clove, cinnamon/clove and nutmeg ethanolic extracts of grape origin. In the present study, we focused on producing a discriminating model concerning green coffee, clove, cinnamon, cinnamon and clove, and nutmeg fine powders based on multivariate analysis of variance and supervised learning on data of volatile compounds analysis, carried out with solid phase dynamic extraction in combination with gas chromatography/mass spectrometry. Results showed that 7 volatile compounds namely ethylene, methanol, 3-methylpentane, ethyl acetate, 9-hexadecen-1-ol, toluene, and methyl acetate could differentiate the investigated samples resulting in a 100% classification rate using the cross-validation method of linear discriminant analysis. Results were further confirmed using partial least squares regression analysis. The study contributes to the typification of green coffee, cinnamon, clove, cinnamon and clove and nutmeg, based on selected volatile compounds, and provides further support to the literature by means of possible adulteration given the statistical models developed.

Formulating a novel concept about the origin of human aging has been constrained by the dominance of a “classic theory” that was proposed nearly 70 years ago. Despite concern over the validity of some of its assumptions, the theory remained basic to our understanding of aging’s relationship with natural selection (NS). However, the logic upon which it rests was tested and subsequently challenged. The present theory describes the single cause of human aging consistent with Darwin’s evolutionary requirement for selection of adaptive traits. It describes an emergent property of the developmental program (DP), that is expressed upon completion of ontogenesis. It involves redundant expression of regulatory processes from the last stage of the DP. That mechanism subsequently preserves a non-aging, stable interval of unchanging NS during which reproductive fitness is achieved. Thereafter, loss of DP regulatory redundancy due to reliability limits, stochastic mutation accumulation, reproductive and a specific type of DNA damage, initiates aging which causes an inexorable decline in strength of NS to begin. It starts approximately a decade later than proposed in the classic theory. Since reproduction and aging are inextricably linked by the same emergent property, selection of that regulatory mechanism makes both traits products of NS.

The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

The aerospace industry develops prognosis and health management algorithms to ensure better safety on board. Particularly for in-flight controls where jamming is dreaded. For that, vibration signals are monitored to predict future defect occurrences. However, time series are not labeled according to severity level, and the user can only assess the system health from the data mining procedure. To that extent, we developed a clustering algorithm using a deep neural network core. We encoded the time series into pictures to be feed into an artificially trained neural network: U-NET. From the segmented output, one-dimensional information on cluster frontiers is extracted and filtered without any parameter selection. Then, a kernel density estimation finally transforms the signal into an empirical density. Ultimately, a Gaussian mixture model extracts the latter independent components. The method empowered us to reveal different degrees of severity faults in the studied data, with their respective likelihood without prior knowledge. We compared it to state-of-the-art machine learning algorithms. However, internal clustering results evaluation for time series is an open question. As state-of-the-art indexes were not producing relevant results, we built a new indicator to fulfill this task. We applied the whole method to an actuator consisting of an induction machine linked to a ball screw. This study lays the groundwork for future training of diagnosis and prognosis structures in the health management framework.

The goal of clustering is to identify common structures in a data set by forming groups of homogeneous objects. The observed characteristics of many economic time series motivated the development of classes of distributions that can accommodate properties such as heavy tails and skewness. Thanks to its flexibility, the Skewed Exponential Power Distribution (also called Skewed Generalized Error Distribution) ensures a unified and general framework for clustering possibly skewed and heavy tailed time series. This paper develops a clustering procedure of model-based type, assuming that the time series are generated by the same underlying probability distribution but with different parameters. Moreover, we propose to optimally combine the estimated parameters to form the clusters with an entropy weighing $k$-means approach. The usefulness of the proposal is showed by means of application to financial time series, demonstrating also how the obtained clusters can be used to form portfolio of stocks.

Smart grids require flexible data driven forecasting methods. We propose clustering tools for bottom-up short-term load forecasting. We focus on individual consumption data analysis which plays a major role for energy management and electricity load forecasting. The two first sections are dedicated to the industrial context and a review of individual electrical data analysis. We are interested in hierarchical time-series for bottom-up forecasting. The idea is to disaggregate the signal in such a way that the sum of disaggregated forecasts improves the direct prediction. The 3-steps strategy defines numerous super-consumers by curve clustering, builds a hierarchy of partitions and selects the best one minimizing a forecast criterion. Using a nonparametric model to handle forecasting, and wavelets to define various notions of similarity between load curves, this disaggregation strategy applied to French individual consumers leads to a gain of 16\% in forecast accuracy. We then explore the upscaling capacity of this strategy facing massive data and implement proposals using R, the free software environment for statistical computing. The proposed solutions to make the algorithm scalable combines data storage, parallel computing and double clustering step to define the super-consumers.

In recent years, governments applied intelligent transportation system (ITS) technique to provide several convenience services (e.g., garbage truck app) for residents. This study proposes a garbage truck fleet management system (GTFMS) and data feature selection and data clustering methods for travel time prediction. A GTFMS includes mobile devices (MD), on-board units, fleet management server, and data analysis server (DAS). When user uses MD to request the arrival time of garbage truck, DAS can perform the procedure of data feature selection and data clustering methods to analyses travel time of garbage truck. The proposed methods can cluster the records of travel time and reduce variation for the improvement of travel time prediction. After predicting travel time and arrival time, the predicted information can be sent to user’s MD. In experimental environment, the results showed that the accuracies of previous method and proposed method are 16.73% and 85.97%, respectively. Therefore, the proposed data feature selection and data clustering methods can be used to predict stop-to-stop travel time of garbage truck.

Triangular resonators re-shaped with the Sierpinski geometry and U-shaped resonators have been designed, linking them with single-pole-double-through (SPDT) RF MEMS switches to provide frequency tuning for potential applications in the K-Band. Prototypes of band-stop narrowband filters working around 20 GHz and 26 GHz, interesting for RADAR and satellite communications, have been studied in coplanar waveguide (CPW) configuration, and the tuning was obtained by switching between two paths of the devices loaded with different resonators. As a result, dual-band operation or fine-tuning can be obtained depending on the choice of the resonator, acting as a building block. The studied filters belong to the more general group of devices inspired by the metamaterial design.

In this work, we explore the ability to dynamically group the Wind Turbine (WT) of a Wind Farm (WF) based on the behaviour of some of their Supervisory Control And Data Acquisition (SCADA) signals to detect the turbines that exhibit abnormal behaviour. We centre this study on a small WF of five WTs. We use the fact that the same signals from different turbines in the same WF coherently evolve temporally in a time domain, describing very similar waveforms. In this contribution, we use averaged signals from the SCADA system and omit maximums, minimums and standard deviations, focusing mainly on velocities and other slowly varying signals. For the temporal analysis, sliding windows of different temporal durations and overlapings are explored. The capability to automatically identify WTs whose signals differ from the group’s behaviour can alert and program preventive maintenance operations on such WTs before a major breakdown occurs.

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

Anomaly Detection in real time data is accepted as a vital research area. Clustering has effectively been tried for this purpose. As the datasets are real time, the time of generating of the data is also important. In this article, we introduce a mixture of partitioning and agglomerative hierarchical approach to detect anomalies from such datasets. It is a two-phase method which follows partitioning approach first and then agglomerative hierarchical approach. The dataset can have mixed attributes. In phase-1, a unified metric defined on mixed attributes is used. The same is also used for merging of similar clusters in phase-2. Also, we have kept the track of time attribute of each data instance which produces the clusters with their lifetimes in phase-1. Then in phase-2, we merge the similar clusters. While merging, the similar clusters, the lifetimes of the corresponding clusters with overlapping cores are to be superimposed producing fuzzy time intervals. This way, each cluster will have an associated fuzzy lifetime. The data instances either belonging sparse clusters or not belonging to any of the clusters can be treated as anomalies. The efficacy of the algorithms can be established using both complexity analysis as well as experimental studies.

In the field of machine learning, cluster analysis has always been a very important technology for determining useful or implicit characteristics in the data. However, the current mainstream cluster analysis algorithms require comprehensive analysis of the overall data to obtain the best parameters in the algorithm. As a result, handling large-scale datasets would be difficult. This research proposes a distributed related clustering mechanism for Unsupervised Learning, which assumes that if adjacent data are similar, a group can be formed by relating to more data points. Therefore, when processing data, large-scale datasets can be distributed to multiple computers, and the correlation of any two datasets in each computer can be calculated simultaneously. Later, results are processed through aggregation and filtering before assembled into groups. This method would greatly reduce the pre-processing and execution time of the dataset; in practical application, it only needs to focus on how the relevance of the data is designed. In addition, the experimental results show the accuracy, applicability, and ease of use of this method.

With increasing constraints on energy and resource markets and the non-decreasing trend in energy demand, the need for relevant clean energy generation and storage solutions is growing and is gradually reaching the individual home. But small-scale energy storage is still an expensive investment in 2022 and the risk/reward ratio is not yet attractive enough for individual homeowners. One solution is for homeowners not to store excess clean energy individually but to produce hydrogen for mutual use. In this paper a collective production of hydrogen for a daily filling of a bus is considered. Following our previous work on the subject, the investigation consists of finding an optimal buy/sell rule to the grid, and the use of the energy with an additional objective: mobility. The dominant technique in the energy community is reinforcement learning, which is however difficult to use when the learning data is limited as in our study. We chose a less data-intensive and yet technically well-documented approach. Our results show that rulebooks, different but more interesting than the usual robust rule, exist and can be cost-effective. But they require fine-tuning as to not deteriorate system performance. In some cases, it is worth missing the H2 production requirement in exchange for higher economic performance.

The sensor nodes have limited computation, sensing, communication capabilities and generally operated by batteries in a harsh atmosphere with non-replenish able power sources. These limitations force the sensor network subject to failure because most of the energy is spent on sensing, computing and data transmission. This paper introduces an Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) to assist Wireless Sensor Networks (WSNs) by (a) extending the lifespan of the network (b) effectively using the battery power (c) decreasing the network overhead and (d) ensuring a high packet transmission ratio with minimal delay. The delay time-based Cluster Head (CH) is elected based on the node degree, residual energy and Received Signal Strength (RSS) to accomplish the goal. Additionally, the RSS-based network partitioning is implemented to evaluate the gradient based on demand routing between source (sensing node) and destination (BS). Whenever the current CH residual energy goes under the threshold level, the proposed protocol performs the clustering process, reducing the exchange of control packets. However, the BS periodically gathers the data from every single CH which helps to reduce the collision and Medium Access Control (MAC) layer conflict. From the simulation results, it is the evident that the proposed protocol performance in terms of average end-to-end latency, packet delivery ratio, average energy consumption and control overhead is better than the well-known current protocols.

A lightweight composite bridge deck system composed of steel orthotropic deck stiffened with thin Ultra-High Performance Concrete (UHPC) layer is developed to eliminate fatigue cracks in orthotropic steel decks. During the construction and operation period of the bridge, the debonding between the steel deck and the UHPC layer may introduce the several issues, such as crack-induced water invasion and distinct reduction of the shear resistance. In the study, an effective and novel non-destructive interface condition monitoring approach using piezoelectric lead zirconate titanate (PZT)-based technologies is proposed to detect interfacial delamination between steel deck and UHPC layer. Experimental tests are performed on several steel-UHPC composite slabs and a conventional steel-concrete composite slab. The thin styrofoam sheets with different sizes and thicknesses are set on different locations of the steel deck as the artificial debondings. The PZT ceramic patches are bonded on the surfaces of the steel deck and UHPC layer as the actuators/sensors. An improved PSO (Particle Swarm Optimization)-K-means clustering algorithms is proposed to obtain the debonding patterns based on the feature data set. The laboratory tests demonstrate that the proposed approach provides an effective and accurate way to detect interfacial debonding of steel-UHPC composite slab.

The Pythagorean fuzzy set (PFS), which is characterized by a membership and a non-membership degree and the square sum of them is less or equal to one, can act as an effective tool to express decision makers’ fuzziness and uncertainty. Considering that the Heronian mean (HM) is a powerful aggregation operator which can take the interrelationship between any two arguments, we study the HM in Pythagorean fuzzy environment and propose new operators for aggregating interval-valued Pythagorean fuzzy information. First, we investigate the HM and geometric HM (GHM) under interval-valued intuitionistic fuzzy environment and develop a series of aggregation operators for interval-valued intuitionistic fuzzy numbers (IVIFNs) including interval-valued intuitionistic fuzzy Heronian mean (IVIFHM), interval-valued intuitionistic fuzzy geometric Heronian mean (IVIFGHM), interval-valued intuitionistic fuzzy weighted Heronian mean (IVIFWHM) and interval-valued intuitionistic fuzzy weighted geometric Heronian mean (IVIFWGHM). Second, some desirable and important properties of these aggregation operators are discussed. Third, based on these aggregation operators, a novel approach to multi-attribute decision making (MADM) is proposed. Finally, to demonstrate the validity of the approach, a numerical example is provided and discussed. Moreover, we discuss several real-world applications of these operators within policy-making contexts.

This article investigates on the radial and non-radial geodesic structures of the generalized K-essence Vaidya spacetime. Within the framework of K-essence geometry, it is important to note that the metric does not possess conformal equivalence to the conventional gravitational metric. This study employs a non-canonical action of the Dirac-Born-Infeld kind. In this work, we categorize the generalized K-essence Vaidya mass function into two distinct forms. Both the forms of the mass functions have been extensively utilized to analyze the radial and non-radial time-like or null geodesics in great details inside the comoving plane. Indications of the existence of wormhole can be noted during the extreme phases of spacetime, particularly in relation to black holes and white holes, which resemble the Einstein-Rosen bridge. In addition, we have also detected the distinctive indication of the quantum tunneling phenomenon around the central singularity.

For a positive integer k, a radio k-coloring of a simple connected graph G = (V (G), E(G)) is a mapping | f(u) - f(v)| ≥ k +1-d (u , v ) such that f :V (G)→{0,1, 2,...} for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k-coloring f, rck(f), is the maximum integer it assigns to some vertex of G. The radio k-chromatic number, rck(G) of G is min{rck(f)}, where the minimum is taken over all radio k-colorings f of G. If k is the diameter of G, then rck(G) is known as the radio number of G. In this work, we propose four algorithms (two serial algorithms and their parallel versions) which related to the radio k-coloring problem. One of them is an approximate algorithm that determines an upper bound of the radio number of a given graph. The other is an exact algorithm which finds the radio number of a graph G. The approximate algorithm is a polynomial time algorithm while the exact algorithm is an exponential time algorithm. The parallel algorithms are parallelized using the Message Passing Interface (MPI) standard. The experimental results prove the ability of the proposed algorithms to achieve a speedup 7 for 8 processors.

With a data revolution underway for some time, there is an increasing demand for formal privacy protection mechanisms that are not so destructive. Hereof microaggregation is a popular high-utility approach designed to satisfy the popular k-anonymity criteria while applying low distortion to data. However, standard performance metrics are commonly based on mean square error, which will hardly capture the utility degradation related to a specific application domain of data. In this work, we evaluate the performance of k-anonymous microaggregation in terms of the loss in classification accuracy of the machine learned models built from perturbed data. Systematic experimentation is carried out on four microaggregation algorithms that are tested over four data sets. The empirical utility of the resulting microaggregated data is assessed using the learning algorithm that obtains the highest accuracy from original data. Validation tests are performed on a test set of non perturbed data. The results confirm k-anonymous microaggregation as a high-utility privacy mechanism in this context and distortion based on mean squared error as a poor predictor of practical utility. Finally, we corroborate the beneficial effects for empirical utility of exploiting the statistical properties of data when constructing privacy preserving algorithms.

In this present paper, we deal with the generalized (k, s)-fractional integral and differential operators recently defined by Nisar et al. and obtain some generalized (k, s)-fractional integral and differential formulas involving the class of a function as its kernels. Also, we investigate a certain number of their consequences containing the said function in their kernels.

Recent advancements in gut microbiome research have highlighted the complex interplay between gut microbiota and various physiological and pathological processes, showing that gut microbiota plays a vital role in human health and disease. Imbalances in the gut microbiota, known as dysbiosis, have been associated with a range of health conditions, including gastrointestinal disorders, metabolic diseases, etc. In response to these findings, probiotics, prebiotics, synbiotics, and postbiotics have emerged as a promising therapeutic strategy to modulate gut microbiota composition and functionality. This review paper explores the latest research on how gut microbiota impacts host physiology, immune responses, and overall well-being. Furthermore, the paper delves into the therapeutic potential of probiotics, postbiotics, prebiotics, and synbiotics in therapeutic applications and curing various diseases. The paper also addresses the challenges and opportunities in the field, highlighting the need for personalized approaches to probiotic therapy and the importance of considering factors such as strain specificity, dosing, and safety.Overall, this review aims to provide a comprehensive overview of the evolving landscape of gut microbiota and probiotics, prebiotics, synbiotics, and postbiotics as novel therapeutic agents. It underscores the potential of harnessing the gut microbiome to improve health, prevent diseases, and complement traditional medical interventions. As research in this field continues to expand, a deeper understanding of the gut microbiota and probiotics, prebiotics, synbiotics, and postbiotics promises new avenues for preventive and therapeutic healthcare strategies.

This work presents the results of a computational study of the chemical reactivity and bioactivity properties of the members of the Theopapuamides A-D family of marine peptides by making use of our own proposed methodology named Computational Peptidology (CP) that has been successfully considered in previous studies of this kind of molecular systems. CP allowed for the determination of the global and local descriptors that come from Conceptual Density Functional Theory (CDFT) that can give an idea of the chemical reactivity properties of the marine natural products under study which are already known to be related to their bioactivity. At the same time, the validity of the procedure based on the adoption of the KID (Koopmans in DFT) technique as well as the MN12SX/Def2TZVP/H2O model chemistry has been successfully verified. Together with several Chemoinformatic tools that can be used for the improvement of process of Virtual Screening, some additional properties of these marine peptides were identified related to their ability to behave as useful drugs. With the further object of analyzing their bioactivity some parameters of usefulness for future QSAR studies, their predicted biological targets and the the ADMET (Absorption, Distribution, Metabolism, Excretion and Toxicity) parameters related to the Theopapuamides A-D pharmacokinetics are also reported.

It is shown that structuring at the microlevel is the intrinsic property of water and aqueous solutions. At room conditions water (including "ultrapure" one) and aqueous solutions are dispersed systems in which microcrystals of NaCl, surrounded by a layer of hydrated water (average diameter - 10-15 microns), are "elementary microparticles", which form the basis of the dispersed phase. Possible ways of formation of these microparticles and their evolution in the process of evaporation of unstructured part of water - dispersion medium - are considered. It is shown, in particular, that they are present in the air as aerosol contaminants. When the ionic strength of the solution increases, the water-salt particles coagulate, forming a new phase - coacervates, remaining on the substrate after evaporation of the liquid part of the water. The aggregates of coacervate structures, formed in a liquid medium, are disordered during heating, which can cause a change in a number of physicochemical properties of water at the temperatures of 50°-60°C range that have not been correctly explained in the framework of atomic-molecular concepts.

The goal of the study presented in this article is to investigate interconnection issues of the Intelligent Electrical Networks (IENs) with the existing ones, as well as the deployment of the appropriate load forecasting demand techniques. The concept of IENs has recently emerged as a potential solution to the global energy problem, due to the more flexible dispersed production units that are involved. In the same context, additional issues, such as the reduction of production-transfer-distribution costs as well as power losses are analyzed as well, via the penetration of Renewable Energy Sources (RESs). To this end, it is necessary to use appropriate advanced infrastructure, where in combination with modern telecommunication networks will make possible the full exploitation of IENs. Moreover, to make the electricity system more efficient, to avoid voltage and frequency imbalance issues and to implement optimal production and consumption planning, the Electric Load Forecast (ELF) is a vital process and plays a key role in the planning as well as in the management of electricity systems. Therefore, recent state of the art approaches in ELF methods are discussed as well.

The application potential of cellulosic materials in natural composites and other fields needs to be explored to develop innovative, sustainable, lightweight, functional biomass materials that are also environmentally friendly. This study investigated Typha augostifolia (Typha sp.) as a potential new raw material for extracting cellulose nanocrystals (CNCs) for application in wastewater treatment composites. Alkaline treatments and bleaching were used to remove cellulose from the stem fibers. The CNCs were then isolated from the recovered cellulose using acid hydrolysis. The study showed a few distinct functional groups (O-H, -C-H, =C-H and C-O, and C-O-C) in the Fourier Transform Infrared (FTIR) spectra. Scanning electron microscope (SEM) revealed the smooth surface of CPC and CNCs that resulted from removing lignin and hemicellulose from powdered Typha augostifolia. Based on the crystalline index, the powdered Typha augostifolia, CPC, and CNCs were 42.86%, 66.94% and 77.41%. The loss of the amorphous section of the Typha sp. fiber resulted in a decrease in particle size. It may be inferred from the features of a Typha sp. CNC that CNCs may be employed as reinforcement in composites for wastewater treatment.

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.

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.

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.

Finding anomalies in the real-time system is recognized as one of most challenging study in information security. It has so many applications like IoT, and Stock-Market. In any IoT system the data generated are real-time, and temporal in nature. Since due to the extreme exposure to Internet and interconnectivity of devices, the IoT systems often face issues like fraud, anomalies, intrusions etc. Discovering anomaly in such domain can be interesting. Clustering and rough set theory have been tried in many cases. Considering the time-stamp associated with IoT data, time-dependent patterns like periodic clusters can be generated which could be helpful for the efficient detection of anomalies by providing more in-depth analysis of the system. In this paper, a mixed method comprising of nano topology, a modified k-means clustering and an interval superimposition technique is used for finding fuzzy periodic clusters in the subspace generated by the nano topology. For every clusters there will be an associated sequence of time-intervals where it exists. The sequence time-intervals accompanying with each clusters may exhibit some remarkable patterns. For example, there may exist different types of periodicity namely yearly, monthly, daily, and hourly etc. For finding such fuzzy periodicity, an operation called interval-superimposition has been used. The time-intervals associated with each cluster are superimposed if they have reasonable overlapping. Each superimposed time-interval generates a fuzzy time-interval. The data instances are thought to be anomalous if they either belong to sparse clusters or don't belong to any clusters. The efficacy of the method can be assessed by means of both time-complexity analysis and comparative studies with existing clustering-based anomaly detection algorithms with a real-life and a synthetic dataset. It can been found experimentally that our method can extract anomaly with 98% of accuracy and it runs cubic time approximately.

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.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

In this paper, we provide a study on the effects of applying classical clustering algorithms, such as k-Means to free text recommender systems. A typical recommender system may face problems when the number of items from a database goes from a few items to hundreds of items. Currently, one of the most prominent techniques to scale the database is applying clustering, however clustering may have a negative impact on the accuracy of the system when applied without taking into consideration the underlying items. In this work, we build a conceptual text recommender system and use k-Means to partition its search space into different groups. We study how the variation of the number of clusters affects its performance in the light of two performance measurements: recommendation time and precision. We also analyze if this clustering is affected by the representation of text we use. All the techniques used in this study uses word-embeddings to represent the document. One of the main findings of this work is that using clustering we can improve the recommendation time in up to almost 30 times without affecting much off its initial accuracy. Another interesting finding is that the increment of the number of clusters is not directly translated into linear performance.

In this paper, we propose a simple tool to help the energy management of a large buildings stock defining clusters of buildings with the same function, setting alert thresholds for each cluster, and easily recognizing outliers. The objective is to enable a building management system to be used for detection of abnormal energy use. First, we framed the issue of energy performance indicators, and how they feed into data visualization (Data Viz) tools for a large building stock, especially for university campuses. Both for Data Viz and clustering algorithm processes, we discussed two possible approaches to choose the right number of clusters and the identification of alert thresholds and outliers, after a brief presentation of the University of Turin's building stock case study. Different Data Viz tools have been studied to apply a specific clustering algorithm, the k-means one. An explorative analysis based on the general Multidimensional detective approach by Inselberg has been performed. Two multidimensional analysis tools, the Scatter Plot Matrix and the Parallel coordinates method have been used. Secondly, the k-means clustering algorithm has been applied on the same dataset in order to test the hypothesis made during the explorative analysis. Data Viz techniques developed in this study revealed to be very useful to explore quickly and simply a large buildings' stock, identifying the worst efficient buildings and clustering them according to their distinct functions.

An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulation or Voronoi diagram). It can quickly identify arbitrarily-shaped clusters while adapting efficiently to non-homogeneous density characteristics of spatial data, without the need of prior knowledge or parameters. The proposed algorithm is also ideal for use in data streaming technology with dynamic characteristics flowing in the form of spatial clustering in large data sets.