Pub Date : 2017-10-01DOI: 10.1109/ICCSNT.2017.8343748
P. He, Hongli Chang, Han Gao, ZiYi Wang
Measuring Film Thickness is not only an important part for controlling the precision of the products, but also can reduce the cost. This system is based on the core processor (TMS32-0F2812), and it has four parts: optical signal driving circuit, analog signal acquisition and processing circuit, data sampling and processing circuit and human machine interaction. This system uses CCS software development platform as its software development environment, and it meets all functional requirements through programming and debugging.
{"title":"The online system of measuring film thickness","authors":"P. He, Hongli Chang, Han Gao, ZiYi Wang","doi":"10.1109/ICCSNT.2017.8343748","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343748","url":null,"abstract":"Measuring Film Thickness is not only an important part for controlling the precision of the products, but also can reduce the cost. This system is based on the core processor (TMS32-0F2812), and it has four parts: optical signal driving circuit, analog signal acquisition and processing circuit, data sampling and processing circuit and human machine interaction. This system uses CCS software development platform as its software development environment, and it meets all functional requirements through programming and debugging.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134274575","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-10-01DOI: 10.1109/ICCSNT.2017.8343703
Ming Huang, Wenju Yang, Xu Liang
The background of this paper is pursuing the shortest total processing time of job shop scheduling problem. The research is inspired by the Migrating Bird Optimization (MBO) algorithm. In order to improve the local search capability, the Particle Swarm Optimization (PSO) algorithm is combined with the MBO algorithm to optimize the efficiency of the PSO algorithm. MBO algorithm is a new Neighborhood Search algorithm, which simulates the V formation in birds during migration, and optimizes the algorithm by reducing energy consumption. The algorithm starts with a certain number of parallel solutions, so individuals in the population can not only find the better solution from their own neighborhood, but also find the better solution from the previous individual neighborhood, which makes it quick to find the optimal solution. In this paper, we add the MBO algorithm in the PSO algorithm to update the individual and global extremes of the particles by increasing the information of other particles in the neighborhood of the common particle, adjusting the flight state to achieve a larger search range and global finest solution. Compared with the PSO algorithm in the literature [9], the convergence of this algorithm is more obvious, the number of trapped in local optimal solution is decreased significantly. Paper is divided into four parts, the first is the introduction, the second one introduces the mathematical model of job shop scheduling, the third part mixes the MBO algorithm with the PSO algorithm, and the last is the experimental analysis of the algorithm.
{"title":"The application of hybrid Particle Swarm Optimization in job shop scheduling problem","authors":"Ming Huang, Wenju Yang, Xu Liang","doi":"10.1109/ICCSNT.2017.8343703","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343703","url":null,"abstract":"The background of this paper is pursuing the shortest total processing time of job shop scheduling problem. The research is inspired by the Migrating Bird Optimization (MBO) algorithm. In order to improve the local search capability, the Particle Swarm Optimization (PSO) algorithm is combined with the MBO algorithm to optimize the efficiency of the PSO algorithm. MBO algorithm is a new Neighborhood Search algorithm, which simulates the V formation in birds during migration, and optimizes the algorithm by reducing energy consumption. The algorithm starts with a certain number of parallel solutions, so individuals in the population can not only find the better solution from their own neighborhood, but also find the better solution from the previous individual neighborhood, which makes it quick to find the optimal solution. In this paper, we add the MBO algorithm in the PSO algorithm to update the individual and global extremes of the particles by increasing the information of other particles in the neighborhood of the common particle, adjusting the flight state to achieve a larger search range and global finest solution. Compared with the PSO algorithm in the literature [9], the convergence of this algorithm is more obvious, the number of trapped in local optimal solution is decreased significantly. Paper is divided into four parts, the first is the introduction, the second one introduces the mathematical model of job shop scheduling, the third part mixes the MBO algorithm with the PSO algorithm, and the last is the experimental analysis of the algorithm.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121245265","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-10-01DOI: 10.1109/ICCSNT.2017.8343474
Simin Yu, Yuqing Lan, Chaoying Wu, Tao Han
A vital advantage of virtual machines (VMs) is live migration — the ability to transfer VMs from one physical machine to another as the VMs continue to offer service. Some well-known techniques have been proposed for live migration, such as pre-copy and post-copy. Unfortunately, these classical techniques are not agile enough in the face of complicated workloads since they are designed to work well in a specific workload. When the workloads of VMs get complicated, even a good migration algorithm may not run very well. This paper proposes an agile framework which determines the type of workloads of a VM by learning the statistics of usages of memory pages and then the framework chooses an appropriate improved algorithm to complete a VM live migration. The experimental results show that the framework is able to identify the type of workloads, and improves the performance of VM live migration.
{"title":"An agile framework adaptive to complicated memory workloads for VM migration","authors":"Simin Yu, Yuqing Lan, Chaoying Wu, Tao Han","doi":"10.1109/ICCSNT.2017.8343474","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343474","url":null,"abstract":"A vital advantage of virtual machines (VMs) is live migration — the ability to transfer VMs from one physical machine to another as the VMs continue to offer service. Some well-known techniques have been proposed for live migration, such as pre-copy and post-copy. Unfortunately, these classical techniques are not agile enough in the face of complicated workloads since they are designed to work well in a specific workload. When the workloads of VMs get complicated, even a good migration algorithm may not run very well. This paper proposes an agile framework which determines the type of workloads of a VM by learning the statistics of usages of memory pages and then the framework chooses an appropriate improved algorithm to complete a VM live migration. The experimental results show that the framework is able to identify the type of workloads, and improves the performance of VM live migration.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122507578","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-10-01DOI: 10.1109/ICCSNT.2017.8343747
Yanyan Wang, Yingsong Li, Rui Yang
An improved sparse l2 and lp norm error criterion algorithm (L2LP) is carried out by incorporating a p-norm like penalty into the cost function of the L2LP algorithm to fully utilize the prior information of the multi-path fading selective channel. The p-norm-like penalty is split into l0- and l1-norm constraints for large and small channel response coefficients for constructing the l0- and l1-norm constrained L2LP (L0L1-L2LP) algorithm. Two different zero attractors are exerted on the large and small coefficients, respectively. Furthermore, a reweighting factor is incorporated into the L0L1-L2LP algorithm to construct an enhanced algorithm named as reweighted L0L1-L2LP (RL0L1-L2LP) algorithm. The derivations of both sparse L2LP algorithms are introduced in detail. Numerical simulation samples are set up to discuss the channel estimation performance of our proposed L0L1-L2LP and RL0L1-L2LP algorithms. The obtained results give a confirmation that the proposed L0L1-L2LP and RL0L1-L2LP algorithms outperform the L2LP and the related L2LP algorithms in light of the convergence and steady-state performance for handling sparse channel estimation.
{"title":"Sparse adaptive L2LP algorithms with mixture norm constraint for multi-path channel estimation","authors":"Yanyan Wang, Yingsong Li, Rui Yang","doi":"10.1109/ICCSNT.2017.8343747","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343747","url":null,"abstract":"An improved sparse l2 and lp norm error criterion algorithm (L2LP) is carried out by incorporating a p-norm like penalty into the cost function of the L2LP algorithm to fully utilize the prior information of the multi-path fading selective channel. The p-norm-like penalty is split into l0- and l1-norm constraints for large and small channel response coefficients for constructing the l0- and l1-norm constrained L2LP (L0L1-L2LP) algorithm. Two different zero attractors are exerted on the large and small coefficients, respectively. Furthermore, a reweighting factor is incorporated into the L0L1-L2LP algorithm to construct an enhanced algorithm named as reweighted L0L1-L2LP (RL0L1-L2LP) algorithm. The derivations of both sparse L2LP algorithms are introduced in detail. Numerical simulation samples are set up to discuss the channel estimation performance of our proposed L0L1-L2LP and RL0L1-L2LP algorithms. The obtained results give a confirmation that the proposed L0L1-L2LP and RL0L1-L2LP algorithms outperform the L2LP and the related L2LP algorithms in light of the convergence and steady-state performance for handling sparse channel estimation.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"1 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131527363","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-10-01DOI: 10.1109/ICCSNT.2017.8343482
Yaoting Yue, Shunfang Wang
Feature representation contains the more plentiful information of original protein sequence, the more beneficial for protein sub-nuclear localization. Inspired by this idea, this paper proposed a novel two-feature integration method, whose fusion parameter was optimized via the particle swarm optimization algorithm (PSO), for obtaining a more effective representation. Therefore, a new fusion representation, called AACPSSM, would be formed by integrating two kinds of single feature expression, amino acid composition (AAC) and position specific scoring matrix (PSSM). Due to the high dimensional characteristics of protein data, kernel linear discriminant analysis (KLDA) was used to conduct the data dimension reduction. Last, to evaluate validity of our proposed approach, a benchmark dataset and KNN classifier were used to carry out the numerical experiments. And the final Jackknife test experimental results prove that our proposed fusion representation AACPSSM largely outperforms the single one, AAC and PSSM.
特征表示包含的蛋白质原始序列信息越丰富，越有利于蛋白质亚核定位。受此启发，本文提出了一种新的双特征融合方法，并通过粒子群优化算法(PSO)优化融合参数，以获得更有效的表征。因此，将氨基酸组成(AAC)和位置特定评分矩阵(PSSM)这两种单特征表达进行整合，形成一种新的融合表示，称为AACPSSM。由于蛋白质数据的高维特征，采用核线性判别分析(kernel linear discriminant analysis, KLDA)进行数据降维。最后，利用基准数据集和KNN分类器进行了数值实验，以评估所提方法的有效性。最后的Jackknife测试实验结果证明了我们提出的融合表示AACPSSM在很大程度上优于单一的AAC和PSSM。
{"title":"Optimizing effective fusion representation by particle swarm optimization algorithm for protein sub-nuclear location","authors":"Yaoting Yue, Shunfang Wang","doi":"10.1109/ICCSNT.2017.8343482","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343482","url":null,"abstract":"Feature representation contains the more plentiful information of original protein sequence, the more beneficial for protein sub-nuclear localization. Inspired by this idea, this paper proposed a novel two-feature integration method, whose fusion parameter was optimized via the particle swarm optimization algorithm (PSO), for obtaining a more effective representation. Therefore, a new fusion representation, called AACPSSM, would be formed by integrating two kinds of single feature expression, amino acid composition (AAC) and position specific scoring matrix (PSSM). Due to the high dimensional characteristics of protein data, kernel linear discriminant analysis (KLDA) was used to conduct the data dimension reduction. Last, to evaluate validity of our proposed approach, a benchmark dataset and KNN classifier were used to carry out the numerical experiments. And the final Jackknife test experimental results prove that our proposed fusion representation AACPSSM largely outperforms the single one, AAC and PSSM.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130802502","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-10-01DOI: 10.1109/ICCSNT.2017.8343725
Yuanyuan Sun, Yongming Wang, Lili Guo, Zhongsong Ma, Huiping Wang
The backbone network of the Space Information Network (SIN) contains high orbit satellites, medium orbit satellites and low earth orbit satellites. The fault detection and diagnosis capability of backbone network is the key to the healthy operation of SIN. In this paper, we present a test model for fault detection of backbone network, adopting the way of clustering to classify satellites to different clusters for the convenience to manage the backbone network. Specially, each cluster has fixed topology. It is very handy for fault detection. We exploit FTA (fault tree analysis) to analyze the fault of SIN from a testing model of satellite backbone network. And by FTA analysis, a fault detection design of GEO/MEO/LEO network is proposed. It is practical and easy to implement in engineering.
{"title":"A fault detection design for clustered space information network based on FTA","authors":"Yuanyuan Sun, Yongming Wang, Lili Guo, Zhongsong Ma, Huiping Wang","doi":"10.1109/ICCSNT.2017.8343725","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343725","url":null,"abstract":"The backbone network of the Space Information Network (SIN) contains high orbit satellites, medium orbit satellites and low earth orbit satellites. The fault detection and diagnosis capability of backbone network is the key to the healthy operation of SIN. In this paper, we present a test model for fault detection of backbone network, adopting the way of clustering to classify satellites to different clusters for the convenience to manage the backbone network. Specially, each cluster has fixed topology. It is very handy for fault detection. We exploit FTA (fault tree analysis) to analyze the fault of SIN from a testing model of satellite backbone network. And by FTA analysis, a fault detection design of GEO/MEO/LEO network is proposed. It is practical and easy to implement in engineering.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127501731","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-10-01DOI: 10.1109/ICCSNT.2017.8343466
Yiqing Xu, Changwei Bi, Guoxin Wu, Fuquan Zhang, Suyun Wei, Anna Jiang, Ning Ye
Background: As a convenient experimental target with high research value, willow (salix) has been sequenced recently, and related research based on comparative genetics developed correspondingly. Materials and Methods: In this paper, the strength of completeness of model specie, Arabidopsis thaliana, is applied to the innovative prediction, and by using verified protein database and motif annotation in homologous analysis, motif of Salix suchowensis is annotated. Result: We published a genome-wide DNA motif prediction of S. suchowensis, and manually verified the first 100 genes with the homologous Arabidopsis thaliana motif annotations. Unexpectedly, several motif predictions are detected in the intron region and an interesting but conflicting finding shows that the common belief of that, the motifs are in the region of 100∼1000bp upstream the gene, awaits further verifying. Conclusion: This new DNA motif prediction of willow is helpful for constructing a scaffolding guideline in regulatory network study of forestry plants, and the further research of related findings is needed.
{"title":"DNA motif prediction of Shrub Willow (suchowensis) through comparative genetic approach","authors":"Yiqing Xu, Changwei Bi, Guoxin Wu, Fuquan Zhang, Suyun Wei, Anna Jiang, Ning Ye","doi":"10.1109/ICCSNT.2017.8343466","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343466","url":null,"abstract":"Background: As a convenient experimental target with high research value, willow (salix) has been sequenced recently, and related research based on comparative genetics developed correspondingly. Materials and Methods: In this paper, the strength of completeness of model specie, Arabidopsis thaliana, is applied to the innovative prediction, and by using verified protein database and motif annotation in homologous analysis, motif of Salix suchowensis is annotated. Result: We published a genome-wide DNA motif prediction of S. suchowensis, and manually verified the first 100 genes with the homologous Arabidopsis thaliana motif annotations. Unexpectedly, several motif predictions are detected in the intron region and an interesting but conflicting finding shows that the common belief of that, the motifs are in the region of 100∼1000bp upstream the gene, awaits further verifying. Conclusion: This new DNA motif prediction of willow is helpful for constructing a scaffolding guideline in regulatory network study of forestry plants, and the further research of related findings is needed.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114623578","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-10-01DOI: 10.1109/ICCSNT.2017.8343696
Zhiping Wang
Interactive learning, which is based on data mining, is a hot issue and has attracted considerable attention recently. in this paper, we propose an Eigenvector Label Propagation Algorithm (ELPA), which is improved from Label Propagation Algorithm and solves three problems existing in original algorithm. The efficiency is improved greatly because of the introducing of 2-bit eigenvector label, which can reduce the size of exchanging data significantly. We compare the ELPA with GN and BMLPA on two famous benchmarks, and the experimental results show that the groups detected by ELPA are almost identical to the communities discovered by other LPA algorithms.
{"title":"Eigenvector label propagation algorithm for interactive learning in student groups based on student social network","authors":"Zhiping Wang","doi":"10.1109/ICCSNT.2017.8343696","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343696","url":null,"abstract":"Interactive learning, which is based on data mining, is a hot issue and has attracted considerable attention recently. in this paper, we propose an Eigenvector Label Propagation Algorithm (ELPA), which is improved from Label Propagation Algorithm and solves three problems existing in original algorithm. The efficiency is improved greatly because of the introducing of 2-bit eigenvector label, which can reduce the size of exchanging data significantly. We compare the ELPA with GN and BMLPA on two famous benchmarks, and the experimental results show that the groups detected by ELPA are almost identical to the communities discovered by other LPA algorithms.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114848512","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-10-01DOI: 10.1109/ICCSNT.2017.8343740
Daofang Zhang
In all kinds of marking process on objective questions, manual grading is not only a heavy workload, but also occurrs error because of people's fatigue. Therefore, a novel approach is proposed in this paper. Firstly, the special answer card of examination paper is projected several times so that each option is split out from each line. Secondly, the center of gravity for each option is calculated and the circle with the center of gravity as the center and r as the radius is defined. In the end, the number of white dots in the circle is counted, the largest number is the chosen answer. The experimental results show that this method is effective for the given sample.
{"title":"The algorithm of objective questions marking system based on projection method","authors":"Daofang Zhang","doi":"10.1109/ICCSNT.2017.8343740","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343740","url":null,"abstract":"In all kinds of marking process on objective questions, manual grading is not only a heavy workload, but also occurrs error because of people's fatigue. Therefore, a novel approach is proposed in this paper. Firstly, the special answer card of examination paper is projected several times so that each option is split out from each line. Secondly, the center of gravity for each option is calculated and the circle with the center of gravity as the center and r as the radius is defined. In the end, the number of white dots in the circle is counted, the largest number is the chosen answer. The experimental results show that this method is effective for the given sample.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115607571","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-10-01DOI: 10.1109/ICCSNT.2017.8343731
Zhiyong Du, Dong-hua Liu, Lijie Yin
Improving users' quality of experience (QoE) has become a consensus in wireless communications. Although the wireless network technology keeps evolving from 3G to 4G and the foreseeable 5G, QoE assurance in service provisioning is still a challenging task, partly due to the complicated mechanism in optimizing QoE. In this paper, we present a concept of QoE-oriented optimization for resource allocation and network configuration (RA-NC) in communications and networks. The QoE-oriented optimization is not a simple change in optimization goal from QoS to QoE of traditional QoS-oriented optimization, but a systematic rethink on the impacts of QoE on RA-NC problem. First, we introduce the main idea of QoE-oriented optimization from the perspective of RA-NC optimization modeling. Then, detailed principles, requirements and challenges are explained for QoE-oriented optimization. Finally, we envision an end-to-end QoE optimization framework, where the smartphone explores real-time users' QoE feedback data captured by sensors to improve user's QoE in an online, model-freed manner.
{"title":"User in the loop: QoE-oriented optimization in communication and networks","authors":"Zhiyong Du, Dong-hua Liu, Lijie Yin","doi":"10.1109/ICCSNT.2017.8343731","DOIUrl":"https://doi.org/10.1109/ICCSNT.2017.8343731","url":null,"abstract":"Improving users' quality of experience (QoE) has become a consensus in wireless communications. Although the wireless network technology keeps evolving from 3G to 4G and the foreseeable 5G, QoE assurance in service provisioning is still a challenging task, partly due to the complicated mechanism in optimizing QoE. In this paper, we present a concept of QoE-oriented optimization for resource allocation and network configuration (RA-NC) in communications and networks. The QoE-oriented optimization is not a simple change in optimization goal from QoS to QoE of traditional QoS-oriented optimization, but a systematic rethink on the impacts of QoE on RA-NC problem. First, we introduce the main idea of QoE-oriented optimization from the perspective of RA-NC optimization modeling. Then, detailed principles, requirements and challenges are explained for QoE-oriented optimization. Finally, we envision an end-to-end QoE optimization framework, where the smartphone explores real-time users' QoE feedback data captured by sensors to improve user's QoE in an online, model-freed manner.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123709886","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
扫码关注我们
求助内容：
应助结果提醒方式：