Pub Date : 2002-08-19DOI: 10.1109/COGINF.2002.1039312
R. Finkbine
The field of program understanding attempts to determine the function of a code segment without programmer intervention and for this to occur, it is necessary to have a model (plan) against which to attempt to match the code segment of interest. This paper traces in detail the pattern recognition of the selection sort algorithm.
{"title":"Pattern recognition of the selection sort algorithm","authors":"R. Finkbine","doi":"10.1109/COGINF.2002.1039312","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039312","url":null,"abstract":"The field of program understanding attempts to determine the function of a code segment without programmer intervention and for this to occur, it is necessary to have a model (plan) against which to attempt to match the code segment of interest. This paper traces in detail the pattern recognition of the selection sort algorithm.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"54 99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126172567","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039315
W. Wettayaprasit, C. Lursinsap, C. Chu
We present a model of creating a hierarchical set of rules that encode generalizations and exceptions derived from induction learning. The rules use the input features directly and are therefore comprehensible to the users. Learning is performed by a feedforward neural network and the rules are extracted from the trained network. A pattern classification task is used to demonstrate the efficacy of our approach. We show that the rules have similar classification performance while being more comprehensible to the users.
{"title":"Quasi-morphism and comprehensibility of rules in inductive learning","authors":"W. Wettayaprasit, C. Lursinsap, C. Chu","doi":"10.1109/COGINF.2002.1039315","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039315","url":null,"abstract":"We present a model of creating a hierarchical set of rules that encode generalizations and exceptions derived from induction learning. The rules use the input features directly and are therefore comprehensible to the users. Learning is performed by a feedforward neural network and the rules are extracted from the trained network. A pattern classification task is used to demonstrate the efficacy of our approach. We show that the rules have similar classification performance while being more comprehensible to the users.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121972102","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039309
J. Parker
The use of prior behavior of a classifier, as measured by the confusion matrix, can yield useful information for merging multiple classifiers. In particular a ranking of possible classes can be produced which can allow Borda type reconciliation methods to be applied. A simulation of multiple classifiers is used to evaluate this idea, and compare with three other classifier combination techniques.
{"title":"Combining multiple non-homogeneous classifiers: an empirical approach","authors":"J. Parker","doi":"10.1109/COGINF.2002.1039309","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039309","url":null,"abstract":"The use of prior behavior of a classifier, as measured by the confusion matrix, can yield useful information for merging multiple classifiers. In particular a ranking of possible classes can be produced which can allow Borda type reconciliation methods to be applied. A simulation of multiple classifiers is used to evaluate this idea, and compare with three other classifier combination techniques.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124458600","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039275
J.A. Anderson
This paper discusses the properties of a controllable, flexible, hybrid parallel computing architecture that potentially merges pattern recognition and arithmetic. Humans perform integer arithmetic in a fundamentally different way than logic-based computers. Even though the human approach to arithmetic is slow and inaccurate for purely arithmetic computation, it can have substantial advantages when useful approximations ("intuition") are more valuable than high precision. Such a computational strategy may be particularly useful when computers based on nanocomponents become feasible because it offers a way to make use of the potential power of these massively parallel systems.
{"title":"Hybrid computation with an attractor neural network","authors":"J.A. Anderson","doi":"10.1109/COGINF.2002.1039275","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039275","url":null,"abstract":"This paper discusses the properties of a controllable, flexible, hybrid parallel computing architecture that potentially merges pattern recognition and arithmetic. Humans perform integer arithmetic in a fundamentally different way than logic-based computers. Even though the human approach to arithmetic is slow and inaccurate for purely arithmetic computation, it can have substantial advantages when useful approximations (\"intuition\") are more valuable than high precision. Such a computational strategy may be particularly useful when computers based on nanocomponents become feasible because it offers a way to make use of the potential power of these massively parallel systems.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129735739","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039287
H. Leung, V. Varadan
In this paper we describe nonlinear system modeling and design using genetic programming (GP). In order to demonstrate the ability of GP to design complex systems, we first present a novel scheme called improved least squares genetic program (ILS-GP) that attempts to reconstruct the functional form of a nonlinear dynamical system from its noisy time series measurements. ILS-GP augments the structural search ability of GP with a novel parameter estimation scheme called improved least squares designed specifically to eliminate bias in parameter estimates of the nonlinear dynamical system in the presence of measurement noise. We use different test chaotic systems and real-life radar sea scattered signals to demonstrate the effectiveness of the ILS-GP approach in reconstructing nonlinear systems. Having shown the ability of GP to reconstruct complex systems from their time series measurements, we apply GP to the reverse problem of constructing optimal systems for generating specific sequences called spreading codes in CDMA communications. Using different approaches including correlation properties and the bit error rate, we use the proposed GP approach to design chaotic piecewise maps that generate optimal spreading codes in complicated communication environments such as multi-path. Based on computer simulations, we have shown improved performance of the GP-generated maps when compared to the other approaches including the standard Gold code.
{"title":"System modeling and design using genetic programming","authors":"H. Leung, V. Varadan","doi":"10.1109/COGINF.2002.1039287","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039287","url":null,"abstract":"In this paper we describe nonlinear system modeling and design using genetic programming (GP). In order to demonstrate the ability of GP to design complex systems, we first present a novel scheme called improved least squares genetic program (ILS-GP) that attempts to reconstruct the functional form of a nonlinear dynamical system from its noisy time series measurements. ILS-GP augments the structural search ability of GP with a novel parameter estimation scheme called improved least squares designed specifically to eliminate bias in parameter estimates of the nonlinear dynamical system in the presence of measurement noise. We use different test chaotic systems and real-life radar sea scattered signals to demonstrate the effectiveness of the ILS-GP approach in reconstructing nonlinear systems. Having shown the ability of GP to reconstruct complex systems from their time series measurements, we apply GP to the reverse problem of constructing optimal systems for generating specific sequences called spreading codes in CDMA communications. Using different approaches including correlation properties and the bit error rate, we use the proposed GP approach to design chaotic piecewise maps that generate optimal spreading codes in complicated communication environments such as multi-path. Based on computer simulations, we have shown improved performance of the GP-generated maps when compared to the other approaches including the standard Gold code.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122243948","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039289
W. Kinsner
Multimedia involves a myriad of data and multidimensional signals, including not only plain and formatted text, but also mathematical and other symbols, tables, vector and bitmap graphics, images, sound, animation, video, and interactive virtual reality objects. Compression of such signals is usually necessary to fit them into the available communications channels and digital storage, or for data mining. This paper provides an overview of important compression methods and techniques, including lossless entropy coding techniques designed to reduce the redundancy in the critical multimedia material, as well as lossy coding techniques designed to preserve the relevancy of the noncritical multimedia material. Modern lossy techniques often employ wavelets, wavelet packets, fractals, and neural networks. Progressive image transmission is also employed to deliver the material quickly. The paper also addresses several approaches to blind separation of signal from noise (denoising) to improve the compression, and to the difficult question of objective and subjective image quality assessment through complexity metrics.
{"title":"Compression and its metrics for multimedia","authors":"W. Kinsner","doi":"10.1109/COGINF.2002.1039289","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039289","url":null,"abstract":"Multimedia involves a myriad of data and multidimensional signals, including not only plain and formatted text, but also mathematical and other symbols, tables, vector and bitmap graphics, images, sound, animation, video, and interactive virtual reality objects. Compression of such signals is usually necessary to fit them into the available communications channels and digital storage, or for data mining. This paper provides an overview of important compression methods and techniques, including lossless entropy coding techniques designed to reduce the redundancy in the critical multimedia material, as well as lossy coding techniques designed to preserve the relevancy of the noncritical multimedia material. Modern lossy techniques often employ wavelets, wavelet packets, fractals, and neural networks. Progressive image transmission is also employed to deliver the material quickly. The paper also addresses several approaches to blind separation of signal from noise (denoising) to improve the compression, and to the difficult question of objective and subjective image quality assessment through complexity metrics.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114144473","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039316
V. Rajich
The paper describes the process of program comprehension from the point of view of constructivist theory of learning. According to this view, program comprehension starts with existing knowledge and continues through processes of assimilation and adaptation. Assimilation means that the facts encountered in the program are either added to the knowledge or rejected. Adaptation means that the existing knowledge is reorganized in order to absorb new facts. These processes are illustrated by a case study where the knowledge of the program is represented by UML class diagrams.
{"title":"Program comprehension as a learning process","authors":"V. Rajich","doi":"10.1109/COGINF.2002.1039316","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039316","url":null,"abstract":"The paper describes the process of program comprehension from the point of view of constructivist theory of learning. According to this view, program comprehension starts with existing knowledge and continues through processes of assimilation and adaptation. Assimilation means that the facts encountered in the program are either added to the knowledge or rejected. Adaptation means that the existing knowledge is reorganized in order to absorb new facts. These processes are illustrated by a case study where the knowledge of the program is represented by UML class diagrams.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114363699","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039296
Linsong Cai, Xiao Liu, Wael Badawy
This paper presents an algorithm for Web-based hierarchical video presentation, where a novel hierarchical adaptive optimum mesh (HAOM) is proposed as the key technique. By using optimum cutsets of HAOM, video contents are coded at different resolution level. The cutset generation algorithm considers a combination of parameters, including frame rate availability, bit rate constrains and quality-of-service (QoS) requirements, etc. The performance analysis is also presented and it shows the efficiency of proposed HAOM.
{"title":"Agent-based hierarchical video presentation over Internet","authors":"Linsong Cai, Xiao Liu, Wael Badawy","doi":"10.1109/COGINF.2002.1039296","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039296","url":null,"abstract":"This paper presents an algorithm for Web-based hierarchical video presentation, where a novel hierarchical adaptive optimum mesh (HAOM) is proposed as the key technique. By using optimum cutsets of HAOM, video contents are coded at different resolution level. The cutset generation algorithm considers a combination of parameters, including frame rate availability, bit rate constrains and quality-of-service (QoS) requirements, etc. The performance analysis is also presented and it shows the efficiency of proposed HAOM.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114856921","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039297
Jason Jen-Yen Chen, Chun-Yi Lin
Traditional software process environment stores documents using either centralized or distributed approach. With the assistance of web agent, this paper presents a new document storage structure that combines the two approaches. In this new approach, all the documents are stored centrally in web server. When a developer modifies a document (data), agent detects those developers who currently need to refer to that document, and sends the modified data to them in a distributed manner. The benefits of this approach are: (1) All the clients (developers) are notified as soon as a piece of data is modified, (2) The amount of communication is reduced, as clients do not need to check periodically whether or not their currently referred data is modified, (3) The load of server is reduced, as the load of notifying other clients about modification is switched from server to an agent communication media called white board.
{"title":"An agent-assisted document storage for software process environments","authors":"Jason Jen-Yen Chen, Chun-Yi Lin","doi":"10.1109/COGINF.2002.1039297","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039297","url":null,"abstract":"Traditional software process environment stores documents using either centralized or distributed approach. With the assistance of web agent, this paper presents a new document storage structure that combines the two approaches. In this new approach, all the documents are stored centrally in web server. When a developer modifies a document (data), agent detects those developers who currently need to refer to that document, and sends the modified data to them in a distributed manner. The benefits of this approach are: (1) All the clients (developers) are notified as soon as a piece of data is modified, (2) The amount of communication is reduced, as clients do not need to check periodically whether or not their currently referred data is modified, (3) The load of server is reduced, as the load of notifying other clients about modification is switched from server to an agent communication media called white board.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130236201","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 : 2002-08-19DOI: 10.1109/COGINF.2002.1039305
A. Ramdane-Cherif, N. Lévy, H. Djenidi, C. Tadj
Agents are computational systems interacting with dynamic, and non-entirely predictable environments. They decide for themselves, on the basis of their individual beliefs, goals, etc., how to respond to the environment. An agent is usually motivated to achieve a feasible objective by means of the collaboration of other agents. For example, lifting a heavy table may be impossible without help. However, it can be done by simply asking others for help. The process of gaining collaboration can take many forms. However, some tasks need more detailed communication to generate an explicit mutually acceptable agreement through negotiation. This paper presents a new method to solve the inverse kinematic problem of a redundant robot using the agents paradigm. This method guarantees rapid convergence of the robot to desired position, with substantially good accuracy. The originality of the proposed approach is its ability to overcome some of the standard problems such as the computation of the inverse or pseudoinverse Jacobian matrix, problem of singularity, redundancy, and considerably increased computational complexity, etc.
{"title":"Agents paradigm to solve a complex optimization problem","authors":"A. Ramdane-Cherif, N. Lévy, H. Djenidi, C. Tadj","doi":"10.1109/COGINF.2002.1039305","DOIUrl":"https://doi.org/10.1109/COGINF.2002.1039305","url":null,"abstract":"Agents are computational systems interacting with dynamic, and non-entirely predictable environments. They decide for themselves, on the basis of their individual beliefs, goals, etc., how to respond to the environment. An agent is usually motivated to achieve a feasible objective by means of the collaboration of other agents. For example, lifting a heavy table may be impossible without help. However, it can be done by simply asking others for help. The process of gaining collaboration can take many forms. However, some tasks need more detailed communication to generate an explicit mutually acceptable agreement through negotiation. This paper presents a new method to solve the inverse kinematic problem of a redundant robot using the agents paradigm. This method guarantees rapid convergence of the robot to desired position, with substantially good accuracy. The originality of the proposed approach is its ability to overcome some of the standard problems such as the computation of the inverse or pseudoinverse Jacobian matrix, problem of singularity, redundancy, and considerably increased computational complexity, etc.","PeriodicalId":250129,"journal":{"name":"Proceedings First IEEE International Conference on Cognitive Informatics","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121307899","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
扫码关注我们
求助内容：
应助结果提醒方式：