Pub Date : 2020-12-14DOI: 10.15625/1813-9663/36/4/15317
Tran Vinh Duc
We investigate the problem to characterize whether the infinite product of a given language L is generated by an ω-code. Up to now, this problem is open even if language L is a finite language. In this work, we consider a class of languages named ω-set decipherable languages which are very close to the ω-codes. We solve the problem in the restricted case where L is ω-set decipherable and L∗ is the greatest generator of Lω.
{"title":"SET DECIPHERABLE LANGUAGES AND GENERATORS","authors":"Tran Vinh Duc","doi":"10.15625/1813-9663/36/4/15317","DOIUrl":"https://doi.org/10.15625/1813-9663/36/4/15317","url":null,"abstract":"We investigate the problem to characterize whether the infinite product of a given language L is generated by an ω-code. Up to now, this problem is open even if language L is a finite language. In this work, we consider a class of languages named ω-set decipherable languages which are very close to the ω-codes. We solve the problem in the restricted case where L is ω-set decipherable and L∗ is the greatest generator of Lω.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"45 1","pages":"381-392"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85368782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.15625/1813-9663/36/4/15105
Nguyen Hoang Vu, T. Cuong, Tran Thanh Phong
Dictionary learning (DL) for sparse coding has been widely applied in the field of computer vision. Many DL approaches have been developed recently to solve pattern classification problems and have achieved promising performance. In this paper, to improve the discriminability of the popular dictionary pair learning (DPL) algorithm, we propose a new method called discriminative dictionary pair learning (DDPL) for image classification. To achieve the goal of signal representation and discrimination, we impose the incoherence constraints on the synthesis dictionary and the lowrank regularization on the analysis dictionary. The DDPL method ensures that the learned dictionary has a powerful discriminative ability and signals are more separable after coding. We evaluate the proposed method on benchmark image databases in comparison with existing DL methods. The experimental results demonstrate that our method outperforms many recently proposed dictionary learning approaches.
{"title":"DISCRIMINATIVE DICTIONARY PAIR LEARNING FOR IMAGE CLASSIFICATION","authors":"Nguyen Hoang Vu, T. Cuong, Tran Thanh Phong","doi":"10.15625/1813-9663/36/4/15105","DOIUrl":"https://doi.org/10.15625/1813-9663/36/4/15105","url":null,"abstract":"Dictionary learning (DL) for sparse coding has been widely applied in the field of computer vision. Many DL approaches have been developed recently to solve pattern classification problems and have achieved promising performance. In this paper, to improve the discriminability of the popular dictionary pair learning (DPL) algorithm, we propose a new method called discriminative dictionary pair learning (DDPL) for image classification. To achieve the goal of signal representation and discrimination, we impose the incoherence constraints on the synthesis dictionary and the lowrank regularization on the analysis dictionary. The DDPL method ensures that the learned dictionary has a powerful discriminative ability and signals are more separable after coding. We evaluate the proposed method on benchmark image databases in comparison with existing DL methods. The experimental results demonstrate that our method outperforms many recently proposed dictionary learning approaches.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"100 5 Pt 1 1","pages":"347-363"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74635773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.15625/1813-9663/36/4/14829
Q. Nguyen, Ly Vu, Quang-Uy Nguyen
Sentiment classification (SC) aims to determine whether a document conveys a positive or negative opinion. Due to the rapid development of the digital world, SC has become an important research topic that affects to many aspects of our life. In SC based on machine learning, the representation of the document strongly influences on its accuracy. Word embedding (WE)-based techniques, i.e., Word2vec techniques, are proved to be beneficial techniques to the SC problem. However, Word2vec is often not enough to represent the semantic of Vietnamese documents due to the complexity of semantics and syntactic structure. In this paper, we propose a new representation learning model called a two-channel vector to learn a higher-level feature of a document for SC. Our model uses two neural networks to learn both the semantic feature and the syntactic feature. The semantic feature is learnt using Word2vec and the syntactic feature is learnt through Parts of Speech tag (POS). Two features are then combined and input to a Softmax function to make the final classification. We carry out intensive experiments on 4 recent Vietnamese sentiment datasets to evaluate the performance of the proposed architecture. The experimental results demonstrate that the proposed model can enhance the accuracy of SC problems compared to two single models and three state-of-the-art ensemble methods.
{"title":"A TWO-CHANNEL MODEL FOR REPRESENTATION LEARNING IN VIETNAMESE SENTIMENT CLASSIFICATION PROBLEM","authors":"Q. Nguyen, Ly Vu, Quang-Uy Nguyen","doi":"10.15625/1813-9663/36/4/14829","DOIUrl":"https://doi.org/10.15625/1813-9663/36/4/14829","url":null,"abstract":"Sentiment classification (SC) aims to determine whether a document conveys a positive or negative opinion. Due to the rapid development of the digital world, SC has become an important research topic that affects to many aspects of our life. In SC based on machine learning, the representation of the document strongly influences on its accuracy. Word embedding (WE)-based techniques, i.e., Word2vec techniques, are proved to be beneficial techniques to the SC problem. However, Word2vec is often not enough to represent the semantic of Vietnamese documents due to the complexity of semantics and syntactic structure. In this paper, we propose a new representation learning model called a two-channel vector to learn a higher-level feature of a document for SC. Our model uses two neural networks to learn both the semantic feature and the syntactic feature. The semantic feature is learnt using Word2vec and the syntactic feature is learnt through Parts of Speech tag (POS). Two features are then combined and input to a Softmax function to make the final classification. We carry out intensive experiments on 4 recent Vietnamese sentiment datasets to evaluate the performance of the proposed architecture. The experimental results demonstrate that the proposed model can enhance the accuracy of SC problems compared to two single models and three state-of-the-art ensemble methods.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"5 1","pages":"305-323"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89018307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.15625/1813-9663/36/4/15555
Q. A. Dang, M. T. Hoang, D. H. Tran
A computer virus propagation model with feedback controls is first proposed and investigated. We show that the control variables do not influence on the global stability of the original differential model, they only alter the position of the unique viral equilibrium. The mathematical analyses and numerical simulations show that this equilibrium can be completely eliminated, namely, moved to the origin of coordinates if suitable values of the control variables are chosen. In the other words, the control variables are effective in the prevention of viruses in computer systems. Some numerical simulations are presented to demonstrate the validity of the obtained theoretical results.
{"title":"GLOBAL DYNAMICS OF A COMPUTER VIRUS PROPAGATION MODEL WITH FEEDBACK CONTROLS","authors":"Q. A. Dang, M. T. Hoang, D. H. Tran","doi":"10.15625/1813-9663/36/4/15555","DOIUrl":"https://doi.org/10.15625/1813-9663/36/4/15555","url":null,"abstract":"A computer virus propagation model with feedback controls is first proposed and investigated. We show that the control variables do not influence on the global stability of the original differential model, they only alter the position of the unique viral equilibrium. The mathematical analyses and numerical simulations show that this equilibrium can be completely eliminated, namely, moved to the origin of coordinates if suitable values of the control variables are chosen. In the other words, the control variables are effective in the prevention of viruses in computer systems. Some numerical simulations are presented to demonstrate the validity of the obtained theoretical results.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"1 1","pages":"295-304"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83238948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.15625/1813-9663/36/4/14650
Tran Thi Thanh Huyen, Le Ba Dung, Nguyen Do Van, Mai Van Dinh
Rough membership functions in covering approximation space not only give numerical characterizations of covering-based rough set approximations, but also establish the relationship between covering-based rough sets and fuzzy covering-based rough sets. In this paper, we introduce a new method to update the approximation sets with rough membership functions in covering approximation space. Firstly, we present the third types of rough membership functions and study their properties. And then, we consider the change of them while simultaneously adding and removing objects in the information system. Based on that change, we propose a method for updating the approximation sets when the objects vary over time.
{"title":"INCREMENTALLY UPDATING APPROXIMATION IN INCOMPLETE INFORMATION SYSTEMS UNDER THE VARIATION OF OBJECTS","authors":"Tran Thi Thanh Huyen, Le Ba Dung, Nguyen Do Van, Mai Van Dinh","doi":"10.15625/1813-9663/36/4/14650","DOIUrl":"https://doi.org/10.15625/1813-9663/36/4/14650","url":null,"abstract":"Rough membership functions in covering approximation space not only give numerical characterizations of covering-based rough set approximations, but also establish the relationship between covering-based rough sets and fuzzy covering-based rough sets. In this paper, we introduce a new method to update the approximation sets with rough membership functions in covering approximation space. Firstly, we present the third types of rough membership functions and study their properties. And then, we consider the change of them while simultaneously adding and removing objects in the information system. Based on that change, we propose a method for updating the approximation sets when the objects vary over time.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90295966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-18DOI: 10.15625/1813-9663/36/3/14349
Nguyễn Tiến Duy, Vu Duc Vuong
In recent years, the application of hedge algebras in the field of control has been studied. The results show that this approach has many advantages. In addition, industrial robots are being well-developed and extensively used, especially in the industrial revolution 4.0. Accurate control of industrial robots is a class of problems that many scientists are interested in. In this paper, we design a controller based on hedge algebras for serial robots. The control rule is given by the linguistic rule-based system. The goal is to accurately control the moving robot arm which adheres given trajectories. Optimization of fuzzy parameters for the controller is done by genetic algorithms. The system has been simulated on the Matlab-Simulink software. The simulation results show that the tracking error is very small. Moreover, the controller worked well with correct control quality. This result once presents the simplicity and efficiency of the hedge algebras approach to control.
{"title":"DESIGNING HEDGE ALGEBRAIC CONTROLLER AND OPTIMIZING BY GENETIC ALGORITHM FOR SERIAL ROBOTS ADHERING TRAJECTORIES","authors":"Nguyễn Tiến Duy, Vu Duc Vuong","doi":"10.15625/1813-9663/36/3/14349","DOIUrl":"https://doi.org/10.15625/1813-9663/36/3/14349","url":null,"abstract":"In recent years, the application of hedge algebras in the field of control has been studied. The results show that this approach has many advantages. In addition, industrial robots are being well-developed and extensively used, especially in the industrial revolution 4.0. Accurate control of industrial robots is a class of problems that many scientists are interested in. In this paper, we design a controller based on hedge algebras for serial robots. The control rule is given by the linguistic rule-based system. The goal is to accurately control the moving robot arm which adheres given trajectories. Optimization of fuzzy parameters for the controller is done by genetic algorithms. The system has been simulated on the Matlab-Simulink software. The simulation results show that the tracking error is very small. Moreover, the controller worked well with correct control quality. This result once presents the simplicity and efficiency of the hedge algebras approach to control.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"37 1","pages":"265-283"},"PeriodicalIF":0.0,"publicationDate":"2020-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88514782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-18DOI: 10.15625/1813-9663/36/3/13940
Le Huu Binh, V. T. Tu, Nguyen Van Tam
In research topics to improve the performance of the mobile ad hoc networks (MANET), the load balancing routing has attracted many research groups because it is an effective solution to reduce traffic congestion. However, to balance the traffic load, the routing algorithm often has to choose some long routes. These routes pass through many hops and intermediate nodes, so the accumulated noise along with the route increases. As a result, the quality of transmission (QoT) of data transmission routes decreases, especially in the case of MANET using the relay type of amplifyand-forward (AF), where the noise power can be amplified at intermediate nodes. Therefore, it is necessary to study the QoT aware load balancing routing algorithms. In this paper, we focus on investigating the QoT in the MANET using AF and propose a load balancing routing algorithm under the constraint of the QoT. The proposed algorithm is improved from the new route discovery algorithm of the on-demand routing protocol. Our idea is to combine the operation of the route request and reply packets to collect the information of the traffic load and QoT from source to destination, used for the objective and the constraints of selecting a new route. Our evaluation by simulation method has shown that the proposed algorithm can improve the network performance in terms of the QoT, packet loss probability, and network throughput compared with the original routing algorithms.
{"title":"QoT AWARE LOAD BALANCING ROUTING IN MANET USING RELAY TYPE OF AMPLIFY AND FORWARD BASED COOPERATIVE COMMUNICATIONS","authors":"Le Huu Binh, V. T. Tu, Nguyen Van Tam","doi":"10.15625/1813-9663/36/3/13940","DOIUrl":"https://doi.org/10.15625/1813-9663/36/3/13940","url":null,"abstract":"In research topics to improve the performance of the mobile ad hoc networks (MANET), the load balancing routing has attracted many research groups because it is an effective solution to reduce traffic congestion. However, to balance the traffic load, the routing algorithm often has to choose some long routes. These routes pass through many hops and intermediate nodes, so the accumulated noise along with the route increases. As a result, the quality of transmission (QoT) of data transmission routes decreases, especially in the case of MANET using the relay type of amplifyand-forward (AF), where the noise power can be amplified at intermediate nodes. Therefore, it is necessary to study the QoT aware load balancing routing algorithms. In this paper, we focus on investigating the QoT in the MANET using AF and propose a load balancing routing algorithm under the constraint of the QoT. The proposed algorithm is improved from the new route discovery algorithm of the on-demand routing protocol. Our idea is to combine the operation of the route request and reply packets to collect the information of the traffic load and QoT from source to destination, used for the objective and the constraints of selecting a new route. Our evaluation by simulation method has shown that the proposed algorithm can improve the network performance in terms of the QoT, packet loss probability, and network throughput compared with the original routing algorithms.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"24 1","pages":"251-263"},"PeriodicalIF":0.0,"publicationDate":"2020-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83118723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-18DOI: 10.15625/1813-9663/36/3/14987
Ngoc Pham Thi Dan, Khuong Ho Van, Hanh Dang Ngoc, Thiem Do Dac, Phong Nguyen Huu, Son Vo Que, Son Pham Ngoc, Lien Hong Pham
This paper investigates a cognitive radio network where a secondary sender assists a primary transmitter in relaying primary information to a primary receiver and also transmits its own information to a secondary recipient. This sender is capable of jamming to protect secondary and/or primary information against an eavesdropper and self-powering by harvesting radio frequency energy of primary signals. Security capability of both secondary and primary networks are analyzed in terms of secrecy outage probability. Numerous results corroborate the proposed analysis which serves as a design guideline to quickly assess and optimize security performance. More importantly, security capability trade-off between secondary and primary networks can be totally controlled with appropriate selection of system parameters.
{"title":"SECURITY CAPABILITY ANALYSIS OF COGNITIVE RADIO NETWORK WITH SECONDARY USER CAPABLE OF JAMMING AND SELF-POWERING","authors":"Ngoc Pham Thi Dan, Khuong Ho Van, Hanh Dang Ngoc, Thiem Do Dac, Phong Nguyen Huu, Son Vo Que, Son Pham Ngoc, Lien Hong Pham","doi":"10.15625/1813-9663/36/3/14987","DOIUrl":"https://doi.org/10.15625/1813-9663/36/3/14987","url":null,"abstract":"This paper investigates a cognitive radio network where a secondary sender assists a primary transmitter in relaying primary information to a primary receiver and also transmits its own information to a secondary recipient. This sender is capable of jamming to protect secondary and/or primary information against an eavesdropper and self-powering by harvesting radio frequency energy of primary signals. Security capability of both secondary and primary networks are analyzed in terms of secrecy outage probability. Numerous results corroborate the proposed analysis which serves as a design guideline to quickly assess and optimize security performance. More importantly, security capability trade-off between secondary and primary networks can be totally controlled with appropriate selection of system parameters.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"194 1","pages":"205-231"},"PeriodicalIF":0.0,"publicationDate":"2020-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82799901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-18DOI: 10.15625/1813-9663/36/3/14770
Ban Hà Bằng
The Multi-stripe Travelling Salesman Problem (Ms-TSP) is an extension of the Travelling Salesman Problem (TSP). In the textit{q}-stripe TSP with $q geq 1$, the objective function sums the costs for travelling from one customer to each of the next textit{q} customers along the tour. The resulting textit{q}-stripe TSP generalizes the TSP and forms a special case of the Quadratic Assignment Problem. To solve medium and large size instances, a metaheuristic algorithm is proposed. The proposed algorithm has two main components, which are construction and improvement phases. The construction phase generates a solution using Greedy Randomized Adaptive Search Procedure (GRASP) while the optimization phase improves the solution with several variants of Variable Neighborhood Search, both coupled with a technique called Shaking Technique to escape from local optima. In addition, Adaptive Memory is integrated into our algorithms to balance between the diversification and intensification. To show the efficiency of our proposed metaheuristic algorithms, we extensively experiment on benchmark instances. The results indicate that the developed algorithms can produce efficient and effective solutions at a reasonable computation time.
{"title":"EFFICIENT METAHEURISTIC ALGORITHMS FOR THE MULTI-STRIPE TRAVELLING SALESMAN PROBLEM","authors":"Ban Hà Bằng","doi":"10.15625/1813-9663/36/3/14770","DOIUrl":"https://doi.org/10.15625/1813-9663/36/3/14770","url":null,"abstract":"The Multi-stripe Travelling Salesman Problem (Ms-TSP) is an extension of the Travelling Salesman Problem (TSP). In the textit{q}-stripe TSP with $q geq 1$, the objective function sums the costs for travelling from one customer to each of the next textit{q} customers along the tour. The resulting textit{q}-stripe TSP generalizes the TSP and forms a special case of the Quadratic Assignment Problem. To solve medium and large size instances, a metaheuristic algorithm is proposed. The proposed algorithm has two main components, which are construction and improvement phases. The construction phase generates a solution using Greedy Randomized Adaptive Search Procedure (GRASP) while the optimization phase improves the solution with several variants of Variable Neighborhood Search, both coupled with a technique called Shaking Technique to escape from local optima. In addition, Adaptive Memory is integrated into our algorithms to balance between the diversification and intensification. To show the efficiency of our proposed metaheuristic algorithms, we extensively experiment on benchmark instances. The results indicate that the developed algorithms can produce efficient and effective solutions at a reasonable computation time.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"22 1","pages":"233-250"},"PeriodicalIF":0.0,"publicationDate":"2020-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85566051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-18DOI: 10.15625/1813-9663/36/3/14968
N. Mai, X. Duong
An algorithm for improving feeding rates of industrial welding robot TA 1400 of Panasonic with 6 degrees of freedom is presented. The kinematics and dynamics of the robot are calculated on MATLAB software. The proposed algorithm for improving feeding rates is mathematically analyzed and the performance of the system is evaluated in a simulation environment. The simulation results are used for proving the efficiency of the solution. Based on the achieved results, the algorithm can be applied for reducing time and improving the productivity of other industrial robots in the future.
{"title":"ALGORITHM FOR IMPROVING FEEDING RATES OF INDUSTRIAL WELDING ROBOT TA 1400 IN COMBINATION WITH A TURNTABLE FRAME","authors":"N. Mai, X. Duong","doi":"10.15625/1813-9663/36/3/14968","DOIUrl":"https://doi.org/10.15625/1813-9663/36/3/14968","url":null,"abstract":"An algorithm for improving feeding rates of industrial welding robot TA 1400 of Panasonic with 6 degrees of freedom is presented. The kinematics and dynamics of the robot are calculated on MATLAB software. The proposed algorithm for improving feeding rates is mathematically analyzed and the performance of the system is evaluated in a simulation environment. The simulation results are used for proving the efficiency of the solution. Based on the achieved results, the algorithm can be applied for reducing time and improving the productivity of other industrial robots in the future.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"32 1","pages":"285-294"},"PeriodicalIF":0.0,"publicationDate":"2020-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90481542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：