{"title":"TRANSITION SYSTEM SEMANTICS FOR FLOW EVENT STRUCTURES","authors":"N. Gribovskaya, I. Virbitskaite","doi":"10.31144/bncc.cs.2542-1972.2019.n43.p21-38","DOIUrl":"https://doi.org/10.31144/bncc.cs.2542-1972.2019.n43.p21-38","url":null,"abstract":"In this paper, we deal with event-oriented models of concurrent processes which are generalizations of the well-studied model of prime event structures. In particular, we translate flow event structures into structures for resolvable conflict (the most expressive event-oriented model) and back, define two structurally different methods of generating transition systems from the models under consideration, and demonstrate that, despite their differences, the methods lead to isomorphic results in interleaving and step semantics.","PeriodicalId":233402,"journal":{"name":"Bulletin of the Novosibirsk Computing Center.Series:Computer Science","volume":"167 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":"114427550","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":"CROSS-LINGUAL ENTITY RESOLUTION AND ITS APPLICATIONS","authors":"Z. Apanovich","doi":"10.31144/bncc.cs.2542-1972.2019.n43.p1-14","DOIUrl":"https://doi.org/10.31144/bncc.cs.2542-1972.2019.n43.p1-14","url":null,"abstract":"Nowadays, entity resolution is being intensively investigated in the context of the integration of heterogeneous data sets. Collecting data from heterogeneous data sets and integrating them in a query able environment increases completeness and correctness as well as ensures a more effective analysis. Of special interest is the problem of crosslingual entity resolution for multilingual data integration since local language data sources are often more complete and accurate than global data sources.","PeriodicalId":233402,"journal":{"name":"Bulletin of the Novosibirsk Computing Center.Series:Computer Science","volume":"276 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":"115838366","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}
F. Brauße, Konstantin Korovin, M. Korovina, N. Müller
{"title":"NOTES ON IMPLEMENTING THE KSMT-SOLVER","authors":"F. Brauße, Konstantin Korovin, M. Korovina, N. Müller","doi":"10.31144/bncc.cs.2542-1972.2019.n43.p15-19","DOIUrl":"https://doi.org/10.31144/bncc.cs.2542-1972.2019.n43.p15-19","url":null,"abstract":"In this paper we report on new black-box and white-box approaches implemented in ksmt solver for checking satis ability of non-linear constraints over the reals. These approaches are applicable to a large number of constraints involving computable non-linear functions, piecewise polynomial splines, transcendental functions and beyond. A prototypical implementation has been evaluated on several non-linear SMT-LIB examples and the results have been compared with state-ofthe-art SMT solvers.","PeriodicalId":233402,"journal":{"name":"Bulletin of the Novosibirsk Computing Center.Series:Computer Science","volume":"69 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":"125447306","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":"ANALYSIS OF RC4 ENCRYPTION ALGORITHM","authors":"Elyorion Kurbonov","doi":"10.31144/bncc.cs.2542-1972.2019.n43.p53-60","DOIUrl":"https://doi.org/10.31144/bncc.cs.2542-1972.2019.n43.p53-60","url":null,"abstract":"The most important and cryptographically significant goal of a stream cipher is to produce a pseudorandom sequence of bits or words using a fixed length secret key, often paired with a fixed length public initialization vector. Over the last three decades of research and development in stream ciphers, a number of designs have been proposed and analyzed by the cryptology community. We briefly discuss a few major stream ciphers, relevant in terms of practical application and cutting-edge design.","PeriodicalId":233402,"journal":{"name":"Bulletin of the Novosibirsk Computing Center.Series:Computer Science","volume":"34 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":"130177301","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}