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.

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.

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.

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.

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

The 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 inherent capabilities of the K-means++ algorithm to approximate system dynamics within complex systems are subjected by constructing a network structure that captures interconnections among identified components, extending its original purpose as a data clustering method and transforming it into a tool for systems analysis. Leveraging advanced measurement technologies and sophisticated data collection systems, the K-means++ algorithm unveils hidden relationships among components and identifies critical elements. This study explored the algorithm's potential, facilitating the identification of critical components to enhance system operation, control, optimization, and decision-making and examining the practicality and resiliency of the method in real-world application with noisy and limited data. A case study conducted on power systems (IEEE 39-bus and IEEE 300-bus systems) exemplifies K-means++'s capacity to accurately identify critical components and approximate system dynamics, supported by performance metrics affirming its effectiveness and robustness in system analysis through measurements of bus similarity within clusters based on standard deviation and comparison of net tie-line flows in equivalent networks with the original network across scenarios. Performance metrics, including the Silhouette Score, Davies-Bouldin Index, and Variation of Information (VI) score, further validated K-means++'s performance, yielding reliable and consistent results.

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.

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.

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.

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.

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.

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.

Clustering is a crucial at the same time challenging task in several application domains. It is important to incorporate the optimum feature finding into our clustering algorithms for getting better prediction accuracy but this is difficult when there is no or little information about the importance or relevance of features. To tackle this task in an efficient manner we employ the natural evolution process inherent in genetic algorithms (GA) to find the optimum features for clustering for the healthy aging dataset. In order to empirically verify the findings, genetic algorithms were combined with a number of clustering algorithms including parti-tional, density based as well as agglomerative. A variant of the popular KMeans algorithm, named KMeans++ gave the best performance on all performance metrics when combined with GA.

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

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

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

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

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

Data mining plays a critical role in the sustainable decision making. The k-prototypes algorithm is one of the best-known algorithm for clustering both numeric and categorical data. Despite this, however, clustering a large number of spatial object with mixed numeric and categorical attributes is still inefficient due to its high time complexity. In this paper, we propose an efficient grid-based k-prototypes algorithms, GK-prototypes, which achieves high performance for clustering spatial objects. The first proposed algorithm utilizes both maximum and minimum distance between cluster centers and a cell, which can remove unnecessary distance calculation. The second proposed algorithm as extensions of the first proposed algorithm utilizes spatial dependence that spatial data tend to be more similar as objects are closer. Each cell has a bitmap index which stores categorical values of all objects in the same cell for each attribute. This bitmap index can improve the performance in case that a categorical data is skewed. Our evaluation experiments showed that proposed algorithms can achieve better performance than the existing pruning technique in the k-prototypes algorithm.

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

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.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

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.

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

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

Direct competitions involve competitors that mutually contend for the same resource or objective. A controlled, well-documented, and data-rich field involving direct competition is represented by sports. Usually the winner of sports competitions is believed to be the one with the greatest talent, however, there are other factors that contribute to the outcome of a competition, there are in fact random, unpredictable events that can change the outcome of a competition. For this reason, if one wants to understand the properties of a competition is necessary to have a method to evaluate the importance of the talent or aptitude of a competitor, as opposed to the importance of chance, in determining the outcome of the competition itself. In this work we study the sport of tennis using the data obtained from the Association of Tennis Professionals (ATP) tournaments. We construct an agent-based model that is able to produce data analogous to the real one; this model depends on three parameters, the talent, the action of chance, and the weight of talent. In particular, we don't fix the values of these parameters and we fit the model results using a genetic algorithm, in this way, we study all the possible combinations of parameters, in the parameter space, that are able to reproduce the real systems data. We show that the model fits well the real data only for limited regions of the parameter space. On these limited regions of the parameter space are possible further optimization of the model results, limiting the values of parameters. In this way, our agent-based model, by means of this genetic algorithm calibration, is able to provide us with useful information without any a priori constraints.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

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.

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.

