This study delves into the impact of artificial intelligence on students’ learning.The paper pioneers the use of kmeans classification to reduce the dimensionality of features before the classification process, which minimizes redundant information and computational overhead. This step is not commonly found in prior research.Firstly, a random forest model is established with “whether AI assistance was used to complete the paper” as the output, and various features as inputs. The analysis of the predictive accuracy when changing input features reveals the degree of influence of each feature on using AI to complete the paper. After feature selection, the remaining 6 features can still effectively predict the use of AI to complete the paper, indicating the representativeness of the extracted indicators. Subsequently, the PCA-K-means algorithm is employed to classify the use of artificial intelligence. PCA algorithm is used for dimensionality reduction of the extracted features to better characterize students’ use of AI. Three representative variables are selected, and the contribution of each feature is computed based on the factor loading matrix. Finally, the K-means algorithm is used to classify students based on the three dimensional features, showing that students can be effectively classified into 2 categories. The results indicate that the majority of students support the use of AI technology to enhance their abilities, although some students may only intend to use AI to cope with exams and similar tasks.

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$.

(1) Background: The rapid evolution of the internet and technological infrastructure has led to a surge in data generation across various contexts, increasing the use of machine learning tools to extract valuable information. Clustering, particularly using the K-means algorithm, is a common technique. However, determining the optimal number of clusters in K-means is challenging, as traditional methods like the elbow method can be imprecise and subjective. This study proposes a more accurate and objective method to identify the optimal number of clusters. (2) Methods: The proposed method utilizes the numerical derivative of cluster inertias and the maximum value of the ratio between contiguous derivatives. Implemented in Python using sklearn, numpy, and matplotlib, the method was validated with synthetic datasets generated by artificial intelligence, where cluster numbers are clearly distinguishable. (3) Results: The method proved to be more precise and less subjective than the traditional elbow method, accurately identifying the optimal number of clusters in all tested synthetic datasets. Additionally, it demonstrated computational efficiency with minimal RAM usage and execution time, making it suitable for practical data analysis applications. (4) Conclusions: This new mathematical and computational method significantly improves the determination of the optimal number of clusters in K-means, offering a more accurate and objective alternative to traditional techniques. Future work will extend this method to hierarchical clustering and develop a cloud service for wider accessibility.

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.

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.

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.

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.

This study investigates the intricate relationships between happiness, sustainability, and cultural values across 74 countries. Utilizing a multidimensional scaling (MDS) and K-means clustering approach, we analyze six happiness indices alongside the Sustainable Development Goals Index (SDGI). Our findings indicate a positive correlation between economic development, social progress, and elevated levels of both happiness and sustainability. Nevertheless, instances like the United States highlight the necessity of alternative methodologies, highlining classification of nonlinear models. The MDS analysis identifies four distinct clusters of countries, each demonstrating similar profiles in terms of happiness, sustainability, and cultural values, as per Inglehart's framework. This clustering underscores the necessity for a comprehensive perspective that integrates economic, social, and cultural dimensions to produce robust results and mitigate disparities or contradictions in subjective measures like the World Happiness Score. Future research should explore the impact of institutional frameworks, governance models, and social capital. Additionally, longitudinal studies are needed to examine how these relationships evolve in response to global challenges. We acknowledge the limitations related to data heterogeneity, the subjectivity of cluster analysis, and the exclusion of outliers, emphasizing the need for further research to enhance the generalizability and robustness of these findings.

The 6TiSCH protocol (IEEE 802.15.4e) is crucial for the Industrial Internet of Things (IIoT), utilizing a time-slotted channel hopping (TSCH) mode based on node distribution. In our experiment, we explored node position clustering and adjusted the capacity of existing cells in congested areas to understand traffic patterns and optimize cell selection for TSCH resource allocation, particularly in slot frames. Efficient cell allocation prevents packet loss, manages congestion, and enhances data transmission reliability. Node clustering increases cell usage efficiency and reduces communication latency between nodes, with each cell allocation tailored to its traffic needs through the sink node from the clustering result. We evaluated the clustering method using the K-means algorithm through experiments using the 6TiSCH simulator. Additionally, we considered using the routing protocol for low power and lossy networks (RPL) as a comparison, such as OF0 and MRHOF, as the objective function to assess clustering results and their impact on throughput and packet delivery. Our method significantly improved average performance metrics: under the OF0 routing protocol, we achieved a 30.01% latency reduction, 15.95% faster joining time, 8% higher packet delivery ratio, and 13.82% throughput increase. Similarly, with the MRHOF routing protocol, we observed a 12.34% improvement in packet delivery ratio, 21.06% latency reduction, 12.68% faster joining time, and 25.97% higher throughput speed.

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.

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.

Sugarcane (Saccharum spp.) is a crop of great industrial and alimentary importance, essential for the production of numerous products. Given its significance, genetic improvement programs exist that involve a rigorous study process, from material selection to the development of new varieties, requiring at least seven selection phases. This study modeled the growth curve of the sucrose percentage (SP) in 33 hybrids and six control varieties (MEX 69-290, ITV 92-1424, CP 72-2086, COLMEX 94-8, COLMEX 95-27, RB 85-5113) during the plant and ratoon periods in the experimental fields of the Melchor Ocampo Sugar Mill, Jalisco, Mexico. For clustering the materials, k-means, k-medoids, and Density-based spatial clustering of applications with noise (DBSCAN) algorithms were used, considering four maturity types among the control varieties. The DBSCAN algorithm proved to be the most effective, as the means between groups were not statistically equal. The hybrids identified as candidates for subsequent phases due to their high SP were COSTA JAL, ATEMEX 99-48, ATEMEX 99-1, ATEMEX 99-61, MEX 70-486, MEX 80-1521, ITSAMEX 07-44814, ITSAMEX 06-6395, and ITSAMEX 07-1903. These results are crucial for improving the productivity and sustainability of the crop, with significant implications for the sugar industry.

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.

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.

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.

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.

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.

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.

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.

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

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

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.

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.

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.

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.

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.

