Search results for: training algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 7000

Search results for: training algorithm

6880 The Effect of Circuit Training on Aerobic Fitness and Body Fat Percentage

Authors: Presto Tri Sambodo, Suharjana, Galih Yoga Santiko

Abstract:

Having an ideal body shape healthy body are the desire of everyone, both young and old. The purpose of this study was to determine: (1) the effect of block circuit training on aerobic fitness and body fat percentage, (2) the effect of non-block circuit training on aerobic fitness and body fat percentage, and (3) differences in the effect of exercise on block and non-circuit training block against aerobic fitness and body fat percentage. This research is an experimental research with the prestest posttest design Two groups design. The population in this study were 57 members of fat loss at GOR UNY Fitness Center. The retrieval technique uses purposive random sampling with a sample of 20 people. The instruments with rockport test (1.6 KM) and body fat percentage with a scale of bioelectrical impedance analysis omron (BIA). So it can be concluded the circuit training between block and non-block has a significant effect on aerobic fitness and body fat percentage. And for differences in the effect of circuit training between blocks and non-blocks, it is more influential on aerobic fitness than the percentage of body fat.

Keywords: circuit training, aerobic fitness, body fat percentage, healthy body

Procedia PDF Downloads 208
6879 Research on Knowledge Graph Inference Technology Based on Proximal Policy Optimization

Authors: Yihao Kuang, Bowen Ding

Abstract:

With the increasing scale and complexity of knowledge graph, modern knowledge graph contains more and more types of entity, relationship, and attribute information. Therefore, in recent years, it has been a trend for knowledge graph inference to use reinforcement learning to deal with large-scale, incomplete, and noisy knowledge graphs and improve the inference effect and interpretability. The Proximal Policy Optimization (PPO) algorithm utilizes a near-end strategy optimization approach. This allows for more extensive updates of policy parameters while constraining the update extent to maintain training stability. This characteristic enables PPOs to converge to improved strategies more rapidly, often demonstrating enhanced performance early in the training process. Furthermore, PPO has the advantage of offline learning, effectively utilizing historical experience data for training and enhancing sample utilization. This means that even with limited resources, PPOs can efficiently train for reinforcement learning tasks. Based on these characteristics, this paper aims to obtain a better and more efficient inference effect by introducing PPO into knowledge inference technology.

Keywords: reinforcement learning, PPO, knowledge inference

Procedia PDF Downloads 199
6878 An Optimization Algorithm Based on Dynamic Schema with Dissimilarities and Similarities of Chromosomes

Authors: Radhwan Yousif Sedik Al-Jawadi

Abstract:

Optimization is necessary for finding appropriate solutions to a range of real-life problems. In particular, genetic (or more generally, evolutionary) algorithms have proved very useful in solving many problems for which analytical solutions are not available. In this paper, we present an optimization algorithm called Dynamic Schema with Dissimilarity and Similarity of Chromosomes (DSDSC) which is a variant of the classical genetic algorithm. This approach constructs new chromosomes from a schema and pairs of existing ones by exploring their dissimilarities and similarities. To show the effectiveness of the algorithm, it is tested and compared with the classical GA, on 15 two-dimensional optimization problems taken from literature. We have found that, in most cases, our method is better than the classical genetic algorithm.

Keywords: chromosome injection, dynamic schema, genetic algorithm, similarity and dissimilarity

Procedia PDF Downloads 315
6877 Ceramic Employees’ Occupational Health and Safety Training Expectations in Turkey

Authors: Erol Karaca

Abstract:

This study aims to analyze ceramic employees’ occupational health and safety training expectations. To that general objective, the study tries to examine whether occupational health and safety training expectations of ceramic employees meaningfully differentiate depending on demographic features and professional, social and economic conditions. For this purpose, the research data was collected through “Questionnaire of Occupational Health and Safety Training Expectation” (QSOHSTE) consisting of 25 open and close-ended questions developed by the researcher on the base of the literature review. QSOHSTE was applied to 125 ceramic employees working in Kutahya, Turkey. Data obtained from questionnaires were analyzed via SPSS 21. The findings, obtained from the study, revealed that employees’ agreement level to occupational health and safety training expectation statements is generally high-level. These findings also reveals that employees have various expectations about occupational health and safety training. These expectations are increasing sensitivity towards occupational health and safety training about the prevention of occupational accidents and diseases, contributing occupational health and safety training in establishing healthy and safe working environment, requiring occupational health and safety training before starting work, in case of changing working equipment and new technological applications, necessity of measurement and evaluation after occupational health and safety training. Besides these findings, employees’ agreement level to occupational health and safety training expectation statements also varies in terms of educational level, professional seniority, income level and perception of economic condition.

