Pub Date : 2023-04-10DOI: 10.3390/informatics10020036
Diogo Santos, Elsa Cardoso, I. Alexandre
Online commerce has been growing rapidly in an increasingly digital world, and gamification, the practice of designing games in a context outside the industry itself, can be an effective strategy to stimulate consumer engagement and conversion rate. This paper describes the design process involved in introducing gamification into an online shop that is supported by two game servers of the same kind, namely one in the United States of America (US) and another in Portugal (PT). Through the various phases of the design thinking process, a gamified system was implemented to meet the needs of various types of users frequently found in the shops. The gamification elements used were intended to increase user engagement with the shops so that they would become more aware of existing products and the introduction of new products, promoting purchase through intangible challenges and rewards. The impacts on server revenues and user satisfaction (N = 138) were evaluated one month after introducing the gamification techniques. The results show that gamification has a positive effect on users, with a significant increase in consumer interaction in both shops. However, from a business point of view, the results show only an increase in revenue for the US shop, while the Portuguese shop shows no significant differences compared to previous months. Of the two user groups analyzed, only those who frequent the US shop show receptivity toward intangible rewards, with tangible rewards (discounts) being a greater motivating factor for both groups.
{"title":"Evaluating the Impact of Gamification on the Online Shop of a Game Server: A Comparison between the Portuguese and North American Contexts","authors":"Diogo Santos, Elsa Cardoso, I. Alexandre","doi":"10.3390/informatics10020036","DOIUrl":"https://doi.org/10.3390/informatics10020036","url":null,"abstract":"Online commerce has been growing rapidly in an increasingly digital world, and gamification, the practice of designing games in a context outside the industry itself, can be an effective strategy to stimulate consumer engagement and conversion rate. This paper describes the design process involved in introducing gamification into an online shop that is supported by two game servers of the same kind, namely one in the United States of America (US) and another in Portugal (PT). Through the various phases of the design thinking process, a gamified system was implemented to meet the needs of various types of users frequently found in the shops. The gamification elements used were intended to increase user engagement with the shops so that they would become more aware of existing products and the introduction of new products, promoting purchase through intangible challenges and rewards. The impacts on server revenues and user satisfaction (N = 138) were evaluated one month after introducing the gamification techniques. The results show that gamification has a positive effect on users, with a significant increase in consumer interaction in both shops. However, from a business point of view, the results show only an increase in revenue for the US shop, while the Portuguese shop shows no significant differences compared to previous months. Of the two user groups analyzed, only those who frequent the US shop show receptivity toward intangible rewards, with tangible rewards (discounts) being a greater motivating factor for both groups.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"10 1","pages":"36"},"PeriodicalIF":3.1,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47891706","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 : 2023-04-07DOI: 10.3390/informatics10020035
Shefa Tawalbeh, Ahmed Al-Omari, L. Al-Ebbini, Hiam Alquran
Jordanian healthcare institutes have launched several programs since 2009 to establish health information systems (HISs). Nowadays, the generic expectation is that the use of HIS resources is performed on daily basis among healthcare staff. However, there can be still a noticeable barrier due to a lack of knowledge if medical doctors do not receive proper training on existing HISs. Moreover, the lack of studies on this area hinders the clarity about the received versus the required training skills among medical doctors. To support this research initiative, survey data have been collected from specialized medical doctors who are currently affiliated with five Jordanian universities to assess their need for HIS training. The results also aim to explore the extent of medical doctors’ use of HIS resources in Jordan. Moreover, they examine whether medical doctors require additional training on using HIS resources or not, as well as the main areas of required training programs. Specifically, this paper highlights the main topics that can be suitable subjects for enhanced training programs. The results show that most respondents use HISs in their daily clinical practices. However, most of them have not taken professional training on such systems. Hence, most of the respondents reported the need for additional training programs on several aspects of HIS resources. Moreover, based on the survey results, the most significant areas that require training are biomedical data analysis, artificial intelligence in medicine, health care management, and recent advances in electronic health records, respectively. Therefore, specialized medical doctors in Jordan need training on extracting useful and potential features of HISs. Education and training professionals in healthcare are recommended to establish training programs in Jordanian healthcare centers, which can further improve the quality of healthcare.
{"title":"On the Need for Healthcare Informatics Training among Medical Doctors in Jordan: A Pilot Study","authors":"Shefa Tawalbeh, Ahmed Al-Omari, L. Al-Ebbini, Hiam Alquran","doi":"10.3390/informatics10020035","DOIUrl":"https://doi.org/10.3390/informatics10020035","url":null,"abstract":"Jordanian healthcare institutes have launched several programs since 2009 to establish health information systems (HISs). Nowadays, the generic expectation is that the use of HIS resources is performed on daily basis among healthcare staff. However, there can be still a noticeable barrier due to a lack of knowledge if medical doctors do not receive proper training on existing HISs. Moreover, the lack of studies on this area hinders the clarity about the received versus the required training skills among medical doctors. To support this research initiative, survey data have been collected from specialized medical doctors who are currently affiliated with five Jordanian universities to assess their need for HIS training. The results also aim to explore the extent of medical doctors’ use of HIS resources in Jordan. Moreover, they examine whether medical doctors require additional training on using HIS resources or not, as well as the main areas of required training programs. Specifically, this paper highlights the main topics that can be suitable subjects for enhanced training programs. The results show that most respondents use HISs in their daily clinical practices. However, most of them have not taken professional training on such systems. Hence, most of the respondents reported the need for additional training programs on several aspects of HIS resources. Moreover, based on the survey results, the most significant areas that require training are biomedical data analysis, artificial intelligence in medicine, health care management, and recent advances in electronic health records, respectively. Therefore, specialized medical doctors in Jordan need training on extracting useful and potential features of HISs. Education and training professionals in healthcare are recommended to establish training programs in Jordanian healthcare centers, which can further improve the quality of healthcare.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"10 1","pages":"35"},"PeriodicalIF":3.1,"publicationDate":"2023-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48132920","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 : 2023-03-30DOI: 10.3390/informatics10020034
Ridwan Ilyas, M. L. Khodra, R. Munir, Rila Mandala, D. H. Widyantoro
The paraphrase generator for citation sentences is used to produce several sentence alternatives to avoid plagiarism. Furthermore, the generation results need to pay attention to semantic similarity and lexical divergence standards. This study proposed the StoPGEN model as an algorithm for generating citation paraphrase sentences with stochastic output. The generation process is guided by an objective function using a simulated annealing algorithm to maintain the properties of semantic similarity and lexical divergence. The objective function is created by combining the two factors that maintain these properties. This study combined METEOR and PINC Scores in a linear weighting function that can be adjusted for its value tendency in one of the matrix functions. The dataset of citation sentences that had been labeled with paraphrases was used to test StoPGEN and other models for comparison. The StoPGEN model, with the citation sentences dataset, produced a BLEU score of 55.37, outperforming the bidirectional LSTM method with a value of 28.93. StoPGEN was also tested using Quora data by changing the language source in the architecture section resulting in a BLEU score of 22.37, outperforming UPSA 18.21. In addition, the qualitative evaluation results of the citation sentence generation based on respondents obtained an acceptance value of 50.80.
{"title":"Generating Paraphrase Using Simulated Annealing for Citation Sentences","authors":"Ridwan Ilyas, M. L. Khodra, R. Munir, Rila Mandala, D. H. Widyantoro","doi":"10.3390/informatics10020034","DOIUrl":"https://doi.org/10.3390/informatics10020034","url":null,"abstract":"The paraphrase generator for citation sentences is used to produce several sentence alternatives to avoid plagiarism. Furthermore, the generation results need to pay attention to semantic similarity and lexical divergence standards. This study proposed the StoPGEN model as an algorithm for generating citation paraphrase sentences with stochastic output. The generation process is guided by an objective function using a simulated annealing algorithm to maintain the properties of semantic similarity and lexical divergence. The objective function is created by combining the two factors that maintain these properties. This study combined METEOR and PINC Scores in a linear weighting function that can be adjusted for its value tendency in one of the matrix functions. The dataset of citation sentences that had been labeled with paraphrases was used to test StoPGEN and other models for comparison. The StoPGEN model, with the citation sentences dataset, produced a BLEU score of 55.37, outperforming the bidirectional LSTM method with a value of 28.93. StoPGEN was also tested using Quora data by changing the language source in the architecture section resulting in a BLEU score of 22.37, outperforming UPSA 18.21. In addition, the qualitative evaluation results of the citation sentence generation based on respondents obtained an acceptance value of 50.80.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"10 1","pages":"34"},"PeriodicalIF":3.1,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46486265","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 : 2023-03-29DOI: 10.37661/1816-0301-2023-20-1-27-39
Objectives. To estimate effect sizes in quasi-experimental studies.Methods. Methods of the theory of estimation, methods of mathematical statistics.Results. Estimation of the effect size on an ordinal scale, estimation of the effect size on a binary in the case of opposite direction effects in groups, in quasi-experimental studies for the analytical method "differences in differences".Conclusion. The paper considers approaches to assessing absolute and standardized effect sizes in experimental and quasi-experimental studies. A brief review of the estimators of absolute and standardized effect sizes for quantitative and binary study variables is provided. The applied approach is proposed to assess the effect sizes of a binary variable in the case of opposite direction effects in groups within a quasi-experimental studies for the "differences in differences" analytical method. An example of assessment of absolute and standardized effect sizes of quantitative and binary variables in quasi-experimental studies in clinical epidemiology is considered.
{"title":"Effect size assessment in quasi-experimental studies","authors":"","doi":"10.37661/1816-0301-2023-20-1-27-39","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-1-27-39","url":null,"abstract":"Objectives. To estimate effect sizes in quasi-experimental studies.Methods. Methods of the theory of estimation, methods of mathematical statistics.Results. Estimation of the effect size on an ordinal scale, estimation of the effect size on a binary in the case of opposite direction effects in groups, in quasi-experimental studies for the analytical method \"differences in differences\".Conclusion. The paper considers approaches to assessing absolute and standardized effect sizes in experimental and quasi-experimental studies. A brief review of the estimators of absolute and standardized effect sizes for quantitative and binary study variables is provided. The applied approach is proposed to assess the effect sizes of a binary variable in the case of opposite direction effects in groups within a quasi-experimental studies for the \"differences in differences\" analytical method. An example of assessment of absolute and standardized effect sizes of quantitative and binary variables in quasi-experimental studies in clinical epidemiology is considered. ","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" ","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47028298","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 : 2023-03-29DOI: 10.37661/1816-0301-2023-20-1-7-26
V. Yarmolik, A. A. Ivaniuk
Objectives. The problem of constructing a new class of physically unclonable functions of the arbiter type (APUF) is being solved, based on the difference in delay times for the inputs of numerous modifications of the base element, due to both an increase in the number of inputs and the topology of their connection. Such an approach allows building two-dimensional physically unclonable functions (2D-APUF), in which, unlike classical APUF, the challenge generated for each basic element selects a pair of paths not from two possible, but from a larger number of them. The relevance of such a study is associated with the active development of physical cryptography. The following goals are pursued in the work: the construction of the basic elements of the APUF and their modifications, the development of a methodology for constructing 2D-APUF.Methods. The methods of synthesis and analysis of digital devices are used, including those based on programmable logic integrated circuits, the basics of Boolean algebra and circuitry. Results. It is shown that the classical APUF uses a standard basic element that performs two functions, namely, the function of choosing a pair of paths Select and the function of switching paths Switch, which, due to their joint use, allow achieving high performance. First of all, this concerns the stability of the APUF functioning, which is characterized by a small number of challenge, for which the response randomly takes one of two possible values 0 or 1. Modifications of the base element in terms of the implementations of its Select and Switch functions are proposed. New structures of the base element are presented in which the modifications of their implementations are made, including in terms of increasing the number of pairs of paths of the base element from which one of them is selected by the challenge, and the configurations of their switching. The use of various basic elements makes it possible to improve the main characteristics of APUF, as well as to break the regularity of their structure, which was the main reason for hacking APUF through machine learning. Conclusion. The proposed approach to the construction of physically unclonable 2D-APUF functions, based on the difference in signal delays through the base element, has shown its efficiency and promise. The effect of improving the characteristics of such PUFs has been experimentally confirmed with noticeable improvement in the stability of their functioning. It seems promising to further develop the ideas of constructing two-dimensional physically unclonable functions of the arbiter type, as well as experimental study of their characteristics, as well as resistance to various types of attacks, including using machine learning.
{"title":"2D physically unclonable functions of the arbiter type","authors":"V. Yarmolik, A. A. Ivaniuk","doi":"10.37661/1816-0301-2023-20-1-7-26","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-1-7-26","url":null,"abstract":"Objectives. The problem of constructing a new class of physically unclonable functions of the arbiter type (APUF) is being solved, based on the difference in delay times for the inputs of numerous modifications of the base element, due to both an increase in the number of inputs and the topology of their connection. Such an approach allows building two-dimensional physically unclonable functions (2D-APUF), in which, unlike classical APUF, the challenge generated for each basic element selects a pair of paths not from two possible, but from a larger number of them. The relevance of such a study is associated with the active development of physical cryptography. The following goals are pursued in the work: the construction of the basic elements of the APUF and their modifications, the development of a methodology for constructing 2D-APUF.Methods. The methods of synthesis and analysis of digital devices are used, including those based on programmable logic integrated circuits, the basics of Boolean algebra and circuitry. Results. It is shown that the classical APUF uses a standard basic element that performs two functions, namely, the function of choosing a pair of paths Select and the function of switching paths Switch, which, due to their joint use, allow achieving high performance. First of all, this concerns the stability of the APUF functioning, which is characterized by a small number of challenge, for which the response randomly takes one of two possible values 0 or 1. Modifications of the base element in terms of the implementations of its Select and Switch functions are proposed. New structures of the base element are presented in which the modifications of their implementations are made, including in terms of increasing the number of pairs of paths of the base element from which one of them is selected by the challenge, and the configurations of their switching. The use of various basic elements makes it possible to improve the main characteristics of APUF, as well as to break the regularity of their structure, which was the main reason for hacking APUF through machine learning. Conclusion. The proposed approach to the construction of physically unclonable 2D-APUF functions, based on the difference in signal delays through the base element, has shown its efficiency and promise. The effect of improving the characteristics of such PUFs has been experimentally confirmed with noticeable improvement in the stability of their functioning. It seems promising to further develop the ideas of constructing two-dimensional physically unclonable functions of the arbiter type, as well as experimental study of their characteristics, as well as resistance to various types of attacks, including using machine learning.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" ","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46263341","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 : 2023-03-29DOI: 10.37661/1816-0301-2023-20-1-91-101
A. Butov
Objectives. Currently, electronic control devices are increasingly being introduced into various household and production products. Microcontrollers of a wide variety of configurations are widely used as such devices. Another approach can be proposed where a control device with a standard structure is synthesized from typical integrated circuits and implements a Boolean function describing the required control actions.The purpose of the work is to investigate the possibility of implementing Boolean functions using devices with a standard structure, the design of which is based on the use of a discrete automaton model.Methods. The original Boolean function to be implemented is given as a disjunctive normal form. A binary decision diagram (BDD) is built for such function, optimized by the number of vertices, on the basis of which a graph of transitions of a synchronous Moore automaton with an abstract state is formed. Further, after performing the state encoding step of the machine, input information for flashing (programming) of the matrix memory of the read-only memory (ROM) is generated based on its transition table.Results. A device that implements a Boolean function based on an automaton model is synthesized from typical microcircuits. The main component is ROM, which, according to the standard structure of the device, is supplemented by a shift register, a state register, a trigger and three selectors of the initial and two final states.Conclusion. The process of designing a device with standard structure that implements the Boolean function, as a result, comes down to programming the ROM matrix memory based on an automaton transition table. The use of a reprogrammable ROM allows to change the functionality of the device while maintaining the previous circuit implementation. The disadvantage of such a device, as well as devices implemented on the basis of microcontrollers, is the low speed, the advantage is the possibility of use it in various products and devices, primarily for household purposes, which do not require a high-speed response to the change of input signal.
{"title":"Hardware implementation of Boolean functions based on the automaton model","authors":"A. Butov","doi":"10.37661/1816-0301-2023-20-1-91-101","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-1-91-101","url":null,"abstract":"Objectives. Currently, electronic control devices are increasingly being introduced into various household and production products. Microcontrollers of a wide variety of configurations are widely used as such devices. Another approach can be proposed where a control device with a standard structure is synthesized from typical integrated circuits and implements a Boolean function describing the required control actions.The purpose of the work is to investigate the possibility of implementing Boolean functions using devices with a standard structure, the design of which is based on the use of a discrete automaton model.Methods. The original Boolean function to be implemented is given as a disjunctive normal form. A binary decision diagram (BDD) is built for such function, optimized by the number of vertices, on the basis of which a graph of transitions of a synchronous Moore automaton with an abstract state is formed. Further, after performing the state encoding step of the machine, input information for flashing (programming) of the matrix memory of the read-only memory (ROM) is generated based on its transition table.Results. A device that implements a Boolean function based on an automaton model is synthesized from typical microcircuits. The main component is ROM, which, according to the standard structure of the device, is supplemented by a shift register, a state register, a trigger and three selectors of the initial and two final states.Conclusion. The process of designing a device with standard structure that implements the Boolean function, as a result, comes down to programming the ROM matrix memory based on an automaton transition table. The use of a reprogrammable ROM allows to change the functionality of the device while maintaining the previous circuit implementation. The disadvantage of such a device, as well as devices implemented on the basis of microcontrollers, is the low speed, the advantage is the possibility of use it in various products and devices, primarily for household purposes, which do not require a high-speed response to the change of input signal.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" ","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47855488","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 : 2023-03-29DOI: 10.37661/1816-0301-2023-20-1-55-74
U. I. Behunkou, M. Kovalyov
Objectives. The studied problem of loan classification is particularly important for financial institutions, which must efficiently allocate monetary assets between entities as part of the provision of financial services. Therefore, it is more important than ever for financial institutions to be able to identify reliable borrowers as accurately as possible. At the same time, machine learning is one of the tools for making such decisions. The aim of this work is to analyze the possibility of efficient use of logistic regression for solving the task of loan classification.Methods. Based on the logistic regression algorithm using historical data on loans issued, the following metrics are calculated: cost function, Accuracy, Precision, Recall и score. Polynomial regression and principal component analysis are used to determine the optimal set of input data for the being studied logistic regression algorithm.Results. The impact of data normalization on the final result is estimated, the optimal regularization parameter for solving this problem is determined, the impact of the balance of target values is assessed, the optimal boundary value for the logistic regression algorithm is calculated, the influence of increasing input indicators by means of filling in missing values and using polynomials of different degrees is considered and the existing set of input indicators is analyzed for redundancy.Conclusion. The research results confirm that the application of the logistic regression algorithm for solving loan classification problems is appropriate. The use of this algorithm allows to get quickly a working loan classification tool.
{"title":"Loan classification using logistic regression","authors":"U. I. Behunkou, M. Kovalyov","doi":"10.37661/1816-0301-2023-20-1-55-74","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-1-55-74","url":null,"abstract":"Objectives. The studied problem of loan classification is particularly important for financial institutions, which must efficiently allocate monetary assets between entities as part of the provision of financial services. Therefore, it is more important than ever for financial institutions to be able to identify reliable borrowers as accurately as possible. At the same time, machine learning is one of the tools for making such decisions. The aim of this work is to analyze the possibility of efficient use of logistic regression for solving the task of loan classification.Methods. Based on the logistic regression algorithm using historical data on loans issued, the following metrics are calculated: cost function, Accuracy, Precision, Recall и score. Polynomial regression and principal component analysis are used to determine the optimal set of input data for the being studied logistic regression algorithm.Results. The impact of data normalization on the final result is estimated, the optimal regularization parameter for solving this problem is determined, the impact of the balance of target values is assessed, the optimal boundary value for the logistic regression algorithm is calculated, the influence of increasing input indicators by means of filling in missing values and using polynomials of different degrees is considered and the existing set of input indicators is analyzed for redundancy.Conclusion. The research results confirm that the application of the logistic regression algorithm for solving loan classification problems is appropriate. The use of this algorithm allows to get quickly a working loan classification tool. ","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" ","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47926578","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 : 2023-03-29DOI: 10.37661/1816-0301-2023-20-1-75-90
Y. Pottosin
Objectives. The problem of low power state assignment of partial states of a parallel automaton is considered. The objective of the paper is to investigate the possibilities of using the decomposition in state assignment of partial states in order to decrease the task dimension.Methods. Parallel automaton is decomposed into a net of sequential automata whose states are assigned then with ternary vectors. The method for assignment uses searching for a maximal cut in a weighted graph that represents pairs of states connected by transitions. The edge weights of the graph are the values related to the probabilities of transitions.Results. A method to construct a net of sequential automata that realizes the given parallel automaton is described. The probabilities of transitions between sets are calculated by means of solving a system of linear equations according to the Chapmann – Kolmogorov method. The values of inner variables assigned to the states of every component sequential automaton are obtained from two-block partitions of its set of states that are determined by the cuts of corresponding transition graph.Conclusion. Applying parallel automaton decomposition allows decreasing the dimension of the laborious problem of state assignment. The proposed method is intended for application in computer aided systems for design of discrete devices.
{"title":"Joint low power state assignment of sequential automata of a net implementing a parallel automaton","authors":"Y. Pottosin","doi":"10.37661/1816-0301-2023-20-1-75-90","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-1-75-90","url":null,"abstract":"Objectives. The problem of low power state assignment of partial states of a parallel automaton is considered. The objective of the paper is to investigate the possibilities of using the decomposition in state assignment of partial states in order to decrease the task dimension.Methods. Parallel automaton is decomposed into a net of sequential automata whose states are assigned then with ternary vectors. The method for assignment uses searching for a maximal cut in a weighted graph that represents pairs of states connected by transitions. The edge weights of the graph are the values related to the probabilities of transitions.Results. A method to construct a net of sequential automata that realizes the given parallel automaton is described. The probabilities of transitions between sets are calculated by means of solving a system of linear equations according to the Chapmann – Kolmogorov method. The values of inner variables assigned to the states of every component sequential automaton are obtained from two-block partitions of its set of states that are determined by the cuts of corresponding transition graph.Conclusion. Applying parallel automaton decomposition allows decreasing the dimension of the laborious problem of state assignment. The proposed method is intended for application in computer aided systems for design of discrete devices.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" ","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47957825","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 : 2023-03-29DOI: 10.37661/1816-0301-2023-20-1-40-54
S. Ihnatsyeva, R. Bohush
Objectives. The main goal is to improve person re-identification accuracy in distributed video surveillance systems.Methods. Machine learning methods are applied.Result. A technology for two-stage training of convolutional neural networks (CNN) is presented, characterized by the use of image augmentation for the preliminary stage and fine tuning of weight coefficients based on the original images set for training. At the first stage, training is carried out on augmented data, at the second stage, fine tuning of the CNN is performed on the original images, which allows minimizing the losses and increasing model efficiency. The use of different data at different training stages does not allow the CNN to remember training examples, thereby preventing overfitting.Proposed method as expanding the training sample differs as it combines an image pixels cyclic shift, color exclusion and fragment replacement with a reduced copy of another image. This augmentation method allows to get a wide variety of training data, which increases the CNN robustness to occlusions, illumination, low image resolution, dependence on the location of features.Conclusion. The use of two-stage learning technology and the proposed data augmentation method made it possible to increase the person re-identification accuracy for different CNNs and datasets: in the Rank1 metric by 4–21 %; in the mAP by 10–31 %; in the mINP by 39–60 %.
{"title":"Improving person re-identification based on two-stage training of convolutional neural networks and augmentation","authors":"S. Ihnatsyeva, R. Bohush","doi":"10.37661/1816-0301-2023-20-1-40-54","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-1-40-54","url":null,"abstract":"Objectives. The main goal is to improve person re-identification accuracy in distributed video surveillance systems.Methods. Machine learning methods are applied.Result. A technology for two-stage training of convolutional neural networks (CNN) is presented, characterized by the use of image augmentation for the preliminary stage and fine tuning of weight coefficients based on the original images set for training. At the first stage, training is carried out on augmented data, at the second stage, fine tuning of the CNN is performed on the original images, which allows minimizing the losses and increasing model efficiency. The use of different data at different training stages does not allow the CNN to remember training examples, thereby preventing overfitting.Proposed method as expanding the training sample differs as it combines an image pixels cyclic shift, color exclusion and fragment replacement with a reduced copy of another image. This augmentation method allows to get a wide variety of training data, which increases the CNN robustness to occlusions, illumination, low image resolution, dependence on the location of features.Conclusion. The use of two-stage learning technology and the proposed data augmentation method made it possible to increase the person re-identification accuracy for different CNNs and datasets: in the Rank1 metric by 4–21 %; in the mAP by 10–31 %; in the mINP by 39–60 %. ","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" ","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46969270","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 : 2023-03-29DOI: 10.37661/1816-0301-2023-20-1-102-112
D. Likhachov, Maxim Vashkevich, N. Petrovsky, E. Azarov
Objectives. The problem of developing a method for calculating small-sized spectral features that increases the efficiency of existing machine learning systems for analyzing and classifying voice signals is being solved.Methods. Spectral features are extracted using a generative approach, which involves calculating a discrete Fourier spectrum for a sequence of samples generated using an autoregressive model of input voice signal. The generated sequence processed by the discrete Fourier transform considers the periodicity of the transform and thereby increase the accuracy of spectral estimation of analyzed signal.Results. A generative method for calculating spectral features intended for use in machine learning systems for the analysis and classification of voice signals is proposed and described. An experimental analysis of the accuracy and stability of the spectrum representation of a test signal with a known spectral composition has been carried out using the envelopes. The envelopes were calculated using proposed generative method and using discrete Fourier transform with different analysis windows (rectangular window and Hanna window). The analysis showed that spectral envelopes obtained using the proposed method more accurately represent the spectrum of test signal according to the criterion of minimum square error. A comparison of the effectiveness of voice signal classification with proposed features and the features based on the mel-frequency kepstral coefficients is carried out. A diagnostic system for amyotrophic lateral sclerosis was used as a basic test system to evaluate the effectiveness of proposed approach in practice. Conclusion. The obtained experimental results showed a significant increase of classification accuracy when using proposed approach for calculating features compared with the features based on the mel-frequency kepstral coefficients.
{"title":"Small-size spectral features for machine learning in voice signal analysis and classification tasks","authors":"D. Likhachov, Maxim Vashkevich, N. Petrovsky, E. Azarov","doi":"10.37661/1816-0301-2023-20-1-102-112","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-1-102-112","url":null,"abstract":"Objectives. The problem of developing a method for calculating small-sized spectral features that increases the efficiency of existing machine learning systems for analyzing and classifying voice signals is being solved.Methods. Spectral features are extracted using a generative approach, which involves calculating a discrete Fourier spectrum for a sequence of samples generated using an autoregressive model of input voice signal. The generated sequence processed by the discrete Fourier transform considers the periodicity of the transform and thereby increase the accuracy of spectral estimation of analyzed signal.Results. A generative method for calculating spectral features intended for use in machine learning systems for the analysis and classification of voice signals is proposed and described. An experimental analysis of the accuracy and stability of the spectrum representation of a test signal with a known spectral composition has been carried out using the envelopes. The envelopes were calculated using proposed generative method and using discrete Fourier transform with different analysis windows (rectangular window and Hanna window). The analysis showed that spectral envelopes obtained using the proposed method more accurately represent the spectrum of test signal according to the criterion of minimum square error. A comparison of the effectiveness of voice signal classification with proposed features and the features based on the mel-frequency kepstral coefficients is carried out. A diagnostic system for amyotrophic lateral sclerosis was used as a basic test system to evaluate the effectiveness of proposed approach in practice. Conclusion. The obtained experimental results showed a significant increase of classification accuracy when using proposed approach for calculating features compared with the features based on the mel-frequency kepstral coefficients.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" ","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41916629","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
扫码关注我们
求助内容：
应助结果提醒方式：