Pub Date : 2014-11-01DOI: 10.2991/ijndc.2014.2.4.6
Tianyu Bai, Spencer Davis, Juanjuan Li, Ying Gu, Hai Jiang
Lattice based cryptography is attractive for its quantum computing resistance and efficient encryption/decryption process. However, the Big Data issue has perplexed most lattice based cryptographic systems since the overall processing is slowed down too much. This paper intends to analyze one of the major lattice-based cryptographic systems, Nth-degree truncated polynomial ring (NTRU), and accelerate its execution with Graphic Processing Unit (GPU) for acceptable processing speed. Three strategies, including single GPU with zero copy, single GPU with data transfer, and multi-GPU versions are proposed for performance comparison. GPU computing techniques such as stream and zero copy are applied to overlap computations and communications for possible speedup. Experimental results have demonstrated the effectiveness of GPU acceleration of NTRU. As the number of involved devices increases, better NTRU performance will be achieved.
{"title":"Accelerating NTRU Encryption with Graphics Processing Units","authors":"Tianyu Bai, Spencer Davis, Juanjuan Li, Ying Gu, Hai Jiang","doi":"10.2991/ijndc.2014.2.4.6","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.4.6","url":null,"abstract":"Lattice based cryptography is attractive for its quantum computing resistance and efficient encryption/decryption process. However, the Big Data issue has perplexed most lattice based cryptographic systems since the overall processing is slowed down too much. This paper intends to analyze one of the major lattice-based cryptographic systems, Nth-degree truncated polynomial ring (NTRU), and accelerate its execution with Graphic Processing Unit (GPU) for acceptable processing speed. Three strategies, including single GPU with zero copy, single GPU with data transfer, and multi-GPU versions are proposed for performance comparison. GPU computing techniques such as stream and zero copy are applied to overlap computations and communications for possible speedup. Experimental results have demonstrated the effectiveness of GPU acceleration of NTRU. As the number of involved devices increases, better NTRU performance will be achieved.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126709395","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 : 2014-11-01DOI: 10.2991/ijndc.2014.2.4.2
Jie Zhu, Hai Jiang, Juanjuan Li, Erikson Hardesty, Kuan-Ching Li, Zhongwen Li
As the size of high performance applications increases, four major challenges including heterogeneity, programmability, fault resilience, and energy efficiency have arisen in the underlying distributed systems. To tackle with all of them without sacrificing performance, traditional approaches in resource utilization, task scheduling and programming paradigm should be reconsidered. While Hadoop has handled data-intensive applications well in Clouds, GPU has demonstrated its acceleration effectiveness for computation-intensive ones. This paper addresses the approaches for Hadoop to exploiting both CPU and GPU resources effectively to handle aforementioned challenges. Hadoop schedules MapReduce’s Map and Reduce functions across multiple different computing nodes through Java, whereas CUDA code helps accelerate local computations further on attached GPUs. All available heterogeneous computational power will be utilized. MapReduce in Hadoop eases the programming task by hiding communication and scheduling details. Hadoop Distributed File System will help achieve data-level fault resilience. GPU’s energy efficiency characteristics help reduce the power consumption of the whole system. To utilize GPU in Hadoop, four approaches including Jcuda, JNI, Hadoop Streaming, and Hadoop Pipes, have been accomplished and analyzed. Experimental results have demonstrated and compared their effectiveness.
{"title":"Embedding GPU Computations in Hadoop","authors":"Jie Zhu, Hai Jiang, Juanjuan Li, Erikson Hardesty, Kuan-Ching Li, Zhongwen Li","doi":"10.2991/ijndc.2014.2.4.2","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.4.2","url":null,"abstract":"As the size of high performance applications increases, four major challenges including heterogeneity, programmability, fault resilience, and energy efficiency have arisen in the underlying distributed systems. To tackle with all of them without sacrificing performance, traditional approaches in resource utilization, task scheduling and programming paradigm should be reconsidered. While Hadoop has handled data-intensive applications well in Clouds, GPU has demonstrated its acceleration effectiveness for computation-intensive ones. This paper addresses the approaches for Hadoop to exploiting both CPU and GPU resources effectively to handle aforementioned challenges. Hadoop schedules MapReduce’s Map and Reduce functions across multiple different computing nodes through Java, whereas CUDA code helps accelerate local computations further on attached GPUs. All available heterogeneous computational power will be utilized. MapReduce in Hadoop eases the programming task by hiding communication and scheduling details. Hadoop Distributed File System will help achieve data-level fault resilience. GPU’s energy efficiency characteristics help reduce the power consumption of the whole system. To utilize GPU in Hadoop, four approaches including Jcuda, JNI, Hadoop Streaming, and Hadoop Pipes, have been accomplished and analyzed. Experimental results have demonstrated and compared their effectiveness.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115346363","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 : 2014-08-01DOI: 10.2991/ijndc.2014.2.3.7
N. Kajtazovic, C. Preschern, Andrea Höller, Christian Kreiner
Component-based Software Engineering (CBSE) is currently a key paradigm used for developing safetycritical systems. It provides a fundamental means to master systems complexity, by allowing to design systems parts (i.e., components) for reuse and by allowing to develop those parts independently. One of the main challenges of introducing CBSE in this area is to ensure the integrity of the overall system after building it from individual components, since safety-critical systems require a rigorous development and qualification process to be released for the operation. Although the topic of compositional modelling and verification in the context of component-based systems has been studied intensively in the last decade, there is currently still a lack of tools and methods that can be applied practically and that consider major related systems quality attributes such as usability and scalability. In this paper, we present a novel approach for design-time modelling and verification of safety-critical systems, based on data semantics of components. We describe the composition, i.e., the systems design, and the underlying properties of components as a Constraint Satisfaction Problem (CSP) and perform the verification by solving that problem. We show that CSP can be successfully applied for the verification of compositions for many types of properties. In our experimental setup we also show how the proposed verification scales with regard to the complexity of different system configurations.
{"title":"On Design-time Modelling and Verification of Safety-critical Component-based Systems","authors":"N. Kajtazovic, C. Preschern, Andrea Höller, Christian Kreiner","doi":"10.2991/ijndc.2014.2.3.7","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.3.7","url":null,"abstract":"Component-based Software Engineering (CBSE) is currently a key paradigm used for developing safetycritical systems. It provides a fundamental means to master systems complexity, by allowing to design systems parts (i.e., components) for reuse and by allowing to develop those parts independently. One of the main challenges of introducing CBSE in this area is to ensure the integrity of the overall system after building it from individual components, since safety-critical systems require a rigorous development and qualification process to be released for the operation. Although the topic of compositional modelling and verification in the context of component-based systems has been studied intensively in the last decade, there is currently still a lack of tools and methods that can be applied practically and that consider major related systems quality attributes such as usability and scalability. In this paper, we present a novel approach for design-time modelling and verification of safety-critical systems, based on data semantics of components. We describe the composition, i.e., the systems design, and the underlying properties of components as a Constraint Satisfaction Problem (CSP) and perform the verification by solving that problem. We show that CSP can be successfully applied for the verification of compositions for many types of properties. In our experimental setup we also show how the proposed verification scales with regard to the complexity of different system configurations.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124317252","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 : 2014-08-01DOI: 10.2991/ijndc.2014.2.3.4
L. McLauchlan, Soumya Saha, R. Challoo
Wireless Sensors Networks (WSNs) are utilized in many diverse applications ranging from security, environmental monitoring, landslide detection, patient monitoring, reconnaissance operations, structural health monitoring and smart buildings. Since in many applications the WSN nodes are randomly deployed, WSNs need to be able to arrange and self-organize. Nodes in WSNs generally possess low or limited power resources such as batteries. Energy utilization thus is an important design consideration for WSN deployment. There have been many energy aware protocols proposed in the literature to increase the longevity of the network. Recently, two novel Connected Dominating Set (CDS) based topology construction (TC) protocols- SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree), have been proposed which aim to balance the load among the nodes of the network and thus to reduce the probability of dying for a particular node. The SWST and EAST protocols aim to reduce the number of broken links that may have been caused by a single node becoming dead or comatose in the communication backbone of the network. In this paper, a comparative study of the SWST and EAST algorithms is conducted to evaluate the performance of the two algorithms. From the MATLAB simulations it was observed that the EAST protocol generally performs better than the SWST algorithms in delivering messages to the sink node.
{"title":"Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)","authors":"L. McLauchlan, Soumya Saha, R. Challoo","doi":"10.2991/ijndc.2014.2.3.4","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.3.4","url":null,"abstract":"Wireless Sensors Networks (WSNs) are utilized in many diverse applications ranging from security, environmental monitoring, landslide detection, patient monitoring, reconnaissance operations, structural health monitoring and smart buildings. Since in many applications the WSN nodes are randomly deployed, WSNs need to be able to arrange and self-organize. Nodes in WSNs generally possess low or limited power resources such as batteries. Energy utilization thus is an important design consideration for WSN deployment. There have been many energy aware protocols proposed in the literature to increase the longevity of the network. Recently, two novel Connected Dominating Set (CDS) based topology construction (TC) protocols- SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree), have been proposed which aim to balance the load among the nodes of the network and thus to reduce the probability of dying for a particular node. The SWST and EAST protocols aim to reduce the number of broken links that may have been caused by a single node becoming dead or comatose in the communication backbone of the network. In this paper, a comparative study of the SWST and EAST algorithms is conducted to evaluate the performance of the two algorithms. From the MATLAB simulations it was observed that the EAST protocol generally performs better than the SWST algorithms in delivering messages to the sink node.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116673216","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 : 2014-08-01DOI: 10.2991/ijndc.2014.2.3.5
M. Sadikin, M. Kyas
Due to its constrained nature, the use of smart RFID technology introduces tremendous security and privacy issues. This paper presents IMAKA-Tate: Identity protection, Mutual Authentication and Key Agreement using Tate pairing of Identity-based Encryption method. It is designed to tackle various challenges in the constrained nature of RFID applications by applying a light-weight cryptographic method with advanced-level 128 bit security protection. Thus, IMAKA-Tate protects the RFID system from various security and privacy threats (e.g. unauthorized tracking, cloning attack, etc.).
{"title":"Efficient Security and Privacy Protection for Emerging Smart RFID Communications","authors":"M. Sadikin, M. Kyas","doi":"10.2991/ijndc.2014.2.3.5","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.3.5","url":null,"abstract":"Due to its constrained nature, the use of smart RFID technology introduces tremendous security and privacy issues. This paper presents IMAKA-Tate: Identity protection, Mutual Authentication and Key Agreement using Tate pairing of Identity-based Encryption method. It is designed to tackle various challenges in the constrained nature of RFID applications by applying a light-weight cryptographic method with advanced-level 128 bit security protection. Thus, IMAKA-Tate protects the RFID system from various security and privacy threats (e.g. unauthorized tracking, cloning attack, etc.).","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133839609","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 : 2014-08-01DOI: 10.2991/ijndc.2014.2.3.3
Tahir Jameel, Mengxiang Lin
Image processing applications have played a vital role in modern life and they are required to be well tested due to their significance and human dependence on them. Testing of image processing application is difficult due to complex nature of images in terms of their generation and evaluation. The presented technique is first of its type to generate test images based on symbolic evaluation of program under test. The idea is based on the fact that, neighboring image operations are applied by selecting a segment of image pixels called a window, and iterated by sliding window over entire image. We imitate neighboring operations using symbolic values for the pixels rather than concrete values. The path constraint is extracted for each path in the program under test and solved for concrete solutions. Test images are generated based on solution of path constraints for each identified path. We have tested the proposed scheme on different programs and the results show that test images are successfully generated for each path to ensure the path coverage of the program under test and identifying infeasible paths.
{"title":"Test Image Generation using Segmental Symbolic Evaluation","authors":"Tahir Jameel, Mengxiang Lin","doi":"10.2991/ijndc.2014.2.3.3","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.3.3","url":null,"abstract":"Image processing applications have played a vital role in modern life and they are required to be well tested due to their significance and human dependence on them. Testing of image processing application is difficult due to complex nature of images in terms of their generation and evaluation. The presented technique is first of its type to generate test images based on symbolic evaluation of program under test. The idea is based on the fact that, neighboring image operations are applied by selecting a segment of image pixels called a window, and iterated by sliding window over entire image. We imitate neighboring operations using symbolic values for the pixels rather than concrete values. The path constraint is extracted for each path in the program under test and solved for concrete solutions. Test images are generated based on solution of path constraints for each identified path. We have tested the proposed scheme on different programs and the results show that test images are successfully generated for each path to ensure the path coverage of the program under test and identifying infeasible paths.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131127244","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 : 2014-08-01DOI: 10.2991/ijndc.2014.2.3.6
T. Kuremoto, T. Otani, S. Mabu, M. Obayashi, Kunikazu Kobayashi
In this paper, a novel self-organizing map (SOM) named “One-D-R-A-G-SOM” is proposed. It is a kind of one dimensional ring type growing SOM using asymmetric neighborhood function. As the topology of one dimensional ring type feature map is more suitable to increase or decrease the number of units, and the disorder of the map is available to be solved by the asymmetric neighborhood function, the proposed model gives priority of learning performance to the conventional two dimensional growing SOM. Additionally, One-D-R-A-G-SOM is introduced to a hand shape recognition and instruction learning system. Experiment results showed the effectiveness of the novel system comparing with systems using the conventional SOMs.
{"title":"One-D-R-A-G-SOM and its Application to a Hand Shape Instruction Learning System","authors":"T. Kuremoto, T. Otani, S. Mabu, M. Obayashi, Kunikazu Kobayashi","doi":"10.2991/ijndc.2014.2.3.6","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.3.6","url":null,"abstract":"In this paper, a novel self-organizing map (SOM) named “One-D-R-A-G-SOM” is proposed. It is a kind of one dimensional ring type growing SOM using asymmetric neighborhood function. As the topology of one dimensional ring type feature map is more suitable to increase or decrease the number of units, and the disorder of the map is available to be solved by the asymmetric neighborhood function, the proposed model gives priority of learning performance to the conventional two dimensional growing SOM. Additionally, One-D-R-A-G-SOM is introduced to a hand shape recognition and instruction learning system. Experiment results showed the effectiveness of the novel system comparing with systems using the conventional SOMs.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132018311","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 : 2014-08-01DOI: 10.2991/ijndc.2014.2.3.1
Jung-Yeon Jo
{"title":"Issues in Efficiency for Distributed and Networking Systems","authors":"Jung-Yeon Jo","doi":"10.2991/ijndc.2014.2.3.1","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.3.1","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157063","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 : 2014-08-01DOI: 10.2991/ijndc.2014.2.3.8
L. McLauchlan, Soumya Saha, C. Montiel, R. Challoo
As the cost for wireless sensors and wireless sensor networks (WSNs) have decreased, they have become more ubiquitous; they are increasingly being used in many applications such as security, structural monitoring and environmental monitoring. Many WSN applications employ a random sensor deployment to provide sensor coverage. The choice of the Topology Construction (TC) and Topology Maintenance (TM) protocols will affect WSN lifetime. In this paper, two new load balancing TC protocols, SWST (Simple Weighted Spanning Tree), EAST (Energy Aware Spanning Tree) as well as three well known TC protocols, Simple Tree, Random Nearest Neighbor Tree (Random NNT) and Euclidean Minimum Spanning Tree (Euclidian MST), are studied using MATLAB and TC protocols such as A3 (A tree), A3 Coverage, Connected Dominating Set under Rule K (CDS Rule K), Energy Efficient Connected Dominating Set (EECDS), Simple Tree and K Neighbor (KNeigh) Tree, are simulated using Atarraya. Comparisons are performed between many of the TC protocols.
{"title":"Comparative Study of Various Wireless Sensor Network (WSN) Topology Construction Protocols","authors":"L. McLauchlan, Soumya Saha, C. Montiel, R. Challoo","doi":"10.2991/ijndc.2014.2.3.8","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.3.8","url":null,"abstract":"As the cost for wireless sensors and wireless sensor networks (WSNs) have decreased, they have become more ubiquitous; they are increasingly being used in many applications such as security, structural monitoring and environmental monitoring. Many WSN applications employ a random sensor deployment to provide sensor coverage. The choice of the Topology Construction (TC) and Topology Maintenance (TM) protocols will affect WSN lifetime. In this paper, two new load balancing TC protocols, SWST (Simple Weighted Spanning Tree), EAST (Energy Aware Spanning Tree) as well as three well known TC protocols, Simple Tree, Random Nearest Neighbor Tree (Random NNT) and Euclidean Minimum Spanning Tree (Euclidian MST), are studied using MATLAB and TC protocols such as A3 (A tree), A3 Coverage, Connected Dominating Set under Rule K (CDS Rule K), Energy Efficient Connected Dominating Set (EECDS), Simple Tree and K Neighbor (KNeigh) Tree, are simulated using Atarraya. Comparisons are performed between many of the TC protocols.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129220944","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 : 2014-04-01DOI: 10.2991/ijndc.2014.2.2.5
Li-Bao An, Peiqing Yang, Hong Zhang, Ming-Ying Chen
In this paper, the parameter optimization problem for face-milling operations is studied. A multi-objective mathematical model is developed with the purpose to minimize the unit production cost and total machining time while maximize the profit rate. The unwanted material is removed by one finishing pass and at least one roughing passes depending on the total depth of cut. Maximum and minimum allowable cutting speeds, feed rates and depths of cut, as well as tool life, surface roughness, cutting force and cutting power consumption are constraints of the model. Optimal values of objective function and corresponding machining parameters are found by Genetic Algorithms. An example is presented to illustrate the model and solution method.
{"title":"Multi-Objective Optimization for Milling Operations using Genetic Algorithms under Various Constraints","authors":"Li-Bao An, Peiqing Yang, Hong Zhang, Ming-Ying Chen","doi":"10.2991/ijndc.2014.2.2.5","DOIUrl":"https://doi.org/10.2991/ijndc.2014.2.2.5","url":null,"abstract":"In this paper, the parameter optimization problem for face-milling operations is studied. A multi-objective mathematical model is developed with the purpose to minimize the unit production cost and total machining time while maximize the profit rate. The unwanted material is removed by one finishing pass and at least one roughing passes depending on the total depth of cut. Maximum and minimum allowable cutting speeds, feed rates and depths of cut, as well as tool life, surface roughness, cutting force and cutting power consumption are constraints of the model. Optimal values of objective function and corresponding machining parameters are found by Genetic Algorithms. An example is presented to illustrate the model and solution method.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116493979","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
扫码关注我们
求助内容：
应助结果提醒方式：