Keywords: occupational health and safety, occupational training, occupational expectation, professional seniority

Procedia PDF Downloads 415
6876 An Integrated Approach of Isolated and Combined Aerobic and Anaerobic Interval Training for Improvement of Stride Length and Stride Frequency of Soccer Players

Authors: K. A. Ramesh

Abstract:

Purpose: The study is to find out the effect of isolated and combined aerobic and anaerobic interval training on stride length and stride frequency of Soccer players. Method(s): To achieve this purpose, 45 women Soccer players who participated in the Anna University, Tamilnadu, India. Intercollegiate Tournament was selected as subjects and were randomly divided into three equal groups of fifteen each, such as an anaerobic interval training group (group-I), anaerobic interval training group (group-II) and combined aerobic-anaerobic interval training group (group-III). The training program was conducted three days per weeks for a period of six weeks. Stride length and Stride frequency was selected as dependent variables. All the subjects of the three groups were tested on selected criterion variables at prior to and immediately after the training program. The concepts of dependent test were employed to find out the significant improvement due to the influence of training programs on all the selected criterion variables. The analysis of covariance (ANCOVA) was also used to analyze the significant difference, if, any among the experimental groups. Result(s): The result of the study revealed that combined group was higher than aerobic interval training and anaerobic interval training groups. Conclusion(s): It was concluded that when experimental groups were compared with each other, the combined aerobic – anaerobic interval training program was found to be greater than the aerobic and the anaerobic interval training programs on the development of stride length and stride frequency. High intensity, combined aerobic – anaerobic interval training program can be carried out in a more soccer specific way than plain running.

Keywords: stride length, stride frequency, interval training, soccer

Procedia PDF Downloads 342
6875 Simulation Approach for a Comparison of Linked Cluster Algorithm and Clusterhead Size Algorithm in Ad Hoc Networks

Authors: Ameen Jameel Alawneh

Abstract:

A Mobile ad-hoc network (MANET) is a collection of wireless mobile hosts that dynamically form a temporary network without the aid of a system administrator. It has neither fixed infrastructure nor wireless ad hoc sessions. It inherently reaches several nodes with a single transmission, and each node functions as both a host and a router. The network maybe represented as a set of clusters each managed by clusterhead. The cluster size is not fixed and it depends on the movement of nodes. We proposed a clusterhead size algorithm (CHSize). This clustering algorithm can be used by several routing algorithms for ad hoc networks. An elected clusterhead is assigned for communication with all other clusters. Analysis and simulation of the algorithm has been implemented using GloMoSim networks simulator, MATLAB and MAPL11 proved that the proposed algorithm achieves the goals.

Keywords: simulation, MANET, Ad-hoc, cluster head size, linked cluster algorithm, loss and dropped packets

Procedia PDF Downloads 366
6874 Hybrid Algorithm for Frequency Channel Selection in Wi-Fi Networks

Authors: Cesar Hernández, Diego Giral, Ingrid Páez

Abstract:

This article proposes a hybrid algorithm for spectrum allocation in cognitive radio networks based on the algorithms Analytical Hierarchical Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) to improve the performance of the spectrum mobility of secondary users in cognitive radio networks. To calculate the level of performance of the proposed algorithm a comparative analysis between the proposed AHP-TOPSIS, Grey Relational Analysis (GRA) and Multiplicative Exponent Weighting (MEW) algorithm is performed. Four evaluation metrics is used. These metrics are the accumulative average of failed handoffs, the accumulative average of handoffs performed, the accumulative average of transmission bandwidth, and the accumulative average of the transmission delay. The results of the comparison show that AHP-TOPSIS Algorithm provides 2.4 times better performance compared to a GRA Algorithm and, 1.5 times better than the MEW Algorithm.

Keywords: cognitive radio, decision making, hybrid algorithm, spectrum handoff, wireless networks