K-band radar waves have high penetration and low attenuation coefficients. However, the wavelength of this radar wave is relatively short; thus, designing and preparing both broadband and wide-angle radar wave absorbers in this band presents considerable challenges. In this study, a resin-based K-band radar wave absorber with a biomimetic lotus leaf structure was designed and formed by UV curing. Here, microscale lotus leaf papillae and antireflection structures were prepared using a DLP 3D printer, and the contact angle between the material and water droplets was increased from 56° to 130°. In addition, the influence of the geometric parameters of the lotus leaf antireflection structure on the electromagnetic absorption performance and mechanical strength was investigated. After simulation optimization, the maximum electromagnetic loss of the lotus leaf structure 3D printed sample was −32.3 dB, and the electromagnetic loss was below −10 dB in the 20.8–26.5 GHz frequency range. When the radar incidence angle was 60°, the maximum electromagnetic loss was still less than −10 dB. The designed lotus leaf structure has a higher mechanical energy absorption per unit volume (337.22 KJ/m3) and per unit mass (0.55 KJ/Kg) than commonly used honeycomb lightweight structures during the elastic deformation stage, and we expect that the designed structure can be used as an effective lightweight material for K-band radar stealth.

In aerospace, robotics, network engineering and mechanical engineering, there exist complex and urgent challenges that can be abstracted into mathematical optimization problems. Therefore, exploring solutions to these optimization problems is a crucial task. Metaheuristic algorithms have been applied across various fields.The Snake Optimization Algorithm (SO) is an innovative metaheuristic method recognized for its efficient solving capabilities.However, this algorithm encounters challenges such as diminished search efficiency in the later stages and a propensity to become ensnared in local optima. To mitigate these issues, this paper introduces an enhanced Snake Optimization Algorithm (ISO). ISO integrates the RIME Algorithm(RIME)and introduces two effective enhancement strategies to improve its capability to evade local optima.To assess the effectiveness of ISO,the population distribution state was first measured using three algorithms, including Star Discrepancy, and the exploration and exploitation performance was analyzed using the CEC2017 test functions. Subsequently, utilized 23 benchmark functions for testing.The evaluation outcomes indicate that ISO exhibits outstanding performance in terms of convergence velocity and robustness.Additionally, it was applied to engineering fields including UAV path planning,Robot path planning, Wireless sensor network node deployment and Pressure vessel design.In comparison to the SO algorithm, the ISO algorithm demonstrates superior stability, converges earlier, and improves its ability to solve for optimal .These findings highlight the significant potential of the ISO algorithm in diverse test functions and a wide range of interdisciplinary problems.

The development of the finite element method (FEM) combined block polynomial interpolation with the concepts of finite difference formats and the variation principle. Because of this combination, FEM overcomes the shortcomings of traditional variation methods while maintaining the benefits of current variation methods and the flexibility of the finite difference method. As a result, FEM is an advancement above the traditional variation methods. The aim of the study is to experimentally determine the thermal behavior of two stomatognathic systems, one control and the other presenting orthodontic treatment by means of a fixed metallic orthodontic appliance, both being subjected to several thermal regimes. In order to carry out this experimental study, we examined the case of a female subject, who was diagnosed with Angle class I malocclusion. The patient underwent a bimaxillary CBCT investigation before initiating the orthodontic treatment. A three-dimensional model with fully closed surfaces was obtained by using the InVesalius and Geomagic programs. Like the tissues examined in the patient, bracket and tube-like components, as well as orthodontic wires, can be included to these models. Once it is finished and geometrically accurate, the model is exported to a FEM-using program, such as Ansys Workbench. The intention was to study the behavior of two stomatognathic systems (with and without a fixed metallic orthodontic appliance) subjected to very hot food (70 ⁰C) and very cold food (-18 ⁰C). From the analysis of the obtained data, it was concluded that, following the simulations carried out in the presence of the fixed metallic orthodontic appliance, significantly higher temperatures were generated in the dental pulp.

Detecting small objects in images poses significant challenges due to their limited pixel representation and the difficulty in extracting sufficient features, often leading to missed or false detections. To address these challenges and enhance detection accuracy, this paper presents an improved small object detection algorithm, CRL-YOLOv5. The proposed approach integrates the CBAM attention mechanism into the C3 module of the backbone network, which enhances the localization accuracy of small objects. Additionally, the Receptive Field Block (RFB) module is introduced to expand the model's receptive field, thereby fully leveraging contextual information. Furthermore, the network architecture is restructured to include an additional detection layer specifically for small objects, allowing for deeper feature extraction from shallow layers. When tested on the VisDrone2019 small object dataset, CRL-YOLOv5 achieved an mAP50 of 39.2%, representing a 5.4% improvement over the original YOLOv5, effectively boosting the detection precision for small objects in images.

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.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

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 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.

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.

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.

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.

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.

