D. Vincze, S. Kovács, M. Niitsuma, H. Hashimoto, P. Korondi, M. Gácsi, Á. Miklósi
{"title":"Ethologically inspired human-robot interaction interfaces","authors":"D. Vincze, S. Kovács, M. Niitsuma, H. Hashimoto, P. Korondi, M. Gácsi, Á. Miklósi","doi":"10.1145/2160749.2160761","DOIUrl":"https://doi.org/10.1145/2160749.2160761","url":null,"abstract":"This paper presents human-robot interaction interfaces based on ethological studies. An ethological test procedure was modeled with the application of a fuzzy rule interpolation based fuzzy automaton. This fuzzy automaton was loaded with rules formed from the extracted ethological knowledge. Using the behaviours supplied by the fuzzy automaton as conclusions, different interfaces can be defined for the incarnation of the model. The ethological test procedure and its modeling technique based on the fuzzy automaton will be shortly introduced in the paper, and then the various human-robot interfaces based on the former will be presented. These include interfaces of simulated environments and also interfaces as real robot hardware with their supplemental devices (sensors, cameras, etc.).","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125867997","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}
{"title":"Topological decomposition algorithm for optimized solution of a system of linear equations","authors":"H. Yui, S. Nishimura","doi":"10.1145/2160749.2160802","DOIUrl":"https://doi.org/10.1145/2160749.2160802","url":null,"abstract":"A number of techniques for the direct solution of large systems of linear equations have been developed. Some of them are widely known and used for non-sparse systems of linear equations: LU decomposition and Cholesky decomposition. On the other hand, for sparse matrices, there are different types of algorithms, which decompose a system of linear equations into a number of subsets of the system. However, in the past there is no discussion for algorithms to decompose a large system of linear equations. In this article, we propose an efficient decomposition algorithm to optimize total operation costs using graph theory.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013606","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}
{"title":"AIDA compiler: a code synthesizer from programs in pictures","authors":"Y. Watanobe, N. Mirenkov, Yuya Watanabe","doi":"10.1145/2160749.2160767","DOIUrl":"https://doi.org/10.1145/2160749.2160767","url":null,"abstract":"AIDA is a language for programming (modeling and documenting) in pictures within F-modeling environment where pictures and moving pictures are used as super-characters for representing features of computational algorithms, corresponding application models and possible related documentation. Generic pictures of the algorithmic super-characters are used to compose compound pictures defining algorithmic steps. The generic and compound pictures, as well as their series are acquired in special galleries of an open type where supportive pictures of various annotations are also included. These acquisitions allow very compact algorithmic specifications from which a set of program slices with different levels of details are synthesized. The lowest level slice is a C++ program. The F-modeling environment provides a set of editors for different views and annotations. In this paper, a structure of the synthesizer is presented and a distribution of its functions among the environment subsystems is provided. A special attention is payed to internal objects, template programs and algorithms supporting the C++ program generation.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129134421","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}
{"title":"Automatic generation of English lesson materials for native speakers of Japanese","authors":"Jason Ginsburg","doi":"10.1145/2160749.2160753","DOIUrl":"https://doi.org/10.1145/2160749.2160753","url":null,"abstract":"This paper describes a computer program, a Lesson Material Builder, that is designed to automatically generate editable lesson materials for teaching English to speakers of Japanese. This program has two functions, a) an Exercise Creator, and b) a Vocabulary Quiz Creator. The Exercise Creator automatically creates an editable reading exercise document, from an input text, in which target vocabulary words are highlighted and definitions in Japanese are provided. Taking a reading exercise, of the sort produced by the Exercise Creator, the Vocabulary Quiz Creator can create vocabulary quizzes that require students to match vocabulary words with their definitions.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114775805","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}
{"title":"Task management principles for e-learning environments","authors":"Ruth Cortez, A. Vazhenin, Kazuki Sato","doi":"10.1145/2160749.2160757","DOIUrl":"https://doi.org/10.1145/2160749.2160757","url":null,"abstract":"This paper proposes the definition of a Task Management approach for e-Learning software components. The Task Management approach primary deals with subjects that require processing of mathematical expressions. We are exploring the strategy to collaborate components for automatic Task assignment with automatic Problem generation and the verification method. The support of the Task Management strategies in the framework of current systems, has limitations handling automatic verification of mathematical expressions. Therefore, our proposal is to elaborate the strategy for an enhanced Task Management system based on a Formula and Verification Engines that encapsulate the strategy; moreover, that can be integrated within a distributed development platform and exposed under Business-to-Client mode of communication. We describe the components and strategy to follow in further implementation for numerical and formula based Task Management e-Learning systems.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125993958","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}
{"title":"A Wikipedia-based corpus reference tool","authors":"Jason Ginsburg","doi":"10.1145/2160749.2160751","DOIUrl":"https://doi.org/10.1145/2160749.2160751","url":null,"abstract":"This paper describes a dictionary-like reference tool that is designed to help users find information that is similar to what one would find in a dictionary when looking up a word, except that this information is extracted automatically from large corpora. For a particular vocabulary item, a user can view frequency information, part-of-speech distribution, word-forms, definitions, example paragraphs and collocations. All of this information is extracted automatically from corpora and most of this information is extracted from Wikipedia. Since Wikipedia is a massive corpus covering a diverse range of general topics, this information is probably very representative of how target words are used in general. This project has applications for English language teachers and learners, as well as for language researchers.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127287828","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}
{"title":"An advanced search interface for mobile devices","authors":"T. Akiyama, Y. Watanobe","doi":"10.1145/2160749.2160797","DOIUrl":"https://doi.org/10.1145/2160749.2160797","url":null,"abstract":"An advanced search interface for mobile devices is presented. The search interface employs the query-by-object (QBO) approach which enables end users to obtain information in a database without using SQL. So far, the QBO approach has been employed in a number of applications. The aim of this research is to develop a visual user interface on mobile devices so that the users can more intuitively manipulate the objects for information retrieval. In this paper, the user interface, an algorithm of SQL generation, and the system architecture are presented. A framework to generalize the QBO approach with the interface for different databases is also considered.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128882093","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}
{"title":"Embeddable framework for syntax-safe source code generation","authors":"E. Kotelnikov","doi":"10.1145/2160749.2160769","DOIUrl":"https://doi.org/10.1145/2160749.2160769","url":null,"abstract":"Source code generation is an essential part of wide range of applications, including transcompilers, parser generators and preprocessors. The common technology based on code templates is often cumbersome and error-prone. This paper introduces syngen, an automatic tool, written in Scheme, designed to produce frameworks for building syntactically correct fragments of source code.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132382320","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}
{"title":"Multiprogram control for dynamic systems: a point of view","authors":"N. Smirnov","doi":"10.1145/2160749.2160773","DOIUrl":"https://doi.org/10.1145/2160749.2160773","url":null,"abstract":"In this paper, we analyze potentials and describe methods of synthesis of so-called multiprogram controls in different classes of dynamic systems. The main idea is to construct the control that provides predesigned finite set of asymptotically stable program motions for closed-loop system. Special attention is paid to modification of algorithms to extend possibilities of its application. For this aim, firstly, special classes of multiprogram controls are involved. Hybrid controls have continuous elements to realize program motions, and discrete stabilizers. Secondly, we analyze a case of incomplete feedback when some components of the phase state vector cannot be measured. In this case, the multiprogram control system is supplemented with asymptotic observer (state estimator), which also could be hybrid. Practically, the system closed with a multiprogram control is a nonlinear program automate that can realize any program motion of predesigned class depending on initial values. Developed theoretical base allows constructing of multiprogram control systems in cases of both complete and incomplete feedback when information in feedback channels is discrete. Research results are illustrated with an example of real technical application. The multiprogram control problem for providing of several modes of flywheel work in a car engine is considered.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126385921","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}
N. Zyatkov, A. Romanenko, A. Ayzenberg, A. Aizenberg, F. Andersson
{"title":"Modeling of seismic waves in layers with shadow boundaries in terms of unsparse propagation-absorption matrices: realization and optimization","authors":"N. Zyatkov, A. Romanenko, A. Ayzenberg, A. Aizenberg, F. Andersson","doi":"10.1145/2160749.2160772","DOIUrl":"https://doi.org/10.1145/2160749.2160772","url":null,"abstract":"The conventional Green's function introduced for an unbounded medium and applied in domains with complex boundaries may contain physically unfeasible components. These components would not be observed in an experimental study and thus lead to misinterpretation of the wave-field structure. The feasible Green's function that does not contain unfeasible components satisfies the principle of absorption of the part of the wavefield which penetrate the shadow zones formed by the concave parts of layer boundaries [9, 7]. Recently the feasible Green's function has been introduced as the superposition of the conventional Green's function and cascade diffraction. Cascade diffraction compensates for the unfeasible parts of the conventional Green's function and takes into account the actual shape of the boundaries. We represent a new algorithm for modelling the single-diffraction approximation of the cascade diffraction in terms of unsparse propagation-absorption matrices and provide numerical examples for an acoustic half-space with a wedge-shaped boundary, which illustrate the accuracy and efficiency of the algorithm.","PeriodicalId":407345,"journal":{"name":"Joint International Conference on Human-Centered Computer Environments","volume":"47 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115944313","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}