Pub Date : 1900-01-01DOI: 10.5220/0005259200930100
Michael Burch, T. Munz, D. Weiskopf
We investigate the problem of visually encoding time-varying weighted digraphs to provide an overview about dynamic graphs. Starting from a rough overview of dynamic relational data an analyst can subsequently explore the data in more detail to gain further insights. To reach this goal we first map the graph vertices in the graph sequence to a common horizontal axis. Edges between vertices are represented as stacked horizontal and color-coded links starting and ending at their corresponding start and end vertex positions. The direction of each edge is indicated by placing it either above or below the horizontal vertex line. We attach a vertically aligned timeline to each link to show the weight evolution for those links. The order of the vertices and stacked edges is important for the readability of the visualization. We support interactive reordering and sorting in the vertex, edge, and timeline representations. The usefulness of our edge-stacked timelines is illustrated in a case study showing dynamic call graph data from software development.
{"title":"Edge-stacked Timelines for Visualizing Dynamic Weighted Digraphs","authors":"Michael Burch, T. Munz, D. Weiskopf","doi":"10.5220/0005259200930100","DOIUrl":"https://doi.org/10.5220/0005259200930100","url":null,"abstract":"We investigate the problem of visually encoding time-varying weighted digraphs to provide an overview about dynamic graphs. Starting from a rough overview of dynamic relational data an analyst can subsequently explore the data in more detail to gain further insights. To reach this goal we first map the graph vertices in the graph sequence to a common horizontal axis. Edges between vertices are represented as stacked horizontal and color-coded links starting and ending at their corresponding start and end vertex positions. The direction of each edge is indicated by placing it either above or below the horizontal vertex line. We attach a vertically aligned timeline to each link to show the weight evolution for those links. The order of the vertices and stacked edges is important for the readability of the visualization. We support interactive reordering and sorting in the vertex, edge, and timeline representations. The usefulness of our edge-stacked timelines is illustrated in a case study showing dynamic call graph data from software development.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124716404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005352802560261
Eduardo Veas, Belgin Mutlu, Cecilia di Sciascio, Gerwald Tschinkel, V. Sabol
Supporting individuals who lack experience or competence to evaluate an overwhelming amout of information such as from cultural, scientific and educational content makes recommender system invaluable to cope with the information overload problem. However, even recommended information scales up and users still need to consider large number of items. Visualization takes a foreground role, letting the user explore possibly interesting results. It leverages the high bandwidth of the human visual system to convey massive amounts of information. This paper argues the need to automate the creation of visualizations for unstructured data adapting it to the user’s preferences. We describe a prototype solution, taking a radical approach considering both grounded visual perception guidelines and personalized recommendations to suggest the proper visualization.
{"title":"Visual Recommendations for Scientific and Cultural Content","authors":"Eduardo Veas, Belgin Mutlu, Cecilia di Sciascio, Gerwald Tschinkel, V. Sabol","doi":"10.5220/0005352802560261","DOIUrl":"https://doi.org/10.5220/0005352802560261","url":null,"abstract":"Supporting individuals who lack experience or competence to evaluate an overwhelming amout of information such as from cultural, scientific and educational content makes recommender system invaluable to cope with the information overload problem. However, even recommended information scales up and users still need to consider large number of items. Visualization takes a foreground role, letting the user explore possibly interesting results. It leverages the high bandwidth of the human visual system to convey massive amounts of information. This paper argues the need to automate the creation of visualizations for unstructured data adapting it to the user’s preferences. We describe a prototype solution, taking a radical approach considering both grounded visual perception guidelines and personalized recommendations to suggest the proper visualization.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123122193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005316503000306
Evgheni Polisciuc, P. Cruz, Hugo Amaro, Catarina Maçãs, Tiago Carvalho, Frederico Santos, P. Machado
Representing large amounts of flows involves dealing with the representation of directionality and the reduction of visual cluttering. This article describes the application of two flow representation techniques to the visualization of transitions of customers among supermarkets over time. The first approach relies in arc representations together with a combination of methods to represent directionality of transitions. The other approach uses a swarm-based system in order to reduce visual clutter, bundling edges in an organic fashion and improving clarity.
{"title":"Arc and Swarm-based Representations of Customer's Flows among Supermarkets","authors":"Evgheni Polisciuc, P. Cruz, Hugo Amaro, Catarina Maçãs, Tiago Carvalho, Frederico Santos, P. Machado","doi":"10.5220/0005316503000306","DOIUrl":"https://doi.org/10.5220/0005316503000306","url":null,"abstract":"Representing large amounts of flows involves dealing with the representation of directionality and the reduction of visual cluttering. This article describes the application of two flow representation techniques to the visualization of transitions of customers among supermarkets over time. The first approach relies in arc representations together with a combination of methods to represent directionality of transitions. The other approach uses a swarm-based system in order to reduce visual clutter, bundling edges in an organic fashion and improving clarity.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"23 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113968168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005355601770181
H. Sayoud
In this paper, we present a visual analytics based investigation for the task of authorship attribution of the holy Quran with regards to the Hadith Author (the Prophet). This can be seen as an authorship discrimination task between the two religious books: Quran vs Hadith. The first book represents the Divine book written by Allah (God) as claimed by the Prophet Muhammad, whereas the second one represents a collection of certified Prophet’s statements. Two visual analytics clustering methods are employed, namely: a Hierarchical Clustering and Fuzzy Cmean Clustering. On the other hand, seven types of NLP features are combined and normalized by PCA reduction before the classification process. The visual analytics results have revealed interesting results in 2D and 3D disposition. In summary, they show two main clusters in both experiments: Quran cluster and Hadith cluster; and the disposition of the resulting clusters corresponds to a clear authorship distinction between the two religious books.
{"title":"A Visual Analytics based Investigation on the Authorship of the Holy Quran","authors":"H. Sayoud","doi":"10.5220/0005355601770181","DOIUrl":"https://doi.org/10.5220/0005355601770181","url":null,"abstract":"In this paper, we present a visual analytics based investigation for the task of authorship attribution of the holy Quran with regards to the Hadith Author (the Prophet). This can be seen as an authorship discrimination task between the two religious books: Quran vs Hadith. The first book represents the Divine book written by Allah (God) as claimed by the Prophet Muhammad, whereas the second one represents a collection of certified Prophet’s statements. Two visual analytics clustering methods are employed, namely: a Hierarchical Clustering and Fuzzy Cmean Clustering. On the other hand, seven types of NLP features are combined and normalized by PCA reduction before the classification process. The visual analytics results have revealed interesting results in 2D and 3D disposition. In summary, they show two main clusters in both experiments: Quran cluster and Hadith cluster; and the disposition of the resulting clusters corresponds to a clear authorship distinction between the two religious books.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132156368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005251702090218
Lisa Falschlunger, Christoph Eisl, Heimo Losbichler, Elisabeth Grabmann
The success of visualisations is determined by the ability of users to retrieve relevant information in an effective and efficient way. The way in which information is perceived can be analysed by examining visual search strategies of users. Visual search strategies in graphical representations however, are individual and have not been well explored up to now. Recent studies show that eye tracking experiments help in gaining new insights into these strategies. Apart from error rates and task completion times, eye tracking focuses on the way observers of visualisations read and make sense of the presented stimulus. In this way sequential strategies can be analysed, compared and used in order to optimize graphical layouts. In this study we use the approach of Parallel Scan Path visualisation in combination with Levenshtein Distance to determine similarities between search strings when viewing graphical representations in standardized business communication. This study shows a positive correlation between search strategies and task completion time and allows the evaluation of different design layouts. Positive significant effects can be detected when examining experience (with respect to standardized and repetitive reporting) and layout optimization (with respect to graphical representations and page layout). Optimal search strategies can be identified when users are experienced and using an optimized layout.
{"title":"Report Optimization using Visual Search Strategies - An Experimental Study with Eye Tracking Technology","authors":"Lisa Falschlunger, Christoph Eisl, Heimo Losbichler, Elisabeth Grabmann","doi":"10.5220/0005251702090218","DOIUrl":"https://doi.org/10.5220/0005251702090218","url":null,"abstract":"The success of visualisations is determined by the ability of users to retrieve relevant information in an effective and efficient way. The way in which information is perceived can be analysed by examining visual search strategies of users. Visual search strategies in graphical representations however, are individual and have not been well explored up to now. Recent studies show that eye tracking experiments help in gaining new insights into these strategies. Apart from error rates and task completion times, eye tracking focuses on the way observers of visualisations read and make sense of the presented stimulus. In this way sequential strategies can be analysed, compared and used in order to optimize graphical layouts. In this study we use the approach of Parallel Scan Path visualisation in combination with Levenshtein Distance to determine similarities between search strings when viewing graphical representations in standardized business communication. This study shows a positive correlation between search strategies and task completion time and allows the evaluation of different design layouts. Positive significant effects can be detected when examining experience (with respect to standardized and repetitive reporting) and layout optimization (with respect to graphical representations and page layout). Optimal search strategies can be identified when users are experienced and using an optimized layout.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133747425","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005307702390246
Catarina Maçãs, P. Cruz, Hugo Amaro, Evgheni Polisciuc, Tiago Carvalho, Frederico Santos, P. Machado
The evolution of technology is changing how people work within organizations. Information about customer consumption leads to a new era of business intelligence, wherein Big Data is analyzed to improve business. In this project we apply information visualization in the context of Big Data for product’s consumption. The aim of this project is to visualize the evolution of consumption, to detect typical and periodic behaviors and emphasize the atypical ones. In this article we present our workflow—from finding periodic behaviors to create a final visualization using time-series and small-multiples techniques. With the final visualization we are able to show consumption behaviors and highlight the deviations from typical consumption days.
{"title":"Time-series Application on Big Data - Visualization of Consumption in Supermarkets","authors":"Catarina Maçãs, P. Cruz, Hugo Amaro, Evgheni Polisciuc, Tiago Carvalho, Frederico Santos, P. Machado","doi":"10.5220/0005307702390246","DOIUrl":"https://doi.org/10.5220/0005307702390246","url":null,"abstract":"The evolution of technology is changing how people work within organizations. Information about customer consumption leads to a new era of business intelligence, wherein Big Data is analyzed to improve business. In this project we apply information visualization in the context of Big Data for product’s consumption. The aim of this project is to visualize the evolution of consumption, to detect typical and periodic behaviors and emphasize the atypical ones. In this article we present our workflow—from finding periodic behaviors to create a final visualization using time-series and small-multiples techniques. With the final visualization we are able to show consumption behaviors and highlight the deviations from typical consumption days.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124169773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005303801230130
H. Schmauder, Michael Burch, D. Weiskopf
Graphs are traditionally represented as node-link diagrams, but these typically suffer from visual clutter when they become denser, i.e. more vertices and edges are present in the data set. Partial link drawings have been introduced for node-link diagrams aiming at reducing visual clutter caused by link crossings. Although this concept was shown to perform well for some parameter settings, it has not been used for visually encoding dynamic weighted digraphs. In this paper we investigate the problem of visualizing time-varying graphs as one node-link diagram in a specific layout by exploiting the links as timelines. Partially drawn links are used to show the graph dynamics by splitting each link into as many segments as time steps have to be represented. Conventional 2D layout algorithms can be applied while simultaneously showing the evolution over time. Color-coded links represent the changing weights. We use tapered links to reduce possible overlaps at the link target nodes that would occur when using traditional arrow-based directed links. We experiment with different graph layouts and different numbers of data dimensions, i.e. number of vertices, edges, and time steps. We illustrate the usefulness of the technique in a case study investigating dynamic migration data.
{"title":"Visualizing Dynamic Weighted Digraphs with Partial Links","authors":"H. Schmauder, Michael Burch, D. Weiskopf","doi":"10.5220/0005303801230130","DOIUrl":"https://doi.org/10.5220/0005303801230130","url":null,"abstract":"Graphs are traditionally represented as node-link diagrams, but these typically suffer from visual clutter when they become denser, i.e. more vertices and edges are present in the data set. Partial link drawings have been introduced for node-link diagrams aiming at reducing visual clutter caused by link crossings. Although this concept was shown to perform well for some parameter settings, it has not been used for visually encoding dynamic weighted digraphs. In this paper we investigate the problem of visualizing time-varying graphs as one node-link diagram in a specific layout by exploiting the links as timelines. Partially drawn links are used to show the graph dynamics by splitting each link into as many segments as time steps have to be represented. Conventional 2D layout algorithms can be applied while simultaneously showing the evolution over time. Color-coded links represent the changing weights. We use tapered links to reduce possible overlaps at the link target nodes that would occur when using traditional arrow-based directed links. We experiment with different graph layouts and different numbers of data dimensions, i.e. number of vertices, edges, and time steps. We illustrate the usefulness of the technique in a case study investigating dynamic migration data.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127669579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005315102470255
M. Nielsen, Kaj Grønbæk
This paper presents a novel approach AffinityViz to visualize live and aggregated consumption data from multistory buildings. The objective of the approach is to provide a generic but high affinity relation between real buildings’ spatial layouts and the consumption data visualizations. Current approaches come short on maintaining such affinity. This implies an avoidable cognitive load on users such as energy managers and facility managers who need to monitor consumption and make decisions from consumption data. To alleviate this we have transformed three conventional types of visualizations into highly affine visualizations lowering the cognitive load for users. The contributions are: 1) Development of the AffinityViz techniques featuring three generic designs of highly affine visualizations of consumption data. 2) Comparison of the affine visualizations with the conventional visualizations. 3) Initial evaluation of the AffinityViz designs by expert users on real world data. Finally, the design challenges of AffinityViz are discussed, including prospects for AffinityViz as a future tool for visual analysis of data from buildings.
{"title":"Towards Highly Affine Visualizations of Consumption Data from Buildings","authors":"M. Nielsen, Kaj Grønbæk","doi":"10.5220/0005315102470255","DOIUrl":"https://doi.org/10.5220/0005315102470255","url":null,"abstract":"This paper presents a novel approach AffinityViz to visualize live and aggregated consumption data from multistory buildings. The objective of the approach is to provide a generic but high affinity relation between real buildings’ spatial layouts and the consumption data visualizations. Current approaches come short on maintaining such affinity. This implies an avoidable cognitive load on users such as energy managers and facility managers who need to monitor consumption and make decisions from consumption data. To alleviate this we have transformed three conventional types of visualizations into highly affine visualizations lowering the cognitive load for users. The contributions are: 1) Development of the AffinityViz techniques featuring three generic designs of highly affine visualizations of consumption data. 2) Comparison of the affine visualizations with the conventional visualizations. 3) Initial evaluation of the AffinityViz designs by expert users on real world data. Finally, the design challenges of AffinityViz are discussed, including prospects for AffinityViz as a future tool for visual analysis of data from buildings.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128928680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005344703070310
S. Maas, H. M. Overhoff
Real time volume rendering of medical datasets using raycasting on graphics processing units (GPUs) is a common technique. Since more than 10 years there are two established approaches for realizing GPU ray casting: multi-pass (Kruger and Westermann, 2003) and single-pass (Röttger, et al., 2003). But the required parameters to choose the optimal raycasting technique for a given application are still unknown. To solve this issue both raycasting techniques were implemented for different raycasting types using OpenGLSL vertex and fragment shaders. The different techniques and types were compared regarding execution times. The results of this comparison show that there is no technique faster in general. The higher the computational load the more indicates the use of the multi-pass technique.
{"title":"OpenGLSL-based Raycasting - Comparison of Execution Durations of Multi-pass vs. Single-pass Technique","authors":"S. Maas, H. M. Overhoff","doi":"10.5220/0005344703070310","DOIUrl":"https://doi.org/10.5220/0005344703070310","url":null,"abstract":"Real time volume rendering of medical datasets using raycasting on graphics processing units (GPUs) is a common technique. Since more than 10 years there are two established approaches for realizing GPU ray casting: multi-pass (Kruger and Westermann, 2003) and single-pass (Röttger, et al., 2003). But the required parameters to choose the optimal raycasting technique for a given application are still unknown. To solve this issue both raycasting techniques were implemented for different raycasting types using OpenGLSL vertex and fragment shaders. The different techniques and types were compared regarding execution times. The results of this comparison show that there is no technique faster in general. The higher the computational load the more indicates the use of the multi-pass technique.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128399133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.5220/0005199600770084
F. Haag, T. Schlegel, T. Ertl
With the advent of linked data sources, transportation information systems are no longer limited to indicating how to get from one location to another. They can suggest where to go shopping on the way or plan several synchronized itineraries for groups of travelers. Along with these developments, information about stopovers evolves from mere additional data to a crucial part of the itinerary. However, current time-based visualizations of itineraries cannot adequately convey the stopovers contained in an itinerary. We propose a time-locationbased itinerary visualization that can be used when planning trips, which allows for the easy comparison of itineraries with different routes, and for aligning itineraries of several travelers in collaborative scenarios. We describe the visualization concept and report on a user study that confirms the basic ideas and provides a number of insights on how the visualization can be developed further.
{"title":"A Time-location-Based Itinerary Visualization","authors":"F. Haag, T. Schlegel, T. Ertl","doi":"10.5220/0005199600770084","DOIUrl":"https://doi.org/10.5220/0005199600770084","url":null,"abstract":"With the advent of linked data sources, transportation information systems are no longer limited to indicating how to get from one location to another. They can suggest where to go shopping on the way or plan several synchronized itineraries for groups of travelers. Along with these developments, information about stopovers evolves from mere additional data to a crucial part of the itinerary. However, current time-based visualizations of itineraries cannot adequately convey the stopovers contained in an itinerary. We propose a time-locationbased itinerary visualization that can be used when planning trips, which allows for the easy comparison of itineraries with different routes, and for aligning itineraries of several travelers in collaborative scenarios. We describe the visualization concept and report on a user study that confirms the basic ideas and provides a number of insights on how the visualization can be developed further.","PeriodicalId":326087,"journal":{"name":"International Conference on Information Visualization Theory and Applications","volume":"483 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132226297","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
扫码关注我们
求助内容：
应助结果提醒方式：