Search

Running performance is crucial for triathlon performance. However, the prior bout of cycling may affect the running split time. This study compared the triathletes' cycling plus running (C+R) time, when cycling was performed at three different intensities and running was maximal. A total of 38 athletes (21 males and 17 females) were included. Body composition, maximal oxygen uptake, and functional threshold power (FTP) was evaluated. The participants visited the laboratory three times to cycle 20 km at 80%, 85%, or 90% FTP (in randomized order) and run 5 km as fast as possible. Males ran faster after cycling at 80% FTP than after cycling at 90% FTP (mean difference=35.1 s; CI% 2.2, 68.1 s; p=0.035). The C+R time was faster when cycling at 90% FTP than at 80% FTP (mean difference=57.7 s; CI% 26.1, 89.3 s; p<0.001). For females, no significant difference was observed in the running time after cycling at 80%, 85%, or 90% FTP. The C+R time was faster when cycling at 90% FTP than at 80% FTP (mean difference=80.9 s; CI% 29.7, 132.1 s; p=0.002). In conclusion, to optimize triathlon performance, male and female athletes should cycle at a minimum of 90% FTP. [ABSTRACT FROM AUTHOR]

This study aims to evaluate the effectiveness of assessing agility in volleyball players by comparing traditional testing methods with computerized measurements, using student athletes as subjects. Methods: A comprehensive approach was employed, including analysis of scientific literature, pedagogical observation, exclusive interviews, traditional agility tests, and computerized measurement tools designed for precise speed assessment. Heart and respiratory rate were monitored, and statistical analyses were performed. Results: Modification of traditional tests, including "Running for 92 meters in the shape of spruce" and "Running 5 x 6 m, (30 m)" was performed, introducing a new running test named "Running in the shape of star" (certificate No. 005215). Following implementation, the running time improvements were notable: "Running in the spruce configuration" increased from 4.19 s to 9.25 s, "Running 5 x 6 m" from 4.78 s to 10.60 s, and "Star" from 3.35 s to 9.09 s. A computerized device was developed (certificate No. 005215), ensuring reliable data storage and comparison with traditional tests. Improvements were observed in "Running in the spruce configuration" (5.73%), "5 x 6 m running" (10.41%), and "Running in the shape of star" (7.25% left side, 7.42% right side). In the control group, these indicators are 1.51%, 2.73%, and 5.18%. Conclusion: The analysis of various sources has revealed a significant limitation in relying solely on stopwatch-based tests to assess the quality of speed characteristics in sports games. These tests, conducted without standardized conditions and procedures, are susceptible to subjective or mechanical influences such as stopwatch accuracy, the mental state of the participants, and the observers' knowledge and experience. Consequently, the objectivity and reliability of the results obtained through such methods are compromised. This discrepancy is evident in volleyball, where regulatory requirements established by experts for qualified players aged 18-20 for the "Running for 92 meters in the shape of spruce" test vary considerably (ranging from 23.4-24.0 to 25.0-25.9 s). Such inconsistencies have been observed in evaluations, current research, and survey results reviewed in the analysis. [ABSTRACT FROM AUTHOR]

Since developers often need to organize data, choosing the fastest and most efficient sorting algorithm depending on the size and other properties of the data, as well as the programming language, is relevant. In some cases, processing the data directly in the browser is necessary due to the need for high data confidentiality. The growing popularity of TypeScript in web development over the past year makes it topical to study the effectiveness of various sorting algorithms in this language. This paper investigates the speed and performance of twelve sorting algorithms using the modern web development language TypeScript: Bubble, Selection, Insertion, Shell, Merge, Quick, TimSort, Smooth, Introspective, Gravity, Radix, and built-in. We compared the actual runtime of each algorithm for sets of pseudorandom integers from 1000 to 100,000,000 elements. Although the built-in sort() TS method is flexible and adapts to different situations, the study results show that it gives the best results and can only be a good choice on data up to 1000 items. The built-in method loses to Quick Sort, Introspective Sort, Timsort, and Merge Sort algorithms on larger arrays and may not be the best choice. Therefore, studying the efficiency and features of sorting algorithms is very relevant. The applied aspect of the study is to find out which algorithm, when implemented in TypeScript, will optimally sort an array of pseudorandom numbers depending on its size and other properties. The results can help effectively choose one algorithm under certain conditions and data. The study confirmed that each sorting algorithm we considered has advantages and disadvantages. The choice of an appropriate sorting algorithm for a particular development task depends mainly on the size and specific characteristics of the data and the programming language. The choice is also influenced by the desired level of sorting efficiency and the stability requirements of the algorithm. [ABSTRACT FROM AUTHOR]

