In our paper we consider the comparison performance of wireless sensor network to optimize the event detection and TDMA schemes using cross layer interaction. We consider the accuracy and lifetime of WSN because accuracy and lifetime are the important parameters of wireless sensor network because working of system depends upon it. Lifetime maximization relates with various factors such as throughput, end to end delay, lifetime parameter such as time, output, packet delivery rates, no. of nodes, nodes efficiency, operating frequency to operate and relate each parameter. It is very difficult to study and compare all the above parameters simultaneously in the Wireless Sensor Network. So throughput is end to end delay or packet delivery of nodes can be verified any improvement in one of the parameter so that it can optimized the operation capability of the whole wireless network. Depending upon the no. of nodes corresponding hoping is developed. Routing through no. of hopes can disturbed the lifetime of WSN.
{"title":"Lifetime Maximization in Wireless Sensor Network Using Cross Layer Design: A Design Review","authors":"Manisha S. Masurkar, G. Asutkar, K. Kulat","doi":"10.1109/ICETET.2008.142","DOIUrl":"https://doi.org/10.1109/ICETET.2008.142","url":null,"abstract":"In our paper we consider the comparison performance of wireless sensor network to optimize the event detection and TDMA schemes using cross layer interaction. We consider the accuracy and lifetime of WSN because accuracy and lifetime are the important parameters of wireless sensor network because working of system depends upon it. Lifetime maximization relates with various factors such as throughput, end to end delay, lifetime parameter such as time, output, packet delivery rates, no. of nodes, nodes efficiency, operating frequency to operate and relate each parameter. It is very difficult to study and compare all the above parameters simultaneously in the Wireless Sensor Network. So throughput is end to end delay or packet delivery of nodes can be verified any improvement in one of the parameter so that it can optimized the operation capability of the whole wireless network. Depending upon the no. of nodes corresponding hoping is developed. Routing through no. of hopes can disturbed the lifetime of WSN.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124964321","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}
The transmission control protocol (TCP) was designed to provide reliable end to end delivery of data over unreliable networks. Ignoring the properties of wireless adhoc networks can lead to poor TCP implementation. Therefore several transport layer protocol have been designed exclusively for adhoc network such as ATCP, ATP, TPA etc. Out of these protocols ATP finds to be more suitable for adhoc network. In ATP, the performance of sending TCP is concentrated but the performance and load of the intermediate node is not taken in to account while designing it. In this paper a simple approach is proposed to address the intermediate node problem by making it to operate in three layers rather than operating in four layers. This enhanced ATP is called as PATPAN.
{"title":"PATPAN: Power Aware Transport Protocol for Adhoc Networks","authors":"P. Ganeshkumar, K. Thyagarajah","doi":"10.1109/ICETET.2008.210","DOIUrl":"https://doi.org/10.1109/ICETET.2008.210","url":null,"abstract":"The transmission control protocol (TCP) was designed to provide reliable end to end delivery of data over unreliable networks. Ignoring the properties of wireless adhoc networks can lead to poor TCP implementation. Therefore several transport layer protocol have been designed exclusively for adhoc network such as ATCP, ATP, TPA etc. Out of these protocols ATP finds to be more suitable for adhoc network. In ATP, the performance of sending TCP is concentrated but the performance and load of the intermediate node is not taken in to account while designing it. In this paper a simple approach is proposed to address the intermediate node problem by making it to operate in three layers rather than operating in four layers. This enhanced ATP is called as PATPAN.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124797272","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}
Agent technology is a software entity with self-adaptation and intelligence that can accomplish a task by means of initiative service on behalf of users. The purpose of this paper is to formulate a functional architecture that supports the e-learning objectives: study individually and cooperatively, anytime and anywhere, guide specific individuals to their most relevant community. In order to make the work more efficient and to improve the performance an answering system is designed that does an intelligent search using algorithms like full text based search, word segmentation and fuzzy search. It displays the result by analyzing the userpsilas profile, experience and users needs so that the he is fully satisfied. It is made possible using case base reasoning (CBR) technique. A decentralized search engine is also built on top of grid technology with the help of software agents that allows the user to search through heterogeneous resources stored in geographically distributed digital collections.
{"title":"Design of an Intelligent Answering System Through Agent Based Search Engine Using Grid Technology","authors":"D. Jayalatchumy, D. Kadhirvelu, P. Ramkumar","doi":"10.1109/ICETET.2008.29","DOIUrl":"https://doi.org/10.1109/ICETET.2008.29","url":null,"abstract":"Agent technology is a software entity with self-adaptation and intelligence that can accomplish a task by means of initiative service on behalf of users. The purpose of this paper is to formulate a functional architecture that supports the e-learning objectives: study individually and cooperatively, anytime and anywhere, guide specific individuals to their most relevant community. In order to make the work more efficient and to improve the performance an answering system is designed that does an intelligent search using algorithms like full text based search, word segmentation and fuzzy search. It displays the result by analyzing the userpsilas profile, experience and users needs so that the he is fully satisfied. It is made possible using case base reasoning (CBR) technique. A decentralized search engine is also built on top of grid technology with the help of software agents that allows the user to search through heterogeneous resources stored in geographically distributed digital collections.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123844295","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}
The essential problem in controlling robots is to make the manipulator follow a desired trajectory. This paper presents the genetic algorithm tuned fuzzy PID controller (GAFPID) to follow the desired trajectory for a three degree of freedom (DOF) robot arm. Numerical simulation using the dynamic model of three DOF robot arm shows the effectiveness of the approach in trajectory tracking problems. Comparative evaluation with respect to PD, PID and fuzzy PID controls are presented to validate the controller design. The results presented emphasize that a satisfactory tracking precision could be achieved using the proposed controller than conventional controller.
{"title":"Genetic Fuzzy Based Tracking Control of 3 DOF Robot Arm","authors":"Srinivasan Alavandar, M. Nigam","doi":"10.1109/ICETET.2008.75","DOIUrl":"https://doi.org/10.1109/ICETET.2008.75","url":null,"abstract":"The essential problem in controlling robots is to make the manipulator follow a desired trajectory. This paper presents the genetic algorithm tuned fuzzy PID controller (GAFPID) to follow the desired trajectory for a three degree of freedom (DOF) robot arm. Numerical simulation using the dynamic model of three DOF robot arm shows the effectiveness of the approach in trajectory tracking problems. Comparative evaluation with respect to PD, PID and fuzzy PID controls are presented to validate the controller design. The results presented emphasize that a satisfactory tracking precision could be achieved using the proposed controller than conventional controller.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129566227","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}
There is a growing need for industries to become accountable for their actions towards the environment. In order to make it possible, it is required to develop comprehensive, integrated and progressive environmental policies. These environmental policies would maintain dynamic environmental equilibrium. Today there is requirement by the National and International bodies to have standardised environmental management systems (EMS). These systems would keep the records of all environmental issues pertaining to the organisation. The EMS is made simple through the introduction of the ISO 14000 series. ISO 14000 provides guidelines on how to successfully manage and reduce environmental impacts through management functions, while at the same time allowing for high levels of socioeconomic growth and dedication to sustainable development. The implementation of EMS through ISO 14000 series would involve the expenditure. Every organisation is interested in economic aspects before the implementation of any system. They want that the system should provide the financial benefits, which will motivate to keep going on. This paper discusses economic aspects for the implementation of ISO 14000 an EMS tool in any organization with the help of cost of environment concept. The paper presents the concept of quality cost being applied to justify the implementation of EMS.
{"title":"Economics of Environment Management System: A Quality Cost Perspective","authors":"S. Jaju, R. P. Mohanty","doi":"10.1109/ICETET.2008.100","DOIUrl":"https://doi.org/10.1109/ICETET.2008.100","url":null,"abstract":"There is a growing need for industries to become accountable for their actions towards the environment. In order to make it possible, it is required to develop comprehensive, integrated and progressive environmental policies. These environmental policies would maintain dynamic environmental equilibrium. Today there is requirement by the National and International bodies to have standardised environmental management systems (EMS). These systems would keep the records of all environmental issues pertaining to the organisation. The EMS is made simple through the introduction of the ISO 14000 series. ISO 14000 provides guidelines on how to successfully manage and reduce environmental impacts through management functions, while at the same time allowing for high levels of socioeconomic growth and dedication to sustainable development. The implementation of EMS through ISO 14000 series would involve the expenditure. Every organisation is interested in economic aspects before the implementation of any system. They want that the system should provide the financial benefits, which will motivate to keep going on. This paper discusses economic aspects for the implementation of ISO 14000 an EMS tool in any organization with the help of cost of environment concept. The paper presents the concept of quality cost being applied to justify the implementation of EMS.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129333738","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}
The issues of Real World are Very large data sets, Mixed types of data (continuous valued, symbolic data), Uncertainty (noisy data), Incompleteness (missing, incomplete data), Data change, Use of background knowledge etc. The main goal of the rough set analysis is induction of approximations of concepts [4]. Rough sets constitute a sound basis for KDD. It offers mathematical tools to discover patterns hidden in data [4] and hence used in the field of data mining. Rough Sets does not require any preliminary information as Fuzzy sets require membership values or probability is required in statistics. Hence this is its specialty. Two novel algorithms to find optimal reducts of condition attributes based on the relative attribute dependency are implemented using Java 1.5, out of which the first algorithms gives simple reduct whereas the second one gives the reduct with minimum attributes, The presented implementation serves as a prototype system for extracting decision rules, which is the first module. Second module gives positive regions for dependencies. Third module is reducts for calculating the minimum attributes to decide decision, with two techniques, first with brute force backward elimination which simply selects the attributes in the given order to check if they should be eliminated, and the second technique is the information entropy-based algorithm which calculates the information entropy conveyed in each attribute and selects the one with the maximum information gain for elimination. Fourth modules describes the Equivalence classes for Classification including lower and upper approximation for implementing hard computing and soft computing respectively and last module is the discernibility matrix and functions which is used that stores the differences between attribute values for each pair of data tuples. Rather than searching on the entire training set, the matrix is instead searched to detect redundant attributes. All these ultimately constitute the modules of the system. The implemented system is tested on a small sized application first to verity the mathematical calculations involved which is not practically feasible with large database. It is also tested on a medium sized application example to illustrate the usefulness of the system and the incorporated language.
{"title":"Applications of Rough Sets in the Field of Data Mining","authors":"A. Butalia, M. Dhore, Geetika Tewani","doi":"10.1109/ICETET.2008.143","DOIUrl":"https://doi.org/10.1109/ICETET.2008.143","url":null,"abstract":"The issues of Real World are Very large data sets, Mixed types of data (continuous valued, symbolic data), Uncertainty (noisy data), Incompleteness (missing, incomplete data), Data change, Use of background knowledge etc. The main goal of the rough set analysis is induction of approximations of concepts [4]. Rough sets constitute a sound basis for KDD. It offers mathematical tools to discover patterns hidden in data [4] and hence used in the field of data mining. Rough Sets does not require any preliminary information as Fuzzy sets require membership values or probability is required in statistics. Hence this is its specialty. Two novel algorithms to find optimal reducts of condition attributes based on the relative attribute dependency are implemented using Java 1.5, out of which the first algorithms gives simple reduct whereas the second one gives the reduct with minimum attributes, The presented implementation serves as a prototype system for extracting decision rules, which is the first module. Second module gives positive regions for dependencies. Third module is reducts for calculating the minimum attributes to decide decision, with two techniques, first with brute force backward elimination which simply selects the attributes in the given order to check if they should be eliminated, and the second technique is the information entropy-based algorithm which calculates the information entropy conveyed in each attribute and selects the one with the maximum information gain for elimination. Fourth modules describes the Equivalence classes for Classification including lower and upper approximation for implementing hard computing and soft computing respectively and last module is the discernibility matrix and functions which is used that stores the differences between attribute values for each pair of data tuples. Rather than searching on the entire training set, the matrix is instead searched to detect redundant attributes. All these ultimately constitute the modules of the system. The implemented system is tested on a small sized application first to verity the mathematical calculations involved which is not practically feasible with large database. It is also tested on a medium sized application example to illustrate the usefulness of the system and the incorporated language.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129477687","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}
Here we are presenting some novel techniques for squirting colors in grayscale images. The problem of coloring grayscale images has no exact solution. Here we are attempting to minimize the human efforts needed in manually coloring the grayscale images. We need human interaction only to find a reference color image, then the job of transferring color traits from reference color image to grayscale image is done by proposed techniques. In these techniques, the color palette is prepared using pixel windows of some degrees taken from reference color image. Then the grayscale image is divided into pixel windows with same degrees. For every window of grayscale image the palette is searched for equivalent color values, which could be used to color grayscale window. In the whole process the luminance values of reference color image and target grayscale image are only matched and based on best possible match the respective chromaticity values of color image are transferred to grayscale image. For palette preparation first we used RGB color space and then Kekre's LUV color space[9]. Results with Kekre's LUV color space were comparatively better. To improve the searching time through color palette the exhaustive and Kekre's fast search are used.
{"title":"Color Traits Transfer to Grayscale Images","authors":"H. B. Kekre, Sudeep D. Thepade","doi":"10.1109/ICETET.2008.107","DOIUrl":"https://doi.org/10.1109/ICETET.2008.107","url":null,"abstract":"Here we are presenting some novel techniques for squirting colors in grayscale images. The problem of coloring grayscale images has no exact solution. Here we are attempting to minimize the human efforts needed in manually coloring the grayscale images. We need human interaction only to find a reference color image, then the job of transferring color traits from reference color image to grayscale image is done by proposed techniques. In these techniques, the color palette is prepared using pixel windows of some degrees taken from reference color image. Then the grayscale image is divided into pixel windows with same degrees. For every window of grayscale image the palette is searched for equivalent color values, which could be used to color grayscale window. In the whole process the luminance values of reference color image and target grayscale image are only matched and based on best possible match the respective chromaticity values of color image are transferred to grayscale image. For palette preparation first we used RGB color space and then Kekre's LUV color space[9]. Results with Kekre's LUV color space were comparatively better. To improve the searching time through color palette the exhaustive and Kekre's fast search are used.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128858319","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}
In this paper, the algorithm of digital image watermarking is proposed using discrete wavelet transform (DWT) for copyright protection. The detail coefficients of second level host image after taking DWT is used as a watermark key for the watermark logo insertion or addition and extraction process. We have proposed the learning of low dimensional representation in the context of image recognition using principle component analysis (PCA). It is based on the second order statistics of image set. The PCA aims to find second order correlation of patterns. The effectiveness of PCA is tested on original watermark logo, extracted watermark logo. We were able to design a prototype system, which provides user authentication. The proposed system of watermark image recognition may be applied in identification systems, document control and access control.
{"title":"Watermark Image Recognition Using Principal Component Analysis","authors":"Amol R. Madane, M. M. Shah","doi":"10.1109/ICETET.2008.86","DOIUrl":"https://doi.org/10.1109/ICETET.2008.86","url":null,"abstract":"In this paper, the algorithm of digital image watermarking is proposed using discrete wavelet transform (DWT) for copyright protection. The detail coefficients of second level host image after taking DWT is used as a watermark key for the watermark logo insertion or addition and extraction process. We have proposed the learning of low dimensional representation in the context of image recognition using principle component analysis (PCA). It is based on the second order statistics of image set. The PCA aims to find second order correlation of patterns. The effectiveness of PCA is tested on original watermark logo, extracted watermark logo. We were able to design a prototype system, which provides user authentication. The proposed system of watermark image recognition may be applied in identification systems, document control and access control.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125559137","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}
Keeping in mind the emerging consumer demand based network traffic scenario wherein assortment of traffics and resulting traffic conditions, we propose a generalized analytical method to assess network traffic first with resulting connections that follows. That is, we model traffic to embody two fundamental components transitions and transfer rates that helps us understand, establish, evaluate, qualify and quantify traffic patterns and hence traffic dynamics in optical networks.
{"title":"Modelling and Pre-Assessment of Traffic Transitions in Dynamic Optical Networks","authors":"T. Indumathi, V. Patel","doi":"10.1109/ICETET.2008.88","DOIUrl":"https://doi.org/10.1109/ICETET.2008.88","url":null,"abstract":"Keeping in mind the emerging consumer demand based network traffic scenario wherein assortment of traffics and resulting traffic conditions, we propose a generalized analytical method to assess network traffic first with resulting connections that follows. That is, we model traffic to embody two fundamental components transitions and transfer rates that helps us understand, establish, evaluate, qualify and quantify traffic patterns and hence traffic dynamics in optical networks.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126389282","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}
With the increasing popularity of Web services, attackers are getting attracted to hack the Web services and the servers on which they run. One of the major threats is that of intruders which may maliciously try to access the data or services. Thus there is a need to protect the servers on which Web services are running from intruders. Therefore, intrusion detection systems need to be employed. Signature based IDS are popularly being used. Honeypots are a highly flexible security tool with differing applications for security. They are a security resource that does not have any production or authorized activity but have an important use in intrusion prevention, detection and information gathering. Honeypot collects very little data and what it collects is normally of high value. This information can be used in extraction of intrusion detection signature. In this paper we have proposed a method to analyze the attacks and generate signatures for Web services.
{"title":"Intrusion Attack Pattern Analysis and Signature Extraction for Web Services Using Honeypots","authors":"N. Dagdee, Urjita Thakar","doi":"10.1109/ICETET.2008.192","DOIUrl":"https://doi.org/10.1109/ICETET.2008.192","url":null,"abstract":"With the increasing popularity of Web services, attackers are getting attracted to hack the Web services and the servers on which they run. One of the major threats is that of intruders which may maliciously try to access the data or services. Thus there is a need to protect the servers on which Web services are running from intruders. Therefore, intrusion detection systems need to be employed. Signature based IDS are popularly being used. Honeypots are a highly flexible security tool with differing applications for security. They are a security resource that does not have any production or authorized activity but have an important use in intrusion prevention, detection and information gathering. Honeypot collects very little data and what it collects is normally of high value. This information can be used in extraction of intrusion detection signature. In this paper we have proposed a method to analyze the attacks and generate signatures for Web services.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127437993","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
扫码关注我们
求助内容：
应助结果提醒方式：