Non-Vitamin K Oral Anticoagulants (NOACs) have revolutionized anticoagulant therapy, offering improved safety and efficacy over traditional agents like warfarin. This review comprehensively examines the dual roles of NOACs—Apixaban, Rivaroxaban, Edoxaban, and Dabigatran—not only as anticoagulants but also as modulators of inflammation via Protease-Activated Receptor (PAR) signaling. We highlight the unique pharmacotherapeutic properties of each NOAC, supported by key clinical trials demonstrating their effectiveness in preventing thromboembolic events. Beyond their established anticoagulant roles, emerging research suggests that NOACs influence inflammation through PAR signaling pathways, implicating factors such as FXa and Thrombin in the modulation of inflammatory responses. This review synthesizes current evidence on the anti-inflammatory potential of NOACs, exploring their impact on inflammatory markers and conditions like atherosclerosis and diabetes. By delineating the mechanisms by which NOACs mediate anti-inflammatory effects, this work aims to expand their therapeutic utility, offering new perspectives for managing inflammatory diseases. Our findings underscore the broader clinical implications of NOACs, advocating for their consideration in therapeutic strategies aimed at addressing inflammation-related pathologies. This comprehensive synthesis not only enhances understanding of NOACs' multifaceted roles but also paves the way for future research and clinical applications in inflammation and cardiovascular health

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.

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.

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.

This paper aims to explore the potential application of Extreme Learning Machines (ELM) in stock price prediction and optimise the ELM model by combining the Crown Porcupine Optimisation Algorithm and the Adaptive Bandwidth Kernel Function Density Estimation Algorithm. Specifically, the model's root mean square error (RMSE) on the test set is 0.018, which shows its good prediction accuracy. Meanwhile, the correlation coefficient R reaches 0.968, proving the model's effectiveness in predicting stock prices. In addition, the coefficient of determination R² of the training set and test set are 0.987 and 0.954, respectively, which are not much different, indicating that the model has good generalisation ability and is not prone to overfitting. This is crucial for practical application, as it implies that the model fits the existing data well and makes accurate predictions for future data. In terms of other evaluation metrics such as Mean Absolute Error (MAE), Root Mean Square Error (RMSE) and Mean Absolute Percentage Error (MAPE), the performance is excellent in both the training and test sets. Together, these results indicate that after optimising the ELM by introducing the crown porcupine optimisation algorithm and the adaptive bandwidth kernel function density estimation algorithm, the model can effectively capture the changing stock price pattern, thus achieving efficient and accurate stock price prediction. In summary, this study not only demonstrates the great potential of ELM in stock price prediction but also highlights the importance of improving the model performance through advanced algorithm optimisation, which provides a new way of thinking and methodology for financial market analysis. This strongly supports investors' decision-making and lays the foundation for related research.

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.

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.

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.

Mobile inspections conducted by intelligent tunnel robots are instrumental in broadening the inspection reach, economizing on inspection expenditures, and augmenting the operational efficiency of inspections. Despite differences from fixed surveillance, mobile-captured traffic videos have complex backgrounds and device conditions that interfere with accurate traffic event identification, warranting more research. This paper proposes an improved algorithm based on YOLOv9 and DeepSORT for intelligent event detection in edge computing mobile device using the intelligent tunnel robot. The enhancements comprise the integration of the Temporal Shift Module to boost temporal feature recognition and the establishment of logical rules for identifying diverse traffic incidents in mobile video imagery. Experimental results show that our fused algorithm achieves a 93.25% accuracy rate, an inprovement of 1.75% over the baseline. The algorithm is also applicable to inspection vehicles, drones, and autonomous vehicles, effectively enhancing the detection of traffic events and improving traffic safety.

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.

YOLOv8, as an efficient object detection method, can swiftly and precisely identify objects within images. However, traditional algorithms encounter difficulties when detecting small targets in remote sensing images, such as missing information, background noise, and interactions among multiple objects in complex scenes, which may affect performance. To tackle these challenges, we propose an enhanced algorithm optimized for detecting small objects in remote sensing images, named HP-YOLOv8. Firstly, we design the C2f-D-Mixer (C2f-DM) module as a replacement for the original C2f module. This module integrates both local and global information, significantly improving the ability to detect features of small objects. Secondly, we introduce a feature fusion technique based on attention mechanisms, named Bi-Level Routing Attention in Gated Feature Pyramid Network (BGFPN). This technique utilizes an efficient feature aggregation network and reparameterization technology to optimize information interaction between different scale feature maps, and through the Bi-level Routing Attention (BRA) mechanism, it effectively captures critical feature information of small target objects. Finally, we propose the Smooth Mean Perpendicular Distance Intersection over Union (SMPDIoU) loss function. The method comprehensively considers the shape and size of detection boxes, enhances the model's focus on the attributes of detection boxes and provides a more accurate bounding box regression loss calculation method. To demonstrate our approach's efficacy, we conduct comprehensive experiments across the RSOD, NWPU VHR-10, and VisDrone2019 datasets. The experimental results show that the HP-YOLOv8 achieves 95.11%, 93.05%, and 53.49% in the [email protected] metric, and 72.03%, 65.37%, and 38.91% in the more stringent [email protected]:0.95 metric, respectively.