The traditional electrical control system has the problem of insufficient function control. This paper designs the engineering electrical control system through the learning algorithm based on fuzzy neural network. The control strategy design module combines fuzzy reasoning with neural network to design intelligent control strategy. Develop a variety of control principles and strategies that can meet the needs and characteristics of the system. The user interface module assists users to monitor and adjust the system, and has the functions of real-time data display and setting control parameters. Fuzzy neural network modeling module combines fuzzy logic with neural network to model the system. In this paper, the sliding window technology is used to collect and process data in real time. When the running time is 1 hour, the system output value is 100.2 and the output fluctuation value is 0.6; When the running time is 2 hours, the system output value is 99.8 and the output fluctuation value is 0.7. The learning algorithm based on fuzzy neural network has little fluctuation and stable performance. [ABSTRACT FROM AUTHOR]

Ozone-biologically activated carbon (BAC) filtration is an advanced treatment process that can be applied to remove recalcitrant organic micro-pollutants in drinking water treatment plants (DWTPs). In this study, we continuously monitored a new and an old BAC filter in a DWTP for 1 year to compare their water purification performance and microbial community evolution. The results revealed that, compared with the new filter, the use of the old BAC filter facilitated a slightly lower rate of dissolved organic carbon (DOC) removal. In the case of the new BAC filter, we recorded general increases in the biomass and microbial diversity of the biofilm with a prolongation of operating time, with the biomass stabilizing after 7 months. For both new and old BAC filters, Proteobacteria and Acidobacteria were the dominant bacterial phyla. At the genus level, the microbial community gradually shifted over the course of operation from a predominance of Herminiimonas and Hydrogenophaga to one predominated by Bradyrhizbium, Bryobacter, Hyphomicrobium, and Pedomicrobium, with Bradyrhizobium being established as the most abundant genus in the old BAC filter. Regarding spatial distribution, we detected reductions in the biomass and number of operational taxonomic units with increasing biofilm depth, whereas there was a corresponding increase in microbial diversity. However, compared with the effects of time, the influence of depth on the composition of the biofilm microbial community was considerably smaller. Furthermore, co-occurrence network analysis revealed that the microbial community network of the new filter after 11 months of operation was the most tightly connected, although its modular coefficient was the lowest of those assessed. We speculate that the positive and negative interactions within the network may be attributable to symbiotic or competitive relationships among species. Moreover, there may have been a significant negative interaction between SWB02 and Acidovorax, plausibly associated with a competition for substrates. [ABSTRACT FROM AUTHOR]

The brain storm optimization (BSO) algorithm has received increased attention in the field of evolutionary computation. While BSO has been applied in numerous industrial scenarios due to its effectiveness and accessibility, there are few theoretical analysis results about its running time. Running-time analysis can be conducted through the estimation of the upper bounds of the expected first hitting time to evaluate the efficiency of BSO. This study estimates the upper bounds of the expected first hitting time on six single individual BSO variants (BSOs with one individual) based on the average gain model. The theoretical analysis indicates the following results. (1) The time complexity of the six BSO variants is O (n) in equal coefficient linear functions regardless of the presence or absence of the disrupting operator, where n is the number of the dimensions. Moreover, the coefficient of the upper bounds on the expected first hitting time shows that the single individual BSOs with the disrupting operator require fewer iterations to obtain the target solution than the single individual BSOs without the disrupting operator. (2) The upper bounds on the expected first hitting time of single individual BSOs with the standard normally distributed mutation operator are lower than those of BSOs with the uniformly distributed mutation operator. (3) The upper bounds on the expected first hitting time of single individual BSOs with the U − 1 2 , 1 2 mutation operator are approximately twice those of BSOs with the U (− 1 , 1) mutation operator. The corresponding numerical results are also consistent with the theoretical analysis results. [ABSTRACT FROM AUTHOR]

