Pub Date : 2011-03-20DOI: 10.1109/ISCI.2011.5958906
Marwa Solla, A. Patel, Christopher Wills
Measuring programmer productivity is a challenging exercise because it is not well understood since it is without bounded rules and ill-defined meanings of complicated set of parameters. This is made worse by new software development paradigms such as agile and mashup methods and the ensuing advances in software engineering practices and ways of designing and developing software. The existing metrics for measuring performance of solo and pairs of programmers does not appear to be suitable to meet these new forms of software development. This paper presents a new metrics which can be used to measure performance productivity of programming effort by solo and pair programmers in a much more comprehensive manner. All of the key parameters are looked at objectively and defined for and from software engineering lifecycle points of view to make productivity performance calculations for solo and pair programmers. The methodology used for formulating and composing the formulae and defining the parameters as coefficients is explained. These parameters are based on a weighting system to derive the effective performance results. It is a more objective and quick way for the performance analysts to define a table of weights for the parameters based on several criteria within the different aspects of the software development lifecycle. The composition of the formulae and the metric for measuring programmer productivity performance is presented and examples are used to illustrate the method and the outcomes.
{"title":"New metric for measuring programmer productivity","authors":"Marwa Solla, A. Patel, Christopher Wills","doi":"10.1109/ISCI.2011.5958906","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958906","url":null,"abstract":"Measuring programmer productivity is a challenging exercise because it is not well understood since it is without bounded rules and ill-defined meanings of complicated set of parameters. This is made worse by new software development paradigms such as agile and mashup methods and the ensuing advances in software engineering practices and ways of designing and developing software. The existing metrics for measuring performance of solo and pairs of programmers does not appear to be suitable to meet these new forms of software development. This paper presents a new metrics which can be used to measure performance productivity of programming effort by solo and pair programmers in a much more comprehensive manner. All of the key parameters are looked at objectively and defined for and from software engineering lifecycle points of view to make productivity performance calculations for solo and pair programmers. The methodology used for formulating and composing the formulae and defining the parameters as coefficients is explained. These parameters are based on a weighting system to derive the effective performance results. It is a more objective and quick way for the performance analysts to define a table of weights for the parameters based on several criteria within the different aspects of the software development lifecycle. The composition of the formulae and the metric for measuring programmer productivity performance is presented and examples are used to illustrate the method and the outcomes.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116259020","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958987
M. A. Ayu, T. Mantoro, A. F. A. Matin, Saeed Salem Basamh
Activity recognition refers to the ability of a machine/device to recognize the activity of users. This area of research has attracted many works especially related to the context aware and ubiquitous computing area. Wearable accelerometers have been explored for this activity recognition purpose; however the impracticality of attaching accelerometers to the user presents significant issues. Accelerometers today are embedded in many mobile devices. This paper explores the potential and possibility of using these accelerometer data to determine user activity recognition. The initial experiments show encouraging results with a very good accuracy rate of 92%. A simple prototype developed supports the implementation of the recognition process conducted.
{"title":"Recognizing user activity based on accelerometer data from a mobile phone","authors":"M. A. Ayu, T. Mantoro, A. F. A. Matin, Saeed Salem Basamh","doi":"10.1109/ISCI.2011.5958987","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958987","url":null,"abstract":"Activity recognition refers to the ability of a machine/device to recognize the activity of users. This area of research has attracted many works especially related to the context aware and ubiquitous computing area. Wearable accelerometers have been explored for this activity recognition purpose; however the impracticality of attaching accelerometers to the user presents significant issues. Accelerometers today are embedded in many mobile devices. This paper explores the potential and possibility of using these accelerometer data to determine user activity recognition. The initial experiments show encouraging results with a very good accuracy rate of 92%. A simple prototype developed supports the implementation of the recognition process conducted.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133310372","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958949
R. Sridhar, S. Balasubramaniam
DNA computing is a new method of simulating biomolecular structure of DNA and computing by means of molecular biology technological computation. It introduces a fire-new data structure and calculating method, providing a new way of solving NP-complete problem of traveling salesman. It is a new computational method by harnessing the enormous parallel computing ability and high memory density of bio-molecules, which brings potential challenges and opportunities to cryptography, steganography, Signature and Authentication. In this paper, DNA computing is integrated with GIS to find shortest path of traveling salesman problem with geocomputational method and DNA Computing method without using laboratory. Both methods show the same result proving that problems of GIS could be solved using DNA computing.
{"title":"GIS integrated DNA computing for solving Travelling Salesman Problem","authors":"R. Sridhar, S. Balasubramaniam","doi":"10.1109/ISCI.2011.5958949","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958949","url":null,"abstract":"DNA computing is a new method of simulating biomolecular structure of DNA and computing by means of molecular biology technological computation. It introduces a fire-new data structure and calculating method, providing a new way of solving NP-complete problem of traveling salesman. It is a new computational method by harnessing the enormous parallel computing ability and high memory density of bio-molecules, which brings potential challenges and opportunities to cryptography, steganography, Signature and Authentication. In this paper, DNA computing is integrated with GIS to find shortest path of traveling salesman problem with geocomputational method and DNA Computing method without using laboratory. Both methods show the same result proving that problems of GIS could be solved using DNA computing.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133983520","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958994
S. Ong, D. Chai, A. Rassau
Business cards have existed since the 19th century and exchanging of business cards is common during introduction. The digital version, an electronic business card, helps to share information quickly and accurately. Also, it allows information to be stored and easily located. However, the current state of the art in business card readers using OCR technology usually fail in correctly reading all elements of the business card. Hence, in this paper, we proposed the use of an Mobile Multi-Colour Composite (MMCC) barcode printed on the business card. Containing the electronic version of the business card, the MMCC barcode allows cheap and accurate reading of the business card with a mobile phone camera. To highlight the effectiveness of the proposed method, we compared the results against commercially available business card readers, both in desktop and mobile versions.
{"title":"A robust mobile business card reader using MMCC barcode","authors":"S. Ong, D. Chai, A. Rassau","doi":"10.1109/ISCI.2011.5958994","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958994","url":null,"abstract":"Business cards have existed since the 19th century and exchanging of business cards is common during introduction. The digital version, an electronic business card, helps to share information quickly and accurately. Also, it allows information to be stored and easily located. However, the current state of the art in business card readers using OCR technology usually fail in correctly reading all elements of the business card. Hence, in this paper, we proposed the use of an Mobile Multi-Colour Composite (MMCC) barcode printed on the business card. Containing the electronic version of the business card, the MMCC barcode allows cheap and accurate reading of the business card with a mobile phone camera. To highlight the effectiveness of the proposed method, we compared the results against commercially available business card readers, both in desktop and mobile versions.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133076561","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958910
A. Farzamnia, S. Syed-Yusof, N. Fisal
There has been increasing usage of Multiple Description Coding (MDC) for error concealment in non ideal channels. This paper attempts to conceal the error and reconstruct the lost descriptions by combining MDC and LIoyd-max quantizer. At first original image downsampled to four subimages then by using wavelet transform each subimage is mapped to transform domain then descriptions are quantized by LIoyd-max and coded. Since in proposed method wavelet transform is been used, there could be no blocking effect as compared to DCT transform. The results show that average MSE (mean square error) for our proposed method in comparison with DCT method (in other paper) has decreased from 240 to 152 in 0.625 bpp (bit per pixel), from 161 to 107 in 1 bpp and from 96 to 73 in 2 bpp in rate-distortion performance. Therefore, this method is suitable for low capacity channels. By losing descriptions, the obtained image is still in good quality (subjective evaluation and PSNR values) as compared to a method which is DCT and MDSQ (multiple description scalar quantization).
{"title":"Error concealment using multiple description coding and LIoyd-max quantization","authors":"A. Farzamnia, S. Syed-Yusof, N. Fisal","doi":"10.1109/ISCI.2011.5958910","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958910","url":null,"abstract":"There has been increasing usage of Multiple Description Coding (MDC) for error concealment in non ideal channels. This paper attempts to conceal the error and reconstruct the lost descriptions by combining MDC and LIoyd-max quantizer. At first original image downsampled to four subimages then by using wavelet transform each subimage is mapped to transform domain then descriptions are quantized by LIoyd-max and coded. Since in proposed method wavelet transform is been used, there could be no blocking effect as compared to DCT transform. The results show that average MSE (mean square error) for our proposed method in comparison with DCT method (in other paper) has decreased from 240 to 152 in 0.625 bpp (bit per pixel), from 161 to 107 in 1 bpp and from 96 to 73 in 2 bpp in rate-distortion performance. Therefore, this method is suitable for low capacity channels. By losing descriptions, the obtained image is still in good quality (subjective evaluation and PSNR values) as compared to a method which is DCT and MDSQ (multiple description scalar quantization).","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134456453","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958983
K. Staniec, G. Debita
In the paper three most popular methods for spanning the wireless sensor networks (WSN) have been studied with respect to their offered reliability and intra-network radio interference. The authors proposed an algorithm for creating fully planar and reliable WSN structures that, unlike the other algorithms, considerably increase the Signal-To-Noise and Interference (SNIR) ratio in mesh networks, which advantage is particularly emphasized when directional antennas are used. Next, the influence of the number of sink nodes has been studied which ended with conclusion that a properly chosen sink nodes configuration may remarkably extend the network lifetime by bringing the number of necessary hops minimum.
{"title":"Studies on the planarity, reliability and energetic efficiency in wireless sensor networks","authors":"K. Staniec, G. Debita","doi":"10.1109/ISCI.2011.5958983","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958983","url":null,"abstract":"In the paper three most popular methods for spanning the wireless sensor networks (WSN) have been studied with respect to their offered reliability and intra-network radio interference. The authors proposed an algorithm for creating fully planar and reliable WSN structures that, unlike the other algorithms, considerably increase the Signal-To-Noise and Interference (SNIR) ratio in mesh networks, which advantage is particularly emphasized when directional antennas are used. Next, the influence of the number of sink nodes has been studied which ended with conclusion that a properly chosen sink nodes configuration may remarkably extend the network lifetime by bringing the number of necessary hops minimum.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132910246","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958873
N. T. Yallaparagada, Gopi Ram Hardel, D. Mandal, A. Bhattacharjee
In this paper, the method of imposing of nulls in the radiation pattern of an antenna array is hashed out using Real coded Genetic Algorithm (RGA). Circular array antennas lying on x-y plane is assumed. The array is assumed to have the maximum radiation along positive z-axis. Single and multiple nulls are imposed by optimizing the current amplitude excitations of each element through RGA. Various simulated results are presented and hence nulling performance is analyzed.
{"title":"Genetic Algorithm for null synthesizing of circular array antennas by amplitude control","authors":"N. T. Yallaparagada, Gopi Ram Hardel, D. Mandal, A. Bhattacharjee","doi":"10.1109/ISCI.2011.5958873","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958873","url":null,"abstract":"In this paper, the method of imposing of nulls in the radiation pattern of an antenna array is hashed out using Real coded Genetic Algorithm (RGA). Circular array antennas lying on x-y plane is assumed. The array is assumed to have the maximum radiation along positive z-axis. Single and multiple nulls are imposed by optimizing the current amplitude excitations of each element through RGA. Various simulated results are presented and hence nulling performance is analyzed.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"78 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116802143","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5959021
J. Cullen, A. Mason, M. Al-Jader, N. Wylie, A. Shaw, A. Al-Shamma'a
Resistance welding is used extensively in manufacturing industries, the most popular being spot welding in the automotive industry. Despite spot welding being in use for over a century, there has been relatively little development of sensors for monitoring the process in real-time. Most existing systems use current, voltage and electrode force to give an indication of welding quality, however these systems do not provide warning of changes in the welding environment. These changes could include material variability or electrode condition, which could result in weak weld nuggets. Presented in this paper is an investigation of a system that utilises an array of sensors, including current, voltage, infrared and ultrasonic that is capable of monitoring the spot welding process as it is performed. This system utilises wireless sensor technology to transmit data from the welding arms to a sensor connected to a base computer where the data can be analysed. The wireless link is particularly useful when retrofitting the sensor cluster to existing installations.
{"title":"Multi-sensor spot welding monitor using wireless sensor network technology","authors":"J. Cullen, A. Mason, M. Al-Jader, N. Wylie, A. Shaw, A. Al-Shamma'a","doi":"10.1109/ISCI.2011.5959021","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5959021","url":null,"abstract":"Resistance welding is used extensively in manufacturing industries, the most popular being spot welding in the automotive industry. Despite spot welding being in use for over a century, there has been relatively little development of sensors for monitoring the process in real-time. Most existing systems use current, voltage and electrode force to give an indication of welding quality, however these systems do not provide warning of changes in the welding environment. These changes could include material variability or electrode condition, which could result in weak weld nuggets. Presented in this paper is an investigation of a system that utilises an array of sensors, including current, voltage, infrared and ultrasonic that is capable of monitoring the spot welding process as it is performed. This system utilises wireless sensor technology to transmit data from the welding arms to a sensor connected to a base computer where the data can be analysed. The wireless link is particularly useful when retrofitting the sensor cluster to existing installations.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"593 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116553158","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5959000
D. Bansal, S. Sofat, Prafulla Kumar
To deter internal attacks, Intrusion Detection Systems are the most favorable solutions for detecting intrusions and raising alerts for desired action since using encryption software for secure communication is not enough. A number of intrusion detection systems have been proposed for ad-hoc networks. Such intrusion detection systems cannot perform well for wireless mesh networks due to its multihop decentralized architecture. The selection of optimal and secure routing path and detection of multilayer security attacks cannot be achieved using traditional single layer IDS. Most of the MAC layer attacks occur due to non compliance of protocols by the nodes. Such a malicious behavior cannot be detected using conventional IDS. In this paper, a Cross Layer based Intrusion detection system has been proposed which takes advantage of the information available across different layers of protocol by activating multiple layer monitoring and detection. The proposed Cross layer based IDS is novel in its architecture and is able to detect multi layer attacks of compound nature. It can also detect low intensity attacks and attack switching behaviors which have been the major shortcoming of most of the existing IDS for Wireless Networks.
{"title":"Distributed cross layer approach for detecting multilayer attacks in wireless multi-hop networks","authors":"D. Bansal, S. Sofat, Prafulla Kumar","doi":"10.1109/ISCI.2011.5959000","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5959000","url":null,"abstract":"To deter internal attacks, Intrusion Detection Systems are the most favorable solutions for detecting intrusions and raising alerts for desired action since using encryption software for secure communication is not enough. A number of intrusion detection systems have been proposed for ad-hoc networks. Such intrusion detection systems cannot perform well for wireless mesh networks due to its multihop decentralized architecture. The selection of optimal and secure routing path and detection of multilayer security attacks cannot be achieved using traditional single layer IDS. Most of the MAC layer attacks occur due to non compliance of protocols by the nodes. Such a malicious behavior cannot be detected using conventional IDS. In this paper, a Cross Layer based Intrusion detection system has been proposed which takes advantage of the information available across different layers of protocol by activating multiple layer monitoring and detection. The proposed Cross layer based IDS is novel in its architecture and is able to detect multi layer attacks of compound nature. It can also detect low intensity attacks and attack switching behaviors which have been the major shortcoming of most of the existing IDS for Wireless Networks.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115491064","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 : 2011-03-20DOI: 10.1109/ISCI.2011.5958944
A. Yousofi, M. Banitaba, Saeed Yazdanpanah
The World Wide Web is fundamental infrastructure for different services. The number of accessing to web sites is significantly increasing. Cluster-based web systems (web-cluster) are a new solution to implement a web server system with high efficiency and availability. In practice, a web cluster consists of several web servers, and a web switch which distributes user's requests among server nodes. Achieving high efficiency from web cluster requires load balancing between web servers. In this paper, we propose a novel dispatching policy, namely Multi-Class Round Robin with Congestion Control and Cost Reduction (MC-RR-CC-CR), for web switches operating at layer 7 of the OSI protocol stack. The results of a real scenario showed that the proposed method can significantly balance the load of web cluster and substantially improve the system efficiency. Particularly when web cluster is heterogeneous and web site content is dynamic.
{"title":"A novel method for achieving load balancing in web clusters based on congestion control and cost reduction","authors":"A. Yousofi, M. Banitaba, Saeed Yazdanpanah","doi":"10.1109/ISCI.2011.5958944","DOIUrl":"https://doi.org/10.1109/ISCI.2011.5958944","url":null,"abstract":"The World Wide Web is fundamental infrastructure for different services. The number of accessing to web sites is significantly increasing. Cluster-based web systems (web-cluster) are a new solution to implement a web server system with high efficiency and availability. In practice, a web cluster consists of several web servers, and a web switch which distributes user's requests among server nodes. Achieving high efficiency from web cluster requires load balancing between web servers. In this paper, we propose a novel dispatching policy, namely Multi-Class Round Robin with Congestion Control and Cost Reduction (MC-RR-CC-CR), for web switches operating at layer 7 of the OSI protocol stack. The results of a real scenario showed that the proposed method can significantly balance the load of web cluster and substantially improve the system efficiency. Particularly when web cluster is heterogeneous and web site content is dynamic.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115706954","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
扫码关注我们
求助内容：
应助结果提醒方式：