Pub Date : 2016-12-19DOI: 10.22364/BJMC.2016.4.4.03
J. Gruska
{"title":"Rūsiņš Mārtiņš Freivalds. Remarkable Scholar, Unique Teacher and Great Man","authors":"J. Gruska","doi":"10.22364/BJMC.2016.4.4.03","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.03","url":null,"abstract":"","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":"124765060","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.14
I. Skadina
The paper presents series of experiments that aim to find best method how to treat multi-word expressions (MWE) in machine translation task. Methods have been investigated in a framework of statistical machine translation (SMT) for translation form English into Latvian. MWE candidates have been extracted using pattern-based and statistical approaches. Different techniques for MWE integration into SMT system are analysed. The best result +0.59 BLEU points – has been achieved by combining two phrase tables bilingual MWE dictionary and phrase table created from the parallel corpus in which statistically extracted MWE candidates are treated as single tokens. Using only bilingual dictionary as additional source of information the best result (+0.36 BLEU points) is obtained by combining two phrase tables. In case of statistically obtained MWE lists, the best result (+0.51 BLEU points) is achieved with the largest list of MWE candidates.
{"title":"Multi-word Expressions in English-Latvian Machine Translation","authors":"I. Skadina","doi":"10.22364/BJMC.2016.4.4.14","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.14","url":null,"abstract":"The paper presents series of experiments that aim to find best method how to treat multi-word expressions (MWE) in machine translation task. Methods have been investigated in a framework of statistical machine translation (SMT) for translation form English into Latvian. MWE candidates have been extracted using pattern-based and statistical approaches. Different techniques for MWE integration into SMT system are analysed. The best result +0.59 BLEU points – has been achieved by combining two phrase tables bilingual MWE dictionary and phrase table created from the parallel corpus in which statistically extracted MWE candidates are treated as single tokens. Using only bilingual dictionary as additional source of information the best result (+0.36 BLEU points) is obtained by combining two phrase tables. In case of statistically obtained MWE lists, the best result (+0.51 BLEU points) is achieved with the largest list of MWE candidates.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"66 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":"134017979","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-10-05DOI: 10.22364/BJMC.2016.4.4.22
M. Hirvensalo, A. Yakaryılmaz
It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections with Skolem's and positivity problems. We also introduce the concept of linear recurrence automata in order to show the connection naturally. Then, we also give possible generalizations of linear recurrence relations and automata on vectors.
{"title":"Decision problems on unary probabilistic and quantum automata","authors":"M. Hirvensalo, A. Yakaryılmaz","doi":"10.22364/BJMC.2016.4.4.22","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.22","url":null,"abstract":"It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections with Skolem's and positivity problems. We also introduce the concept of linear recurrence automata in order to show the connection naturally. Then, we also give possible generalizations of linear recurrence relations and automata on vectors.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124913736","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}
Given a classical error-correcting block code, the task of quantum list decoding is to produce from any quantumly corrupted codeword a short list containing all messages whose codewords exhibit high "presence" in the quantumly corrupted codeword. Efficient quantum list decoders have been used to prove a quantum hardcore property of classical codes. However, the code rates of all known families of efficiently quantum list-decodable codes are, unfortunately, too small for other practical applications. To improve those known code rates, we prove that a specific code family of polynomially small code rate over a fixed code alphabet, obtained by concatenating generalized Reed-Solomon codes as outer codes with Hadamard codes as inner codes, has an efficient quantum list-decoding algorithm if its codewords have relatively high codeword presence in a given quantumly corrupted codeword. As an immediate application, we use the quantum list decodability of this code family to solve a certain form of quantum search problems in polynomial time. When the codeword presence becomes smaller, in contrast, we show that the quantum list decodability of generalized Reed-Solomon codes with high confidence is closely related to the efficient solvability of the following two problems: the noisy polynomial interpolation problem and the bounded distance vector problem. Moreover, assuming that NP is not included in BQP, we also prove that no efficient quantum list decoder exists for the generalized Reed-Solomon codes.
{"title":"Quantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords","authors":"T. Yamakami","doi":"10.22364/bjmc.2016.4.4","DOIUrl":"https://doi.org/10.22364/bjmc.2016.4.4","url":null,"abstract":"Given a classical error-correcting block code, the task of quantum list decoding is to produce from any quantumly corrupted codeword a short list containing all messages whose codewords exhibit high \"presence\" in the quantumly corrupted codeword. Efficient quantum list decoders have been used to prove a quantum hardcore property of classical codes. However, the code rates of all known families of efficiently quantum list-decodable codes are, unfortunately, too small for other practical applications. To improve those known code rates, we prove that a specific code family of polynomially small code rate over a fixed code alphabet, obtained by concatenating generalized Reed-Solomon codes as outer codes with Hadamard codes as inner codes, has an efficient quantum list-decoding algorithm if its codewords have relatively high codeword presence in a given quantumly corrupted codeword. As an immediate application, we use the quantum list decodability of this code family to solve a certain form of quantum search problems in polynomial time. When the codeword presence becomes smaller, in contrast, we show that the quantum list decodability of generalized Reed-Solomon codes with high confidence is closely related to the efficient solvability of the following two problems: the noisy polynomial interpolation problem and the bounded distance vector problem. Moreover, assuming that NP is not included in BQP, we also prove that no efficient quantum list decoder exists for the generalized Reed-Solomon codes.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122163787","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.22364/bjmc.2022.10.1.01
P. Daugulis, Vija Vagale, E. Mancini, F. Castiglione
{"title":"A PCA-based Data Prediction Method","authors":"P. Daugulis, Vija Vagale, E. Mancini, F. Castiglione","doi":"10.22364/bjmc.2022.10.1.01","DOIUrl":"https://doi.org/10.22364/bjmc.2022.10.1.01","url":null,"abstract":"","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","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":"115298706","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.22364/bjmc.2022.10.1.05
R. Nacheva, A. Jansone
{"title":"Current Perspectives in Social Media Supported E-Learning","authors":"R. Nacheva, A. Jansone","doi":"10.22364/bjmc.2022.10.1.05","DOIUrl":"https://doi.org/10.22364/bjmc.2022.10.1.05","url":null,"abstract":"","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"4 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":"117153243","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.22364/bjmc.2022.10.2.03
M. Petrov
{"title":"Noise Reduction in CT Images in the Domain of the Hyperbolic Wavelet Transform","authors":"M. Petrov","doi":"10.22364/bjmc.2022.10.2.03","DOIUrl":"https://doi.org/10.22364/bjmc.2022.10.2.03","url":null,"abstract":"","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"48 14 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":"125509058","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.22364/bjmc.2021.9.3.06
Aisha Futura Tüchler
Dealing with digital learning tools has become our new daily routine, as the COVID-19 pandemic restricts our mobility and limits our social contacts. Despite the omnipresence of the topic, little is known about how students experience distance learning with digital learning tools, how they evaluate the tools' features, as well as their advantages and disadvantages. An online survey was distributed in a Latvian higher education institution in late autumn 2020, and data of 104 students, both from Bachelor as well as from Master studies of the University of Latvia, were collected. The results of the present study highlight that motivation and engagement, as well as communication and interaction are important factors with regards to students' perceptions of and attitudes towards the distance learning mode. This exploratory research provides first evidence of perceptions and attitudes of Latvian university students concerning distance learning during the COVID-19 pandemic.
{"title":"Learning during the COVID-19 Pandemic. The Use, Features and Acceptance of Digital Learning Tools","authors":"Aisha Futura Tüchler","doi":"10.22364/bjmc.2021.9.3.06","DOIUrl":"https://doi.org/10.22364/bjmc.2021.9.3.06","url":null,"abstract":"Dealing with digital learning tools has become our new daily routine, as the COVID-19 pandemic restricts our mobility and limits our social contacts. Despite the omnipresence of the topic, little is known about how students experience distance learning with digital learning tools, how they evaluate the tools' features, as well as their advantages and disadvantages. An online survey was distributed in a Latvian higher education institution in late autumn 2020, and data of 104 students, both from Bachelor as well as from Master studies of the University of Latvia, were collected. The results of the present study highlight that motivation and engagement, as well as communication and interaction are important factors with regards to students' perceptions of and attitudes towards the distance learning mode. This exploratory research provides first evidence of perceptions and attitudes of Latvian university students concerning distance learning during the COVID-19 pandemic.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"12 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":"126642700","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.22364/bjmc.2023.11.1.05
Dace Šostaka, Juris Borzovs, Eduards Cauna, Iveta Keisa, Marcis Pinnis, A. Vasiljevs
. Information and Communication Technology terms are mainly formed in English and then secondary–formed in other languages. Because of the differences in the morphological and term–formation traditions in various languages, the results of secondary term formation tend to be somewhat chaotic. Latvia’s Information and Communication Technology terminologists and linguists have developed a rather rigorous, semi–algorithmic approach to term formation that has been approbated for over thirty years. This paper aims to describe this approach and show its viability on an example of the most commonly used terms. We also analyse the usage of the officially approved terms in texts and the possible reasons why they sometimes encounter resistance from everyday users. In conclusion, we summarise the research regarding the current situation in the secondary ICT terminology in Latvian and provide insight into possibilities for further development.
{"title":"The Semi-Algorithmic Approach to Formation of Latvian Information and Communication Technology Terms","authors":"Dace Šostaka, Juris Borzovs, Eduards Cauna, Iveta Keisa, Marcis Pinnis, A. Vasiljevs","doi":"10.22364/bjmc.2023.11.1.05","DOIUrl":"https://doi.org/10.22364/bjmc.2023.11.1.05","url":null,"abstract":". Information and Communication Technology terms are mainly formed in English and then secondary–formed in other languages. Because of the differences in the morphological and term–formation traditions in various languages, the results of secondary term formation tend to be somewhat chaotic. Latvia’s Information and Communication Technology terminologists and linguists have developed a rather rigorous, semi–algorithmic approach to term formation that has been approbated for over thirty years. This paper aims to describe this approach and show its viability on an example of the most commonly used terms. We also analyse the usage of the officially approved terms in texts and the possible reasons why they sometimes encounter resistance from everyday users. In conclusion, we summarise the research regarding the current situation in the secondary ICT terminology in Latvian and provide insight into possibilities for further development.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"7 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":"121880242","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
扫码关注我们
求助内容：
应助结果提醒方式：