发布求助
文献互助 智能选刊 最新文献

2016 Sixth International Conference on Information Science and Technology (ICIST)最新文献

筛选
英文 中文
Time delay estimation based on fractional lower order Wigner-Ville distribution 基于分数阶Wigner-Ville分布的时延估计
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483471
Su Yongmei, Wang Fuzhang, Qiu Tianshuang
{"title":"Time delay estimation based on fractional lower order Wigner-Ville distribution","authors":"Su Yongmei, Wang Fuzhang, Qiu Tianshuang","doi":"10.1109/ICIST.2016.7483471","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483471","url":null,"abstract":"Time-frequency analysis is the important tool in signal processing, especially for non-stationary signals. When the interesting signals contaminated by impulsive noises, conventional time-frequency analysis method degenerate seriously because of lacking of limited second moment. In order to solve the degeneration of the estimation algorithm under non-Gaussian impulsive noise environment, the improved time delay estimation algorithm using fractional lower order Wigner-Ville distribution is proposed in this paper. Theoretical analysis and computer experiment demonstrates that the new algorithm has improved performance compared with conventional time-frequency analysis method.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122239410","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
Research and improvement of Apriori algorithm Apriori算法的研究与改进
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483396
Jiaoling Du, Xiangli Zhang, Hongmei Zhang, Lei Chen
{"title":"Research and improvement of Apriori algorithm","authors":"Jiaoling Du, Xiangli Zhang, Hongmei Zhang, Lei Chen","doi":"10.1109/ICIST.2016.7483396","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483396","url":null,"abstract":"Apriori algorithm is a classical association rule mining algorithm, but it has problems about frequently scanning database and generating a large number of candidate sets. To solve these problems, an improved DC_Apriori algorithm was proposed, which restructured the storage structure of the database, improved connection of frequent item sets, the generation of k-frequent item sets is only need to join the 1-frequent item sets with k-1-frequent item sets, greatly reduced the number of connections and it can directly get frequent item sets by only one pruning operation, effectively avoid the unnecessary invalid candidate sets, and greatly reduce the number of scanning the database and improve the efficiency of frequent item sets generation. It has proved by experiments that the DC_Apriori algorithm is obviously superior to the Apriori algorithm and the MC_Apriori algorithm based on the matrix, whether in small support degree or in the intensive database with large numbers of transactions and items, the running time of DC_Apriori to get the same result is significantly less than the Apriori algorithm and MC_Apriori algorithm based on the matrix.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132801413","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}
引用次数: 19
Multilayer correlation maximization for frequency recognition in SSVEP brain-computer interface 基于多层相关最大化的SSVEP脑机接口频率识别
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483381
Yong Jiao, Yu Zhang, Jing Jin, Xingyu Wang
{"title":"Multilayer correlation maximization for frequency recognition in SSVEP brain-computer interface","authors":"Yong Jiao, Yu Zhang, Jing Jin, Xingyu Wang","doi":"10.1109/ICIST.2016.7483381","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483381","url":null,"abstract":"Multiset canonical correlation analysis (MsetCCA) has been applied to optimize the reference signals by extracting common features in multiple sets of EEG for steady-state visual evoked potential (SSVEP) recognition. To avoid extracting the possible noise components as common features in the MsetCCA method, this study proposes an algorithm called multilayer correlation maximization (MCM) to take advantages of both the CCA method and the MsetCCA method for improving SSVEP recognition accuracy. MCM carries out three layers of correlation maximization processes: (1) correlates the original EEG data with stimulus frequency, (2) optimizes the reference signals by common features, (3) correlates the reference signals with frequency again. Experimental study is implemented to validate effectiveness of the proposed MCM method. The results indicate that the MCM method outperforms both CCA and MsetCCA for SSVEP recognition.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132866527","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}
引用次数: 7
Hopf bifurcation and chaos in the time-delay Chua's circuit 延时蔡氏电路的Hopf分岔与混沌
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483433
Xingran Liao, Nankun Mu
{"title":"Hopf bifurcation and chaos in the time-delay Chua's circuit","authors":"Xingran Liao, Nankun Mu","doi":"10.1109/ICIST.2016.7483433","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483433","url":null,"abstract":"In this paper, we study that the system consists of a lossless transmission line which terminated with a Chua's diode and a lumped parallel capacitance on one end. Furthermore, such a system is described by a partial differential equation (wave equation) with nonlinear boundary conditions. By introducing the d'Alembert formula of the wave equation, the equation describing Chua's circuit with a lossless transmission line is transformed to a nonlinear differential-difference equation (i.e., neutral-type differential equation). Based on the works of Pontryagin, we derive a criterion for the stability of a steady-state solution and sufficient conditions for the existence of a periodic solution generated by a Hopf bifurcation. We numerically analyze the dynamical behavior of the time-delay Chua's circuit with a three-order polynomial for the case of C1 ≠ 0 by computer simulations. We find the time-delay Chua's circuit exhibits various chaotic behaviors including a Double Scroll attractor. A bifurcation diagram that classifies the attractors in the parameter plane is presented.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133115318","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}
引用次数: 1
A high-efficient fault attack on AES S-box AES S-box的高效故障攻击
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483412
Nan Liao, Xiaoxin Cui, Tian Wang, Kai Liao, Dunshan Yu, Xiaole Cui
{"title":"A high-efficient fault attack on AES S-box","authors":"Nan Liao, Xiaoxin Cui, Tian Wang, Kai Liao, Dunshan Yu, Xiaole Cui","doi":"10.1109/ICIST.2016.7483412","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483412","url":null,"abstract":"A high-efficient fault attack on AES S-box is proposed in this paper. Faults are introduced in the encryption process by changing the mapping relationship of S-box. Based on the round in which the faults are introduced, two fault models are presented. Attack results show that the first model only needs 16 faulty ciphertexts to recover the 128-bit secret key. The second fault model is more efficient. In this model, two rounds of attacks are enough to find out the 4-byte round-key based on DFA on the 9th round S-box. For covering all the possible fault situations, influence of multi-byte faults are considered, which effectively improves the attack accuracy and reduces the attack rounds. Compared with previous fault models, our work in this paper shows significant advantage of efficiency.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117319154","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}
引用次数: 5
Estimating transaction execution times for a software transactional memory 估计软件事务性内存的事务执行时间
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483399
M. Popovic, B. Kordic, I. Basicevic
{"title":"Estimating transaction execution times for a software transactional memory","authors":"M. Popovic, B. Kordic, I. Basicevic","doi":"10.1109/ICIST.2016.7483399","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483399","url":null,"abstract":"Over the last two decades, researchers developed many software, hardware, and hybrid Transactional Memories (TMs) with various APIs and semantics. However, reduced performance when exposed to high contention loads is still the major downside of all the TMs. Although many strategies and methods have been proposed, contention management and transaction scheduling still remains an open area of research. An important piece of unsolved contention management puzzle is plausible transaction execution time estimation. In this paper we proposed two methods for estimating transaction execution times, namely the method based on log-normal distribution and the method based on gamma distribution. Experimental results presented in this paper indicate that the method based on log-normal distribution has better estimation accuracy than the method based on gamma distribution. Even more importantly, the method based on log-normal distribution uses 10 times shorter sliding windows and its complexity is much lower than for the method based on gamma distribution, thus it is faster and requires less electrical power.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127352412","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}
引用次数: 4
Performance improvement of Mandarin digital whispered speech recognition based on multistage classification 基于多级分类的汉语数字耳语语音识别性能改进
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483474
Chen Xueqin, Shan Jun, Yuan Yibiao, Zhao Heming
{"title":"Performance improvement of Mandarin digital whispered speech recognition based on multistage classification","authors":"Chen Xueqin, Shan Jun, Yuan Yibiao, Zhao Heming","doi":"10.1109/ICIST.2016.7483474","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483474","url":null,"abstract":"This paper uses digital speech as research object. A baseline system of Mandarin whispered digital speech recognition using Hidden Markov Model is built. In this paper, the performance of the baseline recognition system is analyzed in detail and we find there are three pairs of easily confused speech. Furthermore, the cause of confusion is analyzed in depth. Then a classifier for distinguishing between the three pairs of easily confused digital speech is built to improve the performance. Experiments show that the recognition rate of Mandarin digital whispered speech has been improved greatly, which can be raised from 68.5% to 83.6%.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131062610","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
A task backfill based scientific workflow scheduling strategy on cloud platform 基于任务回填的云平台科学工作流调度策略
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483394
Shaowei Liu, Kaijun Ren, Kefeng Deng, Junqiang Song
{"title":"A task backfill based scientific workflow scheduling strategy on cloud platform","authors":"Shaowei Liu, Kaijun Ren, Kefeng Deng, Junqiang Song","doi":"10.1109/ICIST.2016.7483394","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483394","url":null,"abstract":"The characteristics of cloud computing such as on-demand provisioning of virtual machines in a pay-as-you-go manner have attracted more and more scientific workflows deploying on cloud platforms. Since there are many types of virtual machines which are charged by time intervals, the difficulties of resource provisioning hinders efficient execution of scientific workflows on cloud platforms. To address the challenge, a novel task backfill based scientific workflow scheduling strategy is proposed in this paper. The strategy will use task backfill algorithm to aggregate multiple tasks on a virtual machine instance with suitable performance and fill idle time slot of virtual machines with single tasks, improving resource utilization without affecting the overall performance. Experimental results demonstrate that in comparison with widely used HEFT and IC-PCPD2 strategy, the proposed strategy can effectively reduce the execution cost of the scientific workflows and improve resource utilization while satisfying the deadline constraint.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128824268","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}
引用次数: 3
Measurements processing algorithm for fiber propagation delay using the modified Kalman filter 基于改进卡尔曼滤波的光纤传输时延测量处理算法
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483450
Y. Jungang, Chao Wang, Wang Kai
{"title":"Measurements processing algorithm for fiber propagation delay using the modified Kalman filter","authors":"Y. Jungang, Chao Wang, Wang Kai","doi":"10.1109/ICIST.2016.7483450","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483450","url":null,"abstract":"The accurate measurements for fiber propagation delay is the prerequisite of timing accuracy in high precision optical fiber timing system. A certain of processing is needed for measurements because the original measurements generally cannot meet the accuracy requirement. The commonly used methods such as Adjacent-averaging method and modeling method based on the measurement have low efficiency or poor operation in practice. In this paper, the principle of fiber timing and propagation delay measurement are introduced, the latter is the key issue in fiber timing, the characteristics of propagation delay measurements are described from a simplified fiber timing system, which is based on the two-way optical time transfer (TWOTT), and the separate effect of the characteristic is analyzed for timing accuracy. On the basis of the characteristics of propagation delay measurements, the improved strategies are defined based on Kalman filter theory. Finally, the effectiveness of the modified Kalman filter is validated through simulation study.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121244494","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
Direction of arrival estimation of sparse rectangular array via two-dimensional continuous compressive sensing 基于二维连续压缩感知的稀疏矩形阵列到达方向估计
2016 Sixth International Conference on Information Science and Technology (ICIST) Pub Date : 2016-05-06 DOI: 10.1109/ICIST.2016.7483473
Jincheng Lin, Xiaochuan Ma, C. Hao, Li Jiang
{"title":"Direction of arrival estimation of sparse rectangular array via two-dimensional continuous compressive sensing","authors":"Jincheng Lin, Xiaochuan Ma, C. Hao, Li Jiang","doi":"10.1109/ICIST.2016.7483473","DOIUrl":"https://doi.org/10.1109/ICIST.2016.7483473","url":null,"abstract":"In this paper, it is shown how 2-D continuous compressive sensing (CCS) is used to recovery the complete measurements of a uniform rectangular array from its sparse case. 2-D CCS is implemented by reweighted atomic norm minimization. Based on the recovered data covariance matrix, the 2-D directions of arrival (DOA) are estimated via the Vandermonde decomposition of Toeplitz-block-Toeplitz matrix. Further, we present an enhanced approach by enlarging the virtual aperture of a sparse rectangular array. This approach can estimate more targets than the conventional one. Some typical examples are used to show the performance of the proposed 2-D DOA estimation method.","PeriodicalId":159643,"journal":{"name":"2016 Sixth International Conference on Information Science and Technology (ICIST)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131478032","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书