In this paper we show how an interactive system can be distributed among several peer devices. By taking advantage of the current trend towards ambient intelligent environments, we can make use of a combination of computing resources in the surrounding of the user to function as one logical interactive system; an interaction space. Our approach relies on the fact that nowadays most computing resources are network enabled and publish their device profile using some special purpose protocol. For this reason, federations of devices that support the tasks of the user can be composed automatically according to the requirements of these tasks. This distribution of the user interface over a federation of devices can be local or nonlocal. It raises the opportunity for supporting collaborative tasks with the same user interface with little or no extra effort from the user interface designer. Future tools supporting the design, creation and deployment of distributed interactive systems using device federations should maintain usability and usefulness of a dynamic distributed system. We use two different metrics to cope with these problems: interface completeness and interface continuity.
{"title":"Distributed user interface elements to support smart interaction spaces","authors":"K. Luyten, K. Coninx","doi":"10.1109/ISM.2005.52","DOIUrl":"https://doi.org/10.1109/ISM.2005.52","url":null,"abstract":"In this paper we show how an interactive system can be distributed among several peer devices. By taking advantage of the current trend towards ambient intelligent environments, we can make use of a combination of computing resources in the surrounding of the user to function as one logical interactive system; an interaction space. Our approach relies on the fact that nowadays most computing resources are network enabled and publish their device profile using some special purpose protocol. For this reason, federations of devices that support the tasks of the user can be composed automatically according to the requirements of these tasks. This distribution of the user interface over a federation of devices can be local or nonlocal. It raises the opportunity for supporting collaborative tasks with the same user interface with little or no extra effort from the user interface designer. Future tools supporting the design, creation and deployment of distributed interactive systems using device federations should maintain usability and usefulness of a dynamic distributed system. We use two different metrics to cope with these problems: interface completeness and interface continuity.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"114 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":"115159095","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, a secure and adaptive multimedia transmission framework is proposed to maintain the quality of service (QoS) of the multimedia streams during the denial-of service (DoS) attacks. A DoS attack generates a large amount of traffic, which will occupy the bandwidth and degrade the quality of video. The proposed framework consists of two components: intrusion detection and adaptive transmission management. The intrusion detection component monitors the incoming traffic to the server, detects the attacks, and interacts with the adaptive transmission management component; while the adaptive transmission management component is designed to improve QoS of the video via the efficient utilization of the network resources. With the detection of the DoS attacks, the bandwidth occupied by the attacks can be reduced and protected for video transmission. The results of our preliminary simulations in NS2 show that the quality of the multimedia stream can still be maintained during an attack.
{"title":"The protection of QoS for multimedia transmission against denial of service attacks","authors":"Hongli Luo, M. Shyu","doi":"10.1109/ISM.2005.115","DOIUrl":"https://doi.org/10.1109/ISM.2005.115","url":null,"abstract":"In this paper, a secure and adaptive multimedia transmission framework is proposed to maintain the quality of service (QoS) of the multimedia streams during the denial-of service (DoS) attacks. A DoS attack generates a large amount of traffic, which will occupy the bandwidth and degrade the quality of video. The proposed framework consists of two components: intrusion detection and adaptive transmission management. The intrusion detection component monitors the incoming traffic to the server, detects the attacks, and interacts with the adaptive transmission management component; while the adaptive transmission management component is designed to improve QoS of the video via the efficient utilization of the network resources. With the detection of the DoS attacks, the bandwidth occupied by the attacks can be reduced and protected for video transmission. The results of our preliminary simulations in NS2 show that the quality of the multimedia stream can still be maintained during an attack.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"31 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":"125009194","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 novel computational method designed to assist phonologists to anticipate the effects produced in the voice, as a result of physical and mechanical alterations of the larynx model, due to a surgery to correct dysphonia. The technique is based on images obtained from endoscopic exams of the larynx. The main objective of the study was to use the active contours method to develop a larynx model based on vocal fold and glottis movements. Starting with the recorded voice signal of subject, we filter the characteristics of the glottal pulse obtained from the image exam, assuming that the dysphonia is caused by irregularities of the larynx. The modifications made in the glottis model are used to estimate a new glottal filter, which is then added to the filtered signal. Using this method, one can obtain a new voice that maintains the individual's personal characteristics after virtual surgery modifications.
{"title":"Larynx virtual surgery","authors":"A. Montagnoli, E. Fonseca","doi":"10.1109/ISM.2005.74","DOIUrl":"https://doi.org/10.1109/ISM.2005.74","url":null,"abstract":"This paper presents a novel computational method designed to assist phonologists to anticipate the effects produced in the voice, as a result of physical and mechanical alterations of the larynx model, due to a surgery to correct dysphonia. The technique is based on images obtained from endoscopic exams of the larynx. The main objective of the study was to use the active contours method to develop a larynx model based on vocal fold and glottis movements. Starting with the recorded voice signal of subject, we filter the characteristics of the glottal pulse obtained from the image exam, assuming that the dysphonia is caused by irregularities of the larynx. The modifications made in the glottis model are used to estimate a new glottal filter, which is then added to the filtered signal. Using this method, one can obtain a new voice that maintains the individual's personal characteristics after virtual surgery modifications.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"7 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":"125012159","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}
Hye-yeon Kwon, Kwang-Ryul Jung, A. Park, Jaecheol Ryou
By mutual complemented reason of wide coverage and high data transmission, the integration and handover of SG network and WLAN is regarded as an important function for 3G beyond (B3G) mobile communication systems. The seamless mobility is one of the basic requirements for handover between these heterogeneous networks. In this paper, we present a seamless handover mechanism for UMTS and WLAN within the framework of handover architecture, IP mobility and authentication mechanism. Firstly, we review the 3GPP-specific integration architecture of UMTS and WLAN, WLAN UE-initiated tunnel mechanism, IP mobility and authentication mechanisms of both networks. Then we propose the configuration of mobile IPv6 based UMTS-WLAN overlay network and the security mechanism for reducing the handover delay. Lastly we show the operation of seamless handover in our proposed network model.
{"title":"Consideration of UMTS-WLAN seamless handover","authors":"Hye-yeon Kwon, Kwang-Ryul Jung, A. Park, Jaecheol Ryou","doi":"10.1109/ISM.2005.45","DOIUrl":"https://doi.org/10.1109/ISM.2005.45","url":null,"abstract":"By mutual complemented reason of wide coverage and high data transmission, the integration and handover of SG network and WLAN is regarded as an important function for 3G beyond (B3G) mobile communication systems. The seamless mobility is one of the basic requirements for handover between these heterogeneous networks. In this paper, we present a seamless handover mechanism for UMTS and WLAN within the framework of handover architecture, IP mobility and authentication mechanism. Firstly, we review the 3GPP-specific integration architecture of UMTS and WLAN, WLAN UE-initiated tunnel mechanism, IP mobility and authentication mechanisms of both networks. Then we propose the configuration of mobile IPv6 based UMTS-WLAN overlay network and the security mechanism for reducing the handover delay. Lastly we show the operation of seamless handover in our proposed network model.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"102 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":"122505908","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}
Broadcasters often reuse video clips while reporting news stories. New clips are added to the story as it develops replacing old clips. A subset of these video clips may be replayed as follow up stories are investigated. This pattern of video repetition can be used to impose a story level organization on video clips that are broadcast by one or more news channels. In this paper, we describe an automated system for detecting and tracking repeated video clips in news broadcasts. We begin by performing temporal video segmentation to divide the video into shots and scenes. As each frame of the video source is processed, we extract low-level video features that are used to perform repeated sequence detection in realtime. Our matching algorithms have been adapted to recognize partial clip reuse while remaining robust to minor variations in the video source. Our system then builds a set of shots relevant to the news story being tracked, called a story core, and identifies new story episodes by detecting occurrences of shots belonging to this set. The story core is allowed to evolve dynamically over time to account for additional video footage as it becomes available. This technique was evaluated on a 24-hour broadcast of CNN News channel where we were very successful locating and tracking video clips associated with selected news stories.
{"title":"Image based tracking of news stories","authors":"Jedrzej Z. Miadowicz, J. Gauch, Abhishek Shivadas","doi":"10.1109/ISM.2005.67","DOIUrl":"https://doi.org/10.1109/ISM.2005.67","url":null,"abstract":"Broadcasters often reuse video clips while reporting news stories. New clips are added to the story as it develops replacing old clips. A subset of these video clips may be replayed as follow up stories are investigated. This pattern of video repetition can be used to impose a story level organization on video clips that are broadcast by one or more news channels. In this paper, we describe an automated system for detecting and tracking repeated video clips in news broadcasts. We begin by performing temporal video segmentation to divide the video into shots and scenes. As each frame of the video source is processed, we extract low-level video features that are used to perform repeated sequence detection in realtime. Our matching algorithms have been adapted to recognize partial clip reuse while remaining robust to minor variations in the video source. Our system then builds a set of shots relevant to the news story being tracked, called a story core, and identifies new story episodes by detecting occurrences of shots belonging to this set. The story core is allowed to evolve dynamically over time to account for additional video footage as it becomes available. This technique was evaluated on a 24-hour broadcast of CNN News channel where we were very successful locating and tracking video clips associated with selected news stories.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"11 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":"124002020","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, it is presented an insight of the effects of the application of autoregressive (AR) decomposition and pole tracking to voice signals. The AR model is used to decompose the signals in a set of poles which has a correspondence to the peaks of the signals power spectral density function (PSD). The aim of this work is to show the differences in the behavior of these poles for voice signals collected from two groups of people, one with healthy glottal tract and another with nodule pathology in vocal folds.
{"title":"Application of autoregressive decomposition and pole tracking to pathological voice signals","authors":"P. Scalassara, M. E. Dajer, Carlos Dias Maciel","doi":"10.1109/ISM.2005.35","DOIUrl":"https://doi.org/10.1109/ISM.2005.35","url":null,"abstract":"In this paper, it is presented an insight of the effects of the application of autoregressive (AR) decomposition and pole tracking to voice signals. The AR model is used to decompose the signals in a set of poles which has a correspondence to the peaks of the signals power spectral density function (PSD). The aim of this work is to show the differences in the behavior of these poles for voice signals collected from two groups of people, one with healthy glottal tract and another with nodule pathology in vocal folds.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"4 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":"121267899","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}
Requirements that need to be met by multicast authentication schemes are packet authenticity, packet loss robustness, loss model independence, and denial of service (DoS) resistance. We develop an efficient multicast authentication scheme for real-time streaming applications that is resistant to denial-of-service attacks while consuming much less resources (CPU and buffer) at receivers compared to previously proposed schemes. This scheme utilizes prediction hashing (PH) and one-way key chain (OKC) techniques based on erasure codes and distillation codes. PH and OKC techniques enable the receiver to significantly reduce the CPU overhead and buffer requirements compared to other block-based solution approaches. Analysis conducted indicates that this new scheme consumes much less CPU time and buffer space than one of the recently proposed denial-of-service (DoS) resistant multicast authentication schemes, pollution resistant authenticated block streams (PRABS) (Karlof et al., 2004), by a factor of more than 5 for buffer requirement and 3 for CPU requirement.
组播认证方案需要满足的要求是报文真实性、丢包鲁棒性、丢失模型无关性和抗DoS (denial of service)。我们为实时流应用开发了一种高效的多播身份验证方案，该方案可以抵抗拒绝服务攻击，同时与之前提出的方案相比，在接收器上消耗更少的资源(CPU和缓冲区)。该方案利用基于擦除码和蒸馏码的预测哈希(PH)和单向密钥链(OKC)技术。与其他基于块的解决方案方法相比，PH和OKC技术使接收器能够显著降低CPU开销和缓冲区需求。分析表明，与最近提出的抗拒绝服务(DoS)组播认证方案——抗污染认证块流(PRABS) (Karlof et al.， 2004)相比，这种新方案消耗的CPU时间和缓冲空间要少得多，缓冲需求是5倍以上，CPU需求是3倍以上。
{"title":"Denial-of-service resistant multicast authentication protocol with prediction hashing and one-way key chain","authors":"Seonho Choi","doi":"10.1109/ISM.2005.47","DOIUrl":"https://doi.org/10.1109/ISM.2005.47","url":null,"abstract":"Requirements that need to be met by multicast authentication schemes are packet authenticity, packet loss robustness, loss model independence, and denial of service (DoS) resistance. We develop an efficient multicast authentication scheme for real-time streaming applications that is resistant to denial-of-service attacks while consuming much less resources (CPU and buffer) at receivers compared to previously proposed schemes. This scheme utilizes prediction hashing (PH) and one-way key chain (OKC) techniques based on erasure codes and distillation codes. PH and OKC techniques enable the receiver to significantly reduce the CPU overhead and buffer requirements compared to other block-based solution approaches. Analysis conducted indicates that this new scheme consumes much less CPU time and buffer space than one of the recently proposed denial-of-service (DoS) resistant multicast authentication schemes, pollution resistant authenticated block streams (PRABS) (Karlof et al., 2004), by a factor of more than 5 for buffer requirement and 3 for CPU requirement.","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":"121389180","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}
We propose a novel low-cost video-on-demand architecture for heterogeneous peer-to-peer networks. The key idea of this architecture is to aggregate peers' storage and bandwidths to facilitate on-demand video streaming. To achieve this goal, we split published videos into segments and distribute them to different peers. When watching a video, a peer searches the corresponding segments, and then aggregates bandwidths from multiple supplying peers to stream the video. Instead of relying on the powerful servers/proxies, this architecture exploits the often-underutilized peers' resources, which makes it cost-effective. We demonstrate the effectiveness of this proposed architecture through extensive simulation experiments on large, Internet-like topologies.
{"title":"Supporting low-cost video-on-demand in heterogeneous peer-to-peer networks","authors":"Xin Liu, S. Vuong","doi":"10.1109/ISM.2005.112","DOIUrl":"https://doi.org/10.1109/ISM.2005.112","url":null,"abstract":"We propose a novel low-cost video-on-demand architecture for heterogeneous peer-to-peer networks. The key idea of this architecture is to aggregate peers' storage and bandwidths to facilitate on-demand video streaming. To achieve this goal, we split published videos into segments and distribute them to different peers. When watching a video, a peer searches the corresponding segments, and then aggregates bandwidths from multiple supplying peers to stream the video. Instead of relying on the powerful servers/proxies, this architecture exploits the often-underutilized peers' resources, which makes it cost-effective. We demonstrate the effectiveness of this proposed architecture through extensive simulation experiments on large, Internet-like topologies.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"16 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":"113970733","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 wireless communications, the available throughput depends on several parameters, like physical layer, base station distance, fading and interference. Users experience changes in bandwidth within a cell and among same-technology cells, but also among different networks. Moreover, in case of video transmission, the user may specify a desired quality level. The source should encode the stream at a quality as close as possible to this value, without exceeding the available bitrate. We propose a technique to decide whether to encode at constant quality, if resources are enough, or at constant bitrate, if the throughput is not sufficient. With negligible complexity, it proved to obtain better PSNR/bitrate ratios, with respect to only constant bitrate and only constant PSNR coding. We also show this algorithm working in a realistic scenario of a user roaming among heterogeneous networks (WLAN and UMTS). Also in this case, the algorithm proved to achieve high quality/bitrate ratios.
{"title":"Hybrid bitrate/PSNR control for H.264 video streaming to roaming users","authors":"F. D. Vito, F. Ridolfo, Juan Carlos De Martin","doi":"10.1109/ISM.2005.66","DOIUrl":"https://doi.org/10.1109/ISM.2005.66","url":null,"abstract":"In wireless communications, the available throughput depends on several parameters, like physical layer, base station distance, fading and interference. Users experience changes in bandwidth within a cell and among same-technology cells, but also among different networks. Moreover, in case of video transmission, the user may specify a desired quality level. The source should encode the stream at a quality as close as possible to this value, without exceeding the available bitrate. We propose a technique to decide whether to encode at constant quality, if resources are enough, or at constant bitrate, if the throughput is not sufficient. With negligible complexity, it proved to obtain better PSNR/bitrate ratios, with respect to only constant bitrate and only constant PSNR coding. We also show this algorithm working in a realistic scenario of a user roaming among heterogeneous networks (WLAN and UMTS). Also in this case, the algorithm proved to achieve high quality/bitrate ratios.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"19 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":"132073939","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}
Kasun Wickramaratna, Min Chen, Shu‐Ching Chen, M. Shyu
In this paper, a neural network based framework for semantic event detection in soccer videos is proposed. The framework provides a robust solution for soccer goal event detection by combining the strength of multimodal analysis and the ability of neural network ensembles to reduce the generalization error. Due to the rareness of the goal events, the bootstrapped sampling method on the training set is utilized to enhance the recall of goal event detection. Then a group of component networks are trained using all the available training data. The precision of the detection is greatly improved via the following two steps. First, a pre-filtering step is employed on the test set to reduce the noisy and inconsistent data, and then an advanced weighting scheme is proposed to intelligently traverse and combine the component network predictions by taking into consideration the prediction performance of each network. A set of experiments are designed to compare the performance of different bootstrapped sampling schemes, to present the strength of the proposed weighting scheme in event detection, and to demonstrate the effectiveness of our framework for soccer goal event detection.
{"title":"Neural network based framework for goal event detection in soccer videos","authors":"Kasun Wickramaratna, Min Chen, Shu‐Ching Chen, M. Shyu","doi":"10.1109/ISM.2005.83","DOIUrl":"https://doi.org/10.1109/ISM.2005.83","url":null,"abstract":"In this paper, a neural network based framework for semantic event detection in soccer videos is proposed. The framework provides a robust solution for soccer goal event detection by combining the strength of multimodal analysis and the ability of neural network ensembles to reduce the generalization error. Due to the rareness of the goal events, the bootstrapped sampling method on the training set is utilized to enhance the recall of goal event detection. Then a group of component networks are trained using all the available training data. The precision of the detection is greatly improved via the following two steps. First, a pre-filtering step is employed on the test set to reduce the noisy and inconsistent data, and then an advanced weighting scheme is proposed to intelligently traverse and combine the component network predictions by taking into consideration the prediction performance of each network. A set of experiments are designed to compare the performance of different bootstrapped sampling schemes, to present the strength of the proposed weighting scheme in event detection, and to demonstrate the effectiveness of our framework for soccer goal event detection.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"5 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":"134091065","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
扫码关注我们
求助内容：
应助结果提醒方式：