Pub Date : 2001-10-30DOI: 10.1109/ICCIMA.2001.970476
Z. Putnik, M. Grabovac
Computer graphics has entered all aspects of programming especially after introduction of World Wide Web into everyday life and increase of the number of people who are using it. This emphasized the need and the quantity of graphics that we are all faced with. Here Java is the language of our choice since it is already enriched with built-in classes for platform independent graphical user interface, and that it supports picture, animation, sound and network capabilities. Turtle graphics has been implemented in a Java programming language as a Java applet. The implementation of turtle graphics in Java is important because it brings the expressiveness of LOGO to Java language.
{"title":"LOGO and Java-one happy marriage","authors":"Z. Putnik, M. Grabovac","doi":"10.1109/ICCIMA.2001.970476","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970476","url":null,"abstract":"Computer graphics has entered all aspects of programming especially after introduction of World Wide Web into everyday life and increase of the number of people who are using it. This emphasized the need and the quantity of graphics that we are all faced with. Here Java is the language of our choice since it is already enriched with built-in classes for platform independent graphical user interface, and that it supports picture, animation, sound and network capabilities. Turtle graphics has been implemented in a Java programming language as a Java applet. The implementation of turtle graphics in Java is important because it brings the expressiveness of LOGO to Java language.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122333817","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970482
K. Goshi, Paul Wray, Yong-bo Sun
Significant areas of the computer science curriculum are constantly and rapidly changing as new technologies (e.g., multimedia, WWW, Java) are adopted. This presents a challenge to our current education system: Intelligent Tutoring Systems (ITSs) for teaching and learning in Computer Science must be able to assist not only their student users but also the teachers in developing and managing courses to the best advantage of the students. We developed an ITS for teaching and learning Hoare logic. In this paper, we describe the practical use of the system in a computation theory course.
{"title":"An intelligent tutoring system for teaching and learning Hoare logic","authors":"K. Goshi, Paul Wray, Yong-bo Sun","doi":"10.1109/ICCIMA.2001.970482","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970482","url":null,"abstract":"Significant areas of the computer science curriculum are constantly and rapidly changing as new technologies (e.g., multimedia, WWW, Java) are adopted. This presents a challenge to our current education system: Intelligent Tutoring Systems (ITSs) for teaching and learning in Computer Science must be able to assist not only their student users but also the teachers in developing and managing courses to the best advantage of the students. We developed an ITS for teaching and learning Hoare logic. In this paper, we describe the practical use of the system in a computation theory course.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114368288","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970496
D. Yeung
The author considers infinite horizon stochastic differential games with an autonomous structure and steady branching payoffs. While the introduction of additional stochastic elements via branching payoffs offers a fruitful alternative to modeling game situations under uncertainty, the solution to such a problem is not known. A theorem on the characterization of a Nash equilibrium solution for this kind of game is presented. An application in renewable resource extraction is provided to illustrate the solution mechanism.
{"title":"Infinite horizon stochastic differential games with uncertain future payoff structures","authors":"D. Yeung","doi":"10.1109/ICCIMA.2001.970496","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970496","url":null,"abstract":"The author considers infinite horizon stochastic differential games with an autonomous structure and steady branching payoffs. While the introduction of additional stochastic elements via branching payoffs offers a fruitful alternative to modeling game situations under uncertainty, the solution to such a problem is not known. A theorem on the characterization of a Nash equilibrium solution for this kind of game is presented. An application in renewable resource extraction is provided to illustrate the solution mechanism.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814042","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970489
C. Delrieux, F. Tohmé
Visualization of the dynamic behavior in complex systems is an efficient way to facilitate analysis and decision making. Complexity itself entails several difficulties to find an adequate visual representation of the relevant features of the system's dynamics. For this reason, in this work we explore the elaboration of interactive interfaces for the visualization of the behavior of complex systems. In particular, we pursue the representation of the dynamics of a society of intensional agents. These agents exhibit an individually simple behavior, but together experiment a collective complex behavior. We established an experimentation protocol aimed to verify an hypothesis about the long term evolution of the system. We show how our visualization tool is helpful in understanding and interpreting these results.
{"title":"Interactive visualization of agent societies","authors":"C. Delrieux, F. Tohmé","doi":"10.1109/ICCIMA.2001.970489","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970489","url":null,"abstract":"Visualization of the dynamic behavior in complex systems is an efficient way to facilitate analysis and decision making. Complexity itself entails several difficulties to find an adequate visual representation of the relevant features of the system's dynamics. For this reason, in this work we explore the elaboration of interactive interfaces for the visualization of the behavior of complex systems. In particular, we pursue the representation of the dynamics of a society of intensional agents. These agents exhibit an individually simple behavior, but together experiment a collective complex behavior. We established an experimentation protocol aimed to verify an hypothesis about the long term evolution of the system. We show how our visualization tool is helpful in understanding and interpreting these results.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116963851","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970454
Y. Orito, G. Yamazaki
It is well known that an index fund portfolio is useful for the risk hedge of investment. The portfolio consists of M-company (called brand) stocks and its price as a function of time traces the stock price index in the market. From a practical viewpoint, it is desired that M-company is smaller and the correlation between the portfolio price and stock price index, included in the portfolio is higher. The correlation is called the contribution rate. Suppose that there are some portfolios where the contribution rate is greater than a fixed level. We then select the portfolio that minimizes its own risk in the portfolio. The main purpose of the paper is to find such a portfolio by using a genetic algorithm (GA). We present some numerical examples that demonstrate the usefulness of GA. We show that GA works well for finding such portfolios.
{"title":"Index fund portfolio selection by using GA","authors":"Y. Orito, G. Yamazaki","doi":"10.1109/ICCIMA.2001.970454","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970454","url":null,"abstract":"It is well known that an index fund portfolio is useful for the risk hedge of investment. The portfolio consists of M-company (called brand) stocks and its price as a function of time traces the stock price index in the market. From a practical viewpoint, it is desired that M-company is smaller and the correlation between the portfolio price and stock price index, included in the portfolio is higher. The correlation is called the contribution rate. Suppose that there are some portfolios where the contribution rate is greater than a fixed level. We then select the portfolio that minimizes its own risk in the portfolio. The main purpose of the paper is to find such a portfolio by using a genetic algorithm (GA). We present some numerical examples that demonstrate the usefulness of GA. We show that GA works well for finding such portfolios.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127611472","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970462
M. Arita, S. Kobayashi
Sequence design is a crucial problem in DNA-based computation. We introduce a simple strategy called Template method, which can systematically generate a set of sequences such that any sequence will have at least 4 mismatches with other sequences and with the concatenated part of other sequences.
{"title":"The power of sequence design in DNA computing","authors":"M. Arita, S. Kobayashi","doi":"10.1109/ICCIMA.2001.970462","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970462","url":null,"abstract":"Sequence design is a crucial problem in DNA-based computation. We introduce a simple strategy called Template method, which can systematically generate a set of sequences such that any sequence will have at least 4 mismatches with other sequences and with the concatenated part of other sequences.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133498218","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970494
Jean-Luc Henry
A character recognition system with continuous learning seeks to constantly enhance its base representation models in order to provide the best recognition rate. The method we are presenting enables the system to enhance its base with models, which are performant in recognition. This method also enables to get rid of models regularly doubtable in efficiency when it comes to interpretation of the characters studied. This rule is similar to the one used in the "Death by suffocation" game of life of Conway. We based ourselves on the theory of k-nearest neighbours to develop a new approach we named /spl epsiv/-adaptive neighbourhood. It makes an adjustment of classes possible, according to confidence rate in each model of the learning base. These rates which are practically represented as weights are taken into account by the stage of the recognition system during the character recognition phase. The use of weight as a model selection factor, useful for recognition, enables the system to manage the evolution of the learning base.
{"title":"A k-nearest neighbour method for managing the evolution of a learning base","authors":"Jean-Luc Henry","doi":"10.1109/ICCIMA.2001.970494","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970494","url":null,"abstract":"A character recognition system with continuous learning seeks to constantly enhance its base representation models in order to provide the best recognition rate. The method we are presenting enables the system to enhance its base with models, which are performant in recognition. This method also enables to get rid of models regularly doubtable in efficiency when it comes to interpretation of the characters studied. This rule is similar to the one used in the \"Death by suffocation\" game of life of Conway. We based ourselves on the theory of k-nearest neighbours to develop a new approach we named /spl epsiv/-adaptive neighbourhood. It makes an adjustment of classes possible, according to confidence rate in each model of the learning base. These rates which are practically represented as weights are taken into account by the stage of the recognition system during the character recognition phase. The use of weight as a model selection factor, useful for recognition, enables the system to manage the evolution of the learning base.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132301263","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970443
T. Kaizoji, T. Suzudo
We discuss the stylized facts which are observed in the log return of almost all financial markets. We especially consider an interacting agent model of collective opinion formation in a stock market. For this purpose. a two-dimensional Ising model has been applied. The evaluation of the model suggested some key points to improve simulation precision.
{"title":"Evolutionary model of opinion formation","authors":"T. Kaizoji, T. Suzudo","doi":"10.1109/ICCIMA.2001.970443","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970443","url":null,"abstract":"We discuss the stylized facts which are observed in the log return of almost all financial markets. We especially consider an interacting agent model of collective opinion formation in a stock market. For this purpose. a two-dimensional Ising model has been applied. The evaluation of the model suggested some key points to improve simulation precision.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129851783","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970465
X. Yao, Yong Liu
The paper studies the application of evolutionary artificial neural networks to chlorophyll-a prediction in Lake Kasumigaura (in Japan). Unlike previous applications of artificial neural networks in this field, the architecture of the artificial neural network is evolved automatically rather than designed manually. The evolutionary system is able to find a near optimal architecture of the artificial neural network for the prediction task. Our experimental results have shown that evolved artificial neural networks are very compact and generalise well. The evolutionary system is able to explore a large space of possible artificial neural networks and discover novel artificial neural networks for solving a problem.
{"title":"Evolving neural networks for chlorophyll-a prediction","authors":"X. Yao, Yong Liu","doi":"10.1109/ICCIMA.2001.970465","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970465","url":null,"abstract":"The paper studies the application of evolutionary artificial neural networks to chlorophyll-a prediction in Lake Kasumigaura (in Japan). Unlike previous applications of artificial neural networks in this field, the architecture of the artificial neural network is evolved automatically rather than designed manually. The evolutionary system is able to find a near optimal architecture of the artificial neural network for the prediction task. Our experimental results have shown that evolved artificial neural networks are very compact and generalise well. The evolutionary system is able to explore a large space of possible artificial neural networks and discover novel artificial neural networks for solving a problem.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129185342","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970497
M. Venkatesan, H. Selvaraj, R. Bignall
Summary form only given. Functional decomposition is a process of representing a complex function as a function of functions with fewer variables. Earlier partition based functional decomposition tools represent the functions using r-partition. The r-partition representation is an abstract representation of the function and their memory requirements are super-exponential. An improved functional representation called ir-partition is proposed. The ir-partition representation is a complete representation of the function and requires less memory to store the functions. The main idea behind the ir-partition representation is to incorporate the values of the minterms corresponding to the variables (cubes). Hence, repeated access of the truth table is not necessary to read the value of the minterms. The computational time to calculate the ir-partition operations are three times greater than the computational time and memory requirement to calculate r-partition. However, the memory requirements for representing the function using ir-partition is half the memory requirement using the r-partition representation (abstract representation). Their partition representation also allows us to perform certain Partition Calculus operations implicitly. The representation has been implemented and tested with the MCNC benchmarks.
{"title":"An improved representation of functions for partition based functional decomposition","authors":"M. Venkatesan, H. Selvaraj, R. Bignall","doi":"10.1109/ICCIMA.2001.970497","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970497","url":null,"abstract":"Summary form only given. Functional decomposition is a process of representing a complex function as a function of functions with fewer variables. Earlier partition based functional decomposition tools represent the functions using r-partition. The r-partition representation is an abstract representation of the function and their memory requirements are super-exponential. An improved functional representation called ir-partition is proposed. The ir-partition representation is a complete representation of the function and requires less memory to store the functions. The main idea behind the ir-partition representation is to incorporate the values of the minterms corresponding to the variables (cubes). Hence, repeated access of the truth table is not necessary to read the value of the minterms. The computational time to calculate the ir-partition operations are three times greater than the computational time and memory requirement to calculate r-partition. However, the memory requirements for representing the function using ir-partition is half the memory requirement using the r-partition representation (abstract representation). Their partition representation also allows us to perform certain Partition Calculus operations implicitly. The representation has been implemented and tested with the MCNC benchmarks.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129331036","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
扫码关注我们
求助内容：
应助结果提醒方式：