Procedia PDF Downloads 508
6873 The Effect of Static Balance Enhance by Table Tennis Training Intervening on Deaf Children

Authors: Yi-Chun Chang, Ching-Ting Hsu, Wei-Hua Ho, Yueh-Tung Kuo

Abstract:

Children with hearing impairment have deficits of balance and motors. Although most of parents teach deaf children communication skills in early life, but rarely teach the deficits of balance. The purpose of this study was to investigate whether static balance improved after table tennis training. Table tennis training was provided four times a week for eight weeks to two 12-year-old deaf children. The table tennis training included crossover footwork, sideway attack, backhand block-sideways-flutter forehand attack, and one-on-one tight training. Data were gathered weekly and statistical comparisons were made with a paired t-test. We observed that the dominant leg is better than the non-dominant leg in static balance and girl balance ability is better than boy. The final result shows that table tennis training significantly improves the deaf children’s static balance performance. It indicates that table tennis training on deaf children helps the static balance ability.

Keywords: deaf children, static balance, table tennis, vestibular structure

Procedia PDF Downloads 398
6872 Modified Active (MA) Algorithm to Generate Semantic Web Related Clustered Hierarchy for Keyword Search

Authors: G. Leena Giri, Archana Mathur, S. H. Manjula, K. R. Venugopal, L. M. Patnaik

Abstract:

Keyword search in XML documents is based on the notion of lowest common ancestors in the labelled trees model of XML documents and has recently gained a lot of research interest in the database community. In this paper, we propose the Modified Active (MA) algorithm which is an improvement over the active clustering algorithm by taking into consideration the entity aspect of the nodes to find the level of the node pertaining to a particular keyword input by the user. A portion of the bibliography database is used to experimentally evaluate the modified active algorithm and results show that it performs better than the active algorithm. Our modification improves the response time of the system and thereby increases the efficiency of the system.

Keywords: keyword matching patterns, MA algorithm, semantic search, knowledge management

Procedia PDF Downloads 377
6871 Cuckoo Search (CS) Optimization Algorithm for Solving Constrained Optimization

Authors: Sait Ali Uymaz, Gülay Tezel

Abstract:

This paper presents the comparison results on the performance of the Cuckoo Search (CS) algorithm for constrained optimization problems. For constraint handling, CS algorithm uses penalty method. CS algorithm is tested on thirteen well-known test problems and the results obtained are compared to Particle Swarm Optimization (PSO) algorithm. Mean, best, median and worst values were employed for the analyses of performance.

Keywords: cuckoo search, particle swarm optimization, constrained optimization problems, penalty method

Procedia PDF Downloads 524
6870 Left to Right-Right Most Parsing Algorithm with Lookahead

Authors: Jamil Ahmed

Abstract:

Left to Right-Right Most (LR) parsing algorithm is a widely used algorithm of syntax analysis. It is contingent on a parsing table, whereas the parsing tables are extracted from the grammar. The parsing table specifies the actions to be taken during parsing. It requires that the parsing table should have no action conflicts for the same input symbol. This requirement imposes a condition on the class of grammars over which the LR algorithms work. However, there are grammars for which the parsing tables hold action conflicts. In such cases, the algorithm needs a capability of scanning (looking-ahead) next input symbols ahead of the current input symbol. In this paper, a ‘Left to Right’-‘Right Most’ parsing algorithm with lookahead capability is introduced. The 'look-ahead' capability in the LR parsing algorithm is the major contribution of this paper. The practicality of the proposed algorithm is substantiated by the parser implementation of the Context Free Grammar (CFG) of an already proposed programming language 'State Controlled Object Oriented Programming' (SCOOP). SCOOP’s Context Free Grammar has 125 productions and 192 item sets. This algorithm parses SCOOP while the grammar requires to ‘look ahead’ the input symbols due to action conflicts in its parsing table. Proposed LR parsing algorithm with lookahead capability can be viewed as an optimization of ‘Simple Left to Right’-‘Right Most’ (SLR) parsing algorithm.

Keywords: left to right-right most parsing, syntax analysis, bottom-up parsing algorithm

Procedia PDF Downloads 93
6869 Improved Whale Algorithm Based on Information Entropy and Its Application in Truss Structure Optimization Design

