Pub Date : 2004-03-29DOI: 10.1109/AINA.2004.1283886
Koman Chan, Long-Wen Chang
A lot of digital watermarking techniques have been proposed to resolve the issues of copyright protection. However, almost proposed watermarking methods keep the watermarking algorithm private to ensure the embedded watermark secret. If the watermarking technique needs to be widespread applied to realistic multimedia environment, the algorithm used by watermarking techniques should be public. In this paper, a novel watermarking scheme which can be public is presented. The proposed watermarking technique is developed based on the following criterions: (1) the watermarking algorithm is open; (2) the embedded watermark can be extracted and embedded by the people who own the secret key. The watermarking scheme employs the advance encryption standard (AES) and the Reed-Solomon code, to make the watermarking algorithm public. Simulation shows that the proposed algorithm can be very robust to resolve the ownership of the digital image.
{"title":"A novel public watermarking system based on advanced encryption system","authors":"Koman Chan, Long-Wen Chang","doi":"10.1109/AINA.2004.1283886","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283886","url":null,"abstract":"A lot of digital watermarking techniques have been proposed to resolve the issues of copyright protection. However, almost proposed watermarking methods keep the watermarking algorithm private to ensure the embedded watermark secret. If the watermarking technique needs to be widespread applied to realistic multimedia environment, the algorithm used by watermarking techniques should be public. In this paper, a novel watermarking scheme which can be public is presented. The proposed watermarking technique is developed based on the following criterions: (1) the watermarking algorithm is open; (2) the embedded watermark can be extracted and embedded by the people who own the secret key. The watermarking scheme employs the advance encryption standard (AES) and the Reed-Solomon code, to make the watermarking algorithm public. Simulation shows that the proposed algorithm can be very robust to resolve the ownership of the digital image.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132710819","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283915
Dongkeun Lee, Keecheon Kim, Moonhae Kim
One of the issues in designing a mobile network with MR-HA bidirectional tunnel is to solve the route optimization problem in the nested mobile networks. Since the aggregated hierarchy of mobile networks becomes a single nested mobile network, in order to forward packets to the nested mobile network nodes, multiple levels of bidirectional nested tunnels are required. However, the multiple levels of bidirectional tunnels lead to an undesirable overhead. We propose a hierarchical mechanism that allows direct packet tunneling between HA and MR without nested tunnels.
{"title":"Hierarchical route optimization for nested mobile network","authors":"Dongkeun Lee, Keecheon Kim, Moonhae Kim","doi":"10.1109/AINA.2004.1283915","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283915","url":null,"abstract":"One of the issues in designing a mobile network with MR-HA bidirectional tunnel is to solve the route optimization problem in the nested mobile networks. Since the aggregated hierarchy of mobile networks becomes a single nested mobile network, in order to forward packets to the nested mobile network nodes, multiple levels of bidirectional nested tunnels are required. However, the multiple levels of bidirectional tunnels lead to an undesirable overhead. We propose a hierarchical mechanism that allows direct packet tunneling between HA and MR without nested tunnels.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134111960","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283840
H. Kimiyama, K. Shimizu, T. Kawano, T. Ogura, M. Maruyama
Integration of a high-resolution video (such as HDTV) delivery system for IP networks with legacy DBMSs and WWW systems, would make it easy to achieve system for a remote video editing, remote education and digital cinema. For this reason, we have developed a streaming server for IP networks is based on the MAPOS link-layer protocol and has a 2.48-Gbps line speed. The MAPOS protocol enables IP networks over SONET/SDH. The streaming server is constructed on a typical PC with Linux. Choosing a PC and Linux provides high performance at low cost to users. Real-time processing is important if we are to send video data at a specified rate. To implement a streaming server that can deliver Gbps video streams, we developed a real-time processing method specifically for this platform. Consequently, we obtained real-time performance for a streaming server in which the method was implemented. To evaluate its performance, we measured the receiving rate and jitter on receiving terminal while the server was delivering video streams at rates from 1.5 to 2.4 Gbps. The jitter indicates the receive-buffer size that is required and the initial delay which should be inserted before playback. For video delivery at 1.5 Gbps, the maximum buffer size was shown to be 936 KBytes (5.1 msec) and initial delay was 3.0 msec. These results show the practicability of constructing a system for ultra high-speed video (including 1.5-Gbps uncompressed HDTV) delivery with a very short response time within one video frame.
{"title":"Real-time processing method for an ultra high-speed streaming server running PC Linux","authors":"H. Kimiyama, K. Shimizu, T. Kawano, T. Ogura, M. Maruyama","doi":"10.1109/AINA.2004.1283840","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283840","url":null,"abstract":"Integration of a high-resolution video (such as HDTV) delivery system for IP networks with legacy DBMSs and WWW systems, would make it easy to achieve system for a remote video editing, remote education and digital cinema. For this reason, we have developed a streaming server for IP networks is based on the MAPOS link-layer protocol and has a 2.48-Gbps line speed. The MAPOS protocol enables IP networks over SONET/SDH. The streaming server is constructed on a typical PC with Linux. Choosing a PC and Linux provides high performance at low cost to users. Real-time processing is important if we are to send video data at a specified rate. To implement a streaming server that can deliver Gbps video streams, we developed a real-time processing method specifically for this platform. Consequently, we obtained real-time performance for a streaming server in which the method was implemented. To evaluate its performance, we measured the receiving rate and jitter on receiving terminal while the server was delivering video streams at rates from 1.5 to 2.4 Gbps. The jitter indicates the receive-buffer size that is required and the initial delay which should be inserted before playback. For video delivery at 1.5 Gbps, the maximum buffer size was shown to be 936 KBytes (5.1 msec) and initial delay was 3.0 msec. These results show the practicability of constructing a system for ultra high-speed video (including 1.5-Gbps uncompressed HDTV) delivery with a very short response time within one video frame.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133011426","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283955
Wang Zhen-xing, Wang He-ming, Sun Ya-min
IP routing lookup schemes using single-step TCAM used in core routers demand entries being sorted according to prefix lengths in descending order relative to TCAM addresses. The sorting operations related to addresses have disadvantageous affections to the entry updating speed and lookup continuity. This paper provides a novel IPv4/IPv6 dual-stack routing lookup method based on BSPL (bi-search on prefix length), which using multi-step TCAM pipelining based on bi-search on prefix length. Its outstanding advantages include that no entry sorting is needed, lookup speed is high, entry updating is completed fast with pipelining, and lookup continuity is enhanced. It satisfies wire-speed (48B-packet) forwarding of OC-768 (40Gbps) interfaces of IPv4/IPv6 dual-stack core routers.
{"title":"High-performance IPv4/IPv6 dual-stack routing lookup","authors":"Wang Zhen-xing, Wang He-ming, Sun Ya-min","doi":"10.1109/AINA.2004.1283955","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283955","url":null,"abstract":"IP routing lookup schemes using single-step TCAM used in core routers demand entries being sorted according to prefix lengths in descending order relative to TCAM addresses. The sorting operations related to addresses have disadvantageous affections to the entry updating speed and lookup continuity. This paper provides a novel IPv4/IPv6 dual-stack routing lookup method based on BSPL (bi-search on prefix length), which using multi-step TCAM pipelining based on bi-search on prefix length. Its outstanding advantages include that no entry sorting is needed, lookup speed is high, entry updating is completed fast with pipelining, and lookup continuity is enhanced. It satisfies wire-speed (48B-packet) forwarding of OC-768 (40Gbps) interfaces of IPv4/IPv6 dual-stack core routers.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115127058","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283832
A. Seleznyov, S. Hailes
The conceptual architecture of the access control system described here is based on automatic distributed acquisition and processing of knowledge about users and devices in computer networks. It uses autonomous agents for distributed knowledge management. Agents grouped into distributed communities act as mediators between users/devices and network resources. Communicating with each other, they make decisions about whether a certain user or device can be given access to a requested resource. In other words, agents in our system perform user/device authentication, authorisation, and maintenance of user credentials.
{"title":"An access control model based on distributed knowledge management","authors":"A. Seleznyov, S. Hailes","doi":"10.1109/AINA.2004.1283832","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283832","url":null,"abstract":"The conceptual architecture of the access control system described here is based on automatic distributed acquisition and processing of knowledge about users and devices in computer networks. It uses autonomous agents for distributed knowledge management. Agents grouped into distributed communities act as mediators between users/devices and network resources. Communicating with each other, they make decisions about whether a certain user or device can be given access to a requested resource. In other words, agents in our system perform user/device authentication, authorisation, and maintenance of user credentials.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134054699","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283884
Satoshi Itaya, Takuya Tojo, T. Enokido, Rozeta Miho, M. Takizawa
A large-scale network like the Internet is composed of various types of communication channels. Here, each communication channel supports quality of service (QoS) which may be different from others. In group communication, each process sends a message to multiple processes while receiving messages from multiple processes. In addition, messages are required to be causally delivered. In order to realize the atomic and ordered delivery of messages, even if a process with enough QoS channel receives messages, the process has to wait to deliver the messages until another process with lower QoS channel receives the messages. Thus, multimedia data cannot be delivered to processes so as to satisfy the real-time constraint if a slower process is included in a group. In this paper, we discuss group communication protocols by which multimedia messages can be delivered to a process with same time constraint properties which satisfy QoS requirements of multimedia messages.
{"title":"QoS-based synchronous/asynchronous data transmission model in group communication","authors":"Satoshi Itaya, Takuya Tojo, T. Enokido, Rozeta Miho, M. Takizawa","doi":"10.1109/AINA.2004.1283884","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283884","url":null,"abstract":"A large-scale network like the Internet is composed of various types of communication channels. Here, each communication channel supports quality of service (QoS) which may be different from others. In group communication, each process sends a message to multiple processes while receiving messages from multiple processes. In addition, messages are required to be causally delivered. In order to realize the atomic and ordered delivery of messages, even if a process with enough QoS channel receives messages, the process has to wait to deliver the messages until another process with lower QoS channel receives the messages. Thus, multimedia data cannot be delivered to processes so as to satisfy the real-time constraint if a slower process is included in a group. In this paper, we discuss group communication protocols by which multimedia messages can be delivered to a process with same time constraint properties which satisfy QoS requirements of multimedia messages.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133195680","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283972
Nigel H. Lin, L. Korba, George Yee, T. Shih, H. Lin
While there has been considerable development of tools for distance education, there has been relatively little work focused on how to offer users security and privacy during learning activities. This paper focuses on how tool development can combine with security to provide a safe, efficient, and effective learning environment. We present a number of distance education applications developed in our lab and show how security and privacy may be integrated into these applications.
{"title":"Security and privacy technologies for distance education applications","authors":"Nigel H. Lin, L. Korba, George Yee, T. Shih, H. Lin","doi":"10.1109/AINA.2004.1283972","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283972","url":null,"abstract":"While there has been considerable development of tools for distance education, there has been relatively little work focused on how to offer users security and privacy during learning activities. This paper focuses on how tool development can combine with security to provide a safe, efficient, and effective learning environment. We present a number of distance education applications developed in our lab and show how security and privacy may be integrated into these applications.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129368251","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283754
G. Feng
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multipath-constrained (MCP) or multiconstrained optimal-path (MCOP) quality of service (QoS) routing problems, which are NP-complete. Heuristic algorithm H/spl I.bar/MCOP proposed by Korkmaz et al. has been widely recognized for its low time complexity and high probability of finding feasible solutions. The performance of this heuristic is reinvestigated under several special cases. Simulation results indicate that in some cases its probability of finding feasible solutions is unexpectedly low. Such observation, which is further used to explain the performance of a heuristic based on H-MCOP, is of extreme importance when designing any higher-level QoS routing algorithms that need to use H/spl I.bar/MCOP to find feasible solutions.
{"title":"On the performance of heuristic H/spl I.bar/MCOP for multi-constrained optimal-path QoS routing","authors":"G. Feng","doi":"10.1109/AINA.2004.1283754","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283754","url":null,"abstract":"Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multipath-constrained (MCP) or multiconstrained optimal-path (MCOP) quality of service (QoS) routing problems, which are NP-complete. Heuristic algorithm H/spl I.bar/MCOP proposed by Korkmaz et al. has been widely recognized for its low time complexity and high probability of finding feasible solutions. The performance of this heuristic is reinvestigated under several special cases. Simulation results indicate that in some cases its probability of finding feasible solutions is unexpectedly low. Such observation, which is further used to explain the performance of a heuristic based on H-MCOP, is of extreme importance when designing any higher-level QoS routing algorithms that need to use H/spl I.bar/MCOP to find feasible solutions.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126194815","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283934
Kazuo Takahata, Noriki Uchida, Y. Shibata
Wireless networks make us expect the realization of new applications using distributed multimedia like the advanced traffic system, the disaster prevention system, and the adhoc network system. However, since the network bandwidth over wireless network is not stable and limited because of higher packet loss rate inherently compared with wired networks, more careful QOS guaranteed function have to be introduced when video streaming service is provided. In this paper, we introduce the optimal control method to determine how to transmit the compressed video packets from server to client so that the required network bandwidth is minimized and network input/out buffers are optimized. Client server model for video streaming is proposed and numerical equations are formulated. The optimal sending data rate from server is derived and the temporal buffer occupancy is calculated. Computational result using the actual video data indicates the effectiveness of the suggested video data transmission.
{"title":"Optimal data rate control for video stream transmission over wireless network","authors":"Kazuo Takahata, Noriki Uchida, Y. Shibata","doi":"10.1109/AINA.2004.1283934","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283934","url":null,"abstract":"Wireless networks make us expect the realization of new applications using distributed multimedia like the advanced traffic system, the disaster prevention system, and the adhoc network system. However, since the network bandwidth over wireless network is not stable and limited because of higher packet loss rate inherently compared with wired networks, more careful QOS guaranteed function have to be introduced when video streaming service is provided. In this paper, we introduce the optimal control method to determine how to transmit the compressed video packets from server to client so that the required network bandwidth is minimized and network input/out buffers are optimized. Client server model for video streaming is proposed and numerical equations are formulated. The optimal sending data rate from server is derived and the temporal buffer occupancy is calculated. Computational result using the actual video data indicates the effectiveness of the suggested video data transmission.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129853598","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283908
Ryosuke Komatsu, Jianhua Ma, Qun Jin
This paper presents a multiagent system to assist a teacher managing his/her course contents placed on Web servers. In this system there is a set of agents and every agent may work independently from or collaboratively with others. Once generated, an agent can reside in a teacher's daily working computer (called administration host) or a proxy host, and can move between the two hosts. Each agent is devoted to one piece of job and all of them, as a whole, coordinately conduct a sequence of management work during the entire process of teaching a course. A teacher may administrate agents via a specific system shell on his/her administration host, or a usual Web browser on another computer/PDA/mobile phone. The system has been carefully modularized, and thus a new type of agent, if necessary, can be relatively easily developed and quickly incorporated into the system to further enhance or extend its management capability.
{"title":"A multi-agent system for online course content management","authors":"Ryosuke Komatsu, Jianhua Ma, Qun Jin","doi":"10.1109/AINA.2004.1283908","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283908","url":null,"abstract":"This paper presents a multiagent system to assist a teacher managing his/her course contents placed on Web servers. In this system there is a set of agents and every agent may work independently from or collaboratively with others. Once generated, an agent can reside in a teacher's daily working computer (called administration host) or a proxy host, and can move between the two hosts. Each agent is devoted to one piece of job and all of them, as a whole, coordinately conduct a sequence of management work during the entire process of teaching a course. A teacher may administrate agents via a specific system shell on his/her administration host, or a usual Web browser on another computer/PDA/mobile phone. The system has been carefully modularized, and thus a new type of agent, if necessary, can be relatively easily developed and quickly incorporated into the system to further enhance or extend its management capability.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126440277","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
扫码关注我们
求助内容：
应助结果提醒方式：