The fatigue state of the driver is one of the important factors that cause traffic accidents. Vision based facial expression recognization technique is the most prospective method to detect driver fatigue. Therefore, a system that can detect oncoming driver drowsiness and issue timely warning could help in preventing many accidents and consequently save money and reduce personal suffering. By mounting a small camera inside the car the face of driver can be monitored. Firstly the face is detected by using skin color algorithm and then eyes are detected by using Circular Hough transform. This paper describes a method to track the eyes and detect whether the eyes are closed or open. If the eyes are found closed for 8 consecutive frames, the system draws the conclusion that the driver is falling asleep and issues a warning signal. In this paper non-intrusive technique is used in which no sensors are used on vehicle part as well as on body of the driver which was used in intrusive technique cause irritation in long time driving. The designed system is working properly in diverse conditions such as changes in light, shadow, and slightly dark background.
{"title":"Driver Drowsiness Detection Using Skin Color Algorithm and Circular Hough Transform","authors":"M. S. Devi, Monali V. Choudhari, P. Bajaj","doi":"10.1109/ICETET.2011.42","DOIUrl":"https://doi.org/10.1109/ICETET.2011.42","url":null,"abstract":"The fatigue state of the driver is one of the important factors that cause traffic accidents. Vision based facial expression recognization technique is the most prospective method to detect driver fatigue. Therefore, a system that can detect oncoming driver drowsiness and issue timely warning could help in preventing many accidents and consequently save money and reduce personal suffering. By mounting a small camera inside the car the face of driver can be monitored. Firstly the face is detected by using skin color algorithm and then eyes are detected by using Circular Hough transform. This paper describes a method to track the eyes and detect whether the eyes are closed or open. If the eyes are found closed for 8 consecutive frames, the system draws the conclusion that the driver is falling asleep and issues a warning signal. In this paper non-intrusive technique is used in which no sensors are used on vehicle part as well as on body of the driver which was used in intrusive technique cause irritation in long time driving. The designed system is working properly in diverse conditions such as changes in light, shadow, and slightly dark background.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127692257","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}
To explore the main components of the future computing machines, the spiking neurons for feature extraction and dimensionality reduction applications. The contribution would be to present a review of the approaches to spiking neural network architecture used for feature extraction and dimensionality reduction applications. To give importance to more realistic neuron models the main objective is to present a general and a comprehensive overview of spiking neurons, ranging from biological neuron features to examples of practical applications in the mentioned field. However, this work will focus on how information can be coded by precisely timed spikes, emitted by different neurons and then this coded information would be processed to produce useful results for feature extraction and dimensionality reduction application. Also, different approaches/algorithm would be studied and compared in terms of computational efficiency as the range of computational problems related to spiking neuron is very large. Therefore, the efforts would also be directed towards the reduction of computational cost.
{"title":"Review of Spiking Neural Network Architecture for Feature Extraction and Dimensionality Reduction","authors":"S. Chaturvedi, A. Khurshid","doi":"10.1109/ICETET.2011.57","DOIUrl":"https://doi.org/10.1109/ICETET.2011.57","url":null,"abstract":"To explore the main components of the future computing machines, the spiking neurons for feature extraction and dimensionality reduction applications. The contribution would be to present a review of the approaches to spiking neural network architecture used for feature extraction and dimensionality reduction applications. To give importance to more realistic neuron models the main objective is to present a general and a comprehensive overview of spiking neurons, ranging from biological neuron features to examples of practical applications in the mentioned field. However, this work will focus on how information can be coded by precisely timed spikes, emitted by different neurons and then this coded information would be processed to produce useful results for feature extraction and dimensionality reduction application. Also, different approaches/algorithm would be studied and compared in terms of computational efficiency as the range of computational problems related to spiking neuron is very large. Therefore, the efforts would also be directed towards the reduction of computational cost.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129385317","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 core of every microprocessor, digital signal processor (DSP), and data-processing application-specific integrated circuit (ASIC) is its data path. At the heart of data-paths and addressing units are arithmetic units, such as comparators, adders, and multipliers and at the heart of arithmetic circuits are adders. The main constraints of all adders are their speed, performance, power consumption and die area. Parallel-prefix adders offer a highly efficient solution to the binary addition problem and are well-suited for VLSI implementations. This paper involves the design of high speed, parallel-prefix adders such as Brent-Kung, Sklansky, Kogge-Stone and Ling adders, by Kogge-Stone implementation, using CMOS logic and transmission gate logic. The design and simulations are done using deep sub micron technology file. The power, area and delay for the two implementations are compared and it is found that the power, area and delay in the transmission gate logic is much lower than those in CMOS logic. This is done for 8, 16 and 32 bit adders. All the circuits are implemented using Tanner EDA and simulated in 130nm using TSMC MOSIS Level-49 model in TSPICE simulator.
{"title":"Design of High Speed Adders Using CMOS and Transmission Gates in Submicron Technology: A Comparative Study","authors":"A. Baliga, D. Yagain","doi":"10.1109/ICETET.2011.25","DOIUrl":"https://doi.org/10.1109/ICETET.2011.25","url":null,"abstract":"The core of every microprocessor, digital signal processor (DSP), and data-processing application-specific integrated circuit (ASIC) is its data path. At the heart of data-paths and addressing units are arithmetic units, such as comparators, adders, and multipliers and at the heart of arithmetic circuits are adders. The main constraints of all adders are their speed, performance, power consumption and die area. Parallel-prefix adders offer a highly efficient solution to the binary addition problem and are well-suited for VLSI implementations. This paper involves the design of high speed, parallel-prefix adders such as Brent-Kung, Sklansky, Kogge-Stone and Ling adders, by Kogge-Stone implementation, using CMOS logic and transmission gate logic. The design and simulations are done using deep sub micron technology file. The power, area and delay for the two implementations are compared and it is found that the power, area and delay in the transmission gate logic is much lower than those in CMOS logic. This is done for 8, 16 and 32 bit adders. All the circuits are implemented using Tanner EDA and simulated in 130nm using TSMC MOSIS Level-49 model in TSPICE simulator.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117245639","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}
This paper presents an approach to maximize efficiency in reference model based verification of a 2D Graphics Accelerator IP. Most of the Imaging IPs like 2D Graphics Accelerator, JPEG Encoder/Decoder, involve complex mathematical process on image data for which C Reference Models are readily available for Data checking. Verifying a 2D Graphics Engine primarily consists of configuring the rendering parameters, loading image data to the memory and starting the 2D Engine through setting appropriate command registers and finally comparing the output image data with the C Reference Model Output Data. In this paper, we describe and compare different ways of hooking up a C Reference Model in a Specman based verification environment. We also demonstrate the advantages of exploiting the VR AD Register package to configure the C Reference Model directly from the HVL based Testbench.
{"title":"Maximizing Efficiency in Reference Model Based Verification of 2D Graphics Engine","authors":"Anita Pinto, Y. S. S. Harish","doi":"10.1109/ICETET.2011.22","DOIUrl":"https://doi.org/10.1109/ICETET.2011.22","url":null,"abstract":"This paper presents an approach to maximize efficiency in reference model based verification of a 2D Graphics Accelerator IP. Most of the Imaging IPs like 2D Graphics Accelerator, JPEG Encoder/Decoder, involve complex mathematical process on image data for which C Reference Models are readily available for Data checking. Verifying a 2D Graphics Engine primarily consists of configuring the rendering parameters, loading image data to the memory and starting the 2D Engine through setting appropriate command registers and finally comparing the output image data with the C Reference Model Output Data. In this paper, we describe and compare different ways of hooking up a C Reference Model in a Specman based verification environment. We also demonstrate the advantages of exploiting the VR AD Register package to configure the C Reference Model directly from the HVL based Testbench.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122721177","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 enhancement of the international radio spectrum management framework is currently a subject of great debate in the light of the evolving radio communications environment. This subject matter has received due consideration in two successive World Radio communication Conferences (WRC) held in 2003 and 2007 respectively and further discussions are scheduled at WRC-12 which will take place in 2012. For over a century the international radio spectrum management framework has been governed by the service harmonisation principle and none of the models resulting so far from ITU studies for its enhancement challenges this principle. In this paper the author reviews the basis for service harmonisation and describes the new challenges brought by convergence. The evolving spectrum regulatory environment at national and regional (e.g. European) levels and the initiatives of the ITU to enhance the international spectrum management framework are described. These initiatives are analysed and recommendations are made for WRC-12.
{"title":"International Radio Spectrum Management Beyond Service Harmonisation","authors":"J. Louis","doi":"10.1109/ICETET.2011.14","DOIUrl":"https://doi.org/10.1109/ICETET.2011.14","url":null,"abstract":"The enhancement of the international radio spectrum management framework is currently a subject of great debate in the light of the evolving radio communications environment. This subject matter has received due consideration in two successive World Radio communication Conferences (WRC) held in 2003 and 2007 respectively and further discussions are scheduled at WRC-12 which will take place in 2012. For over a century the international radio spectrum management framework has been governed by the service harmonisation principle and none of the models resulting so far from ITU studies for its enhancement challenges this principle. In this paper the author reviews the basis for service harmonisation and describes the new challenges brought by convergence. The evolving spectrum regulatory environment at national and regional (e.g. European) levels and the initiatives of the ITU to enhance the international spectrum management framework are described. These initiatives are analysed and recommendations are made for WRC-12.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115770517","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}
A. Shire, M. Khanapurkar, Rajashri S. Mundewadikar
In the ceramic tile industry bulk amount of ceramic tiles are manufactured, it is very difficult to monitor the quality of each and every tiles manually. Lot of human resources are required for the defect detection of the tiles. Also it is quite tedious and time consuming method. Considering this criteria, an automated defect detection and classification technique has been proposed in this report that can have ensured the better quality of tiles in manufacturing process as well as production rate. Our proposed method plays an important role in ceramic tiles industries to detect the defects and to control the quality of ceramic tiles. This automated classification method helps us to monitor the defects within a very short period of time and also to decide about the recovery process so that the defected tiles may not be mixed with the good quality tiles.
{"title":"Plain Ceramic Tiles Surface Defect Detection Using Image Processing","authors":"A. Shire, M. Khanapurkar, Rajashri S. Mundewadikar","doi":"10.1109/ICETET.2011.63","DOIUrl":"https://doi.org/10.1109/ICETET.2011.63","url":null,"abstract":"In the ceramic tile industry bulk amount of ceramic tiles are manufactured, it is very difficult to monitor the quality of each and every tiles manually. Lot of human resources are required for the defect detection of the tiles. Also it is quite tedious and time consuming method. Considering this criteria, an automated defect detection and classification technique has been proposed in this report that can have ensured the better quality of tiles in manufacturing process as well as production rate. Our proposed method plays an important role in ceramic tiles industries to detect the defects and to control the quality of ceramic tiles. This automated classification method helps us to monitor the defects within a very short period of time and also to decide about the recovery process so that the defected tiles may not be mixed with the good quality tiles.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115360190","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 assistance of GIS and RS technology, it is extremely crucial to manage the huge volume, multi-source and multi-scale spatial data for the design and development of data management, which was based on the software of Oracle9i and Arc SDE version 8.2and the support of object oriented technology. The paper approaches to put forward a feasible and practical technology project reference for the construction of the applied GIS on the aspect of system database construction, to provide multi-level updation of eroded land and especially for which needs to manage both spatial data and non-spatial data management and integrating platform in the soil and water loss monitoring system. This paper expounded the detail about the design technique and framework of the database in practice, and focused on manipulating the huge volume spatial geographic information system. Finally, the paper approached to put forward a feasible and practical technology project reference for the construction of the applied GIS on the aspect of system database construction on soil eroded land, and especially for which needs to manage both spatial data and non-spatial data.
{"title":"Data Management in Soil Erosion Monitoring System Using Spatial Database and Its Multi-level Updation","authors":"Yogesh Pingle, Vaibhav Kohli","doi":"10.1109/ICETET.2011.28","DOIUrl":"https://doi.org/10.1109/ICETET.2011.28","url":null,"abstract":"With the assistance of GIS and RS technology, it is extremely crucial to manage the huge volume, multi-source and multi-scale spatial data for the design and development of data management, which was based on the software of Oracle9i and Arc SDE version 8.2and the support of object oriented technology. The paper approaches to put forward a feasible and practical technology project reference for the construction of the applied GIS on the aspect of system database construction, to provide multi-level updation of eroded land and especially for which needs to manage both spatial data and non-spatial data management and integrating platform in the soil and water loss monitoring system. This paper expounded the detail about the design technique and framework of the database in practice, and focused on manipulating the huge volume spatial geographic information system. Finally, the paper approached to put forward a feasible and practical technology project reference for the construction of the applied GIS on the aspect of system database construction on soil eroded land, and especially for which needs to manage both spatial data and non-spatial data.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115682429","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 experimental results of different types of SVC namely TCR, GCSC, FC-TCR are presented. The experiments are carried out in the FACTS lab of Electrical Engineering Department at G.H.Raisoni College of Engineering, Nagpur, India. The effect of Fixed Capacitor- Thyristor controlled reactor (FC-TCR) on the transmission line is studied and the readings are recorded with SVC connected at the midpoint of transmission line. The operating V-I area of SVC is also plotted.
{"title":"Experimental Study of Some Variable Impedance Type FACTS Devices","authors":"J. Agrawal, K. Joshi","doi":"10.1109/ICETET.2011.31","DOIUrl":"https://doi.org/10.1109/ICETET.2011.31","url":null,"abstract":"In this paper experimental results of different types of SVC namely TCR, GCSC, FC-TCR are presented. The experiments are carried out in the FACTS lab of Electrical Engineering Department at G.H.Raisoni College of Engineering, Nagpur, India. The effect of Fixed Capacitor- Thyristor controlled reactor (FC-TCR) on the transmission line is studied and the readings are recorded with SVC connected at the midpoint of transmission line. The operating V-I area of SVC is also plotted.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127850388","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 an alternative of Lyapunov's complicated "direct" method, "Robust Fixed Point Transformation (RFPT)" based adaptive controller is applied in decentralized manner for the control of two dynamically coupled, imperfectly and imprecisely modeled mechanical systems. Each subsystem consists of a cart plus a double pendulum provided with a local controller having no information on the existence and the physical state of the second pendulum and on the existence of and dynamic connection to the other cart pendulums system. Instead trying to develop a complete and generally useful system model the RFPT-based solution extracts information only on the present and recent behavior of the controlled system only in the given control situation. Insisting only on the use of the "present experiences" makes the method noise sensitive. To improve the situation the use of "recent experiences" with properly fading obsolete information is a viable solution. For this purpose parametric, discrete numerical approximation of Caputo's fractional order derivatives with "memory properties" are successfully used. It is shown by convincing simulation results that via observing and controlling the state propagation only of the modeled axles the uncorrelated controllers can precisely track their prescribed trajectories.
{"title":"Decentralized Adaptive Control with Fractional Order Elimination of Obsolete Information","authors":"J. Tar, J. Bitó, I. Rudas, T. A. Várkonyi","doi":"10.1109/ICETET.2011.38","DOIUrl":"https://doi.org/10.1109/ICETET.2011.38","url":null,"abstract":"In this paper an alternative of Lyapunov's complicated \"direct\" method, \"Robust Fixed Point Transformation (RFPT)\" based adaptive controller is applied in decentralized manner for the control of two dynamically coupled, imperfectly and imprecisely modeled mechanical systems. Each subsystem consists of a cart plus a double pendulum provided with a local controller having no information on the existence and the physical state of the second pendulum and on the existence of and dynamic connection to the other cart pendulums system. Instead trying to develop a complete and generally useful system model the RFPT-based solution extracts information only on the present and recent behavior of the controlled system only in the given control situation. Insisting only on the use of the \"present experiences\" makes the method noise sensitive. To improve the situation the use of \"recent experiences\" with properly fading obsolete information is a viable solution. For this purpose parametric, discrete numerical approximation of Caputo's fractional order derivatives with \"memory properties\" are successfully used. It is shown by convincing simulation results that via observing and controlling the state propagation only of the modeled axles the uncorrelated controllers can precisely track their prescribed trajectories.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120952555","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}
An image can be stored as a graph which requires very less memory for the storage. A graph is pictorial representation of a finite relation between the entities with help of nodes and edges. Edges connect the nodes whenever the nodes are related. For converting an image into a graph, it is first converted to a binary format. Binary image is converted to a skeleton form which preserves the shape details efficiently. Skeleton is then converted to a shock graph which has structure like a tree. The hierarchy of nodes in the graph structure is decided by a Shock Graph Grammar. Binary images with different shapes have different skeletons and different tree structure. Number of features of the graph can be extracted which facilitate comparison of shapes using these features. Comparison of shapes using their Shock graphs provides a very effective way of object recognition. A graph can be divided into sub graphs. An object recognition frame work by comparing the sub graphs has been presented here.
{"title":"A Simple Graph Theoretic Approach for Object Recognition","authors":"S. Hingway, K. Bhurchandi","doi":"10.1109/ICETET.2011.62","DOIUrl":"https://doi.org/10.1109/ICETET.2011.62","url":null,"abstract":"An image can be stored as a graph which requires very less memory for the storage. A graph is pictorial representation of a finite relation between the entities with help of nodes and edges. Edges connect the nodes whenever the nodes are related. For converting an image into a graph, it is first converted to a binary format. Binary image is converted to a skeleton form which preserves the shape details efficiently. Skeleton is then converted to a shock graph which has structure like a tree. The hierarchy of nodes in the graph structure is decided by a Shock Graph Grammar. Binary images with different shapes have different skeletons and different tree structure. Number of features of the graph can be extracted which facilitate comparison of shapes using these features. Comparison of shapes using their Shock graphs provides a very effective way of object recognition. A graph can be divided into sub graphs. An object recognition frame work by comparing the sub graphs has been presented here.","PeriodicalId":443239,"journal":{"name":"2011 Fourth International Conference on Emerging Trends in Engineering & Technology","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126388083","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
扫码关注我们
求助内容：
应助结果提醒方式：