Authors: Serges Mendomo Meye, Li Guowei, Shen Zhenzhong, Gan Lei, Xu Liqun

Abstract:

Given the limitations of the original whale optimization algorithm (WAO) in local optimum and low convergence accuracy in truss structure optimization problems, based on the fundamental whale algorithm, an improved whale optimization algorithm (SWAO) based on information entropy is proposed. The information entropy itself is an uncertain measure. It is used to control the range of whale searches in path selection. It can overcome the shortcomings of the basic whale optimization algorithm (WAO) and can improve the global convergence speed of the algorithm. Taking truss structure as the optimization research object, the mathematical model of truss structure optimization is established; the cross-sectional area of truss is taken as the design variable; the objective function is the weight of truss structure; and an improved whale optimization algorithm (SWAO) is used for optimization design, which provides a new idea and means for its application in large and complex engineering structure optimization design.

Keywords: information entropy, structural optimization, truss structure, whale algorithm

Procedia PDF Downloads 211
6868 Parallel Version of Reinhard’s Color Transfer Algorithm

Authors: Abhishek Bhardwaj, Manish Kumar Bajpai

Abstract:

An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm.

Keywords: Reinhard et al’s algorithm, color transferring, parallelism, speedup

Procedia PDF Downloads 583
6867 A Filtering Algorithm for a Nonlinear State-Space Model

Authors: Abdullah Eqal Al Mazrooei

Abstract:

Kalman filter is a famous algorithm that utilizes to estimate the state in the linear systems. It has numerous applications in technology and science. Since of the most of applications in real life can be described by nonlinear systems. So, Kalman filter does not work with the nonlinear systems because it is suitable to linear systems only. In this work, a nonlinear filtering algorithm is presented which is suitable to use with the special kinds of nonlinear systems. This filter generalizes the Kalman filter. This means that this filter also can be used for the linear systems. Our algorithm depends on a special linearization of the second degree. We introduced the nonlinear algorithm with a bilinear state-space model. A simulation example is presented to illustrate the efficiency of the algorithm.

Keywords: Kalman filter, filtering algorithm, nonlinear systems, state-space model

Procedia PDF Downloads 347
6866 Research on Knowledge Graph Inference Technology Based on Proximal Policy Optimization

Authors: Yihao Kuang, Bowen Ding

Abstract:

With the increasing scale and complexity of knowledge graph, modern knowledge graph contains more and more types of entity, relationship, and attribute information. Therefore, in recent years, it has been a trend for knowledge graph inference to use reinforcement learning to deal with large-scale, incomplete, and noisy knowledge graph and improve the inference effect and interpretability. The Proximal Policy Optimization (PPO) algorithm utilizes a near-end strategy optimization approach. This allows for more extensive updates of policy parameters while constraining the update extent to maintain training stability. This characteristic enables PPOs to converge to improve strategies more rapidly, often demonstrating enhanced performance early in the training process. Furthermore, PPO has the advantage of offline learning, effectively utilizing historical experience data for training and enhancing sample utilization. This means that even with limited resources, PPOs can efficiently train for reinforcement learning tasks. Based on these characteristics, this paper aims to obtain better and more efficient inference effect by introducing PPO into knowledge inference technology.

Keywords: reinforcement learning, PPO, knowledge inference, supervised learning

Procedia PDF Downloads 34
6865 Chemical Reaction Algorithm for Expectation Maximization Clustering

Authors: Li Ni, Pen ManMan, Li KenLi

Abstract:

Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, research has investigated the utility of evolutionary computing and related techniques in the regard. Chemical Reaction Optimization (CRO) is a recently established method. So the property embedded in CRO is used to solve optimization problems. This paper presents an algorithm framework (EM-CRO) with modified CRO operators based on EM cluster problems. The hybrid algorithm is mainly to solve the problem of initial value sensitivity of the objective function optimization clustering algorithm. Our experiments mainly take the EM classic algorithm:k-means and fuzzy k-means as an example, through the CRO algorithm to optimize its initial value, get K-means-CRO and FKM-CRO algorithm. The experimental results of them show that there is improved efficiency for solving objective function optimization clustering problems.

Keywords: chemical reaction optimization, expection maimization, initia, objective function clustering

