Pub Date : 2017-02-01DOI: 10.1109/CIACT.2017.7977304
Himani Singh, M. Bhusry
Social networking websites are the most active websites on the Internet and millions of people use them every day to engage and connect with other people. Twitter, Facebook, LinkedIn and Google Plus seems to be the most popular Social networking websites on the Internet. In this manner, recommendation policy is required which supply client with an adaptable help for organizing security settings in much easier way. Images are shared extensively now days on social sharing sites. Sharing takes place between friends and acquaintances on a daily basis. In this thesis, we are implementing an Adaptive Privacy Policy Prediction (A3P) system which will provide users a disturbance free privacy settings experience by automatically generating personalized policies.
{"title":"Privacy policy inference of multiple user-uploaded images on social context websites (Automated generation of privacy policy)","authors":"Himani Singh, M. Bhusry","doi":"10.1109/CIACT.2017.7977304","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977304","url":null,"abstract":"Social networking websites are the most active websites on the Internet and millions of people use them every day to engage and connect with other people. Twitter, Facebook, LinkedIn and Google Plus seems to be the most popular Social networking websites on the Internet. In this manner, recommendation policy is required which supply client with an adaptable help for organizing security settings in much easier way. Images are shared extensively now days on social sharing sites. Sharing takes place between friends and acquaintances on a daily basis. In this thesis, we are implementing an Adaptive Privacy Policy Prediction (A3P) system which will provide users a disturbance free privacy settings experience by automatically generating personalized policies.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207041","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-02-01DOI: 10.1109/CIACT.2017.7977286
Junru Chen
The aim of this research is to propose the method of license plate identification on Android platform and realized by using the open source visual library — OpenCV. First, introduce the process of license plate identification, then discuss the method of the realization of license plate location, license plate calibration, character segmentation and character identification. The identification of license plate is anti-interference, applicable to a variety of occasions and accuracy is relatively high according to the experiment results.
{"title":"Chinese license plate identification based on Android platform","authors":"Junru Chen","doi":"10.1109/CIACT.2017.7977286","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977286","url":null,"abstract":"The aim of this research is to propose the method of license plate identification on Android platform and realized by using the open source visual library — OpenCV. First, introduce the process of license plate identification, then discuss the method of the realization of license plate location, license plate calibration, character segmentation and character identification. The identification of license plate is anti-interference, applicable to a variety of occasions and accuracy is relatively high according to the experiment results.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121335562","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-02-01DOI: 10.1109/CIACT.2017.7977359
Anjali Arora, V. Niranjan
Adders are basic integral part of arithmetic circuits. The adders have been realized with two styles: fixed stage size and variable stage size. In this paper, fixed stage and variable stage carry skip adder configurations have been analyzed and then a new 16-bit high speed variable stage carry skip adder is proposed by modifying the existing structure. The proposed adder has seven stages where first and last stage are of 1 bit each, it keeps increasing steadily till the middle stage which is the bulkiest and hence is the nucleus stage. The delay and power consumption in the proposed adder is reduced by 61.75% and 8% respectively. The proposed adder is implemented and simulated using 90 nm CMOS technology in Cadence Virtuoso. It is pertinent to mention that the delay improvement in the proposed adder has been achieved without increase in any power consumption and circuit complexity. The adder proposed in this work is suitable for high speed and low power VLSI based arithmetic circuits.
{"title":"A new 16-bit high speed and variable stage carry skip adder","authors":"Anjali Arora, V. Niranjan","doi":"10.1109/CIACT.2017.7977359","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977359","url":null,"abstract":"Adders are basic integral part of arithmetic circuits. The adders have been realized with two styles: fixed stage size and variable stage size. In this paper, fixed stage and variable stage carry skip adder configurations have been analyzed and then a new 16-bit high speed variable stage carry skip adder is proposed by modifying the existing structure. The proposed adder has seven stages where first and last stage are of 1 bit each, it keeps increasing steadily till the middle stage which is the bulkiest and hence is the nucleus stage. The delay and power consumption in the proposed adder is reduced by 61.75% and 8% respectively. The proposed adder is implemented and simulated using 90 nm CMOS technology in Cadence Virtuoso. It is pertinent to mention that the delay improvement in the proposed adder has been achieved without increase in any power consumption and circuit complexity. The adder proposed in this work is suitable for high speed and low power VLSI based arithmetic circuits.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124863649","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-02-01DOI: 10.1109/CIACT.2017.7977269
Harshul Garg, T. Choudhury, Praveen Kumar, S. Sabitha
Technology pertaining to Human Computer Interaction has seen vast leaps of advancements in recent years. And so, have the hardware using those technologies. But Despite all of these advancements, users are often left disappointed. The major cause of this disappointment is mostly either of lack of usability or lack of security or sometimes both of them. This paper discusses the problem of balance between usability and security as these two are the most significant challenges in the area of HCISec. Significance of both security and usability is discussed in this paper in order to find the more dominating aspect in the design of human computer interaction systems. Also, a case study on usability and security is presented on the iOS and Android operating systems to get a clear idea of the significance of both the factors. In the end, a conclusion is reached highlighting the importance of both usability and security.
{"title":"Comparison between significance of usability and security in HCI","authors":"Harshul Garg, T. Choudhury, Praveen Kumar, S. Sabitha","doi":"10.1109/CIACT.2017.7977269","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977269","url":null,"abstract":"Technology pertaining to Human Computer Interaction has seen vast leaps of advancements in recent years. And so, have the hardware using those technologies. But Despite all of these advancements, users are often left disappointed. The major cause of this disappointment is mostly either of lack of usability or lack of security or sometimes both of them. This paper discusses the problem of balance between usability and security as these two are the most significant challenges in the area of HCISec. Significance of both security and usability is discussed in this paper in order to find the more dominating aspect in the design of human computer interaction systems. Also, a case study on usability and security is presented on the iOS and Android operating systems to get a clear idea of the significance of both the factors. In the end, a conclusion is reached highlighting the importance of both usability and security.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"130 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124250524","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-02-01DOI: 10.1109/CIACT.2017.7977265
Rijwan Khan, Mohd Amjad, Akhilesh Kumar Srivastava
Software testing is one of the most important and expensive (in term of time and cost) phase of software development life cycle. Over the past few decades a lot of research has been done on automatic software testing process but due to dynamic memory allocation, software is very much unpredictable in behavior. Different Meta heuristic algorithms are applied for improving the efficiency of software testing process. Mutation testing is a one kind of the software testing in which some mutants are injected intently in the program/software and tester finds these mutants during testing process [4]. In this paper a Hybrid Genetic Algorithm is proposed for generating test data automatically using data flow testing approach for mutation testing.
{"title":"Generation of automatic test cases with mutation analysis and hybrid genetic algorithm","authors":"Rijwan Khan, Mohd Amjad, Akhilesh Kumar Srivastava","doi":"10.1109/CIACT.2017.7977265","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977265","url":null,"abstract":"Software testing is one of the most important and expensive (in term of time and cost) phase of software development life cycle. Over the past few decades a lot of research has been done on automatic software testing process but due to dynamic memory allocation, software is very much unpredictable in behavior. Different Meta heuristic algorithms are applied for improving the efficiency of software testing process. Mutation testing is a one kind of the software testing in which some mutants are injected intently in the program/software and tester finds these mutants during testing process [4]. In this paper a Hybrid Genetic Algorithm is proposed for generating test data automatically using data flow testing approach for mutation testing.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121169581","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-02-01DOI: 10.1109/CIACT.2017.7977287
Chuqiao Yu, Igor Bessmertny
The paper considers a problem of automatic processing of natural language Chinese texts. One of the pressing tasks in this area is automatic fact acquisition from text documents by a query because existing automatic translators are useless at this task. The goal of the work is direct extraction of facts from the text in the original language without its translation. The suggested approach consists of syntactic analysis of sentences with subsequent matching of parts of speech found with a formalized query in the form of subject-object-predicate. A distinctive feature of the proposed algorithm of syntactic analysis is the absence of phase of segmentation into words for the sequence of hieroglyphs that make up the sentences. The bottleneck at this task is a dictionary because the correct interpretation of a phrase can be impossible when a word is absent in the dictionary. To eliminate this problem, we propose to identify a sentence model by function words while limitedness of the dictionary could be compensated by an automatic building of a subject area thesaurus and a dictionary of common words using statistical processing of a document corpus. The suggested approach was approved on a small topic area with a limited dictionary where it demonstrates its robustness. The analysis of temporal characteristics of the developed algorithm was carried out as well. As the proposed algorithm uses a naive inference, the parsing speed at real tasks could be unacceptable low, and this should become a subject for further research.
{"title":"Shallow syntactic analysis of Chinese texts","authors":"Chuqiao Yu, Igor Bessmertny","doi":"10.1109/CIACT.2017.7977287","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977287","url":null,"abstract":"The paper considers a problem of automatic processing of natural language Chinese texts. One of the pressing tasks in this area is automatic fact acquisition from text documents by a query because existing automatic translators are useless at this task. The goal of the work is direct extraction of facts from the text in the original language without its translation. The suggested approach consists of syntactic analysis of sentences with subsequent matching of parts of speech found with a formalized query in the form of subject-object-predicate. A distinctive feature of the proposed algorithm of syntactic analysis is the absence of phase of segmentation into words for the sequence of hieroglyphs that make up the sentences. The bottleneck at this task is a dictionary because the correct interpretation of a phrase can be impossible when a word is absent in the dictionary. To eliminate this problem, we propose to identify a sentence model by function words while limitedness of the dictionary could be compensated by an automatic building of a subject area thesaurus and a dictionary of common words using statistical processing of a document corpus. The suggested approach was approved on a small topic area with a limited dictionary where it demonstrates its robustness. The analysis of temporal characteristics of the developed algorithm was carried out as well. As the proposed algorithm uses a naive inference, the parsing speed at real tasks could be unacceptable low, and this should become a subject for further research.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124479868","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-02-01DOI: 10.1109/CIACT.2017.7977382
Tinku Singh, D. Srivastava, A. Aggarwal
Multicore architecture of CPU is popular because of its performance; the challenge for the Multicore environment are-writing the effective code that can exploit the parallelism, measuring the performance in terms of CPU individual core utilization. The effective code using multithreading (parallel code) leads to performance speedup. Various multithreading applications are getting developed now days to utilize the CPU cores. In this paper, tools are developed, one by using C# console viz. application for measuring the performance of the CPU cores individually. Performance is measured in terms of load on each core in percentage. Second tool is designed using windows C# viz. application for plotting the graph with respect to time of CPU load in percentage. By both the tools performance is measured while quicksort is getting executed in the serial and parallel for a large number of data elements. Experiment is done on dual core and quad core CPU and results are stored in the table. Comparison graphs are drawn for running time of quicksort as well as CPU individual core utilization. The result shows parallel version of quicksort better utilize the CPU individual cores compared to its sequential version. It exploits more parallelism that leads the better CPU utilization.
{"title":"A novel approach for CPU utilization on a multicore paradigm using parallel quicksort","authors":"Tinku Singh, D. Srivastava, A. Aggarwal","doi":"10.1109/CIACT.2017.7977382","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977382","url":null,"abstract":"Multicore architecture of CPU is popular because of its performance; the challenge for the Multicore environment are-writing the effective code that can exploit the parallelism, measuring the performance in terms of CPU individual core utilization. The effective code using multithreading (parallel code) leads to performance speedup. Various multithreading applications are getting developed now days to utilize the CPU cores. In this paper, tools are developed, one by using C# console viz. application for measuring the performance of the CPU cores individually. Performance is measured in terms of load on each core in percentage. Second tool is designed using windows C# viz. application for plotting the graph with respect to time of CPU load in percentage. By both the tools performance is measured while quicksort is getting executed in the serial and parallel for a large number of data elements. Experiment is done on dual core and quad core CPU and results are stored in the table. Comparison graphs are drawn for running time of quicksort as well as CPU individual core utilization. The result shows parallel version of quicksort better utilize the CPU individual cores compared to its sequential version. It exploits more parallelism that leads the better CPU utilization.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"102 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126567801","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-02-01DOI: 10.1109/CIACT.2017.7977349
G. Gupta, W. Fritz
A comparison between the performance of the two control algorithms, Adaptive neuro-fuzzy inference system based on least mean square (ANFIS-LMS) and hyperbolic tangent function-based on least mean square (HTF-LMS) control algorithm for three-phase DSTATCOM (Distribution static compensator) is presented in this paper. A Shunt compensator consists of a three leg VSC (voltage source converter) and a zigzag transformer to eliminate the defects caused by the loads which are nonlinear in nature, in three-phase systems. The ANFIS-LMS-based control algorithm estimates reference supply currents by extracting fundamental components of active and reactive power and the hyperbolic function control algorithm based on LMS enhances the convergence rate with the noise suppression in the power systems. The DSTATCOM prototype is developed in real time and implementation is performed on DSP (Digital signal processor). Simulation is done in MATLAB environment, resulting in the HTF-LMS based control algorithm that is much faster than the ANFIS-LMS based algorithm with a more reduced static error rate.
{"title":"Control algorithms for a three-phase Shunt compensator — A comparative study","authors":"G. Gupta, W. Fritz","doi":"10.1109/CIACT.2017.7977349","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977349","url":null,"abstract":"A comparison between the performance of the two control algorithms, Adaptive neuro-fuzzy inference system based on least mean square (ANFIS-LMS) and hyperbolic tangent function-based on least mean square (HTF-LMS) control algorithm for three-phase DSTATCOM (Distribution static compensator) is presented in this paper. A Shunt compensator consists of a three leg VSC (voltage source converter) and a zigzag transformer to eliminate the defects caused by the loads which are nonlinear in nature, in three-phase systems. The ANFIS-LMS-based control algorithm estimates reference supply currents by extracting fundamental components of active and reactive power and the hyperbolic function control algorithm based on LMS enhances the convergence rate with the noise suppression in the power systems. The DSTATCOM prototype is developed in real time and implementation is performed on DSP (Digital signal processor). Simulation is done in MATLAB environment, resulting in the HTF-LMS based control algorithm that is much faster than the ANFIS-LMS based algorithm with a more reduced static error rate.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122240949","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-02-01DOI: 10.1109/CIACT.2017.7977385
Saurabh Sarkar, S. Solanki, Soubhik Chakraborty
The area of music information retrieval is very wide in general and Indian classical music in particular. Raga is the most significant aspect of Indian classical music which is further divided into Hindustani and Carnatic forms. One of the distinguishing features of the Hindustani classical music is the time of rendition of a raga. With contrasting opinions offered by musicians on the issue, with some being strict and others labeling it as purely imaginary, it is of interest to investigate whether there are any scientific aspects as to why the Hindustani ragas have been grouped for a particular time of rendition. This paper attempts to investigate audio features of different ragas which are rendered in morning, afternoon, evening and night.
{"title":"Time domain analysis of Indian classical raga rendition","authors":"Saurabh Sarkar, S. Solanki, Soubhik Chakraborty","doi":"10.1109/CIACT.2017.7977385","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977385","url":null,"abstract":"The area of music information retrieval is very wide in general and Indian classical music in particular. Raga is the most significant aspect of Indian classical music which is further divided into Hindustani and Carnatic forms. One of the distinguishing features of the Hindustani classical music is the time of rendition of a raga. With contrasting opinions offered by musicians on the issue, with some being strict and others labeling it as purely imaginary, it is of interest to investigate whether there are any scientific aspects as to why the Hindustani ragas have been grouped for a particular time of rendition. This paper attempts to investigate audio features of different ragas which are rendered in morning, afternoon, evening and night.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115882539","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-02-01DOI: 10.1109/CIACT.2017.7977273
Sanjana Saxena, P. Sharma
In the present research work a thorough analysis has been made to identify the curves traced by the joints of a higher pair chain mechanism having four linkages by using Freudestein's Equation. The four bar mechanism is taken into consideration The analysis of the curvature properties of the link lengths of a four-bar mechanism via Mathematical Modeling Techniques using MATLAB Software. The proper identification of the lengths which has been taken analytically using Freudenstein's equation, which is an experimental work as well as virtual visualization of the work & the model of a 4-bar linkage, whose modeling has been done through MATLAB software. The objective of kinematic analysis is to optimize the best possible value of the combination of the link lengths & input/output angles of a four bar mechanism, when the input motion is given. It establishes the relationship between the motions of various components of the linkage.
{"title":"An approach to the analysis of higher linkage mechanisms and its validation via MATLAB","authors":"Sanjana Saxena, P. Sharma","doi":"10.1109/CIACT.2017.7977273","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977273","url":null,"abstract":"In the present research work a thorough analysis has been made to identify the curves traced by the joints of a higher pair chain mechanism having four linkages by using Freudestein's Equation. The four bar mechanism is taken into consideration The analysis of the curvature properties of the link lengths of a four-bar mechanism via Mathematical Modeling Techniques using MATLAB Software. The proper identification of the lengths which has been taken analytically using Freudenstein's equation, which is an experimental work as well as virtual visualization of the work & the model of a 4-bar linkage, whose modeling has been done through MATLAB software. The objective of kinematic analysis is to optimize the best possible value of the combination of the link lengths & input/output angles of a four bar mechanism, when the input motion is given. It establishes the relationship between the motions of various components of the linkage.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132294498","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
扫码关注我们
求助内容：
应助结果提醒方式：