Pub Date : 2017-12-01DOI: 10.1109/PDCAT.2017.00035
Fu-Shiung Hsieh
Reconfigurable Manufacturing Systems (RMS) is a paradigm to flexibly deal with frequent changing demand and technologies. With the advancement of technology and more and more sensors and machines are connected, the world quickly enter the era of Internet of Things (IoT), which provides infrastructure for RMS. However existing studies lack a formalism that provides a framework for the development of RMS, from modeling, design to implementation. In particular, an important issue is design of dynamic process planner for RMS. This paper focuses on the development of a dynamic process planning method for the development of RMS. Modeling and managing RMS in manufacturing sector are challenging issues due to the complex workflows in the system. Recent progress in artificial intelligence and bio-inspired optimization technology provides a solid background to develop a framework to provide dynamic process planning for RMS in IoT-enabled manufacturing environment. In this paper, we propose a process planning method based on multi-agent systems (MAS) using Petri Nets to specify the workflows and capabilities of resources in the system and develop a solution algorithm based on a meta-heuristic method to solve the process planning problem based on discrete Particle swarm optimization (DPSO) approach The proposed method is illustrated by a several examples.
{"title":"A Meta-Heuristic Approach for Dynamic Process Planning in Reconfigurable Manufacturing Systems","authors":"Fu-Shiung Hsieh","doi":"10.1109/PDCAT.2017.00035","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00035","url":null,"abstract":"Reconfigurable Manufacturing Systems (RMS) is a paradigm to flexibly deal with frequent changing demand and technologies. With the advancement of technology and more and more sensors and machines are connected, the world quickly enter the era of Internet of Things (IoT), which provides infrastructure for RMS. However existing studies lack a formalism that provides a framework for the development of RMS, from modeling, design to implementation. In particular, an important issue is design of dynamic process planner for RMS. This paper focuses on the development of a dynamic process planning method for the development of RMS. Modeling and managing RMS in manufacturing sector are challenging issues due to the complex workflows in the system. Recent progress in artificial intelligence and bio-inspired optimization technology provides a solid background to develop a framework to provide dynamic process planning for RMS in IoT-enabled manufacturing environment. In this paper, we propose a process planning method based on multi-agent systems (MAS) using Petri Nets to specify the workflows and capabilities of resources in the system and develop a solution algorithm based on a meta-heuristic method to solve the process planning problem based on discrete Particle swarm optimization (DPSO) approach The proposed method is illustrated by a several examples.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133022841","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00082
Khine Zar Thwe, Nu War
Audio feature extraction and classification are important tool for audio signal analysis in many applications, such as home care system, security surveillance, meeting room sounds and music classification and so on. This paper presents sound classification by combining of image processing and signal processing to classify the data accurately. Firstly, audio signal is converted into time-frequency representation same as texture image in image processing. And then local tetra pattern (LTrP) text feature is used to extract features from this image. Finally, audio signal is classified by using one-vs-one SVM classifiers. Evaluation is tested on ESC-10 dataset.
{"title":"Local Tetra Pattern Texture Features for Environmental Sound Event Classification","authors":"Khine Zar Thwe, Nu War","doi":"10.1109/PDCAT.2017.00082","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00082","url":null,"abstract":"Audio feature extraction and classification are important tool for audio signal analysis in many applications, such as home care system, security surveillance, meeting room sounds and music classification and so on. This paper presents sound classification by combining of image processing and signal processing to classify the data accurately. Firstly, audio signal is converted into time-frequency representation same as texture image in image processing. And then local tetra pattern (LTrP) text feature is used to extract features from this image. Finally, audio signal is classified by using one-vs-one SVM classifiers. Evaluation is tested on ESC-10 dataset.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133391802","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00029
Mounira Hmayda, R. Ejbali, M. Zaied
Automatic identification of television programs in the TV stream is an important task for operating archives and represent a principal source of multimedia information.. The goal of the proposed approach is to enable a better exploitation of this source of video by multimedia services (i.e., TV-On-Demand, catch-up TV), social community, and video-sharing pla forms (Vimeo, Youtube, Facebook…) This paper presents a new spatio-temporal approach to identify the programs in TV stream using deep learning in two main steps. A database for video of visual jingles is constructed for training. In the test we use same jingles program type in order to identify the various program types in the TV stream. The main idea of identification process consists in using the principal of auto-encoder. After presenting the proposed approach, the paper overviews the encouraging experimental results on several streams extracted from different channels and composed of several programs. Comparison experiments to similar works have been carried out on the TRECVID 2017 database. We show significant improvements to TV programs identification exceed 95 %.
{"title":"Program Classification in a Stream TV Using Deep Learning","authors":"Mounira Hmayda, R. Ejbali, M. Zaied","doi":"10.1109/PDCAT.2017.00029","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00029","url":null,"abstract":"Automatic identification of television programs in the TV stream is an important task for operating archives and represent a principal source of multimedia information.. The goal of the proposed approach is to enable a better exploitation of this source of video by multimedia services (i.e., TV-On-Demand, catch-up TV), social community, and video-sharing pla forms (Vimeo, Youtube, Facebook…) This paper presents a new spatio-temporal approach to identify the programs in TV stream using deep learning in two main steps. A database for video of visual jingles is constructed for training. In the test we use same jingles program type in order to identify the various program types in the TV stream. The main idea of identification process consists in using the principal of auto-encoder. After presenting the proposed approach, the paper overviews the encouraging experimental results on several streams extracted from different channels and composed of several programs. Comparison experiments to similar works have been carried out on the TRECVID 2017 database. We show significant improvements to TV programs identification exceed 95 %.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133548557","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00036
Yukai Huang, Chia-Ping Huang
when undergoing sickness, the human body sends out warning signals from different parts, especially the ones which are directly connected with outside world, such as fever, tonsillitis, and otitis media. Our topic is aimed to discover otitis media at home using plug-in otoscope to exhibit visual image from the inside and design a system following Depth-First Search Algorithm to analyze these images as real-time otitis media image interpretation for parents, clinics, and pediatrician.
{"title":"A Depth-First Search Algorithm Based Otoscope Application for Real-Time Otitis Media Image Interpretation","authors":"Yukai Huang, Chia-Ping Huang","doi":"10.1109/PDCAT.2017.00036","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00036","url":null,"abstract":"when undergoing sickness, the human body sends out warning signals from different parts, especially the ones which are directly connected with outside world, such as fever, tonsillitis, and otitis media. Our topic is aimed to discover otitis media at home using plug-in otoscope to exhibit visual image from the inside and design a system following Depth-First Search Algorithm to analyze these images as real-time otitis media image interpretation for parents, clinics, and pediatrician.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800799","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00048
Amik Singh, M. Miśra
Prediction of ribonucleic acid (RNA) secondary structure is one of the most important research areas in bioinformatics. The Zuker algorithm is one of the most popular methods of free energy minimization for RNA secondary structure prediction. We present a novel algorithm to optimize Zuker Algorithm on CUDA GPUs and achieve a speedup of ∼10x for certain viruses.
{"title":"Optimization of Zuker Algorithm on GPUs","authors":"Amik Singh, M. Miśra","doi":"10.1109/PDCAT.2017.00048","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00048","url":null,"abstract":"Prediction of ribonucleic acid (RNA) secondary structure is one of the most important research areas in bioinformatics. The Zuker algorithm is one of the most popular methods of free energy minimization for RNA secondary structure prediction. We present a novel algorithm to optimize Zuker Algorithm on CUDA GPUs and achieve a speedup of ∼10x for certain viruses.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125177488","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00076
Jing Wang, Wei Liu, Shuang Li
Agent collaboration is a fundamental part of multi-agent systems when an agent cannot accomplish a goal by itself. Such collaborations are usually regulated by commitment protocols, which are typically defined at design-time. However, in many situations a protocol may not exist or be predefined at design-time which may not fit the needs of the agents when environment changes. In order to deal with such situations, agents should be able to generate protocols at run-time. In this paper, we combined commitment with capability. Firstly, we proposed the capability matching method to generate commitment protocols dynamically at run-time. Secondly, we combined capability with commitment and extended its traditional definition. Thirdly, we compared the forms, generation time and execution time of typical and extended commitments. At last, we introduced the criteria of profit to select the optimal protocol. The application of our approach will be demonstrated in intelligent parking lot systems.
{"title":"Agent Collaboration in Intelligent Parking Lot Systems: Dynamic Generation of Commitment Protocol","authors":"Jing Wang, Wei Liu, Shuang Li","doi":"10.1109/PDCAT.2017.00076","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00076","url":null,"abstract":"Agent collaboration is a fundamental part of multi-agent systems when an agent cannot accomplish a goal by itself. Such collaborations are usually regulated by commitment protocols, which are typically defined at design-time. However, in many situations a protocol may not exist or be predefined at design-time which may not fit the needs of the agents when environment changes. In order to deal with such situations, agents should be able to generate protocols at run-time. In this paper, we combined commitment with capability. Firstly, we proposed the capability matching method to generate commitment protocols dynamically at run-time. Secondly, we combined capability with commitment and extended its traditional definition. Thirdly, we compared the forms, generation time and execution time of typical and extended commitments. At last, we introduced the criteria of profit to select the optimal protocol. The application of our approach will be demonstrated in intelligent parking lot systems.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"57 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122002448","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00037
Shumin Qiao, Binbin Zhang, Weiyi Liu
Different applications have different preferences for resource requirements. In virtualization environment, if multiple virtual machines hosted on the same server have the same resource requirement preference, performance can be greatly affected for the resource competition between virtual machines. In this paper, we propose an approach to use a feature weighting naive Bayes classifier with Laplacian correction model to classify the applications according to the characteristics of application accessing to CPU, memory, hard disk, and the L2 cache collected using profiling. Based on the application classification, the virtual machines running applications of different types can be deployed on the same physical host. The experiments show that this method can achieve high classification accuracy. And this methods avoid the performance bottleneck due to resource competition to a certain extent.
{"title":"Application Classification Based on Preference for Resource Requirements in Virtualization Environment","authors":"Shumin Qiao, Binbin Zhang, Weiyi Liu","doi":"10.1109/PDCAT.2017.00037","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00037","url":null,"abstract":"Different applications have different preferences for resource requirements. In virtualization environment, if multiple virtual machines hosted on the same server have the same resource requirement preference, performance can be greatly affected for the resource competition between virtual machines. In this paper, we propose an approach to use a feature weighting naive Bayes classifier with Laplacian correction model to classify the applications according to the characteristics of application accessing to CPU, memory, hard disk, and the L2 cache collected using profiling. Based on the application classification, the virtual machines running applications of different types can be deployed on the same physical host. The experiments show that this method can achieve high classification accuracy. And this methods avoid the performance bottleneck due to resource competition to a certain extent.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126944410","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00068
Zhansheng Chen, Hong Shen
Topology control based on appropriate cluster head election can drastically reduce energy consumption, balance traf?c load on sensor nodes and extends the lifetime of the network. In this paper, an ef?cient data gathering multihop routing approach based on ?xed-group for wireless sensor networks is proposed. Our proposed protocol, FGMRP (Fixed-Group based Multi-hop Routing Protocol), divides the monitoring area into several groups according to node intimacy, optimizes energy consumption among nodes in each group by performing adaptive cluster head round-robin rotations based on residual energy, concentration and centrality, and balances energy consumption among groups through a ?tness routing algorithm which considers node residual energy, forwarding distance and radial angle. Simulation results show that the FGMRP protocol effectively balances the energy consumption among nodes, achieves better monitoring performance and signi?cantly increases network lifetime as compared to the existing routing protocols, taking monitoring quality, the amount of data acquisition and network lifetime as evaluation indices.
{"title":"Efficient Data Gathering in Wireless Sensor Networks with Fixed-Group Method","authors":"Zhansheng Chen, Hong Shen","doi":"10.1109/PDCAT.2017.00068","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00068","url":null,"abstract":"Topology control based on appropriate cluster head election can drastically reduce energy consumption, balance traf?c load on sensor nodes and extends the lifetime of the network. In this paper, an ef?cient data gathering multihop routing approach based on ?xed-group for wireless sensor networks is proposed. Our proposed protocol, FGMRP (Fixed-Group based Multi-hop Routing Protocol), divides the monitoring area into several groups according to node intimacy, optimizes energy consumption among nodes in each group by performing adaptive cluster head round-robin rotations based on residual energy, concentration and centrality, and balances energy consumption among groups through a ?tness routing algorithm which considers node residual energy, forwarding distance and radial angle. Simulation results show that the FGMRP protocol effectively balances the energy consumption among nodes, achieves better monitoring performance and signi?cantly increases network lifetime as compared to the existing routing protocols, taking monitoring quality, the amount of data acquisition and network lifetime as evaluation indices.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115318965","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00046
Cai-xin Han
The development of regional economy benefits from transportation infrastructure upgrading. Take central China as the example, based on its railway passenger and freight volumes and turnover volumes, GDP and other macro-economic data, this paper uses co-integration analysis, the error correction model and Granger causal relation test to empirically study the internal relationship between these two kinds of indexes. Results show that GDP has long-term co-integration relationship with all these transportation indexes, and the elasticity coefficients of passenger volume, passenger and freight turnover volumes to GDP are 0.5959, 14.9931 and 1.9916 respectively, among which the passenger turnover volume has a significant effect on economic growth. The construction and operation of the eight vertical and eight horizontal high-speed railway network will definitely further boost the rapid development of regional economy.
{"title":"Research on the Relationship between Railway Network Development and Economic Growth in Central China","authors":"Cai-xin Han","doi":"10.1109/PDCAT.2017.00046","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00046","url":null,"abstract":"The development of regional economy benefits from transportation infrastructure upgrading. Take central China as the example, based on its railway passenger and freight volumes and turnover volumes, GDP and other macro-economic data, this paper uses co-integration analysis, the error correction model and Granger causal relation test to empirically study the internal relationship between these two kinds of indexes. Results show that GDP has long-term co-integration relationship with all these transportation indexes, and the elasticity coefficients of passenger volume, passenger and freight turnover volumes to GDP are 0.5959, 14.9931 and 1.9916 respectively, among which the passenger turnover volume has a significant effect on economic growth. The construction and operation of the eight vertical and eight horizontal high-speed railway network will definitely further boost the rapid development of regional economy.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129564562","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00066
He Sun, Hongliang Mao, Xiaomin Bai, Zhidong Chen, Kai Hu, Wei Yu
Digital Currency for Central Bank is becoming an important policy for country. CBDC (Central Bank Digital Currency) model should take advantages in the supervision, payment and consumption. Blockchain possesses the feature of de-centrality, tamper-resistant, and traceability. So this paper attempts to use the blockchain as the fundamental technology of CBDC. However, the challenges such as the protection for users privacy, supervision and transaction speed should be overcome. This paper proposes a CBDC model called MBDC which is based on the permission blockchain technology. The model makes use of the multi-blockchain architecture and ChainID to improve the models scalability and process payments more quickly. In this model, central bank and commercial banks and other agencies build and maintain the blockchain. On one hand, central bank could master the issuance of currency. On the other hand, relying on the user account address protocol, central bank could separate the users identity and transaction information. In this way, central bank could avoid double-spending issues and protect users privacy. In addition, the establishment of DC (Data Center) and layers of supervision provide strong supervision for the model. Finally, we also demonstrate, both theoretically and experimentally, the performance of model on the scalability and the speed of transaction execution etc.
{"title":"Multi-Blockchain Model for Central Bank Digital Currency","authors":"He Sun, Hongliang Mao, Xiaomin Bai, Zhidong Chen, Kai Hu, Wei Yu","doi":"10.1109/PDCAT.2017.00066","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00066","url":null,"abstract":"Digital Currency for Central Bank is becoming an important policy for country. CBDC (Central Bank Digital Currency) model should take advantages in the supervision, payment and consumption. Blockchain possesses the feature of de-centrality, tamper-resistant, and traceability. So this paper attempts to use the blockchain as the fundamental technology of CBDC. However, the challenges such as the protection for users privacy, supervision and transaction speed should be overcome. This paper proposes a CBDC model called MBDC which is based on the permission blockchain technology. The model makes use of the multi-blockchain architecture and ChainID to improve the models scalability and process payments more quickly. In this model, central bank and commercial banks and other agencies build and maintain the blockchain. On one hand, central bank could master the issuance of currency. On the other hand, relying on the user account address protocol, central bank could separate the users identity and transaction information. In this way, central bank could avoid double-spending issues and protect users privacy. In addition, the establishment of DC (Data Center) and layers of supervision provide strong supervision for the model. Finally, we also demonstrate, both theoretically and experimentally, the performance of model on the scalability and the speed of transaction execution etc.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126012630","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
扫码关注我们
求助内容：
应助结果提醒方式：