Procedia PDF Downloads 682
6864 A Review of Research on Pre-training Technology for Natural Language Processing

Authors: Moquan Gong

Abstract:

In recent years, with the rapid development of deep learning, pre-training technology for natural language processing has made great progress. The early field of natural language processing has long used word vector methods such as Word2Vec to encode text. These word vector methods can also be regarded as static pre-training techniques. However, this context-free text representation brings very limited improvement to subsequent natural language processing tasks and cannot solve the problem of word polysemy. ELMo proposes a context-sensitive text representation method that can effectively handle polysemy problems. Since then, pre-training language models such as GPT and BERT have been proposed one after another. Among them, the BERT model has significantly improved its performance on many typical downstream tasks, greatly promoting the technological development in the field of natural language processing, and has since entered the field of natural language processing. The era of dynamic pre-training technology. Since then, a large number of pre-trained language models based on BERT and XLNet have continued to emerge, and pre-training technology has become an indispensable mainstream technology in the field of natural language processing. This article first gives an overview of pre-training technology and its development history, and introduces in detail the classic pre-training technology in the field of natural language processing, including early static pre-training technology and classic dynamic pre-training technology; and then briefly sorts out a series of enlightening technologies. Pre-training technology, including improved models based on BERT and XLNet; on this basis, analyze the problems faced by current pre-training technology research; finally, look forward to the future development trend of pre-training technology.

Keywords: natural language processing, pre-training, language model, word vectors

Procedia PDF Downloads 22
6863 An Improved Genetic Algorithm for Traveling Salesman Problem with Precedence Constraint

Authors: M. F. F. Ab Rashid, A. N. Mohd Rose, N. M. Z. Nik Mohamed, W. S. Wan Harun, S. A. Che Ghani

Abstract:

Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm.

Keywords: traveling salesman problem, sequencing, genetic algorithm, precedence constraint

Procedia PDF Downloads 534
6862 Improving the Deficiencies in Entrepreneurship Training for Small Businesses in Emerging Markets

Authors: Eno Jah Tabogo

Abstract:

The aim of this research is to identify and examine current deficiencies in entrepreneurial training in improving the performance of small businesses in sub Saharan Africa economies. This research achieves this by examining the course content, training methods, and profiles of trainers and trainees of small business service providers in Sub Saharan Africa (SSA) to identify training deficiencies in improving small businesses. Data was for the analysis was collected from a sample of four entrepreneurial training providers in SSA. These four providers served an average of 1,500 trainees. Questionnaire was used to collect data via face to face and through telephone. Face validity was determined by distributing the questionnaire among a group of colleagues, followed by a group discussion to strengthen the validity of the questionnaire. Interviews were also held with managers of training programs. Content and descriptive statistics was used to analyse the data collected. The results indicated only 25% of the training content were entrepreneurial. In terms of service provided, both business, entrepreneurial, technical and after-care services were identified. It was also discovered that owners of training firms had no formal entrepreneurship background. The paper contributes by advocating for a comprehensive entrepreneurship-training program for successful small business enterprises. Recommendations that could help sustain emerging small business enterprises and direction for further research are presented.

Keywords: entrepreneurship, emerging markets, small business, training

Procedia PDF Downloads 110
6861 Improved FP-Growth Algorithm with Multiple Minimum Supports Using Maximum Constraints

Authors: Elsayeda M. Elgaml, Dina M. Ibrahim, Elsayed A. Sallam

Abstract:

Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FP-growth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.

Keywords: association rules, FP-growth, multiple minimum supports, Weka tool

Procedia PDF Downloads 449
6860 Effects of Vertimax Training on Agility, Quickness and Acceleration

Authors: Dede Basturk, Metin Kaya, Halil Taskin, Nurtekin Erkmen

Abstract:

