Pub Date : 2011-03-05DOI: 10.5220/0003371103970404
B. Girau, N. Vlassopoulos
Generating multiple random numbers in a parallel fashion for scientific simulations is an intense task that requires significant hardware resources. In our present work we focus on an existing Cellular Automaton and present an efficient architecture that reuses this CA to generate pseudo random numbers in a two dimensional context.
{"title":"Tiled Cellular Automata for Area-efficient Distributed Random Number Generators","authors":"B. Girau, N. Vlassopoulos","doi":"10.5220/0003371103970404","DOIUrl":"https://doi.org/10.5220/0003371103970404","url":null,"abstract":"Generating multiple random numbers in a parallel fashion for scientific simulations is an intense task that requires significant hardware resources. In our present work we focus on an existing Cellular Automaton and present an efficient architecture that reuses this CA to generate pseudo random numbers in a two dimensional context.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115594107","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-01DOI: 10.5220/0003313203270332
Tareq Jaber, A. Amira, P. Milligan
Latent semantic indexing (LSI) is commonly used to match queries to documents in information retrieval (IR) applications. It has been shown to improve the retrieval performance, as it can deal with synonymy and polysemy problems. This paper proposes a hybrid approach which can improve result accuracy significantly. Evaluation of the approach based on using the Haar wavelet transform (HWT) as a preprocessing step for the singular value decomposition (SVD) in the LSI system is presented, using Donoho′s thresholding with the transformation in HWT. Furthermore, the effect of different levels of decomposition in the HWT process is investigated. The experimental results presented in the paper confirm a significant improvement in performance by applying the HWT as a preprocessing step using Donoho′s thresholding.
{"title":"Latent Semantic Indexing using Multiresolution Analysis","authors":"Tareq Jaber, A. Amira, P. Milligan","doi":"10.5220/0003313203270332","DOIUrl":"https://doi.org/10.5220/0003313203270332","url":null,"abstract":"Latent semantic indexing (LSI) is commonly used to match queries to documents in information retrieval (IR) applications. It has been shown to improve the retrieval performance, as it can deal with synonymy and polysemy problems. This paper proposes a hybrid approach which can improve result accuracy significantly. Evaluation of the approach based on using the Haar wavelet transform (HWT) as a preprocessing step for the singular value decomposition (SVD) in the LSI system is presented, using Donoho′s thresholding with the transformation in HWT. Furthermore, the effect of different levels of decomposition in the HWT process is investigated. The experimental results presented in the paper confirm a significant improvement in performance by applying the HWT as a preprocessing step using Donoho′s thresholding.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116259839","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 : 1900-01-01DOI: 10.5220/0003826400210028
Tetsushi Ikeda, H. Ishiguro, T. Miyashita, N. Hagita
Providing personal and location-dependent services is one of the promising services in public spaces like a shopping mall. So far, sensors in the environment have reliably detected the current positions of humans, but it is difficult to identify people using these sensors. On the other hand, wearable devices can send their personal identity information, but precise position estimation remains problematic. In this paper, we propose a novel method of integrating laser range finders (LRFs) in the environment and wearable accelerometers. The legs of pedestrians in the environment are tracked by using LRFs, and acceleration signals from pedestrians are simultaneously observed. Since the tracking results of biped feet and the body oscillation of the same pedestrian show same walking rhythm patterns, we associate these signals from same pedestrian that maximizes correlation between them and identify the pedestrian. Example results of tracking individuals in the environment confirm the effectiveness of this method.
{"title":"Pedestrian Identification by Associating Walking Rhythms from Wearable Acceleration Sensors and Biped Tracking Results","authors":"Tetsushi Ikeda, H. Ishiguro, T. Miyashita, N. Hagita","doi":"10.5220/0003826400210028","DOIUrl":"https://doi.org/10.5220/0003826400210028","url":null,"abstract":"Providing personal and location-dependent services is one of the promising services in public spaces like a shopping mall. So far, sensors in the environment have reliably detected the current positions of humans, but it is difficult to identify people using these sensors. On the other hand, wearable devices can send their personal identity information, but precise position estimation remains problematic. In this paper, we propose a novel method of integrating laser range finders (LRFs) in the environment and wearable accelerometers. The legs of pedestrians in the environment are tracked by using LRFs, and acceleration signals from pedestrians are simultaneously observed. Since the tracking results of biped feet and the body oscillation of the same pedestrian show same walking rhythm patterns, we associate these signals from same pedestrian that maximizes correlation between them and identify the pedestrian. Example results of tracking individuals in the environment confirm the effectiveness of this method.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115159589","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 : 1900-01-01DOI: 10.5220/0003366702010206
R. Ureña, P. Martínez-Cañada, J. M. Gómez-López, C. Morillas, F. Pelayo
The purpose of this work is to describe a customizable aid system based on GPU for low vision. The system aims to transform images taken from the patient's environment and tries to convey the best information possible through his visual rest, applying various transformations to the input image and projecting the processed image on a head-mounted-display, HMD. The system easily enables implementing and testing different kinds of vision enhancements adapted to the pathologies of each low vision affected, his particular visual field, and the evolution of his disease. We have implemented several types of visual enhancements based on extracting an overlaying edges, image filtering, and contrast enhancement. We have developed a complete image processing library for GPUs compatible with CUDA in order the system can perform real time processing employing a light-weight netbook with an integrated GPU NVIDIA ION2. We briefly summarize here their computational cost (in terms of processed frames per second) for three different
{"title":"A Portable Low Vision Aid based on GPU","authors":"R. Ureña, P. Martínez-Cañada, J. M. Gómez-López, C. Morillas, F. Pelayo","doi":"10.5220/0003366702010206","DOIUrl":"https://doi.org/10.5220/0003366702010206","url":null,"abstract":"The purpose of this work is to describe a customizable aid system based on GPU for low vision. The system aims to transform images taken from the patient's environment and tries to convey the best information possible through his visual rest, applying various transformations to the input image and projecting the processed image on a head-mounted-display, HMD. The system easily enables implementing and testing different kinds of vision enhancements adapted to the pathologies of each low vision affected, his particular visual field, and the evolution of his disease. We have implemented several types of visual enhancements based on extracting an overlaying edges, image filtering, and contrast enhancement. We have developed a complete image processing library for GPUs compatible with CUDA in order the system can perform real time processing employing a light-weight netbook with an integrated GPU NVIDIA ION2. We briefly summarize here their computational cost (in terms of processed frames per second) for three different","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115362276","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 : 1900-01-01DOI: 10.5220/0006915501850194
Nasrine Damouche, M. Martel
Precision tuning consists of finding the least floating-point formats enabling a program to compute some results with an accuracy requirement. In mixed precision, this problem has a huge combinatory since any value may have its own format. Precision tuning has given rise to the development of several tools that aim at guarantying a desired precision on the outputs of programs doing floating-point computations, by minimizing the initial, over-estimated, precision of the inputs and intermediary results. In this article, we present an extension of our tool for numerical accuracy, Salsa, which performs precision tuning. Originally, Salsa is a program transformation tool based on static analysis and which improves the accuracy of floating-point computations. We have extended Salsa with a precision tuning static analysis. We present experimental results showing the efficiency of this new feature as well as the additional gains that we obtain by performing Salsa’s program transformation before the precision tuning analysis. We experiment our tool on a set of programs coming from various domains like embedded systems and numerical analysis.
{"title":"Mixed Precision Tuning with Salsa","authors":"Nasrine Damouche, M. Martel","doi":"10.5220/0006915501850194","DOIUrl":"https://doi.org/10.5220/0006915501850194","url":null,"abstract":"Precision tuning consists of finding the least floating-point formats enabling a program to compute some results with an accuracy requirement. In mixed precision, this problem has a huge combinatory since any value may have its own format. Precision tuning has given rise to the development of several tools that aim at guarantying a desired precision on the outputs of programs doing floating-point computations, by minimizing the initial, over-estimated, precision of the inputs and intermediary results. In this article, we present an extension of our tool for numerical accuracy, Salsa, which performs precision tuning. Originally, Salsa is a program transformation tool based on static analysis and which improves the accuracy of floating-point computations. We have extended Salsa with a precision tuning static analysis. We present experimental results showing the efficiency of this new feature as well as the additional gains that we obtain by performing Salsa’s program transformation before the precision tuning analysis. We experiment our tool on a set of programs coming from various domains like embedded systems and numerical analysis.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116644478","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 : 1900-01-01DOI: 10.5220/0004307400350041
G. Khan, M. Z. Ali
Wireless Sensor Network (WSN) is a promising solution for next generation real-time monitoring applications due to its ubiquitous nature, ease of deployment and wide range of applications. The main requirements of a secure WSN architecture are confidentiality, integrity and authentication. User Authentication for wireless sensor networks is a fundamental issue in designing secure WSN systems, where legitimate users are allowed to login and access data from the sensor and gateway nodes. A large number of dynamic strong password and two-factor authentication solutions have been proposed. However, all of these protocols rely on network synchronization and suffer from replay and many logged in users with same login ID threats. We present a secure authentication protocol that avoids replay and multiple login attacks. Our scheme eliminates the need for network synchronization. The scheme is analysed and evaluated for various attacks using SystemC and it provides enhanced security for no extra computing at sensor nodes.
{"title":"Password based Secure Authentication Methodology for Wireless Sensor Network","authors":"G. Khan, M. Z. Ali","doi":"10.5220/0004307400350041","DOIUrl":"https://doi.org/10.5220/0004307400350041","url":null,"abstract":"Wireless Sensor Network (WSN) is a promising solution for next generation real-time monitoring applications due to its ubiquitous nature, ease of deployment and wide range of applications. The main requirements of a secure WSN architecture are confidentiality, integrity and authentication. User Authentication for wireless sensor networks is a fundamental issue in designing secure WSN systems, where legitimate users are allowed to login and access data from the sensor and gateway nodes. A large number of dynamic strong password and two-factor authentication solutions have been proposed. However, all of these protocols rely on network synchronization and suffer from replay and many logged in users with same login ID threats. We present a secure authentication protocol that avoids replay and multiple login attacks. Our scheme eliminates the need for network synchronization. The scheme is analysed and evaluated for various attacks using SystemC and it provides enhanced security for no extra computing at sensor nodes.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"20 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126093326","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 : 1900-01-01DOI: 10.5220/0003813603030307
V. K. Pamula, S. R. Vempati, S. Balaji, H. Khan, A. K. Tipparti
This paper presents a robust multiuser detection technique to combat multiple access interference (MAI) and impulsive noise for synchronous code-division multiple-access (CDMA) communication systems in the presence of signature uncertainties. A new M-estimator (modified Hampel) proposed to robustify the detector is studied and analyzed. The approach is corroborated with simulation results to evaluate the performance of the proposed robust multiuser detector in comparison with the linear decorrelating detector, Huber and Hampel estimator based detectors. Simulation results show that the new M-estimator based detector offers significant performance gain over the linear decorrelating detector, the Huber, and the Hampel estimator based detectors with little attendant increase in the computational complexity.
{"title":"A Robust Technique for Multiuser Detection in the Presence of Signature Uncertainties","authors":"V. K. Pamula, S. R. Vempati, S. Balaji, H. Khan, A. K. Tipparti","doi":"10.5220/0003813603030307","DOIUrl":"https://doi.org/10.5220/0003813603030307","url":null,"abstract":"This paper presents a robust multiuser detection technique to combat multiple access interference (MAI) and impulsive noise for synchronous code-division multiple-access (CDMA) communication systems in the presence of signature uncertainties. A new M-estimator (modified Hampel) proposed to robustify the detector is studied and analyzed. The approach is corroborated with simulation results to evaluate the performance of the proposed robust multiuser detector in comparison with the linear decorrelating detector, Huber and Hampel estimator based detectors. Simulation results show that the new M-estimator based detector offers significant performance gain over the linear decorrelating detector, the Huber, and the Hampel estimator based detectors with little attendant increase in the computational complexity.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125342762","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 : 1900-01-01DOI: 10.5220/0003371604050412
A. Shahrabi, A. Ahmadinia
Efficient buffer management is not only instrumental in the overall performance of the on-chip networks but also greatly affects the network energy consumption. In fact, any improvement or deterioration of network performance and energy budget is the net result of increasing buffer utilisation (storing blocked flits) and reducing buffer utilisation (delivering buffered flits). In order to improve the network performance and efficiently utilising the available routers buffer space in NoCs, a new router architecture, called PoolBuffering (PB), is proposed in this paper. By exploiting a flexible ring buffer structure, the buffer space of the proposed architecture is shared amongst all input channels; allocating more buffer to the busy input channels and less to the idle ones. Implementation results show up to 50% in reducing power consumption when compared to a traditional router. Moreover, our extensive simulation study shows that the proposed router architecture enhances the network performance by increasing the acceptance traffic rate and decreasing the average message latency.
{"title":"An Efficient Router Architecture for Network on Chip","authors":"A. Shahrabi, A. Ahmadinia","doi":"10.5220/0003371604050412","DOIUrl":"https://doi.org/10.5220/0003371604050412","url":null,"abstract":"Efficient buffer management is not only instrumental in the overall performance of the on-chip networks but also greatly affects the network energy consumption. In fact, any improvement or deterioration of network performance and energy budget is the net result of increasing buffer utilisation (storing blocked flits) and reducing buffer utilisation (delivering buffered flits). In order to improve the network performance and efficiently utilising the available routers buffer space in NoCs, a new router architecture, called PoolBuffering (PB), is proposed in this paper. By exploiting a flexible ring buffer structure, the buffer space of the proposed architecture is shared amongst all input channels; allocating more buffer to the busy input channels and less to the idle ones. Implementation results show up to 50% in reducing power consumption when compared to a traditional router. Moreover, our extensive simulation study shows that the proposed router architecture enhances the network performance by increasing the acceptance traffic rate and decreasing the average message latency.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116130434","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 : 1900-01-01DOI: 10.5220/0003362004450450
M. Baier, S. Foret, V. O. Kunnil, M. Paradis, P. Bustos, Samson Mil'shtein
Increased security requirements relevant to the worldwide war against terrorism and cyber crime recently prompted the development of biometric systems for use in identifying individuals at commercial facilities, border crossings, airports, and government building access points. Fingerprinting is one of the oldest means of biometric identification; however, the current methods of fingerprint capture carry inherent limitations on image quality. The current study describes the development of a novel, mobile, and contactless fingerprinting system. This system combines the advantages of contactless fingerprinting with the ability to create a digital map of the blood vessels within a finger for use as a second data set for use in biometric identification. The distinguishing feature of the system is the use of line scanning technology which allows for the acquisition of nearly distortion-less 180 or “nail-to-nail” fingerprints. The study describes a fully automatic system and assesses the technical aspects of this novel device. We describe the design of the subsystems: adaptive lighting, optical image formation, power management methods, wireless data transfer, and subsystem synchronization techniques. We will also discuss the system’s embedded software, which synchronizes the operation of all subsystems and allows for fingerprint visualization on an onboard touch
{"title":"Automatic Contactless Mobile Fingerprinting System","authors":"M. Baier, S. Foret, V. O. Kunnil, M. Paradis, P. Bustos, Samson Mil'shtein","doi":"10.5220/0003362004450450","DOIUrl":"https://doi.org/10.5220/0003362004450450","url":null,"abstract":"Increased security requirements relevant to the worldwide war against terrorism and cyber crime recently prompted the development of biometric systems for use in identifying individuals at commercial facilities, border crossings, airports, and government building access points. Fingerprinting is one of the oldest means of biometric identification; however, the current methods of fingerprint capture carry inherent limitations on image quality. The current study describes the development of a novel, mobile, and contactless fingerprinting system. This system combines the advantages of contactless fingerprinting with the ability to create a digital map of the blood vessels within a finger for use as a second data set for use in biometric identification. The distinguishing feature of the system is the use of line scanning technology which allows for the acquisition of nearly distortion-less 180 or “nail-to-nail” fingerprints. The study describes a fully automatic system and assesses the technical aspects of this novel device. We describe the design of the subsystems: adaptive lighting, optical image formation, power management methods, wireless data transfer, and subsystem synchronization techniques. We will also discuss the system’s embedded software, which synchronizes the operation of all subsystems and allows for fingerprint visualization on an onboard touch","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144717","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 : 1900-01-01DOI: 10.5220/0004330702080213
S. Oikawa
Non-volatile (NV) memory is next generation memory. It provides fast access speed comparable to DRAM and also persistently stores data without power supply. These features enable NV memory to be used as both main memory and secondary storage. While the active researches have been conducted on its use for either main memory or secondary storage, they were conducted independently. This paper proposes the integrated memory management methods, by which NV memory can be used as both main memory and secondary storage. The proposed methods use file systems as their basis for NV memory management. Such integration enables the memory allocation for processes and files from the same source, and processes can take advantage of a large amount of physical memory used for both main memory and storage. We implemented the proposed memory management methods in the Linux kernel. The evaluation results performed on a system emulator show that the memory allocation costs of the proposed methods are comparable to that of the existing DRAM and are significantly better than those of the page swapping.
{"title":"Using File Systems for Non-volatile Main Memory Management","authors":"S. Oikawa","doi":"10.5220/0004330702080213","DOIUrl":"https://doi.org/10.5220/0004330702080213","url":null,"abstract":"Non-volatile (NV) memory is next generation memory. It provides fast access speed comparable to DRAM and also persistently stores data without power supply. These features enable NV memory to be used as both main memory and secondary storage. While the active researches have been conducted on its use for either main memory or secondary storage, they were conducted independently. This paper proposes the integrated memory management methods, by which NV memory can be used as both main memory and secondary storage. The proposed methods use file systems as their basis for NV memory management. Such integration enables the memory allocation for processes and files from the same source, and processes can take advantage of a large amount of physical memory used for both main memory and storage. We implemented the proposed memory management methods in the Linux kernel. The evaluation results performed on a system emulator show that the memory allocation costs of the proposed methods are comparable to that of the existing DRAM and are significantly better than those of the page swapping.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116607196","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}