Pub Date : 2018-03-31DOI: 10.12921/CMST.2018.0000003
Abkowicz Mariola, Tomasz Hoffmann, M. Kozák
Gathering metadata regarding historical resources, such as manuscripts and old prints, requires determining their structure. Archiving data in the form of Ms Word files containing descriptions of these objects seems to be a simple and effective solution. However, problems arise when we want to unify recurring information, analyze and publish metadata and accompanied scans to a wide range of researchers and the community. In that case, the TEI P5 format (http://www.tei-c.org/) can help us. We present the process of creating a digital archive of Karaim literature called eJazyszłar. We describe source data of this archive and justify the proposed solutions, especially TEI P5.
{"title":"Manuscripts and old prints of the Karaim Digital Archive – from Ms Word files to TEI P5","authors":"Abkowicz Mariola, Tomasz Hoffmann, M. Kozák","doi":"10.12921/CMST.2018.0000003","DOIUrl":"https://doi.org/10.12921/CMST.2018.0000003","url":null,"abstract":"Gathering metadata regarding historical resources, such as manuscripts and old prints, requires determining their structure. Archiving data in the form of Ms Word files containing descriptions of these objects seems to be a simple and effective solution. However, problems arise when we want to unify recurring information, analyze and publish metadata and accompanied scans to a wide range of researchers and the community. In that case, the TEI P5 format (http://www.tei-c.org/) can help us. We present the process of creating a digital archive of Karaim literature called eJazyszłar. We describe source data of this archive and justify the proposed solutions, especially TEI P5.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"73 1","pages":"59-69"},"PeriodicalIF":0.0,"publicationDate":"2018-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75294215","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-03-31DOI: 10.12921/CMST.2018.0000006
Maciej Karpinski, K. Klessa
The holistic approach to interpersonal communication in dialogue, involving the analysis of multiple sensory modalities and channels, poses a serious challenge not only in terms of research techniques and methods but also from the viewpoint of data infrastructure. In the Borderland project, the process of communicative accommodation is studied in young people in the intercultural context of the Polish-German boundary region. In order to collect, annotate, and analyse research material, a new technical and analytic infrastructure has been developed. Centred around a data management system, it incorporates well-known annotation and transcription tools along with custom-designed transcription and annotation tagsets and procedures. Data and metadata formats are designed to enable further corpus-based analyses of accommodation-related processes, mostly in the paralinguistic domain of prosody and gestures. Data formats used in the project ensure wide interchangeability and usage of almost any analytic software. Previously tested methods of quantitative accommodation analysis are adjusted, supplemented with new custom procedures, and applied to each channel under study as well as to the cross-modal (e.g., prosody gesture) accommodation processes.
{"title":"Methods, Tools and Techniques for Multimodal Analysis of Accommodation in Intercultural Communication","authors":"Maciej Karpinski, K. Klessa","doi":"10.12921/CMST.2018.0000006","DOIUrl":"https://doi.org/10.12921/CMST.2018.0000006","url":null,"abstract":"The holistic approach to interpersonal communication in dialogue, involving the analysis of multiple sensory modalities and channels, poses a serious challenge not only in terms of research techniques and methods but also from the viewpoint of data infrastructure. In the Borderland project, the process of communicative accommodation is studied in young people in the intercultural context of the Polish-German boundary region. In order to collect, annotate, and analyse research material, a new technical and analytic infrastructure has been developed. Centred around a data management system, it incorporates well-known annotation and transcription tools along with custom-designed transcription and annotation tagsets and procedures. Data and metadata formats are designed to enable further corpus-based analyses of accommodation-related processes, mostly in the paralinguistic domain of prosody and gestures. Data formats used in the project ensure wide interchangeability and usage of almost any analytic software. Previously tested methods of quantitative accommodation analysis are adjusted, supplemented with new custom procedures, and applied to each channel under study as well as to the cross-modal (e.g., prosody gesture) accommodation processes.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"1 1","pages":"29-41"},"PeriodicalIF":0.0,"publicationDate":"2018-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90151856","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-03-31DOI: 10.12921/CMST.2018.0000023
C. Mazurek
{"title":"Digital Humanities – Challenges for Humanities in the Digital Society Era : foreword","authors":"C. Mazurek","doi":"10.12921/CMST.2018.0000023","DOIUrl":"https://doi.org/10.12921/CMST.2018.0000023","url":null,"abstract":"","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"130 1","pages":"5-6"},"PeriodicalIF":0.0,"publicationDate":"2018-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79592651","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-01-09DOI: 10.12921/cmst.2017.0000055
K. Aoki
The symmetries of the minimal $phi^4$ theory on the lattice, and trajectories which are chaotic, yet restricted to motions within subspaces due to symmetry reasons, are systematically analyzed. The chaotic dynamics of autonomous Hamiltonian systems are discussed, in relation to the thermodynamic laws. Possibilities of configurations with non-equal ideal gas temperatures in the steady state are investigated. The pairing of local (finite-time) Lyapunov exponents are analyzed, and their dependence on various factors, such as energy of the system, characteristics of the initial conditions are studied.
{"title":"Symmetry, Chaos and Temperature in the One-dimensional Lattice φ4 Theory","authors":"K. Aoki","doi":"10.12921/cmst.2017.0000055","DOIUrl":"https://doi.org/10.12921/cmst.2017.0000055","url":null,"abstract":"The symmetries of the minimal $phi^4$ theory on the lattice, and trajectories which are chaotic, yet restricted to motions within subspaces due to symmetry reasons, are systematically analyzed. The chaotic dynamics of autonomous Hamiltonian systems are discussed, in relation to the thermodynamic laws. Possibilities of configurations with non-equal ideal gas temperatures in the steady state are investigated. The pairing of local (finite-time) Lyapunov exponents are analyzed, and their dependence on various factors, such as energy of the system, characteristics of the initial conditions are studied.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89282947","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-01-01DOI: 10.12921/CMST.2018.0000057
P. Rozmej, A. Karczewska
The consistent derivation of the extended KdV equation for an uneven bottom for the case of α = O(β) and δ = O(β) is presented. This is the only one case when second order KdV type nonlinear wave equation can be derived for arbitrary bounded bottom function.
{"title":"The New Extended KdV Equation for the Case of an Uneven Bottom","authors":"P. Rozmej, A. Karczewska","doi":"10.12921/CMST.2018.0000057","DOIUrl":"https://doi.org/10.12921/CMST.2018.0000057","url":null,"abstract":"The consistent derivation of the extended KdV equation for an uneven bottom for the case of α = O(β) and δ = O(β) is presented. This is the only one case when second order KdV type nonlinear wave equation can be derived for arbitrary bounded bottom function.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"12 1","pages":"221-225"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80227025","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-01-01DOI: 10.12921/cmst.2018.0000059
M. Dzięcielski, S. Wołoszczuk, M. Banaszak
Using the Self-Consistent Field Theory (SCFT) we study the dual self-assembly of ABA triblock copolymers melts and compare the numerical results with those obtained by the lattice Monte Carlo simulations. While the results are qualitatively similar for both methods, the simulation times are significantly shorter for the SCFT calculations than those for the corresponding Monte Carlo simulations.
{"title":"Dual Self-Assembly in Strongly Asymmetric A-B-A Triblock Copolymer Melts Studied by Self-Consistent Field Theory and Monte Carlo Simulations","authors":"M. Dzięcielski, S. Wołoszczuk, M. Banaszak","doi":"10.12921/cmst.2018.0000059","DOIUrl":"https://doi.org/10.12921/cmst.2018.0000059","url":null,"abstract":"Using the Self-Consistent Field Theory (SCFT) we study the dual self-assembly of ABA triblock copolymers melts and compare the numerical results with those obtained by the lattice Monte Carlo simulations. While the results are qualitatively similar for both methods, the simulation times are significantly shorter for the SCFT calculations than those for the corresponding Monte Carlo simulations.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"1 1","pages":"227-234"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89734004","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-01-01DOI: 10.12921/CMST.2018.0000055
K. Kwarciak, Marcin Radom, P. Formanowicz
Sequencing by hybridization (SBH) is a method of reading DNA sequence from its smaller fragments. Such a method has been proposed in late 1980s and until the emergence of the new generation sequencing it has been widely used and improved. Since the initial, classical approach to SBH, many modifications and enhancements was proposed, aimed at improving the preciseness and the length of sequences which can be unambiguously read. Even now, for some DNA sequences sequencing by hybridization can still be used effectively and at a low cost. In this paper many different approaches to the SBH will be described, mainly from the points of view of algorithms and computational complexity.
{"title":"Computational Aspects of DNA Sequencing by Hybridization – a Survey","authors":"K. Kwarciak, Marcin Radom, P. Formanowicz","doi":"10.12921/CMST.2018.0000055","DOIUrl":"https://doi.org/10.12921/CMST.2018.0000055","url":null,"abstract":"Sequencing by hybridization (SBH) is a method of reading DNA sequence from its smaller fragments. Such a method has been proposed in late 1980s and until the emergence of the new generation sequencing it has been widely used and improved. Since the initial, classical approach to SBH, many modifications and enhancements was proposed, aimed at improving the preciseness and the length of sequences which can be unambiguously read. Even now, for some DNA sequences sequencing by hybridization can still be used effectively and at a low cost. In this paper many different approaches to the SBH will be described, mainly from the points of view of algorithms and computational complexity.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"34 1","pages":"259-271"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82220919","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-01-01DOI: 10.12921/CMST.2018.0000045
R. Katarzyniak, Dominik P. Wiecek
In this paper we deal with an original model of technically oriented cognitive semantics of modal equivalences, stated in semi-controlled natural languages and used as surface linguistic representations of internal knowledge states of artificial autonomous systems. The cognitive semantics is defined to support generation of natural language statements extended with auto-epistemic operators of modality, representing subjectively experienced certainty, strong belief and week belief of the autonomous system that the relationship between occurrence of two chosen properties in a real object is the logical equivalence relation. An internal architecture of the autonomous system is briefly presented with particular emphasis on computational modules responsible for verification of compliance of current knowledge processing states with states described by the cognitive semantics as proper for application of a particular case of modal equivalence. The major issue discussed in the paper concerns an original theory of grounding of modal equivalences in empirical knowledge resources, encapsulated in the autonomous system. The whole theory consists of theorems describing basic and advanced properties of the cognitive semantics. In the paper, the attention is limited to presentation and proof of four theorems about nonemptiness of the proposed cognitive semantics. The research results cover the next stage of some research and development efforts, concerning the technical implementation of cognitive computing models, describing the artificial generation of semi-natural languages by the interactive autonomous system to describe their encapsulated knowledge resources.
{"title":"A Note on Nonemptiness of Cognitive Semantics for Linguistic Representations of Modal Equivalence","authors":"R. Katarzyniak, Dominik P. Wiecek","doi":"10.12921/CMST.2018.0000045","DOIUrl":"https://doi.org/10.12921/CMST.2018.0000045","url":null,"abstract":"In this paper we deal with an original model of technically oriented cognitive semantics of modal equivalences, stated in semi-controlled natural languages and used as surface linguistic representations of internal knowledge states of artificial autonomous systems. The cognitive semantics is defined to support generation of natural language statements extended with auto-epistemic operators of modality, representing subjectively experienced certainty, strong belief and week belief of the autonomous system that the relationship between occurrence of two chosen properties in a real object is the logical equivalence relation. An internal architecture of the autonomous system is briefly presented with particular emphasis on computational modules responsible for verification of compliance of current knowledge processing states with states described by the cognitive semantics as proper for application of a particular case of modal equivalence. The major issue discussed in the paper concerns an original theory of grounding of modal equivalences in empirical knowledge resources, encapsulated in the autonomous system. The whole theory consists of theorems describing basic and advanced properties of the cognitive semantics. In the paper, the attention is limited to presentation and proof of four theorems about nonemptiness of the proposed cognitive semantics. The research results cover the next stage of some research and development efforts, concerning the technical implementation of cognitive computing models, describing the artificial generation of semi-natural languages by the interactive autonomous system to describe their encapsulated knowledge resources.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"237 3","pages":"301-315"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91476980","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-01-01DOI: 10.12921/cmst.2018.0000027
P. Kozyra
Four algorithms determining all functional square roots (half iterates) and seven algorithms finding one functional square root of any function f : X → X defined on a finite set X , if these square roots exist, are presented herein. Time efficiency of these algorithms depending on the complexity of examined functions is compared and justification of correctness is given. Moreover, theorems which make finding half iterates possible in some cases or facilitate this task are formulated.
{"title":"On Half Iterates of Functions Defined on Finite Sets","authors":"P. Kozyra","doi":"10.12921/cmst.2018.0000027","DOIUrl":"https://doi.org/10.12921/cmst.2018.0000027","url":null,"abstract":"Four algorithms determining all functional square roots (half iterates) and seven algorithms finding one functional square root of any function f : X → X defined on a finite set X , if these square roots exist, are presented herein. Time efficiency of these algorithms depending on the complexity of examined functions is compared and justification of correctness is given. Moreover, theorems which make finding half iterates possible in some cases or facilitate this task are formulated.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"1 1","pages":"187-209"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89589795","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-01-01DOI: 10.12921/cmst.2018.0000047
Łukasz Modliński, Grzegorz Popek
The paper aims to give at least a partial answer to an urgent need for knowledge processing systems equipped with semantic capabilities. One of the crucial goals is to reflect inner computational models and numerical data outside of the system by presenting linguistic statements easily understood by a non-expert user. The paper follows a motivational scenario and presents a layered approach to knowledge integration. The fundamental rationale behind the proposed approach is that a degree of inconsistency of the whole body of knowledge should be incorporated into the formed summary and conveyed to the external user of the system. The paper deals with a practically important problem of processing modal epistemic statements about an object exhibiting some set of fuzzy properties. The statements represent distributed knowledge of some agent population and are represented on the level of a semi-natural language. In particular, the paper describes an approach to two-level fuzzy-linguistic knowledge integration based on the consensus-theory and clustering methods. In particular, it discusses the difference between the in-cluster level and the cross-cluster level. While this paper considers an environment limited to a single object with multiple properties, it is directly extendable to environments with multiple objects. The reduction is purely technical as it allows for a simplification of a notation and presented descriptions.
{"title":"Multiagent Approach to Fuzzy-Linguistic Knowledge Integration","authors":"Łukasz Modliński, Grzegorz Popek","doi":"10.12921/cmst.2018.0000047","DOIUrl":"https://doi.org/10.12921/cmst.2018.0000047","url":null,"abstract":"The paper aims to give at least a partial answer to an urgent need for knowledge processing systems equipped with semantic capabilities. One of the crucial goals is to reflect inner computational models and numerical data outside of the system by presenting linguistic statements easily understood by a non-expert user. The paper follows a motivational scenario and presents a layered approach to knowledge integration. The fundamental rationale behind the proposed approach is that a degree of inconsistency of the whole body of knowledge should be incorporated into the formed summary and conveyed to the external user of the system. The paper deals with a practically important problem of processing modal epistemic statements about an object exhibiting some set of fuzzy properties. The statements represent distributed knowledge of some agent population and are represented on the level of a semi-natural language. In particular, the paper describes an approach to two-level fuzzy-linguistic knowledge integration based on the consensus-theory and clustering methods. In particular, it discusses the difference between the in-cluster level and the cross-cluster level. While this paper considers an environment limited to a single object with multiple properties, it is directly extendable to environments with multiple objects. The reduction is purely technical as it allows for a simplification of a notation and presented descriptions.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"557 1","pages":"317-336"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77529673","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
扫码关注我们
求助内容：
应助结果提醒方式：