:Peat substrate is made from peat from drained peatlands, which is a limited resource. A realistic estimate is that 50% of the world’s wetlands have been lost. Peat is used in horticulture, especially for the cultivation of vegetables in greenhouses. The consequences of peatland exploitation are an in-crease in the greenhouse effect and a decrease in carbon stocks. Wood fiber can be used as an al-ternative to peat. The chemical properties of the growing media interact and change continuously due to the small volume of the growing media, which is limited by the growing container. This study aims to gain new knowledge on the impact of nutrient changes in the microbial degradation of carbon compounds in wood fiber and mixtures with peat substrate on the content and uptake of nutrients required by plants. Cucumbers (Cucumis sativus L.) variety “Dirigent H” developed in the Netherlands, were cultivated in growing media of peat substrate and wood fiber: (1) peat substrate (PS); (2) wood fiber (WF); (3) wood fiber and peat substrate 50/50 v/v (WF/PS 50/50); (4) wood fiber and peat substrate 25/75 v/v (WF/PS 25/75). The rates of fertilization were the following: (1) con-ventional fertilization (CF); (2) N13; (3) N23; (4) N30. The experiment was carried out in three repli-cations. As the amount of wood fiber increased, the humidity and pH of the growing medium in-creased. Fertilization of cucumbers with different rates of nitrogen influenced the nutrient uptake. Plants grown in 50/50 and 25/75 growing media had the best Cu uptake when fertilized with N23. When the plants grown in the wood fiber media and the 50/50 media were fertilized with N13, N23, and N30, the Mn content in the growing media at the end of the growing season was significantly lower than the Mn content in the media with conventional fertilization. Thus, nitrogen improved the uptake of Mn by plants grown not only in the wood fiber but also in combinations with peat sub-strate. Growing plants in wood fiber and fertilizing them with N13 can result in optimum uptake of micronutrients. The number and mass of cucumber fruits per plant were influenced by the amount of wood fiber in the growing media and the application of nitrogen fertilizer. The highest number of fruits and mass of fruits per plant was obtained significantly higher when cucumbers were grown on WF/PS 50/50 growing media with additional N13 fertilization.

: Greenhouse plants are usually grown in containers filled with growing media. Peat is the main component of the growing media used in greenhouses. However, peat substrate is made from peat from drained peatlands, which is a limited resource. Wood fiber can be an alternative to use as a growing media for controlled-climate crops. The chemical properties of the growing media interact and change continuously due to the small volume of the growing media, which is limited by the vegetative container. Therefore, this study aims to gain new knowledge on the impact of nutrient changes in the microbial degradation of carbon compounds in wood fiber and mixtures with peat substrate on the content and uptake of nutrients required by plants. Cucumbers (Cucumis sativus L.) were cultivated in growing media of peat substrate and wood fiber: (1) peat substrate (PS); (2) wood fiber (WF); (3) wood fiber and peat substrate 50/50 v/v (WF/PS 50/50); (4) wood fiber and peat substrate 25/75 v/v (WF/PS 25/75). The rates of fertilization were the following: (1) conventional fertilization (CF); (2) N13; (3) N23; (4) N30. Fertilization of cucumbers with different rates of nitrogen influenced the nutrient uptake. Plants grown in WF/PS 50/50 and WF/PS 25/75 growing media had the best Cu uptake when fertilized with N23. When the plants grown in the wood fiber media and the 50/50 media were fertilized with N13, N23, and N30, the Mn content in the growing media at the end of the growing season was significantly lower than the Mn content in the media with conventional fertilization. Thus, nitrogen improved the uptake of Mn by plants grown not only in the wood fiber but also in combinations with peat substrate. Growing plants in wood fiber and fertilizing them with N13 can result in optimum uptake of micronutrients. The number and mass of cucumber fruits per plant were influenced by the amount of wood fiber in the growing media and the application of nitrogen fertilizer. The highest number of fruits and mass of fruits per plant was obtained significantly higher when cucumbers were grown on WF/PS 50/50 growing media with additional N13 fertilization.

The combination of encryption and digital watermarking technologies is a trend to achieve full lifecycle data protection. Recently, reversible data hiding in encrypted domain (RDHED) has greatly aroused the interests of many scholars. But the fixed order of first encryption and then watermarking makes this kind of algorithms unsuitable to many applications. Commutative encryption and watermarking (CEW) technology realizes the flexible combination of encryption and watermarking, and suits more applications. However, most existing CEW schemes for vector maps are not reversible and unsuitable to high precision maps. To solve this problem, here we propose a commutative encryption and reversible watermarking (CERW) algorithm for vector maps based on virtual coordinates which are uniformly distributed on the number axis. The CERW algorithm consists of virtual interval step based encryption scheme and coordinate difference based reversible watermarking scheme. In the encryption scheme, the map coordinates are moved randomly by multiples of virtual interval step defined as distance between two adjacent virtual coordinates. In the reversible watermarking scheme, difference expansion (DE) technique is used to embed the watermark bit into the coordinate difference computed based on the relative position of a map coordinate in a virtual interval. Since the relative position of a map coordinate in a virtual interval keeps unchanged during the coordinate scrambling encryption process, the watermarking operation and the encryption operation don’t interfere with each other and the commutativity between encryption and watermarking achieves. Results show that: proposed method has high security, high capacity and good invisibility. In addition, the algorithm is not only applicable to polyline and polygon vector data, but also can be applied to sparsely distributed point data which the traditional DE watermarking algorithm often fails to watermark.

