Running Time Research Articles

Addressing stability issues of vildagliptin: Method optimization and validation for accurate analysis in human plasma.

This research paper introduces novel strategies to address the stability issues arising with vildagliptin, marking the first attempt to tackle this challenge comprehensively. The study incorporates malic acid into the human plasma, a crucial step in stabilizing vildagliptin and preventing its degradation. Additionally, optimization of the elution process on a C18 Asentis Express column, fine-tuned with a combination of acetonitrile and ammonium trifluoroacetate 5mM, ensures optimal chromatographic conditions. For detection and quantification, electrospray ionization (ESI) is employed, monitoring multiple reactions for vildagliptin (304.2 → 154.2) and vildagliptin D7 (311.1 → 161.2). Meticulous validation of the method demonstrates high accuracy (97.30%-104.15%) and precision [(0.32%-3.09% coefficient of variance (CV)] for vildagliptin calibration curve standards (CC STD), establishing its sensitivity and reliability in measuring vildagliptin levels. This refined methodology offers numerous advantages, including the elimination of stability concerns, reduced human plasma sample volume (100 μL), exceptional reproducibility, shortened run time (~2.2min), and a wide concentration range (1.00 to 851.81 ng/mL). These attributes make it exceptionally well-suited for diverse research applications, spanning from extensive sampling in therapeutic drug monitoring units to bioequivalence and bioavailability studies, as well as pharmacokinetic investigations of vildagliptin.

Tree species classification based on PointNet++ deep learning and true- colour point cloud

ABSTRACT Accurate identification of tree species is the foundation of forest resource surveys and an important research field in forestry remote sensing. The introduction of the PointNet++ deep learning network to point cloud processing provides a new approach for tree species identification. This network can directly compute and train unordered point clouds, greatly reducing the manual selection and extraction process of feature data. However, how to establish a high-quality single tree point cloud dataset is a key issue to be solved. In this study, a 2.5-ha temperate coniferous broad-leaved mixed forest located in Mao’er Mountain Experimental Forest Farm in Heilongjiang Province, China, was investigated. The unmanned aerial vehicle (UAV) RGB image and LiDAR synchronous observation system were used to obtain the true-colour point clouds of the forest. Combining upsampling and downsampling methods, a dataset containing coordinates, normal vectors, RGB, and intensity information was constructed from the original point cloud. Comparative experiments were designed based on resampling algorithms, number of sampling points, feature information, and time cost to find the optimal feature information and processing methods for tree species classification. The results showed that the accuracy of tree species classification by using PointNet++ was greatly improved after adding RGB and point cloud intensity information. The classification accuracy was about 5% higher than that using only coordinate data sets. In addition, the combination of PU-Net downsampling network based on point cloud completion and geometric upsampling method achieved the highest classification accuracy (OA = 0.944) when the number of single trees point cloud was 3072. The algorithm also took a relatively shorter running time. This study demonstrated that the introduction of multi-feature information and the optimization of resampling method can provide new solutions for tree species classification based on the PointNet++ deep learning network.

Underwater maneuvering target motion analysis using delayed azimuth angles

Accurate position information of an underwater target is the premise of successfully executing underwater missions, and this paper focuses on underwater target motion analysis (TMA) using delayed azimuth angles. Considering that the underwater sound speed (around 1500 m/s) is much smaller than the speed of light (3 × 108 m/s), the underwater TMA needs to adopt the non-stop model considering the effect of the target movement during signal propagation on state estimation, instead of the traditional go-stop model ignoring the target movement during signal propagation. The existing non-stop model is based on a constant-velocity target, and the model mismatch will make the estimated results biased when it is applied to a maneuvering target. In this paper, we focus on the constant-acceleration (CA) target and propose two methods to solve this problem. One is to extend the non-stop model to the case of a constant-acceleration target. We build the corresponding least squares (LS) estimator and derive the expression of the root mean square error (RMSE) of the LS solution. The other is to directly offset the estimation bias of the CA go-stop model and a bias-compensated algorithm is proposed to improve the performance. Simulations prove that the proposed methods can result in a smaller RMSE than the traditional CA go-stop model. Their RMSEs decrease with the number of measurements and observers and increase with random angle errors. When the number of measurements is small, the RMSE of the established CA non-stop model is smaller than that of the bias-compensated algorithm. As the number of measurements increases, their estimation precisions become gradually equal. The running time of the proposed methods increases with the number of measurements and observers. When the number of observers is small, the bias-compensated algorithm has the advantage of needing less running time. In addition, the running time of the bias-compensated algorithm does not approximately change with the random angle errors, while that of the CA non-stop model increases with the random angle errors.

An efficient dual-domain deep learning network for sparse-view CT reconstruction

Background and ObjectiveWe develop an efficient deep-learning based dual-domain reconstruction method for sparse-view CT reconstruction with small training parameters and comparable running time. We aim to investigate the model's capability and its clinical value by performing objective and subjective quality assessments using clinical CT projection data acquired on commercial scanners. MethodsWe designed two lightweight networks, namely Sino-Net and Img-Net, to restore the projection and image signal from the DD-Net reconstructed images in the projection and image domains, respectively. The proposed network has small training parameters and comparable running time among dual-domain based reconstruction networks and is easy to train (end-to-end). We prospectively collected clinical thoraco-abdominal CT projection data acquired on a Siemens Biograph 128 Edge CT scanner to train and validate the proposed network. Further, we quantitatively evaluated the CT Hounsfield unit (HU) values on 21 organs and anatomic structures, such as the liver, aorta, and ribcage. We also analyzed the noise properties and compared the signal-to-noise ratio (SNR) and the contrast-to-noise ratio (CNR) of the reconstructed images. Besides, two radiologists conducted the subjective qualitative evaluation including the confidence and conspicuity of anatomic structures, and the overall image quality using a 1–5 likert scoring system. ResultsObjective and subjective evaluation showed that the proposed algorithm achieves competitive results in eliminating noise and artifacts, restoring fine structure details, and recovering edges and contours of anatomic structures using 384 views (1/6 sparse rate). The proposed method exhibited good computational cost performance on clinical projection data. ConclusionThis work presents an efficient dual-domain learning network for sparse-view CT reconstruction on raw projection data from a commercial scanner. The study also provides insights for designing an organ-based image quality assessment pipeline for sparse-view reconstruction tasks, potentially benefiting organ-specific dose reduction by sparse-view imaging.

An optimized Transformer algorithm: Implementation for intelligent English translation

There is an increasing demand for high-quality translations in the realm of intelligent English translation. This paper optimized the traditional Transformer algorithm by enhancing position coding and the softmax layer. Bidirectional long short-term memory (BiLST) was employed to realize position encoding, capturing both contextual and positional information simultaneously. Additionally, the softmax function was replaced with the sparsemax function to obtain sparser results. The translation performance of some algorithms on Chinese and English datasets was compared and analyzed. It was found that that the optimized Transformer algorithm performed better than the RNNSearch, ConvS2S, and Transformer-base algorithms in terms of bilingual evaluation understudy (BLEU) score on the test set. It achieved an average BLEU score of 23.72, representing an improvement of 1.56 over the RNNSearch algorithm, 1.17 over the ConvS2S algorithm, and 0.73 over the Transformer-base algorithm. The parameter quantity of the optimized algorithm was 6.83 M, which was 0.05 M higher than the Transformer-base algorithm. Furthermore, its running time was 4,862.76 s, showing a marginal increase of 0.21% compared to the Transformer-base algorithm. These findings validate the reliability of the optimized Transformer algorithm for intelligent English translation and its potential practical application.

Finding the largest separating rectangle among two point sets

Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the maximum area. We call such a rectangle a maximum-area separating rectangle (MSR). We first address the planar, axis-aligned (2D) version, and present an O(mlog⁡m+n) time, O(m+n) space algorithm. The running time reduces to O(m+n) if the points are pre-sorted by one of the coordinates. We also consider the planar arbitrary orientation version, in which the MSR is allowed to have arbitrary orientation. For this arbitrary orientation version, our algorithm takes O(m3+nlog⁡n) time and O(m+n) space. Finally, we address the 3D axis-aligned version, which asks for the maximum-volume separating box (MSB), i.e., the maximum-volume axis-aligned box containing all the red points and the fewest blue points. For this version, we give an algorithm that runs in O(m2(m+n)) time and O(m+n) space.

A cooperative timestamp-free clock synchronization scheme based on fast unscented Kalman filtering for time-sensitive networking

Clock synchronization, built on the classical two-way message exchange scheme, is the key prerequisite for the normal operation of time-sensitive networking (TSN). In practical TSN, the imperfect oscillator caused by environmental changes leads to clock parameters drift. Moreover, synchronization errors accumulate in multi-hop networks, making it difficult for nodes at the edge of the network to achieve precise synchronization performance. Additionally, in some industrial and vehicular scenarios, the energy consumption and complexity of clock synchronization are important factors that need to be considered. To address these problems, this paper proposes a cooperative synchronization clock offset and clock skew joint tracking algorithm based on fast Unscented Kalman filter (FUKF). To further reduce the computation and energy consumption caused by clock synchronization, we introduce randomized singular value decomposition and timestamp-free exchange. The former uses small sub-matrices approximations to replace extremely high-dimensional matrices, reducing computational time in the update stage of the UKF. The latter reduces energy consumption by setting response intervals at the receiving end, eliminating the need for timestamp exchange during the synchronization process. Therefore, this algorithm can achieve long-term synchronization without requiring excessive computational and communication overhead. The results show that the proposed method, while maintaining accuracy unchanged, reduced the running time by 20% to 90% as the number of observations increased, thus verifying the effectiveness of the algorithm.

Sparse TFM imaging of different-scale phased array based on the DWSO algorithm

ABSTRACT Using sparse matrix for total focusing method (TFM) imaging can improve computational efficiency in non-destructive testing (NDT). In sparse matrix design, binary particle swarm optimisation (BPSO) and genetic algorithm (GA) often fall into local optimal solution, and the computational efficiency decreases significantly with the expansion of array scale. In this paper, a discrete war strategy optimisation (DWSO) is proposed to realise sparse array ultrasonic imaging. This method uses equidistant scatter mapping to real-number encode the array position and limit the search range. Then, the fitness function is constructed with low side lobe peak and narrow main lobe width to obtain the optimal array element distribution. Experiments on standard test block demonstrate the DWSO algorithm has a narrower main lobe width and lower side lobe peaks than BPSO and GA. The imaging time of the sparse array constructed by this algorithm is reduced by more than 65% compared with the full array. As array scale grows, the running time variation of the proposed method is reduced by 73.2% and 77.3% compared with GA and BPSO, which has good adaptability and provides theoretical support for real-time defect detection.

Polynomial crisp-minimization algorithm for fuzzy deterministic automata

Designing automata minimization algorithms is a significant topic in Automata Theory and Languages with practical applications. In this paper, we develop an efficient minimization algorithm for deterministic fuzzy finite automata over locally finite lattices. More precisely, the algorithm outputs an equivalent minimal crisp-deterministic fuzzy finite automaton for an input fuzzy deterministic finite automaton (FDfA). The running time of the proposed algorithm is polynomial for particular types of locally finite lattices, specifically for max-min-based complete residuated lattices. The intuition behind the proposed algorithm relies on the polynomial minimization algorithm's intuition for ordinary deterministic automata developed by Vazquez de Parga, Garcia, and Lopez (2013) [35]. The motivation for this study comes from the fact that the original algorithm's notions and meanings are lost in the context of fuzzy automata. Thus, we establish a new theoretical foundation that provides the correctness and the polynomial-time nature of this new crisp-minimization algorithm for FDfAs.

Proactive blockchain deployment mechanism in resource-constrained rate-splitting multiple access IoT networks

In this paper, we propose an innovative blockchain deployment mechanism tailored for resource-constrained rate-splitting multiple access (RSMA) Internet of Things (IoT) networks. To address the storage limitations and security concerns inherent in IoT environments, our approach includes several advanced techniques. First, we utilize a Block Allocation Strategy Contract (BASC) to manage storage efficiently. Second, we employ a deep reinforcement learning (DRL) model to dynamically perform block assignment, ensuring optimal storage utilization. To accommodate the resource constraints of IoT devices, we adopt the Smart Byzantine Fault Tolerance (SBFT) consensus mechanism, which offers low latency and energy efficiency. Our framework demonstrates superior performance in storage optimization and reduced running time compared to existing methods, making it well-suited for large-scale IoT networks. Through extensive simulations, we validate the effectiveness of our proposed solution in enhancing security and operational efficiency in RSMA IoT networks.

Integrating commercial graphite with network-like carbon fibers for high-rate and long-term cycling K+-storage.

K can reversibly intercalate into graphite by forming KC8 (279 mA h g-1, ≈0.2 V) in conventional carbonate electrolytes, but the large ionic radius of K+ (1.38 Å) easily results in structural degradation and rapid capacity decay. Here, commercial graphite particles are directly electrospun into network-like carbon fibers, thus forming a flexible Gr@CNF membrane. This hybrid electrode configuration can efficiently withstand the volume expansion during K+ insertion. K||Gr@CNF half-cells can stably operate for over 800 cycles (running time of 170 days at C/3) and achieve fast K+-intercalation kinetics at 5C. The fabricated Gr@CNF||AC K-ion hybrid capacitor delivers a high energy density of 119.3 W h kg-1 at 2717.82 W kg-1, corresponding to a fast-charge time of 3.2 min.

Modern chromatographic method for estimating Loratadine and affections on healthcare

PurposeThe purpose of this study is to establish Loratadine [LRD] quantification in purified and capsule formulations using a precise and specific Reversal Phase with a very high-performance liquid Chromatographic [RP-HPLC] technique. The approach was evaluated in agreement with the principles of the International Conference on Harmonization [ICH]. Arcus EP-C18 Ion Pac column, 5 m, 4.6 mm, 250 mm, mobile phase Methanol: Acetonitrile (60:40) v/v. Dibasic potassium phosphate buffer, pH 7.2, flow rate 1.0 ml/min.Design/methodology/approachThe HPLC system used a 340 nm UV detector for testing. A 10-min run time was used for the analysis. At concentrations ranging from 2 to 10 g/ml, the technique was linear (R2 = 0.9998), exact (intra-day and inter-day relative standard deviation [RSD] values 1.0%), accurate (range recovery = 96%–102%), exclusive and strong.FindingsThe detecting and quantitation limits were 0.92 g/ml and 2.15 g/ml, respectively.Originality/valueThe findings demonstrated that the proposed method could accurately determine LRD in bulk and pill dose formats quickly and accurately.

Longitudinal change in cardiorespiratory fitness and the association with cardiovascular disease and all-cause mortality in young Asian men: a cohort study

IntroductionCardiorespiratory fitness (CRF) in young adulthood is a determinant of chronic disease risk. To better understand whether CRF might also behave as a modifiable risk factor, we examined the associations...

6'-Sialyllactose Enhances Exercise Performance via Increased Muscle Mass and Strength.

Sialyllactose (SL) is a functional human milk oligosaccharide essential for immune support, brain development, intestinal maturation, and antiviral defense. However, despite its established health benefits, the effect of SL on exercise performance and muscle mass in mice remains unknown. Here, we aimed to investigate, for the first time, the effects of 6'-SL on muscle functions. Seven-week-old male C57BL/6J mice were administered 100 mg/kg 6'-SL for 12 weeks, after which exhaustive treadmill performance was conducted. Moreover, muscle strength was examined by grip strength, and muscle phenotype characteristics such as muscle mass, muscle fiber size, and muscle protein expression were also examined. The administration of 6'-SL significantly improved exhaustive treadmill performance metrics, including distance and exhaustion time. Grip strength was also increased by 6'-SL administration. Additionally, 6'-SL increased muscle mass in both the gastrocnemius (GAS) and soleus. 6'-SL administration led to an increase in the minimum Feret's diameter and the protein expression of total myosin heavy chain in the GAS muscle. In conclusion, 6'-SL administration in vivo led to increased running distance and time by increasing muscle mass and strength. These findings collectively indicate that 6'-SL is a potential agent for improving muscle health and exercise performance.

Learning to Allocate Time-Bound and Dynamic Tasks to Multiple Robots Using Covariant Attention Neural Networks

Abstract In various applications of multi-robotics in disaster response, warehouse management, and manufacturing, tasks that are known a priori and tasks added during run time need to be assigned efficiently and without conflicts to robots in the team. This multi-robot task allocation (MRTA) process presents itself as a combinatorial optimization (CO) problem that is usually challenging to be solved in meaningful timescales using typical (mixed)integer (non)linear programming tools. Building on a growing body of work in using graph reinforcement learning to learn search heuristics for such complex CO problems, this paper presents a new graph neural network architecture called the covariant attention mechanism (CAM). CAM can not only generalize but also scale to larger problems than that encountered in training, and handle dynamic tasks. This architecture combines the concept of covariant compositional networks used here to embed the local structures in task graphs, with a context module that encodes the robots’ states. The encoded information is passed onto a decoder designed using multi-head attention mechanism. When applied to a class of MRTA problems with time deadlines, robot ferry range constraints, and multi-trip settings, CAM surpasses a state-of-the-art graph learning approach based on the attention mechanism, as well as a feasible random-walk baseline across various generalizability and scalability tests. Performance of CAM is also found to be at par with a high-performing non-learning baseline called BiG-MRTA, while noting up to a 70-fold improvement in decision-making efficiency over this baseline.

A Terminal Residual Vibration Suppression Method of a Robot Based on Joint Trajectory Optimization

Vibration problems have become one of the most important factors affecting robot performance. To this end, a terminal residual vibration suppression method based on joint trajectory optimization is proposed to improve the accuracy and stability of robot motion. Firstly, based on the characteristics of the friction nonlinearity due to joint coupling and physical feasibility of dynamic parameters, a semidefinite programming method is used to identify dynamic parameters with actual physical meaning, thereby obtaining an accurate dynamic model. Then, based on the result of the residual vibration time domain analysis, a joint trajectory optimization model with the goal of minimizing joint tracking error is established. The Chebyshev collocation method is used to discretize the optimization model. The dynamic model is used as the optimization constraint, and barycentric interpolation is used to obtain the optimized joint motion trajectory. Finally, industrial robot experiments prove that the vibration suppression method proposed in this article can reduce the maximum acceleration amplitude of residual vibration by 62% and the vibration duration by 71%. Compared with the input shaping method, the method proposed in this paper can reduce the terminal residual vibration more effectively and ensure the consistency of running time and trajectory.

On Computing the k -Shortcut Fréchet Distance

The Fréchet distance is a popular measure of dissimilarity for polygonal curves. It is defined as a min–max formulation that considers all orientation-preserving bijective mappings between the two curves. Because of its susceptibility to noise, Driemel and Har-Peled introduced the shortcut Fréchet distance in 2012, where one is allowed to take shortcuts along one of the curves, similar to the edit distance for sequences. We analyse the parameterised version of this problem, where the number of shortcuts is bounded by a parameter \(k\) . The corresponding decision problem can be stated as follows: Given two polygonal curves \(T\) and \(B\) of at most \(n\) vertices, a parameter \(k\) and a distance threshold \(\delta\) , is it possible to introduce \(k\) shortcuts along \(B\) such that the Fréchet distance of the resulting curve and the curve \(T\) is at most \(\delta\) ? We study this problem for polygonal curves in the plane. We provide a complexity analysis for this problem with the following results: (1) there exists a decision algorithm with running time in \(\mathcal{O}(kn^{2k+2}\log n)\) ; (2) assuming the exponential-time hypothesis (ETH), there exists no algorithm with running time bounded by \(n^{o(k)}\) . In contrast, we also show that efficient approximate decider algorithms are possible, even when \(k\) is large. We present a \((3+\varepsilon)\) -approximate decider algorithm with running time in \(\mathcal{O}(kn^{2}\log^{2}n)\) for fixed \(\varepsilon\) . In addition, we can show that, if \(k\) is a constant and the two curves are \(c\) -packed for some constant \(c\) , then the approximate decider algorithm runs in near-linear time.

Regional quality analysis of the hydrological environment with an improved random forest model based on the chimpanzee algorithm.

High-precision evaluations of water environment quality are highly important for improving the accuracy of early warning systems of regional water pollution risk and improving the regional water environment. This paper employs the chimp optimization algorithm (ChOA) to enhance the traditional random forest model, resulting in the chimp optimization algorithm-random forest (ChOA-RF) water quality assessment model for evaluating the Jiansanjiang area in Heilongjiang Province, China. The results show that the overall water environment in Jiansanjiang has the following characteristics: "The water quality of farms in the northwest is poor, and the quality of groundwater is better than that of surface water." Total nitrogen (TN) and total phosphorus (TP) in surface water and ammonium nitrogen (NH3-N), ferrum (Fe), and manganese (Mn) in groundwater are the main pollutants. The TP and TN in surface water and the NH3-N in groundwater exceeded the relevant standards, likely due to the excessive application of chemical fertilizers, especially nitrogen fertilizers. Additionally, Fe and Mn are harmful native substances. According to these findings, targeted improvement strategies, such as reducing nitrogen fertilizer application, plugging well, and increasing the surface water utilization rate, are proposed. Moreover, the ChOA-RF model is compared with the traditional empirical value model and the particle swarm optimization-random forest (PSO-RF) model. The results show that the ChOA-RF model can effectively reduce the root mean square error and mean absolute percentage error and improve the coefficient of determination. The running time and convergence ability are also better than those of the PSO-RF model, which is a more accurate and efficient machine learning model. The model can be used not only for high-precision evaluation of regional water environment quality but also for other machine learning fields.

The Application of Big Data in the Management of Ideological and Political Education in the Development of Education Network

Based on a brief analysis of the current situation of university education management and research on intelligent algorithms, this article constructs a university education management system based on big data. For the clustering and prediction modules in higher education management, corresponding algorithms are used for optimization design. A fuzzy clustering algorithm based on entropy weight is proposed to address the shortcomings of the C-means clustering algorithm. This algorithm adds weighting coefficients on the basis of improvement and continuously updates the clustering centers. The prediction module uses Apriori algorithm to map and compress the target transaction database, reduces the number of candidate item sets through pruning process, and designs simulation experiments to measure the performance of the algorithm. The simulation results show that the clustering results of this algorithm are closer to the actual clustering situation, with shorter running time and better algorithm performance.

Combining Machine Learning techniques and Genetic Algorithm for predicting run times of High Performance Computing jobs

This study proposes a novel approach combining Machine Learning (ML) techniques and Genetic Algorithms (GA) for predicting High-Performance Computing (HPC) job run times. The objective is to create a prediction method universally applicable to any HPC system, irrespective of workload characteristics, application specific parameters, user behavior, or hardware architecture. Since user-supplied run time estimates are often inaccurate, we aim to categorize job runtimes into several classes, allowing users to select appropriate classes for their jobs. A Genetic Algorithm is developed to optimally define these runtime classes, determining both the number of classes and the time intervals represented by them. Four Machine Learning algorithms (K Nearest Neighbours, Support Vector Regression, Extreme Gradient Boosting and Deep Neural Networks) are implemented for run time prediction. A unique set of features extracted from historical job data serves as input to the Machine Learning models. The generalized nature of our method is demonstrated by validating its performance on data from six clusters with distinct configurations, applications and runtime distributions. Our results illustrate the superior performance of Machine Learning models incorporating GA-defined runtime classes for all datasets. Across all six datasets, our method achieves R2 scores exceeding 0.8, and accuracy greater than 0.7.