Multi-objective evolutionary algorithm based on decomposition (MOEA/D) has achieved great success in the field of evolutionary multi-objective optimization. It decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems. Each sub-problem is optimized by using information from its neighboring sub-problems. Therefore, the neighborhood size of each sub-problem plays an important role in MOEA/D. Different neighborhood sizes are tested in this paper. Experimental results demonstrate that larger neighborhood size helps achieve better convergence and diversity with more CPU time and vice versa. MOEA/D uses constant neighborhood size during the whole process, and it is difficult to balance the convergence, diversity and running time. Therefore, this paper propose an algorithm based on MOEA/D. The algorithm adjusts the neighborhood size dynamically in different generations and different sub-problems to reduce the running time while the convergence and diversity of this algorithm are similar or better than other state-of-the-art algorithms. Compared to the original MOEA/D, experimental results show that adjusting the neighborhood size dynamically is a good way to reduce the running time significantly while maintaining the convergence and diversity. Furthermore, the algorithm proposed in this paper is compared with five state-of-the-art algorithms based on MOEA/D. The experimental results show that the proposed algorithm outperforms the others in efficiency while performs similarly in convergence and diversity.

The use of modern electronic gadgets leads to high rates of work, better assimilation of knowledge and a high level of preparedness of students. Introduction in educational process of new e-learning-notebooks, tablets, e-readers require justifi cation of their safety for health of pupils, and the rapid modernization of electronic gadgets, the speed of these studies. The widespread use of information technology has potential negative consequences associated with Freestyle or unwitting violation or disregard of user’s safe modes that must be followed in the application. The purpose of the research was to study the infl uence of Tablet PC e-learning in secondary school on the functional state of the students. The study was conducted at the beginning and end of lessons using electronic tablets, and without them the 235 pupils of 7–8 classes. Analysis of the responses of the functional systems of the grade 7 students at diff erent school organization not only not improved the tiring eff ects of lessons on using electronic tablets, but also showed greater resistance to fatigue from them than the traditional classroom because of hygienic management of lessons in applying e-learning: the optimal change of activity, the density of 60–80% of the lessons, the total duration of the work with the Tablet for the lesson-no more than 15 minutes continuous / no more than 4 minutes. Training using electronic textbook for eighth graders proved more arduous than classes without Tablet PC: by the end of the lesson, have dropped the speed and accuracy of work, IHI mental performance declined in 3 times, 51% of students complete lessons with explicit and visible fatigue. The infl uence of electronic tablet on tedious functional state of class 8 students due to a variety of reasons (high intensity training with frequent change of training), features of adaptation of pupils not only to new technical means of teaching, but also to the new subject, technical diffi culties in the development of e-learning tools. For an objective judgement on the impact of electronic textbooks on the functional State of an organism students need longer (minimum school year) monitoring.

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Two-party signing can be used to provide a high level of key protection especially in the blockchain systems where the safety of money relies on the safety of the signing key. With a two-party signing protocol, the signing key is distributed among two devices, thus the funds are safe as long as one device remains uncorrupted. In this paper, we study the two-party signing protocols for all ISO/IEC signature standards. The mechanisms based on elliptic curve discrete logarithm in ISO/IEC can be divided into three types: Schnorr-type, Elliptic Curve Digital Signature Algorithm (ECDSA)-type and SM2-type. There have already been efficient two-party protocols based on Schnorr signature scheme which can be easily extended into all Schnorr-type standards. However, it is particularly hard to construct efficient distributed SM2-type and ECDSA-type protocols due to their nonlinear signing equations. In this paper, we present the first secure and efficient two-party protocol over SM2-type signature standard. We prove its security in the generic group model. We then construct a more efficient two-party ECDSA protocol that is secure in the generic group model and outperforms all previous works. [ABSTRACT FROM AUTHOR]

