Pub Date : 1900-01-01DOI: 10.1109/SAMI.2017.7880324
D. Kiss
This paper presents a mathematical model of heat production, exchange and accumulation during ethanol generator at small-scaled fermentor tanks in home wineries or breweries. Heat generation is directly related to CO2 production rate, which serves as a time-dependent input parameter of the model, as well as the actual ambient temperature. Validation at pilot scale experiments showed good agreement with recorded temperature sensor data.
{"title":"A model of heat exchange and accumulation in small-sized bioreactors during ethanol fermentation","authors":"D. Kiss","doi":"10.1109/SAMI.2017.7880324","DOIUrl":"https://doi.org/10.1109/SAMI.2017.7880324","url":null,"abstract":"This paper presents a mathematical model of heat production, exchange and accumulation during ethanol generator at small-scaled fermentor tanks in home wineries or breweries. Heat generation is directly related to CO2 production rate, which serves as a time-dependent input parameter of the model, as well as the actual ambient temperature. Validation at pilot scale experiments showed good agreement with recorded temperature sensor data.","PeriodicalId":105599,"journal":{"name":"2017 IEEE 15th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117187897","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 : 1900-01-01DOI: 10.1109/SAMI.2017.7880358
Marko Lukic, Eva Tuba, M. Tuba
Leaf recognition is convenient for plant classification and it is an important subfield of pattern recognition. Different leaf features such as color, shape and texture are used as well as different classifiers including artificial neural networks, k-nearest neighbor and support vector machines. In this paper we propose an algorithm based on tuned support vector machine as a classifier and Hu moments and uniform local binary pattern histogram parameters as features. Our proposed algorithm was tested on leaf images from standard benchmark database and compared with other approaches from literature where it proved to be more successful (higher recognition percentage).
{"title":"Leaf recognition algorithm using support vector machine with Hu moments and local binary patterns","authors":"Marko Lukic, Eva Tuba, M. Tuba","doi":"10.1109/SAMI.2017.7880358","DOIUrl":"https://doi.org/10.1109/SAMI.2017.7880358","url":null,"abstract":"Leaf recognition is convenient for plant classification and it is an important subfield of pattern recognition. Different leaf features such as color, shape and texture are used as well as different classifiers including artificial neural networks, k-nearest neighbor and support vector machines. In this paper we propose an algorithm based on tuned support vector machine as a classifier and Hu moments and uniform local binary pattern histogram parameters as features. Our proposed algorithm was tested on leaf images from standard benchmark database and compared with other approaches from literature where it proved to be more successful (higher recognition percentage).","PeriodicalId":105599,"journal":{"name":"2017 IEEE 15th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502418","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 : 1900-01-01DOI: 10.1109/SAMI.2017.7880284
Matus Pleva, J. Juhár, A. Cizmár, Christopher R. Hudson, Daniel W. Carruth, Cindy L. Bethel
This paper describes the development of a specialized application for voice command recognition for the Jaguar V4 robot in conjunction with the Starkville, MS, USA Special Weapons and Tactics (SWAT) team during training. This training took place at The Center for Advanced Vehicular Systems (CAVS), which provides a specialized environment for police SWAT training. This reconfigurable space, setup during this study as a two bedroom apartment, includes video monitoring of the space, sound playback and capturing, reconfigurable lighting, etc. This training environment is used for testing different kinds of human-robot interfaces in SWAT training operations. The results of the voice integration evaluation indicated that voice commands could be successfully used for controlling additional functions of the robot after a short introductory training session with a few of the police officers. These preliminary observations were encouraging and provides support for further investigation into the usefulness of this technology.
{"title":"Implementing English speech interface to Jaguar robot for SWAT training","authors":"Matus Pleva, J. Juhár, A. Cizmár, Christopher R. Hudson, Daniel W. Carruth, Cindy L. Bethel","doi":"10.1109/SAMI.2017.7880284","DOIUrl":"https://doi.org/10.1109/SAMI.2017.7880284","url":null,"abstract":"This paper describes the development of a specialized application for voice command recognition for the Jaguar V4 robot in conjunction with the Starkville, MS, USA Special Weapons and Tactics (SWAT) team during training. This training took place at The Center for Advanced Vehicular Systems (CAVS), which provides a specialized environment for police SWAT training. This reconfigurable space, setup during this study as a two bedroom apartment, includes video monitoring of the space, sound playback and capturing, reconfigurable lighting, etc. This training environment is used for testing different kinds of human-robot interfaces in SWAT training operations. The results of the voice integration evaluation indicated that voice commands could be successfully used for controlling additional functions of the robot after a short introductory training session with a few of the police officers. These preliminary observations were encouraging and provides support for further investigation into the usefulness of this technology.","PeriodicalId":105599,"journal":{"name":"2017 IEEE 15th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124914569","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 : 1900-01-01DOI: 10.1109/SAMI.2017.7880351
M. Tóthová, A. Vagaská, M. Balara
Systems with time-delay are a specific group of dynamic systems. There occurs the time lag of the signal, information or material, which results in the deterioration of the properties of a control circuit if we want to control of such system. The presence of time-delay complicates the synthesis of a control circuit and therefore it is necessary to these systems was described by the differential equations. Laplace transform gives a very simple method of solving these linear differential equations with constant coefficients. The theoretical basis for simple but exact solution gives W-transform that a transcendent solution converts to solve algebraic equations. W image is defined similar as is defined by the Z image of the functions.
{"title":"Solution of systems with the time-delay using the operator w","authors":"M. Tóthová, A. Vagaská, M. Balara","doi":"10.1109/SAMI.2017.7880351","DOIUrl":"https://doi.org/10.1109/SAMI.2017.7880351","url":null,"abstract":"Systems with time-delay are a specific group of dynamic systems. There occurs the time lag of the signal, information or material, which results in the deterioration of the properties of a control circuit if we want to control of such system. The presence of time-delay complicates the synthesis of a control circuit and therefore it is necessary to these systems was described by the differential equations. Laplace transform gives a very simple method of solving these linear differential equations with constant coefficients. The theoretical basis for simple but exact solution gives W-transform that a transcendent solution converts to solve algebraic equations. W image is defined similar as is defined by the Z image of the functions.","PeriodicalId":105599,"journal":{"name":"2017 IEEE 15th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131865890","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 : 1900-01-01DOI: 10.1109/SAMI.2017.7880335
A. Ürmös, Z. Farkas, M. Farkas, T. Sandor, L. Kóczy, Á. Nemcsics
In this paper, the clustering of the GaAs-based droplet epitaxially grown self-assembled nanostructures was investigated by soft-computing methods. The properties and the operation of these devices, depend on the type, the shape, the size, and their distribution of these 0 dimensional nanostructures. Because of this, it is very important to know, how and what kind of nanostructures can form, at the given technological parameters. Our goal is the classification of these nanostructures, in order to support the research and the production of these devices. Our solution is based on the shape factor calculation of the given nanostructure. In this work, two possible classification methods of nanostructures were introduced as well. First, the classification potential of the Kohonen Self-Organizing Mapping (SOM) was investigated. Second, the fuzzy inference system based classification was studied. In this case, the shape factor was determined by geometrical sizes of the nanostructures. In this paper the clustering was introduced, which supports many kinds of technology as well.
{"title":"Fuzzy and Kohonen SOM based classification of different 0D nanostructures","authors":"A. Ürmös, Z. Farkas, M. Farkas, T. Sandor, L. Kóczy, Á. Nemcsics","doi":"10.1109/SAMI.2017.7880335","DOIUrl":"https://doi.org/10.1109/SAMI.2017.7880335","url":null,"abstract":"In this paper, the clustering of the GaAs-based droplet epitaxially grown self-assembled nanostructures was investigated by soft-computing methods. The properties and the operation of these devices, depend on the type, the shape, the size, and their distribution of these 0 dimensional nanostructures. Because of this, it is very important to know, how and what kind of nanostructures can form, at the given technological parameters. Our goal is the classification of these nanostructures, in order to support the research and the production of these devices. Our solution is based on the shape factor calculation of the given nanostructure. In this work, two possible classification methods of nanostructures were introduced as well. First, the classification potential of the Kohonen Self-Organizing Mapping (SOM) was investigated. Second, the fuzzy inference system based classification was studied. In this case, the shape factor was determined by geometrical sizes of the nanostructures. In this paper the clustering was introduced, which supports many kinds of technology as well.","PeriodicalId":105599,"journal":{"name":"2017 IEEE 15th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129893376","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 : 1900-01-01DOI: 10.1109/SAMI.2017.7880297
Julia Taylor Rayz
With AI celebrating its 60th anniversary, questions arise of when (not even if) a computational system will be able to understand humor. These questions open up interesting opportunities, but point out areas of research that yet are insufficient for informal human computer communication. This paper looks at computational humor as a way of verifying computational understanding of text (written or verbal). In particular, we treat ontology as a knowledge representation mechanism and natural language as a vehicle delivering this knowledge. A true ontology should provide a world model for the described domain, identifying its main concepts and tying them together with all relevant contentful properties. The question is how to get this model from text accurately? Assuming, as we do, that there is an accurate and unambiguous way of getting explicitly stated information from text, a lot of information is, in fact, implicit and yet crucial to the world model that we are creating. This implicit information has to be made explicit at the reasoning stage if we hope to come up with the results similar to human reasoning or understanding. In this paper, we will look at various ways, requiring optimal human-computer hybrid collaboration, in which ontology helps text understanding for humor processing, and text helps with dynamic ontology development. We hypothesize that such communication will be helpful for interaction with any computational system in a human-friendly way in general, and for robots in particular.
{"title":"In pursuit of human-friendly interaction with a computational system: Computational humor","authors":"Julia Taylor Rayz","doi":"10.1109/SAMI.2017.7880297","DOIUrl":"https://doi.org/10.1109/SAMI.2017.7880297","url":null,"abstract":"With AI celebrating its 60th anniversary, questions arise of when (not even if) a computational system will be able to understand humor. These questions open up interesting opportunities, but point out areas of research that yet are insufficient for informal human computer communication. This paper looks at computational humor as a way of verifying computational understanding of text (written or verbal). In particular, we treat ontology as a knowledge representation mechanism and natural language as a vehicle delivering this knowledge. A true ontology should provide a world model for the described domain, identifying its main concepts and tying them together with all relevant contentful properties. The question is how to get this model from text accurately? Assuming, as we do, that there is an accurate and unambiguous way of getting explicitly stated information from text, a lot of information is, in fact, implicit and yet crucial to the world model that we are creating. This implicit information has to be made explicit at the reasoning stage if we hope to come up with the results similar to human reasoning or understanding. In this paper, we will look at various ways, requiring optimal human-computer hybrid collaboration, in which ontology helps text understanding for humor processing, and text helps with dynamic ontology development. We hypothesize that such communication will be helpful for interaction with any computational system in a human-friendly way in general, and for robots in particular.","PeriodicalId":105599,"journal":{"name":"2017 IEEE 15th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131188561","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 : 1900-01-01DOI: 10.1109/SAMI.2017.7880312
H. Khan, A. Galántai, J. Tar
In a wide class of robots of open kinematic chain the inverse kinematic task cannot be solved by the use of closed-form analytical formulae. On this reason the traditional approaches apply differential approximation in which the Jacobian of the — normally redundant — robot arm is "inverted" by the use of some "generalized inverse". These pseudo-inverses behave well whenever the robot arm is far from a singular configuration, however, in the singularities and nearby the singular configurations they suffer from a singular or ill-conditioned pseudoinverse. For tackling the problem of singularities normally complementary "tricks" have to be used that so "deform" the original problem that the deformed version leads to the inversion of a well-conditioned matrix. Though the so obtained solution does not exactly solve the original problem, it is accepted as practical "substitute" of the not existing solution in the singularities, and an acceptable approximation of the exact solution outside the singular points. Recently, in [1], an alternative, quasi-differential approach was suggested that was absolutely free of any matrix inversion. It was shown that it converged to one of the — normally ambiguous — exact solutions at the nonsingular configurations, and showed stable convergence in the singular points when a "substitute" of the not existing solution was created. This convenient convergence was guaranteed by the use of the "exact Jacobian" of the robot arm. The interesting question, i.e. what happens if only an "approximate Jacobian" is available, and the motion of the robot arm is precisely measurable with respect to a Cartesian "workshop"-based system of reference, was left open. Now it is shown that the convergence properties of the method can be improved by the application of simple rotational matrices, and on this basis the iterative application of an "Adaptive Inverse Kinematics" becomes possible. This approach has the specialty that no complete information it needs on the Jacobian at a given point. It is content with the observable system behavior only along the realized motion, so it seems to be easily implementable. Its operation is demonstrated for an irregularly extended 6 Degree-of-Freedom (DoF) PUMA-type robot arm, that has 8 rotary axles.
{"title":"Adaptive solution of the inverse kinematic task by fixed point transformation","authors":"H. Khan, A. Galántai, J. Tar","doi":"10.1109/SAMI.2017.7880312","DOIUrl":"https://doi.org/10.1109/SAMI.2017.7880312","url":null,"abstract":"In a wide class of robots of open kinematic chain the inverse kinematic task cannot be solved by the use of closed-form analytical formulae. On this reason the traditional approaches apply differential approximation in which the Jacobian of the — normally redundant — robot arm is \"inverted\" by the use of some \"generalized inverse\". These pseudo-inverses behave well whenever the robot arm is far from a singular configuration, however, in the singularities and nearby the singular configurations they suffer from a singular or ill-conditioned pseudoinverse. For tackling the problem of singularities normally complementary \"tricks\" have to be used that so \"deform\" the original problem that the deformed version leads to the inversion of a well-conditioned matrix. Though the so obtained solution does not exactly solve the original problem, it is accepted as practical \"substitute\" of the not existing solution in the singularities, and an acceptable approximation of the exact solution outside the singular points. Recently, in [1], an alternative, quasi-differential approach was suggested that was absolutely free of any matrix inversion. It was shown that it converged to one of the — normally ambiguous — exact solutions at the nonsingular configurations, and showed stable convergence in the singular points when a \"substitute\" of the not existing solution was created. This convenient convergence was guaranteed by the use of the \"exact Jacobian\" of the robot arm. The interesting question, i.e. what happens if only an \"approximate Jacobian\" is available, and the motion of the robot arm is precisely measurable with respect to a Cartesian \"workshop\"-based system of reference, was left open. Now it is shown that the convergence properties of the method can be improved by the application of simple rotational matrices, and on this basis the iterative application of an \"Adaptive Inverse Kinematics\" becomes possible. This approach has the specialty that no complete information it needs on the Jacobian at a given point. It is content with the observable system behavior only along the realized motion, so it seems to be easily implementable. Its operation is demonstrated for an irregularly extended 6 Degree-of-Freedom (DoF) PUMA-type robot arm, that has 8 rotary axles.","PeriodicalId":105599,"journal":{"name":"2017 IEEE 15th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"19 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125768893","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 : 1900-01-01DOI: 10.1109/SAMI.2017.7880357
Daniel P. Kun, Erika Varga, Zsolt Tóth
This paper presents the model of the navigation component of the ILONA System, which is a flexible indoor positioning framework. Navigation in closed environment is a vital part of indoor location based services. The unique properties and the topology of the indoor environments limits the usage of existing global navigation solutions. On the other hand, room-level indoor navigation can be traced back to graph algorithms. Ontology allows a flexible description of the indoor environment and can store the structure and other properties of the buildings compactly. The ontology presented was tailored to the existing components of the ILONA System. The adaptation of existing indoor ontologies were discarded. Hence, the ontology introduced in this paper is able to model the structures of buildings efficiently and it is based on the model of the ILONA System. This model can be used to extend the ILONA System with an ontology-based navigation capability. The model presented was used to model a three-story building for verification. The utility functions and services implemented are also presented in this paper.
{"title":"Ontology based navigation model of the ILONA system","authors":"Daniel P. Kun, Erika Varga, Zsolt Tóth","doi":"10.1109/SAMI.2017.7880357","DOIUrl":"https://doi.org/10.1109/SAMI.2017.7880357","url":null,"abstract":"This paper presents the model of the navigation component of the ILONA System, which is a flexible indoor positioning framework. Navigation in closed environment is a vital part of indoor location based services. The unique properties and the topology of the indoor environments limits the usage of existing global navigation solutions. On the other hand, room-level indoor navigation can be traced back to graph algorithms. Ontology allows a flexible description of the indoor environment and can store the structure and other properties of the buildings compactly. The ontology presented was tailored to the existing components of the ILONA System. The adaptation of existing indoor ontologies were discarded. Hence, the ontology introduced in this paper is able to model the structures of buildings efficiently and it is based on the model of the ILONA System. This model can be used to extend the ILONA System with an ontology-based navigation capability. The model presented was used to model a three-story building for verification. The utility functions and services implemented are also presented in this paper.","PeriodicalId":105599,"journal":{"name":"2017 IEEE 15th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128695947","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
扫码关注我们
求助内容：
应助结果提醒方式：