Pub Date : 2019-04-08DOI: 10.1109/ICT.2019.8798819
Hassan Kallam, L. Cardoso, J. Gorce
Topological interference management (TIM) allows studying the degrees of freedom (DoF) of partially connected linear interference communication networks, where the channel state information at the transmitters (CSIT) is restricted to the topology of the network, i.e., a knowledge of which interference links are weak and which are strong. In this paper, we consider TIM for an infinite downlink cellular network in the one-dimensional (1D) linear and the two-dimensional (2D) hexagonal models. We consider uniformly distributed users in each cellular cell, effectively creating a continuous distribution of users, aiming to study user classes based on different interference profiles rather than on actual individual users' positions. We also consider the construction of the TIM network topology by analyzing different interference thresholds. Unlike previous works, we use TIM at the user class level to find the system's DoF independent of the actual user position. Finally, after proposing a fractional coloring scheme that can achieve the optimal DoF solution, a trade-off between DoF and SIR is given.
{"title":"Topological Interference Management: Trade-off Between DoF and SIR for Cellular Systems","authors":"Hassan Kallam, L. Cardoso, J. Gorce","doi":"10.1109/ICT.2019.8798819","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798819","url":null,"abstract":"Topological interference management (TIM) allows studying the degrees of freedom (DoF) of partially connected linear interference communication networks, where the channel state information at the transmitters (CSIT) is restricted to the topology of the network, i.e., a knowledge of which interference links are weak and which are strong. In this paper, we consider TIM for an infinite downlink cellular network in the one-dimensional (1D) linear and the two-dimensional (2D) hexagonal models. We consider uniformly distributed users in each cellular cell, effectively creating a continuous distribution of users, aiming to study user classes based on different interference profiles rather than on actual individual users' positions. We also consider the construction of the TIM network topology by analyzing different interference thresholds. Unlike previous works, we use TIM at the user class level to find the system's DoF independent of the actual user position. Finally, after proposing a fractional coloring scheme that can achieve the optimal DoF solution, a trade-off between DoF and SIR is given.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123481337","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-04-08DOI: 10.1109/ICT.2019.8798841
Wissal Ben Ameur, P. Mary, Marion Dumay, J. Hélard, J. Schwoerer
Sparse code multiple access (SCMA) is a promising non-orthogonal multiple access scheme in order to fulfill the stringent 5G use cases requirements. SCMA can be seen as an improvement of low density signature orthogonal frequency division multiple access that takes advantage of codes sparsity to yield users overload. Generally, SCMA is implemented with message passing algorithm (MPA) at the decoder to benefit from the strong iterative decoding performance. On the other hand, it suffers from high complexity due to the large number of involved exponential operations to compute the log likelihood ratio (LLR). Hence, simplified sub-optimal versions of MPA known as MAX-Log-MPA and Log-MPA were proposed in order to ensure a trade-off between system complexity and performance. This paper presents a comprehensive comparison between those three algorithms in Gaussian and fading channels and precisely explains algorithms performance through a study of the extrinsic information behavior.
{"title":"Performance study of MPA, Log-MPA and MAX-Log-MPA for an uplink SCMA scenario","authors":"Wissal Ben Ameur, P. Mary, Marion Dumay, J. Hélard, J. Schwoerer","doi":"10.1109/ICT.2019.8798841","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798841","url":null,"abstract":"Sparse code multiple access (SCMA) is a promising non-orthogonal multiple access scheme in order to fulfill the stringent 5G use cases requirements. SCMA can be seen as an improvement of low density signature orthogonal frequency division multiple access that takes advantage of codes sparsity to yield users overload. Generally, SCMA is implemented with message passing algorithm (MPA) at the decoder to benefit from the strong iterative decoding performance. On the other hand, it suffers from high complexity due to the large number of involved exponential operations to compute the log likelihood ratio (LLR). Hence, simplified sub-optimal versions of MPA known as MAX-Log-MPA and Log-MPA were proposed in order to ensure a trade-off between system complexity and performance. This paper presents a comprehensive comparison between those three algorithms in Gaussian and fading channels and precisely explains algorithms performance through a study of the extrinsic information behavior.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125394098","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-04-08DOI: 10.1109/ICT.2019.8798778
Salwa Othmen, F. Zarai, A. Belghith
Traditional single hop cellular architecture fails to provide high quality of services (QoS) throughout the cells area due to many constraints such as the strong attenuation of signal with the distance. This signal degradation results in that mobile stations located at the boundaries of cells experience poor QoS level. For that reason, the multi-hop cellular architectures that use the mobile relays and device to device (D2D) communications have been integrated to overcome the limitations of the single hop cellular technology. However, these integrated multi-hop architectures increase significantly the cost at the management and deployment phases as they are based on adding additional entities such as the fixed relays. In addition, exploiting the mobile devices capabilities continuously for a long period in routing data increases the energy consumption and load of such mobile. To overcome this problem, in this paper we propose a new architecture for multi-hop cellular networks. The proposed architecture consists of dividing each cell on a set of clusters comprising the mobiles that are within a pre-specified distance. Then, we apply our proposed algorithm performed by the base station to select the head of each cluster. To evaluate our proposal, extensive simulations are performed using Network Simulator (NS-2) tool.
{"title":"New Architecture for Multi-hop Cellular Networks","authors":"Salwa Othmen, F. Zarai, A. Belghith","doi":"10.1109/ICT.2019.8798778","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798778","url":null,"abstract":"Traditional single hop cellular architecture fails to provide high quality of services (QoS) throughout the cells area due to many constraints such as the strong attenuation of signal with the distance. This signal degradation results in that mobile stations located at the boundaries of cells experience poor QoS level. For that reason, the multi-hop cellular architectures that use the mobile relays and device to device (D2D) communications have been integrated to overcome the limitations of the single hop cellular technology. However, these integrated multi-hop architectures increase significantly the cost at the management and deployment phases as they are based on adding additional entities such as the fixed relays. In addition, exploiting the mobile devices capabilities continuously for a long period in routing data increases the energy consumption and load of such mobile. To overcome this problem, in this paper we propose a new architecture for multi-hop cellular networks. The proposed architecture consists of dividing each cell on a set of clusters comprising the mobiles that are within a pre-specified distance. Then, we apply our proposed algorithm performed by the base station to select the head of each cluster. To evaluate our proposal, extensive simulations are performed using Network Simulator (NS-2) tool.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124492861","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-04-08DOI: 10.1109/ICT.2019.8798772
Xiaoqian Wang, Bei Liu, Xin Su, Xibin Xu, Limin Xiao
Heterogeneous wireless network selection is considered as one of the key technologies to utilize the network resources in next generation communication networks. In this paper, we propose a network selection scheme with multiple traffics based on analytic hierarchy process (AHP) and evolutionary game. The utility function used in this paper is designed as a compromise between available capacity and other network attributes. After analyzing the dynamics of populations' behavior, the existence of evolutionary equilibrium is analyzed and proved by simulations. Simulations show that our scheme has a better performance of per-user switchings than the commonly used AHP scheme.
{"title":"Evolutionary Game based Heterogeneous Wireless Network Selection with Multiple Traffics in 5G","authors":"Xiaoqian Wang, Bei Liu, Xin Su, Xibin Xu, Limin Xiao","doi":"10.1109/ICT.2019.8798772","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798772","url":null,"abstract":"Heterogeneous wireless network selection is considered as one of the key technologies to utilize the network resources in next generation communication networks. In this paper, we propose a network selection scheme with multiple traffics based on analytic hierarchy process (AHP) and evolutionary game. The utility function used in this paper is designed as a compromise between available capacity and other network attributes. After analyzing the dynamics of populations' behavior, the existence of evolutionary equilibrium is analyzed and proved by simulations. Simulations show that our scheme has a better performance of per-user switchings than the commonly used AHP scheme.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130480128","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-04-08DOI: 10.1109/ICT.2019.8798771
Heiko Bornholdt, David Jost, Philipp Kisters, Michel Rottleuthner, Dirk Bade, W. Lamersdorf, T. Schmidt, Mathias Fischer
The increasing urbanization results in a rising demand for smart city platforms that optimize limited resources and thus save resources and increase the quality of living at the same time. Several systems have evolved in the past to address such issues by providing platforms for collecting, sharing, and processing urban data. However, these existing platforms only partially address challenges like fostering the participation of citizens, protecting their privacy, and assuring certain levels of quality of information. In this paper, we present the architecture of SANE as an open, citizen-centric, scalable, and privacy-preserving smart city platform. SANE is intended as open platform on which citizens can contribute data but also hardware, without any central authority or control. Moreover, citizens maintain full control on their data and its usage. SANE comes with rich and distributed data analytics functionality that is intended to help citizens to answer data-related question in the context of smart cities.
{"title":"SANE: Smart Networks for Urban Citizen Participation","authors":"Heiko Bornholdt, David Jost, Philipp Kisters, Michel Rottleuthner, Dirk Bade, W. Lamersdorf, T. Schmidt, Mathias Fischer","doi":"10.1109/ICT.2019.8798771","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798771","url":null,"abstract":"The increasing urbanization results in a rising demand for smart city platforms that optimize limited resources and thus save resources and increase the quality of living at the same time. Several systems have evolved in the past to address such issues by providing platforms for collecting, sharing, and processing urban data. However, these existing platforms only partially address challenges like fostering the participation of citizens, protecting their privacy, and assuring certain levels of quality of information. In this paper, we present the architecture of SANE as an open, citizen-centric, scalable, and privacy-preserving smart city platform. SANE is intended as open platform on which citizens can contribute data but also hardware, without any central authority or control. Moreover, citizens maintain full control on their data and its usage. SANE comes with rich and distributed data analytics functionality that is intended to help citizens to answer data-related question in the context of smart cities.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127149339","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-04-08DOI: 10.1109/ICT.2019.8798767
Minh Le Nguyen, Vu-Duc Ngo, X. Tran, Minh-Tuan Le
This paper investigates design and implementation of the signal processing unit for the relay node in a two-way relay multiple-input multiple-output spatial division multiplexing (MIMO-SDM) system using physical-layer network coding (PNC), reffered to as MIMO-SDM-PNC. Based on Field-programmable gate array (FPGA) platform, two processing architectures for zero-forcing (ZF) and minimum mean square error (MMSE) detector are proposed for the relay node. Using the standard pipe-lining and the parallel computing methodologies, a novel architecture is developed in order to achieve low latency and low-area occupation for FPGA implementation. The proposed architecture has been composed in Verilog language and synthesized on the ISE tool for Xilinx FPGA Virtex 7. Experimental results demonstrate that the proposed design offers high performance in terms of low latency and high throughput.
{"title":"Design and Implementation of Signal Processing Unit for Two-Way Relay Node in MIMO-SDM-PNC System","authors":"Minh Le Nguyen, Vu-Duc Ngo, X. Tran, Minh-Tuan Le","doi":"10.1109/ICT.2019.8798767","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798767","url":null,"abstract":"This paper investigates design and implementation of the signal processing unit for the relay node in a two-way relay multiple-input multiple-output spatial division multiplexing (MIMO-SDM) system using physical-layer network coding (PNC), reffered to as MIMO-SDM-PNC. Based on Field-programmable gate array (FPGA) platform, two processing architectures for zero-forcing (ZF) and minimum mean square error (MMSE) detector are proposed for the relay node. Using the standard pipe-lining and the parallel computing methodologies, a novel architecture is developed in order to achieve low latency and low-area occupation for FPGA implementation. The proposed architecture has been composed in Verilog language and synthesized on the ISE tool for Xilinx FPGA Virtex 7. Experimental results demonstrate that the proposed design offers high performance in terms of low latency and high throughput.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077371","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-04-08DOI: 10.1109/ICT.2019.8798816
Hung Ta Minh Nhat, Vinh Truong Hoang
Face recognition is the most active research topics in machine vision because of its highly secured demands. The fusion of multiple features can enhance the accuracy of face recognition systems instead of using only one type of feature. However, this leads to increase the storage and processing time. In this work, we apply feature fusion by using Canonical Correlation Analysis to concatenate two different feature sources for coding a facial image. Three popular descriptors (LBP, HOG, GIST) have been investigated for extracting facial features based on block division.
{"title":"Feature fusion by using LBP, HOG, GIST descriptors and Canonical Correlation Analysis for face recognition","authors":"Hung Ta Minh Nhat, Vinh Truong Hoang","doi":"10.1109/ICT.2019.8798816","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798816","url":null,"abstract":"Face recognition is the most active research topics in machine vision because of its highly secured demands. The fusion of multiple features can enhance the accuracy of face recognition systems instead of using only one type of feature. However, this leads to increase the storage and processing time. In this work, we apply feature fusion by using Canonical Correlation Analysis to concatenate two different feature sources for coding a facial image. Three popular descriptors (LBP, HOG, GIST) have been investigated for extracting facial features based on block division.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"251 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115590155","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-04-08DOI: 10.1109/ICT.2019.8798785
F. Wetzels, H. V. D. Berg, J. Bosman, R. Mei
In service function chaining, data flows from a particular application or user travel along a pre-defined sequence of network functions. Appropriate service function chaining resource allocation is required to comply with the service level required by the application. In this paper, we introduce a dynamic priority assignment for flows that compete for service using a particular network function in a chain. Using the recent results of the performance metrics of transient birth–death processes, we analyse this priority assignment and develop an optimal strategy for selecting a (cheap) low- or (expensive) high-priority service, given the flow's service level agreement requirements. A decision table can, thus, be created to facilitate the fast, online priority scheduling of newly arriving flows requesting service.
{"title":"Dynamic priority assignment for SLA compliance in service function chains","authors":"F. Wetzels, H. V. D. Berg, J. Bosman, R. Mei","doi":"10.1109/ICT.2019.8798785","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798785","url":null,"abstract":"In service function chaining, data flows from a particular application or user travel along a pre-defined sequence of network functions. Appropriate service function chaining resource allocation is required to comply with the service level required by the application. In this paper, we introduce a dynamic priority assignment for flows that compete for service using a particular network function in a chain. Using the recent results of the performance metrics of transient birth–death processes, we analyse this priority assignment and develop an optimal strategy for selecting a (cheap) low- or (expensive) high-priority service, given the flow's service level agreement requirements. A decision table can, thus, be created to facilitate the fast, online priority scheduling of newly arriving flows requesting service.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117061764","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-04-08DOI: 10.1109/ICT.2019.8798863
Georgios A. Dafoulas, Jerome Samuels-Clarke, C. Maia, Almaas A. Ali, Ariadni Tsiakara
The Internet of Things (IoT) has evolved into a mainstream keyword describing the use of interconnected device for data transfer. The authors present their current research study that aims at collecting biometric data from learners and using them for providing innovative feedback for a number of learning tasks. The paper discusses how measuring Galvanic Skin Response heartbeat rate and voice patterns can help to provide an alternative type of learner support. The discussion also covers how biometrics data are filtered by applying a number of profiling techniques to classify learners in different groupings. The paper also briefly touches on hardware aspects of the work carried out, as well as analysis of data sets from a student cohort.
{"title":"Offering smarter learning support through the use of biometrics","authors":"Georgios A. Dafoulas, Jerome Samuels-Clarke, C. Maia, Almaas A. Ali, Ariadni Tsiakara","doi":"10.1109/ICT.2019.8798863","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798863","url":null,"abstract":"The Internet of Things (IoT) has evolved into a mainstream keyword describing the use of interconnected device for data transfer. The authors present their current research study that aims at collecting biometric data from learners and using them for providing innovative feedback for a number of learning tasks. The paper discusses how measuring Galvanic Skin Response heartbeat rate and voice patterns can help to provide an alternative type of learner support. The discussion also covers how biometrics data are filtered by applying a number of profiling techniques to classify learners in different groupings. The paper also briefly touches on hardware aspects of the work carried out, as well as analysis of data sets from a student cohort.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126644948","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-04-08DOI: 10.1109/ICT.2019.8798828
Bowei Li, Yongzheng Zhang, Junliang Yao, Tao Yin
Malware has always threatened the security of networks and computer systems. The traditional methods for malware detection are signature-based with manually designed rules. Some recent methods involving static or dynamic analysis require professional tools to extract features, while feature engineering is time-consuming and labor-intensive. In this paper, we propose MDBA, the Malware Detection based on Association mining method. Our approach only takes bytes n-grams from PE binaries as features, which can be easily obtained. By mining the n-gram features, we can produce association rules that satisfy the minimum support and the minimum confidence constraints. Based on the association rules, a classifier is built to detect whether a PE executable is malicious or not. To demonstrate the capability of our MDBA approach, we organize a large dataset with more than 10,000 PE files and conduct series of experiments on the dataset. The results show that our approach not only achieves high performance of malware detection, but also is capable of discovering malware of unknown types.
{"title":"MDBA: Detecting Malware based on Bytes N-Gram with Association Mining","authors":"Bowei Li, Yongzheng Zhang, Junliang Yao, Tao Yin","doi":"10.1109/ICT.2019.8798828","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798828","url":null,"abstract":"Malware has always threatened the security of networks and computer systems. The traditional methods for malware detection are signature-based with manually designed rules. Some recent methods involving static or dynamic analysis require professional tools to extract features, while feature engineering is time-consuming and labor-intensive. In this paper, we propose MDBA, the Malware Detection based on Association mining method. Our approach only takes bytes n-grams from PE binaries as features, which can be easily obtained. By mining the n-gram features, we can produce association rules that satisfy the minimum support and the minimum confidence constraints. Based on the association rules, a classifier is built to detect whether a PE executable is malicious or not. To demonstrate the capability of our MDBA approach, we organize a large dataset with more than 10,000 PE files and conduct series of experiments on the dataset. The results show that our approach not only achieves high performance of malware detection, but also is capable of discovering malware of unknown types.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131228149","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
扫码关注我们
求助内容：
应助结果提醒方式：