In multiclass classification problems we face the challenge of having many binary classifiers. Consulting this large number of classifiers might be confusing and time consuming. In this paper, we propose a new framework for training and prediction in multiclass problems. In this framework, we perform traditional training. Next we map training examples to prediction models. Finally we produce the Example Classifier (EC). In prediction a new example is passed through the EC to determine the appropriate classifier which in turn makes the last prediction decision. We conduct experiments comparing our framework with one-VS-one and Directed Acyclic Graph (DAG) using Support Vector Machines. Additionally, we compare our model with well-known ensemble models, namely, AdaBoost and Bagging, Our results indicate that prediction accuracy is comparable to other methodologies with the advantage of consuming less prediction time.
在多类分类问题中，我们面临着具有多个二分类器的挑战。咨询这么多的分类器可能会让人感到困惑，而且很耗时。在本文中，我们提出了一个用于多类问题训练和预测的新框架。在这个框架中，我们执行传统的培训。接下来，我们将训练样本映射到预测模型。最后给出了示例分类器(EC)。在预测中，一个新的例子通过EC来确定合适的分类器，然后再做出最后的预测决策。我们使用支持向量机将我们的框架与1 - vs - 1和有向无环图(DAG)进行了实验比较。此外，我们还将该模型与AdaBoost和Bagging等知名集成模型进行了比较，结果表明，该模型的预测精度与其他方法相当，且预测时间更短。
{"title":"New 2-Tier Multiclass Prediction Framework","authors":"M. Awad","doi":"10.1109/ICCSA.2015.16","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.16","url":null,"abstract":"In multiclass classification problems we face the challenge of having many binary classifiers. Consulting this large number of classifiers might be confusing and time consuming. In this paper, we propose a new framework for training and prediction in multiclass problems. In this framework, we perform traditional training. Next we map training examples to prediction models. Finally we produce the Example Classifier (EC). In prediction a new example is passed through the EC to determine the appropriate classifier which in turn makes the last prediction decision. We conduct experiments comparing our framework with one-VS-one and Directed Acyclic Graph (DAG) using Support Vector Machines. Additionally, we compare our model with well-known ensemble models, namely, AdaBoost and Bagging, Our results indicate that prediction accuracy is comparable to other methodologies with the advantage of consuming less prediction time.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125213040","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}
In this paper, a method for building a 3D map of some objects detected in an indoor environment is presented. The pecularity of the proposed algorithm is that it works with a simple consumer-grade webcam. With the webcam, pictures of the environment are taken. The proposed method first extracts the regions which may contain an object from the pictures. The regions are then classified to identify the objects, further their pose and height are estimated. A 3D map of the environment is finally reconstructed where icons roughly resembling the object categories are added to the 3D map at the estimated object position and with the estimated height. Regions of Interest (ROIs) extraction is performed using Haar-like algorithm. Before classification, the images containing the ROIs are processed to extract the edges of the objects. Non relevant edges are removed using a novel fuzzy technique. Object classification is performed with a pseudo2D-HMM algorithm. Experimental results are presented for an office environments.
{"title":"A Classification-Based Algorithm for Building 3D Maps of Environmental Objects","authors":"A. Cuzzocrea, E. Mumolo, Alessandro Moro","doi":"10.1109/ICCSA.2015.28","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.28","url":null,"abstract":"In this paper, a method for building a 3D map of some objects detected in an indoor environment is presented. The pecularity of the proposed algorithm is that it works with a simple consumer-grade webcam. With the webcam, pictures of the environment are taken. The proposed method first extracts the regions which may contain an object from the pictures. The regions are then classified to identify the objects, further their pose and height are estimated. A 3D map of the environment is finally reconstructed where icons roughly resembling the object categories are added to the 3D map at the estimated object position and with the estimated height. Regions of Interest (ROIs) extraction is performed using Haar-like algorithm. Before classification, the images containing the ROIs are processed to extract the edges of the objects. Non relevant edges are removed using a novel fuzzy technique. Object classification is performed with a pseudo2D-HMM algorithm. Experimental results are presented for an office environments.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116909860","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}
The paper describes an interactive computer program for visualizing bacterial gene regulation: the trp operon. The computer program was implemented based on our recently developed Gene Act framework. The advantages of this computer framework are 1) accelerating the development process and 2) simplifying the program development for researchers who wish to pack and distribute their work with interactive programs. The Gene Act frame work has been successfully used as a tutorial tool for learning the lac operon, the classical example of gene regulation in bacteria. The trp operon described here is as second example for such an application. Unlike the lac operon, which controls the breakdown of the sugar lactose, the trp operon is responsible for the synthesis of the amino acid tryptophan. As it is often challenging for beginners to understand the control mechanisms of the trp operon, especially the attenuation system, we hope that this interactive computer program may facilitate and improve learning by illustrating the process with rich text, images, animations, and interactive steps.
{"title":"Visualizing Bacterial Gene Regulation with an Interactive Computer Program: The Trp Operon","authors":"Xiaoli Yang, Yifan Cai, C. Tseng","doi":"10.1109/ICCSA.2015.12","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.12","url":null,"abstract":"The paper describes an interactive computer program for visualizing bacterial gene regulation: the trp operon. The computer program was implemented based on our recently developed Gene Act framework. The advantages of this computer framework are 1) accelerating the development process and 2) simplifying the program development for researchers who wish to pack and distribute their work with interactive programs. The Gene Act frame work has been successfully used as a tutorial tool for learning the lac operon, the classical example of gene regulation in bacteria. The trp operon described here is as second example for such an application. Unlike the lac operon, which controls the breakdown of the sugar lactose, the trp operon is responsible for the synthesis of the amino acid tryptophan. As it is often challenging for beginners to understand the control mechanisms of the trp operon, especially the attenuation system, we hope that this interactive computer program may facilitate and improve learning by illustrating the process with rich text, images, animations, and interactive steps.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124449467","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}
Broadcast Services is one of the most anticipated Internet services. Different from the conventional client-server based ones, information is provided to certain users according to some criteria for avoidance of wasted bandwidth and processing power. Location based broadcasting has been proposed; however, gain from most information is time-dependent and broadcasting schedule is determined based on the future locations of mobile users. This paper proposes a novel distributed broadcast scheduling for achievement of higher gain of mobile users. Here, stationary base stations and its broadcast time duration are selected based on the expected gain of mobile users. In addition, information is divided into multiple chunks which are broadcasted by a sequence of stationary base stations to share the base stations among multiple information providers.
{"title":"Distributed Broadcast Scheduling for Gain of Mobile Users","authors":"H. Higaki","doi":"10.1109/ICCSA.2015.29","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.29","url":null,"abstract":"Broadcast Services is one of the most anticipated Internet services. Different from the conventional client-server based ones, information is provided to certain users according to some criteria for avoidance of wasted bandwidth and processing power. Location based broadcasting has been proposed; however, gain from most information is time-dependent and broadcasting schedule is determined based on the future locations of mobile users. This paper proposes a novel distributed broadcast scheduling for achievement of higher gain of mobile users. Here, stationary base stations and its broadcast time duration are selected based on the expected gain of mobile users. In addition, information is divided into multiple chunks which are broadcasted by a sequence of stationary base stations to share the base stations among multiple information providers.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124233306","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}
In this paper, a coupling model of multigroup radiation diffusion and heat conduction is considered. Based the domain decomposition method, a new coupling interface boundary condition is designed in order to accomplish the simulation. The numerical results demonstrate the effect of the coupling simulation on the computing efficiency as well as accuracy.
{"title":"A Coupling Simulation on Multigroup Radiation Diffusion and Heat Conduction Models","authors":"Rong Yang, Xudeng Hang","doi":"10.1109/ICCSA.2015.20","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.20","url":null,"abstract":"In this paper, a coupling model of multigroup radiation diffusion and heat conduction is considered. Based the domain decomposition method, a new coupling interface boundary condition is designed in order to accomplish the simulation. The numerical results demonstrate the effect of the coupling simulation on the computing efficiency as well as accuracy.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116931128","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}
Thresholding is one of the most frequently used methods in image segmentation. Fuzzy entropy thresholding approach has been widely applied to image thresholding. Such thresholding approach used two parametric fuzzy membership functions for fuzzy partitioning of the image. In this paper, Teaching-Learning-based Optimization (TLBO) algorithm is used to search an optimal combination of parameters of the membership functions for maximizing the entropy of fuzzy 2-partition. The selected optimal parameters are used to find optimal image threshold value. This new proposed fuzzy thresholding algorithm is called the TLBO-based Fuzzy Entropy Thresholding (TLBO-based FET) algorithm. The proposed algorithm is tested on a number of standard test images. Three different approaches, Genetic Algorithm (GA), Biogeography-based Optimization (BBO), recursive approach, are also implemented for comparison with the results of the proposed approach. From experimental results, it is observed that the performance of the proposed algorithm is more effective than GA-based, BBO-based and recursive approaches.
{"title":"Image Segmentation Using Teaching-Learning-Based Optimization Algorithm and Fuzzy Entropy","authors":"B. Khehra, A. P. Pharwaha","doi":"10.1109/ICCSA.2015.10","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.10","url":null,"abstract":"Thresholding is one of the most frequently used methods in image segmentation. Fuzzy entropy thresholding approach has been widely applied to image thresholding. Such thresholding approach used two parametric fuzzy membership functions for fuzzy partitioning of the image. In this paper, Teaching-Learning-based Optimization (TLBO) algorithm is used to search an optimal combination of parameters of the membership functions for maximizing the entropy of fuzzy 2-partition. The selected optimal parameters are used to find optimal image threshold value. This new proposed fuzzy thresholding algorithm is called the TLBO-based Fuzzy Entropy Thresholding (TLBO-based FET) algorithm. The proposed algorithm is tested on a number of standard test images. Three different approaches, Genetic Algorithm (GA), Biogeography-based Optimization (BBO), recursive approach, are also implemented for comparison with the results of the proposed approach. From experimental results, it is observed that the performance of the proposed algorithm is more effective than GA-based, BBO-based and recursive approaches.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"3 14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115895244","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}
A distance metric for spatially extended objects provides a formal basis for analytical work in transformation-based multidimensional spatial access methods, including locality preservation of the underlying transformation, statistical analyses of the transformation-effect on spatial parameters and distribution, and distance-based spatial queries. We study the Hausdorff distance metric on the space of closed and bounded subsets in a multidimensional Euclidean space, and its restriction to convexity results in an explicit formulation in computation based on their boundary subsets.
{"title":"Distance Metric on Multidimensional Spatial Objects","authors":"H. K. Dai, H. Su","doi":"10.1109/ICCSA.2015.13","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.13","url":null,"abstract":"A distance metric for spatially extended objects provides a formal basis for analytical work in transformation-based multidimensional spatial access methods, including locality preservation of the underlying transformation, statistical analyses of the transformation-effect on spatial parameters and distribution, and distance-based spatial queries. We study the Hausdorff distance metric on the space of closed and bounded subsets in a multidimensional Euclidean space, and its restriction to convexity results in an explicit formulation in computation based on their boundary subsets.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121595297","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}
Q. Kester, Laurent Nana, A. Pascu, Sophie Gire, J. M. Eghan, N. Quaynor
Medical images stored in health information systems, cloud or other systems are of key importance. Privacy and security needs to be guaranteed for such images through encryption and authentication processes. Encrypted and watermarked images in this domain needed to be reversible so that the plain image operated on in the encryption and watermarking process can be fully recoverable due to the sensitivity of the data conveyed in medical images. In this paper, we proposed a fully recoverable encrypted and watermarked image processing technique for the security of medical images in health information systems. The approach is used to authenticate and secure the medical images. Our results showed to be very effective and reliable for fully recoverable images.
{"title":"A Security Technique for Authentication and Security of Medical Images in Health Information Systems","authors":"Q. Kester, Laurent Nana, A. Pascu, Sophie Gire, J. M. Eghan, N. Quaynor","doi":"10.1109/ICCSA.2015.8","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.8","url":null,"abstract":"Medical images stored in health information systems, cloud or other systems are of key importance. Privacy and security needs to be guaranteed for such images through encryption and authentication processes. Encrypted and watermarked images in this domain needed to be reversible so that the plain image operated on in the encryption and watermarking process can be fully recoverable due to the sensitivity of the data conveyed in medical images. In this paper, we proposed a fully recoverable encrypted and watermarked image processing technique for the security of medical images in health information systems. The approach is used to authenticate and secure the medical images. Our results showed to be very effective and reliable for fully recoverable images.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125962251","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}
Kazuaki Tanaka, Avinash Dev Nagumanthri, Yukihiro Matsumoto
In order to improve the development efficiency of embedded software, we have developed a programming language called mruby. We apply the object-oriented programming language Ruby to embedded system development. As compared to the interpreter of Ruby, mruby programs are executed by the compiler and VM. The memory footprint of mruby VM is sufficiently small, Ruby program is able to be executed on a limited resource device. In this paper, we show the benefits of using mruby in embedded software development. We also showcase the features and the development environment of mruby, and implementation results of simple application.
{"title":"mruby -- Rapid Software Development for Embedded Systems","authors":"Kazuaki Tanaka, Avinash Dev Nagumanthri, Yukihiro Matsumoto","doi":"10.1109/ICCSA.2015.22","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.22","url":null,"abstract":"In order to improve the development efficiency of embedded software, we have developed a programming language called mruby. We apply the object-oriented programming language Ruby to embedded system development. As compared to the interpreter of Ruby, mruby programs are executed by the compiler and VM. The memory footprint of mruby VM is sufficiently small, Ruby program is able to be executed on a limited resource device. In this paper, we show the benefits of using mruby in embedded software development. We also showcase the features and the development environment of mruby, and implementation results of simple application.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129904985","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}
The increasing complexity of embedded systems turned the requirements management in an even more dificulty task. In addition, there is a demand for innovative, customized and trendy systems. Design Thinking can minimize these problems throughout the development of Embedded Systems. The use of Design Thinking aims to understand the real users needs and generate innovative solutions for new systems. It can improve the requirement elicitation process and increase the quality of the final system. This paper approaches new trends in the use of design thinking during the whole development process of innovative embedded technologies.
{"title":"Trends in the Use of Design Thinking for Embedded Systems","authors":"R. Araujo, E. Anjos, D. Silva","doi":"10.1109/ICCSA.2015.25","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.25","url":null,"abstract":"The increasing complexity of embedded systems turned the requirements management in an even more dificulty task. In addition, there is a demand for innovative, customized and trendy systems. Design Thinking can minimize these problems throughout the development of Embedded Systems. The use of Design Thinking aims to understand the real users needs and generate innovative solutions for new systems. It can improve the requirement elicitation process and increase the quality of the final system. This paper approaches new trends in the use of design thinking during the whole development process of innovative embedded technologies.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133939803","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
扫码关注我们
求助内容：
应助结果提醒方式：