Pub Date : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622275
Przemyslaw Górecki, Piotr Artiemjew, Paweł Drozda, Krzysztof Sopyla
Bag of Visual Words is one of the most effective image representations. One of the optimization methods for BoVW is the selection of the most informative visual words, which leads to more compact visual dictionaries and more accurate categorization. In this paper we investigate the problem of feature selection in the Bag of Visual Words framework. The main contribution is the presentation of two novel methods for visual word selection. The first one choses the features which are the best at separating one class from the rest (MFM1 one-vs-all). In the second method, the features which are the best at separating class pairs are selected (MSF6 one-vs-one). The effectiveness of the proposed methods is verified empirically on two different image datasets.
{"title":"Visual words selection based on class separation measures","authors":"Przemyslaw Górecki, Piotr Artiemjew, Paweł Drozda, Krzysztof Sopyla","doi":"10.1109/ICCI-CC.2013.6622275","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622275","url":null,"abstract":"Bag of Visual Words is one of the most effective image representations. One of the optimization methods for BoVW is the selection of the most informative visual words, which leads to more compact visual dictionaries and more accurate categorization. In this paper we investigate the problem of feature selection in the Bag of Visual Words framework. The main contribution is the presentation of two novel methods for visual word selection. The first one choses the features which are the best at separating one class from the rest (MFM1 one-vs-all). In the second method, the features which are the best at separating class pairs are selected (MSF6 one-vs-one). The effectiveness of the proposed methods is verified empirically on two different image datasets.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115510422","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 : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622225
L. Reynoso, Eduardo Grosclaude, Laura Sánchez, Mabel Álvarez
During the last seven years several Argentinian national universities have offered (as part of their academic studies and programs) different undergraduate degrees under the denomination of technical degrees. The personal characteristics of their students are radically different from the traditional academic offer. Students learn by practicing and they comprehend information best by actively doing something with the information. We ran an experiment with students of a technical degree of web development in a course of Programming Introduction using Python. Preliminary findings revealed that their learning styles are mainly active and visual, and learners who are more verbal or have stronger concrete experience obtained higher scores in their tests. They perceive that inductive tasks are easier than deductive and abductive tasks. We also found that those subjects who are more efficient in solving formal inference tasks obtained higher qualifications in their exams. The findings can be useful not only for didactic transposition in teaching courses which take into account the balance of the students' preference but also to develop new instructional methods and software which focus on the cognitive preferences and cognitive process of technicians.
{"title":"Technicians and their learning styles preferences and cognitive processes of formal inferences","authors":"L. Reynoso, Eduardo Grosclaude, Laura Sánchez, Mabel Álvarez","doi":"10.1109/ICCI-CC.2013.6622225","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622225","url":null,"abstract":"During the last seven years several Argentinian national universities have offered (as part of their academic studies and programs) different undergraduate degrees under the denomination of technical degrees. The personal characteristics of their students are radically different from the traditional academic offer. Students learn by practicing and they comprehend information best by actively doing something with the information. We ran an experiment with students of a technical degree of web development in a course of Programming Introduction using Python. Preliminary findings revealed that their learning styles are mainly active and visual, and learners who are more verbal or have stronger concrete experience obtained higher scores in their tests. They perceive that inductive tasks are easier than deductive and abductive tasks. We also found that those subjects who are more efficient in solving formal inference tasks obtained higher qualifications in their exams. The findings can be useful not only for didactic transposition in teaching courses which take into account the balance of the students' preference but also to develop new instructional methods and software which focus on the cognitive preferences and cognitive process of technicians.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412215","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 : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622219
D. Hsu
The advent of sensor technologies and imaging modalities has greatly increased our ability to map the brain structure and understand its cognitive function. In order for the acquired Big Data (with large volume, wide variety, and high velocity) to be valuable, innovative data-centric algorithms and systems in machine learning, data mining and artificial intelligence have been developed, designed and implemented. Due to the complexity of the brain system and its cognitive processes, new data-driven paradigm is needed to recognize patterns in Big Data, to fuse information from different sources (systems and sensors), and to extract useful knowledge for actionable decisions.
{"title":"Cognitive diversity in perceptive informatics and affective computing","authors":"D. Hsu","doi":"10.1109/ICCI-CC.2013.6622219","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622219","url":null,"abstract":"The advent of sensor technologies and imaging modalities has greatly increased our ability to map the brain structure and understand its cognitive function. In order for the acquired Big Data (with large volume, wide variety, and high velocity) to be valuable, innovative data-centric algorithms and systems in machine learning, data mining and artificial intelligence have been developed, designed and implemented. Due to the complexity of the brain system and its cognitive processes, new data-driven paradigm is needed to recognize patterns in Big Data, to fuse information from different sources (systems and sensors), and to extract useful knowledge for actionable decisions.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130252181","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 : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622254
Motohiro Shibakawa, Takahiro Uchiya, I. Takumi, Tetsuo Kinoshita
Recently, information recorded on paper has been changed rapidly to digital data. Backup systems emphasize prevention of data loss by disasters, mistakes of user operations, and so on. For robust backup, it is necessary that the data be distributed geographically. Using a distributed backup system, the possibility of all data becoming lost will definitely be low. However, several problems with distributed backup systems remain. First, preparing multiple computers is expensive. Second, the computational cost of encryption and redundancy is high. Third, user workloads necessary to manage and maintain the system are great. As described herein, to overcome those problems, we propose a distributed backup system using multi-agent technology. The agents can work autonomously depending on the environment. We first show a design of the promptitude type agent in a contemplation type agent framework. Then we present the results of experiments.
{"title":"Development of the distributed backup system using multi-agent technology","authors":"Motohiro Shibakawa, Takahiro Uchiya, I. Takumi, Tetsuo Kinoshita","doi":"10.1109/ICCI-CC.2013.6622254","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622254","url":null,"abstract":"Recently, information recorded on paper has been changed rapidly to digital data. Backup systems emphasize prevention of data loss by disasters, mistakes of user operations, and so on. For robust backup, it is necessary that the data be distributed geographically. Using a distributed backup system, the possibility of all data becoming lost will definitely be low. However, several problems with distributed backup systems remain. First, preparing multiple computers is expensive. Second, the computational cost of encryption and redundancy is high. Third, user workloads necessary to manage and maintain the system are great. As described herein, to overcome those problems, we propose a distributed backup system using multi-agent technology. The agents can work autonomously depending on the environment. We first show a design of the promptitude type agent in a contemplation type agent framework. Then we present the results of experiments.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122201067","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 : 2013-07-16DOI: 10.4018/ijssci.2014010101
Taku Harada, H. Iwasaki, Kazuaki Mori, Akira Yoshizawa, F. Mizoguchi
Eye tracking reveals a person's state of mind. Thus, representing personal cognitive states using eye tracking leads to objective evaluations of these states, and this can be applied to various fields. In this paper, we propose a model that evaluates the degree of personal distraction based on eye tracking. Moreover, we apply the proposed model to eye tracking for a person driving a car.
{"title":"Evaluation model of cognitive distraction state based on eye-tracking data using neural networks","authors":"Taku Harada, H. Iwasaki, Kazuaki Mori, Akira Yoshizawa, F. Mizoguchi","doi":"10.4018/ijssci.2014010101","DOIUrl":"https://doi.org/10.4018/ijssci.2014010101","url":null,"abstract":"Eye tracking reveals a person's state of mind. Thus, representing personal cognitive states using eye tracking leads to objective evaluations of these states, and this can be applied to various fields. In this paper, we propose a model that evaluates the degree of personal distraction based on eye tracking. Moreover, we apply the proposed model to eye tracking for a person driving a car.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126649667","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 : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622289
Junlin Zhang, Ling Nie
A new blind adaptive MMSE multi-user detection(MUD) based on subspace tracking is presented. The new detector doesn't employ interference eigenvalue estimation but the interference subspace estimation, and it avoids performance deterioration induced by eigenvalue estimation error. The proposed MUD exploits the normalized orthogonal Oja (NOOja) subspace tracking algorithm for subspace estimation, since it guarantees the orthogonality of the weight matrix spanned by the interference subspace in every iteration, which must be meet in the new detector. The numerical simulation results the proposed MMSE detector has faster convergence rate, better output SIR and BER and lower the computational complexity.
{"title":"Blind multi-user detection based on inerference subspace","authors":"Junlin Zhang, Ling Nie","doi":"10.1109/ICCI-CC.2013.6622289","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622289","url":null,"abstract":"A new blind adaptive MMSE multi-user detection(MUD) based on subspace tracking is presented. The new detector doesn't employ interference eigenvalue estimation but the interference subspace estimation, and it avoids performance deterioration induced by eigenvalue estimation error. The proposed MUD exploits the normalized orthogonal Oja (NOOja) subspace tracking algorithm for subspace estimation, since it guarantees the orthogonality of the weight matrix spanned by the interference subspace in every iteration, which must be meet in the new detector. The numerical simulation results the proposed MMSE detector has faster convergence rate, better output SIR and BER and lower the computational complexity.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128051013","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 : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622222
K. Ferens, D. Cook, W. Kinsner
Two different variations of chaotic simulated annealing were applied to combinatorial optimization problems in multiprocessor task allocation. Chaotic walks in the solution space were taken to search for the global optimum or “good enough” task-to-processor allocation solutions. Chaotic variables were generated to set the number of perturbations made in each iteration of a chaotic simulated annealing algorithm. In addition, parameters of a chaotic variable generator were adjusted to create different chaotic distributions with which to search the solution space. The results show a faster convergence time than conventional simulated annealing when the solutions are far apart in the solution space.
{"title":"Chaotic simulated annealing for task allocation in a multiprocessing system","authors":"K. Ferens, D. Cook, W. Kinsner","doi":"10.1109/ICCI-CC.2013.6622222","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622222","url":null,"abstract":"Two different variations of chaotic simulated annealing were applied to combinatorial optimization problems in multiprocessor task allocation. Chaotic walks in the solution space were taken to search for the global optimum or “good enough” task-to-processor allocation solutions. Chaotic variables were generated to set the number of perturbations made in each iteration of a chaotic simulated annealing algorithm. In addition, parameters of a chaotic variable generator were adjusted to create different chaotic distributions with which to search the solution space. The results show a faster convergence time than conventional simulated annealing when the solutions are far apart in the solution space.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130717007","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 : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622227
Julia Taylor Rayz, V. Raskin
This paper deals with a contribution of computational analysis of verbal humor to natural language cognition. After a brief introduction to the growing area of computational humor and of its roots in humor theories, it describes and compares the results of a human-subject and computer experiment. The specific interest is to compare how well the computer, equipped with the resources and methodologies of the Ontological Semantic Technology, a comprehensive meaning access approach to natural language processing, can model several aspects of the cognitive behaviors of humans processing jokes from the Internet.
{"title":"Natural language cognition of humor by humans and computers: A computational semantic approach","authors":"Julia Taylor Rayz, V. Raskin","doi":"10.1109/ICCI-CC.2013.6622227","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622227","url":null,"abstract":"This paper deals with a contribution of computational analysis of verbal humor to natural language cognition. After a brief introduction to the growing area of computational humor and of its roots in humor theories, it describes and compares the results of a human-subject and computer experiment. The specific interest is to compare how well the computer, equipped with the resources and methodologies of the Ontological Semantic Technology, a comprehensive meaning access approach to natural language processing, can model several aspects of the cognitive behaviors of humans processing jokes from the Internet.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115953867","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 : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622285
Ling Nie, S. Xiao, Miao Li, Xi Wang, Junlin Zhang, Wei Kong
Based on the pixellated CdZnTe detector, the radiation imaging experiment for the Rh target X-ray source is accomplished. The experimental results indicate that the response signals of the anode pixels, which distribute over the center irradiated area, are completely shut-off when the tube voltage is 45 kV and the tube current increases to 20 µA. Moreover, the non-response pixel area expands with the increase of the tube current, and the total event count of the CdZnTe detector reduces obviously. Furthermore, the inner electric potential and electric field distributions of the pixellatedCdZnTe detector are simulated based on the Poisson equation. The simulation results reveal that the accumulation of the hole carriers, which resulted from the extremely low drift ability of the hole carrier, leads to a relatively high space-charge-density area in the CdZnTe bulk when the irradiated photon flux increases to 5×105 mm−2 · s−1. And thus, the induced signal screen effect of the anode pixels in the center irradiated area is mainly attributed to the distorted electric field which makes electron carriers drifting toward the high potential area in the CdZnTe crystal instead of the pixelanodes.
{"title":"Accumulated-carrier screening effect based investigation for the pixellated CdZnTe radiation detector","authors":"Ling Nie, S. Xiao, Miao Li, Xi Wang, Junlin Zhang, Wei Kong","doi":"10.1109/ICCI-CC.2013.6622285","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622285","url":null,"abstract":"Based on the pixellated CdZnTe detector, the radiation imaging experiment for the Rh target X-ray source is accomplished. The experimental results indicate that the response signals of the anode pixels, which distribute over the center irradiated area, are completely shut-off when the tube voltage is 45 kV and the tube current increases to 20 µA. Moreover, the non-response pixel area expands with the increase of the tube current, and the total event count of the CdZnTe detector reduces obviously. Furthermore, the inner electric potential and electric field distributions of the pixellatedCdZnTe detector are simulated based on the Poisson equation. The simulation results reveal that the accumulation of the hole carriers, which resulted from the extremely low drift ability of the hole carrier, leads to a relatively high space-charge-density area in the CdZnTe bulk when the irradiated photon flux increases to 5×105 mm−2 · s−1. And thus, the induced signal screen effect of the anode pixels in the center irradiated area is mainly attributed to the distorted electric field which makes electron carriers drifting toward the high potential area in the CdZnTe crystal instead of the pixelanodes.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131658628","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 : 2013-07-16DOI: 10.1109/ICCI-CC.2013.6622230
J. D. T. Gonzalez, W. Kinsner
This paper presents useful measures for comparison of distinct cryptosystems, including (i) the public-key cryptography RSA algorithm, (ii) the elliptic-curve cryptography ElGamal algorithm, (iii) a cryptosystem based on radio background noise (RBN), and (iv) a new cryptosystem based on chaos phenomena in cellular automata. The comparison is based on (i) a single-scale measure (i.e., the marginal probability mass functions (mpmf), and (ii) a poly-scale measure (i.e., the finite-sense stationarity, FSS10). Both comparison approaches use the same plaintext and computational power when testing the four cryptosystems. This paper shows experimentally that the chaos based modular dynamical cryptosystem is (i) strong to single-scale statistical cryptanalysis by leaving no patterns in the ciphertexts, (ii) strong to poly-scale cryptanalysis by having a smaller stationarity window than the alternative cryptosystems, and (iii) faster than the selected algorithms from RSA, ElGamal, and natural sources of randomness (RBN).
{"title":"Comparison of selected cryptosystems using single-scale and poly-scale measures","authors":"J. D. T. Gonzalez, W. Kinsner","doi":"10.1109/ICCI-CC.2013.6622230","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622230","url":null,"abstract":"This paper presents useful measures for comparison of distinct cryptosystems, including (i) the public-key cryptography RSA algorithm, (ii) the elliptic-curve cryptography ElGamal algorithm, (iii) a cryptosystem based on radio background noise (RBN), and (iv) a new cryptosystem based on chaos phenomena in cellular automata. The comparison is based on (i) a single-scale measure (i.e., the marginal probability mass functions (mpmf), and (ii) a poly-scale measure (i.e., the finite-sense stationarity, FSS10). Both comparison approaches use the same plaintext and computational power when testing the four cryptosystems. This paper shows experimentally that the chaos based modular dynamical cryptosystem is (i) strong to single-scale statistical cryptanalysis by leaving no patterns in the ciphertexts, (ii) strong to poly-scale cryptanalysis by having a smaller stationarity window than the alternative cryptosystems, and (iii) faster than the selected algorithms from RSA, ElGamal, and natural sources of randomness (RBN).","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130500961","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
扫码关注我们
求助内容：
应助结果提醒方式：