Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945817
Amina Amara, Rihem Ben Romdhane, Mohamed Ali Hadj Taieb, M. Benaouicha
The inter-social networks data represent an important source of information for several research fields like the sentiment analysis, the content propagation and the determination of influential users. The user-centered graph of the social networks designs their connection through the users' profiles. It represents the flow of the contents propagation via inter-social networks. In this paper, we present a novel structure merging the user centered graphs of different socials networks. This structure allows the simulation and the visualization of such graphs illustrating the social networks. It is designed and developed as a plug-in within the known software Gephi1. It allows the definition of the graph structure including different parameters in relation with users and their relationships, and the generation of a graph which can be visualized and handled through several treatments present in Gephi.
{"title":"Simulating the merge between user-centered graphs of social networks","authors":"Amina Amara, Rihem Ben Romdhane, Mohamed Ali Hadj Taieb, M. Benaouicha","doi":"10.1109/AICCSA.2016.7945817","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945817","url":null,"abstract":"The inter-social networks data represent an important source of information for several research fields like the sentiment analysis, the content propagation and the determination of influential users. The user-centered graph of the social networks designs their connection through the users' profiles. It represents the flow of the contents propagation via inter-social networks. In this paper, we present a novel structure merging the user centered graphs of different socials networks. This structure allows the simulation and the visualization of such graphs illustrating the social networks. It is designed and developed as a plug-in within the known software Gephi1. It allows the definition of the graph structure including different parameters in relation with users and their relationships, and the generation of a graph which can be visualized and handled through several treatments present in Gephi.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131707731","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945625
Mohamed Azmi, A. Berrado
Association rules mining is a data mining technique that seeks interesting associations between attributes from massive high-dimensional categorical feature spaces. However, as the dimensionality gets higher, the data gets sparser which results in the discovery of a large number of association rules and makes it difficult to understand and to interpret. In this paper, we focus on a particular type of association rules namely Class-Association Rules (CARs) and we introduce a new approach of Class-Association Rules pruning based on Lasso regularization. In this approach we propose to take advantage of variable selection ability of Lasso regularization to prune less interesting rules. The experimental analysis shows that the introduced approach gives better results than CBA in term of number as well as the quality of the obtained rules after pruning.
{"title":"Class-association rules pruning using regularization","authors":"Mohamed Azmi, A. Berrado","doi":"10.1109/AICCSA.2016.7945625","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945625","url":null,"abstract":"Association rules mining is a data mining technique that seeks interesting associations between attributes from massive high-dimensional categorical feature spaces. However, as the dimensionality gets higher, the data gets sparser which results in the discovery of a large number of association rules and makes it difficult to understand and to interpret. In this paper, we focus on a particular type of association rules namely Class-Association Rules (CARs) and we introduce a new approach of Class-Association Rules pruning based on Lasso regularization. In this approach we propose to take advantage of variable selection ability of Lasso regularization to prune less interesting rules. The experimental analysis shows that the introduced approach gives better results than CBA in term of number as well as the quality of the obtained rules after pruning.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133228472","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}
This paper will help the linguists find an easy method to facilitate the creation of a standard Arabic historical dictionary in order to save time and to be up to date with the other languages. In this method, we propose a platform of Automatic Natural Language Processing (ANLP) tools which permits the automatic indexing and research from Arabic texts corpus. Some pretreatments are done before the indexation process: segmentation, normalization, and filtering, morphological analysis. The prototype that we've developed for the generation of standard Arabic historical dictionary permits to extract contexts from the entered corpus and to assign meaning from the user. The evaluation of our system shows that the results are reliable.
{"title":"HAD, a platform to create a historical dictionary","authors":"Faten Khalfallah, Chafik Aloulou, Lamia Hadrich Belguith","doi":"10.1109/AICCSA.2016.7945797","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945797","url":null,"abstract":"This paper will help the linguists find an easy method to facilitate the creation of a standard Arabic historical dictionary in order to save time and to be up to date with the other languages. In this method, we propose a platform of Automatic Natural Language Processing (ANLP) tools which permits the automatic indexing and research from Arabic texts corpus. Some pretreatments are done before the indexation process: segmentation, normalization, and filtering, morphological analysis. The prototype that we've developed for the generation of standard Arabic historical dictionary permits to extract contexts from the entered corpus and to assign meaning from the user. The evaluation of our system shows that the results are reliable.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130296974","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945623
Ashraf Elnagar
Arabic language has very rich vocabulary. It is manifested in different forms. The formal, Modern Standard Arabic (MSA), and the informal, colloquial or dialects. Dialectical languages become important as a result of the proliferation of social networks which resulted in the vast unstructured dialectical text available on the web. Unique properties of modern standard Arabic and dialects present major challenges to build sentiment analysis systems by adopting similar models designed for the English language. In this paper, we present a supervised Arabic sentiment analysis using a bag-of-words feature. We further examine using a set of key words (lexicon) for better polarity classification. The testing of the system is carried out on the freely-available Arabic books' reviews (LABR) dataset. LABR includes both modern standard Arabic and Egyptian dialectal reviews. We used both balanced and unbalanced datasets. Clearly, the balanced data set is small in size and, henceforth, a large-scale balanced dataset is required for training of the classifier model. Further, we compared the computed predicted sentiments against the actual reviews for a specific book. Findings, by annotators, had indicated ambiguity between a review and its rating when verified alongside the predicted sentiment, which provided a more reasonable result. Moreover, working with dialects and sarcasm is exceedingly exciting. Experimental results on the adopted logistic classifier model and LABR are encouraging and promising. However, a key prerequisite is the availability of rich and well represented datasets in order to develop robust and efficient Arabic sentiment analyzers.
{"title":"Investigation on sentiment analysis for Arabic reviews","authors":"Ashraf Elnagar","doi":"10.1109/AICCSA.2016.7945623","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945623","url":null,"abstract":"Arabic language has very rich vocabulary. It is manifested in different forms. The formal, Modern Standard Arabic (MSA), and the informal, colloquial or dialects. Dialectical languages become important as a result of the proliferation of social networks which resulted in the vast unstructured dialectical text available on the web. Unique properties of modern standard Arabic and dialects present major challenges to build sentiment analysis systems by adopting similar models designed for the English language. In this paper, we present a supervised Arabic sentiment analysis using a bag-of-words feature. We further examine using a set of key words (lexicon) for better polarity classification. The testing of the system is carried out on the freely-available Arabic books' reviews (LABR) dataset. LABR includes both modern standard Arabic and Egyptian dialectal reviews. We used both balanced and unbalanced datasets. Clearly, the balanced data set is small in size and, henceforth, a large-scale balanced dataset is required for training of the classifier model. Further, we compared the computed predicted sentiments against the actual reviews for a specific book. Findings, by annotators, had indicated ambiguity between a review and its rating when verified alongside the predicted sentiment, which provided a more reasonable result. Moreover, working with dialects and sarcasm is exceedingly exciting. Experimental results on the adopted logistic classifier model and LABR are encouraging and promising. However, a key prerequisite is the availability of rich and well represented datasets in order to develop robust and efficient Arabic sentiment analyzers.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122489848","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945656
Hela Marouane, Achraf Makni, R. Bouaziz, Claude Duvallet, B. Sadeg
A design pattern describes a general solution to a design problem occurring repeatedly in many systems. Indeed, software designers adapt the pattern solution to their specific applications. Therefore, its design must show the variations points which will be adopted for certain systems. Hence, the expression of the variability when modeling the pattern is crucial. The design pattern is usually modeled using the Unified Modeling Language (UML). However, the latter is not enough expressive to represent the variability. Thus, the UML was semantically and syntactically extended with profiles by providing three extension mechanisms: stereotypes, tagged values and constraints. The expression of variability using stereotypes makes the pattern more expressive and facilitates its instantiation. But, it can generate some inconsistencies inside UML diagrams. Accordingly, in order to overcome this drawback, we propose delimiting the impact of the variable elements through the definition of Object Constraint Language (OCL) over stereotypes. To specify these constraints, we propose stereotypes expressing the fundamental elements and the variable ones. Furthermore, we present, in this work, the checking of each pattern diagram consistency using the proposed OCL constraints.
{"title":"Defining a UML profile for the consistency of design patterns","authors":"Hela Marouane, Achraf Makni, R. Bouaziz, Claude Duvallet, B. Sadeg","doi":"10.1109/AICCSA.2016.7945656","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945656","url":null,"abstract":"A design pattern describes a general solution to a design problem occurring repeatedly in many systems. Indeed, software designers adapt the pattern solution to their specific applications. Therefore, its design must show the variations points which will be adopted for certain systems. Hence, the expression of the variability when modeling the pattern is crucial. The design pattern is usually modeled using the Unified Modeling Language (UML). However, the latter is not enough expressive to represent the variability. Thus, the UML was semantically and syntactically extended with profiles by providing three extension mechanisms: stereotypes, tagged values and constraints. The expression of variability using stereotypes makes the pattern more expressive and facilitates its instantiation. But, it can generate some inconsistencies inside UML diagrams. Accordingly, in order to overcome this drawback, we propose delimiting the impact of the variable elements through the definition of Object Constraint Language (OCL) over stereotypes. To specify these constraints, we propose stereotypes expressing the fundamental elements and the variable ones. Furthermore, we present, in this work, the checking of each pattern diagram consistency using the proposed OCL constraints.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128560539","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945660
I. Assayad, Lamia Eljadiri, A. Zakari, Tarik Nahhal
We present an approach for formal modelling of SystemC programs build uppon the “Behavior, Interactions and Priority” framework. Produced automata interactions are restricted only by using priorities rather than cutting their interactions. Produced models have thus the advantages of being composable — with other futur programs — without any change, except for the priorities. Furthermore automata are reduced by (1) collapsing all transitions inside a SystemC delta-step into a single transition before composing the automata, and (2) cuttting some interactions of private signals whitout any loss in program composability. Produced models sizes can thus be much smaller than non-reduced ones and verification speed of their properties may be much faster. We show the feasibility of the approach through the modeling, and verification of a set of SystemC benchmarks.
{"title":"The “Behavior, interaction and priority” framework applied to SystemC-based embedded systems","authors":"I. Assayad, Lamia Eljadiri, A. Zakari, Tarik Nahhal","doi":"10.1109/AICCSA.2016.7945660","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945660","url":null,"abstract":"We present an approach for formal modelling of SystemC programs build uppon the “Behavior, Interactions and Priority” framework. Produced automata interactions are restricted only by using priorities rather than cutting their interactions. Produced models have thus the advantages of being composable — with other futur programs — without any change, except for the priorities. Furthermore automata are reduced by (1) collapsing all transitions inside a SystemC delta-step into a single transition before composing the automata, and (2) cuttting some interactions of private signals whitout any loss in program composability. Produced models sizes can thus be much smaller than non-reduced ones and verification speed of their properties may be much faster. We show the feasibility of the approach through the modeling, and verification of a set of SystemC benchmarks.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128570341","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945621
Mounira Chkiwa, A. Jedidi, F. Gargouri
In this paper, we present a new variant to show results of information retrieval process. Search results proposed here are in the form of textual abstract instead of returning a list of links pointing to relevant web documents. Our current work materializes collaboration between two independent axes: Semantic Web and Fuzzy Logic. The automatic abstract generation represents an extension of our previous works aimed to create an information retrieval system dedicated for kids.
{"title":"Abstracts generation as information retrieval results","authors":"Mounira Chkiwa, A. Jedidi, F. Gargouri","doi":"10.1109/AICCSA.2016.7945621","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945621","url":null,"abstract":"In this paper, we present a new variant to show results of information retrieval process. Search results proposed here are in the form of textual abstract instead of returning a list of links pointing to relevant web documents. Our current work materializes collaboration between two independent axes: Semantic Web and Fuzzy Logic. The automatic abstract generation represents an extension of our previous works aimed to create an information retrieval system dedicated for kids.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128619146","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945661
A. A. Aliane, H. Aliane, M. Ziane, Nacéra Bensaou
With the recently increasing interest for opinion mining from different research communities, there is an evolving body of work on Arabic Sentiment Analysis. There are few available polarity annotated datasets for this language, so most existing works use these datasets to test the best known supervised algorithms for their objectives. Naïve Bayes and SVM are the best reported algorithms in the Arabic sentiment analysis literature. The work described in this paper shows that using a genetic algorithm to select features and enhancing the quality of the training dataset improve significantly the accuracy of the learning algorithm. We use the LABR dataset of book reviews and compare our results with LABR's authors' results.
{"title":"A genetic algorithm feature selection based approach for Arabic Sentiment Classification","authors":"A. A. Aliane, H. Aliane, M. Ziane, Nacéra Bensaou","doi":"10.1109/AICCSA.2016.7945661","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945661","url":null,"abstract":"With the recently increasing interest for opinion mining from different research communities, there is an evolving body of work on Arabic Sentiment Analysis. There are few available polarity annotated datasets for this language, so most existing works use these datasets to test the best known supervised algorithms for their objectives. Naïve Bayes and SVM are the best reported algorithms in the Arabic sentiment analysis literature. The work described in this paper shows that using a genetic algorithm to select features and enhancing the quality of the training dataset improve significantly the accuracy of the learning algorithm. We use the LABR dataset of book reviews and compare our results with LABR's authors' results.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128428332","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945807
Bacem Mbarek, A. Meddeb, Wafa Ben Jaballah, M. Mosbah
Broadcast authentication has been widely investigated in the context of wireless sensor networks, Internet, RFIDs, and other scenarios. With the emergence of the Internet of Things that allows to connect different wireless technologies to provide services, broadcast authentication is crucial. Broadcast authentication aims to confirm that the sender of the message is the pretended source. In this direction, different state of the art proposals address this problem either by reducing the communication and overhead burden of security solutions, or by reducing the impact of attacks that aim to jeopordize the effectiveness of the service. In this paper, we propose an improved authentication scheme that is efficient for resource constrained devices. In particular, we shed the light into the security vulnerabilities of lightweight authentication mechanisms and their inability to tackle memory DoS attacks. Hence, we propose an improved scheme derived from the streamlined μTESLA, referred to as X-μTESLA. We demonstrate through our analytical and simulation results that X-μTESLA reduces communication overhead and yields a better performance in terms of energy consumption, memory overhead, and authentication delay than its previous counterparts.
{"title":"A broadcast authentication scheme in IoT environments","authors":"Bacem Mbarek, A. Meddeb, Wafa Ben Jaballah, M. Mosbah","doi":"10.1109/AICCSA.2016.7945807","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945807","url":null,"abstract":"Broadcast authentication has been widely investigated in the context of wireless sensor networks, Internet, RFIDs, and other scenarios. With the emergence of the Internet of Things that allows to connect different wireless technologies to provide services, broadcast authentication is crucial. Broadcast authentication aims to confirm that the sender of the message is the pretended source. In this direction, different state of the art proposals address this problem either by reducing the communication and overhead burden of security solutions, or by reducing the impact of attacks that aim to jeopordize the effectiveness of the service. In this paper, we propose an improved authentication scheme that is efficient for resource constrained devices. In particular, we shed the light into the security vulnerabilities of lightweight authentication mechanisms and their inability to tackle memory DoS attacks. Hence, we propose an improved scheme derived from the streamlined μTESLA, referred to as X-μTESLA. We demonstrate through our analytical and simulation results that X-μTESLA reduces communication overhead and yields a better performance in terms of energy consumption, memory overhead, and authentication delay than its previous counterparts.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451846","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945733
Abir Amami, Zied Elouedi, A. Hadjali
Queries posed by a user over a database do not always return the desired responses. It may sometimes result an empty set of answers especially when data are pervaded with uncertainty and imprecision. Thus, to address this problem, we propose an approach for relaxing a failing query in the context of evidential databases. The uncertainty in such databases is expressed within the belief function theory. The key idea of our approach is to use a machine learning method more precisely the belief K-modes clustering technique to relax the failing queries by modifying the constraints in order to provide successful alternatives which may be of interest to the user.
{"title":"A clustering based approach for query relaxation in evidential databases","authors":"Abir Amami, Zied Elouedi, A. Hadjali","doi":"10.1109/AICCSA.2016.7945733","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945733","url":null,"abstract":"Queries posed by a user over a database do not always return the desired responses. It may sometimes result an empty set of answers especially when data are pervaded with uncertainty and imprecision. Thus, to address this problem, we propose an approach for relaxing a failing query in the context of evidential databases. The uncertainty in such databases is expressed within the belief function theory. The key idea of our approach is to use a machine learning method more precisely the belief K-modes clustering technique to relax the failing queries by modifying the constraints in order to provide successful alternatives which may be of interest to the user.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125882409","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
扫码关注我们
求助内容：
应助结果提醒方式：