The running time of pigs in submarine pipelines is an important reference for pig receiving operation. In order to identify the factors that influence the running time of pigs, the correlation degree of pipeline mileage, pipeline inlet/outlet pressure difference, gas transport capacity, pipeline inlet/outlet temperature difference, amount of interference, pig quality, oil transport capacity and water cut was calculated with the grey incidence analysis method. Meanwhile, the incidence between the influencing factors and the running time of pigs was also analyzed, and on this basis, a BP neural network prediction model of pig running time in the network structure of (8, 11, 1) was established. Then, the running time of pig in submarine pipeline was predicted and verified based on the data record of pigging operation in a submarine pipeline of the Bohai Oilfield. It is indicated that the running time of pigs predicted by the BP prediction model has an average error of 8 min and an average relative error of 12.5%. In general, the research results could provide reference for the preparation of a reasonable plan for pig receiving operation in the submarine pipelines.

Despite the importance of running time, the economic literature focusing on the determinants of box-office revenues has almost neglected its role as a strategic variable. This note fills in this lack of literature by focusing on the role of running time on box-office revenues. To this aim, using an original dataset composed of worldwide top 20 titles from 2010 to 2019, we perform a two-stage Data Envelopment Analysis (DEA), in which scale efficiency is defined as the capability to plan running time in order to maximize box-office revenues. Results show that running time is a crucial strategic variable to design revenue performance, whose role significantly differs across genres. [ABSTRACT FROM AUTHOR]

Recurrent events refer to events that over time can occur several times for each individual. Full use of such data in a clinical trial requires a method that addresses the dependence between events. For modelling this dependence, there are two time scales to consider, namely time since start of the study (running time) or time since most recent event (gap time). In the multi-state setup, it is possible to estimate parameters also in the case, where the hazard model allows for an effect of both time scales, making this an extremely flexible approach. However, for summarizing the effect of a treatment in a transparent and informative way, the choice of time scale and model requires much more care. This paper discusses these choices both from a theoretical and practical point of view. This is supported by a simulation study showing that in a frailty model with assumptions covered by both time scales, the gap time approach may give misleading results. A literature dataset is used for illustrating the issues. [ABSTRACT FROM AUTHOR]

On the basis of what is known about the biology and the cognitive abilities of the workers of the ant Myrmica sabuleti studied at a collective level, we wondered if these ants could associate sighted cues with time periods of the day. Working on four colonies and using four different cues, we showed that, trained to one kind of cue from 8 to 19 o'clock and, at the same time, to another kind of cue from 20 o'clock to 7 o'clock the next day, the ants responded far more to the first kind of cue at 16 o'clock and far more to the second kind of cue at 4 o'clock. Thus, they not only learned the conditioned stimuli but also associated them with the time of day during which the conditionings were performed. Results of previous experiments on quantitative sequences rule out the possibility that the present findings could be explained by an aversion to less recently learned cues. Associating environmental cues to particular times of the day should allow ants to best adapt their behavior to their habitat. [ABSTRACT FROM AUTHOR]

Household room air conditioners (RACs) are widely used in residential buildings to maintain an indoor thermal climate in China's hot summer and cold winter (HSCW) zone. The aggregate utilization of RACs in a region has a great impact on regional energy demand in both the heating and cooling seasons. Classifying household RAC users and identifying their RAC usage demands will contribute to better balanced regional energy management for building energy flexibility. In this study, a data-driven method was proposed to classify the household RAC user groups at the regional level, using running time as an indicator. The results showed that RAC users could be classified into four groups with different RAC usage demands. The Lower Class was determined by the absolute poverty line with the Gini coefficient. In addition, the Upper Class was distinguished through the determination of the scaling region in power-law distribution. At the same time, the similarities and differences between different classes in monthly and hourly periods and the flexibility potential were discussed. The rigid demand was observed in the monthly periods of June, July and August and during the hourly periods of 21:00–22:00 in both the bedroom and living-room. [ABSTRACT FROM AUTHOR]