Within environmental perception, automatic navigation and object detection, computer vision is a crucial and demanding field with many applications in modern industries, such as multi-target long-term visual tracking in automated production, defect detection, and driverless robotic vehicles with sensing ability. The performance of computer vision has greatly improved recently thanks to developments in deep learning algorithms and hardware computing capabilities, which has spawned the creation of a large number of related applications. This paper presents the results of a detailed review of over 50 papers published over the course of two decades (1999–2024), with a primary focus on the technical advancement of computer vision. To elucidate the foundational principles, an examination of typical visual algorithms based on traditional correlation filtering was initially conducted. Subsequently, a comprehensive overview of the most recent advancements in deep learning-based computer vision techniques was compiled. Furthermore, a comparative analysis between conventional and novel algorithms was undertaken to discuss the future trends and directions of computer vision. Lastly, the feasibility of employing visual SLAM (Simultaneous Localization and Mapping) algorithms in the context of autonomous vehicles with sensing capability was explored. Furthermore, we explored a thorough and efficient architecture for utilizing these techniques in autonomous robotic vehicles into unmanned green and low-carbon smart factories, underlining novel advances as well as potential prospects for future research.

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.

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.

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.

The object of study in the article is the auxiliary variable-frequency electric drive onboard of an AC electric locomotive, and more precisely, the structure and parameters of the control system of the active corrector of power factor (ACPF), which is part of the electric drive, as a unit that ensures electromagnetic compatibility of the electric drive with other equipment on board the electric locomotive and catenary and its energy efficiency. The topic of the article's research is the substantiation of the structure of the ACPF control system, the choice of types (transfer functions) of controllers and the calculation of their parameters. The research method chosen was the calculation of the transfer functions of the controllers of the cascaded loops control system, followed by computer simulation using the OrCAD software. The results of simulating a cascaded two loops control system of an ACPF with different types of controllers are presented and analytically compared. It is concluded that it is advisable to use a cascaded two loops control system, containing a voltage control loop and a current control loop. The best results show the simulation when using an aperiodic current controller (A-controller) and a proportional-integral voltage controller (PI-controller). The data obtained serve as the basis for further improvement of the operation of the ACPF by enhancing and optimizing the settings, structure and algorithms of the control system, which, with the selected hardware of power converter unit, will allow the ACPF to perform its functions with a high degree of reliability in an entire range of disturbing and control influences.

Sudden cardiac arrest (SAC) is a leading cause of mortality. In recent years, though, many lives have been saved through the use of defibrillators by random bystanders. As a result, defibrillators have been popping up in various locations. In this work we propose a state mandate demanding the presence of a defibrillator at every pharmacy store and argue that it could greatly enhance and augment the impact of the defibrillator network. We support our claim via detailed calculations of the immediate (a defibrillator readily available) and partial (a defibrillator available at a reasonable distance) population coverage achievable by the implementation of our proposal, taking the Argolis area in Peloponnese Greece as a case study. Our findings indicate that, in addition to other benefits, the use of pharmacies to establish a defibrillator network could bring an eight-fold increase in the immediate population coverage of defibrillators and would provide immediate / partial access to a defibrillator to 18 / 24 incidents of SCA per year that would otherwise lead to death, potentially leading to the saving of numerous lives. Alternative scenaria are also discussed.

As the fast growth of information technology (IT), the safety of image transmission and the storing of images are increasingly concerned. Traditional image encryption algorithms have certain limitations in transmission and security, so there is an urgent need for a secure and reliable image encryption algorithm. A universal compression sensing (CS) image encryption (IE) algorithm based on DNA-triploid mutation (DTM) is presented in this paper. Firstly, by using CS algorithm an image is compressed while obtaining a range of chaotic sequences by iteration of chaotic map. Then DNA sequences are generated by encoding the image, and based on the DTM, new mutant DNA sequences are generated according to specific rules. Next, the chaotic sequences are operated at the DNA level to do confusion and diffusion operations on the image to ensure the security of the data. At last, DNA decoding is carried out to obtain the compressed-encrypted image. Both simulation experiments and performance tests fully show that a high level of security and reliability of the proposed algorithm in protecting image privacy is achieved.

This study explores the impact on the stability of drying and encapsulation of a camu camu extract (CCX) using the non-thermal, high-throughput electrospraying assisted by pressurized gas (EAPG) technique. The dried and encapsulated products by the EAPG processing techniques were compared in terms of total soluble phenolic compounds, antioxidant activity, and storage stability. Whey protein concentrate (WPC) and zein (ZN) were selected as the protective excipients for encapsulation. Dried and encapsulated products were obtained in the form of microparticles, which were smaller and more spherical in the case of the encapsulates. No significant differences were observed in the total polyphenolic content (TSP), and only relatively small differences in the antioxidant capacity were measured among samples. The generated products were subjected to various storage conditions to assess their stability and the preservation of the TSP and the antioxidant properties, i.e. 0% relative humidity (RH) and 4°C; 0% RH and 21°C; 23% RH and 21°C; 56% RH and 21°C; and UV light exposure. The results indicated that ZN encapsulation notably enhanced the retention of total soluble polyphenols and antioxidant activity compared to WPC and dried CCX, especially in the ratio 2:1 (encapsulating polymer: dried CCX). This study demonstrates the potential of protein-based encapsulation, particularly using ZN, for stabilizing bioactive compounds against degradation mechanisms induced by humidity, temperature, or ultraviolet radiation exposure.

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.

In recent years, the AHRS has become an important research area. In order to improve the orientation measurement accuracy of AHRS, this paper first expounds the algorithm principle of the AHRS. Then, aiming at the problem of poor stability of the traditional gradient descent method under high dynamics or large magnetic field interference, a gain-scheduled anti-interference AHRS orientation algorithm is designed. By using the switching architecture designed with this algorithm for gain scheduling, it can ensure stable performance while being subjected to apparent acceleration and ferromagnetic interference. Finally, experimental verification is conducted, and the experimental results show that: in the presence of interference, the roll angle error is 0.0350°, the pitch angle error is 0.0277°, and the yaw angle error is 0.9611°, thereby verifying the strong anti-interference performance of the gain-scheduled AHRS orientation algorithm proposed in this paper.

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.

