Pub Date : 2016-12-19DOI: 10.22364/BJMC.2016.4.4.27
M. Mednis
Reconstruction of genome-scale metabolic network is a result of assembling various information sources about all biochemical reactions expected in the metabolic network of interest. Despite the efforts of leading bio-models databases to make comparison of biochemical networks by elements names obsolete, interest from researchers in using string similarity metrics in comparison of metabolites names has been growing. Multiple challenges in comparison of reconstructions are discussed in this article and an insight into current approach of metabolic model comparison has been given. The discussion of challenges and attempts to solve them are followed by the author’s proposed algorithm for models comparison that can be particularly useful in case of reconstructions. Special attention is given to the use of metabolites names and chemical formulas. The author’s proposed algorithm has been implemented in a software tool ModeRator. The article is concluded with use cases of the comparison algorithm and the software tool.
{"title":"Comparative Analysis of Biochemical Network Reconstructions","authors":"M. Mednis","doi":"10.22364/BJMC.2016.4.4.27","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.27","url":null,"abstract":"Reconstruction of genome-scale metabolic network is a result of assembling various information sources about all biochemical reactions expected in the metabolic network of interest. Despite the efforts of leading bio-models databases to make comparison of biochemical networks by elements names obsolete, interest from researchers in using string similarity metrics in comparison of metabolites names has been growing. Multiple challenges in comparison of reconstructions are discussed in this article and an insight into current approach of metabolic model comparison has been given. The discussion of challenges and attempts to solve them are followed by the author’s proposed algorithm for models comparison that can be particularly useful in case of reconstructions. Special attention is given to the use of metabolites names and chemical formulas. The author’s proposed algorithm has been implemented in a software tool ModeRator. The article is concluded with use cases of the comparison algorithm and the software tool.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128971113","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-12-19DOI: 10.22364/BJMC.2016.4.4.24
Özgen Korkmaz
The aim of the study was to present the effect of Lego Mindstorms Ev3 based design activities on students’ attitudes towards learning computer programming, self-efficacy beliefs and levels of academic achievement. The research is a pretest-posttest with control group semiexperimental study. The study group of the research consisted of 53 students attending the faculty of engineering. The experimental group was administered a teaching method with Lego Mindstorms Ev3 based design activities. On the other hand, in the control group C++ topics were directly taught via editor. Research data were collected via the implementing academic achievement test (Kr-20= 0.71), attitude towards learning programming scale (Cronbach’s Alpha =0.84) and computer programming self-efficacy scale (Cronbach’s Alpha= 0.966). Obtained findings were: The education using Lego Mindstorms Ev3 design activities contributed more meaningfully to the academic success of the students in terms of C++ programming language compared to the traditional method.
{"title":"The Effect of Lego Mindstrom Eve 3 Based Design Activities on Students' Attitudes towards Learning Computer Programming, Self-efficacy Beliefs and Levels of Academic Achievement","authors":"Özgen Korkmaz","doi":"10.22364/BJMC.2016.4.4.24","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.24","url":null,"abstract":"The aim of the study was to present the effect of Lego Mindstorms Ev3 based design activities on students’ attitudes towards learning computer programming, self-efficacy beliefs and levels of academic achievement. The research is a pretest-posttest with control group semiexperimental study. The study group of the research consisted of 53 students attending the faculty of engineering. The experimental group was administered a teaching method with Lego Mindstorms Ev3 based design activities. On the other hand, in the control group C++ topics were directly taught via editor. Research data were collected via the implementing academic achievement test (Kr-20= 0.71), attitude towards learning programming scale (Cronbach’s Alpha =0.84) and computer programming self-efficacy scale (Cronbach’s Alpha= 0.966). Obtained findings were: The education using Lego Mindstorms Ev3 design activities contributed more meaningfully to the academic success of the students in terms of C++ programming language compared to the traditional method.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128702815","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":"Gene Duplication Models and Reconstruction of Gene Regulatory Network Evolution from Network Structure","authors":"Juris Viksna, David Gilbert","doi":"10.22364/BJMC.2016.4.4.18","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.18","url":null,"abstract":"The work was supported by Latvian Council of Science grant 258/2012 and Latvian State \u0000Research programme project NexIT (2014-2017).","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121319999","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-12-19DOI: 10.22364/bjmc.2016.4.4.05
E. Kinber
The paper contains author’s memories of his mentor and teacher R. M. Freivalds. I met Rūsiņš Freivalds for the first time in September of 1970, and this meeting defined my life in many different ways. At that time I was a fifth year student in the mathematics division of the University of Latvia and was looking for a topic and an advisor for my diploma thesis. My original idea was to write a thesis in the field of Lie Algebras, where I had been doing some research under the guidance of one of the faculty. However, algebraists, led by an outstanding mathematician B. I. Plotkin, were gradually forced out of the University, after one of the star students in his group, I. Rips, attempted a public self-immolation, protesting Soviet invasion to Czechoslovakia in 1968, and, thus, I had to change direction, and did not know what I would do. However, in the first days of September, I was summoned to a meeting by the Dean of the Faculty of Physics and Mathematics A. Liepa. This meeting decided my fate. Prof. Liepa told me that Jānis Bārzdiņš, his former classmate, returned from Moscow (where he was working on his doctoral dissertation under the guidance of A. N. Kolmogorov) and would be forming a new division in the University Computing Center. Prof. Liepa suggested that he could recommend me to J. Bārzdiņš to join his group. Frankly, I was scared – I knew nothing about computer science at the time, except for having taken a couple of courses in programming. But Prof. Liepa told me: “Trust me: computer science is the future, and J. Bārzdiņš is one of not so many people in this whole country (he meant the Soviet Union) who can guide you into this new exciting field”, and that was it. He arranged my meeting with J. Bārzdiņš, but there was another man present at the meeting, Rūsiņš Freivalds. J. Bārzdiņš told me that he himself was too busy at the moment to guide my diploma thesis, and suggested working with Rūsiņš, who just returned from Novosibirsk, where he was completing his Candidate of Science dissertation (Ph.D.) under the guidance of B. A. Trakhtenbrot. Then J. Bārzdiņš left, and we started our very first long conversation with Rūsiņš. In about three hours, he taught me the basics of Turing machines, computability, Church-Turing thesis, introduced me to the concept of so-called (m,n)-computation, and explained to me the results recently
这篇论文包含了作者对他的导师和老师R. M. Freivalds的回忆。1970年9月，我第一次见到Rūsiņš Freivalds，这次会面从许多不同的方面定义了我的人生。当时我是拉脱维亚大学数学系的五年级学生，正在为我的毕业论文寻找题目和指导老师。我最初的想法是写一篇关于李代数领域的论文，在一位老师的指导下，我一直在这个领域做一些研究。然而，1968年，在杰出数学家b·I·普洛特金(B. I. Plotkin)的带领下，在他的小组中的一名明星学生I·里普斯(I. Rips)试图以公开自焚的方式抗议苏联入侵捷克斯洛伐克之后，代数学者们逐渐被赶出了大学，因此，我不得不改变方向，不知道该怎么办。然而，在九月的头几天，我被物理和数学学院院长a. Liepa召集去开会。这次会面决定了我的命运。利帕教授告诉我，他以前的同学Jānis Bārzdiņš从莫斯科回来了(他在那里在a . N. Kolmogorov的指导下写博士论文)，将在大学计算中心成立一个新的部门。Liepa教授建议他可以把我推荐给J. Bārzdiņš加入他的小组。坦率地说，我很害怕——当时我对计算机科学一无所知，除了上过几门编程课程。但利帕教授告诉我:“相信我:计算机科学是未来，J. Bārzdiņš是整个国家(他指的是苏联)为数不多的能引导你进入这个令人兴奋的新领域的人之一”，就是这样。他安排了我和J. Bārzdiņš的会面，但是还有另外一个人，Rūsiņš Freivalds出席了会议。J. Bārzdiņš告诉我，他自己现在太忙了，无法指导我的毕业论文，并建议与Rūsiņš合作，他刚刚从新西伯利亚回来，在b.a. Trakhtenbrot的指导下完成了他的科学博士学位论文。然后J. Bārzdiņš离开了，我们开始了和Rūsiņš的第一次长谈。在大约三个小时的时间里，他教了我图灵机的基础知识，可计算性，丘奇-图灵论文，向我介绍了所谓的(m,n)-计算的概念，并向我解释了最近的结果
{"title":"To the Memory of R. Freivalds","authors":"E. Kinber","doi":"10.22364/bjmc.2016.4.4.05","DOIUrl":"https://doi.org/10.22364/bjmc.2016.4.4.05","url":null,"abstract":"The paper contains author’s memories of his mentor and teacher R. M. Freivalds. I met Rūsiņš Freivalds for the first time in September of 1970, and this meeting defined my life in many different ways. At that time I was a fifth year student in the mathematics division of the University of Latvia and was looking for a topic and an advisor for my diploma thesis. My original idea was to write a thesis in the field of Lie Algebras, where I had been doing some research under the guidance of one of the faculty. However, algebraists, led by an outstanding mathematician B. I. Plotkin, were gradually forced out of the University, after one of the star students in his group, I. Rips, attempted a public self-immolation, protesting Soviet invasion to Czechoslovakia in 1968, and, thus, I had to change direction, and did not know what I would do. However, in the first days of September, I was summoned to a meeting by the Dean of the Faculty of Physics and Mathematics A. Liepa. This meeting decided my fate. Prof. Liepa told me that Jānis Bārzdiņš, his former classmate, returned from Moscow (where he was working on his doctoral dissertation under the guidance of A. N. Kolmogorov) and would be forming a new division in the University Computing Center. Prof. Liepa suggested that he could recommend me to J. Bārzdiņš to join his group. Frankly, I was scared – I knew nothing about computer science at the time, except for having taken a couple of courses in programming. But Prof. Liepa told me: “Trust me: computer science is the future, and J. Bārzdiņš is one of not so many people in this whole country (he meant the Soviet Union) who can guide you into this new exciting field”, and that was it. He arranged my meeting with J. Bārzdiņš, but there was another man present at the meeting, Rūsiņš Freivalds. J. Bārzdiņš told me that he himself was too busy at the moment to guide my diploma thesis, and suggested working with Rūsiņš, who just returned from Novosibirsk, where he was completing his Candidate of Science dissertation (Ph.D.) under the guidance of B. A. Trakhtenbrot. Then J. Bārzdiņš left, and we started our very first long conversation with Rūsiņš. In about three hours, he taught me the basics of Turing machines, computability, Church-Turing thesis, introduced me to the concept of so-called (m,n)-computation, and explained to me the results recently","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121656345","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-12-19DOI: 10.22364/BJMC.2016.4.4.07
Juris Borzovs
The author claims to be the second graduate student of Rūsiņš Mārtiņš Freivalds. He shares some memories of that time and presents some results in reducibility theory that were not published in peer-reviewed journals before.
作者自称是Rūsiņš Mārtiņš Freivalds的第二名研究生。他分享了当时的一些记忆，并提出了一些以前没有发表在同行评议期刊上的还原性理论的结果。
{"title":"His Second Student","authors":"Juris Borzovs","doi":"10.22364/BJMC.2016.4.4.07","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.07","url":null,"abstract":"The author claims to be the second graduate student of Rūsiņš Mārtiņš Freivalds. He shares some memories of that time and presents some results in reducibility theory that were not published in peer-reviewed journals before.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133121016","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-12-19DOI: 10.22364/bjmc.2016.4.4.06
Daina Taimina
{"title":"Almost 40 Years Knowing Prof. Rūsiņš Freivalds","authors":"Daina Taimina","doi":"10.22364/bjmc.2016.4.4.06","DOIUrl":"https://doi.org/10.22364/bjmc.2016.4.4.06","url":null,"abstract":"","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130734733","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-12-19DOI: 10.22364/BJMC.2016.4.4.11
Charles Jordan, T. Zeugmann
. Property testing is a kind of randomized approximation in which one takes a small, random sample of a structure and wishes to determine whether the structure satisfies some property or is far from satisfying the property. We focus on the testability of classes of first-order expressible properties, and in particular, on the clas-sification of prefix-vocabulary classes for testability. The main result is the untestability of [ ∀∃∀ , (0 , 1)] = . We also show that this class remains untestable without equality in at least one model of testing. These classes are well-known and (at least one is) minimal for untestability. We discuss what is currently known about the classification for testability and briefly compare it to other classifications.
{"title":"The Kahr-Moore-Wang Class Contains Untestable Properties","authors":"Charles Jordan, T. Zeugmann","doi":"10.22364/BJMC.2016.4.4.11","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.11","url":null,"abstract":". Property testing is a kind of randomized approximation in which one takes a small, random sample of a structure and wishes to determine whether the structure satisfies some property or is far from satisfying the property. We focus on the testability of classes of first-order expressible properties, and in particular, on the clas-sification of prefix-vocabulary classes for testability. The main result is the untestability of [ ∀∃∀ , (0 , 1)] = . We also show that this class remains untestable without equality in at least one model of testing. These classes are well-known and (at least one is) minimal for untestability. We discuss what is currently known about the classification for testability and briefly compare it to other classifications.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122456422","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-12-19DOI: 10.22364/BJMC.2016.4.4.13
J. Cı̄rulis
Motivated by applications to relational databases, N. Alechina proposed in 2000 a many-sorted first-order logic with specialized models (called fd-models), where an ordinary firstorder structure was equipped with a system of functions realizing functional dependences between variables (interpreted as attributes). Due to these constraints, only a restricted set of assignments is available in such a model. This factor may rouse some undesirable effects when formulas of the language are evaluated. We develop for the relevant first-order languages another, assignment-free algebraic semantics based on improved fd-models.
{"title":"An Algebraic Approach to Functional-Dependency Semantics for First-Order Languages","authors":"J. Cı̄rulis","doi":"10.22364/BJMC.2016.4.4.13","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.13","url":null,"abstract":"Motivated by applications to relational databases, N. Alechina proposed in 2000 a many-sorted first-order logic with specialized models (called fd-models), where an ordinary firstorder structure was equipped with a system of functions realizing functional dependences between variables (interpreted as attributes). Due to these constraints, only a restricted set of assignments is available in such a model. This factor may rouse some undesirable effects when formulas of the language are evaluated. We develop for the relevant first-order languages another, assignment-free algebraic semantics based on improved fd-models.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117242852","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-12-19DOI: 10.22364/BJMC.2016.4.4.25
D. Gudoniene, Reda Bartkute, D. Rutkauskiene, T. Blažauskas
Gamification has been a popular object of researches in various fields. Many researches were made on various aspects of gamification and just very few were oriented to the influence of technological aspects for e-learning participant’s engagement. The challenge for our designed model was to find out the new effective ways for the engagement of the students. This paper analysis the prevailing technological aspects and technologies used in e-learning process as well as implementation of various technological solutions in learning platforms. Also, this paper presents a new model of technological aspects of gamification, which was implemented at the Faculty of Informatics to engage students to get better results in learning programming.
{"title":"Technological Aspects of the Gamification Model for e-Learning Participant's Engagement","authors":"D. Gudoniene, Reda Bartkute, D. Rutkauskiene, T. Blažauskas","doi":"10.22364/BJMC.2016.4.4.25","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.25","url":null,"abstract":"Gamification has been a popular object of researches in various fields. Many researches were made on various aspects of gamification and just very few were oriented to the influence of technological aspects for e-learning participant’s engagement. The challenge for our designed model was to find out the new effective ways for the engagement of the students. This paper analysis the prevailing technological aspects and technologies used in e-learning process as well as implementation of various technological solutions in learning platforms. Also, this paper presents a new model of technological aspects of gamification, which was implemented at the Faculty of Informatics to engage students to get better results in learning programming.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"PAMI-7 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114129913","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
扫码关注我们
求助内容：
应助结果提醒方式：