S. Boulos, David Edwards, Dylan Lacewell, J. Kniss, J. Kautz, P. Shirley, I. Wald
Much progress has been made toward interactive ray tracing, but most research has focused specifically on ray casting. A common approach is to use "packets" of rays to amortize cost across sets of rays. Whether "packets" can be used to speed up the cost of reflection and refraction rays is unclear. The issue is complicated since such rays do not share common origins and often have less directional coherence than viewing and shadow rays. Since the primary advantage of ray tracing over rasterization is the computation of global effects, such as accurate reflection and refraction, this lack of knowledge should be corrected. We are also interested in exploring whether distribution ray tracing, due to its stochastic properties, further erodes the effectiveness of techniques used to accelerate ray casting. This paper addresses the question of whether packet-based ray tracing algorithms can be effectively used for more than visibility computation. We show that by choosing an appropriate data structure and a suitable packet assembly algorithm we can extend the idea of "packets" from ray casting to Whitted-style and distribution ray tracing, while maintaining efficiency.
{"title":"Packet-based whitted and distribution ray tracing","authors":"S. Boulos, David Edwards, Dylan Lacewell, J. Kniss, J. Kautz, P. Shirley, I. Wald","doi":"10.1145/1268517.1268547","DOIUrl":"https://doi.org/10.1145/1268517.1268547","url":null,"abstract":"Much progress has been made toward interactive ray tracing, but most research has focused specifically on ray casting. A common approach is to use \"packets\" of rays to amortize cost across sets of rays. Whether \"packets\" can be used to speed up the cost of reflection and refraction rays is unclear. The issue is complicated since such rays do not share common origins and often have less directional coherence than viewing and shadow rays. Since the primary advantage of ray tracing over rasterization is the computation of global effects, such as accurate reflection and refraction, this lack of knowledge should be corrected. We are also interested in exploring whether distribution ray tracing, due to its stochastic properties, further erodes the effectiveness of techniques used to accelerate ray casting. This paper addresses the question of whether packet-based ray tracing algorithms can be effectively used for more than visibility computation. We show that by choosing an appropriate data structure and a suitable packet assembly algorithm we can extend the idea of \"packets\" from ray casting to Whitted-style and distribution ray tracing, while maintaining efficiency.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127214312","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 real-time rendering system for generating a Chinese ink-and-wash cartoon. The objective is to free the animators from laboriously designing traditional Chinese painting appearance. The system constitutes a morphing animation framework and a rendering process. The whole rendering process is based on Graphic Process Unit (GPU), including interior shading, silhouette extracting and background shading. Moreover, the morphing framework is created to automatically generate Chinese painting cartoon from a set of surface mesh models. These techniques can be applied to real-time Chinese style entertainment application.
{"title":"GPU-based rendering and animation for Chinese painting cartoon","authors":"Manli Yuan, Xubo Yang, Shuangjiu Xiao, Zheng Ren","doi":"10.1145/1268517.1268529","DOIUrl":"https://doi.org/10.1145/1268517.1268529","url":null,"abstract":"This paper presents a real-time rendering system for generating a Chinese ink-and-wash cartoon. The objective is to free the animators from laboriously designing traditional Chinese painting appearance. The system constitutes a morphing animation framework and a rendering process. The whole rendering process is based on Graphic Process Unit (GPU), including interior shading, silhouette extracting and background shading. Moreover, the morphing framework is created to automatically generate Chinese painting cartoon from a set of surface mesh models. These techniques can be applied to real-time Chinese style entertainment application.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131518625","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}
Kathryn Elliot, Mark Watson, Carman Neustaedter, S. Greenberg
Ethnographic studies of the home revealed the fundamental roles that physical locations and context play in how household members understand and manage conventional information. Yet we also know that digital information is becoming increasingly important to households. The problem is that this digital information is almost always tied to traditional computer displays, which inhibits its incorporation into household routines. Our solution, location-dependent information appliances, exploit both home location and context (as articulated in ethnographic studies) to enhance the role of ambient displays in the home setting; these displays provide home occupants with both background awareness of an information source and foreground methods to gain further details if desired. The novel aspect is that home occupants assign particular information to locations within a home in a way that makes sense to them. As a device is moved to a particular home location, information is automatically mapped to that device along with hints on how it should be displayed.
{"title":"Location-dependent information appliances for the home","authors":"Kathryn Elliot, Mark Watson, Carman Neustaedter, S. Greenberg","doi":"10.1145/1268517.1268543","DOIUrl":"https://doi.org/10.1145/1268517.1268543","url":null,"abstract":"Ethnographic studies of the home revealed the fundamental roles that physical locations and context play in how household members understand and manage conventional information. Yet we also know that digital information is becoming increasingly important to households. The problem is that this digital information is almost always tied to traditional computer displays, which inhibits its incorporation into household routines. Our solution, location-dependent information appliances, exploit both home location and context (as articulated in ethnographic studies) to enhance the role of ambient displays in the home setting; these displays provide home occupants with both background awareness of an information source and foreground methods to gain further details if desired. The novel aspect is that home occupants assign particular information to locations within a home in a way that makes sense to them. As a device is moved to a particular home location, information is automatically mapped to that device along with hints on how it should be displayed.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131023445","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 describes a communication-minded visualization called progressive multiples that supports both the forensic analysis and presentation of multidimensional event data. We combine ideas from progressive disclosure, which reveals data to the user on demand, and small multiples [21], which allows users to compare many images at once. Sets of events are visualized as timelines. Events are placed in temporal order on the x-axis, and a scalar dimension of the data is mapped to the y-axis. To support forensic analysis, users can pivot from an event in an existing timeline to create a new timeline of related events. The timelines serve as an exploration history, which has two benefits. First, this exploration history allows users to backtrack and explore multiple paths. Second, once a user has concluded an analysis, these timelines serve as the raw visual material for composing a story about the analysis. A narrative that conveys the analytical result can be created for a third party by copying and reordering timelines from the history. Our work is motivated by working with network security administrators and researchers in political communication. We describe a prototype that we are deploying with administrators and the results of a user study where we applied our technique to the visualization of a simulated epidemic.
{"title":"Progressive multiples for communication-minded visualization","authors":"Doantam Phan, A. Paepcke, T. Winograd","doi":"10.1145/1268517.1268554","DOIUrl":"https://doi.org/10.1145/1268517.1268554","url":null,"abstract":"This paper describes a communication-minded visualization called progressive multiples that supports both the forensic analysis and presentation of multidimensional event data. We combine ideas from progressive disclosure, which reveals data to the user on demand, and small multiples [21], which allows users to compare many images at once. Sets of events are visualized as timelines. Events are placed in temporal order on the x-axis, and a scalar dimension of the data is mapped to the y-axis. To support forensic analysis, users can pivot from an event in an existing timeline to create a new timeline of related events. The timelines serve as an exploration history, which has two benefits. First, this exploration history allows users to backtrack and explore multiple paths. Second, once a user has concluded an analysis, these timelines serve as the raw visual material for composing a story about the analysis. A narrative that conveys the analytical result can be created for a third party by copying and reordering timelines from the history. Our work is motivated by working with network security administrators and researchers in political communication. We describe a prototype that we are deploying with administrators and the results of a user study where we applied our technique to the visualization of a simulated epidemic.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129629889","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}
Requests for communication via mobile devices can be disruptive to the current task or social situation. To reduce the frequency of disruptive requests, one promising approach is to provide callers with cues of a receiver's context through an awareness display, allowing informed decisions of when to call. Existing displays typically provide cues based on what can be readily sensed, which may not match what is needed during the call decision process. In this paper, we report results of a four week diary study of mobile phone usage, where users recorded what context information they considered when making a call, and what information they wished others had considered when receiving a call. Our results were distilled into lessons that can be used to improve the design of awareness displays for mobile devices, e.g., show frequency of a receiver's recent communication and distance from a receiver to her phone. We discuss technologies that can enable cues indicated in these lessons to be realized within awareness displays, as well as discuss limitations of such displays and issues of privacy.
{"title":"Should I call now? understanding what context is considered when deciding whether to initiate remote communication via mobile devices","authors":"Edward S. De Guzman, Moushumi Sharmin, B. Bailey","doi":"10.1145/1268517.1268542","DOIUrl":"https://doi.org/10.1145/1268517.1268542","url":null,"abstract":"Requests for communication via mobile devices can be disruptive to the current task or social situation. To reduce the frequency of disruptive requests, one promising approach is to provide callers with cues of a receiver's context through an awareness display, allowing informed decisions of when to call. Existing displays typically provide cues based on what can be readily sensed, which may not match what is needed during the call decision process. In this paper, we report results of a four week diary study of mobile phone usage, where users recorded what context information they considered when making a call, and what information they wished others had considered when receiving a call. Our results were distilled into lessons that can be used to improve the design of awareness displays for mobile devices, e.g., show frequency of a receiver's recent communication and distance from a receiver to her phone. We discuss technologies that can enable cues indicated in these lessons to be realized within awareness displays, as well as discuss limitations of such displays and issues of privacy.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125420721","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}
Avneesh Sud, N. Govindaraju, Russell Gayle, Erik Andersen, Dinesh Manocha
We present a new parameterized representation called surface distance maps for distance computations on piecewise 2-manifold primitives. Given a set of orientable 2-manifold primitives, the surface distance map represents the (non-zero) signed distance-to-closest-primitive mapping at each point on a 2-manifold. The distance mapping is computed from each primitive to the set of remaining primitives. We present an interactive algorithm for computing the surface distance map of triangulated meshes using graphics hardware. We precompute a surface parameterization and use the it to define an affine transformation for each mesh primitive. Our algorithm efficiently computes the distance field by applying this affine transformation to the distance functions of the primitives and evaluating these functions using texture mapping hardware. In practice, our algorithm can compute very high resolution surface distance maps at interactive rates and provides tight error bounds on their accuracy. We use surface distance maps for path planning and proximity query computation among complex models in dynamic environments. Our approach can perform planning and proximity queries in a dynamic environment with hundreds of objects at interactive rates and offer significant speedups over prior algorithms.
{"title":"Surface distance maps","authors":"Avneesh Sud, N. Govindaraju, Russell Gayle, Erik Andersen, Dinesh Manocha","doi":"10.1145/1268517.1268525","DOIUrl":"https://doi.org/10.1145/1268517.1268525","url":null,"abstract":"We present a new parameterized representation called surface distance maps for distance computations on piecewise 2-manifold primitives. Given a set of orientable 2-manifold primitives, the surface distance map represents the (non-zero) signed distance-to-closest-primitive mapping at each point on a 2-manifold. The distance mapping is computed from each primitive to the set of remaining primitives. We present an interactive algorithm for computing the surface distance map of triangulated meshes using graphics hardware. We precompute a surface parameterization and use the it to define an affine transformation for each mesh primitive. Our algorithm efficiently computes the distance field by applying this affine transformation to the distance functions of the primitives and evaluating these functions using texture mapping hardware. In practice, our algorithm can compute very high resolution surface distance maps at interactive rates and provides tight error bounds on their accuracy. We use surface distance maps for path planning and proximity query computation among complex models in dynamic environments. Our approach can perform planning and proximity queries in a dynamic environment with hundreds of objects at interactive rates and offer significant speedups over prior algorithms.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126599188","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 we propose a GPU based interactive geometric modeling approach to designing fine level features on subdivision surfaces. Displacement mapping is a technique for adding fine geometric detail to surfaces by using two-dimensional height map to produce photo-realistic surfaces. Due to space inefficiency and time consuming to render displacement map, this technique is generally limited in offline cinematic content creation packages. We propose a new approach to designing fine level features on subdivision surfaces via displacement mapping interactively on the latest GPU. Our method can reduce the bandwidth of the graphics channel by generating complex geometric detail on GPU, without feeding a large number of vertices to the AGP or PCI-E. Moreover, we introduce feature modification tools to flexibly control and adjust the created features. Designers can preview the features at the rendering stage, saving the time to generate the satisfying features on surfaces. The proposed approach is efficient and robust, and can be applied in many interactive graphics applications such as computer gaming, geometric modeling and computer animation.
{"title":"A GPU based interactive modeling approach to designing fine level features","authors":"Xin Huang, Sheng Li, Guoping Wang","doi":"10.1145/1268517.1268567","DOIUrl":"https://doi.org/10.1145/1268517.1268567","url":null,"abstract":"In this paper we propose a GPU based interactive geometric modeling approach to designing fine level features on subdivision surfaces. Displacement mapping is a technique for adding fine geometric detail to surfaces by using two-dimensional height map to produce photo-realistic surfaces. Due to space inefficiency and time consuming to render displacement map, this technique is generally limited in offline cinematic content creation packages. We propose a new approach to designing fine level features on subdivision surfaces via displacement mapping interactively on the latest GPU. Our method can reduce the bandwidth of the graphics channel by generating complex geometric detail on GPU, without feeding a large number of vertices to the AGP or PCI-E. Moreover, we introduce feature modification tools to flexibly control and adjust the created features. Designers can preview the features at the rendering stage, saving the time to generate the satisfying features on surfaces. The proposed approach is efficient and robust, and can be applied in many interactive graphics applications such as computer gaming, geometric modeling and computer animation.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122770736","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 are many algorithms in non-photorealistic rendering for representing an image as a composition of small objects. In this paper, we focus on the specific case where the objects to be assembled into a composition are letters rather than images or abstract geometric forms. We develop a solution to the "calligraphic packing" problem based on dividing up a target region into pieces and warping a letter into each piece. We define an energy function that chooses a warp that best represents the original letter. We discuss variations in rendering style and show results produced by our system.
{"title":"Calligraphic packing","authors":"Jie Xu, C. Kaplan","doi":"10.1145/1268517.1268527","DOIUrl":"https://doi.org/10.1145/1268517.1268527","url":null,"abstract":"There are many algorithms in non-photorealistic rendering for representing an image as a composition of small objects. In this paper, we focus on the specific case where the objects to be assembled into a composition are letters rather than images or abstract geometric forms. We develop a solution to the \"calligraphic packing\" problem based on dividing up a target region into pieces and warping a letter into each piece. We define an energy function that chooses a warp that best represents the original letter. We discuss variations in rendering style and show results produced by our system.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125340196","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}
Michael A. Terry, Janet Cheung, Justin Lee, Terry Park, N. Williams
This paper introduces Jump, a prototype computer vision-based system that transforms paper-based architectural documents into tangible query interfaces. Specifically, Jump allows a user to obtain additional information related to a given architectural document by framing a portion of the drawing with physical brackets. The framed area appears in a magnified view on a separate display and applies the principle of semantic zooming to determine the appropriate level of detail to show. Filter tokens can be placed on the paper to modify the digital presentation to include information not on the original drawing itself, such as electrical, mechanical, and structural information related to the given space. These filter tokens serve as tangible sliders in that their relative location on the paper controls the degree to which their information is blended with the original document. To address the issue of recognition errors, Jump introduces the notion of a reflection window, or an inset window that serves to reproduce Jump's current interpretation of the visual scene. The system's overall design is informed by a set of in situ studies of architectural technologists and formative evaluations with the same group.
{"title":"Jump: a system for interactive, tangible queries of paper","authors":"Michael A. Terry, Janet Cheung, Justin Lee, Terry Park, N. Williams","doi":"10.1145/1268517.1268540","DOIUrl":"https://doi.org/10.1145/1268517.1268540","url":null,"abstract":"This paper introduces Jump, a prototype computer vision-based system that transforms paper-based architectural documents into tangible query interfaces. Specifically, Jump allows a user to obtain additional information related to a given architectural document by framing a portion of the drawing with physical brackets. The framed area appears in a magnified view on a separate display and applies the principle of semantic zooming to determine the appropriate level of detail to show. Filter tokens can be placed on the paper to modify the digital presentation to include information not on the original drawing itself, such as electrical, mechanical, and structural information related to the given space. These filter tokens serve as tangible sliders in that their relative location on the paper controls the degree to which their information is blended with the original document. To address the issue of recognition errors, Jump introduces the notion of a reflection window, or an inset window that serves to reproduce Jump's current interpretation of the visual scene. The system's overall design is informed by a set of in situ studies of architectural technologists and formative evaluations with the same group.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129712236","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}
Many visualizations use smoothly animated transitions to help the user interact with information structures. These transitions are intended to preserve perceptual constancy during viewpoint transformations. However, animated transitions also have costs -- they increase the transition time, and they can be complicated to implement -- and it is not clear whether the benefits of smooth transitions outweigh the costs. In order to quantify these benefits, we carried out two experiments that explore the effects of smooth transitions. In the first study, subjects were asked to determine whether graph nodes were connected, and navigated the graph either with or without smooth scene transitions. In the second study, participants were asked to identify the overall structure of a tree after navigating the tree through a viewport that either did or did not use smooth transitions for view changes. The results of both experiments show that smooth transitions can have dramatic benefits for user performance -- for example, participants in smooth transition conditions made half the errors of the discrete-movement conditions. In addition, short transitions were found to be as effective as long ones, suggesting that some of the costs of animations can be avoided. These studies give empirical evidence on the benefits of smooth transitions, and provide guidelines about when designers should use them in visualization systems.
{"title":"Can smooth view transitions facilitate perceptual constancy in node-link diagrams?","authors":"M. Shanmugasundaram, Pourang Irani, C. Gutwin","doi":"10.1145/1268517.1268531","DOIUrl":"https://doi.org/10.1145/1268517.1268531","url":null,"abstract":"Many visualizations use smoothly animated transitions to help the user interact with information structures. These transitions are intended to preserve perceptual constancy during viewpoint transformations. However, animated transitions also have costs -- they increase the transition time, and they can be complicated to implement -- and it is not clear whether the benefits of smooth transitions outweigh the costs. In order to quantify these benefits, we carried out two experiments that explore the effects of smooth transitions. In the first study, subjects were asked to determine whether graph nodes were connected, and navigated the graph either with or without smooth scene transitions. In the second study, participants were asked to identify the overall structure of a tree after navigating the tree through a viewport that either did or did not use smooth transitions for view changes. The results of both experiments show that smooth transitions can have dramatic benefits for user performance -- for example, participants in smooth transition conditions made half the errors of the discrete-movement conditions. In addition, short transitions were found to be as effective as long ones, suggesting that some of the costs of animations can be avoided. These studies give empirical evidence on the benefits of smooth transitions, and provide guidelines about when designers should use them in visualization systems.","PeriodicalId":197912,"journal":{"name":"International Genetic Improvement Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130160254","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
扫码关注我们
求助内容：
应助结果提醒方式：