Pub Date : 2021-11-28DOI: 10.18535/ijecs/v10i11.4635
Surajit Medhi, H. Baruah
The main objective of this paper is to implement the classifications algorithms in Neo4j graph database using cypher query language. For implementing the classification algorithm, we have used Indian Premier League (IPL) dataset to predict the winner of the matches using some different features. The IPL is the most popular T20 cricket league in the world. The prediction models are based on the city where the matches were played, winner of the toss and decision of the toss. In this paper we have implemented Naïve Bayes and K-Nearest Neighbors (KNN) classification algorithms using cypher query language. Different classifiers are used to predict the outcome of different games like football, volleyball, cricket etc, using python and R. In this paper we shall use cypher query language. We shall also compare and analysis the results which are given by Naïve Bayes and K-Nearest Neighbors algorithms to predict the winner of the matches.
{"title":"Implementation of Classification Algorithms in Neo4j using IPL data","authors":"Surajit Medhi, H. Baruah","doi":"10.18535/ijecs/v10i11.4635","DOIUrl":"https://doi.org/10.18535/ijecs/v10i11.4635","url":null,"abstract":"The main objective of this paper is to implement the classifications algorithms in Neo4j graph database using cypher query language. For implementing the classification algorithm, we have used Indian Premier League (IPL) dataset to predict the winner of the matches using some different features. The IPL is the most popular T20 cricket league in the world. The prediction models are based on the city where the matches were played, winner of the toss and decision of the toss. In this paper we have implemented Naïve Bayes and K-Nearest Neighbors (KNN) classification algorithms using cypher query language. Different classifiers are used to predict the outcome of different games like football, volleyball, cricket etc, using python and R. In this paper we shall use cypher query language. We shall also compare and analysis the results which are given by Naïve Bayes and K-Nearest Neighbors algorithms to predict the winner of the matches.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"101 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120977502","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 : 2021-11-28DOI: 10.18535/ijecs/v10i11.4637
A. Q. Mohabuth, Bibi Neehad Nankoo
: Advancement in technology particularly the development of smart application has caused a paradigm shift in software development. Teams for developing software do not need to be physically present at all times. Members of development teams may be at remote sites but still communicate with each other. Technology has enabled the creation of virtual teams. While technology put at the disposal of software development teams a range of devices for supporting their communication interaction, members still face many challenges in terms of time difference, language barriers and cultural diversification. Ineffective communication among team members lead to delays in software development and contribute much to make project failures. The primary focus of this research is to identify how communication in virtual teams may become efficient. A survey is carried to assess the factors which affect communication in virtual teams. Different team sizes are considered and their relevance and differences in communication interaction are studied. More in-depth data are extracted for this research by interviewing potential members of virtual teams who work and interact from remote sites. The factors which influence communication interaction is finally established which help in successfully managing virtual team projects
{"title":"Towards the effectiveness of communication in adopting virtual team for software development","authors":"A. Q. Mohabuth, Bibi Neehad Nankoo","doi":"10.18535/ijecs/v10i11.4637","DOIUrl":"https://doi.org/10.18535/ijecs/v10i11.4637","url":null,"abstract":": Advancement in technology particularly the development of smart application has caused a paradigm shift in software development. Teams for developing software do not need to be physically present at all times. Members of development teams may be at remote sites but still communicate with each other. Technology has enabled the creation of virtual teams. While technology put at the disposal of software development teams a range of devices for supporting their communication interaction, members still face many challenges in terms of time difference, language barriers and cultural diversification. Ineffective communication among team members lead to delays in software development and contribute much to make project failures. The primary focus of this research is to identify how communication in virtual teams may become efficient. A survey is carried to assess the factors which affect communication in virtual teams. Different team sizes are considered and their relevance and differences in communication interaction are studied. More in-depth data are extracted for this research by interviewing potential members of virtual teams who work and interact from remote sites. The factors which influence communication interaction is finally established which help in successfully managing virtual team projects","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121571582","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 : 2021-11-21DOI: 10.18535/ijecs/v10i11.4636
S. Hadji
Modeling large-scale flood inundation requires weeks of calculations using complex fluid software. The state-of-the-art in operational hydraulic modeling does not currently allow flood real-time forecasting fields. Data driven models have small computational costs and fast computation times and may be useful to overcome this problem. In this paper, we propose a new modeling approach based on a coupled of Hydrodynamics finite element model and Multi-headed Deep convolutional neural network (MH-CNN) with rain precipitations as input to forecast rapidly the water depth reached in large floodplain with few hours-ahead. For this purpose, one first builds a database containing different simulations of the physical model according to several rain precipitation scenarios (historic and synthetic). The multi-headed convolutional neural network is then trained using the constructed database to predict water depths. The pre-trained model is applied successfully to simulate the real July 2014 flood inundation in an 870 km2 area of La Nive watershed in the south west of France. Because rain precipitation forecast data is more accessible than discharge one, this approach offers great potential for real-time flood modelling for ungauged large-scale territories, which represent a large part of floodplain in the world.
{"title":"A coupled models Hydrodynamics - Multi headed Deep convolutional neural network for rapid forecasting large-scale flood inundation","authors":"S. Hadji","doi":"10.18535/ijecs/v10i11.4636","DOIUrl":"https://doi.org/10.18535/ijecs/v10i11.4636","url":null,"abstract":"Modeling large-scale flood inundation requires weeks of calculations using complex fluid software. The state-of-the-art in operational hydraulic modeling does not currently allow flood real-time forecasting fields. Data driven models have small computational costs and fast computation times and may be useful to overcome this problem. In this paper, we propose a new modeling approach based on a coupled of Hydrodynamics finite element model and Multi-headed Deep convolutional neural network (MH-CNN) with rain precipitations as input to forecast rapidly the water depth reached in large floodplain with few hours-ahead. For this purpose, one first builds a database containing different simulations of the physical model according to several rain precipitation scenarios (historic and synthetic). The multi-headed convolutional neural network is then trained using the constructed database to predict water depths. The pre-trained model is applied successfully to simulate the real July 2014 flood inundation in an 870 km2 area of La Nive watershed in the south west of France. Because rain precipitation forecast data is more accessible than discharge one, this approach offers great potential for real-time flood modelling for ungauged large-scale territories, which represent a large part of floodplain in the world.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127933449","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 : 2021-11-12DOI: 10.18535/ijecs/v10i11.4631
Xinxin Li, Jiawen Wang
Video Repetition Counting is one of the important research areas in computer vision. It focuses on estimating the number of repeating actions. In this paper, we propose a method for video-based rope skipping repetition counting that combines the ResNet Model and a counting algorithm. Each frame in the given video is first classified into two categories: upward and downward, describing its current motion status. Then the classification sequence of the video is processed by a statistical counting algorithm to obtain the final repetition number. The experiments on real-world videos show the efficiency of our model.
{"title":"Video-Based Rope Skipping Repetition Counting with ResNet Model","authors":"Xinxin Li, Jiawen Wang","doi":"10.18535/ijecs/v10i11.4631","DOIUrl":"https://doi.org/10.18535/ijecs/v10i11.4631","url":null,"abstract":"Video Repetition Counting is one of the important research areas in computer vision. It focuses on estimating the number of repeating actions. In this paper, we propose a method for video-based rope skipping repetition counting that combines the ResNet Model and a counting algorithm. Each frame in the given video is first classified into two categories: upward and downward, describing its current motion status. Then the classification sequence of the video is processed by a statistical counting algorithm to obtain the final repetition number. The experiments on real-world videos show the efficiency of our model.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"451 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122733073","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 : 2021-10-31DOI: 10.18535/ijecs/v10i10.4630
Dr. Sivarama Prasad Kanakam
Computerized Currency is an electronic kind of cash. These days, everything is developing into digitization measure. This contains all properties like actual cash and furthermore permits prompt trades which will be reliably executed across the world while partner with upheld contraptions and organizations. In this paper we presented the SHA3-512 bit hashing algorithm and ECDSA algorithm for generation of digital signature. The Elliptic curve cryptography (ECC) is one of the greater promising technology on this area. ECC-enabled TLS is quicker and greater scalable on our servers and presents the equal or higher protection than the default cryptography in use at the web. one of the elliptic curve algorithm, the elliptic curve virtual signature algorithm (ECDSA), may be used to enhance overall performance at the Internet. CloudFlare now helps custom ECDSA certificate for our clients and that’s true for all people the use of the Internet.
{"title":"ECDSA: The Virtual Signature Set of Rules of a Higher Internet","authors":"Dr. Sivarama Prasad Kanakam","doi":"10.18535/ijecs/v10i10.4630","DOIUrl":"https://doi.org/10.18535/ijecs/v10i10.4630","url":null,"abstract":"Computerized Currency is an electronic kind of cash. These days, everything is developing into digitization measure. This contains all properties like actual cash and furthermore permits prompt trades which will be reliably executed across the world while partner with upheld contraptions and organizations. In this paper we presented the SHA3-512 bit hashing algorithm and ECDSA algorithm for generation of digital signature. The Elliptic curve cryptography (ECC) is one of the greater promising technology on this area. ECC-enabled TLS is quicker and greater scalable on our servers and presents the equal or higher protection than the default cryptography in use at the web. one of the elliptic curve algorithm, the elliptic curve virtual signature algorithm (ECDSA), may be used to enhance overall performance at the Internet. CloudFlare now helps custom ECDSA certificate for our clients and that’s true for all people the use of the Internet.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126024458","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}
In this paper, we shall be concerned with Kronecker product or Tensor product of matrices and develop their properties in a systematic way. The properties of the Kronecker product of matrices is used as a tool to establish existence and uniqueness of solutions to two-point boundary value problems associated with system of first order differential systems. A new approach is described to solve the Kronecker product linear systems and establish best least square solutions to the problem. Several interesting examples are given to highlight the importance of Kronecker product of matrices. We present adjoint boundary value problems and deduce a set of necessary and sufficient conditions for the Kronecker product boundary value problem to be self-adjoint.
{"title":"Kronecker Product of matrices and their applications to self-adjoint two-point boundary value problems associated with first order matrix differential systems","authors":"Sriram Bhagavatula, Dileep Durani Musa, Murty Kanuri","doi":"10.18535/ijecs/v10i10.4628","DOIUrl":"https://doi.org/10.18535/ijecs/v10i10.4628","url":null,"abstract":"In this paper, we shall be concerned with Kronecker product or Tensor product of matrices and develop their properties in a systematic way. The properties of the Kronecker product of matrices is used as a tool to establish existence and uniqueness of solutions to two-point boundary value problems associated with system of first order differential systems. A new approach is described to solve the Kronecker product linear systems and establish best least square solutions to the problem. Several interesting examples are given to highlight the importance of Kronecker product of matrices. We present adjoint boundary value problems and deduce a set of necessary and sufficient conditions for the Kronecker product boundary value problem to be self-adjoint.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122116768","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 : 2021-09-23DOI: 10.18535/IJECS/V10I9.4622
C. Desai
Deep learning models have demonstrated improved efficacy in image classification since the ImageNet Large Scale Visual Recognition Challenge started since 2010. Classification of images has further augmented in the field of computer vision with the dawn of transfer learning. To train a model on huge dataset demands huge computational resources and add a lot of cost to learning. Transfer learning allows to reduce on cost of learning and also help avoid reinventing the wheel. There are several pretrained models like VGG16, VGG19, ResNet50, Inceptionv3, EfficientNet etc which are widely used. This paper demonstrates image classification using pretrained deep neural network model VGG16 which is trained on images from ImageNet dataset. After obtaining the convolutional base model, a new deep neural network model is built on top of it for image classification based on fully connected network. This classifier will use features extracted from the convolutional base model.
{"title":"Image Classification Using Transfer Learning and Deep Learning","authors":"C. Desai","doi":"10.18535/IJECS/V10I9.4622","DOIUrl":"https://doi.org/10.18535/IJECS/V10I9.4622","url":null,"abstract":"Deep learning models have demonstrated improved efficacy in image classification since the ImageNet Large Scale Visual Recognition Challenge started since 2010. Classification of images has further augmented in the field of computer vision with the dawn of transfer learning. To train a model on huge dataset demands huge computational resources and add a lot of cost to learning. Transfer learning allows to reduce on cost of learning and also help avoid reinventing the wheel. There are several pretrained models like VGG16, VGG19, ResNet50, Inceptionv3, EfficientNet etc which are widely used. This paper demonstrates image classification using pretrained deep neural network model VGG16 which is trained on images from ImageNet dataset. After obtaining the convolutional base model, a new deep neural network model is built on top of it for image classification based on fully connected network. This classifier will use features extracted from the convolutional base model.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"78 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120848585","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 : 2021-08-24DOI: 10.18535/ijecs/v10i8.4615
Sun Feng, Li-bing Xia
With the rapid development of intelligent technology,People’s lives have gradually entered the era of information and intelligentce,Wearable devices are becoming more and more popular,it is easier to use sensors to obtain data,even physiological data,from human body.When large amounts of data are collected by sensors,we can analyze and model them.the values of each characteristic are used to judge the user’s state,then according to the state we can provide users with more accurate and convenient services. In this paper,the data collected by different sensors are used to establish a prediction model and analyze the comparative effect of different recognition algorithms on the test data. The results of the experiment shows that the Bayesian method based on WLD identities the state of the human body better.
{"title":"Research On human motion recognition algorithm based on WLD","authors":"Sun Feng, Li-bing Xia","doi":"10.18535/ijecs/v10i8.4615","DOIUrl":"https://doi.org/10.18535/ijecs/v10i8.4615","url":null,"abstract":"With the rapid development of intelligent technology,People’s lives have gradually entered the era of information and intelligentce,Wearable devices are becoming more and more popular,it is easier to use sensors to obtain data,even physiological data,from human body.When large amounts of data are collected by sensors,we can analyze and model them.the values of each characteristic are used to judge the user’s state,then according to the state we can provide users with more accurate and convenient services. In this paper,the data collected by different sensors are used to establish a prediction model and analyze the comparative effect of different recognition algorithms on the test data. The results of the experiment shows that the Bayesian method based on WLD identities the state of the human body better.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115499603","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 : 2021-08-11DOI: 10.18535/ijecs/v10i8.4610
M. Mahalakshmi, D. Senduraja
Abstract— This paper proposes a Peripheral Silhouette Chasing Technique (PSCT) that lessens vigor feasting for stalking movable boards in wireless stratagem nets in footings of detecting and message vigor ingesting. PSCT preserves get-up-and-go by hire only a least quantity of feeler bulges contribute in announcement and accomplish detecting for objective pursuing. The trifling succeeding extent founded on the vehicular kinematics. The showing of objective’s kinematics agrees for clipping available share of the stalking part that cannot be instinctively visited by the movable objective within reserved time. So, sends the stalking expanse material to only the instrument bulges within negligible stalking expanse and wakes them up. Equated to the inheritance pattern which uses sphere-based pursuing expanse, our suggested structure uses not as much of integer of antennae for stalking in cooperation epistle and distinguishing deprived of objective gone. From side to side recreation, us show that PSCT leave behind the round-constructed arrangement with near 70% vitality exchangeable beneath convinced epitome circumstances. Index Term — Stratagem Linkage, Objective Stalking, Vigor, Stalking Expanse, Peripatetic Objective, Automobile, Kinematics, Round, Recognizing, Decree, Optimization.
{"title":"Defensible Stalking Practice the Grounded Continuously Silhouette up-to-the-minute Wireless Assessing in Tactful Linkages","authors":"M. Mahalakshmi, D. Senduraja","doi":"10.18535/ijecs/v10i8.4610","DOIUrl":"https://doi.org/10.18535/ijecs/v10i8.4610","url":null,"abstract":"Abstract— This paper proposes a Peripheral Silhouette Chasing Technique (PSCT) that lessens vigor feasting for stalking movable boards in wireless stratagem nets in footings of detecting and message vigor ingesting. PSCT preserves get-up-and-go by hire only a least quantity of feeler bulges contribute in announcement and accomplish detecting for objective pursuing. The trifling succeeding extent founded on the vehicular kinematics. The showing of objective’s kinematics agrees for clipping available share of the stalking part that cannot be instinctively visited by the movable objective within reserved time. So, sends the stalking expanse material to only the instrument bulges within negligible stalking expanse and wakes them up. Equated to the inheritance pattern which uses sphere-based pursuing expanse, our suggested structure uses not as much of integer of antennae for stalking in cooperation epistle and distinguishing deprived of objective gone. From side to side recreation, us show that PSCT leave behind the round-constructed arrangement with near 70% vitality exchangeable beneath convinced epitome circumstances. \u0000Index Term — Stratagem Linkage, Objective Stalking, Vigor, Stalking Expanse, Peripatetic Objective, Automobile, Kinematics, Round, Recognizing, Decree, Optimization. \u0000 \u0000 ","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125004776","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 : 2021-08-11DOI: 10.18535/ijecs/v10i8.4611
Dr.V. Isakkirajan
In recent years, a number of cryptographic etiquettes have been mechanically verified using a selection of inductive methods. These attestations typically want central a figure of recursive sets of messages, and need deep intuition into why the etiquette is correct. As a result, these proofs frequently require days to weeks of expert effort. We ensure advanced an involuntary verifier, which seems to overawe these glitches for many cryptographic protocols. The code of behavior text to concept a number of first-order invariant the proof commitments mitigating these invariants, along with any user-specified protocol properties are showed from the invariants with a tenacity theorem proved. The individual litheness in construction these invariants is to guesstimate, for each type of nonce and encryption engendered by the protocol, a formulary arresting conditions compulsory for that nonce encryption to be published.
{"title":"A Prevailing-Decree Verifier intended for Cryptographic Etiquettes","authors":"Dr.V. Isakkirajan","doi":"10.18535/ijecs/v10i8.4611","DOIUrl":"https://doi.org/10.18535/ijecs/v10i8.4611","url":null,"abstract":"In recent years, a number of cryptographic etiquettes have been mechanically verified using a selection of inductive methods. These attestations typically want central a figure of recursive sets of messages, and need deep intuition into why the etiquette is correct. As a result, these proofs frequently require days to weeks of expert effort.\u0000We ensure advanced an involuntary verifier, which seems to overawe these glitches for many cryptographic protocols. The code of behavior text to concept a number of first-order invariant the proof commitments mitigating these invariants, along with any user-specified protocol properties are showed from the invariants with a tenacity theorem proved. The individual litheness in construction these invariants is to guesstimate, for each type of nonce and encryption engendered by the protocol, a formulary arresting conditions compulsory for that nonce encryption to be published.\u0000 ","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116200961","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
扫码关注我们
求助内容：
应助结果提醒方式：