In total, 29 students studying in Selçuk University Physical Training and Sports School who are recreationally active participated voluntarilyin this study which was carried out in order to examine effects of Vertimax trainings on agility, quickness and acceleration. 3 groups took their parts in this study as Vertimax training group (N=10), Ordinary training group (N=10) and Control group (N=9). Measurements were carried out in performance laboratory of Selçuk University Physical Training and Sports School. A training program for quickness and agility was followed up for subjects 3 days a week (Monday, Wednesday, Friday) for 8 weeks. Subjects taking their parts in vertimax training group and ordinary training group participated in the training program for quickness and agility. Measurements were applied as pre-test and post-test. Subjects of vertimax training group followed the training program with vertimax device and subjects of ordinary training group followed the training program without vertimax device. As to control group who are recreationally active, they did not participate in any program. 4 gate photocells were used for measuring and measurement of distances was carried out in m. Furthermore, single gate photocell and honi were used for agility test. Measurements started with 15 minutes of warm-up. Acceleration, quickness and agility tests were applied on subjects. 3 measurements were made for each subject at 3 minutes resting intervals. The best rating of three measurements was recorded. 5 m quickness pre-test value of vertimax training groups has been determined as 1,11±0,06 s and post-test value has been determined as 1,06 ± 0,08 s (P<0,05). 5 m quickness pre-test value of ordinary training group has been determined as 1,11±0,06 s and post-test value has been determined as 1,07±0,07 s (P<0,05).5 m quickness pre-test value of control group has been determined as 1,13±0,08 s and post-test value has been determined as 1,10 ± 0,07 s (P>0,05). Upon examination of 10 m acceleration value before and after the training, 10 m acceleration pre-test value of vertimax training group has been determined as 1,82 ± 0,07 s and post-test value has been determined as 1,76±0,83 s (P>0,05). 10 m acceleration pre-test value of ordinary training group has been determined as 1,83±0,05 s and post-test value has been determined as 1,78 ± 0,08 s (P>0,05).10 m acceleration pre-test value of control group has been determined as 1,87±0,11 s and post-test value has been determined as 1,83 ± 0,09 s (P>0,05). Upon examination of 15 m acceleration value before and after the training, 15 m acceleration pre-test value of vertimax training group has been determined as 2,52±0,10 s and post-test value has been determined as 2,46 ± 0,11 s (P>0,05).15 m acceleration pre-test value of ordinary training group has been determined as 2,52±0,05 s and post-test value has been determined as 2,48 ± 0,06 s (P>0,05). 15 m acceleration pre-test value of control group has been determined as 2,55 ± 0,11 s and post-test value has been determined as 2,54 ± 0,08 s (P>0,05).Upon examination of agility performance before and after the training, agility pre-test value of vertimax training group has been determined as 9,50±0,47 s and post-test value has been determined as 9,66 ± 0,47 s (P>0,05). Agility pre-test value of ordinary training group has been determined as 9,99 ± 0,05 s and post-test value has been determined as 9,86 ± 0,40 s (P>0,05). Agility pre-test value of control group has been determined as 9,74 ± 0,45 s and post-test value has been determined as 9,92 ± 0,49 s (P>0,05). Consequently, it has been observed that quickness and acceleration features were developed significantly following 8 weeks of vertimax training program and agility features were not developed significantly. It is suggested that training practices used for the study may be used for situations which may require sudden moves and in order to attain the maximum speed in a short time. Nevertheless, it is also suggested that this training practice does not make contribution in development of moves which may require sudden direction changes. It is suggested that productiveness and innovation may come off in terms of training by using various practices of vertimax trainings.

Keywords: vertimax, training, quickness, agility, acceleration

Procedia PDF Downloads 463
6859 The Effect of Postural Sway and Technical Parameters of 8 Weeks Technical Training Performed with Restrict of Visual Input on the 10-12 Ages Soccer Players

Authors: Nurtekin Erkmen, Turgut Kaplan, Halil Taskin, Ahmet Sanioglu, Gokhan Ipekoglu

Abstract:

