2017 6th International Conference on Computer Science and Network Technology (ICCSNT)最新文献_第6页

The online system of measuring film thickness 薄膜厚度在线测量系统

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343748

P. He, Hongli Chang, Han Gao, ZiYi Wang

引用次数: 0

The application of hybrid Particle Swarm Optimization in job shop scheduling problem 混合粒子群算法在作业车间调度问题中的应用

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343703

Ming Huang, Wenju Yang, Xu Liang

{"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}

引用次数: 2

An agile framework adaptive to complicated memory workloads for VM migration 一个灵活的框架，适应复杂的内存工作负载的虚拟机迁移

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343474

Simin Yu, Yuqing Lan, Chaoying Wu, Tao Han

引用次数: 1

Sparse adaptive L2LP algorithms with mixture norm constraint for multi-path channel estimation 多径信道估计的混合范数约束稀疏自适应L2LP算法

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343747

Yanyan Wang, Yingsong Li, Rui Yang

{"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}

引用次数: 0

Optimizing effective fusion representation by particle swarm optimization algorithm for protein sub-nuclear location 利用粒子群算法优化蛋白质亚核定位的有效融合表示

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343482

Yaoting Yue, Shunfang Wang

引用次数: 0

A fault detection design for clustered space information network based on FTA 基于FTA的集群空间信息网络故障检测设计

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343725

Yuanyuan Sun, Yongming Wang, Lili Guo, Zhongsong Ma, Huiping Wang

引用次数: 1

DNA motif prediction of Shrub Willow (suchowensis) through comparative genetic approach 用比较遗传学方法预测灌木柳树DNA基序

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343466

Yiqing Xu, Changwei Bi, Guoxin Wu, Fuquan Zhang, Suyun Wei, Anna Jiang, Ning Ye

{"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}

引用次数: 0

Eigenvector label propagation algorithm for interactive learning in student groups based on student social network 基于学生社交网络的学生群体互动学习特征向量标签传播算法

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343696

Zhiping Wang

引用次数: 2

The algorithm of objective questions marking system based on projection method 基于投影法的客观题阅卷系统算法

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343740

Daofang Zhang

引用次数: 0

User in the loop: QoE-oriented optimization in communication and networks 用户在循环中:通信和网络面向qos的优化

2017 6th International Conference on Computer Science and Network Technology (ICCSNT) Pub Date : 2017-10-01 DOI: 10.1109/ICCSNT.2017.8343731

Zhiyong Du, Dong-hua Liu, Lijie Yin

引用次数: 2