Pub Date : 2003-03-27DOI: 10.1109/AINA.2003.1192850
Hui-Huang Hsu, Chun-Jung Chen, Wen-Pin Tai
Providing appropriate learning content to each student is a key to the success of a Web-based distance learning system. Student test results can be an important feedback for the instructor to re-evaluate the course content. A test result feedback (TRF) model that analyzes the relationship between student learning time and corresponding test result is developed The model can give the instructor crucial information for course content refinement. It can also suggest the student with a personalized make-up course or appropriate advanced courses for further study. All these can be done automatically without interfering the student learning and/or increasing the instructor working load In our design, all Web courses are dynamically assembled with selected course units.
{"title":"Towards error-free and personalized Web-based courses","authors":"Hui-Huang Hsu, Chun-Jung Chen, Wen-Pin Tai","doi":"10.1109/AINA.2003.1192850","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192850","url":null,"abstract":"Providing appropriate learning content to each student is a key to the success of a Web-based distance learning system. Student test results can be an important feedback for the instructor to re-evaluate the course content. A test result feedback (TRF) model that analyzes the relationship between student learning time and corresponding test result is developed The model can give the instructor crucial information for course content refinement. It can also suggest the student with a personalized make-up course or appropriate advanced courses for further study. All these can be done automatically without interfering the student learning and/or increasing the instructor working load In our design, all Web courses are dynamically assembled with selected course units.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121724870","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192943
Ching-Te Wang, Chu-Hsing Lin, Chinchen Chang
Harn (1994) proposed a signature scheme based on the modified ElGamal scheme and claimed that the security relies on both the factorization and the discrete logarithm. That is, his scheme cannot be broken unless both of the above two problems can be solved simultaneously. Lee and Hwang (1996) showed that an attacker could generate a forged signature on the assumption when the discrete logarithm is solved. Recently, Shao (1998) proposed another two signature schemes, which the security rests on the two problems. In this paper, we propose two improved signature schemes that are really based on two hard problems simultaneously. In addition, the numbers of parameters and computations are reduced in comparison with those of Shao.
{"title":"Signature schemes based on two hard problems simultaneously","authors":"Ching-Te Wang, Chu-Hsing Lin, Chinchen Chang","doi":"10.1109/AINA.2003.1192943","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192943","url":null,"abstract":"Harn (1994) proposed a signature scheme based on the modified ElGamal scheme and claimed that the security relies on both the factorization and the discrete logarithm. That is, his scheme cannot be broken unless both of the above two problems can be solved simultaneously. Lee and Hwang (1996) showed that an attacker could generate a forged signature on the assumption when the discrete logarithm is solved. Recently, Shao (1998) proposed another two signature schemes, which the security rests on the two problems. In this paper, we propose two improved signature schemes that are really based on two hard problems simultaneously. In addition, the numbers of parameters and computations are reduced in comparison with those of Shao.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129290671","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 : 2003-03-27DOI: 10.1109/AINA.2003.1193004
Baodian Wei, Dongsu Liu, Xinmei Wang
There have not been many successful attacks against the AES algorithm Rijndael so far, of which the best known and effective attack is the Square Attack. It takes advantage of the balance property of the algorithm. A new type of attack which makes use of the activity property is proposed. The consuming time and chosen plaintexts necessary are both reduced to one tenth of the original ones. The analysis principle is described.
{"title":"Activity attack on Rijndael","authors":"Baodian Wei, Dongsu Liu, Xinmei Wang","doi":"10.1109/AINA.2003.1193004","DOIUrl":"https://doi.org/10.1109/AINA.2003.1193004","url":null,"abstract":"There have not been many successful attacks against the AES algorithm Rijndael so far, of which the best known and effective attack is the Square Attack. It takes advantage of the balance property of the algorithm. A new type of attack which makes use of the activity property is proposed. The consuming time and chosen plaintexts necessary are both reduced to one tenth of the original ones. The analysis principle is described.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856248","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192874
Qingguo Shen, Li Wang
We analyze the access behavior and traffic characteristics of typical mobile services, study and compare the performance of different adaptation approaches. For a typical unified Web site, 10% of access requests are from mobile users, 90% from PC users. The heterogeneity in the communicating devices and networks QoS characteristics need to be handled through different forms of software-supported adaptation. The two main adaptation models are server-based model and proxy-based model. The processing load of server or proxy carrying out the adaptation may increase by about 10 times or more. In order to provide differential services and increase the scalability, the server-adaptation and proxy-adaptation should coexist. They are suitable for paid and free services respectively. Paid services account for about 80% of mobile traffic, and free services account for 20%. Server and proxy processing capability should be increased by more than 2 times. Thus traffic and processing load is divided rationally.
{"title":"Performance comparison of adaptation approaches for mobile information system","authors":"Qingguo Shen, Li Wang","doi":"10.1109/AINA.2003.1192874","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192874","url":null,"abstract":"We analyze the access behavior and traffic characteristics of typical mobile services, study and compare the performance of different adaptation approaches. For a typical unified Web site, 10% of access requests are from mobile users, 90% from PC users. The heterogeneity in the communicating devices and networks QoS characteristics need to be handled through different forms of software-supported adaptation. The two main adaptation models are server-based model and proxy-based model. The processing load of server or proxy carrying out the adaptation may increase by about 10 times or more. In order to provide differential services and increase the scalability, the server-adaptation and proxy-adaptation should coexist. They are suitable for paid and free services respectively. Paid services account for about 80% of mobile traffic, and free services account for 20%. Server and proxy processing capability should be increased by more than 2 times. Thus traffic and processing load is divided rationally.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128997945","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192905
Jui-Ming Chen, Li-Der Chou
The caching technology is now commonly used to reduce the response time and save the bandwidth for hot Web accesses. The performance can be further improved by clustering several caches together, where a dispatcher is adopted to select a suitable cache from the cache cluster for each request. Therefore, ways to appropriately configure the cache cluster and design the dispatching scheme become important issues. The architecture of distributed dispatchers using the active networking technology is proposed to adaptively dispatch each request to an appropriate cache, according to network conditions and cache loads. The concept of virtual clusters, that distant caches can belong to the same cluster and a cache can belong to more than one cluster, is also proposed to balance the loads of caches globally.
{"title":"Active dispatching schemes for Web caches in mobile networks","authors":"Jui-Ming Chen, Li-Der Chou","doi":"10.1109/AINA.2003.1192905","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192905","url":null,"abstract":"The caching technology is now commonly used to reduce the response time and save the bandwidth for hot Web accesses. The performance can be further improved by clustering several caches together, where a dispatcher is adopted to select a suitable cache from the cache cluster for each request. Therefore, ways to appropriately configure the cache cluster and design the dispatching scheme become important issues. The architecture of distributed dispatchers using the active networking technology is proposed to adaptively dispatch each request to an appropriate cache, according to network conditions and cache loads. The concept of virtual clusters, that distant caches can belong to the same cluster and a cache can belong to more than one cluster, is also proposed to balance the loads of caches globally.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132320115","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192896
Jiandong Li, Z. Haas, Min Sheng, Yanhui Chen
The IEEE 802.11 multiple access control protocol was modified for use in multi-channel, multi-hop ad hoc network, through the use of a new channel-status indicator. In particular, we have evaluated the improvement due to the multi-channel use. We report in this paper on the results of the throughput per node and the end-to-end delay for the modified IEEE 802.11 protocol for different network sizes. Using these results, we were able to propose a number of throughput scaling laws. Our simulation results show that the throughputs per node with multiple channels for the line and the grid ad hoc network topologies will increase by 47.89%, and by 1.39-163%, respectively, for networks with 16 to 64 nodes, as compared with that of single channel.
{"title":"Performance evaluation of modified IEEE 802.11 MAC for multi-channel multi-hop ad hoc network","authors":"Jiandong Li, Z. Haas, Min Sheng, Yanhui Chen","doi":"10.1109/AINA.2003.1192896","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192896","url":null,"abstract":"The IEEE 802.11 multiple access control protocol was modified for use in multi-channel, multi-hop ad hoc network, through the use of a new channel-status indicator. In particular, we have evaluated the improvement due to the multi-channel use. We report in this paper on the results of the throughput per node and the end-to-end delay for the modified IEEE 802.11 protocol for different network sizes. Using these results, we were able to propose a number of throughput scaling laws. Our simulation results show that the throughputs per node with multiple channels for the line and the grid ad hoc network topologies will increase by 47.89%, and by 1.39-163%, respectively, for networks with 16 to 64 nodes, as compared with that of single channel.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132567684","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192950
Y. Murata, Katsuhisa Sugiura, S. Ishihara, F. Sato, T. Mizuno
A remote monitoring of various device distributed over wide area is strongly demanded to cut down their maintenance cost. With the introduction of wireless packet systems, the mobile remote monitoring system has started to propagate, because of a less limit to establish remote monitoring devices and its characteristic of always connectivity. Many small to medium sized corporations have been hesitating, although they understand this necessity, because of high investment costs involved in the maintenance of monitoring systems. One solution to this problem is the ASP (Application Service Provider). We developed the multi sharing mobile remote monitoring system MMRM. This paper will present the four layers object management model and the three layers application protocol stuck model that are basic design schemes of MMRM. The system structure and the function block diagram of the practical system TRM (Tokai-Remote Monitoring System) in which Toshiba Machine's TC-mini is used as a data logger will be introduced. In addition, system characteristics such as the delay period from trouble detection to sending alarm message will also be described.
{"title":"The multi-sharing mobile remote monitoring system - the four layer object management model and practical system","authors":"Y. Murata, Katsuhisa Sugiura, S. Ishihara, F. Sato, T. Mizuno","doi":"10.1109/AINA.2003.1192950","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192950","url":null,"abstract":"A remote monitoring of various device distributed over wide area is strongly demanded to cut down their maintenance cost. With the introduction of wireless packet systems, the mobile remote monitoring system has started to propagate, because of a less limit to establish remote monitoring devices and its characteristic of always connectivity. Many small to medium sized corporations have been hesitating, although they understand this necessity, because of high investment costs involved in the maintenance of monitoring systems. One solution to this problem is the ASP (Application Service Provider). We developed the multi sharing mobile remote monitoring system MMRM. This paper will present the four layers object management model and the three layers application protocol stuck model that are basic design schemes of MMRM. The system structure and the function block diagram of the practical system TRM (Tokai-Remote Monitoring System) in which Toshiba Machine's TC-mini is used as a data logger will be introduced. In addition, system characteristics such as the delay period from trouble detection to sending alarm message will also be described.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127818714","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192922
Bo Niu, K. Yi, Chun-yan Gu
A FDMA/TDM multiple access/multiplexing system based on onboard FDMA-TDM conversion is believed to be very attractive for VSAT satellite communication networks, but it has two fatal drawbacks, i.e. its on board processing equipment is too complex and it lacks flexibility in applications. This paper presents a new form of FDMA/CWTDM multiple access/multiplexing included in a Chinese patent, which can overcome the two drawbacks and suit broadband applications, where CWTDM means continuous wave time division multiplexing. In an onboard FDMA-CWTDM converter, how to implement the frequency-division demultiplexer is the most important issue. It is desired that its frequency band should be as wide as possible and the number of its channels be as great as possible. This paper emphasizes the research and design for such a demultiplexer. For the purpose, a polyphase array FFT demultiplexer module has been successfully developed based on FPGA design. Theoretical analysis and experimental results show that the demultiplexer module has very good performance and can find wide application.
{"title":"Polyphase array FFT demultiplex for broadband satellite communication networks","authors":"Bo Niu, K. Yi, Chun-yan Gu","doi":"10.1109/AINA.2003.1192922","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192922","url":null,"abstract":"A FDMA/TDM multiple access/multiplexing system based on onboard FDMA-TDM conversion is believed to be very attractive for VSAT satellite communication networks, but it has two fatal drawbacks, i.e. its on board processing equipment is too complex and it lacks flexibility in applications. This paper presents a new form of FDMA/CWTDM multiple access/multiplexing included in a Chinese patent, which can overcome the two drawbacks and suit broadband applications, where CWTDM means continuous wave time division multiplexing. In an onboard FDMA-CWTDM converter, how to implement the frequency-division demultiplexer is the most important issue. It is desired that its frequency band should be as wide as possible and the number of its channels be as great as possible. This paper emphasizes the research and design for such a demultiplexer. For the purpose, a polyphase array FFT demultiplexer module has been successfully developed based on FPGA design. Theoretical analysis and experimental results show that the demultiplexer module has very good performance and can find wide application.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115638732","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192855
Chih-Shing Tau, Tzone-I Wang
This paper proposes two improved triple parity placement schemes, the HDD1 (horizontal and dual diagonal) and HDD2 schemes, to enhance the reliability of a RAID system. Both schemes can tolerate up to three disk failures by using three types of parity information (horizontal, diagonal, and anti-diagonal parities) in RAID disk block partitions. The HDD1 scheme can reduce the occurrences of bottlenecks because its horizontal and anti-diagonal parities are uniformly distributed over a disk array, while diagonal parities are placed in a dedicated disk. The HDD2 scheme uses one more disk than HDD1 to store the horizontal parities and an additional diagonal parity, while the anti-diagonal and the diagonal parities are placed in the same way as in the HDD1 scheme, only with a minor difference. The encoding and decoding algorithms of both schemes are simple and effective. Many of the steps of the encoding and decoding algorithms can be executed in parallel. Both schemes enable a RAID to recover rapidly from up to three disk failures, with a single algorithm applied straightforwardly.
{"title":"Efficient parity placement schemes for tolerating triple disk failures in RAID architectures","authors":"Chih-Shing Tau, Tzone-I Wang","doi":"10.1109/AINA.2003.1192855","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192855","url":null,"abstract":"This paper proposes two improved triple parity placement schemes, the HDD1 (horizontal and dual diagonal) and HDD2 schemes, to enhance the reliability of a RAID system. Both schemes can tolerate up to three disk failures by using three types of parity information (horizontal, diagonal, and anti-diagonal parities) in RAID disk block partitions. The HDD1 scheme can reduce the occurrences of bottlenecks because its horizontal and anti-diagonal parities are uniformly distributed over a disk array, while diagonal parities are placed in a dedicated disk. The HDD2 scheme uses one more disk than HDD1 to store the horizontal parities and an additional diagonal parity, while the anti-diagonal and the diagonal parities are placed in the same way as in the HDD1 scheme, only with a minor difference. The encoding and decoding algorithms of both schemes are simple and effective. Many of the steps of the encoding and decoding algorithms can be executed in parallel. Both schemes enable a RAID to recover rapidly from up to three disk failures, with a single algorithm applied straightforwardly.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115774982","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192920
Yiqun Wang, Y. Hijikata, S. Nishida
In case of emergency, we need to grasp the situation and make correct assessment quickly. The video data taken from the monitoring camera is important information in the emergent situation. In our research, we attempt to build a support system for identifying the video data of the monitoring camera by dealing with video data as spatio-temporal data. We proposed a method, which displays those video data on one virtual large wall. For this presentation, the search key in our system is the location and the size of this large screen and from which direction to look. First we developed a general algorithm to index spatio-temporal data to get an idea for developing the algorithm for this search key.
{"title":"A study on a spatio-temporal data structure for managing video data from monitoring cameras","authors":"Yiqun Wang, Y. Hijikata, S. Nishida","doi":"10.1109/AINA.2003.1192920","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192920","url":null,"abstract":"In case of emergency, we need to grasp the situation and make correct assessment quickly. The video data taken from the monitoring camera is important information in the emergent situation. In our research, we attempt to build a support system for identifying the video data of the monitoring camera by dealing with video data as spatio-temporal data. We proposed a method, which displays those video data on one virtual large wall. For this presentation, the search key in our system is the location and the size of this large screen and from which direction to look. First we developed a general algorithm to index spatio-temporal data to get an idea for developing the algorithm for this search key.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129536527","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
扫码关注我们
求助内容：
应助结果提醒方式：