Pub Date : 1999-09-23DOI: 10.1109/ICCIMA.1999.798554
S. Shamala, A. Ramani, M. Yazid
In this research, two pro-active dynamic quality of service (QoS) control schemes are designed, the dynamic QoS control scheme with delay estimation, and the hybrid dynamic QoS control scheme. The two schemes aim at fulfilling the requested level of QoS while simultaneously achieving high resource utilization. Emphasis is placed upon buffer management via administration schemes of packet loss and packet delay. The results obtained through the simulation models have shown that the two schemes have significantly improved the average delay for different traffic patterns. The proposed scheme can be adopted for multimedia applications to enhance the QoS in terns of better delay and improved resource utilization.
{"title":"Predictive QoS schemes for real-time multimedia applications in communications","authors":"S. Shamala, A. Ramani, M. Yazid","doi":"10.1109/ICCIMA.1999.798554","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798554","url":null,"abstract":"In this research, two pro-active dynamic quality of service (QoS) control schemes are designed, the dynamic QoS control scheme with delay estimation, and the hybrid dynamic QoS control scheme. The two schemes aim at fulfilling the requested level of QoS while simultaneously achieving high resource utilization. Emphasis is placed upon buffer management via administration schemes of packet loss and packet delay. The results obtained through the simulation models have shown that the two schemes have significantly improved the average delay for different traffic patterns. The proposed scheme can be adopted for multimedia applications to enhance the QoS in terns of better delay and improved resource utilization.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126299453","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798500
V. Karri, F. Frost
An important consideration when designing neural network training data is to carefully select those variables that are to be used as inputs. Only those parameters that contribute towards improving the accuracy of the network's prediction should be included as input parameters. Despite a large variety of neural network models, backpropagation (BP) is the most commonly applied model for an extensive range of applications. However, when applying BP networks to process modelling or control, it is necessary to select the correct network architecture and activation functions in order to minimise the computation time and maximise the network's accuracy. In addition, in order to improve network performance, it is necessary to use sufficient training data, spanning a comprehensive input range. While many of the techniques for improving network performance are based on a heuristic approach, some important aspects are detailed in this paper for selecting the optimum network conditions, with respect to computation time and accuracy, using a mathematical function as a sample application.
{"title":"Optimum back propagation network conditions with respect to computation time and output accuracy","authors":"V. Karri, F. Frost","doi":"10.1109/ICCIMA.1999.798500","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798500","url":null,"abstract":"An important consideration when designing neural network training data is to carefully select those variables that are to be used as inputs. Only those parameters that contribute towards improving the accuracy of the network's prediction should be included as input parameters. Despite a large variety of neural network models, backpropagation (BP) is the most commonly applied model for an extensive range of applications. However, when applying BP networks to process modelling or control, it is necessary to select the correct network architecture and activation functions in order to minimise the computation time and maximise the network's accuracy. In addition, in order to improve network performance, it is necessary to use sufficient training data, spanning a comprehensive input range. While many of the techniques for improving network performance are based on a heuristic approach, some important aspects are detailed in this paper for selecting the optimum network conditions, with respect to computation time and accuracy, using a mathematical function as a sample application.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"111 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122390785","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798493
H. Yamamoto, Y. Guo, K. Suzuki, T. Watanabe
The paper addresses the long-lived transaction management paradigm based on workflows with a view to evaluating the un-executable works. In our 3-layer transaction model, each long-lived transaction is divided into several transactions, which are organized as workflows. Additionally, the model is applied by agent orientation to attain the flexible control mechanism. Three different kinds of agents are located at each layer in this model: manager, executor and actor. The manager manages long-lived transactions globally and controls executors; the executor manages each transaction locally and controls actors; and the actor executes atomic tasks individually. The delegation mechanism discussed mainly in the paper is supported by related managers, with a view to evaluating the work which one manager cannot manipulate in a timely or accidental manner.
{"title":"Delegation mechanism in agent-oriented framework for managing long-lived transaction","authors":"H. Yamamoto, Y. Guo, K. Suzuki, T. Watanabe","doi":"10.1109/ICCIMA.1999.798493","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798493","url":null,"abstract":"The paper addresses the long-lived transaction management paradigm based on workflows with a view to evaluating the un-executable works. In our 3-layer transaction model, each long-lived transaction is divided into several transactions, which are organized as workflows. Additionally, the model is applied by agent orientation to attain the flexible control mechanism. Three different kinds of agents are located at each layer in this model: manager, executor and actor. The manager manages long-lived transactions globally and controls executors; the executor manages each transaction locally and controls actors; and the actor executes atomic tasks individually. The delegation mechanism discussed mainly in the paper is supported by related managers, with a view to evaluating the work which one manager cannot manipulate in a timely or accidental manner.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125822776","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798572
M. Saltouros, M. Theologou, M. Angelopoulos, C.S. Ricudis
One of the most prevalent problems in modern telecommunication networks is the efficient routing of multicast connections. The formal formulation of this problem reduces to a graph-theoretical problem known as the Steiner tree problem, that is proved to be NP-complete. We present an efficient solution for the Steiner tree problem with application to multicast routing, based on a hybridized genetic algorithm with a hill-climbing technique that facilitates better local exploration of the search space. Moreover, an adaptive policy that is used to control the genetic algorithm parameters renders the proposed scheme efficient and adaptive under static and dynamic environment conditions. Using simulation, we came to the conclusion that our proposed algorithm compares favourably to some of the most effective deterministic approaches already known.
{"title":"An efficient evolutionary algorithm for (near-) optimal Steiner tree calculation: an approach to routing of multipoint connections","authors":"M. Saltouros, M. Theologou, M. Angelopoulos, C.S. Ricudis","doi":"10.1109/ICCIMA.1999.798572","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798572","url":null,"abstract":"One of the most prevalent problems in modern telecommunication networks is the efficient routing of multicast connections. The formal formulation of this problem reduces to a graph-theoretical problem known as the Steiner tree problem, that is proved to be NP-complete. We present an efficient solution for the Steiner tree problem with application to multicast routing, based on a hybridized genetic algorithm with a hill-climbing technique that facilitates better local exploration of the search space. Moreover, an adaptive policy that is used to control the genetic algorithm parameters renders the proposed scheme efficient and adaptive under static and dynamic environment conditions. Using simulation, we came to the conclusion that our proposed algorithm compares favourably to some of the most effective deterministic approaches already known.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"2004 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125832786","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798562
L. P. Scott, M. da Graca Pimental
This paper uses the Unified Modeling Language (UML) to present an object-oriented view of the HyTime standard, called OOHyTime. The aim of the work is to facilitate both the understanding and the use of HyTime. Finally, the paper demonstrates the use of OOHyTime in the context of modeling classic hypertext. OOHyTime facilitates the use of object-oriented tools in the design and generation of hypermedia applications.
{"title":"An object-oriented model for HyTime using UML","authors":"L. P. Scott, M. da Graca Pimental","doi":"10.1109/ICCIMA.1999.798562","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798562","url":null,"abstract":"This paper uses the Unified Modeling Language (UML) to present an object-oriented view of the HyTime standard, called OOHyTime. The aim of the work is to facilitate both the understanding and the use of HyTime. Finally, the paper demonstrates the use of OOHyTime in the context of modeling classic hypertext. OOHyTime facilitates the use of object-oriented tools in the design and generation of hypermedia applications.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131198128","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798549
W. Lai, M. Danaher
An important aspect of Web navigation systems is to maintain the users sense of orientation and facilitate navigation within the context of the total information space. Most navigation systems (or browsers) display pages that contain very limited orientation information apart from links to other pages. To provide a global overview we have developed a navigation interface based on diagrams. A diagram-based system can display global views and can present detailed local views of any of the nodes.
{"title":"An approach to graph layout to assist in Web navigation","authors":"W. Lai, M. Danaher","doi":"10.1109/ICCIMA.1999.798549","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798549","url":null,"abstract":"An important aspect of Web navigation systems is to maintain the users sense of orientation and facilitate navigation within the context of the total information space. Most navigation systems (or browsers) display pages that contain very limited orientation information apart from links to other pages. To provide a global overview we have developed a navigation interface based on diagrams. A diagram-based system can display global views and can present detailed local views of any of the nodes.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133212567","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798569
J. Torres-Jiménez, Raúl Pinto Elías, A. García-Romero
Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.
{"title":"A simulated annealing approach for the capacitated minimum spanning tree problem","authors":"J. Torres-Jiménez, Raúl Pinto Elías, A. García-Romero","doi":"10.1109/ICCIMA.1999.798569","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798569","url":null,"abstract":"Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133430852","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798499
F. Frost, V. Karri
Neural networks, due to their excellent capabilities for modelling process behaviour, are gaining precedence over traditional empirical modelling techniques, such as statistical methods. While neural networks have good ability to map any reasonable continuous function, they do not easily explain how the inputs are related to an output, and also whether the selected inputs have any significant relationship with an output. There is quite often a need to identify some order of influence of the input variables on the output variable. In this paper, a technique for determining the order of influence of the n elements of the input vector on the m elements of the output vector is presented and discussed. While a sample mathematical function is used to introduce the technique, a more practical application of this method in the aluminium smelting industry is considered. It is shown that, using a sensitivity analysis on the backpropagation (BP) algorithm, the degree of influence of the input parameters on the output error can be successfully estimated.
{"title":"Determining the influence of input parameters on BP neural network output error using sensitivity analysis","authors":"F. Frost, V. Karri","doi":"10.1109/ICCIMA.1999.798499","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798499","url":null,"abstract":"Neural networks, due to their excellent capabilities for modelling process behaviour, are gaining precedence over traditional empirical modelling techniques, such as statistical methods. While neural networks have good ability to map any reasonable continuous function, they do not easily explain how the inputs are related to an output, and also whether the selected inputs have any significant relationship with an output. There is quite often a need to identify some order of influence of the input variables on the output variable. In this paper, a technique for determining the order of influence of the n elements of the input vector on the m elements of the output vector is presented and discussed. While a sample mathematical function is used to introduce the technique, a more practical application of this method in the aluminium smelting industry is considered. It is shown that, using a sensitivity analysis on the backpropagation (BP) algorithm, the degree of influence of the input parameters on the output error can be successfully estimated.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128332140","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798568
C. Kahraman, Z. Ulukan
By using fuzzy linear programming (FLIP), tolerance intervals are used for calculating the availability of capital at each point in time. The main advantage, compared to the non-fuzzy problem formulation, is the fact that the decision maker is not forced into a precise formulation for mathematical reasons. Linear membership functions which monotonically increase or decrease in the tolerance interval are used because they can be handled quite easily. A numeric example is given.
{"title":"Multi-criteria capital budgeting using FLIP","authors":"C. Kahraman, Z. Ulukan","doi":"10.1109/ICCIMA.1999.798568","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798568","url":null,"abstract":"By using fuzzy linear programming (FLIP), tolerance intervals are used for calculating the availability of capital at each point in time. The main advantage, compared to the non-fuzzy problem formulation, is the fact that the decision maker is not forced into a precise formulation for mathematical reasons. Linear membership functions which monotonically increase or decrease in the tolerance interval are used because they can be handled quite easily. A numeric example is given.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134218532","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 : 1999-09-23DOI: 10.1109/ICCIMA.1999.798495
A. Cristea, Toshio Okamoto
We believe that parallelism is strongly connected with artificial neural networks (ANN), as biological neural networks are known to make good use of massive parallelism. At present, there has been little research in this direction. We have designed and implemented parallel ANNs on different environments. The best implementation possibilities are given, naturally, by massively parallel computers (dedicated or not). Still, even in the UNIX environment, which is based on the token-passing type of simulated parallelism, speed-ups are possible. In this paper, we demonstrate this statement on a very simple example problem, designed to perform a similar task to that of a feedforward ANN.
{"title":"ANN parallelization on a token-based simulated parallel system","authors":"A. Cristea, Toshio Okamoto","doi":"10.1109/ICCIMA.1999.798495","DOIUrl":"https://doi.org/10.1109/ICCIMA.1999.798495","url":null,"abstract":"We believe that parallelism is strongly connected with artificial neural networks (ANN), as biological neural networks are known to make good use of massive parallelism. At present, there has been little research in this direction. We have designed and implemented parallel ANNs on different environments. The best implementation possibilities are given, naturally, by massively parallel computers (dedicated or not). Still, even in the UNIX environment, which is based on the token-passing type of simulated parallelism, speed-ups are possible. In this paper, we demonstrate this statement on a very simple example problem, designed to perform a similar task to that of a feedforward ANN.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132621329","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
扫码关注我们
求助内容：
应助结果提醒方式：