Tsallis entropy has been widely used in image thresholding because of its non-extensive properties. The non-extensive parameter q contained in this entropy plays an important role in various adaptive algorithms and has been successfully applied in bi-level image thresholding. In this paper, the relationships between parameter q and pixels’ long-range correlations have been further studied within multi-threshold image segmentation. It is found that the pixels’ correlations are remarkable and stable for images generated by a known physical principle, such as infrared images and medical CT images. And the corresponding non-extensive parameter q can be evaluated by using self-adaptive Tsallis entropy algorithm. The results of this algorithm are compared with those of Shannon entropy algorithm and the original Tsallis entropy algorithm, in terms of quantitative image quality evaluation metrics PSNR (Peak Signal-to-Noise Ratio) and SSIM (Structural Similarity). Furthermore, we observed that for image series with the same background, the q values determined by the adaptive algorithm are consistently kept in a narrow range. Therefore, similar or identical scenes during imaging would produce similar strength of long-range correlations, which provides potential applications for unsupervised image processing.

Background and objectives: Chronic Kidney Disease and Mineral Bone Disorders (CKD-MBD) are frequently associated with an increased risk of both Vascular Calcifications (VCs) and bone fractures (BFs). The complex pathogenesis of VCs and BFs involves various factors such as calcium overload, phosphate imbalance, and secondary hyperparathyroidism. Key players, such as the vitamin K-dependent proteins (VKDPs) matrix Gla protein (MGP) and osteocalcin (BGP), have pivotal roles both for VCs and BFs. The Vitamin K Italian (VIKI) dialysis study, highlighted that hemodialysis patients treated with calcimimetics had higher levels of total BGP and MGP as compared to those untreated, suggesting a potential protective effect of these drugs on BFs and VCs, beyond the beneficial effect to reduce PTH levels. Methods: ETERNITY-ITA is a multi-center, comparative effectiveness, observational, longitudinal study that will enroll 160 hemodialysis patients (80 patients treated with Etelcalcetide and 80 age and sex-matched patients treated with Calcitriol or vitamin D analogs). Nephrologists will tailor the target dose of Etelcalcetide on individual level to achieve the KDIGO PTH target. In the Etelcalcetide-treated group, the addition of calcitriol will be allowed when required by clinical practice (for correction of hypocalcemia). Conclusion: The study will evaluate the real-world effect of Etelcalcetide on VKDP levels, such as BGP and MGP, at 3, 9, and 18 months from baseline. The resulting preservation of vascular and bone health will be assessed for the first time by examining aortic and iliac artery calcifications and vertebral fractures, respectively. Keywords: bone fractures; etecalcetide; hemodialysis; vascular calcification; vitamin K

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.

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.

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.

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.

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.

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.

This study introduces an advanced dual-mode composite attitude control framework for reusable launch vehicles (RLVs), underpinned by an enhanced particle swarm optimization (PSO) algorithm. This innovative strategy is tailored to meet the stringent demands for precision and robust anti-interference capabilities across the entire flight envelope of RLVs. The research commences with the formulation of a comprehensive attitude dynamics model and diverse heterogeneous actuator representations, meticulously crafted to reflect the distinct phases of RLV flight. Building upon this foundation, a synergistic control paradigm is engineered, integrating PID and fuzzy PID controllers, complemented by a refined fitness evaluation function. The crux of the study is the application of an upgraded PSO algorithm to fine-tune the controllers' weighting coefficients, culminating in an optimized dual-mode composite attitude control system. A series of comparative simulation analyses are meticulously executed to appraise the system's responsiveness, stability, precision, and resilience to interference. The findings unequivocally substantiate the superior performance of the proposed control system, affirming its substantial contribution to the advancement of RLV attitude control.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

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.

The emerging wireless energy transfer technology enables sensor nodes to maintain perpetual operation. However, maximizing the network performance while preserving short charging delay is a great challenge. In this work, a Wireless Mobile Charger (WMC) and a Directional Charger (DC) are deployed to transmit wireless energy to the sensor node to improve the network's throughput. To the best of our knowledge, this is the first work to optimize the data sensing rate and charging delay by joint scheduling of MC and DC. We prove we can transmit maximum energy to each sensor node to obtain our optimization objective. In our proposed work, a DC selects a total horizon of equipped with DCs, which selects the horizon of each specific area with based on its antenna orientation. DC's orientation is scheduled for each time slot. Furthermore, multiple MCs are used to transmit energy for sensor nodes which cannot be covered by DCs. We divided the Rechargeable Wireless Sensor Network into several zones via the Voronoi diagram. We deployed a static DC and one MC charging location in each zone to provide wireless charging service jointly. We obtain the optimal charging location of MCs in each zone by solving Mix Integral Programming for energy transmission. The optimization objective of our proposed research is to sense maximum data from each sensor node with the help of maximum energy. The lifetime of each sensor network can increase, and the end delay can be maximized with joint energy transmission. Extensive simulation results demonstrate that our RWSNs are designed significantly to improve network lifetime over the baseline method.

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.

