Pub Date : 2016-12-05DOI: 10.1109/ICITST.2016.7856670
H. Mykhailenko, G. Neglia, F. Huet
In this paper we focus on vertex-cut graph partitioning and we investigate how it is possible to evaluate the quality of a partition before running the computation. To this purpose we scrutinize a set of metrics proposed in literature. We carry experiments with the widely-used framework for graph processing Apache GraphX and we perform an accurate statistical analysis. Our preliminary experimental results show that communication metrics like vertex-cut and communication cost are effective predictors on most of the cases.
{"title":"Which metrics for vertex-cut partitioning?","authors":"H. Mykhailenko, G. Neglia, F. Huet","doi":"10.1109/ICITST.2016.7856670","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856670","url":null,"abstract":"In this paper we focus on vertex-cut graph partitioning and we investigate how it is possible to evaluate the quality of a partition before running the computation. To this purpose we scrutinize a set of metrics proposed in literature. We carry experiments with the widely-used framework for graph processing Apache GraphX and we perform an accurate statistical analysis. Our preliminary experimental results show that communication metrics like vertex-cut and communication cost are effective predictors on most of the cases.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128555001","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-12-01DOI: 10.1109/ICITST.2016.7856746
Ibrahim Almarashdeh, M. Alsmadi
The rapid development of wireless and mobile technologies indicate the use of mobile as a supplement is very important to increase the accessibility and usage of the e-government services. To increase the usage of the mobile services, the m-government should be useful and ease to use and ease to navigate and compatible with the limitations of the mobile devices. This paper presents an important verification method towards a comprehensive m-Government success. Hence, the a usability studies on mobile governments has focused on limited aspects of services. This study conducted an exploratory study to examine usability problems that might faced the m-government design and performance using heuristic evaluation methods. The result indicates that the usability of the m-government is good. This study stand on some usability issues which can enhance the design and performance of the m-government before release it to the end user.
{"title":"Heuristic evaluation of mobile government portal services: An experts' review","authors":"Ibrahim Almarashdeh, M. Alsmadi","doi":"10.1109/ICITST.2016.7856746","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856746","url":null,"abstract":"The rapid development of wireless and mobile technologies indicate the use of mobile as a supplement is very important to increase the accessibility and usage of the e-government services. To increase the usage of the mobile services, the m-government should be useful and ease to use and ease to navigate and compatible with the limitations of the mobile devices. This paper presents an important verification method towards a comprehensive m-Government success. Hence, the a usability studies on mobile governments has focused on limited aspects of services. This study conducted an exploratory study to examine usability problems that might faced the m-government design and performance using heuristic evaluation methods. The result indicates that the usability of the m-government is good. This study stand on some usability issues which can enhance the design and performance of the m-government before release it to the end user.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124911836","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-12-01DOI: 10.1109/ICITST.2016.7856757
Daisuke Arakawa, H. Nakayama, R. Onuma, H. Kaminaga, Y. Miyadera, Shoichi Nakamura
Opportunities of continuous Web exploration with trial and error have been increased in intellectual creative activities such as research work and PBL. However, it is often difficult to pick up useful pages. In such exploration, information that a user particularly needs and his/her viewpoints changes in accordance with progress of the work and trial and error in it. Therefore, it is important but difficult to understand the relationships between obtained pages and to examine the promising information based on the latest perspectives. We aimed to develop the mechanism for dynamic visualization of the relationships between the pages. This paper mainly describes the outline of our dynamic visualization and methods for extracting the relationships between the pages using focused page of a user as a base point.
{"title":"Dynamically visualizing the relationships between Web pages depending on user's search viewpoints","authors":"Daisuke Arakawa, H. Nakayama, R. Onuma, H. Kaminaga, Y. Miyadera, Shoichi Nakamura","doi":"10.1109/ICITST.2016.7856757","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856757","url":null,"abstract":"Opportunities of continuous Web exploration with trial and error have been increased in intellectual creative activities such as research work and PBL. However, it is often difficult to pick up useful pages. In such exploration, information that a user particularly needs and his/her viewpoints changes in accordance with progress of the work and trial and error in it. Therefore, it is important but difficult to understand the relationships between obtained pages and to examine the promising information based on the latest perspectives. We aimed to develop the mechanism for dynamic visualization of the relationships between the pages. This paper mainly describes the outline of our dynamic visualization and methods for extracting the relationships between the pages using focused page of a user as a base point.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125871999","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-12-01DOI: 10.1109/ICITST.2016.7856696
Zakia El Uahhabi, H. Bakkali
Today, X.509 certificates is largely adopted for the identity verification of an entity. Such organizations and people use it to confirm their identities in online transaction. Then, it is necessary to verify the certificate trustworthiness in order to accept or reject it for a particular transaction. Besides, certificates are issued by the certificate authority based on the procedures which are described in a certificate policy. Any deficiency in these procedures may influence a certificate authority trustworthiness, which creates a trust lack in the certificates signed by this authority. In this context, relying parties need an automated mechanism to evaluate a trust level of certificate which come into question. In this paper, we grant them this mechanism to have information about its trustworthiness. In fact, we propose a trust framework architecture which is composed from the several components involved in the trust level calculation. Then, we suggest a trust level calculation algorithm which is based on three parameters that are the calculated CA trust level, the quality of procedures indicated in the certificate policy and the rating assigned to certification fields content. Our proposed solution allows relying parties to make a decision about certificate trustworthiness.
{"title":"An approach for evaluating trust in X.509 certificates","authors":"Zakia El Uahhabi, H. Bakkali","doi":"10.1109/ICITST.2016.7856696","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856696","url":null,"abstract":"Today, X.509 certificates is largely adopted for the identity verification of an entity. Such organizations and people use it to confirm their identities in online transaction. Then, it is necessary to verify the certificate trustworthiness in order to accept or reject it for a particular transaction. Besides, certificates are issued by the certificate authority based on the procedures which are described in a certificate policy. Any deficiency in these procedures may influence a certificate authority trustworthiness, which creates a trust lack in the certificates signed by this authority. In this context, relying parties need an automated mechanism to evaluate a trust level of certificate which come into question. In this paper, we grant them this mechanism to have information about its trustworthiness. In fact, we propose a trust framework architecture which is composed from the several components involved in the trust level calculation. Then, we suggest a trust level calculation algorithm which is based on three parameters that are the calculated CA trust level, the quality of procedures indicated in the certificate policy and the rating assigned to certification fields content. Our proposed solution allows relying parties to make a decision about certificate trustworthiness.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"445 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116231905","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-12-01DOI: 10.1109/ICITST.2016.7856686
Alex M. S. Orozco, C. V. Neu, Regio A. Michelin, A. Zorzo
Reliable network time measurement tools are important to ensure that monitoring network systems work properly, but their development do not consider security as a concern and, for example, delay attacks could compromise those tools effectiveness. Indeed, nowadays the network time measurement is not always reliable. Some researches do propose to increase network time measurement reliability using Openflow. Nonetheless, those researches do not consider the impact of altering some of the Openflow controller algorithms in their analysis. On one hand, this paper investigates how the provided POX Openflow Controller packet forwarding strategies could be applied to compromise network time measurement reliability. On the other hand, this paper also shows that the way those strategies are applied could prevent against new attacks that need to trust on network time measurement. Therefore, some experiments were performed to show the impact of the POX packet forwarding algorithms on network time measurement, either to compromise or to help in protecting the network.
{"title":"Security analysis of forwarding strategies in network time measurements using Openflow","authors":"Alex M. S. Orozco, C. V. Neu, Regio A. Michelin, A. Zorzo","doi":"10.1109/ICITST.2016.7856686","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856686","url":null,"abstract":"Reliable network time measurement tools are important to ensure that monitoring network systems work properly, but their development do not consider security as a concern and, for example, delay attacks could compromise those tools effectiveness. Indeed, nowadays the network time measurement is not always reliable. Some researches do propose to increase network time measurement reliability using Openflow. Nonetheless, those researches do not consider the impact of altering some of the Openflow controller algorithms in their analysis. On one hand, this paper investigates how the provided POX Openflow Controller packet forwarding strategies could be applied to compromise network time measurement reliability. On the other hand, this paper also shows that the way those strategies are applied could prevent against new attacks that need to trust on network time measurement. Therefore, some experiments were performed to show the impact of the POX packet forwarding algorithms on network time measurement, either to compromise or to help in protecting the network.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122495181","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-12-01DOI: 10.1109/ICITST.2016.7856718
Aymen J. Salman, A. Al-Yasiri
Wireless Sensor Networks (WSNs) have a potential for a wide scope of uses in the real-world environment. However, WSN application development is considered a challenging and complex task because of the complexity in low-level details, which a developer must deal with. Besides most of the current application development is done using node-centric, low-level languages such as C. In order to make the WSN technology more ubiquitous, application development complexity needs to be reduced, and development efficiency increased. This paper describes SenNet language, which is a new approach to WSN application development using a Domain-Specific Language (DSL). SenNet empowers application developers by allowing them to focus on modelling the application logic rather than the programming and low-level technical details. The new approach gives the ability to write applications using multi-abstraction levels (i.e. network, group, and node-level). Furthermore, evaluation results show that SenNet reduces the cognitive effort needed for learning WSN application development in addition to the time required to write the application by using automated code generation from abstracted language commands.
{"title":"Developing Domain-Specific Language for Wireless Sensor Network application development","authors":"Aymen J. Salman, A. Al-Yasiri","doi":"10.1109/ICITST.2016.7856718","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856718","url":null,"abstract":"Wireless Sensor Networks (WSNs) have a potential for a wide scope of uses in the real-world environment. However, WSN application development is considered a challenging and complex task because of the complexity in low-level details, which a developer must deal with. Besides most of the current application development is done using node-centric, low-level languages such as C. In order to make the WSN technology more ubiquitous, application development complexity needs to be reduced, and development efficiency increased. This paper describes SenNet language, which is a new approach to WSN application development using a Domain-Specific Language (DSL). SenNet empowers application developers by allowing them to focus on modelling the application logic rather than the programming and low-level technical details. The new approach gives the ability to write applications using multi-abstraction levels (i.e. network, group, and node-level). Furthermore, evaluation results show that SenNet reduces the cognitive effort needed for learning WSN application development in addition to the time required to write the application by using automated code generation from abstracted language commands.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122252090","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-12-01DOI: 10.1109/ICITST.2016.7856714
Radu Velea, N. Gordon
Color characteristics of computer monitors and similar display devices can significantly alter the way an image is perceived by the human eye. Modern cameras and software applications are able to create vibrant scenes and retain their original colorfulness through an embedded ICC[1] profile. Gamut differences between input and output mediums require color management techniques in order to preserve the accuracy of the original content. It is thus useful to be able to determine the nature of the display a user is exposed to through gamut area measurement. This paper analyzes several metrics and provides a suggestion on how to measure and assess the gamut of an ICCv2 color profile. The work this article is based on has been integrated into Chromium browser's Quick Color Management System library.
计算机显示器和类似的显示设备的颜色特性可以显著地改变人眼感知图像的方式。现代相机和软件应用程序能够通过嵌入式ICC[1]配置文件创建充满活力的场景并保留其原始色彩。输入和输出介质之间的色域差异需要色彩管理技术，以保持原始内容的准确性。因此，能够通过色域面积测量来确定用户所暴露的显示的性质是有用的。本文分析了几个指标，并就如何测量和评估ICCv2颜色配置文件的色域提供了建议。本文所基于的工作已经集成到Chromium浏览器的Quick Color Management System库中。
{"title":"Comparison of color profile gamut coverage for computer monitors","authors":"Radu Velea, N. Gordon","doi":"10.1109/ICITST.2016.7856714","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856714","url":null,"abstract":"Color characteristics of computer monitors and similar display devices can significantly alter the way an image is perceived by the human eye. Modern cameras and software applications are able to create vibrant scenes and retain their original colorfulness through an embedded ICC[1] profile. Gamut differences between input and output mediums require color management techniques in order to preserve the accuracy of the original content. It is thus useful to be able to determine the nature of the display a user is exposed to through gamut area measurement. This paper analyzes several metrics and provides a suggestion on how to measure and assess the gamut of an ICCv2 color profile. The work this article is based on has been integrated into Chromium browser's Quick Color Management System library.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128566237","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-12-01DOI: 10.1109/ICITST.2016.7856756
Takashi Amano, R. Onuma, H. Nakayama, H. Kaminaga, Y. Miyadera, Shoichi Nakamura
Opportunities for Web exploration have been remarkably increased. In particular, complicated Web search with a stack of search and acquisitions of Web pages is significant in long-term intellectual activity. In such exploration, it is important to identify the noteworthy pages and their relationships in increasing bookmark in accordance with change of search intentions. However, it is difficult to grasp them since bookmarks tends to increase according to various search intentions and their changes. In this research, we develop a method for extracting the relationships between Web page by several different related elements from bookmarks. We also develop a method for extracting the gaze network based on centrality analysis. This paper mainly describes the framework of our proposed methods.
{"title":"Gaze network extraction from bookmarks in accordance with search intentions","authors":"Takashi Amano, R. Onuma, H. Nakayama, H. Kaminaga, Y. Miyadera, Shoichi Nakamura","doi":"10.1109/ICITST.2016.7856756","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856756","url":null,"abstract":"Opportunities for Web exploration have been remarkably increased. In particular, complicated Web search with a stack of search and acquisitions of Web pages is significant in long-term intellectual activity. In such exploration, it is important to identify the noteworthy pages and their relationships in increasing bookmark in accordance with change of search intentions. However, it is difficult to grasp them since bookmarks tends to increase according to various search intentions and their changes. In this research, we develop a method for extracting the relationships between Web page by several different related elements from bookmarks. We also develop a method for extracting the gaze network based on centrality analysis. This paper mainly describes the framework of our proposed methods.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125758141","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-12-01DOI: 10.1109/ICITST.2016.7856745
Lotfi Hajjem, S. Benabdallah
Delivering computing resources from multiple cloud providers to satisfy the users' needs, known as multi-cloud, gives the possibility for cloud consumers to get access to a wide variety of performing resources with competing costs. The main challenge of this infrastructure is the providers' systems interoperability. In this paper, cloud broker architecture is proposed, which aims on finding a providers coalition to satisfy a user's request with the minimal execution time and cost. The request is a set of independent tasks where no communication is considered. To solve this problem, a Max-Min Ant system (MMAS) and a Genetic Algorithm (GA) were developed as well as their hybrid, and a comparative study was established.
{"title":"An MMAS-GA for resource allocation in multi-cloud systems","authors":"Lotfi Hajjem, S. Benabdallah","doi":"10.1109/ICITST.2016.7856745","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856745","url":null,"abstract":"Delivering computing resources from multiple cloud providers to satisfy the users' needs, known as multi-cloud, gives the possibility for cloud consumers to get access to a wide variety of performing resources with competing costs. The main challenge of this infrastructure is the providers' systems interoperability. In this paper, cloud broker architecture is proposed, which aims on finding a providers coalition to satisfy a user's request with the minimal execution time and cost. The request is a set of independent tasks where no communication is considered. To solve this problem, a Max-Min Ant system (MMAS) and a Genetic Algorithm (GA) were developed as well as their hybrid, and a comparative study was established.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"336 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131465258","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-12-01DOI: 10.1109/ICITST.2016.7856751
Y. Alsalami, C. Yeun, T. Martin, M. Khonji
S-boxes are used in cryptography in order to provide non-linearity in the design of cryptographic primitives such as block ciphers and hash functions. Some cryptographic primitives use bijective S-boxes as in the Advanced Encryption Standard (AES), and others use surjective S-boxes as in the Data Encryption Standard (DES). That is, S-boxes can have inputs and outputs of the same length as in the (8,8)-S-box of AES, or alternatively the input length can be larger than the output as in the (6, 4)-S-boxes of DES. In this paper, we perform a statistical study of linear and differential properties of randomly generated (n, m)-S-boxes, where m ≤ n. We show that certain S-boxes with well-behaved linear and differential properties can be feasibly obtained via random search. We show further that certain types of S-boxes with specific desirable linear and differential properties are improbable.
{"title":"Linear and differential cryptanalysis of small-sized random (n, m)-S-boxes","authors":"Y. Alsalami, C. Yeun, T. Martin, M. Khonji","doi":"10.1109/ICITST.2016.7856751","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856751","url":null,"abstract":"S-boxes are used in cryptography in order to provide non-linearity in the design of cryptographic primitives such as block ciphers and hash functions. Some cryptographic primitives use bijective S-boxes as in the Advanced Encryption Standard (AES), and others use surjective S-boxes as in the Data Encryption Standard (DES). That is, S-boxes can have inputs and outputs of the same length as in the (8,8)-S-box of AES, or alternatively the input length can be larger than the output as in the (6, 4)-S-boxes of DES. In this paper, we perform a statistical study of linear and differential properties of randomly generated (n, m)-S-boxes, where m ≤ n. We show that certain S-boxes with well-behaved linear and differential properties can be feasibly obtained via random search. We show further that certain types of S-boxes with specific desirable linear and differential properties are improbable.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134068623","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
扫码关注我们
求助内容：
应助结果提醒方式：