Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631266
H. Baili
The capacity of a wireless communication system is constrained by a set of scarce resources. These transmission resources must be allocated so as to maximize the capacity at the physical layer. Here stochastic control and optimization offer a powerful mathematical framework to address the issue of resource sharing; they allow to account for random behavior and dynamics at higher network layers. This work is a continuation of the research on the problem of joint power allocation and time slot scheduling in a wireless communication system. The system has time varying traffic and is handled by a single base station transmitting over time varying channels. The mobile users share each time slot and the power available at this time slot, and the performance of the allocation algorithm can be characterized by the average delay experienced by the data transmitted in the network. The proposal of an antecedent article was a heavy traffic analysis for the physical system on hand, i.e., appropriate re-scaling which lead to a diffusion approximation of the system in the sense of weak convergence. In the present article a closed form solution to the resource sharing problem is provided; the solution relies on the ergodicity of the approximate diffusion.
{"title":"Scaling Limits for Stochastic Network Models Application to Wireless Communications","authors":"H. Baili","doi":"10.1109/ICUMT.2018.8631266","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631266","url":null,"abstract":"The capacity of a wireless communication system is constrained by a set of scarce resources. These transmission resources must be allocated so as to maximize the capacity at the physical layer. Here stochastic control and optimization offer a powerful mathematical framework to address the issue of resource sharing; they allow to account for random behavior and dynamics at higher network layers. This work is a continuation of the research on the problem of joint power allocation and time slot scheduling in a wireless communication system. The system has time varying traffic and is handled by a single base station transmitting over time varying channels. The mobile users share each time slot and the power available at this time slot, and the performance of the allocation algorithm can be characterized by the average delay experienced by the data transmitted in the network. The proposal of an antecedent article was a heavy traffic analysis for the physical system on hand, i.e., appropriate re-scaling which lead to a diffusion approximation of the system in the sense of weak convergence. In the present article a closed form solution to the resource sharing problem is provided; the solution relies on the ergodicity of the approximate diffusion.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116706539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631264
Toivo Vajakas, Tanel Kiis, Amnir Hadachi, E. Vainikko
The usage of mobile phones has become an important activity in our lives. The passive mobile positioning of mobiles provides large-scale data about human mobility. Hence, in this paper, we are presenting a technique based on continuous time switching Kalman filter to efficiently detect stop and move episodes. The technique has practical and theoretical advantages as the model is more closely related to measure human mobility characteristics and less sensitive to variations in radio network operations. The technique was tested on real radio network data and the results indicated significant improvement with respect to the model performance and the literature.
{"title":"Mobility Episode Discovery in the Mobile Networks Based on Enhanced Switching Kalman Filter","authors":"Toivo Vajakas, Tanel Kiis, Amnir Hadachi, E. Vainikko","doi":"10.1109/ICUMT.2018.8631264","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631264","url":null,"abstract":"The usage of mobile phones has become an important activity in our lives. The passive mobile positioning of mobiles provides large-scale data about human mobility. Hence, in this paper, we are presenting a technique based on continuous time switching Kalman filter to efficiently detect stop and move episodes. The technique has practical and theoretical advantages as the model is more closely related to measure human mobility characteristics and less sensitive to variations in radio network operations. The technique was tested on real radio network data and the results indicated significant improvement with respect to the model performance and the literature.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114010717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631245
E. Sopin, A. Daraseliya, L. Correia
Fog computing is a good solution for response time-critical applications, which need a lot of processing time. Fog allows mobile devices to offload some tasks and, consequently, to increase battery life-time. By the way, unlike classical cloud solutions, fog computing provides very low latency thanks to its distributed computing infrastructure. In the paper, we assume that tasks are not uniform and they significantly differ in amount of required work. We propose the offloading criterion based on amount of required work for a task, so that “heavy” tasks are offloaded to the fog and “light” tasks are processed locally on mobile devices. The proposed offloading scheme is analyzed in terms of queuing systems, formulas for the main performance measures are obtained.
{"title":"Performance Analysis of the Offloading Scheme in a Fog Computing System","authors":"E. Sopin, A. Daraseliya, L. Correia","doi":"10.1109/ICUMT.2018.8631245","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631245","url":null,"abstract":"Fog computing is a good solution for response time-critical applications, which need a lot of processing time. Fog allows mobile devices to offload some tasks and, consequently, to increase battery life-time. By the way, unlike classical cloud solutions, fog computing provides very low latency thanks to its distributed computing infrastructure. In the paper, we assume that tasks are not uniform and they significantly differ in amount of required work. We propose the offloading criterion based on amount of required work for a task, so that “heavy” tasks are offloaded to the fog and “light” tasks are processed locally on mobile devices. The proposed offloading scheme is analyzed in terms of queuing systems, formulas for the main performance measures are obtained.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114149140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631256
I. Furtat, Julia V. Chugina
This paper addresses the problem of discrete-time linear systems stabilization in presence of unknown but bounded external disturbances. As a solution, the auxiliary loop approach for disturbances compensation is used to provide state feedback control. Originally proposed for the continuous-time plants, in current work auxiliary loop method is modified for application to discrete-time systems. Sufficient condition for convergence of the proposed algorithm is presented. Generalization for dynamical network is provided. Numerical examples are given to illustrate the results.
{"title":"Discrete-Time State Feedback Control Algorithm for Disturbances Compensation","authors":"I. Furtat, Julia V. Chugina","doi":"10.1109/ICUMT.2018.8631256","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631256","url":null,"abstract":"This paper addresses the problem of discrete-time linear systems stabilization in presence of unknown but bounded external disturbances. As a solution, the auxiliary loop approach for disturbances compensation is used to provide state feedback control. Originally proposed for the continuous-time plants, in current work auxiliary loop method is modified for application to discrete-time systems. Sufficient condition for convergence of the proposed algorithm is presented. Generalization for dynamical network is provided. Numerical examples are given to illustrate the results.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"160 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116253087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631198
V. Skorpil, V. Oujezský, Ludek Palenik
This article presents LoRa and LoRaWAN release 1.0 security and vulnerability overview. The practical testing includes Replay attack security weakness and demonstrating and verifying the presented theory. Tests are executed using own constructed LoRa gateway composed of Raspberry Pi and module iC880A. Python scripting is used to generate attacks. The results bring new inside view to the security part of LoRaWanand prove the necessity of a continuing research in the security field to improve services and general awareness.
{"title":"Internet of Things Security Overview and Practical Demonstration","authors":"V. Skorpil, V. Oujezský, Ludek Palenik","doi":"10.1109/ICUMT.2018.8631198","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631198","url":null,"abstract":"This article presents LoRa and LoRaWAN release 1.0 security and vulnerability overview. The practical testing includes Replay attack security weakness and demonstrating and verifying the presented theory. Tests are executed using own constructed LoRa gateway composed of Raspberry Pi and module iC880A. Python scripting is used to generate attacks. The results bring new inside view to the security part of LoRaWanand prove the necessity of a continuing research in the security field to improve services and general awareness.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124750967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631248
R. Fujdiak, V. Uher, P. Mlynek, Petr Blazek, J. Slacik, Vladimir Sedlacek, J. Misurec, Marina Volkova, P. Chmelar
This paper describes a network traffic generator which is based on a container virtualization technology, namely Docker. The aim of the generator is the simulation of TCP/IP layer 7 (L7) traffic and attacks. The main advantages of the proposed solution are its flexibility and extensibility. The integration of a new service is as demanding as installing a service on a classical server. It is also possible to run the generator in a cloud using Docker Swarm mode. Three different web servers and one classic HTTP attack - slowloris are used for demonstration purposes. The output of the generator is a captured traffic in the pcap file format.
{"title":"IP Traffic Generator Using Container Virtualization Technology","authors":"R. Fujdiak, V. Uher, P. Mlynek, Petr Blazek, J. Slacik, Vladimir Sedlacek, J. Misurec, Marina Volkova, P. Chmelar","doi":"10.1109/ICUMT.2018.8631248","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631248","url":null,"abstract":"This paper describes a network traffic generator which is based on a container virtualization technology, namely Docker. The aim of the generator is the simulation of TCP/IP layer 7 (L7) traffic and attacks. The main advantages of the proposed solution are its flexibility and extensibility. The integration of a new service is as demanding as installing a service on a classical server. It is also possible to run the generator in a cloud using Docker Swarm mode. Three different web servers and one classic HTTP attack - slowloris are used for demonstration purposes. The output of the generator is a captured traffic in the pcap file format.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123699800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631233
N. Apanasenko, E. Bakin, G. Evseev
This research is devoted to an analysis of a data transmission systems with Frequency Hopping-Spread Spectrum working in a presence of a mixture Cauchy-Gaussian noise. We consider coherent and non-coherent reception of such signals and four decision-making algorithms: correlation receiver, correlation receiver with a preliminary threshold, algorithm based on a binary quantization and algorithm based on a median statistic. As a result of the comparative analysis we figure out areas of applicability for the considered receivers and their dependency on distortion parameters.
{"title":"Robust Receivers for FH-SS Signals in Channel with Additive Cauchy-Gaussian Mixture Noise","authors":"N. Apanasenko, E. Bakin, G. Evseev","doi":"10.1109/ICUMT.2018.8631233","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631233","url":null,"abstract":"This research is devoted to an analysis of a data transmission systems with Frequency Hopping-Spread Spectrum working in a presence of a mixture Cauchy-Gaussian noise. We consider coherent and non-coherent reception of such signals and four decision-making algorithms: correlation receiver, correlation receiver with a preliminary threshold, algorithm based on a binary quantization and algorithm based on a median statistic. As a result of the comparative analysis we figure out areas of applicability for the considered receivers and their dependency on distortion parameters.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129838115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631258
Nadezhda Chukhno, K. Samouylov, Olga Chukhno, Anna Gaidamaka, E. Herrera-Viedma
Group decision-making (GDM) is a process that consists of choosing the best alternative or a set of alternatives from all possible, taking into account the opinions of the group of people. This technology is well researched and applied not for the first decade, however, traditional algorithms did not intend to work with a large amount of data. It means, that during assessment of alternatives each expert chooses a limited set of data that interested him. In addition, each of experts may have his own rating scale. The problem becomes critical when the number of alternatives and experts evaluating them is large, as it is happening in social network contexts. The article offers a review and a formal description of a new GDM approach in social networks. With the use of set-theoretical operations, method of alternatives ranking in the group assessment of social networks is formalized. A theorem on the conversion from the rating scale of linguistic term set (LTS) into basic LTS (BLTS) rating scale is proved. Using the UML language, a formal model was developed and a key algorithm for conversion of numerical ranks from the LTS scale into the BLTS scale was proposed. A method for extrapolating the values of ranks when the network is scaled is developed, for example, when the number of experts is modified. A case for numerical demonstration of the algorithm is presented.
{"title":"A New Ranking Method of Alternatives for Group Decision Making in Social Networks","authors":"Nadezhda Chukhno, K. Samouylov, Olga Chukhno, Anna Gaidamaka, E. Herrera-Viedma","doi":"10.1109/ICUMT.2018.8631258","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631258","url":null,"abstract":"Group decision-making (GDM) is a process that consists of choosing the best alternative or a set of alternatives from all possible, taking into account the opinions of the group of people. This technology is well researched and applied not for the first decade, however, traditional algorithms did not intend to work with a large amount of data. It means, that during assessment of alternatives each expert chooses a limited set of data that interested him. In addition, each of experts may have his own rating scale. The problem becomes critical when the number of alternatives and experts evaluating them is large, as it is happening in social network contexts. The article offers a review and a formal description of a new GDM approach in social networks. With the use of set-theoretical operations, method of alternatives ranking in the group assessment of social networks is formalized. A theorem on the conversion from the rating scale of linguistic term set (LTS) into basic LTS (BLTS) rating scale is proved. Using the UML language, a formal model was developed and a key algorithm for conversion of numerical ranks from the LTS scale into the BLTS scale was proposed. A method for extrapolating the values of ranks when the network is scaled is developed, for example, when the number of experts is modified. A case for numerical demonstration of the algorithm is presented.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130832032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631263
Yves Adou, E. Markova, I. Gudkova
According to the latest data from the leading participants in the telecommunications market, such as Cisco Systems, the volume of traffic generated in modern wireless networks is increasing exponentially. The rapid growth of traffic, which appears in the context of providing a wide range of high-quality multimedia services to mobile network users leads to a lack of available radio spectrum. This is becoming a major problem in the development of modern wireless technologies. Mobile network operators offer various methods for solving this problem, such as the frameworks LAA and LSA, which allow more efficient use of available resources in the frequency band. In addition, as part of the implementation of various technologies to provide users services with the required level of QoS, mechanisms for managing radio resources, such as reducing the downlink power and interrupting users services can be applied. Models implementing such mechanisms can be described in the form of a queuing system with unreliable servers. This paper analyzes the performance metrics of a possible scheme for accessing the radio resources of a wireless network implemented through a mechanism for reducing the downlink power and interrupting user service. The mechanism itself is described in the form of a queuing system with unreliable servers, that are affected by a random environment.
{"title":"Performance Measures Analysis of Admission Control Scheme Model for Wireless Network, Described by a Queuing System Operating in Random Environment","authors":"Yves Adou, E. Markova, I. Gudkova","doi":"10.1109/ICUMT.2018.8631263","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631263","url":null,"abstract":"According to the latest data from the leading participants in the telecommunications market, such as Cisco Systems, the volume of traffic generated in modern wireless networks is increasing exponentially. The rapid growth of traffic, which appears in the context of providing a wide range of high-quality multimedia services to mobile network users leads to a lack of available radio spectrum. This is becoming a major problem in the development of modern wireless technologies. Mobile network operators offer various methods for solving this problem, such as the frameworks LAA and LSA, which allow more efficient use of available resources in the frequency band. In addition, as part of the implementation of various technologies to provide users services with the required level of QoS, mechanisms for managing radio resources, such as reducing the downlink power and interrupting users services can be applied. Models implementing such mechanisms can be described in the form of a queuing system with unreliable servers. This paper analyzes the performance metrics of a possible scheme for accessing the radio resources of a wireless network implemented through a mechanism for reducing the downlink power and interrupting user service. The mechanism itself is described in the form of a queuing system with unreliable servers, that are affected by a random environment.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132497502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1109/ICUMT.2018.8631261
V. V. Bochkarev, A. Kryanev, D. S. Smirnov
The paper proposes a structure of a mathematical model for supporting decision-making on the decommissioning of nuclear power facilities. The proposed structure includes a scheme of analysing the various options for decommissioning nuclear power facilities based on a multi-criteria approach. In particular, along with the usual nuclear decommissioning variants (the green-field site restoration and the disposal of radioactive waste on site), the suggested model allows their optimal combination. The model takes into account the uncertainties in the initial data, including data determined expertly, whose uncertainty is described by fuzzy sets. The mathematical decision support model evaluates a large number of indicators of the nuclear facility to be decommissioned, reducing them to several aggregated criteria. Of those the most significant are the composite indicator of potential hazard and the aggregate financial indicator, taking into account the levels of their uncertainty. The proposed scheme allows finding of the optimal variant for decommissioning a nuclear facility that corresponds to the optimal correlation of criteria characterizing the maintenance of values of nuclear and radiation safety indicators and economic indicators of the decommissioned object of nuclear energy use.
{"title":"Mathematical Decision Support Model for the Decommissioning of Nuclear Power Facilities","authors":"V. V. Bochkarev, A. Kryanev, D. S. Smirnov","doi":"10.1109/ICUMT.2018.8631261","DOIUrl":"https://doi.org/10.1109/ICUMT.2018.8631261","url":null,"abstract":"The paper proposes a structure of a mathematical model for supporting decision-making on the decommissioning of nuclear power facilities. The proposed structure includes a scheme of analysing the various options for decommissioning nuclear power facilities based on a multi-criteria approach. In particular, along with the usual nuclear decommissioning variants (the green-field site restoration and the disposal of radioactive waste on site), the suggested model allows their optimal combination. The model takes into account the uncertainties in the initial data, including data determined expertly, whose uncertainty is described by fuzzy sets. The mathematical decision support model evaluates a large number of indicators of the nuclear facility to be decommissioned, reducing them to several aggregated criteria. Of those the most significant are the composite indicator of potential hazard and the aggregate financial indicator, taking into account the levels of their uncertainty. The proposed scheme allows finding of the optimal variant for decommissioning a nuclear facility that corresponds to the optimal correlation of criteria characterizing the maintenance of values of nuclear and radiation safety indicators and economic indicators of the decommissioned object of nuclear energy use.","PeriodicalId":211042,"journal":{"name":"2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133270084","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
扫码关注我们
求助内容：
应助结果提醒方式：