Pub Date : 2016-12-19DOI: 10.22364/BJMC.2016.4.4.15
Raivis Bēts, A. Sostak
By modifying the well-known concept of a fuzzy metric introduced in 1994 by A. George and P. Veeramani, we define the notion of a fragmentary fuzzy pseudometric. In this paper, we study basic properties of fragmentary fuzzy pseudometrics, describe the induced fuzzy supratopologies and fuzzy topologies, as well apply fragmentary fuzzy pseudometrics for the description of the analytic structure of the sets of right-infinite words.
{"title":"Fragmentary Fuzzy Pseudometrics: Basics of the Theory and Applications in Combinatorics on Words","authors":"Raivis Bēts, A. Sostak","doi":"10.22364/BJMC.2016.4.4.15","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.15","url":null,"abstract":"By modifying the well-known concept of a fuzzy metric introduced in 1994 by A. George and P. Veeramani, we define the notion of a fragmentary fuzzy pseudometric. In this paper, we study basic properties of fragmentary fuzzy pseudometrics, describe the induced fuzzy supratopologies and fuzzy topologies, as well apply fragmentary fuzzy pseudometrics for the description of the analytic structure of the sets of right-infinite words.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"350 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":"131190217","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.16
L. Mančinska, David E. Roberson
We study quantum analogs of graph colorings and chromatic number. Initially defined via an interactive protocol, quantum colorings can also be viewed as a natural operator relaxation of graph coloring. Since there is no known algorithm for producing nontrivial quantum colorings, the existing examples rely on ad hoc constructions. Almost all of the known constructions of quantum $d$-colorings start from $d$-dimensional orthogonal representations. We show the limitations of this method by exhibiting, for the first time, a graph with a 3-dimensional orthogonal representation which cannot be quantum 3-colored, and a graph that can be quantum 3-colored but has no 3-dimensional orthogonal representation. Together these examples show that the quantum chromatic number and orthogonal rank are not directly comparable as graph parameters. The former graph also provides an example of several interesting, and previously unknown, properties of quantum colorings. The most striking of these is that adding a new vertex adjacent to all other vertices does not necessarily increase the quantum chromatic number of a graph. This is in stark contrast to the chromatic number and many of its variants. This graph also provides the smallest known example (14 vertices) exhibiting a separation between chromatic number and its quantum analog.
{"title":"Oddities of Quantum Colorings","authors":"L. Mančinska, David E. Roberson","doi":"10.22364/BJMC.2016.4.4.16","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.16","url":null,"abstract":"We study quantum analogs of graph colorings and chromatic number. Initially defined via an interactive protocol, quantum colorings can also be viewed as a natural operator relaxation of graph coloring. Since there is no known algorithm for producing nontrivial quantum colorings, the existing examples rely on ad hoc constructions. Almost all of the known constructions of quantum $d$-colorings start from $d$-dimensional orthogonal representations. We show the limitations of this method by exhibiting, for the first time, a graph with a 3-dimensional orthogonal representation which cannot be quantum 3-colored, and a graph that can be quantum 3-colored but has no 3-dimensional orthogonal representation. Together these examples show that the quantum chromatic number and orthogonal rank are not directly comparable as graph parameters. The former graph also provides an example of several interesting, and previously unknown, properties of quantum colorings. The most striking of these is that adding a new vertex adjacent to all other vertices does not necessarily increase the quantum chromatic number of a graph. This is in stark contrast to the chromatic number and many of its variants. This graph also provides the smallest known example (14 vertices) exhibiting a separation between chromatic number and its quantum analog.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"14 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":"115023722","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.09
A. Ambainis, Janis Iraids
We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:{0,1}to{0,1}$ on an input $xin{0,1}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$.
{"title":"Optimal one-shot quantum algorithm for EQUALITY and AND","authors":"A. Ambainis, Janis Iraids","doi":"10.22364/bjmc.2016.4.4.09","DOIUrl":"https://doi.org/10.22364/bjmc.2016.4.4.09","url":null,"abstract":"We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:{0,1}to{0,1}$ on an input $xin{0,1}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"62 4 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":"128698494","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.26
M. K. Bhuyan, D. Mohapatra, Srinivas Sethi
The computational intelligence approach using Neural Network (NN) has been known to be very useful in predicting software reliability. Software reliability plays a key role in software quality. In order to improve accuracy and consistency of software reliability prediction, we propose the applicability of Feed Forward Back-Propagation Network (FFBPN) as a model to predict software reliability. The model has been applied on data sets collected across several standard software projects during system testing phase with fault removal. Unlike most connectionist models, our model attempt to compute average error (AE), the root mean square error (RMSE), normalized root mean square error (NRMSE), mean absolute error (MAE) simultaneously. A comparative study among the proposed feed-forward neural network with some traditional parametric software reliability growth model’s performance is carried out. The results indicated in this work suggest that FFBPN model exhibit an accurate and consistent behavior in reliability prediction.
{"title":"Software Reliability Assesment using Neural Networks of Computational Intelligence Based on Software Failure Data","authors":"M. K. Bhuyan, D. Mohapatra, Srinivas Sethi","doi":"10.22364/BJMC.2016.4.4.26","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.26","url":null,"abstract":"The computational intelligence approach using Neural Network (NN) has been known to be very useful in predicting software reliability. Software reliability plays a key role in software quality. In order to improve accuracy and consistency of software reliability prediction, we propose the applicability of Feed Forward Back-Propagation Network (FFBPN) as a model to predict software reliability. The model has been applied on data sets collected across several standard software projects during system testing phase with fault removal. Unlike most connectionist models, our model attempt to compute average error (AE), the root mean square error (RMSE), normalized root mean square error (NRMSE), mean absolute error (MAE) simultaneously. A comparative study among the proposed feed-forward neural network with some traditional parametric software reliability growth model’s performance is carried out. The results indicated in this work suggest that FFBPN model exhibit an accurate and consistent behavior in reliability prediction.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"94 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":"122774961","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.21
A. Kalnins, E. Kalniņa, A. Sostaks, E. Celms, Ivans Tabernakulovs
{"title":"LINQ as Model Tansformation Language for MDD","authors":"A. Kalnins, E. Kalniņa, A. Sostaks, E. Celms, Ivans Tabernakulovs","doi":"10.22364/BJMC.2016.4.4.21","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.21","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":"114780252","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.23
Girts Strazdins
{"title":"Data Quality Control for Relational Databases: Small and Start-up Business Perspective","authors":"Girts Strazdins","doi":"10.22364/bjmc.2016.4.4.23","DOIUrl":"https://doi.org/10.22364/bjmc.2016.4.4.23","url":null,"abstract":"","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"4 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":"130413894","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.28
A. Gurtov, Madhusanka Liyanage, D. Korzun
The next industrial revolution is foreseen to happen with upcoming Industrial Internet that combines massive data collected by industrial sensors with data analysis for improving the efficiency of operations. Collecting, pre-processing, storing and analyzing such real-time data is a complex task with stringent demands on communication intelligence, QoS and security. In this paper we outline some challenges facing the Industrial Internet, namely integration with 5G wireless networks, Software Defined Machines, ownership and smart processing of digital sensor data. We propose a secure communication architecture for the Industrial Internet based on Smart Spaces and Virtual Private LAN Services. It is a position paper, describing state-of-the-art and a roadmap for future research on the Industrial Internet.
{"title":"Secure Communication and Data Processing Challenges in the Industrial Internet","authors":"A. Gurtov, Madhusanka Liyanage, D. Korzun","doi":"10.22364/BJMC.2016.4.4.28","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.28","url":null,"abstract":"The next industrial revolution is foreseen to happen with upcoming Industrial Internet that combines massive data collected by industrial sensors with data analysis for improving the efficiency of operations. Collecting, pre-processing, storing and analyzing such real-time data is a complex task with stringent demands on communication intelligence, QoS and security. In this paper we outline some challenges facing the Industrial Internet, namely integration with 5G wireless networks, Software Defined Machines, ownership and smart processing of digital sensor data. We propose a secure communication architecture for the Industrial Internet based on Smart Spaces and Virtual Private LAN Services. It is a position paper, describing state-of-the-art and a roadmap for future research on the Industrial Internet.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"6 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":"122312449","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.17
F. Ablayev, M. Ablayev, A. Vasiliev, M. Ziatdinov
Rusins Freivalds was one of the first researchers who introduced methods (later called fingerprinting) for constructing efficient classical randomized and quantum algorithms. Fingerprinting and cryptographic hashing have quite different usages in computer science, but have similar properties. Interpretation of their properties is determined by the area of their usage: fingerprinting methods are methods for constructing efficient randomized and quantum algorithms for computational problems, while hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, while quantum fingerprinting and quantum hashing have a short history. In the paper we present computational aspects of quantum fingerprinting, discuss cryptographical properties of quantum hashing, and present the possible use of quantum hashing for quantum hash-based message authentication codes.
{"title":"Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects","authors":"F. Ablayev, M. Ablayev, A. Vasiliev, M. Ziatdinov","doi":"10.22364/BJMC.2016.4.4.17","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.17","url":null,"abstract":"Rusins Freivalds was one of the first researchers who introduced methods (later called fingerprinting) for constructing efficient classical randomized and quantum algorithms. Fingerprinting and cryptographic hashing have quite different usages in computer science, but have similar properties. Interpretation of their properties is determined by the area of their usage: fingerprinting methods are methods for constructing efficient randomized and quantum algorithms for computational problems, while hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, while quantum fingerprinting and quantum hashing have a short history. In the paper we present computational aspects of quantum fingerprinting, discuss cryptographical properties of quantum hashing, and present the possible use of quantum hashing for quantum hash-based message authentication codes.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"424 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":"130726986","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.19
M. Dimitrijevs, Kristine Cipola
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can recognize complex languages and can have small number of states when classical automata require much more states. In this paper, we present a survey on ultrametric automata and their language recognition capabilities.
{"title":"Ultrametric Finite Automata and Their Capabilities","authors":"M. Dimitrijevs, Kristine Cipola","doi":"10.22364/BJMC.2016.4.4.19","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.19","url":null,"abstract":"Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can recognize complex languages and can have small number of states when classical automata require much more states. In this paper, we present a survey on ultrametric automata and their language recognition capabilities.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"14 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":"124112949","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.08
K. Podnieks
In 2014, Barzdins, Rencis and Sostaks introduced granular ontologies as a specific organization of databases allowing for extremely fast processing of ad hoc queries, and proved the following Granularity Theorem: Consider an ontology represented by graphical means of a UML class diagram. Then, under certain restrictions on association multiplicity constraints, this ontology is granular, if and only if it is a tree ontology. (In a tree ontology, associations and classes form a tree, and have the multiplicity 1..1 in the direction to root class.) The possibility of removing the restrictions was formulated as as open problem. The present paper solves this problem. It appears that the principal cause of the “tree phenomenon” is the local character of ontology constraints expressed by graphical means of UML class diagrams (roughly, each of such constraints involves at most one association). In the paper, properties of locally constrained ontologies (“locality phenomena”) are explored, and Generalized Granularity Theorem is proved, showing that in the Granularity Theorem, all restrictions to multiplicity constraints can be removed.
{"title":"Locally Constrained Ontologies","authors":"K. Podnieks","doi":"10.22364/BJMC.2016.4.4.08","DOIUrl":"https://doi.org/10.22364/BJMC.2016.4.4.08","url":null,"abstract":"In 2014, Barzdins, Rencis and Sostaks introduced granular ontologies as a specific organization of databases allowing for extremely fast processing of ad hoc queries, and proved the following Granularity Theorem: Consider an ontology represented by graphical means of a UML class diagram. Then, under certain restrictions on association multiplicity constraints, this ontology is granular, if and only if it is a tree ontology. (In a tree ontology, associations and classes form a tree, and have the multiplicity 1..1 in the direction to root class.) The possibility of removing the restrictions was formulated as as open problem. The present paper solves this problem. It appears that the principal cause of the “tree phenomenon” is the local character of ontology constraints expressed by graphical means of UML class diagrams (roughly, each of such constraints involves at most one association). In the paper, properties of locally constrained ontologies (“locality phenomena”) are explored, and Generalized Granularity Theorem is proved, showing that in the Granularity Theorem, all restrictions to multiplicity constraints can be removed.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"34 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":"121912756","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
扫码关注我们
求助内容：
应助结果提醒方式：