Runway Safety Assistant Foreseeing Excursions (RUN.S.A.F.E.) is a complete embedded system solution that predicts a potential runway overrun of a civil aviation aircraft, during the Take off and Landing. This work examines the feasibility of such a system, through the algorithms and computations that predict the overruns. The system executes both static and dynamic calculations, the former being dependent, while the latter independent to the user’s inputs. Both outcomes and the runway’s length continuously estimate in real time if the process will end up in an overrun. All inputs are specifically selected, to either be available to the pilots, or to be retrieved from the existing avionics systems of the cockpit. A performance evaluation is conducted on both static and dynamic calculations, and metrics unveil the accuracy of the predictions and the time needed to converge to a reliable result. The solution is adapted for a Boeing 737-800 aircraft, with CFM56-7B engines, yet the calculations also apply for similar aicrafts, equipped with a tricycle Landing gear and turbofan engines, namely the whole Boeing 737 family, the Airbus A320 family etc.. The system is aligned with current standards and certification specifications, where applicable.

High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.

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 study was carried out with a low-cost electronic nose prototype based on eight metal oxide sensors (MQ) in order to characterize samples of lemons treated with 0.5% and 0.1% of sodium benzoate. The MQ sensors designed are sensitive to one or more chemicals to detect the presence of a variety of chemicals in the air. The sensor MQ135 detects ammonia, hydrogen sulphide and benzene. Signal data were studied to obtain a pattern recognition of rotten in lemon fruits. Network analysis was used to obtain a calibration of measures among the stage of lemons. In this article, an electronic nose prototype based on 8 MQ metal oxide sensors has been used in order to analyze and characterize different lemon varieties to which different chemical treatments have been applied in pre-harvest. PCA-based data analyzes were used to observe clusters in the data. Through the combined use of the data obtained by the nose and these Sequential Neural Networks (SNNs) a classification tool for lemon varieties and applied treatments has been obtained. It is shown the ability of this device to be used as a reliable discrimination method, in addition to providing low cost and optimization of time and expert resources.

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.

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.

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.

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.

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 relentless advancement and integration of mechanization and intelligence within the coal mining industry, combined with the increasing depths of mining operations, necessitate significantly higher safety standards. This necessity arises due to the increasingly complex geological and coal seam conditions encountered as mining operations delve deeper into the earth. Traditionally, 3D seismic exploration technology has been fundamental in ensuring both operational efficiency and safety in the coal mining sector. However, despite its critical role, this technology still has limitations in detecting and characterizing small-scale geological structures which can pose substantial risks if not accurately identified and mitigated. To address these challenges, this paper introduces a sparsity-constrained adaptive hard thresholding algorithm designed to tackle the spectral inversion optimization problem with an norm constraint for the enhanced retrieval of reflection coefficients, thereby establishing a comprehensive workflow for enhancing seismic data resolution through compressed sensing spectral inversion. Real data validation has demonstrated that this method significantly enhances the resolution of seismic data while maintaining the amplitude integrity and fidelity of the original signals. This improvement allows for a more detailed and accurate characterization of small-scale geological features, which are critical in identifying and mitigating potential hazards within coal mining operations, thus offering robust support for the implementation of more effective safety protocols and disaster prevention strategies in coal mines.

This research aims to apply Artificial Intelligence (AI) methods, specifically Artificial Immune Systems (AIS), to design an optimal control strategy for a multivariable control plant. Two specific industrial control approaches are investigated: I-PD (Integral-Proportional Derivative) and PI-D (Proportional-Integral Derivative) control. The motivation for using these variations of PID controllers is that they are functionally implemented in modern industrial controllers, where they provide precise process control. The research results in a novel solution to the control synthesis problem for the industrial system. In particular, the research deals with the synthesis of I-P control for a two-loop system in the technological process of a distillation column. This synthesis is carried out using the AIS algorithm, which is the first application of this technique in this specific context. Methodological approaches are proposed to improve the performance of industrial multivariable control systems by effectively using optimization algorithms and establishing modified quality criteria. The numerical performance index ISE justifies the effectiveness of the AIS-based controllers in comparison with conventional PID controllers (ISE₁ = 1.865, ISE₂ = 1.56). The problem of synthesis of the multi-input multi-output (MIMO) control system is solved, considering the interconnections due to the decoupling procedure.

The Electric Fish Optimization (EFO) Algorithm is inspired by the predation behavior and communication of weak electric fish. It is a novel meta-heuristic algorithm that attracts researchers because it has few tunable parameters,high robustness,and strong global search capabilities. Nevertheless, when operating in complex environments, the EFO algorithm encounters several challenges including premature convergence, susceptibility to local optimum, and issues related to passive electric field localization stagnation. To address these challenges, this study introduces an Adaptive Electric Fish Optimization Algorithm Based on Standstill Label and Level Flight (SLLF-EFO). This hybrid approach incorporates the Golden Sine Algorithm and Good Point Set Theory to augment the EFO algorithm’s capabilities, employs a variable step size Levy flight strategy to efficiently address passive electric field localization stagnation problems, and utilizes a standstill label strategy to mitigate the algorithm’s tendency to fall into local optimum during the iterative process. By leveraging multiple solutions to optimize the EFO algorithm, this framework enhances its adaptability in complex environments. Experimental results from benchmark functions reveal that the proposed SLLF-EFO algorithm exhibits improved performance in complex settings, demonstrating enhanced search speed and optimization accuracy This comprehensive optimization not only enhances the robustness and reliability of the EFO algorithm but also provides valuable insights for its future applications.

