In this paper, we propose a novel approach for authoring a diversity of multimedia resources (audio, video, text, images, etc). We introduce a prototype authoring tool (called M-Tool) relying on a metadata model that unifies MPEG-21 and TV-anytime descriptions to edit and enrich audiovisual contents with metadata. Additional innovative functionalities extending the M-Tool are also presented. This new generation of metadata authoring tools is designed and currently used for scenarios of TV and news broadcasting, and video on demand broadcasting in the framework of the IST Integrated European Project ENTHRONE.
{"title":"Enriching multimedia content description for broadcast environments: from a unified metadata model to a new generation of authoring tool","authors":"B. Rousseau, Laure Berti-Équille, Wilfried Jouve","doi":"10.1109/ISM.2005.54","DOIUrl":"https://doi.org/10.1109/ISM.2005.54","url":null,"abstract":"In this paper, we propose a novel approach for authoring a diversity of multimedia resources (audio, video, text, images, etc). We introduce a prototype authoring tool (called M-Tool) relying on a metadata model that unifies MPEG-21 and TV-anytime descriptions to edit and enrich audiovisual contents with metadata. Additional innovative functionalities extending the M-Tool are also presented. This new generation of metadata authoring tools is designed and currently used for scenarios of TV and news broadcasting, and video on demand broadcasting in the framework of the IST Integrated European Project ENTHRONE.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134230703","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}
Feature track matrix factorization based methods have been attractive solutions to the structure-from-motion (Sfm) problem. Group motion of the feature points is analyzed to get the 3D information. It is well known that the factorization formulations give rise to rank deficient system of equations. Even when enough constraints exist, the extracted models are sparse due the unavailability of pixel level tracks. Pixel level tracking of 3D surfaces is a difficult problem, particularly when the surface has very little texture as in a human face. Only sparsely located feature points can be tracked and tracking errors are inevitable along rotating low texture surfaces. However, the 3D models of an object class lie in a subspace of the set of all possible 3D models. We propose a novel solution to the structure-from-motion problem which utilizes the high-resolution 3D obtained from range scanner to compute a basis for this desired subspace. Adding subspace constraints during factorization also facilitates removal of tracking noise which causes distortions outside the subspace. We demonstrate the effectiveness of our formulation by extracting dense 3D structure of a human face and comparing it with a well known structure-from-motion algorithm due to brand.
{"title":"A model based factorization approach for dense 3D recovery from monocular video","authors":"J. Yagnik, K. Ramakrishnan","doi":"10.1109/ISM.2005.15","DOIUrl":"https://doi.org/10.1109/ISM.2005.15","url":null,"abstract":"Feature track matrix factorization based methods have been attractive solutions to the structure-from-motion (Sfm) problem. Group motion of the feature points is analyzed to get the 3D information. It is well known that the factorization formulations give rise to rank deficient system of equations. Even when enough constraints exist, the extracted models are sparse due the unavailability of pixel level tracks. Pixel level tracking of 3D surfaces is a difficult problem, particularly when the surface has very little texture as in a human face. Only sparsely located feature points can be tracked and tracking errors are inevitable along rotating low texture surfaces. However, the 3D models of an object class lie in a subspace of the set of all possible 3D models. We propose a novel solution to the structure-from-motion problem which utilizes the high-resolution 3D obtained from range scanner to compute a basis for this desired subspace. Adding subspace constraints during factorization also facilitates removal of tracking noise which causes distortions outside the subspace. We demonstrate the effectiveness of our formulation by extracting dense 3D structure of a human face and comparing it with a well known structure-from-motion algorithm due to brand.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133989171","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}
Ontology learning is a method that can be used by ontology engineers to construct ontology more easily. With the rapid development of semantic Web and the ever increasing need for ontology, ontology learning has been regarded as one of the most important fields in the semantic Web related research work. In recent years, a lot of work has been done to design appropriate methods for ontology learning all over the world. But all these methods have some common shortcomings which limit their abilities. In this paper, we first analyze the characteristics of these shortcomings and then propose our own ontology learning method based on the theory of frame semantic which can overcome the shortcomings mentioned above and facilitate the ontology learning task. The experiment results show that this method could improve the performance of the ontology learning system.
{"title":"An ontology learning method enhanced by frame semantics","authors":"Enhong Chen, Gaofeng Wu","doi":"10.1109/ISM.2005.32","DOIUrl":"https://doi.org/10.1109/ISM.2005.32","url":null,"abstract":"Ontology learning is a method that can be used by ontology engineers to construct ontology more easily. With the rapid development of semantic Web and the ever increasing need for ontology, ontology learning has been regarded as one of the most important fields in the semantic Web related research work. In recent years, a lot of work has been done to design appropriate methods for ontology learning all over the world. But all these methods have some common shortcomings which limit their abilities. In this paper, we first analyze the characteristics of these shortcomings and then propose our own ontology learning method based on the theory of frame semantic which can overcome the shortcomings mentioned above and facilitate the ontology learning task. The experiment results show that this method could improve the performance of the ontology learning system.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114189171","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}
Hassan Jameel, L. X. Hung, Umar Kalim, Ali Sajjad, Sungyoung Lee, Young-Koo Lee
Ubiquitous computing foresees a massively networked world supporting a population of diverse but cooperating mobile devices where trust relationships between entities are uncertain. Though there have been lots of effort focusing on trust for ubiquitous systems, they did not attach enough importance to uncertainty in their model. On the other hand, most of the works draw a general picture without a detailed computational model. In this paper, we present a trust model based on the vectors of trust values of different entities. The evaluation of trust depends upon the recommendation of peer entities common to the interacting entities. These recommendations are weighted according to the number and time of past interactions. Furthermore we present a method of handling false recommendations without introducing significant computational burden. The model can calculate trust between two entities in situations both in which there is past experience among the interacting entities and in which the two entities are communicating for the first time. Several tuning parameters are suggested which can be adjusted to meet the security requirement of a ubiquitous system.
{"title":"A trust model for ubiquitous systems based on vectors of trust values","authors":"Hassan Jameel, L. X. Hung, Umar Kalim, Ali Sajjad, Sungyoung Lee, Young-Koo Lee","doi":"10.1109/ISM.2005.22","DOIUrl":"https://doi.org/10.1109/ISM.2005.22","url":null,"abstract":"Ubiquitous computing foresees a massively networked world supporting a population of diverse but cooperating mobile devices where trust relationships between entities are uncertain. Though there have been lots of effort focusing on trust for ubiquitous systems, they did not attach enough importance to uncertainty in their model. On the other hand, most of the works draw a general picture without a detailed computational model. In this paper, we present a trust model based on the vectors of trust values of different entities. The evaluation of trust depends upon the recommendation of peer entities common to the interacting entities. These recommendations are weighted according to the number and time of past interactions. Furthermore we present a method of handling false recommendations without introducing significant computational burden. The model can calculate trust between two entities in situations both in which there is past experience among the interacting entities and in which the two entities are communicating for the first time. Several tuning parameters are suggested which can be adjusted to meet the security requirement of a ubiquitous system.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122392309","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}
N. Asokan, Seamus Moloney, Philip Ginzboorg, Kari Kostiainen
The increasing popularity and variety of consumer multimedia devices is driving the need for networked homes. Yet setting up a secure wireless network is a daunting task for most ordinary users. Recently, there have been several proposals for easing this process. However, none of the proposals consider the problem of how to make it easy to manage visitor access. In this paper, we motivate the requirements for visitor management, show the shortcomings of the current easy setup proposals in this regard, and propose a new setup procedure that makes it easy to manage visitor access to wireless networks. Our contributions are twofold: first we present an approach to assigning categories to client devices at admission time so that selective revocation of clients based on those categories becomes possible. Then we present the idea of admission tickets, a flexible and secure way to delegate conditional access rights. We report the results and experience of prototyping of the proposed procedure using the HostAP framework.
{"title":"Visitor access management in personal wireless networks","authors":"N. Asokan, Seamus Moloney, Philip Ginzboorg, Kari Kostiainen","doi":"10.1109/ISM.2005.122","DOIUrl":"https://doi.org/10.1109/ISM.2005.122","url":null,"abstract":"The increasing popularity and variety of consumer multimedia devices is driving the need for networked homes. Yet setting up a secure wireless network is a daunting task for most ordinary users. Recently, there have been several proposals for easing this process. However, none of the proposals consider the problem of how to make it easy to manage visitor access. In this paper, we motivate the requirements for visitor management, show the shortcomings of the current easy setup proposals in this regard, and propose a new setup procedure that makes it easy to manage visitor access to wireless networks. Our contributions are twofold: first we present an approach to assigning categories to client devices at admission time so that selective revocation of clients based on those categories becomes possible. Then we present the idea of admission tickets, a flexible and secure way to delegate conditional access rights. We report the results and experience of prototyping of the proposed procedure using the HostAP framework.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"277 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126017234","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 a pitch-based approach for creating musical fingerprints for similarity assessment. An effective measure for musical similarity impacts music indexing and classification in music retrieval systems. The proposed method creates key distributions from polyphonic music, and compares the key distributions of pairs of pieces, by calculating their correlation coefficient, to determine a degree of similarity between them. The proposed method assumes no knowledge of the time structure of the piece, nor does it require pieces to be the same length. We present results using this method to assess similarity among selected variations by Mozart. The results show that the correlation coefficients of pieces from the same set of variations are centered on 0.88 (with a standard deviation of 0.11), and that of pieces across different sets of variations are centered on 0.32 (with a standard deviation of 0.31).
{"title":"Key distributions as musical fingerprints for similarity assessment","authors":"Arpi Mardirossian, E. Chew","doi":"10.1109/ISM.2005.73","DOIUrl":"https://doi.org/10.1109/ISM.2005.73","url":null,"abstract":"This paper presents a pitch-based approach for creating musical fingerprints for similarity assessment. An effective measure for musical similarity impacts music indexing and classification in music retrieval systems. The proposed method creates key distributions from polyphonic music, and compares the key distributions of pairs of pieces, by calculating their correlation coefficient, to determine a degree of similarity between them. The proposed method assumes no knowledge of the time structure of the piece, nor does it require pieces to be the same length. We present results using this method to assess similarity among selected variations by Mozart. The results show that the correlation coefficients of pieces from the same set of variations are centered on 0.88 (with a standard deviation of 0.11), and that of pieces across different sets of variations are centered on 0.32 (with a standard deviation of 0.31).","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114432690","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}
Nowadays, the amount of multimedia data is increasing rapidly, and hence, there is an increasing need for efficient methods to manage the multimedia content. This paper proposes a framework for the description and retrieval of multimedia data. The data are represented at both the syntactic (structure, metadata and low level features) and semantic (the meaning of the data) levels. We use the MPEG-7 standard, which provides a set of tools to describe multimedia content from different viewpoints, to represent the syntactic level. However, due to its XML schema based representation, MPEG-7 is not suitable to represent the semantic aspect of the data in a formal and concise way. Moreover, inferential mechanisms are not provided. To alleviate these limitations, we propose to extend MPEG-7 with a domain ontology, formalized using a logical formalism. Then, the semantic aspect of the data is described using the ontology's vocabulary, as a set of logical expressions. We enhance the ontology by a rules layer, to describe more complex constraints between domain concepts and relations. User's queries may concern the syntactic and/or semantic features. The syntactic constraints are expressed using XQuery language and evaluated using an XML query engine; whereas the semantic query constraints are expressed using a rules language and evaluated using a specific resolution mechanism.
{"title":"A logic based approach for the multimedia data representation and retrieval","authors":"Samira Hammiche, S. Benbernou, A. Vakali","doi":"10.1109/ISM.2005.11","DOIUrl":"https://doi.org/10.1109/ISM.2005.11","url":null,"abstract":"Nowadays, the amount of multimedia data is increasing rapidly, and hence, there is an increasing need for efficient methods to manage the multimedia content. This paper proposes a framework for the description and retrieval of multimedia data. The data are represented at both the syntactic (structure, metadata and low level features) and semantic (the meaning of the data) levels. We use the MPEG-7 standard, which provides a set of tools to describe multimedia content from different viewpoints, to represent the syntactic level. However, due to its XML schema based representation, MPEG-7 is not suitable to represent the semantic aspect of the data in a formal and concise way. Moreover, inferential mechanisms are not provided. To alleviate these limitations, we propose to extend MPEG-7 with a domain ontology, formalized using a logical formalism. Then, the semantic aspect of the data is described using the ontology's vocabulary, as a set of logical expressions. We enhance the ontology by a rules layer, to describe more complex constraints between domain concepts and relations. User's queries may concern the syntactic and/or semantic features. The syntactic constraints are expressed using XQuery language and evaluated using an XML query engine; whereas the semantic query constraints are expressed using a rules language and evaluated using a specific resolution mechanism.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114504413","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}
Zhenyu Yang, K. Nahrstedt, Yi Cui, Bin Yu, Jin Liang, Sang-Hack Jung, R. Bajcsy
Tele-immersive 3D multi-camera room environments are starting to emerge and with them new challenging research questions. One important question is how to organize the large amount of visual data, being captured, processed, transmitted and displayed, and their corresponding resources, over current COTS computing and networking infrastructures so that "everybody" would be able to install and use tele-immersive environments for conferencing and other activities. In this paper, we propose a novel cross-layer control and streaming framework over general purpose delivery infrastructure, called TEEVE (tele-immersive environments for everybody). TEEVE aims for effective and adaptive coordination, synchronization, and soft QoS-enabled delivery of tele-immersive visual streams to remote room(s). The TEEVE experiments between two tele-immersive rooms residing in different institutions more than 2000 miles apart show that we can sustain communication of up to 12 3D video streams with 4/spl sim/5 3D frames per second for each stream, yielding 4/spl sim/5 tele-immersive video rate.
{"title":"TEEVE: the next generation architecture for tele-immersive environments","authors":"Zhenyu Yang, K. Nahrstedt, Yi Cui, Bin Yu, Jin Liang, Sang-Hack Jung, R. Bajcsy","doi":"10.1109/ISM.2005.113","DOIUrl":"https://doi.org/10.1109/ISM.2005.113","url":null,"abstract":"Tele-immersive 3D multi-camera room environments are starting to emerge and with them new challenging research questions. One important question is how to organize the large amount of visual data, being captured, processed, transmitted and displayed, and their corresponding resources, over current COTS computing and networking infrastructures so that \"everybody\" would be able to install and use tele-immersive environments for conferencing and other activities. In this paper, we propose a novel cross-layer control and streaming framework over general purpose delivery infrastructure, called TEEVE (tele-immersive environments for everybody). TEEVE aims for effective and adaptive coordination, synchronization, and soft QoS-enabled delivery of tele-immersive visual streams to remote room(s). The TEEVE experiments between two tele-immersive rooms residing in different institutions more than 2000 miles apart show that we can sustain communication of up to 12 3D video streams with 4/spl sim/5 3D frames per second for each stream, yielding 4/spl sim/5 tele-immersive video rate.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128369642","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 ability to visualize time-varying phenomena is paramount to ensure correct interpretation and analysis, provoke insights, and communicate those insights to others. In particular, interactive visualization allows us the freedom to explore the spatial and temporal domains of such phenomena. The task of visualizing tissue growth is challenging because of two factors: The amount of data that needs to be visualized and the large simulation parameter space. In this paper, we present our application of visualization to a three-dimensional simulation model for tissue growth. Cellular automata is used to model populations of cells that execute persistent random walks on the computational grid, collide, and proliferate until they reach confluence. Our research objective is the progress toward the development of a problem-solving environment that can guide the design of experiments for tissue engineers.
{"title":"An early look at the visualization of three-dimensional tissue growth","authors":"B. Youssef, Haris Widjaya","doi":"10.1109/ISM.2005.29","DOIUrl":"https://doi.org/10.1109/ISM.2005.29","url":null,"abstract":"The ability to visualize time-varying phenomena is paramount to ensure correct interpretation and analysis, provoke insights, and communicate those insights to others. In particular, interactive visualization allows us the freedom to explore the spatial and temporal domains of such phenomena. The task of visualizing tissue growth is challenging because of two factors: The amount of data that needs to be visualized and the large simulation parameter space. In this paper, we present our application of visualization to a three-dimensional simulation model for tissue growth. Cellular automata is used to model populations of cells that execute persistent random walks on the computational grid, collide, and proliferate until they reach confluence. Our research objective is the progress toward the development of a problem-solving environment that can guide the design of experiments for tissue engineers.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122792806","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 halftone watermarking method of high quality, robustness, and capacity flexibility is presented in this paper. An objective halftone image quality evaluation method based on the human visual system obtained by least-mean-square is also introduced. In the encoder, the kernels-alternated error diffusion (KAEDF) is applied. This is able to maintain the computational complexity at the same level as ordinary error diffusion. Compared with Hel-Or (2001) using ordered dithering, the proposed KAEDF yields a better image quality through using error diffusion. We also propose a weighted lookup table (WLUT) in the decoder instead of LUT, as proposed by Pei and Guo (2003), so as to achieve a higher decoded rate. As the experimental results demonstrated, this technique is able to guard against degradation due to tampering, cropping, rotation, as well as print-and-scan processes in error-diffused halftone images.
{"title":"Robust watermarking with kernels-alternated error diffusion and weighted lookup table in halftone images","authors":"Jing-Ming Guo","doi":"10.1109/ISM.2005.98","DOIUrl":"https://doi.org/10.1109/ISM.2005.98","url":null,"abstract":"A halftone watermarking method of high quality, robustness, and capacity flexibility is presented in this paper. An objective halftone image quality evaluation method based on the human visual system obtained by least-mean-square is also introduced. In the encoder, the kernels-alternated error diffusion (KAEDF) is applied. This is able to maintain the computational complexity at the same level as ordinary error diffusion. Compared with Hel-Or (2001) using ordered dithering, the proposed KAEDF yields a better image quality through using error diffusion. We also propose a weighted lookup table (WLUT) in the decoder instead of LUT, as proposed by Pei and Guo (2003), so as to achieve a higher decoded rate. As the experimental results demonstrated, this technique is able to guard against degradation due to tampering, cropping, rotation, as well as print-and-scan processes in error-diffused halftone images.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132068954","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
扫码关注我们
求助内容：
应助结果提醒方式：