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.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.1192895
Marie Thilliez, T. Delot, S. Lecomte, N. Bennani
The recent emergence of handheld devices and wireless networks has implied an exponential increase of terminals users. So, today, service providers have to propose new applications adapted to mobile environments. In this paper, we propose and describe a new class of distributed applications called the proximity applications. In such applications, two or more handheld devices, physically close to each other, can communicate and exchange data in a secure way. Proximity applications rely on the use of both different mobile devices and heterogeneous wireless networks. Thus, these applications need a high degree of flexibility, for an easy and rapid application development. In this context, our purpose is to study the interest of the Hybrid Peer-To-Peer (P2P) architecture model use specially for the extensibility, the fault-tolerance management and the scalability of proximity applications. Moreover, thanks to this model, proximity applications can easily face to the heterogeneity of devices and networks.
{"title":"Hybrid peer-to-peer model in proximity applications","authors":"Marie Thilliez, T. Delot, S. Lecomte, N. Bennani","doi":"10.1109/AINA.2003.1192895","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192895","url":null,"abstract":"The recent emergence of handheld devices and wireless networks has implied an exponential increase of terminals users. So, today, service providers have to propose new applications adapted to mobile environments. In this paper, we propose and describe a new class of distributed applications called the proximity applications. In such applications, two or more handheld devices, physically close to each other, can communicate and exchange data in a secure way. Proximity applications rely on the use of both different mobile devices and heterogeneous wireless networks. Thus, these applications need a high degree of flexibility, for an easy and rapid application development. In this context, our purpose is to study the interest of the Hybrid Peer-To-Peer (P2P) architecture model use specially for the extensibility, the fault-tolerance management and the scalability of proximity applications. Moreover, thanks to this model, proximity applications can easily face to the heterogeneity of devices and networks.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"7 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":"127435077","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.1192899
A. Kanzaki, T. Uemukai, T. Hara, S. Nishio
In this paper we propose a TDMA slot assignment protocol to improve the channel utilization, which controls the excessive increase of unassigned slots by changing the frame length dynamically. Our proposed protocol assigns one of the unassigned slots to a node which joins the network. If there are no unassigned slots available, our proposed protocol generates unassigned slots by depriving one of the multiple slots assigned to a node, or enlarging frame length of nodes which can cause collision with each other. Moreover, by setting frame length as a power of 2 slots, our proposed protocol provides the collision-free packet transmission among nodes with different frame length. The simulation results show that our proposed protocol improves the channel utilization dramatically as compared with the conventional protocols.
{"title":"Dynamic TDMA slot assignment in ad hoc networks","authors":"A. Kanzaki, T. Uemukai, T. Hara, S. Nishio","doi":"10.1109/AINA.2003.1192899","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192899","url":null,"abstract":"In this paper we propose a TDMA slot assignment protocol to improve the channel utilization, which controls the excessive increase of unassigned slots by changing the frame length dynamically. Our proposed protocol assigns one of the unassigned slots to a node which joins the network. If there are no unassigned slots available, our proposed protocol generates unassigned slots by depriving one of the multiple slots assigned to a node, or enlarging frame length of nodes which can cause collision with each other. Moreover, by setting frame length as a power of 2 slots, our proposed protocol provides the collision-free packet transmission among nodes with different frame length. The simulation results show that our proposed protocol improves the channel utilization dramatically as compared with the conventional protocols.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"36 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":"128653673","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}
Pub Date : 2003-03-27DOI: 10.1109/AINA.2003.1192961
Jau-Ji Shen, Tzung-Liang Hung
Along with the development of networking technology, distributed databases exist in most companies. It is important to place data in the most appropriate locations so that the efficiency of data processing can be increased and the cost of data processing can be reduced. Most recent research programs study the data allocation problems of existing distributed databases by analyzing the system operation history, such as frequency of query and data affinity. For a new distributed database system construction, a requirements analysis method based on ontology is discussed and applied to data allocation in distributed databases.
{"title":"Minimizing transmission cost for distributed database design based on ontology schema","authors":"Jau-Ji Shen, Tzung-Liang Hung","doi":"10.1109/AINA.2003.1192961","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192961","url":null,"abstract":"Along with the development of networking technology, distributed databases exist in most companies. It is important to place data in the most appropriate locations so that the efficiency of data processing can be increased and the cost of data processing can be reduced. Most recent research programs study the data allocation problems of existing distributed databases by analyzing the system operation history, such as frequency of query and data affinity. For a new distributed database system construction, a requirements analysis method based on ontology is discussed and applied to data allocation in distributed databases.","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":"129239359","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.1192948
E. Shakshuki, Yingge Wang
This paper presents a multi-agent system architecture developed to track moving objects. This architecture consists of several software agents with similar architecture and functions. An object can move freely within a predefined area, which is divided into several sub-areas based on the number of agents used in the system. Each agent is responsible for a specified sub-area. Agents are able to communicate with each other and to coordinate their activities by sharing their knowledge about the position of the moving object. Global Positioning Systems (GPS) are utilized to locate the exact position of the moving object. A GPS receiver is placed inside the moving object and serves as a signal platform that provides the desired information about its location to each agent. The main purpose of this work is to develop agents that are able to interact with the users, who are interesting in tracking some objects, and to provide them with the exact position of a moving object. This paper provides the agents' architecture, design and implementations that enable them to cooperate and communicate with each other to track a moving object. A prototype is implemented, using the ZEUS toolkit.
{"title":"Using agent-based approach to tracking moving objects","authors":"E. Shakshuki, Yingge Wang","doi":"10.1109/AINA.2003.1192948","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192948","url":null,"abstract":"This paper presents a multi-agent system architecture developed to track moving objects. This architecture consists of several software agents with similar architecture and functions. An object can move freely within a predefined area, which is divided into several sub-areas based on the number of agents used in the system. Each agent is responsible for a specified sub-area. Agents are able to communicate with each other and to coordinate their activities by sharing their knowledge about the position of the moving object. Global Positioning Systems (GPS) are utilized to locate the exact position of the moving object. A GPS receiver is placed inside the moving object and serves as a signal platform that provides the desired information about its location to each agent. The main purpose of this work is to develop agents that are able to interact with the users, who are interesting in tracking some objects, and to provide them with the exact position of a moving object. This paper provides the agents' architecture, design and implementations that enable them to cooperate and communicate with each other to track a moving object. A prototype is implemented, using the ZEUS toolkit.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"306 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":"124355680","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
扫码关注我们
求助内容：
应助结果提醒方式：