Pub Date : 2019-07-18DOI: 10.15622/SP.2019.18.4.887-911
M. Peregudov, I. Semchenko
Assessing the security of digital radio networks in destructive impact conditions is an important task. However, such an assessment for random multiple access to the ALOHA-type environment in digital radio networks was not carried out. The paper presents an analytical model of random multiple access for the environment of digital radio networks of the ALOHA type in destructive impact conditions. In this model, acomplex measure, including the probability of a successful voice connection, the transfer of a service command, a text message or a multimedia file, the degree of filling and the degree of overflow of digital radio network data packets, serves as the resultant indicator for evaluating the effectiveness of random multiple media access. The new complex indicator of the probability of a successful voice connection, the transfer of a service command, a text message or a multimedia file takes into account the known probabilities of successful delivery of data packets, creation of a collision and a free channel, as well as new average transmission times for a sequence of data packets and a collision formed during such transmission. New indicators are the degree of filling and the degree of overflow of digital radio communications network data packets. They determine in saturated and supersaturated data networks of such a network how close (far) to maximum is the probability value of a successful voice connection, transmission of a service command, test message or multimedia file. The model takes into account the potential destructive effects of the attacker by refining the analytical expressions for the known probabilistic and new temporal characteristics. First, a quantitative relationship between the probability of a successful voice connection, the transfer of a service command, a text message or a multimedia file and the average duration of a data channel collisions is established./ Secondly, for guaranteed disabling a digital radio network with random multiple access to the medium ALOHA type attacker must constantly carry out a destructive impact. The results are applied in design of digital radio communications networks operating under destructive impacts, as well as in development of automatic systems for optimizing the operation of digital radio communications networks and protecting them from such impacts.
{"title":"Evaluation of Efficiency of Random Multiple Access to ALOHA Type Environment with Voice Connections, Transfer of Service Commands, Text Messages and Multimedia Files in Destructive Impact Conditions","authors":"M. Peregudov, I. Semchenko","doi":"10.15622/SP.2019.18.4.887-911","DOIUrl":"https://doi.org/10.15622/SP.2019.18.4.887-911","url":null,"abstract":"Assessing the security of digital radio networks in destructive impact conditions is an important task. However, such an assessment for random multiple access to the ALOHA-type environment in digital radio networks was not carried out. The paper presents an analytical model of random multiple access for the environment of digital radio networks of the ALOHA type in destructive impact conditions. In this model, acomplex measure, including the probability of a successful voice connection, the transfer of a service command, a text message or a multimedia file, the degree of filling and the degree of overflow of digital radio network data packets, serves as the resultant indicator for evaluating the effectiveness of random multiple media access. The new complex indicator of the probability of a successful voice connection, the transfer of a service command, a text message or a multimedia file takes into account the known probabilities of successful delivery of data packets, creation of a collision and a free channel, as well as new average transmission times for a sequence of data packets and a collision formed during such transmission. New indicators are the degree of filling and the degree of overflow of digital radio communications network data packets. They determine in saturated and supersaturated data networks of such a network how close (far) to maximum is the probability value of a successful voice connection, transmission of a service command, test message or multimedia file. The model takes into account the potential destructive effects of the attacker by refining the analytical expressions for the known probabilistic and new temporal characteristics. First, a quantitative relationship between the probability of a successful voice connection, the transfer of a service command, a text message or a multimedia file and the average duration of a data channel collisions is established./ Secondly, for guaranteed disabling a digital radio network with random multiple access to the medium ALOHA type attacker must constantly carry out a destructive impact. The results are applied in design of digital radio communications networks operating under destructive impacts, as well as in development of automatic systems for optimizing the operation of digital radio communications networks and protecting them from such impacts.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87453686","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 : 2019-07-18DOI: 10.15622/SP.2019.18.4.831-857
K. Sandkuhl, A. Smirnov, N. Shilov
Presenting information to a wide audience through digital signage has now become a very popular way in both public areas (shopping centers, exhibitions) and areas accessible by limited groups of people (condominiums, office buildings). This method of information delivery can be used both for advertising and for non-commercial information. Although targeted information delivery to one person (for example, banner ads on web pages) is already very well developed, the design of digital signage systems that provide targeted information has not been paid enough attention. The paper proposes an approach to providing information through targeted digital signage. The research method used in this work is based on the design science research (DSR) approach. This is an approach to problem solving, motivated and initiated by a specific business problem and trying to solve this problem by creating and verifying information technology artifacts, such as prototypes, models, methods, or architectures. Based on this method, the problem was refined, in particular, from the point of view of the housing industry, which led to the development of a new solution to support business processes of stakeholder groups in the industry. Verification of the draft decision showed that additional technological solutions are needed, such as user identification support, search for common preferences for a group of users, ensuring confidentiality of interests and preferences of individual users. The paper also proposes technologies for user identification and finding common interests and preferences.
{"title":"Providing Targeted Digital Signage: Possible Solutions","authors":"K. Sandkuhl, A. Smirnov, N. Shilov","doi":"10.15622/SP.2019.18.4.831-857","DOIUrl":"https://doi.org/10.15622/SP.2019.18.4.831-857","url":null,"abstract":"Presenting information to a wide audience through digital signage has now become a very popular way in both public areas (shopping centers, exhibitions) and areas accessible by limited groups of people (condominiums, office buildings). This method of information delivery can be used both for advertising and for non-commercial information. Although targeted information delivery to one person (for example, banner ads on web pages) is already very well developed, the design of digital signage systems that provide targeted information has not been paid enough attention. The paper proposes an approach to providing information through targeted digital signage. The research method used in this work is based on the design science research (DSR) approach. This is an approach to problem solving, motivated and initiated by a specific business problem and trying to solve this problem by creating and verifying information technology artifacts, such as prototypes, models, methods, or architectures. Based on this method, the problem was refined, in particular, from the point of view of the housing industry, which led to the development of a new solution to support business processes of stakeholder groups in the industry. Verification of the draft decision showed that additional technological solutions are needed, such as user identification support, search for common preferences for a group of users, ensuring confidentiality of interests and preferences of individual users. The paper also proposes technologies for user identification and finding common interests and preferences.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"43 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88611116","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 : 2019-07-18DOI: 10.15622/SP.2019.18.4.976-1009
A. Korotin, G. Kozyrev, A. Nazarov, Evgeniy Blagodyrenko
The scientific research of reliability of combinatorial-metric algorithm for multi-dimensional group point objects recognition in hierarchically organized features space is considered in the paper. The nature of reliability indicator change is examined, as an example, using multilevel descriptions of simulated and real objects under the condition that recognition results obtained at one hierarchy level are used as input data at next level. A priori uncertainty of a view angle, composition incompleteness and coordinate noise of objects determine the combinatorial procedures of quantifiable estimation of proximity of multidimensional GPO, presenting the object of recognition to a particular class. The stability of the recognition algorithm is achieved by the possibility of changing strategy of making a classification decision. For this purpose, we use the representation of a group point object at the lowest level of the hierarchy in the form of: sample, composition of sample elements or a complex a priori indicator. In order to increase the recognition accuracy, it was proposed to use the search of recognition results at low levels of the hierarchy. The experimental dependences of a priori and a posteriori reliability indicators for various conditions for measurements and states of recognition objects are provided in the paper.
{"title":"Investigation of Reliability of Combinatorial-Metric Algorithm for Recognition of N-Dimensional Group Point Object in Hierarchy Features Space","authors":"A. Korotin, G. Kozyrev, A. Nazarov, Evgeniy Blagodyrenko","doi":"10.15622/SP.2019.18.4.976-1009","DOIUrl":"https://doi.org/10.15622/SP.2019.18.4.976-1009","url":null,"abstract":"The scientific research of reliability of combinatorial-metric algorithm for multi-dimensional group point objects recognition in hierarchically organized features space is considered in the paper. The nature of reliability indicator change is examined, as an example, using multilevel descriptions of simulated and real objects under the condition that recognition results obtained at one hierarchy level are used as input data at next level. \u0000A priori uncertainty of a view angle, composition incompleteness and coordinate noise of objects determine the combinatorial procedures of quantifiable estimation of proximity of multidimensional GPO, presenting the object of recognition to a particular class. \u0000The stability of the recognition algorithm is achieved by the possibility of changing strategy of making a classification decision. For this purpose, we use the representation of a group point object at the lowest level of the hierarchy in the form of: sample, composition of sample elements or a complex a priori indicator. In order to increase the recognition accuracy, it was proposed to use the search of recognition results at low levels of the hierarchy. The experimental dependences of a priori and a posteriori reliability indicators for various conditions for measurements and states of recognition objects are provided in the paper.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"66 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89612512","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 : 2019-06-05DOI: 10.15622/SP.2019.18.3.677-704
A. Gaiduk
The design problem of control systems for nonlinear plants with differentiated nonlinearity is considered. The urgency of this problem is caused by the big difficulties of practical design of nonlinear control systems with the help of the majority of known methods. In many cases, even provision by these methods of just stability of equilibrium point of a designing system represents a big challenge. Distinctive feature of the method of nonlinear control systems design considered below is the use of the nonlinear plants models represented in a quasilinear form. This form of the nonlinear differential equations exists, if nonlinearities in their right parts are differentiated across all arguments. The quasilinear model of the controlled plant allows reducing the design problem to the solution of an algebraic equations system, which has the unique solution if the plant is controlled according to the controllability condition provided in the article. This condition is similar to the controllability condition of the Kalman’s criterion. Procedure of the nonlinear control systems design on a basis of the plant’s quasilinear models is very simple. Practically, it is close to the known polynomial method of the linear control systems design. The equations of the nonlinear systems designed with application of the plant’s quasilinear models also can be represented in the quasilinear form. The basic result of this article is the proof of the theorem and the corollary from it about conditions of the asymptotical stability at whole of the equilibrium point of the nonlinear control systems designed on a basis of the plant’s quasilinear models. For the proof of the theorem and consequence, the properties of simple matrixes and known theorems of stability of the indignant systems of the differential equations are used. A way of the stability research of the equilibrium point of the quasilinear control systems based on the proved theorem is illustrated by numerical examples. Computer simulation of these systems verifies correctness of the hypoyhesis of the proved theorem. Obtained results allow applying the method of nonlinear systems design on a basis of the quasilinear models for creation of various control systems for plants in power, aviation, space, robotechnical and other industries.
{"title":"Towards Design of Quasilinear Gurvits Control Systems","authors":"A. Gaiduk","doi":"10.15622/SP.2019.18.3.677-704","DOIUrl":"https://doi.org/10.15622/SP.2019.18.3.677-704","url":null,"abstract":"The design problem of control systems for nonlinear plants with differentiated nonlinearity is considered. The urgency of this problem is caused by the big difficulties of practical design of nonlinear control systems with the help of the majority of known methods. In many cases, even provision by these methods of just stability of equilibrium point of a designing system represents a big challenge. Distinctive feature of the method of nonlinear control systems design considered below is the use of the nonlinear plants models represented in a quasilinear form. This form of the nonlinear differential equations exists, if nonlinearities in their right parts are differentiated across all arguments. The quasilinear model of the controlled plant allows reducing the design problem to the solution of an algebraic equations system, which has the unique solution if the plant is controlled according to the controllability condition provided in the article. This condition is similar to the controllability condition of the Kalman’s criterion. Procedure of the nonlinear control systems design on a basis of the plant’s quasilinear models is very simple. Practically, it is close to the known polynomial method of the linear control systems design. The equations of the nonlinear systems designed with application of the plant’s quasilinear models also can be represented in the quasilinear form. \u0000The basic result of this article is the proof of the theorem and the corollary from it about conditions of the asymptotical stability at whole of the equilibrium point of the nonlinear control systems designed on a basis of the plant’s quasilinear models. For the proof of the theorem and consequence, the properties of simple matrixes and known theorems of stability of the indignant systems of the differential equations are used. A way of the stability research of the equilibrium point of the quasilinear control systems based on the proved theorem is illustrated by numerical examples. Computer simulation of these systems verifies correctness of the hypoyhesis of the proved theorem. \u0000Obtained results allow applying the method of nonlinear systems design on a basis of the quasilinear models for creation of various control systems for plants in power, aviation, space, robotechnical and other industries.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"C-35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84453093","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 : 2019-06-05DOI: 10.15622/SP.2019.18.3.557-581
A. Agafonov, V. Myasnikov
An increase in the number of vehicles, especially in large cities, and inability of the existing road infrastructure to distribute transport flows, leads to a higher congestion level in transport networks. This problem makes the solution to navigational problems more and more important. Despite the popularity of these tasks, many existing commercial systems find a route in deterministic networks, not taking into account the time-dependent and stochastic properties of traffic flows, i.e. travel time of road links is considered as constant. This paper addresses the reliable routing problem in stochastic networks using actual information of the traffic flow parameters. We consider the following optimality criterion: maximization of the probability of arriving on time at a destination given a departure time and a time budget. The reliable shortest path takes into account the variance of the travel time of the road network segments, which makes it more applicable for solving routing problems in transport networks compared to standard shortest path search algorithms that take into account only the average travel time of network segments. To describe the travel time of the road network segments, it is proposed to use parametrically defined stable Levy probability distributions. The use of stable distributions allows replacing the operation of calculating convolution to determine the reliability of the path to recalculating the parameters of the distributions density, which significantly reduces the computational time of the algorithm. The proposed method gives a solution in the form of a decision, i.e. the route proposed in the solution is not fixed in advance, but adaptively changes depending on changes in the real state of the network. An experimental analysis of the algorithm carried out on a large-scale transport network of Samara, Russia, showed that the presented algorithm can significantly reduce the computational time of the reliable shortest path algorithm with a slight increase in travel time.
{"title":"Method for Reliable Shortest Path Determination in Stochastic Networks using Parametrically Defined Stable Probability Distributions","authors":"A. Agafonov, V. Myasnikov","doi":"10.15622/SP.2019.18.3.557-581","DOIUrl":"https://doi.org/10.15622/SP.2019.18.3.557-581","url":null,"abstract":"An increase in the number of vehicles, especially in large cities, and inability of the existing road infrastructure to distribute transport flows, leads to a higher congestion level in transport networks. This problem makes the solution to navigational problems more and more important. Despite the popularity of these tasks, many existing commercial systems find a route in deterministic networks, not taking into account the time-dependent and stochastic properties of traffic flows, i.e. travel time of road links is considered as constant. This paper addresses the reliable routing problem in stochastic networks using actual information of the traffic flow parameters. We consider the following optimality criterion: maximization of the probability of arriving on time at a destination given a departure time and a time budget. The reliable shortest path takes into account the variance of the travel time of the road network segments, which makes it more applicable for solving routing problems in transport networks compared to standard shortest path search algorithms that take into account only the average travel time of network segments. To describe the travel time of the road network segments, it is proposed to use parametrically defined stable Levy probability distributions. The use of stable distributions allows replacing the operation of calculating convolution to determine the reliability of the path to recalculating the parameters of the distributions density, which significantly reduces the computational time of the algorithm. The proposed method gives a solution in the form of a decision, i.e. the route proposed in the solution is not fixed in advance, but adaptively changes depending on changes in the real state of the network. An experimental analysis of the algorithm carried out on a large-scale transport network of Samara, Russia, showed that the presented algorithm can significantly reduce the computational time of the reliable shortest path algorithm with a slight increase in travel time.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72476501","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 : 2019-06-05DOI: 10.15622/SP.2019.18.3.766-792
F. Krasnov, M. Shvartsman, A. Dimentov
The authors developed an approach to comparative analysis of scientific journals collections based on the analysis of co-authors graph and the text model. The use of time series of co-authorship graphs metrics allowed the authors to analyze trends in the development of journal authors. The text model was built using machine learning techniques. The journals content was classified to determine the authenticity degree of various journals and different issues of a single journal via a text model. The authors developed a metric of Content Authenticity Ratio, which allows quantifying the authenticity of journal collections in comparison. Comparative thematic analysis of journals collections was carried out using the thematic model with additive regularization. Based on the created thematic model, the authors constructed thematic profiles of the journals archives in a single thematic basis. The approach developed by the authors was applied to archives of two journals on the Rheumatology for the period 2000–2018. As a benchmark for comparing the co-author’s metrics, public data sets from the SNAP research laboratory at Stanford University were used. As a result, the authors adapted the existing examples of the effective functioning of the authors collaborations in order to improve the work of journals editorial staff. Quantitative comparison of large volumes of texts and metadata of scientific articles was carried out. As a result of the experiment conducted using the developed methods, it was shown that the content authenticity of the selected journals is 89%, co-authorships in one of the journals have a pronounced centrality, which is a distinctive feature of the policy editor. The clarity and consistency of the results confirm the effectiveness of the approach proposed by the authors. The code developed in the course of the experiment in the Python programming language can be used for comparative analysis of other collections of journals in the Russian language.
{"title":"Comparative Analysis of Scientific Journals Collections","authors":"F. Krasnov, M. Shvartsman, A. Dimentov","doi":"10.15622/SP.2019.18.3.766-792","DOIUrl":"https://doi.org/10.15622/SP.2019.18.3.766-792","url":null,"abstract":"The authors developed an approach to comparative analysis of scientific journals collections based on the analysis of co-authors graph and the text model. The use of time series of co-authorship graphs metrics allowed the authors to analyze trends in the development of journal authors. The text model was built using machine learning techniques. The journals content was classified to determine the authenticity degree of various journals and different issues of a single journal via a text model. The authors developed a metric of Content Authenticity Ratio, which allows quantifying the authenticity of journal collections in comparison. Comparative thematic analysis of journals collections was carried out using the thematic model with additive regularization. Based on the created thematic model, the authors constructed thematic profiles of the journals archives in a single thematic basis. The approach developed by the authors was applied to archives of two journals on the Rheumatology for the period 2000–2018. As a benchmark for comparing the co-author’s metrics, public data sets from the SNAP research laboratory at Stanford University were used. As a result, the authors adapted the existing examples of the effective functioning of the authors collaborations in order to improve the work of journals editorial staff. Quantitative comparison of large volumes of texts and metadata of scientific articles was carried out. As a result of the experiment conducted using the developed methods, it was shown that the content authenticity of the selected journals is 89%, co-authorships in one of the journals have a pronounced centrality, which is a distinctive feature of the policy editor. The clarity and consistency of the results confirm the effectiveness of the approach proposed by the authors. The code developed in the course of the experiment in the Python programming language can be used for comparative analysis of other collections of journals in the Russian language.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80918013","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 : 2019-06-05DOI: 10.15622/SP.2019.18.3.614-644
V. Sugak, V. Volkov, Vladimir Salukhov, Aleksey Karaychev
The paper considers research of the sustainability plans of active moving objects (AMOs) control system application. AMOs are material objects moving in space and carrying out informational, material and energetic interaction with objects, control points and other AMOs. Use of AMOs is usually regulated by strict requirements, so any time delay or incomplete achievement of target effect are unacceptable. The reason of failing to perform a purpose task can be the development of control using incorrect plans, so that realization of the plan is unstable due to random factors or targeted effects of the environment and other systems. The paper deals with problematic issues of complex research of active moving objects control application stability plans . Quantitative and qualitative assessment methods of stability plans , ways and means of ensuring required levels of stability are proposed by the authors. In this case planning task is considered dynamic, which provides plan correction by means of organizational, structural and program-algorithmic measures to ensure stability. The most adequate model of plan implementation is appropriate system of differential equations. Notion of stability probability is defined to account stochastic character of disturbance effect . The expression for stability criterion is obtained. It allows to establish the fact of sustainability and unsustainability based on analysis of properties of a purposefully built Lyapunov function and disturbances characteristics.
{"title":"Study of Plans Sustainability of Active Moving Objects Control Systems Application","authors":"V. Sugak, V. Volkov, Vladimir Salukhov, Aleksey Karaychev","doi":"10.15622/SP.2019.18.3.614-644","DOIUrl":"https://doi.org/10.15622/SP.2019.18.3.614-644","url":null,"abstract":"The paper considers research of the sustainability plans of active moving objects (AMOs) control system application. AMOs are material objects moving in space and carrying out informational, material and energetic interaction with objects, control points and other AMOs. \u0000Use of AMOs is usually regulated by strict requirements, so any time delay or incomplete achievement of target effect are unacceptable. The reason of failing to perform a purpose task can be the development of control using incorrect plans, so that realization of the plan is unstable due to random factors or targeted effects of the environment and other systems. The paper deals with problematic issues of complex research of active moving objects control application stability plans . \u0000 Quantitative and qualitative assessment methods of stability plans , ways and means of ensuring required levels of stability are proposed by the authors. In this case planning task is considered dynamic, which provides plan correction by means of organizational, structural and program-algorithmic measures to ensure stability. The most adequate model of plan implementation is appropriate system of differential equations. Notion of stability probability is defined to account stochastic character of disturbance effect . The expression for stability criterion is obtained. It allows to establish the fact of sustainability and unsustainability based on analysis of properties of a purposefully built Lyapunov function and disturbances characteristics. ","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"34 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73417258","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 : 2019-06-05DOI: 10.15622/SP.2019.18.3.705-740
V. Yakovlev
The wide distribution of mobile wireless devices (smartphones, tablets, etc.) warrants cryptographic protection of information transmitted by these devices, which requires supplying these devices with keys and providing their authentication. Recently, research on key authentication methods within scenarios of pairing mobile devices, has been increasingly relevant. In these conditions, mobile devices are located close to each other, up to the physical contact, and an additional key sharing authenticated channel protected from interception is established for purposes of key authentication. The analysis of additional channel versions: visual, acoustic, vibration, tactile, and magnetometric shows advantages of the latter one in terms of speed and reliability of authentication, as well as easer se of this channel compared to other methods. A magnetometer channel forms if there are magnetometers in mobile devices that measure the Earth’s magnetic field. Random fluctuations of the magnetic field at the measurement point allow to generate in a pair of mobile devices random sequences that coincide with a high probability and which can be used to authenticate session keys. The “Magparing” protocol of mobile devices keys authentication, which are distributed by Diffie-Hellman method is studied. his protocol is based on the magnetometer data measuring. We demonstrate that the protocol is succeptible to “man-in-the-middle” attack. This fact is confirmed also by software AVISPA simulation. A new key authentication method based on the use of authenticating code (A-code) is proposed. Authenticators for Diffie-Hellman values are generated based on A-code blocks and random sequences obtained by the reading of magnetometer’s values. An approach for A-code parameters optimization, that conforms to the requirements for authentication key length and both to the probabilities of false key removal and false key deception, is investigated. We present an example of code parameters for key authentication with the length of 256 bits, providing the probability of a false key agreement of not greater than 10-9 and a probability of false rejection of a true key equal to –10–6, which shows viability of the proposed authentication method.
{"title":"Authentication of Keys Distributed by the Diffie-Hellman Method for Mobile Devices based on Authentication Codes and Magnetometric Data","authors":"V. Yakovlev","doi":"10.15622/SP.2019.18.3.705-740","DOIUrl":"https://doi.org/10.15622/SP.2019.18.3.705-740","url":null,"abstract":"The wide distribution of mobile wireless devices (smartphones, tablets, etc.) warrants cryptographic protection of information transmitted by these devices, which requires supplying these devices with keys and providing their authentication. Recently, research on key authentication methods within scenarios of pairing mobile devices, has been increasingly relevant. In these conditions, mobile devices are located close to each other, up to the physical contact, and an additional key sharing authenticated channel protected from interception is established for purposes of key authentication. \u0000The analysis of additional channel versions: visual, acoustic, vibration, tactile, and magnetometric shows advantages of the latter one in terms of speed and reliability of authentication, as well as easer se of this channel compared to other methods. A magnetometer channel forms if there are magnetometers in mobile devices that measure the Earth’s magnetic field. Random fluctuations of the magnetic field at the measurement point allow to generate in a pair of mobile devices random sequences that coincide with a high probability and which can be used to authenticate session keys. \u0000The “Magparing” protocol of mobile devices keys authentication, which are distributed by Diffie-Hellman method is studied. his protocol is based on the magnetometer data measuring. We demonstrate that the protocol is succeptible to “man-in-the-middle” attack. This fact is confirmed also by software AVISPA simulation. \u0000A new key authentication method based on the use of authenticating code (A-code) is proposed. Authenticators for Diffie-Hellman values are generated based on A-code blocks and random sequences obtained by the reading of magnetometer’s values. An approach for A-code parameters optimization, that conforms to the requirements for authentication key length and both to the probabilities of false key removal and false key deception, is investigated. We present an example of code parameters for key authentication with the length of 256 bits, providing the probability of a false key agreement of not greater than 10-9 and a probability of false rejection of a true key equal to –10–6, which shows viability of the proposed authentication method.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"65 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91085624","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 : 2019-06-04DOI: 10.15622/SP.2019.18.3.582-613
Jeyeon Kim, Kenta Sato, N. Hashimoto, A. Kashevnik, K. Tomita, Seiichi Miyakoshi, Yusuke Takinami, O. Matsumoto, Ali Boyali
Personal mobility devises become more and more popular last years. Gyroscooters, two wheeled self-balancing vehicles, wheelchair, bikes, and scooters help people to solve the first and last mile problems in big cities. To help people with navigation and to increase their safety the intelligent rider assistant systems can be utilized that are used the rider personal smartphone to form the context and provide the rider with the recommendations. We understand the context as any information that characterize current situation. So, the context represents the model of current situation. We assume that rider mounts personal smartphone that allows it to track the rider face using the front-facing camera. Modern smartphones allow to track current situation using such sensors as: GPS / GLONASS, accelerometer, gyroscope, magnetometer, microphone, and video cameras. The proposed rider assistant system uses these sensors to capture the context information about the rider and the vehicle and generates context-oriented recommendations. The proposed system is aimed at dangerous situation detection for the rider, we are considering two dangerous situations: drowsiness and distraction. Using the computer vision methods, we determine parameters of the rider face (eyes, nose, mouth, head pith and rotation angles) and based on analysis of this parameters detect the dangerous situations. The paper presents a comprehensive related work analysis in the topic of intelligent driver assistant systems and recommendation generation, an approach to dangerous situation detection and recommendation generation is proposed, and evaluation of the distraction dangerous state determination for personal mobility device riders.
{"title":"Context-Based Rider Assistant System for Two Wheeled Self-Balancing Vehicles","authors":"Jeyeon Kim, Kenta Sato, N. Hashimoto, A. Kashevnik, K. Tomita, Seiichi Miyakoshi, Yusuke Takinami, O. Matsumoto, Ali Boyali","doi":"10.15622/SP.2019.18.3.582-613","DOIUrl":"https://doi.org/10.15622/SP.2019.18.3.582-613","url":null,"abstract":"Personal mobility devises become more and more popular last years. Gyroscooters, two wheeled self-balancing vehicles, wheelchair, bikes, and scooters help people to solve the first and last mile problems in big cities. To help people with navigation and to increase their safety the intelligent rider assistant systems can be utilized that are used the rider personal smartphone to form the context and provide the rider with the recommendations. We understand the context as any information that characterize current situation. So, the context represents the model of current situation. We assume that rider mounts personal smartphone that allows it to track the rider face using the front-facing camera. Modern smartphones allow to track current situation using such sensors as: GPS / GLONASS, accelerometer, gyroscope, magnetometer, microphone, and video cameras. The proposed rider assistant system uses these sensors to capture the context information about the rider and the vehicle and generates context-oriented recommendations. The proposed system is aimed at dangerous situation detection for the rider, we are considering two dangerous situations: drowsiness and distraction. Using the computer vision methods, we determine parameters of the rider face (eyes, nose, mouth, head pith and rotation angles) and based on analysis of this parameters detect the dangerous situations. The paper presents a comprehensive related work analysis in the topic of intelligent driver assistant systems and recommendation generation, an approach to dangerous situation detection and recommendation generation is proposed, and evaluation of the distraction dangerous state determination for personal mobility device riders.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77762977","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 : 2019-06-04DOI: 10.15622/SP.2019.18.3.741-765
A. Kurtukova, A. Romanov
The paper is devoted to the analysis of the problem of determining the source code author , which is of interest to researchers in the field of information security, computer forensics, assessment of the quality of the educational process, protection of intellectual property. The paper presents a detailed analysis of modern solutions to the problem. The authors suggest two new identification techniques based on machine learning algorithms: support vector machine, fast correlation filter and informative features; the technique based on hybrid convolutional recurrent neural network. The experimental database includes samples of source codes written in Java, C ++, Python, PHP, JavaScript, C, C # and Ruby. The data was obtained using a web service for hosting IT-projects – Github. The total number of source codes exceeds 150 thousand samples. The average length of each of them is 850 characters. The case size is 542 authors. The experiments were conducted with source codes written in the most popular programming languages. Accuracy of the developed techniques for different numbers of authors was assessed using 10-fold cross-validation. An additional series of experiments was conducted with the number of authors from 2 to 50 for the most popular Java programming language. The graphs of the relationship between identification accuracy and case size are plotted. The analysis of result showed that the method based on hybrid neural network gives 97% accuracy, and it’s at the present time the best-known result. The technique based on the support vector machine made it possible to achieve 96% accuracy. The difference between the results of the hybrid neural network and the support vector machine was approximately 5%.
{"title":"Identification Author of Source Code by Machine Learning Methods","authors":"A. Kurtukova, A. Romanov","doi":"10.15622/SP.2019.18.3.741-765","DOIUrl":"https://doi.org/10.15622/SP.2019.18.3.741-765","url":null,"abstract":"The paper is devoted to the analysis of the problem of determining the source code author , which is of interest to researchers in the field of information security, computer forensics, assessment of the quality of the educational process, protection of intellectual property. \u0000The paper presents a detailed analysis of modern solutions to the problem. The authors suggest two new identification techniques based on machine learning algorithms: support vector machine, fast correlation filter and informative features; the technique based on hybrid convolutional recurrent neural network. \u0000The experimental database includes samples of source codes written in Java, C ++, Python, PHP, JavaScript, C, C # and Ruby. The data was obtained using a web service for hosting IT-projects – Github. The total number of source codes exceeds 150 thousand samples. The average length of each of them is 850 characters. The case size is 542 authors. \u0000The experiments were conducted with source codes written in the most popular programming languages. Accuracy of the developed techniques for different numbers of authors was assessed using 10-fold cross-validation. An additional series of experiments was conducted with the number of authors from 2 to 50 for the most popular Java programming language. The graphs of the relationship between identification accuracy and case size are plotted. The analysis of result showed that the method based on hybrid neural network gives 97% accuracy, and it’s at the present time the best-known result. The technique based on the support vector machine made it possible to achieve 96% accuracy. The difference between the results of the hybrid neural network and the support vector machine was approximately 5%.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81753039","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
扫码关注我们
求助内容：
应助结果提醒方式：