(1) Background: In most cases, passive isolation control methods are commonly used for the seismic isolation design of bridge engineering. However, for passive seismic isolation devices, due to their non-adjustable performance parameters, it is challenging to achieve a good seismic isolation effect for structures under random and variable seismic loads in the wide frequency range of 0 Hz to 20 Hz; (2) Methods: the sensitivity of the design parameters of the seismic isolation bearing was analyzed using the optimization center gradient method, and an improved genetic algorithm was employed to quickly optimize and obtain the optimal design parameters; (3) Results: the effectiveness of the three-dimensional seismic isolation bearing was validated through experiments. (4) Conclusions: The multi-factor sensitivity analysis approach used in this study for designing novel isolation bearings is applicable not only to seismic design in bridges but also serves as a reference for parameter design in isolation bearings requiring medium to high precision in seismic performance.

Drug-resistant tuberculosis (DR-TB) and HIV-coinfection present a conundrum to public health globally, and the achievement of the global END TB strategy in 2035. A descriptive, retrospective review of medical records of patients diagnosed with DR-TB who received treatment was conducted. Student’s t-test was performed to assess differences between two means and ANOVA between groups. Either the Chi-square test with and without trend or Fischer’s exact test was used to test the degree of association of categorical variables. Logistic regression was used to determine predictors of DR-TB treatment outcomes. Also, a decision tree classifier, which is a supervised machine learning algorithm was used. Python version 3.8. and R version 4.1.1 software were used for data analysis. A p-value of 0.05 with a 95% confidence interval (CI) was used to determine statistical significance. A total of 456 DR-TB patients were included in the study with more male patients (n = 256, 56.1%) than female patients (n = 200, 43.9%). The overall treatment success rate was 61.4%. There was a significant decrease in the % of patients cured during the Covid-19 pandemic compared to the pre-pandemic period. Our findings showed that machine learning can be used to predict TB patients' treatment outcomes.

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.

Snow cover products are primarily derived from the Moderate-resolution Imaging Spectrometer (MODIS) and Advanced Very High-Resolution Radiometer (AVHRR) datasets. MODIS achieves both snow/non-snow discrimination and snow cover fractional retrieval, while early AVHRR-based snow cover products only focused on snow/non-snow discrimination. The AVHRR Climate Data Record (AVHRR -CDR) provides a nearly 40-year global dataset that has a potential to fill a gap in long term snow cover fractional monitoring. Our study selects the Qinghai-Tibet Plateau as the experimental area, utilizing AVHRR-CDR surface reflectance data (AVH09C1) and calibrating with MODIS snow product MOD10A1. The snow cover percentage retrieval from the AVHRR dataset is performed using Surface reflectance at 0.64μm (SR1) and Surface reflectance at 0.86μm (SR2), along with a simulated Normalized Difference Snow Index (NDSI) model. Also, in order to detect the effects of land cover type and topography on snow inversion, we tested the accuracy of the algorithm with and without these influences, respectively (vanilla algorithm & improved algorithm). The accuracy of the AVHRR snow cover percentage data product is evaluated using MOD10A1、 ground snow-depth measurements and ERA5. Results indicate that the logic model based on NDSI has the best fitting effect, with R-square and RMSE values of 0.83 and 0.10, respectively. Meanwhile, the accuracy was improved after taking into account the effects of land cover type and topography. The model is validated using MOD10A1 snow-covered areas, showing snow cover area differences of less than 4% across 6 temporal phases. Improved algorithm results in better consistency with MOD10A1 than vanilla algorithm. Moreover, the RMSE reaches greater levels when the elevation is below 2,000 meters or above 6,000 meters, and is lower when the slope is between 16° and 20°. Using ground snow-depth measurements as ground truth, the multi-year recall rates are mostly above 0.7, with an average recall rate of 0.81. Results also show a high degree of consistency with ERA5. The validation results demonstrate that the AVHRR snow cover percentage remote sensing product proposed in this study exhibits high accuracy in the Tibetan Plateau region, also demonstrating that land cover type and topographic factors are important to the algorithm. Our study lays the foundation for the global snow cover percentage product based on AVHRR-CDR，furthermore lays a basic work for generating a long-term AVHRR-MODIS fractional snow cover dataset.

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.

With the offshore oil-gas fields entering decline phase, high-efficiency separation of oil-gas-water mixtures becomes a significant challenge. As essential equipment for separation, the three-phase separators play a key role in Offshore Oil-Gas production. However, level control is critical in the operation of three-phase gravity separators on offshore facilities, as it directly affects the efficacy and safety of the separation process. This paper introduces an advanced deep deterministic policy gradient with adaptive learning rate weights (ALRW-DDPG) control algorithm, which improves the convergence and stability of the conventional DDPG algorithm. An adaptive learning rate weight function is meticulously designed, and an ALRW-DDPG algorithm network is constructed for simulating three-phase separator liquid level control. The effectiveness of the ALRW-DDPG algorithm is subsequently validated through simulation experiments. The results show that the ALRW-DDPG algorithm achieves a 15.38% improvement in convergence rate compared to the traditional DDPG algorithm, and the control error is significantly smaller than that of PID and DDPG algorithms.

This paper presents a new semi-explicit algorithm for parameters estimation in a time-fractional generalization of dual-phase-lag heat conduction model with the Caputo fractional derivatives. It is shown that this model can be derived from a general linear constitutive relation for the heat transfer by conduction when the heat conduction relaxation kernel contains the Mittag-Leffler function. The model can be used to describe heat conduction phenomena in a material with power-law memory. The proposed algorithm of parameters estimation is based on the time integral characteristics method. The explicit representations of the thermal diffusivity and the fractional analogues of the thermal relaxation time and the thermal retardation are obtained via a Laplace transform of the temperature field and utilized in the algorithm. An implicit relation is derived for the order of fractional differentiation. In the algorithm, this relation is resolved numerically. An example illustrates the proposed technique.