Deep learning based on convolutional neural network (CNN) has been successfully applied to stereo matching, which has achieved greater improvement in speed and accuracy compared with traditional methods. However, existing CNN-based stereo matching frameworks frequently encounter two problems. First, the existing stereo matching network has a large number of parameters, which results in too long matching running time since excessive network width and excessive number of convolution kernels. Second, in some areas where reflection, refraction and fine structure may lead to ill-posed problems, the disparity estimation errors can be occurred. In this paper, we proposed a lightweight network, convolution attention residual network (CAR-Net), which can balance the real-time matching and matching accuracy for stereo matching. Besides, a multi-scale residual network called CBAM-ResNeXt, which combines attention, was proposed for features extraction. With an aim is to simplify the parameters of the network model by reducing the size of filters and to extract the semantic features such as categories and locations from the image through convolutional block attention module (CBAM). Here, the CBAM consists of channel attention module and spatial attention module, where the semantic information of the feature map can be fully maintained after the parameters were simplified. Moreover, we proposed a dimension-extended 3D-CBAM, which is connected to 3DCNN for cost aggregation. By combining these two sub-modules of attention, the network is guided to selectively focus on the foreground or background regions, so as to improve the disparity accuracy in the ill-posed regions. The experimental results showed that our proposed method generated high accuracy and optimized the velocity compared to the state-of-the-art benchmark on KITTI 2012, KITTI 2015 and Scene Flow.

