Ethnography is now a widely used research method in information systems and gaming. It is one of the most in-depth research methods that can capture people’s feelings, behavior and opinions by the researcher getting immersed in the study. The main aspect of the research method is gathering the data by being in the ‘field’, gaining a deep insight by participating and observing the culture being studied. The authors have replaced the ‘field’ with simulated environments, and although this would tend to infer a less rich or truthful ethnographic study (from a purist’s perspective), they reflect on the usefulness in the context of two ongoing research studies. A Simulated Gaming Environment is proving to offer a suitably ‘real’ experience for the first author’s research, and a driving simulator is the only option for the second.
{"title":"The Usefulness of a Simulated Environment in Ethnographic Research for Gaming and HCI","authors":"N. Z. Abidin, Robert Wellington","doi":"10.1037/e527382013-009","DOIUrl":"https://doi.org/10.1037/e527382013-009","url":null,"abstract":"Ethnography is now a widely used research method in information systems and gaming. It is one of the most in-depth research methods that can capture people’s feelings, behavior and opinions by the researcher getting immersed in the study. The main aspect of the research method is gathering the data by being in the ‘field’, gaining a deep insight by participating and observing the culture being studied. The authors have replaced the ‘field’ with simulated environments, and although this would tend to infer a less rich or truthful ethnographic study (from a purist’s perspective), they reflect on the usefulness in the context of two ongoing research studies. A Simulated Gaming Environment is proving to offer a suitably ‘real’ experience for the first author’s research, and a driving simulator is the only option for the second.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85341876","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 : 2014-09-13DOI: 10.5176/2010-2283_1.2.63
M. Venkatesh, Bahram Attaie
We outline an innovative approach to the development of a prototype of a neighborhood notification system (NNS). The NNS application residing on smart phones will use software defined radio and cognitive radio components to interface with radio frequency transceivers. Mesh networking is proposed for emergency notification and disaster response coordination using NNS. Our focus has been on the IEEE 802.15.4 and the very recent IEEE 802.15.5 mesh networking standard for low data rate connectivity among low power nodes (or nodes whose power consumption needs to be low). The innovation stems from bringing together different hardware and software components – some of which, like our Software Defined Radio (SDR) platform, are themselves still evolving and others, like the meshing platform, are very new – to propose an adaptive, reconfigurable, infrastructure-less ad hoc wireless solution to emergency communications in the unlicensed ISM RF band.
{"title":"Developing a neighborhood-scale wireless notification prototype","authors":"M. Venkatesh, Bahram Attaie","doi":"10.5176/2010-2283_1.2.63","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.63","url":null,"abstract":"We outline an innovative approach to the development of a prototype of a neighborhood notification system (NNS). The NNS application residing on smart phones will use software defined radio and cognitive radio components to interface with radio frequency transceivers. Mesh networking is proposed for emergency notification and disaster response coordination using NNS. Our focus has been on the IEEE 802.15.4 and the very recent IEEE 802.15.5 mesh networking standard for low data rate connectivity among low power nodes (or nodes whose power consumption needs to be low). The innovation stems from bringing together different hardware and software components – some of which, like our Software Defined Radio (SDR) platform, are themselves still evolving and others, like the meshing platform, are very new – to propose an adaptive, reconfigurable, infrastructure-less ad hoc wireless solution to emergency communications in the unlicensed ISM RF band.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82659770","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 : 2014-09-13DOI: 10.5176/2010-2283_1.2.51
P. Selvarajan
This paper explores the recent revolutionary levels of Business Reconfiguration in the Public Sector Banks in Sri Lanka through a Case Study exploratory analysis. This study has compared the five levels of Business Reconfiguration introduced by Venkatraman (1991) with the Sri Lankan Public Sector Banks. Findings show that rather than evolutionary levels, these banks have achieved the revolutionary levels of business Reconfiguration within a short period of time and it is believed that they will achieve the optimum capability of level five in near future.
{"title":"The ICT Induced Business Reconfiguration from Evolution to Revolution (A Case Study of Public Sector Banks in Sri Lanka)","authors":"P. Selvarajan","doi":"10.5176/2010-2283_1.2.51","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.51","url":null,"abstract":"This paper explores the recent revolutionary levels of Business Reconfiguration in the Public Sector Banks in Sri Lanka through a Case Study exploratory analysis. This study has compared the five levels of Business Reconfiguration introduced by Venkatraman (1991) with the Sri Lankan Public Sector Banks. Findings show that rather than evolutionary levels, these banks have achieved the revolutionary levels of business Reconfiguration within a short period of time and it is believed that they will achieve the optimum capability of level five in near future.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76086827","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 : 2014-09-13DOI: 10.5176/2010-2283_1.2.64
Rushdi A. Hamamreh, Anas M. Melhem
Hybrid wireless mesh network (WMN) consists of two types of nodes: Mesh Routers which are relatively static and energy-rich devices, and Mesh Clients which are relatively dynamic and power constrained devices. In this paper we present a new model for WMN end-to-end security which divide authentication process into two phases: Mesh Access Point phase which based on asymmetric cryptography and Mesh Client phase which based on a server-side certificate such as EAP-TTLS and PEAP.
{"title":"Securing End-to-End Wireless Mesh Networks Ticket-Based Authentication.","authors":"Rushdi A. Hamamreh, Anas M. Melhem","doi":"10.5176/2010-2283_1.2.64","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.64","url":null,"abstract":"Hybrid wireless mesh network (WMN) consists of two types of nodes: Mesh Routers which are relatively static and energy-rich devices, and Mesh Clients which are relatively dynamic and power constrained devices. In this paper we present a new model for WMN end-to-end security which divide authentication process into two phases: Mesh Access Point phase which based on asymmetric cryptography and Mesh Client phase which based on a server-side certificate such as EAP-TTLS and PEAP.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"65 4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79285129","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 : 2014-09-13DOI: 10.5176/2010-2283_1.2.56
Phong H. Pham, N. Duong, N. M. Ta, Cuong Q.Tran, D. Nguyen, T. Nguyen, H. D. Le
The Smith-Waterman algorithm is a common local sequence alignment method which gives a high accuracy. However, it needs a high capacity of computation and a large amount of storage memory, so implementations based on common computing systems are impractical. Here, we present our implementation of the Smith-Waterman algorithm on a cluster including graphics cards (GPU cluster) – swGPUCluster. The algorithm implementation is tested on a cluster of two nodes: a node is equipped with two dual graphics cards NVIDIA GeForce GTX 295, the other node includes a dual graphics cards NVIDIA GeForce 295 and a Tesla C1060 card. Depending on the length of query sequences, the swGPUCluster performance increases from 37.33 GCUPS to 46.71 GCUPS. This result demonstrates the great computing power of GPUs and their high applicability in the bioinformatics field.
{"title":"Applying GPUs for Smith-Waterman Sequence Alignment Acceleration","authors":"Phong H. Pham, N. Duong, N. M. Ta, Cuong Q.Tran, D. Nguyen, T. Nguyen, H. D. Le","doi":"10.5176/2010-2283_1.2.56","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.56","url":null,"abstract":"The Smith-Waterman algorithm is a common local sequence alignment method which gives a high accuracy. However, it needs a high capacity of computation and a large amount of storage memory, so implementations based on common computing systems are impractical. Here, we present our implementation of the Smith-Waterman algorithm on a cluster including graphics cards (GPU cluster) – swGPUCluster. The algorithm implementation is tested on a cluster of two nodes: a node is equipped with two dual graphics cards NVIDIA GeForce GTX 295, the other node includes a dual graphics cards NVIDIA GeForce 295 and a Tesla C1060 card. Depending on the length of query sequences, the swGPUCluster performance increases from 37.33 GCUPS to 46.71 GCUPS. This result demonstrates the great computing power of GPUs and their high applicability in the bioinformatics field.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91145722","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 : 2014-09-13DOI: 10.5176/2010-2283_1.2.59
Lisa Soon, C. Fraser
For contemporary businesses to stay viable, business intelligence is mission critical. Although the importance of business intelligence is recognised, there is limited research on what information contributes to business intelligence and how business intelligence is sought for use in an organisational intranet. This research discusses how business intelligence is sought, captured and used having tapped into an intranet data warehouse as a knowledge management approach. It adopts qualitative case study method using interviews and observation techniques. A case study was conducted to examine how an Intranet system was designed, how business intelligence was captured, and how it aided strategic planning and decision making in business operation. The respondents explained how structured business intelligence data was categorised and disseminated to users and how the used information empowered staff in their work performance. The intranet design successfully retains staff knowledge within the organisation. It was also successful in drawing all internal resources together, capturing resources from external sources, and forming a common repository of organisational assets for use through organisational work procedures within the intranet.
{"title":"A Knowledge Management Approach: Business Intelligence in an Intranet Data Warehouse","authors":"Lisa Soon, C. Fraser","doi":"10.5176/2010-2283_1.2.59","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.59","url":null,"abstract":"For contemporary businesses to stay viable, business intelligence is mission critical. Although the importance of business intelligence is recognised, there is limited research on what information contributes to business intelligence and how business intelligence is sought for use in an organisational intranet. This research discusses how business intelligence is sought, captured and used having tapped into an intranet data warehouse as a knowledge management approach. It adopts qualitative case study method using interviews and observation techniques. A case study was conducted to examine how an Intranet system was designed, how business intelligence was captured, and how it aided strategic planning and decision making in business operation. The respondents explained how structured business intelligence data was categorised and disseminated to users and how the used information empowered staff in their work performance. The intranet design successfully retains staff knowledge within the organisation. It was also successful in drawing all internal resources together, capturing resources from external sources, and forming a common repository of organisational assets for use through organisational work procedures within the intranet.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78428928","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 : 2014-09-04DOI: 10.5176/2010-2283_1.2.38
Vineetha Bettaiah, Thejaswi Raya, H. Ranganath, Siddharth Shivapuja
The algorithm used for the segmentation of an image, and scheme used for the representation of the segmentation result are mostly selected based on the final image analysis or interpretation objective. The boundary based image segmentation and representation system developed by Nabors segments and stores the result as a graph-tree hierarchical structure that is capable of supporting diverse applications. This paper shows that Nabors’ hierarchical representation of curves is not invariant to rotation, and proposes an enhanced representation which retains its structure and remains invariant under rotation. The curve matching algorithm which matches two curves based on their hierarchical representation makes it easy to determine if a curve is a section of a larger curve. The potential of the representation is illustrated by developing image registration and image stitching methods based on the new representation.
{"title":"Rotation independent hierarchical representation for Open and Closed Curves and its Applications","authors":"Vineetha Bettaiah, Thejaswi Raya, H. Ranganath, Siddharth Shivapuja","doi":"10.5176/2010-2283_1.2.38","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.38","url":null,"abstract":"The algorithm used for the segmentation of an image, and scheme used for the representation of the segmentation result are mostly selected based on the final image analysis or interpretation objective. The boundary based image segmentation and representation system developed by Nabors segments and stores the result as a graph-tree hierarchical structure that is capable of supporting diverse applications. This paper shows that Nabors’ hierarchical representation of curves is not invariant to rotation, and proposes an enhanced representation which retains its structure and remains invariant under rotation. The curve matching algorithm which matches two curves based on their hierarchical representation makes it easy to determine if a curve is a section of a larger curve. The potential of the representation is illustrated by developing image registration and image stitching methods based on the new representation.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90546263","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 : 2014-09-04DOI: 10.5176/2010-2283_1.2.37
Desmennu Senanu Rita, I. Nicholas
Information technology has improved operations management globally. The health sector has benefited from this revolution through the introduction of eHealth solutions. The cost-effective utilization of Information Technology and flexibility in adapting and adopting organizational changes has posed some challenges to health institutions in developing countries. In the case of Nigeria, the implementation of the National Health Policy entails the delivery of a full-packaged health care system; this package includes health education, maternal, newborn and child healthcare, nutrition and immunization. All these, require record keeping and data storage. The management of massive data storage and its availability on-demand has been sources of concern to health institutions in the country. This has brought about a slow rate in hospital-tohospital collaboration, insecure information exchange between and across institutions and lack of proper accountability in the health sector amongst other challenges. In this paper we propose a Cloud computing infrastructure which will adopt application virtualization to address the challenges in health care delivery in the country. This is an emerging technology that will provide eHealth solutions as services to tenants; a process known as Software-as-a- Service (SaaS). The infrastructure should deliver a single application through the browser to thousands of clients or stakeholders using scalable multitenant architecture. This will help to minimize cost, manage healthcare resources effectively, and help with the realization of the Millennium Development Goals (MDGs) on healthcare.
{"title":"Application Virtualization for Teaching Hospitals in Nigeria","authors":"Desmennu Senanu Rita, I. Nicholas","doi":"10.5176/2010-2283_1.2.37","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.37","url":null,"abstract":"Information technology has improved operations management globally. The health sector has benefited from this revolution through the introduction of eHealth solutions. The cost-effective utilization of Information Technology and flexibility in adapting and adopting organizational changes has posed some challenges to health institutions in developing countries. In the case of Nigeria, the implementation of the National Health Policy entails the delivery of a full-packaged health care system; this package includes health education, maternal, newborn and child healthcare, nutrition and immunization. All these, require record keeping and data storage. The management of massive data storage and its availability on-demand has been sources of concern to health institutions in the country. This has brought about a slow rate in hospital-tohospital collaboration, insecure information exchange between and across institutions and lack of proper accountability in the health sector amongst other challenges. In this paper we propose a Cloud computing infrastructure which will adopt application virtualization to address the challenges in health care delivery in the country. This is an emerging technology that will provide eHealth solutions as services to tenants; a process known as Software-as-a- Service (SaaS). The infrastructure should deliver a single application through the browser to thousands of clients or stakeholders using scalable multitenant architecture. This will help to minimize cost, manage healthcare resources effectively, and help with the realization of the Millennium Development Goals (MDGs) on healthcare.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75818652","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 : 2014-09-04DOI: 10.5176/2010-2283_1.2.34
Yin Ye, Zhihui Du, David A. Bader, Quan Yang, Weiwei Huo
In this paper, we present a GPU-based sorting algorithm, GPUMemSort, which achieves high performance in sorting large-scale in-memory data by take advantage of GPU processors. It consists of two algorithms: an in-core algorithm, which is responsible for sorting data in GPU global memory efficiently, and an out-of-core algorithm, which is responsible for dividing large-scale data into multiple chunks that fit GPU global memory. GPUMemSort is implemented based on NVIDIA’s CUDA framework and some critical and detailed optimization methods are also presented. The tests of different algorithms have been run on multiple data sets. The experimental results show that our in-core sorting can outperform other comparison-based algorithms and GPUMemSort is highly effective in sorting large-scale inmemory data.
{"title":"GPUMemSort: A High Performance Graphics Co-processors Sorting Algorithm for Large Scale In-Memory Data","authors":"Yin Ye, Zhihui Du, David A. Bader, Quan Yang, Weiwei Huo","doi":"10.5176/2010-2283_1.2.34","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.34","url":null,"abstract":"In this paper, we present a GPU-based sorting algorithm, GPUMemSort, which achieves high performance in sorting large-scale in-memory data by take advantage of GPU processors. It consists of two algorithms: an in-core algorithm, which is responsible for sorting data in GPU global memory efficiently, and an out-of-core algorithm, which is responsible for dividing large-scale data into multiple chunks that fit GPU global memory. GPUMemSort is implemented based on NVIDIA’s CUDA framework and some critical and detailed optimization methods are also presented. The tests of different algorithms have been run on multiple data sets. The experimental results show that our in-core sorting can outperform other comparison-based algorithms and GPUMemSort is highly effective in sorting large-scale inmemory data.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"78 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88373684","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 : 2014-09-04DOI: 10.5176/2010-2283_1.2.36
S. B. Dhok, R. Deshmukh, A. Keskar
The fractal coding is a novel technique for image compression. Though the technique has many attractive features, the large encoding time makes it unsuitable for real time applications. In this paper, an efficient algorithm for fractal encoding which operates on entire domain image instead of overlapping domain blocks is presented.The algorithm drastically reduces the encoding time as compared to classical full search method. The reduction in encoding time is mainly due to use of modified crosscorrelation based similarity measure. The implemented algorithm employs exhaustive search of domain blocks and their isometry transformations to investigate their similarity with every range block. The application of Fast Fourier Transform in similarity measure calculation speeds up the encoding process. The proposed eight isometry transformations of a domain block exploit the properties of Discrete Fourier Transform to minimize the number of Fast Fourier Transform calculations. The experimental studies on the proposed algorithm demonstrate that the encoding time is reduced drastically with average speedup factor of 538 with respect to the classical full search method with comparable values of Peak Signal To Noise Ratio.
{"title":"Efficient Fractal Image Coding using Fast Fourier Transform","authors":"S. B. Dhok, R. Deshmukh, A. Keskar","doi":"10.5176/2010-2283_1.2.36","DOIUrl":"https://doi.org/10.5176/2010-2283_1.2.36","url":null,"abstract":"The fractal coding is a novel technique for image compression. Though the technique has many attractive features, the large encoding time makes it unsuitable for real time applications. In this paper, an efficient algorithm for fractal encoding which operates on entire domain image instead of overlapping domain blocks is presented.The algorithm drastically reduces the encoding time as compared to classical full search method. The reduction in encoding time is mainly due to use of modified crosscorrelation based similarity measure. The implemented algorithm employs exhaustive search of domain blocks and their isometry transformations to investigate their similarity with every range block. The application of Fast Fourier Transform in similarity measure calculation speeds up the encoding process. The proposed eight isometry transformations of a domain block exploit the properties of Discrete Fourier Transform to minimize the number of Fast Fourier Transform calculations. The experimental studies on the proposed algorithm demonstrate that the encoding time is reduced drastically with average speedup factor of 538 with respect to the classical full search method with comparable values of Peak Signal To Noise Ratio.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"167 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88377308","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
扫码关注我们
求助内容：
应助结果提醒方式：