Pub Date : 2004-08-24DOI: 10.1109/AINA.2004.1283970
Zonghua Zhang, Hong Shen
To break the strong assumption that most of the training data for intrusion detectors are readily available with high quality, conventional SVM, robust SVM and one-class SVM are modified respectively in virtue of the idea from online support vector machine (OSVM) in this paper, and their performances are compared with that of the original algorithms. Preliminary experiments with 1998 DARPA BSM data set indicate that the modified SVMs can be trained online and the results outperform the original ones with less support vectors (SVs) and training time without decreasing detection accuracy. Both of these achievements benefit an effective online intrusion detection system significantly.
{"title":"Online training of SVMs for real-time intrusion detection","authors":"Zonghua Zhang, Hong Shen","doi":"10.1109/AINA.2004.1283970","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283970","url":null,"abstract":"To break the strong assumption that most of the training data for intrusion detectors are readily available with high quality, conventional SVM, robust SVM and one-class SVM are modified respectively in virtue of the idea from online support vector machine (OSVM) in this paper, and their performances are compared with that of the original algorithms. Preliminary experiments with 1998 DARPA BSM data set indicate that the modified SVMs can be trained online and the results outperform the original ones with less support vectors (SVs) and training time without decreasing detection accuracy. Both of these achievements benefit an effective online intrusion detection system significantly.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127502656","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.1283957
Z. Gu, Dongmin Yang, Cheeha Kim
Unlike host mobility support, network mobility is concerned with situations where an entire network changes its point of attachment to the Internet. Furthermore, we should consider the situation of several mobile networks recursively attached together. The goal of network mobility support is to provide continuous and optimal Internet access to all nodes located in the mobile network. In this paper we present a solution to support nested network mobility by extending MIPv6. Note that the IETF MIPv6 protocol is for mobile nodes and not for mobile networks according to D. B. Johnson et al. (2002). The main idea is to register a prefix binding in HA and CN with a chain of intermediate mobile router's (MRs) care-of-addresses (CoAs). To the main idea, we introduce new option; the nested care-of-address option (NCO) is used to carry a sequence of MR's CoAs in the header. The router alert option (RAO) is used to indicate that NCO is set. When RAO is set, it is not necessary to encapsulate an outgoing packet. The HA and CN can use the addresses in its binding cache to construct a Type 2 Routing Header to send packets into the mobile network. This extension allows our scheme to give an optimal routing path, avoid the tunnel-in-tunnel problem, save the bandwidth resource and reduce the computation overhead in the home network.
{"title":"Mobile IPv6 extensions to support nested mobile networks","authors":"Z. Gu, Dongmin Yang, Cheeha Kim","doi":"10.1109/AINA.2004.1283957","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283957","url":null,"abstract":"Unlike host mobility support, network mobility is concerned with situations where an entire network changes its point of attachment to the Internet. Furthermore, we should consider the situation of several mobile networks recursively attached together. The goal of network mobility support is to provide continuous and optimal Internet access to all nodes located in the mobile network. In this paper we present a solution to support nested network mobility by extending MIPv6. Note that the IETF MIPv6 protocol is for mobile nodes and not for mobile networks according to D. B. Johnson et al. (2002). The main idea is to register a prefix binding in HA and CN with a chain of intermediate mobile router's (MRs) care-of-addresses (CoAs). To the main idea, we introduce new option; the nested care-of-address option (NCO) is used to carry a sequence of MR's CoAs in the header. The router alert option (RAO) is used to indicate that NCO is set. When RAO is set, it is not necessary to encapsulate an outgoing packet. The HA and CN can use the addresses in its binding cache to construct a Type 2 Routing Header to send packets into the mobile network. This extension allows our scheme to give an optimal routing path, avoid the tunnel-in-tunnel problem, save the bandwidth resource and reduce the computation overhead in the home network.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"88 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":"116972766","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.1283925
K. Chao, M. Younas, N. Griffiths, I. Awan, R. Anane, Chen-Fang Tsai
The open grid services infrastructure (OGSI) defines a distributed system framework by integrating grid and Web services technologies to facilitate resource sharing. In OGSI, Web services are supplemented with additional features in order to meet the requirements of grid computing. However, the issue of grid service composition is not well addressed in the OGSI framework. We apply BPEL4WS (business process execution language for Web services) as a business workflow description language for the composition of grid services. We provide an in depth analysis of BPEL4WS and OGSI in terms of their similarities and differences in areas such as life cycle management, Web service instantiation and instance group management. Based on our analysis we propose a high-level architecture to compliment OGSI with BPEL4WS for defining process workflow among grid services. We describe a prototype system which shows how the proposed architecture can be used in modelling or orchestrating grid services with BPEL4WS.
{"title":"Analysis of grid service composition with BPEL4WS","authors":"K. Chao, M. Younas, N. Griffiths, I. Awan, R. Anane, Chen-Fang Tsai","doi":"10.1109/AINA.2004.1283925","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283925","url":null,"abstract":"The open grid services infrastructure (OGSI) defines a distributed system framework by integrating grid and Web services technologies to facilitate resource sharing. In OGSI, Web services are supplemented with additional features in order to meet the requirements of grid computing. However, the issue of grid service composition is not well addressed in the OGSI framework. We apply BPEL4WS (business process execution language for Web services) as a business workflow description language for the composition of grid services. We provide an in depth analysis of BPEL4WS and OGSI in terms of their similarities and differences in areas such as life cycle management, Web service instantiation and instance group management. Based on our analysis we propose a high-level architecture to compliment OGSI with BPEL4WS for defining process workflow among grid services. We describe a prototype system which shows how the proposed architecture can be used in modelling or orchestrating grid services with BPEL4WS.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"97 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":"127157264","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.1283833
Joungwoong Lee, S. Kimura, Y. Ebihara
Mobile IP is the current standard for supporting global mobility, however the performance degrades to support micro mobility. Cellular IP could be a good solution to accommodate efficiently hundreds of, thousands of mobile hosts that perform fast and frequent handoff in a small local area network. In semisoft handoff of cellular IP, a mobile host sends a semisoft packet to the new base station before performing actual handoff to guarantee that the routing cache mapping associated with the new base station is created before actual handoff takes place. But packet loss and handoff delay are still occurred by this model. We propose an advanced semisoft handoff method with no packet loss but with additional small packet delay just before or after handoff. In this method, the cross-over node calculates the time for the last message to be delivered to the mobile host via the old base station just before handoff based on four typical network models. On receiving that packet, the mobile host performs handoff to the new base station. Our simulation experiment results show that the proposed semisoft handoff method actually outperforms the traditional semisoft handoff method in both handoff packet loss and handoff delay. We study the performance of the advanced semisoft handoff method with the network models.
{"title":"Advanced semisoft handoff method of cellular IP access networks","authors":"Joungwoong Lee, S. Kimura, Y. Ebihara","doi":"10.1109/AINA.2004.1283833","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283833","url":null,"abstract":"Mobile IP is the current standard for supporting global mobility, however the performance degrades to support micro mobility. Cellular IP could be a good solution to accommodate efficiently hundreds of, thousands of mobile hosts that perform fast and frequent handoff in a small local area network. In semisoft handoff of cellular IP, a mobile host sends a semisoft packet to the new base station before performing actual handoff to guarantee that the routing cache mapping associated with the new base station is created before actual handoff takes place. But packet loss and handoff delay are still occurred by this model. We propose an advanced semisoft handoff method with no packet loss but with additional small packet delay just before or after handoff. In this method, the cross-over node calculates the time for the last message to be delivered to the mobile host via the old base station just before handoff based on four typical network models. On receiving that packet, the mobile host performs handoff to the new base station. Our simulation experiment results show that the proposed semisoft handoff method actually outperforms the traditional semisoft handoff method in both handoff packet loss and handoff delay. We study the performance of the advanced semisoft handoff method with the network models.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"31 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":"125009457","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.1283843
G. A. Ebrahim, A. Younis
A new noncumulative layered multicast congestion control algorithm is proposed that can identify the location of congested branch(es) in the multicast tree and intelligently assign a dropping preference for each candidate layer. These preferences are assigned in a way that minimizes the number of affected receivers by dropping the corresponding layer. The algorithm assigns higher dropping preferences to the layers that cause simultaneous congestion in the multicast tree. It also minimizes the effect of receivers intentionally ignoring the congestion control algorithm, which provides tighter control of the receivers, and a bounded TCP-friendly behavior. Complexity analysis proves that the proposed algorithm has a linear computation time complexity. Simulation results show that the proposed congestion control algorithm in conjunction with a suitable layer coordination mechanism can increase the average normalized throughput of the receivers in the multicast session by more than 24%.
{"title":"Active congestion control mechanism for non-cumulative layered multicasting","authors":"G. A. Ebrahim, A. Younis","doi":"10.1109/AINA.2004.1283843","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283843","url":null,"abstract":"A new noncumulative layered multicast congestion control algorithm is proposed that can identify the location of congested branch(es) in the multicast tree and intelligently assign a dropping preference for each candidate layer. These preferences are assigned in a way that minimizes the number of affected receivers by dropping the corresponding layer. The algorithm assigns higher dropping preferences to the layers that cause simultaneous congestion in the multicast tree. It also minimizes the effect of receivers intentionally ignoring the congestion control algorithm, which provides tighter control of the receivers, and a bounded TCP-friendly behavior. Complexity analysis proves that the proposed algorithm has a linear computation time complexity. Simulation results show that the proposed congestion control algorithm in conjunction with a suitable layer coordination mechanism can increase the average normalized throughput of the receivers in the multicast session by more than 24%.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"81 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":"123798108","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.1283785
Tetsuya Oh-ishi, K. Sakai, Hiroaki Matsumura, A. Kurokawa
In peer-to-peer (P2P) networks, which provide capabilities to search for and share contents via direct communication between peers, there are two typical problems. One is that a P2P network generates a lot of traffic because of the network-disastrous flooding, and the second is that quality of service depends on the peers' capabilities. As a solution to these problems, applying IP multicasting to P2P networks is proposed. We describe the basic architecture of a peer-to-peer network with an IP multicasting function.
{"title":"Architecture for a peer-to-peer network with IP multicasting","authors":"Tetsuya Oh-ishi, K. Sakai, Hiroaki Matsumura, A. Kurokawa","doi":"10.1109/AINA.2004.1283785","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283785","url":null,"abstract":"In peer-to-peer (P2P) networks, which provide capabilities to search for and share contents via direct communication between peers, there are two typical problems. One is that a P2P network generates a lot of traffic because of the network-disastrous flooding, and the second is that quality of service depends on the peers' capabilities. As a solution to these problems, applying IP multicasting to P2P networks is proposed. We describe the basic architecture of a peer-to-peer network with an IP multicasting function.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"26 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":"115098795","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.1283784
Sameera Abar, Toru Abe, Tetsuo Kinoshita
The explosive growth in online information is making it harder for large, globally distributed organizations to foster collaboration and leverage their intellectual assets. Recently, there has been a growing interest in the development of next generation knowledge management systems focussing on the artificial intelligence based technologies. We propose a generic knowledge management system architecture based on ADIPS (agent-based distributed information processing system) framework. This contributes to the stream of research on intelligent KM system to supports the creation, acquisition, management, and sharing of information that is widely distributed over a network system. It will benefit the users through the automatic provision of timely and relevant information with minimal effort to search for that information. Ontologies which stand out as a keystone of new generation of multiagent information systems, are used for the purpose of structuring the resources. This framework provides personalized information delivery, identifies items of interest to user proactively and enables unwavering management of distributed intellectual assets.
{"title":"A next generation knowledge management system architecture","authors":"Sameera Abar, Toru Abe, Tetsuo Kinoshita","doi":"10.1109/AINA.2004.1283784","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283784","url":null,"abstract":"The explosive growth in online information is making it harder for large, globally distributed organizations to foster collaboration and leverage their intellectual assets. Recently, there has been a growing interest in the development of next generation knowledge management systems focussing on the artificial intelligence based technologies. We propose a generic knowledge management system architecture based on ADIPS (agent-based distributed information processing system) framework. This contributes to the stream of research on intelligent KM system to supports the creation, acquisition, management, and sharing of information that is widely distributed over a network system. It will benefit the users through the automatic provision of timely and relevant information with minimal effort to search for that information. Ontologies which stand out as a keystone of new generation of multiagent information systems, are used for the purpose of structuring the resources. This framework provides personalized information delivery, identifies items of interest to user proactively and enables unwavering management of distributed intellectual assets.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"93 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":"115564694","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.1283803
S. Togawa, K. Kanenishi, Y. Yano
In this research, we built a system that visualizes the Web browsing activities of network users for the assistance of the network administrator. This system visualizes the Web browsing activities of an organization by making the processing object not an individual user but a user group. The network administrator can comprehend the Web browsing activities of the organization by referring to the map. This system extracts a keyword from HTML files that the users browsed. Afterwards this system develops concepts from the extracted keyword using a thesaurus. In addition, this system creates a browsing model. The features of the browsing model are emphasized by weighting. After that, the browsing model is visualized by Kohonen's self-organizing maps. The network administrator is assisted in grasping user Web browsing behavior by this feature map. As a result, we think that we can assist the monitoring operation by the network administrator.
{"title":"Web browsing activity visualization system for administrator assistance using users' Web browsing behavior","authors":"S. Togawa, K. Kanenishi, Y. Yano","doi":"10.1109/AINA.2004.1283803","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283803","url":null,"abstract":"In this research, we built a system that visualizes the Web browsing activities of network users for the assistance of the network administrator. This system visualizes the Web browsing activities of an organization by making the processing object not an individual user but a user group. The network administrator can comprehend the Web browsing activities of the organization by referring to the map. This system extracts a keyword from HTML files that the users browsed. Afterwards this system develops concepts from the extracted keyword using a thesaurus. In addition, this system creates a browsing model. The features of the browsing model are emphasized by weighting. After that, the browsing model is visualized by Kohonen's self-organizing maps. The network administrator is assisted in grasping user Web browsing behavior by this feature map. As a result, we think that we can assist the monitoring operation by the network administrator.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"41 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":"116066362","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.1283859
Yang Qing, Yang Yang, Chen Juan
Most people agree that education is a kind of business model whose merchandise is the teaching service. Still, in the recent years, the education industry has faced more and more pressure of providing the customized service, or in other words, of "service-on-demand". Accordingly, we proposed a new distance education model, "knowledge-point-based and goal-oriented education platform", to solve the problem. The features of this model are: (1) The teaching content is composed of "knowledge-points"; (2) Give each student a special study program according to his special demands; (3) Guide students to study automatically. We introduce the model and the architecture of the prototype system we are developing now.
{"title":"Goal-oriented platform based on knowledge-point: a new model of distance education system","authors":"Yang Qing, Yang Yang, Chen Juan","doi":"10.1109/AINA.2004.1283859","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283859","url":null,"abstract":"Most people agree that education is a kind of business model whose merchandise is the teaching service. Still, in the recent years, the education industry has faced more and more pressure of providing the customized service, or in other words, of \"service-on-demand\". Accordingly, we proposed a new distance education model, \"knowledge-point-based and goal-oriented education platform\", to solve the problem. The features of this model are: (1) The teaching content is composed of \"knowledge-points\"; (2) Give each student a special study program according to his special demands; (3) Guide students to study automatically. We introduce the model and the architecture of the prototype system we are developing now.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"263 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":"116238349","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.1283776
Prasanna Lokuge, D. Alahakoon, Parakrama Dissanayake
Berth scheduling and monitoring of the vessel operations are of paramount importance in order to assure faster turnaround time and high productivity of any container terminal. The need for an intelligent system that dynamically adapts to the changing environment is apparent, as there are a limited number of berths and resources available in container terminals for delivering services to vessels. We discuss how BDI (Beliefs, Desires and Intentions) agents can be supported with Neural Network and fuzzy logic in a collaborative environment of a multi agents system for the scheduling and monitoring of vessel berths in container ports. Straightforward plans are handled by the generic BDI architecture. Complex planning which requires the learning and adaptability behavior is modeled with neural networks. Beliefs with fuzzy scenarios are modeled with fuzzy logic enabling agents to make rational decisions in the environment of uncertainty. Agents can autonomously adapt to the changing environment in assigning berths for vessels.
{"title":"Collaborative neuro-BDI agents in container terminals","authors":"Prasanna Lokuge, D. Alahakoon, Parakrama Dissanayake","doi":"10.1109/AINA.2004.1283776","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283776","url":null,"abstract":"Berth scheduling and monitoring of the vessel operations are of paramount importance in order to assure faster turnaround time and high productivity of any container terminal. The need for an intelligent system that dynamically adapts to the changing environment is apparent, as there are a limited number of berths and resources available in container terminals for delivering services to vessels. We discuss how BDI (Beliefs, Desires and Intentions) agents can be supported with Neural Network and fuzzy logic in a collaborative environment of a multi agents system for the scheduling and monitoring of vessel berths in container ports. Straightforward plans are handled by the generic BDI architecture. Complex planning which requires the learning and adaptability behavior is modeled with neural networks. Beliefs with fuzzy scenarios are modeled with fuzzy logic enabling agents to make rational decisions in the environment of uncertainty. Agents can autonomously adapt to the changing environment in assigning berths for vessels.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"17 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":"122465514","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
扫码关注我们
求助内容：
应助结果提醒方式：