Getachew Wassihun Dessalew, Dawit Habte Woldeyes, Belta Asnakew Abegaz Anatomy Unit, Department of Biomedical Sciences, College of Medicine and Health Sciences, Bahir Dar University, Bahir Dar, EthiopiaCorrespondence: Dawit Habte Woldeyes Tel +251 913214906Fax +251 582202025Email dwthabte@gmail.comIntroduction: The key elements of success in a given sports competition have become an area of interest for researchers. The reason for the success of Ethiopian runners was not proved scientifically. This study aimed at documenting the anthropometric parameters of 10,000 meter runners and to find out the association between such parameters and performances.Methods: A descriptive field study was conducted. 32 elite 10,000 meter runners participated. The data were collected while the athletics team was preparing for the world athletics championship. The procedure was repeated three times for each individual. Statistical analysis was performed using SPSS version 18. All the data were presented as mean ± S.D. The Pearson product-moment test was used to determine the correlation between the variables and finishing time. The level of significance for all statistical tests was set at p < 0.05.Results: The experience of male and female athletes showed a negative association with finishing time. However, there was no statistically significant correlation between the age and running time in both sexes. A significant positive association of body weight to running time was observed in both sexes. Body height correlates positively to running time in males (p

By establishing the mathematical model of helicopter transmission system running time and flight time, engine working time, the time ratio relation between running time and flight time is deduced, that is, conversion coefficient. Using Minitab software to complete the data calculation, the running time of the transmission system is converted into the corresponding flight time. Compared with the traditional way which only considers the flight time in the air, the real and accurate time between overhaul can be obtained and the reliability can be improved. At the same time, the maintenance time scale of the transmission system and other parts of the helicopter can be ensured. This method is successfully applied to a certain type of helicopter, and some reference for the maintenance of similar aviation products can be provided.

Household room air conditioners (RACs) are widely used in residential buildings to maintain an indoor thermal climate in China’s hot summer and cold winter (HSCW) zone. The aggregate utilization of RACs in a region has a great impact on regional energy demand in both the heating and cooling seasons. Classifying household RAC users and identifying their RAC usage demands will contribute to better balanced regional energy management for building energy flexibility. In this study, a data-driven method was proposed to classify the household RAC user groups at the regional level, using running time as an indicator. The results showed that RAC users could be classified into four groups with different RAC usage demands. The Lower Class was determined by the absolute poverty line with the Gini coefficient. In addition, the Upper Class was distinguished through the determination of the scaling region in power-law distribution. At the same time, the similarities and differences between different classes in monthly and hourly periods and the flexibility potential were discussed. The rigid demand was observed in the monthly periods of June, July and August and during the hourly periods of 21:00–22:00 in both the bedroom and living-room.

Introduction. The issues on standardization of reliability indices in the early stages of machine design are considered. This approach maintains thetarget level of reliability when developing parts that are critical in view of stable operation. The work objective is to study design problems in this area. The analysis of the reliability regulation methods suggests that they are insufficient to design. Besides, there are some contradictions associated with the use of the exponential failure law in design.Materials and Methods. At the stage of the task order, the numerical values of the operation time and reliability of the machine are determined. Then the values of the reliability probabilities or failures of the system and its elements are shown by exponential expressions. In them, degrees are the ranking parameters of the system reliability indices.Research Results. The alternative approach to normalization is synthesized; it enables to complete a full structural analysis. Thus, the reliability indices of the entire system or parts, whose operational safety determines the machine reliability, can be assessed. Parts and other components, whose failures are not sudden, are considered without using the exponential law. This preserves the inherent simplicity of mathematical operations.Discussion and Conclusions. The numerical value of the reliability probability (RP) of the machine as a whole, taken at the stage of the task order, is insufficient for the reliability target design. The specified RP and running time of the system elements, which are sources of failures developing according to different laws, are required. The results obtained can be used both in designing new mechanical systems with the reliability target, and in the modernization of machines.

With advancements in the mechanisation of sugarcane farming, studies have been fundamental to improving the process—from soil preparation to harvest. Faced with increasing challenges of economic scenarios, alternatives should be sought aimed at optimising resources, reducing costs, improving operational efficiency, logistics, among others. Planting is one of the main agricultural operations, any deviation in this phase harms the crop during the crop cycle, so planning in advance the area to be planted is essential for better results. Analysis of better planting scenarios prior to harvest combined with the use of autopilot requires knowledge of the systematisation areas and skilled labour to guarantee the quality of the process and reduce losses and damages. The objective of this study is to both evaluate and optimise sugarcane planting scenarios based on travel and manoeuvre time, travel distance, number of manoeuvres, and fuel consumption. The study was conducted in the municipality of Tanabi, SP, during the 2013 planting season. The results showed fewer manoeuvres and longer planting lines in the optimised area, increased the availability of the machine and generated possible cost reduction. [ABSTRACT FROM AUTHOR]

As a fundamental technique for data analysis, graph clustering grouping graph data into clusters has attracted great attentions in recent years. In this paper, we present DPOCG, a dynamic programming framework for large-scale online clustering on graphs, which improves the scalability of a wide range of graph clustering algorithms. Specifically, DPOCG first identifies the nodes whose states are unchanged compared with the states at the previous time on a large-scale graph, then constructs these unchanged nodes as supernodes, which greatly reduces the size of the graph at the current time, and collapses nodes whose degrees are less than a predefined threshold. Based on our density-based graph clustering algorithm (DGCM), DPOCG partitions the reduced graph into clusters. In addition, we theoretically analyze DPOCG in terms of supernode generation, clustering on reduced graph, and computational complexity. We evaluate DPOCG on a synthetic dataset and seven real-world datasets, respectively, and the experimental results show that DPOCG consumes less running time and improves the efficiency of clustering. [ABSTRACT FROM AUTHOR]

Background and Objectives: The relationship between range of motion of joints with running time is important to achieve athletic success. The aim of this study was investigating the correlation between range of motion of joints with the time of running types in adolescent elite runner girls participating in 2018 national competitions in Ardabil city. Materials and Methods: In this descriptive study, subjects were 122 elite runner girls, 14-16 year, participated in the national championship of the country selection. Range of motion of joints was measured by Rydkov questionnaire. Pearson᾽ s correlation coefficient was used to examine the correlation between variables. Results: There was a positive significant correlation between elbow flexion (r=0.407, p=0.048) and 60m hurdle running time, between hip hyperadduction (r=0.531, p=0.005) and 400m running time, trunk flexion (r=0.656, p=0.001) and 800m running time, neck extension (r=0.646, p=0.001) and neck lateral bending to left (r=0.563, p=0.006) and 3000m running time, trunk lateral bending to right (r=0.418, p=0.028), trunk lateral bending to left (r=0.382, p=0.045), shoulder abduction (r=0.379, p=0.047) and hip hyperextension (r=0.398, p=0.038) and 4×100m relay race time. Whereas, there was a negative significant correlation between ankle dorsi flexion (r=-0.464, p=0.022) and 60m hurdle running time, between ankle inversion (r=-0.442, p=0.030) and 800m running time, shoulder hyperextension (r=-0.473, p=0.017) and 1500m running time, and ankle eversion (r=-0.440, p=0.040) and 3000m running time. Conclusion: It seems that there is a significant correlation between the range of motion of joints and running time in elite runner girls. So, it is suggested that coaches pay attention to the results of this study for getting more success in reaching the peak of athletic performance. [ABSTRACT FROM AUTHOR]

Currently, it is important to monitor multivariate data in a timely manner. The spatial–rank–based multivariate exponentially weighted moving average control chart (SREWMA) has better relative performance for multivariate data monitoring when the underlying distribution is non–normal. However, with the increasing amount of data, the computation requires increasing system memory. Thus, the running speed of the computer and monitoring efficiency of the SREWMA control chart are reduced. Regarding this issue, this paper provides the concept of storage space and adding storage space to the proposed SREWMA control chart. When the observations in storage space reach a fixed number of spatial-rank calculations, the computer begins to control the amount of calculations and memory. The SREWMA with storage space control chart greatly improves the running speed of the SREWMA control chart and is robust for various distributions. Finally, a real-data example from banknote authentication is provided to illustrate the proposed method. [ABSTRACT FROM AUTHOR]

The shortest path problem is the problem of finding a path with minimum total weight from a source node to each destination node in a network. The existing solution to this fundamental problem searches the shortest paths to all network nodes until it meets the given multiple-destination nodes. By granting preference to routes to each destination node, the proposed algorithm meets the destination nodes faster. The results of the experimental analysis on a real-world dataset and simulated random networks show the superiority of the proposed algorithm to the existing solution. This remarkable improvement makes the proposed algorithm applicable in all related applications. [ABSTRACT FROM AUTHOR]

A hybridization of kidney-inspired and sine–cosine algorithm has been proposed for a path planning of multiple mobile robots in the environment where obstacles are either static or moveable. In this novel approach, each robot computes its collision-free optimal path from their corresponding start position to goal position through hybridization of kidney-inspired algorithm (KA) and sine–cosine algorithm (SCA). The proposed KA–SCA employs the selection of subsequent optimal position for each robot from their current position by escaping the collision with dynamic obstacles and teammates. In the present work, SCA is used to accelerate the convergence rate of KA, to preserve a good equilibrium between the intensification and diversification, and to compute an optimal path for each robot by minimizing the path distance, path deviation, number of rotation for each robot, and running time required to reach their destination. Finally, the effectiveness and robustness of the proposed algorithm have been verified with the result of KA and SCA in the same environment. The result obtained from the real platform and simulation environment reveals that the proposed KA–SCA outperforms KA and SCA. [ABSTRACT FROM AUTHOR]

In a previous paper we used computer running times to define a class of computable probability distributions on the set of halting programs and developed a probabilistic anytime algorithm for the Halting Problem. The choice of a computable probability distribution – essential for the algorithm – can be rather subjective and hard to substantiate. In this paper we propose and study an efficient statistical anytime algorithm for the Halting Problem. The main advantage of the statistical algorithm is that it can be implemented without any prior information about the running times on the specific model of computation and the cut-off temporal bound is reasonably small. The algorithm has two parts: the pre-processing which is done only once (when the parameters of the quality of solutions are fixed) and the main part which is run for any input program. With a confidence level as large as required, the algorithm produces correct decisions with a probability as large as required. Three implementations of the algorithm are presented and numerically illustrated. [ABSTRACT FROM AUTHOR]

We discuss the following family of problems, parameterized by integers C ≥ 2 and D ≥ 1 : Does a given one-tape q -state Turing machine make at most C n + D steps on all computations on all inputs of length n , for all n ? Assuming a fixed tape and input alphabet, we show that these problems are co-NP-complete and we provide good lower bounds. Specifically, these problems cannot be solved in o (q (C − 1) / 4) nondeterministic time by multi-tape Turing machines. We also show that the complements of these problems can be solved in O (q C + 2) nondeterministic time and cannot be solved in o (q (C − 1) / 4) nondeterministic time by multi-tape Turing machines. [ABSTRACT FROM AUTHOR]

This paper will point of convergence on a relative assessment and estimation of the dynamic programming, B&B, Greedy and Genetic algorithm including of the intricacy of time prerequisites, and the necessary programming endeavors and inspect the absolute incentive for every one of them. Out of these four, Two algorithm (Greedy and Genetic) algorithm can be utilized to clear up the 0-1 Knapsack issue inside a sensible time multifaceted nature. The most pessimistic scenario time unpredictability (Big-O) of the two calculations is O(N). Parallely, these calculations can't find the accurate response to the issue; they are valuable in detecting a close by premier final product as it were. Our basic commitment directly here is to investigate the two calculations contrary to common benchmark realities units and to quantify the precision of the impacts provided by method for each calculation. In this way, we will think about the top notch neighbourhood result created by utilizing the calculation against the genuine real most dependable outcome. [ABSTRACT FROM AUTHOR]

Various signals of finite length are often analysed by the Wigner‐Ville distribution (WVD). Thus, this article deals with the implementation of their discrete WVDs on field‐programmable gate arrays (FPGAs). For the discrete WVD, its calculation procedures are composed of the autocorrelation function and Fourier transform. Since the autocorrelation procedure is the most time‐consuming step in the entire computation process, the authors analyse the calculation procedure of autocorrelation function in detail. Here the proposed efficient method just calculates partial non‐zero elements of the autocorrelation matrices in order to reduce the computation complexity. The FFT (built‐in FPGAs) is then utilised to acquire the discrete WVD. In addition, the idea of the fully‐pipelined and parallelism is borrowed to reduce the running time but at the cost of recourses. Finally, the authors provide implementations of both authors proposed method and two other algorithms on different FPGAs. The experimental results show that the Intel Arria‐10 FPGA families are the better choice in the floating point arithmetic and that authors method has the best performance. [ABSTRACT FROM AUTHOR]

As the running time of a wind turbine generator unit (WTGU) increases, the ageing and wear of its components will be aggravated gradually, which leads to deterioration of its operation condition. In order to ensure the safe and stable operation of WTGU and prolong its service life, it is of great significance to know the health condition of the WTGU and reasonably arrange maintenance. Based on the structure of the WTGU and the operation principle of the wind turbine generator (WTG), the condition assessment indexes of WTG were built, and the factors influencing the assessment index were determined. The relationship function between the assessment indexes and their influencing factors was established by using the least square support vector machine, which was used to determine the dynamic limitation of condition assessment index of WTG. The dynamic weight of each assessment index was used to characterise the influence of deterioration degree of different components on WTG conditions. Then the health conditions of WTG were evaluated using a similar cloud and fuzzy comprehensive assessment method separately. Finally, the proposed methods were verified by two examples including a direct‐drive permanent magnet wind generator and a doubly‐fed wind generator. [ABSTRACT FROM AUTHOR]