The aim of this study was to determine the effects of an 8 week soccerspecific technical training with limited vision perception on postural control and technical parameters in 10-12 aged soccer players. Subjects in this study were 24 male young soccer players (age: 11.00 ± 0.56 years, height: 150.5 ± 4.23 cm, body weight: 41.49 ± 7.56 kg). Subjects were randomly divided as two groups: Training and control. Balance performance was measured by Biodex Balance System (BBS). Short pass, speed dribbling, 20 m speed with ball, ball control, juggling tests were used to measure soccer players’ technical performances with a ball. Subjects performed soccer training 3 times per week for 8 weeks. In each session, training group with limited vision perception and control group with normal vision perception committed soccer-specific technical drills for 20 min. Data analyzed with t-test for independent samples and Mann-Whitney U between groups and paired t-test and Wilcoxon test between pre-posttests. No significant difference was found balance scores and with eyes open and eyes closed and LOS test between training and control groups after training (p>0.05). After eight week of training there are no significant difference in balance score with eyes open for both training and control groups (p>0.05). Balance scores decreased in training and control groups after the training (p<0.05). The completion time of LOS test shortened in both training and control groups after training (p<0.05). The training developed speed dribbling performance of training group (p<0.05). On the other hand, soccer players’ performance in training and control groups increased in 20 m speed with a ball after eight week training (p<0.05). In conclusion; the results of this study indicate that soccer-specific training with limited vision perception may not improves balance performance in 10-12 aged soccer players, but it develops speed dribbling performance.

Keywords: Young soccer players, vision perception, postural control, technical

Procedia PDF Downloads 447
6858 Using the Dokeos Platform for Industrial E-Learning Solution

Authors: Kherafa Abdennasser

Abstract:

The application of Information and Communication Technologies (ICT) to the training area led to the creation of this new reality called E-learning. That last one is described like the marriage of multi- media (sound, image and text) and of the internet (diffusion on line, interactivity). Distance learning became an important totality for training and that last pass in particular by the setup of a distance learning platform. In our memory, we will use an open source platform named Dokeos for the management of a distance training of GPS called e-GPS. The learner is followed in all his training. In this system, trainers and learners communicate individually or in group, the administrator setup and make sure of this system maintenance.

Keywords: ICT, E-learning, learning plate-forme, Dokeos, GPS

Procedia PDF Downloads 455
6857 Multi-Subpopulation Genetic Algorithm with Estimation of Distribution Algorithm for Textile Batch Dyeing Scheduling Problem

Authors: Nhat-To Huynh, Chen-Fu Chien

Abstract:

Textile batch dyeing scheduling problem is complicated which includes batch formation, batch assignment on machines, batch sequencing with sequence-dependent setup time. Most manufacturers schedule their orders manually that are time consuming and inefficient. More power methods are needed to improve the solution. Motivated by the real needs, this study aims to propose approaches in which genetic algorithm is developed with multi-subpopulation and hybridised with estimation of distribution algorithm to solve the constructed problem for minimising the makespan. A heuristic algorithm is designed and embedded into the proposed algorithms to improve the ability to get out of the local optima. In addition, an empirical study is conducted in a textile company in Taiwan to validate the proposed approaches. The results have showed that proposed approaches are more efficient than simulated annealing algorithm.

Keywords: estimation of distribution algorithm, genetic algorithm, multi-subpopulation, scheduling, textile dyeing

Procedia PDF Downloads 273
6856 The Impact of Training Method on Programming Learning Performance

Authors: Chechen Liao, Chin Yi Yang

Abstract:

Although several factors that affect learning to program have been identified over the years, there continues to be no indication of any consensus in understanding why some students learn to program easily and quickly while others have difficulty. Seldom have researchers considered the problem of how to help the students enhance the programming learning outcome. The research had been conducted at a high school in Taiwan. Students participating in the study consist of 330 tenth grade students enrolled in the Basic Computer Concepts course with the same instructor. Two types of training methods-instruction-oriented and exploration-oriented were conducted. The result of this research shows that the instruction-oriented training method has better learning performance than exploration-oriented training method.

Keywords: learning performance, programming learning, TDD, training method

Procedia PDF Downloads 392
6855 Serum Cortisol and Osteocalsin in Response to Eight Weeks Aerobic Training in Asthma Men with Mild to Moderate Intensity

Authors: Eizadi Mojtaba

Abstract:

This study aimed to evaluate the effect of 8 weeks aerobic training on serum osteocalsin as an osteoblasts hormone and cortisol in adult men with asthma. For this purpose, twenty four non-trained adult men with mild to moderate asthma were participated in study voluntarily and divided into exercise (aerobic training, 8 weeks/3 times per week) and control groups by randomly. Pre and post training of serum osteocalsin and cortisol were measured of two groups. Student’s paired ‘t’ test was applied to compare the pre and post training values. A p-value of less than 0.05 was considered to be statistically significant. There were no statistically significant differences with regard to all anthropometrical and biochemical markers between the exercise and control groups at baseline ( P > 0.05 ). Exercise training resulted in a significant increase in serum osteocalsin and decrease in cortisol ( P > 0.05 ), but not in control group. Based on these data, we concluded that aerobic training can be improved Processes of bone formation in asthma patients.

