Pub Date : 2018-12-14DOI: 10.14232/actacyb.23.4.2018.6
R. Rill, Kinga Bettina Faragó
In this work we investigate the effects of switching from mouse cursor control to gaze-based control in a computerized divided attention game. We conducted experiments with nine participants performing a task that requires continuous focused concentration and frequent shifts of attention. Despite carefully controlling experimental and design aspects, the performance of subjects was considerably impaired when using gaze-based control. The participants were experienced users of the mouse control version of the task, we adjusted the difficulty to the more demanding conditions and selected the parameters of gaze input based on previous research findings. In contrast to our assumptions, experienced users could not get used to gaze-based control in the amount of experiments we performed. Additionally we consider the strategies of users, i.e. their method of problem solving, and found that it is possible to make progress in our task even during a short amount of practice. The results of this study provide evidence that the adoption of interfaces controlled by human eye-gaze in cognitively demanding environments require careful design, proper testing and sufficient user training.
{"title":"Gaze-based Cursor Control Impairs Performance in Divided Attention","authors":"R. Rill, Kinga Bettina Faragó","doi":"10.14232/actacyb.23.4.2018.6","DOIUrl":"https://doi.org/10.14232/actacyb.23.4.2018.6","url":null,"abstract":"In this work we investigate the effects of switching from mouse cursor control to gaze-based control in a computerized divided attention game. We conducted experiments with nine participants performing a task that requires continuous focused concentration and frequent shifts of attention. Despite carefully controlling experimental and design aspects, the performance of subjects was considerably impaired when using gaze-based control. The participants were experienced users of the mouse control version of the task, we adjusted the difficulty to the more demanding conditions and selected the parameters of gaze input based on previous research findings. In contrast to our assumptions, experienced users could not get used to gaze-based control in the amount of experiments we performed. Additionally we consider the strategies of users, i.e. their method of problem solving, and found that it is possible to make progress in our task even during a short amount of practice. The results of this study provide evidence that the adoption of interfaces controlled by human eye-gaze in cognitively demanding environments require careful design, proper testing and sufficient user training.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125404835","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 : 2018-07-25DOI: 10.14232/actacyb.24.3.2020.15
Ide-Flore Kenmogne, Vincent Drevelle, É. Marchand
In this article we address the problem of cooperative pose estimation in a group of unmanned aerial vehicles (UAV) in a bounded error context. The UAVs are equipped with cameras to track landmarks positions, and a communication and ranging system to cooperate with their neighbours. Measurements are represented by intervals, and constraints are expressed on the robots poses (positions and orientations). Each robot of the group first computes a pose domain using only its sensors measurements using set inversion via interval analysis. Then, through position boxes exchange, positions are cooperatively refined by constraint propagation in the group. Results with real robot data are presented, and show that the position accuracy is improvedthanks to cooperation.
{"title":"Cooperative Localization of Drones by using Interval Methods","authors":"Ide-Flore Kenmogne, Vincent Drevelle, É. Marchand","doi":"10.14232/actacyb.24.3.2020.15","DOIUrl":"https://doi.org/10.14232/actacyb.24.3.2020.15","url":null,"abstract":"In this article we address the problem of cooperative pose estimation in a group of unmanned aerial vehicles (UAV) in a bounded error context. The UAVs are equipped with cameras to track landmarks positions, and a communication and ranging system to cooperate with their neighbours. Measurements are represented by intervals, and constraints are expressed on the robots poses (positions and orientations). Each robot of the group first computes a pose domain using only its sensors measurements using set inversion via interval analysis. Then, through position boxes exchange, positions are cooperatively refined by constraint propagation in the group. Results with real robot data are presented, and show that the position accuracy is improvedthanks to cooperation.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125211750","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 : 2018-07-25DOI: 10.14232/actacyb.24.3.2020.10
Olivier Mullier, Julien Alexandre Dit Sandretto, Alexandre Chapoutot
The problem of determining optimal switching instants for the control of hybrid systems under reachability constraints is considered. This optimization problem is cast into an interval global optimization problem with differential constraints, where validated simulation techniques and dynamic time meshing are used for its solution. The approach is applied on two examples, one being the well-known example of the Goddard’s problem where a rocket has to reach a given altitude while consuming the smallest amount of fuel.
{"title":"Optimal Switching Instants for the Control of Hybrid Systems","authors":"Olivier Mullier, Julien Alexandre Dit Sandretto, Alexandre Chapoutot","doi":"10.14232/actacyb.24.3.2020.10","DOIUrl":"https://doi.org/10.14232/actacyb.24.3.2020.10","url":null,"abstract":"The problem of determining optimal switching instants for the control of hybrid systems under reachability constraints is considered. This optimization problem is cast into an interval global optimization problem with differential constraints, where validated simulation techniques and dynamic time meshing are used for its solution. The approach is applied on two examples, one being the well-known example of the Goddard’s problem where a rocket has to reach a given altitude while consuming the smallest amount of fuel.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116893974","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 : 2018-02-26DOI: 10.14232/actacyb.23.3.2018.6
Csilla Bujtás, Z. Tuza
For a finite set $X$, we say that a set $Hsubseteq X$ crosses a partition ${cal P}=(X_1,dots,X_k)$ of $X$ if $H$ intersects $min (|H|,k)$ partition classes. If $|H|geq k$, this means that $H$ meets all classes $X_i$, whilst for $|H|leq k$ the elements of the crossing set $H$ belong to mutually distinct classes. A set system ${cal H}$ crosses ${cal P}$, if so does some $Hin {cal H}$. The minimum number of $r$-element subsets, such that every $k$-partition of an $n$-element set $X$ is crossed by at least one of them, is denoted by $f(n,k,r)$. The problem of determining these minimum values for $k=r$ was raised and studied by several authors, first by Sterboul in 1973 [Proc. Colloq. Math. Soc. J. Bolyai, Vol. 10, Keszthely 1973, North-Holland/American Elsevier, 1975, pp. 1387--1404]. The present authors determined asymptotically tight estimates on $f(n,k,k)$ for every fixed $k$ as $nto infty$ [Graphs Combin., 25 (2009), 807--816]. Here we consider the more general problem for two parameters $k$ and $r$, and establish lower and upper bounds for $f(n,k,r)$. For various combinations of the three values $n,k,r$ we obtain asymptotically tight estimates, and also point out close connections of the function $f(n,k,r)$ to Tur'an-type extremal problems on graphs and hypergraphs, or to balanced incomplete block designs.
{"title":"Partition-Crossing Hypergraphs","authors":"Csilla Bujtás, Z. Tuza","doi":"10.14232/actacyb.23.3.2018.6","DOIUrl":"https://doi.org/10.14232/actacyb.23.3.2018.6","url":null,"abstract":"For a finite set $X$, we say that a set $Hsubseteq X$ crosses a partition ${cal P}=(X_1,dots,X_k)$ of $X$ if $H$ intersects $min (|H|,k)$ partition classes. If $|H|geq k$, this means that $H$ meets all classes $X_i$, whilst for $|H|leq k$ the elements of the crossing set $H$ belong to mutually distinct classes. A set system ${cal H}$ crosses ${cal P}$, if so does some $Hin {cal H}$. The minimum number of $r$-element subsets, such that every $k$-partition of an $n$-element set $X$ is crossed by at least one of them, is denoted by $f(n,k,r)$. \u0000The problem of determining these minimum values for $k=r$ was raised and studied by several authors, first by Sterboul in 1973 [Proc. Colloq. Math. Soc. J. Bolyai, Vol. 10, Keszthely 1973, North-Holland/American Elsevier, 1975, pp. 1387--1404]. The present authors determined asymptotically tight estimates on $f(n,k,k)$ for every fixed $k$ as $nto infty$ [Graphs Combin., 25 (2009), 807--816]. Here we consider the more general problem for two parameters $k$ and $r$, and establish lower and upper bounds for $f(n,k,r)$. For various combinations of the three values $n,k,r$ we obtain asymptotically tight estimates, and also point out close connections of the function $f(n,k,r)$ to Tur'an-type extremal problems on graphs and hypergraphs, or to balanced incomplete block designs.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"110 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120877779","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 : 2017-03-07DOI: 10.14232/actacyb.23.1.2017.7
J. Almeida, Z. Ésik, J. Pin
We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter alphabets.
我们研究了在单字母字母的洗牌、重命名和乘积等操作下封闭的语言的交换正变体。
{"title":"Commutative Positive Varieties of Languages","authors":"J. Almeida, Z. Ésik, J. Pin","doi":"10.14232/actacyb.23.1.2017.7","DOIUrl":"https://doi.org/10.14232/actacyb.23.1.2017.7","url":null,"abstract":"We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter alphabets.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134207824","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 : 2016-06-01DOI: 10.14232/actacyb.22.3.2016.1
Viktória Fördős, M. Tóth
Code clones, the results of "copy&paste programming", have a negativeimpact on software maintenance. Therefore several tools and techniqueshave been developed to identify them in the source code. Most ofthem concentrate on imperative, well known languages, while in thispaper, we give an AST/metric based clone detection algorithm forthe functional programming language Erlang. We propose a standalonesolution that does not overload users with results that are insignificantfrom the point of view of the user. We emphasise that the maintenancecosts can be decreased by using our solution, because the programmersneed to deal only with important issues.
{"title":"Identifying Code Clones with RefactorErl","authors":"Viktória Fördős, M. Tóth","doi":"10.14232/actacyb.22.3.2016.1","DOIUrl":"https://doi.org/10.14232/actacyb.22.3.2016.1","url":null,"abstract":"Code clones, the results of \"copy&paste programming\", have a negativeimpact on software maintenance. Therefore several tools and techniqueshave been developed to identify them in the source code. Most ofthem concentrate on imperative, well known languages, while in thispaper, we give an AST/metric based clone detection algorithm forthe functional programming language Erlang. We propose a standalonesolution that does not overload users with results that are insignificantfrom the point of view of the user. We emphasise that the maintenancecosts can be decreased by using our solution, because the programmersneed to deal only with important issues.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125135968","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 : 2016-06-01DOI: 10.14232/actacyb.22.3.2016.10
P. Dömösi, S. Fazekas, Masami Ito
The characterization of the structure of palindromic regular and palindromiccontext-free languages is described by S. Horvath, J. Karhumaki,and J. Kleijn in 1987. In this paper alternative proofs are givenfor these characterizations.
S. Horvath、J. Karhumaki和J. Kleijn在1987年描述了回文规则语言和回文上下文无关语言的结构特征。本文给出了这些刻画的替代证明。
{"title":"On Chomsky Hierarchy of Palindromic Languages","authors":"P. Dömösi, S. Fazekas, Masami Ito","doi":"10.14232/actacyb.22.3.2016.10","DOIUrl":"https://doi.org/10.14232/actacyb.22.3.2016.10","url":null,"abstract":"The characterization of the structure of palindromic regular and palindromiccontext-free languages is described by S. Horvath, J. Karhumaki,and J. Kleijn in 1987. In this paper alternative proofs are givenfor these characterizations.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122449577","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 : 2016-06-01DOI: 10.14232/actacyb.22.3.2016.4
E. Mäkinen
As left Szilard languages form a subclass of simple deterministiclanguages and even a subclass of super-deterministic languages, weknow that their equivalence problem is decidable. In this note weshow that their emptiness of intersection problem is undecidable.The proof follows the lines of the correponding proof for simpledeterministic languages, but some technical tricks are needed. Thisresult sharpens the borderline between decidable and undecidableproblems in formal language theory.
{"title":"A Note on the Emptiness of Intersection Problem for Left Szilard Languages","authors":"E. Mäkinen","doi":"10.14232/actacyb.22.3.2016.4","DOIUrl":"https://doi.org/10.14232/actacyb.22.3.2016.4","url":null,"abstract":"As left Szilard languages form a subclass of simple deterministiclanguages and even a subclass of super-deterministic languages, weknow that their equivalence problem is decidable. In this note weshow that their emptiness of intersection problem is undecidable.The proof follows the lines of the correponding proof for simpledeterministic languages, but some technical tricks are needed. Thisresult sharpens the borderline between decidable and undecidableproblems in formal language theory.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117121466","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 : 2016-06-01DOI: 10.14232/actacyb.22.3.2016.7
Miklós Ujvári
In the paper we study the properties of the projection onto a finitelygenerated cone. We show that this map is made up of finitely manylinear parts with a structure resembling the facial structure ofthe finitely generated cone. An economical regarding storage algorithmis also presented for calculating the projection of a fixed vector,based on Lemke's algorithm to solve a linear complementarity problem.Some remarks on the conical inverse a generalization of the Moore-Penrosegeneralized inverse conclude the paper.
{"title":"On the Projection onto a Finitely Generated Cone","authors":"Miklós Ujvári","doi":"10.14232/actacyb.22.3.2016.7","DOIUrl":"https://doi.org/10.14232/actacyb.22.3.2016.7","url":null,"abstract":"In the paper we study the properties of the projection onto a finitelygenerated cone. We show that this map is made up of finitely manylinear parts with a structure resembling the facial structure ofthe finitely generated cone. An economical regarding storage algorithmis also presented for calculating the projection of a fixed vector,based on Lemke's algorithm to solve a linear complementarity problem.Some remarks on the conical inverse a generalization of the Moore-Penrosegeneralized inverse conclude the paper.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125275002","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 : 2016-06-01DOI: 10.14232/actacyb.22.3.2016.8
T. Vinkó
Besides server supported solutions for Video-on-demand, approachesbased on distributed systems such as BitTorrent are being used dueto their efficiency and high scalability. There are several protocolvariants proposed in the literature, which are mainly concerned withproviding mechanisms for piece selection and peer selection. In thispaper, using the concept of Design Space Analysis, we give comparisonsof the performances of several BitTorrent-like Video-on-demand protocolsunder the assumption that other protocol variants may also enterthe system.
{"title":"Robustness of BitTorrent-like VoD Protocols","authors":"T. Vinkó","doi":"10.14232/actacyb.22.3.2016.8","DOIUrl":"https://doi.org/10.14232/actacyb.22.3.2016.8","url":null,"abstract":"Besides server supported solutions for Video-on-demand, approachesbased on distributed systems such as BitTorrent are being used dueto their efficiency and high scalability. There are several protocolvariants proposed in the literature, which are mainly concerned withproviding mechanisms for piece selection and peer selection. In thispaper, using the concept of Design Space Analysis, we give comparisonsof the performances of several BitTorrent-like Video-on-demand protocolsunder the assumption that other protocol variants may also enterthe system.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123753967","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
扫码关注我们
求助内容：
应助结果提醒方式：