Pub Date : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109871
Boyarkin Denis, Krupenev Dmitriy, I. Dmitriy, Sidorov Denis
This paper deals with the computational efficiency related problem appearing in electric power systems adequacy assessment using Monte-Carlo method. To attack this problem the novel method is suggested to reduce number of random states to be analyzed. The machine learning methods are employed for electric power system states precalculated classification. Random forest and support vector machine methods are proposed to use for solving this problem. Efficiency of proposed approach is demonstrated on test scheme.
{"title":"Machine learning in electric power systems adequacy assessment using Monte-Carlo method","authors":"Boyarkin Denis, Krupenev Dmitriy, I. Dmitriy, Sidorov Denis","doi":"10.1109/SIBIRCON.2017.8109871","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109871","url":null,"abstract":"This paper deals with the computational efficiency related problem appearing in electric power systems adequacy assessment using Monte-Carlo method. To attack this problem the novel method is suggested to reduce number of random states to be analyzed. The machine learning methods are employed for electric power system states precalculated classification. Random forest and support vector machine methods are proposed to use for solving this problem. Efficiency of proposed approach is demonstrated on test scheme.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116340988","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 : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109826
A. Rodionov
New model of multi-layer service network is discussed in the paper. Each server or any group of servers of a given layer of an hierarchical queuing network may be a customer in queuing systems of next layer. Conception of hypernet uses for representing structure of such multi-layer network, which we name as Q-hypernet. Some typical cases of Q-hypernet with possible applications are discussed along with possible enhancement of the concept.
{"title":"Q-hypernets as a new model of dynamical multi-layer networks","authors":"A. Rodionov","doi":"10.1109/SIBIRCON.2017.8109826","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109826","url":null,"abstract":"New model of multi-layer service network is discussed in the paper. Each server or any group of servers of a given layer of an hierarchical queuing network may be a customer in queuing systems of next layer. Conception of hypernet uses for representing structure of such multi-layer network, which we name as Q-hypernet. Some typical cases of Q-hypernet with possible applications are discussed along with possible enhancement of the concept.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114294053","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 : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109901
B. Ryabko, A. Soskov
By definition, a distinguishing attack is any test that allows distinguishing the encrypted data from random data and modern symmetric-key ciphers must be immune to such an attack. In other words, modern block ciphers are designed to have ciphertext indistinguishability. If an algorithm that can distinguish the cipher output from random faster than a brute force search is found, then that is considered a break of the cipher. We applied the distinguishing attack to modern lightweight block ciphers Speck, Simon, Simeck, HIGHT and LEA using statistical test “Book Stack”. We experimentally found a minimal number of rounds where encrypted data looked like random bit-sequence. It is shown, that this number of rounds varies significantly for different ciphers. In particular, our experiments and estimations show that cipher Simeck48/96 is not immune to distinguishing attack.
{"title":"Application of the distinguishing attack to lightweight block ciphers","authors":"B. Ryabko, A. Soskov","doi":"10.1109/SIBIRCON.2017.8109901","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109901","url":null,"abstract":"By definition, a distinguishing attack is any test that allows distinguishing the encrypted data from random data and modern symmetric-key ciphers must be immune to such an attack. In other words, modern block ciphers are designed to have ciphertext indistinguishability. If an algorithm that can distinguish the cipher output from random faster than a brute force search is found, then that is considered a break of the cipher. We applied the distinguishing attack to modern lightweight block ciphers Speck, Simon, Simeck, HIGHT and LEA using statistical test “Book Stack”. We experimentally found a minimal number of rounds where encrypted data looked like random bit-sequence. It is shown, that this number of rounds varies significantly for different ciphers. In particular, our experiments and estimations show that cipher Simeck48/96 is not immune to distinguishing attack.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116591300","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 : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109866
Eugeniiy V. Rabinovich, P. I. Vaynmaster
The important stage in the monitoring of hydraulic fracturing is construction of a graphical model of a fractured area. However, real data recorded in the process of hydraulic fracturing are characterized by a high intensity of seismic activity in the monitoring area, which makes it difficult to correctly construct such a model. The original algorithm is described, which allows one to eliminate the redundancy of miscroseismic sources and to highlight the local hypocenters of microearthquakes. The results obtained were used to construct a three-dimensional graphical model of a fracture.
{"title":"The algorithm for elimination of data redundancy in hydraulic fracturing monitoring systems","authors":"Eugeniiy V. Rabinovich, P. I. Vaynmaster","doi":"10.1109/SIBIRCON.2017.8109866","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109866","url":null,"abstract":"The important stage in the monitoring of hydraulic fracturing is construction of a graphical model of a fractured area. However, real data recorded in the process of hydraulic fracturing are characterized by a high intensity of seismic activity in the monitoring area, which makes it difficult to correctly construct such a model. The original algorithm is described, which allows one to eliminate the redundancy of miscroseismic sources and to highlight the local hypocenters of microearthquakes. The results obtained were used to construct a three-dimensional graphical model of a fracture.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123109777","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 : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109827
A. Ageev, A. Kel'manov, A. Pyatkin, S. Khamidullin, Vladimir Shenmaier
The work considers the mathematical aspects of one of the most fundamental problems of data analysis: search (choice) among a collection of objects for a subset of similar ones. In particular, the problem appears in connection with data editing and cleaning (removal of irrelevant (not similar) elements). We consider the model of this problem, i.e., the problem of searching for a subset of largest cardinality in a finite set of points of the Euclidean space for which quadratic variation of points with respect to its unknown centroid does not exceed a given fraction of the quadratic variation of points of the input set with respect to its centroid. It is proved that the problem is strongly NP-hard. A polynomial-time 1/2-approximation algorithm is proposed. The results of the numerical simulation demonstrating the effectiveness of the algorithm are presented.
{"title":"1/2-Approximation polynomial-time algorithm for a problem of searching a subset","authors":"A. Ageev, A. Kel'manov, A. Pyatkin, S. Khamidullin, Vladimir Shenmaier","doi":"10.1109/SIBIRCON.2017.8109827","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109827","url":null,"abstract":"The work considers the mathematical aspects of one of the most fundamental problems of data analysis: search (choice) among a collection of objects for a subset of similar ones. In particular, the problem appears in connection with data editing and cleaning (removal of irrelevant (not similar) elements). We consider the model of this problem, i.e., the problem of searching for a subset of largest cardinality in a finite set of points of the Euclidean space for which quadratic variation of points with respect to its unknown centroid does not exceed a given fraction of the quadratic variation of points of the input set with respect to its centroid. It is proved that the problem is strongly NP-hard. A polynomial-time 1/2-approximation algorithm is proposed. The results of the numerical simulation demonstrating the effectiveness of the algorithm are presented.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129506410","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 : 2017-09-01DOI: 10.1109/sibircon.2017.8109883
A. Letyagin
Biometric Technologies in MRI: MRI can be considered as the verification / authentication system has a 1st part — sensor, 2nd part — pre-processing, 3d part — feature extractor. The goal is to identify and verify the biomarker / biomarkers of a typical pathology (edema, cyst, scarring, swelling, hemorrhage, fracture, etc.) as the basis for diagnosing the disease. Information Technologies in MRI: application of computers and computer networks for storing, studying, retrieving, transmitting and processing (manipulation) data or information in the context of medical diagnostics. The goal is to track the course of the disease, to ensure the completeness of information about the dynamics of the state of the body, as a basis for risk indicators and an adequate prognosis of the disease.
{"title":"Biometrie and information technologies in clinical and experimental MRI","authors":"A. Letyagin","doi":"10.1109/sibircon.2017.8109883","DOIUrl":"https://doi.org/10.1109/sibircon.2017.8109883","url":null,"abstract":"Biometric Technologies in MRI: MRI can be considered as the verification / authentication system has a 1st part — sensor, 2nd part — pre-processing, 3d part — feature extractor. The goal is to identify and verify the biomarker / biomarkers of a typical pathology (edema, cyst, scarring, swelling, hemorrhage, fracture, etc.) as the basis for diagnosing the disease. Information Technologies in MRI: application of computers and computer networks for storing, studying, retrieving, transmitting and processing (manipulation) data or information in the context of medical diagnostics. The goal is to track the course of the disease, to ensure the completeness of information about the dynamics of the state of the body, as a basis for risk indicators and an adequate prognosis of the disease.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134280766","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 : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109919
R. Gazizov, R. S. Ryabov, T. T. Gazizov
Importance of genetic algorithms (GA) usage in the investigation of an ultrashort pulse peak voltage in multiconductor structures of printed circuit boards (PCB) is highlighted. Trapezoidal ultrashort pulse propagation along the conductors of real PCB multiconductor bus was simulated. With the usage of GA, an optimization of the rise, top and fall durations of the ultrashort pulse was made by criteria of peak voltage maximization in the PCB bus. The optimization was launched with the following parameters: the number of chromosomes in population — 5; the number of populations — 26; mutation coefficients — 0.01, 0.03, 0.05 and 0.08 when the crossover coefficient was 0.5; crossover coefficients — 0.1, 0.3, 0.5 and 0.8 when the mutation coefficient was 0.1. A voltage maximum by 38% exceeding the steady state level is revealed and localized with variation of ultrashort rise, top and fall durations when the whole ultrashort pulse duration was near 1.5 ns. An influence of mutation and crossover coefficients variation on the obtained results convergence is shown.
{"title":"Influence of crossover and mutation coefficients on GA optimization of ultrashort pulse duration by criteria of peak voltage maximization in PCB bus","authors":"R. Gazizov, R. S. Ryabov, T. T. Gazizov","doi":"10.1109/SIBIRCON.2017.8109919","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109919","url":null,"abstract":"Importance of genetic algorithms (GA) usage in the investigation of an ultrashort pulse peak voltage in multiconductor structures of printed circuit boards (PCB) is highlighted. Trapezoidal ultrashort pulse propagation along the conductors of real PCB multiconductor bus was simulated. With the usage of GA, an optimization of the rise, top and fall durations of the ultrashort pulse was made by criteria of peak voltage maximization in the PCB bus. The optimization was launched with the following parameters: the number of chromosomes in population — 5; the number of populations — 26; mutation coefficients — 0.01, 0.03, 0.05 and 0.08 when the crossover coefficient was 0.5; crossover coefficients — 0.1, 0.3, 0.5 and 0.8 when the mutation coefficient was 0.1. A voltage maximum by 38% exceeding the steady state level is revealed and localized with variation of ultrashort rise, top and fall durations when the whole ultrashort pulse duration was near 1.5 ns. An influence of mutation and crossover coefficients variation on the obtained results convergence is shown.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133334315","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 : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109836
C. Callegari, S. Giordano, M. Pagano
Detecting anomalous traffic (and above all new ad-hoc attacks) with low false alarm rates is of primary interest in IP networks management. To this aim a key research topic in network security is represented by anomaly-based IDSs (Intrusion Detection Systems) thanks to their ability to face unknown attacks. Starting from more than a decade of research experience by the authors, the aim of this paper is to revise some of the most promising statistical approaches, namely Wavelets, Principal Component Analysis, CUSUM (cumulative sum control chart) and Information Theoretical methods (based on different definitions of the Entropy). Moreover, issues related to the choice of the relevant traffic parameters, use of sketches and availability of dataset for performance comparison are also discussed to highlight the main problems in intrusion detection.
{"title":"Anomaly detection: An overview of selected methods","authors":"C. Callegari, S. Giordano, M. Pagano","doi":"10.1109/SIBIRCON.2017.8109836","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109836","url":null,"abstract":"Detecting anomalous traffic (and above all new ad-hoc attacks) with low false alarm rates is of primary interest in IP networks management. To this aim a key research topic in network security is represented by anomaly-based IDSs (Intrusion Detection Systems) thanks to their ability to face unknown attacks. Starting from more than a decade of research experience by the authors, the aim of this paper is to revise some of the most promising statistical approaches, namely Wavelets, Principal Component Analysis, CUSUM (cumulative sum control chart) and Information Theoretical methods (based on different definitions of the Entropy). Moreover, issues related to the choice of the relevant traffic parameters, use of sketches and availability of dataset for performance comparison are also discussed to highlight the main problems in intrusion detection.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133281067","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 : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109881
V. Butin, A. Butina
An efficient practical method for bipolar transistor application for neutron fluence registration is presented. The method is focused on neutron fluences damage effect correlation for various sources to reference source. The bipolar transistor connection diagram and an example of device realization based on STM32 microcontroller are described. STM32 is used for providing test signals and parameter registration used for gain factor calculation of bipolar transistors monitor (BTM). The proposed approach allows considering the features of pre-irradiated at reference source BTM and their application as the neutron fluence monitors. These connection diagram and constructive solutions provide “on-line” neutron fluence registration for different sources in terms of reference source as required for radiation tests results verification.
{"title":"Bipolar transistor application for «on-line» neutron fluence registration","authors":"V. Butin, A. Butina","doi":"10.1109/SIBIRCON.2017.8109881","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109881","url":null,"abstract":"An efficient practical method for bipolar transistor application for neutron fluence registration is presented. The method is focused on neutron fluences damage effect correlation for various sources to reference source. The bipolar transistor connection diagram and an example of device realization based on STM32 microcontroller are described. STM32 is used for providing test signals and parameter registration used for gain factor calculation of bipolar transistors monitor (BTM). The proposed approach allows considering the features of pre-irradiated at reference source BTM and their application as the neutron fluence monitors. These connection diagram and constructive solutions provide “on-line” neutron fluence registration for different sources in terms of reference source as required for radiation tests results verification.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113956883","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 : 2017-09-01DOI: 10.1109/SIBIRCON.2017.8109926
A. Nosov, R. Surovtsev
Protection of electronic equipment against ultrashort pulses by meander lines is considered. The results of cross-section parametric optimization and experimental investigations of a meander line turn with broad-side coupling are presented. As the result of the optimization, the set of parameters is obtained for the line per-unit-length modal delays difference maximization with the geometric mean of modes impedances of 50 Ohm. Based on the selected parameters the printed circuit board with meander delay line prototypes of different lengths is manufactured. Then the study of the prototypes in time and frequency domains was executed. The attenuation of the ultrashort pulse with the duration of 40 ps up to 4.2 times is experimentally obtained. It is revealed that the turn passband decreased from 715 to 365 MHz with the turn length increasing from 50 to 100 mm.
{"title":"Study of protective meander line turn with broad-side coupling","authors":"A. Nosov, R. Surovtsev","doi":"10.1109/SIBIRCON.2017.8109926","DOIUrl":"https://doi.org/10.1109/SIBIRCON.2017.8109926","url":null,"abstract":"Protection of electronic equipment against ultrashort pulses by meander lines is considered. The results of cross-section parametric optimization and experimental investigations of a meander line turn with broad-side coupling are presented. As the result of the optimization, the set of parameters is obtained for the line per-unit-length modal delays difference maximization with the geometric mean of modes impedances of 50 Ohm. Based on the selected parameters the printed circuit board with meander delay line prototypes of different lengths is manufactured. Then the study of the prototypes in time and frequency domains was executed. The attenuation of the ultrashort pulse with the duration of 40 ps up to 4.2 times is experimentally obtained. It is revealed that the turn passband decreased from 715 to 365 MHz with the turn length increasing from 50 to 100 mm.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114896914","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
扫码关注我们
求助内容：
应助结果提醒方式：