Keywords: osteoblasts, asthma, aerobic exercise, sedentary

Procedia PDF Downloads 267
6854 A Rapid Code Acquisition Scheme in OOC-Based CDMA Systems

Authors: Keunhong Chae, Seokho Yoon

Abstract:

We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.

Keywords: code acquisition, optical CDMA, optical orthogonal code, serial algorithm

Procedia PDF Downloads 503
6853 Simulation Tools for Training in the Case of Energy Sector Crisis

Authors: H. Malachova, A. Oulehlova, D. Rezac

Abstract:

Crisis preparedness training is the best possible strategy for identifying weak points, understanding vulnerability, and finding possible strategies for mitigation of blackout consequences. Training represents an effective tool for developing abilities and skills to cope with crisis situations. This article builds on the results of the research carried out in the field of preparation, realization, process, and impacts of training on subjects of energy sector critical infrastructure as a part of crisis preparedness. The research has revealed that the subjects of energy sector critical infrastructure have not realized training and therefore are not prepared for the restoration of the energy supply and black start after blackout regardless of the fact that most subjects state blackout and subsequent black start as key dangers. Training, together with mutual communication and processed crisis documentation, represent a basis for successful solutions for dealing with emergency situations. This text presents the suggested model of SIMEX simulator as a tool which supports managing crisis situations, containing training environment. Training models, possibilities of constructive simulation making use of non-aggregated as well as aggregated entities and tools of communication channels of individual simulator nodes have been introduced by the article.

Keywords: communication, energetic critical infrastructure, training, simulation

Procedia PDF Downloads 355
6852 The Effect of 8 Weeks Endurance Training and L-NAME on Apelin in Adipose Tissue, Glucose and Insulin in Elderly Male's Rats

Authors: Asieh Abbassi Daloii, Fatemeh Fani, Ahmad Abdi

Abstract:

Objective: The aim of this study was to determine the effect of 8 weeks endurance training and L-NAME on apelin in adipose tissue, glucose and insulin in elderly male’s rats. Methods: For this purpose, 24 vistar elderly rats with average 20 months old purchased from Razi Institute and transferred to Research Center were randomly divided into four groups: 1. control, 2. training, 3.training and L-NAME and 4. L-NAME. Training protocol performed for 8 weeks and 5 days a week with 75-80 VO2 max. All rats were killed 72 hours after the final training session and after 24 hours of fasting adipose tissue samples were collected and kept in -80. Also, Data was analyzed with One way ANOVA and Tucky in p < 0/05. Results: The results showed that the inhibition of nitric oxide on apelin in adipose tissue of adult male rats after eight weeks of endurance training increased significantly compared to the control group (p < 0.00). Also, the results showed no significant difference between the levels of insulin and glucose groups. Conclusion: It is likely that the increased apelin in adipose tissue in mice independent of insulin and glucose.

Keywords: endurance training, L-NAME, apelin in adipose tissue, elderly male rats

Procedia PDF Downloads 433
6851 Efficient Heuristic Algorithm to Speed Up Graphcut in Gpu for Image Stitching

Authors: Tai Nguyen, Minh Bui, Huong Ninh, Tu Nguyen, Hai Tran

Abstract:

GraphCut algorithm has been widely utilized to solve various types of computer vision problems. Its expensive computational cost encouraged many researchers to improve the speed of the algorithm. Recent works proposed schemes that work on parallel computing platforms such as CUDA. However, the problem of low convergence speed prevents the usage of GraphCut for real time applications. In this paper, we propose global suppression heuristic to boost the conver-gence process of the algorithm. A parallel implementation of GraphCut algorithm on CUDA designed for the image stitching problem is introduced. Our method achieves up to 3× time boost on the graph of size 80 × 480 compared to the best sequential GraphCut algorithm while achieving satisfactory stitched images, suitable for panorama applications. Our source code will be soon available for further research.

Keywords: CUDA, graph cut, image stitching, texture synthesis, maxflow/mincut algorithm

Procedia PDF Downloads 95