Blockchains such as the bitcoin blockchain depend on reaching a global consensus on the distributed ledger; therefore, they suffer from well know scalability problems. This paper proposes an algorithm that avoids double-spending in the short term with just O(√n) messages; each node receiving money off-chain performs the due diligence of consulting k√n random nodes to check if any of them is aware of double-spending. Two nodes receiving double-spent money will in this way consult at least one common node with very high probability, due to the ‘birthday paradox’, and any common honest node consulted will detect the fraud. Since the velocity of money in the real world has coins circulating through at most a few wallets per day, the size of the due diligence communication is small in the short term. This `k-root-n’ algorithm is suitable for an environment with synchronous or asynchronous (but with fairly low latency) communication and with Byzantine faults. The presented k-root-n algorithm should be practical to avoid double-spending with arbitrarily high probability, while feasibly coping with the throughput of all world commerce. It is resistant to Sybil attacks even beyond 50% of nodes. In the long term, the k-root-n algorithm is less efficient. Therefore, it should preferably be used as a complement and not a replacement to a global distributed ledger technology.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

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.

Pavement crack detection is one of the key links in highway pavement maintenance management. In the current road crack detection, the network model easily ignores the shallow geometric features of cracks and cannot extract the key feature information of cracks. Aiming at the above problems, an EC-YOLOX network model is proposed. The CFPN is constructed to cross-fuse different scale features to solve the feature scale invariance. In the strengthen feature extraction layer, ECANet is fused to enhance the ability to pay attention to key information. The WEIoU loss function is proposed, which assigns different penalty terms to the target box in the vertical and horizontal directions. In terms of data, geometric distortion constraint correction is performed on the single-point perspective pavement image. The experimental data show that the accuracy of EC-YOLOX on the self-built data set reaches 76.34% [email protected], which is 4.45% higher than that of YOLOX. The loss curve of EC-YOLOX is smoother than that of YOLOX, and the minimum training loss value is 2.136, which is 0.648 lower than the minimum loss value 2.784 of YOLOX. Many experiments have verified the effectiveness of EC-YOLOX in improving the detection effect in pavement crack detection.

Classifying network flow subsequences in an Industrial IoT gateway is an effective method for identifying Industrial IoT faults. This paper proposes a subsequence classification algorithm SSGBUL-IKNN based on unsupervised learning encoding to address the problem of low classification accuracy. Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the Industrial IoT gateway. In the encoding module, a subsequence calibration algorithm controls the increasing error during the coding process. Then, the specific fault type is obtained through an improved KNN classification algorithm based on the indication distance source from the integrated coding sequences converted by multi-dimensional network flow sequences. The test result on three Industrial IoT datasets of a sewage treatment plant shows that the accuracy of SSGBUL-IKNN in this paper exceeds 92%, significantly higher than the algorithm DTW and TSF. It reaches the classification requirements of Industrial IoT fault diagnosis.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

The paper presents an error model of a measurement chain containing link performing discrete wavelet transform algorithm which is most often the last stage of measurement signal processing. The goal is to determine the uncertainty budget of the input quantities of the wavelet transform algorithm. The error model takes into account parts of analog, analog-to-digital and digital processing, describing the properties of subsequent fragments of the chain using their transmittance and processing functions. The proposed model enables the description of both deterministic and non-deterministic properties of signal errors. The proposed model was validated using an example measurement chain created for this purpose.

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.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

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.

In this paper, possibilities for the bandwidth and wavelength utilization in future next-generation passive optical networks are presented and reasons for realizing and utilizing of extended dynamic wavelength and bandwidth algorithms for NG-PON2 networks are analyzed. Next, principles of the effective dynamic bandwidth allocation are introduced in details, focused on the importance of the decision criterion optimization. For achieving better bandwidth utilization of dedicated wavelengths, this paper is focused on the novel effective dynamic bandwidth allocation algorithm with adaptive allocation of wavelengths to ONU units and on the optimization of the decision criterion. For analyzing the novel extended DWBA algorithm utilizing for various wavelength allocation cases possible in NG-PON2 networks, a simulation program with the enhancement of the EDBA algorithm is realized. Finally, an optimization of the decision criterion defining a minimum bandwidth utilization of the actual wavelength is executed for NG-PON2 networks based on the hybrid TWDM technique.

Depth-sensing technology has led to broad applications of inexpensive depth cameras that can capture human motion and scenes in 3D space. Background subtraction algorithms can be improved by fusing color and depth cues, thereby allowing many issues encountered in classical color segmentation to be solved. In this paper, we propose a new fusion method that combines depth and color information for foreground segmentation based on an advanced color-based algorithm. First, a background model and a depth model are developed. Then, based on these models, we propose a new updating strategy that can eliminate ghosting and black shadows almost completely. Extensive experiments have been performed to compare the proposed algorithm with other, conventional RGB-D algorithms. The experimental results suggest that our method extracts foregrounds with higher effectiveness and efficiency.

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.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

The calculation of the surface tension of ordinary organic and ionic liquids, based on a computer algorithm applying a refined group-additivity method, is presented. The refinement consists of a complete breakdown of the molecules into their constituting atoms, further distinguishing them by their immediate neighbour atoms and bond constitution. The evaluation of the atom-groups’ contributions was carried out by means of a fast Gauss-Seidel fitting method founded upon the experimental data of 1895 compounds from literature. The result has been tested for plausibility using a 10-fold cross-validation (cv) procedure. The direct calculation and the cv test proved the applicability of the present method by the close similarity and excellent goodness of fit R2 and Q2 of 0.9023 and 0.8821, respectively. The respective standard deviations are ±2.01 and ±2.16 dyn/cm. Some correlation peculiarities have been observed in a series of ordinary and ionic liquids with homologous alkyl chains which are illustrated and discussed in detail, exhibiting the limit of the present method.

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.

Insulated Gate Bipolar Transistor (IGBT) may convey high current and sustain high breakdown voltages; it may provide high power control. In a sense, how IGBT demonstrates the capability of power control was not specifically described, and the equivalent bipolar junction transistors (BJT) activated by an applied bias to the insulated gate is intriguing. As seen in Figure 1, IGBT shows an equivalent circuit structure containing two types of BJT, (NPN-type Bipolar transistor and PNP-type Bipolar transistor), which can be modeled as diode-associated transistor. Apparently, as a bias applies to the controlling gate, the channel beneath the gate oxide gets strongly inversed and turns out to be conductive just like what happens on metal-oxide-silicon field effect transistor (MOSFET), which provides necessary igniting currents to both BJTs and thus causes high current gain flowing through them-selves from the bottom. A proposed and renewed formula provides addressing the above scenario and successfully fitting the measured data that forms the characteristic curves. Some parameters in the proposed formula, which includes size and mobility associated constant, threshold voltage, and Early-Voltage-related lambda for MOSFET, explain and explore the underlying physics. IGBT thus enjoy high input impedance and high current gain due to MOSFET (Insulated Gate) and BJT, respectively. This formula combines both merits of MOSFET and BJT in order to fit the measured data. Indeed, the formula intimately fits IGBT electrical characteristic curves, and thus may be qualified and served as a model. The new model is then advisable for designing power integrated circuit to exactly achieve power saving, power control, and power efficiency.

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.

Deadlock is a real problem that can cause expensive, time-dependent hang-ups or failures in distributed computing systems. Some studies have been conducted with deadlock detection and resolution in generalized request computing models, most of these studies are based on the diffusing computation scheme, where forward and backward propagated probe and reply messages respectively are diffused between dependent processes. The replies carry the dependency information between processes for the initiator. Using this dependency information initiator can detect and resolve the deadlock cycle. It has been proven in the literature that a deadlock cycle length distribution is skewed with a large majority of cycles (90%) having length two. Based on this fact an improved algorithm is proposed for handling deadlock detection in distributed computing systems under the distributed request model where each process has several requests at a time. The improved algorithm depends mainly on message propagation and timeout policy. Probe and reply messages are propagated between the initiator and its successors only to detect deadlock cycles between them. Global timeout policy is used to detect potential deadlock cycles with large length distribution. The proposed algorithm can handle concurrent executions. Simulation experiments are performed to see the effectiveness of the improved algorithm. It is found that the improved algorithm compares favorably with other existing algorithms and it shows better results for several performance metrics especially in reducing deadlock latency and execution time.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

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.

Detection of subsurface archaeological remains using a range of remote sensing methods, poses several challenges until today. Recent studies regarding the detection of archaeological proxies like those of cropmarks highlight the complexity of the phenomenon. In this work we present three different methods, and associated indices, for identifying stressed reflectance signatures indicating buried archaeological remains, based on a dataset of measured ground spectroradiometric reflectance. Several spectral profiles between the visible and near infrared part of the spectrum, were taken over a controlled environment in Cyprus during the 2011-2012 and are re-used in this study. The first two (spectral) methods are based on a suitable analysis of the spectral signatures in (1) the visible part of the spectrum, and in particular in the neighborhood of 570 nm, and (2) the red edge-near infrared part of the spectrum, in the neighborhood of 730 nm. Machine learning (decision trees) allows for the deduction of suitable wavelengths to focus on, in order to formulate the proposed indices and the associated classification criteria (decision boundaries) that can enhance the detection probability of stressed vegetation. Noise in the signal is taken into account by simulating reflectance signatures perturbed by white noise. Applying decision tree classification on the ensemble of simulations and basic statistical analysis we refine the formulation of the indices and criteria for the noisy signatures. The success rate of the proposed methods is over 90%. The third method rests on the estimation of vegetation/canopy reflectance parameters through inversion of the physical-based PROSAIL reflectance model and the associated classification through machine learning methods. The obtained results provide further insights into the formation of stress vegetation that occurred due to the presence of shallow buried archaeological remains, which are well aligned with physical-based models and existing empirical knowledge. To the best of the authors' knowledge, this is the first study demonstrating the usefulness of radiative transfer models such as PROSAIL for understanding the formation of cropmarks. Similar studies can support future research directions towards the development of regional remote sensing methods and algorithms if systematic observations are adequately dispersed in space and time.

Abstract The aim of the present review is to discuss the roles of vitamin K and vitamin K-dependent proteins, and the combined action of the vitamins K and D, for maintenance of bone health. The most relevant vitamin K-dependent proteins in this respect are osteocalcin and matrix Gla-protein (MGP). When carboxylated these proteins appear to have the ability to chelate and import calcium from the blood to the bone, thereby reducing the risk of osteoporosis. Carboxylated osteocalcin appears to contribute directly to bone quality and strength. Adequate vitamin K status is required for carboxylation of MGP and osteocalcin. In addition, vitamin K acts on bone metabolism by other mechanism, such as a ligand for the nuclear steroid and xenobiotic receptor (SXR). In this narrative review, we examine the evidence for increased bone mineralization through dietary adequacy of vitamin K (phylloquinone or menaquinone). Summarizing the evidence for a synergistic effect of vitamin K and vitamin D3 we find that an adequate supply of vitamin K on top of an optimal vitamin D status seems to add to the benefit for maintaining bone health. More research related to synergism and possible mechanisms of vitamins D3 and K interaction in bone health is needed.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

Gaze tracking of high-speed moving targets is a novel application mode for low Earth orbit microsatellites. In this mode, small satellites are equipped with high-resolution narrow-field-of-view video cameras for stable gaze-tracking imaging of high-speed moving targets. This paper proposes a high-precision attitude adaptive integral sliding mode control method with a feedforward compensation disturbance observer to enhance the capability of a microsatellite attitude control system for gaze tracking of high-speed moving targets. Specifically, first, we present the attitude control system model for microsatellites and the calculation method for the desired attitude of target tracking based on image feedback. Then, an adaptive integral sliding mode attitude control algorithm with a feedforward compensation disturbance observer, which meets the requirements of high-precision tracking control, is designed. The developed algorithm utilizes the disturbance observer to observe the friction torque of the flywheel and compensates for it through feedforward control. It also employs the adaptive integral sliding mode control algorithm to reduce the impact of uncertain disturbances, decrease the steady-state error of the system, and enhance the attitude control precision. Simulation experiments demonstrated that the designed disturbance observer can successfully observe the frictional disturbance torque of the flywheel. The attitude Euler angle control precision for high-speed moving target tracking reached 0.009°, and the angular velocity control precision reached 0.005°/s, validating the effectiveness of the proposed approach.

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.

Count data analysis presents unique challenges due to its discrete nature, often exhibiting excessive zeros and overdispersion. To address these complexities, count models, such as Poisson regression and Negative Binomial regression, have been developed, enabling modeling and prediction of count-based phenomena. Additionally, it’s important to notice that zero inflation, a phenomenon commonly observed in count data, requires specialized techniques for robust analysis. This article provides an overview of count data and count models, explores zero inflation, introduces Likelihood Ratio Tests, and explains how the Vuong Test can be used as a model selection criteria. Furthermore, we created a Vuong Test implementation from scratch using the Python programming language. This implementation enhances the accessibility and applicability of the Vuong Test in real-world scenarios, providing a valuable contribution to the academic community, since Python didn’t have an implementation of this statistical test.

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.

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.

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.

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.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

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.

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

The calculation of the isobaric heat capacities of the liquid and solid phase of molecules at 298.15 K is presented, applying a universal computer algorithm based on the atom-groups additivity method, using refined atom groups. The atom groups are defined as the molecules' constituting atoms and their immediate neighbourhood. In addition, the hydroxy group of alcohols are further subdivided to take account of the different intermolecular interactions of primary, secondary and tertiary alcohols. The evaluation of the groups' contributions has been carried out by means of a fast Gauss-Seidel fitting calculus using experimental data from literature. Plausibility has been tested immediately after each fitting calculation using a 10-fold cross-validation procedure. For the heat capacity of liquids, the respective goodness of fit of the direct (R2) and the cross-validation calculations (Q2) of 0.998 and 0.9975, and the respective standard deviations of 8.2 and 9.16 J/mol/K, together with a medium absolute percentage deviation (MAPD) of 2.69%, based on the experimental data of 1133 compounds, proves the excellent predictive applicability of the present method. The statistical values for the heat capacity of solids are only slightly inferior: for R2 and Q2, the respective values are 0.9915 and 0.9875, the respective standard deviations are 12.19 and 14.13 J/mol/K and the MAPD is 4.65%, based on 732 solids. The predicted heat capacities for a series of liquid and solid compounds has been directly compared to those received by a complementary method based on the "true" molecular volume [1] and their deviations elucidated.

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.

P-band radar remote sensing applied during the Airborne Microwave Observatory of Subcanopy and Subsurface (AirMOSS) mission has shown great potential for estimation of root zone soil moisture. When retrieving the soil moisture profile (SMP) from P-band radar, a mathematical function describing the vertical moisture distribution is required. Because only a limited number of observations are available, the number of free parameters of the mathematical model must not exceed the number of observed data. For example, a second order polynomial that contains 3 free parameters was presumed based on in-situ SMP data. The polynomial is currently parameterized based on 3 backscatter observations provided by AirMOSS (i.e. one frequency at three polarizations of HH, VV and HV). In this paper, a more realistic, physically-based SMP model containing 3 free parameters is derived based on a solution to Richards’ equation for unsaturated flow in soils. Evaluation of the new SMP model based on both numerical simulations and measured data revealed that it exhibits greater flexibility for fitting measured and simulated SMPs than the currently applied polynomial. It is also demonstrated that the new SMP model can be reduced to a second order polynomial at the expense of fitting accuracy.

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.