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

2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)最新文献

筛选
英文 中文
Using Nonlinear Features in Automatic English Lexical Stress Detection 非线性特征在英语词汇重音自动检测中的应用
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.61
Nan Chen, Qianhua He
{"title":"Using Nonlinear Features in Automatic English Lexical Stress Detection","authors":"Nan Chen, Qianhua He","doi":"10.1109/CIS.WORKSHOPS.2007.61","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.61","url":null,"abstract":"Lexical stress is an important prosodic feature, especially for stress-timed language such as English. This paper proposes three novel features, based on the nonlinear Bark scale and the Teager Energy Operator (TEO), for automatic English lexical stress detection. The proposed features are Bark Scale Cepstrum (BSC), Time Domain TEO-Bark Scale Cepstrum (TDT-BSC) and Frequency Domain TEO-Bark Scale Cepstrum (FDT-BSC). Their contributions, along with traditional features and their combinations, to English lexical stress detection are evaluated by single word pairs and continue sentences. Evaluation results showed that these new features gave significant improvement over traditional ones.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115158502","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}
引用次数: 9
Grey SVM with Simulated Annealing Algorithms in Patent Application Filings Forecasting 灰色支持向量机模拟退火算法在专利申请预测中的应用
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.127
Sheng Xu, Hui-Fang Zhao, Yang Xie
{"title":"Grey SVM with Simulated Annealing Algorithms in Patent Application Filings Forecasting","authors":"Sheng Xu, Hui-Fang Zhao, Yang Xie","doi":"10.1109/CIS.WORKSHOPS.2007.127","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.127","url":null,"abstract":"The patent applications filings (PAF) are complex to conduct due to its nonlinearity of influenced factors. In this study, a grey support vector machines with simulated annealing algorithms (GSVMS) is proposed to forecast PAF. In addition, GM (1, N) model of grey system is used to add a grey layer before neural input layer and white layer after SVM layer. Simulated annealing algorithms (SA) are used to determine free parameters of support vector machines. Evaluation method has been used for comparing the performance of forecasting techniques. The experiments show that the GSVMS model is outperformed GM (1, N) model and SVM with simulated annealing algorithms (SVMS) model, and PAF forecasting based on GSVMS is of validity and feasibility.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121787201","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
A Novel Watermark Algorithm for Blind Extraction 一种新的水印盲提取算法
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.37
Li Yu, Fen Chen
{"title":"A Novel Watermark Algorithm for Blind Extraction","authors":"Li Yu, Fen Chen","doi":"10.1109/CIS.WORKSHOPS.2007.37","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.37","url":null,"abstract":"A novel blind watermark algorithm based on DCT is proposed to embed several same watermarks into digital images in this paper. The watermark is designed to be decoded without the original image. Experimental results show that embedded watermarks using the proposed algorithm can give good image quality and are robust in varying degree to JPEG compression, low-pass filtering, noise contamination, and cropping attacks.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120926974","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
A Verifiable Multi-secret Sharing Scheme (VMSS) 可验证的多秘密共享方案(VMSS)
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.84
Pang Liaojun
{"title":"A Verifiable Multi-secret Sharing Scheme (VMSS)","authors":"Pang Liaojun","doi":"10.1109/CIS.WORKSHOPS.2007.84","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.84","url":null,"abstract":"Chien et al. proposed a new type of multi-secret sharing scheme based on the systematic block codes, in which multiple secrets instead of only one secret can be shared in each sharing session. Their scheme is very useful especially in sharing a large secret. But, there are still some problems in their scheme: the secret shadows are generated by the dealer and must be redistributed to each participant over a secure channel; the scheme does not provide any mechanism to check whether the dealer or every participant is honest. In order to overcome the problems, this paper proposes a modified multi-secret sharing scheme with verification added. At the same time, no secure channel is needed in the proposed scheme. Compared with Chien et al. 's scheme, the proposed scheme is more practical and efficient.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121097028","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 Novel RED Scheme with Preferential Dynamic Threshold Deployment 一种具有优先动态阈值部署的RED方案
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.147
Lijun Sun, Lihong Wang
{"title":"A Novel RED Scheme with Preferential Dynamic Threshold Deployment","authors":"Lijun Sun, Lihong Wang","doi":"10.1109/CIS.WORKSHOPS.2007.147","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.147","url":null,"abstract":"Congestion control mechanisms in Internet have attracted more attention in network studies. To the high loss rate and synchronization resulted from drop tail policy, random early detection (RED) and its variations were reported. In this paper, a novel algorithm named preferential dynamic threshold - RED (PDT-RED) and its optimized scheme OPDT-RED are proposed. They can adjust dynamically average queue length thresholds basing on packets' priority and unused buffer space, and accordingly realizes differentiated service. Compared with RED, OPDT-RED algorithm has three features: 1) it reduces greatly the loss rate of packets with higher priority and the average loss rate of all packets; 2) it is simple for implementation; 3) it satisfies higher buffer utilization.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124794755","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}
引用次数: 6
Appraisal Research of the Government Achievements Based on Electronic Government Affairs Angle 基于电子政务视角的政府绩效评价研究
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.124
Xiao Bin, P. Bin
{"title":"Appraisal Research of the Government Achievements Based on Electronic Government Affairs Angle","authors":"Xiao Bin, P. Bin","doi":"10.1109/CIS.WORKSHOPS.2007.124","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.124","url":null,"abstract":"This paper through analysis to research condition of the electron government affairs of the information society, has proven the feasibility and the necessity of the government achievements appraisal based on the electronic government affairs angle. After the theoretical analysis, the paper used the fuzzy synthesis appraisal method to carry on government achievements appraisal based on the electronic government affairs angle, this research has reference valuation to consummate our country appraisal system of the government achievements.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125027990","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
Normalization towards Instruction Substitution Metamorphism Based on Standard Instruction Set 基于标准指令集的指令替换变形归一化
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.215
Ran Jin, Qiang Wei, Pei Yang, Qingxian Wang
{"title":"Normalization towards Instruction Substitution Metamorphism Based on Standard Instruction Set","authors":"Ran Jin, Qiang Wei, Pei Yang, Qingxian Wang","doi":"10.1109/CIS.WORKSHOPS.2007.215","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.215","url":null,"abstract":"Metamorphic malware is able to change its signature which is a fixed sequence of bytes or code from generation to generation. This makes the traditional scanner based on the signature difficult to detect it. Combing normalization with traditional scanner is a promising direction to solve the problem. The idea is: firstly transform the code into canonical form then pass it into scanner to check. This paper proposes a novel normalization method towards instruction substitution which is a commonly used metamorphism approach. The method mainly involves two steps. Firstly, the input code is rewritten with standard instructions. Secondly, the order of standard instructions is adjusted based on the data dependence graph of each basic block. A case study of normalizing Win32.Evol has been carried out. The results demonstrate the feasibility of our method to make variants, including the original code, tend to be uniform.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125340439","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}
引用次数: 6
A Cache-Based Attribute Granular Computing System 基于缓存的属性粒度计算系统
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.128
Xiaoxia Huang, Lun Cheng
{"title":"A Cache-Based Attribute Granular Computing System","authors":"Xiaoxia Huang, Lun Cheng","doi":"10.1109/CIS.WORKSHOPS.2007.128","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.128","url":null,"abstract":"This paper presents a multilayer cache-based attribute granular computing system. After defining an attribute granule, it brings forward an AHP based attribute granules combination algorithm which can be used for dimensionality reduction in the preprocess stage of data mining. A cache-based operation and storage model is presented then. The storage management of the attribute granules is discussed mainly. Finally a hierarchy cache-based attribute granular computing system is presented. It can be used to implement the AHP based attribute granules combination algorithm and other algorithms based on attribute granular computing.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125387764","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
An Efficient Group Key Agreement Protocol from Bilinear Pairings 基于双线性对的高效组密钥协商协议
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.50
Chengyu Hu, Pengtao Liu, Daxing Li
{"title":"An Efficient Group Key Agreement Protocol from Bilinear Pairings","authors":"Chengyu Hu, Pengtao Liu, Daxing Li","doi":"10.1109/CIS.WORKSHOPS.2007.50","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.50","url":null,"abstract":"A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126834429","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
Research on Multi-mode Fusion Tracking of OTHR Based on Auction Algorithm 基于竞价算法的OTHR多模融合跟踪研究
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI: 10.1109/CIS.WORKSHOPS.2007.115
Kong Min, Wang Guohong
{"title":"Research on Multi-mode Fusion Tracking of OTHR Based on Auction Algorithm","authors":"Kong Min, Wang Guohong","doi":"10.1109/CIS.WORKSHOPS.2007.115","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.115","url":null,"abstract":"In OTHR's tracking system, we will estimate the state of a discrete-time, linear stochastic system whose observation process consists of a finite set of known, non-linear measurement models. MPDA is capable of exploiting multipath target signatures arising from discrete propagation modes that are resolvable by the radar, but it is very time-consuming and will bring multipath tracks. In this paper, a multi-mode fusion tracking of OTHR based on auction algorithm (A-MFT) is proposed, which effectively solve the problem of multi-mode measurements. When tracking a single and non-maneuvering target with four possible measurements, simulations in clutter environment show that the computing speed of the algorithm proposed in this paper is greatly higher than that of MPDA, and the tracking precision just a little lower than that of MPDA, further more, A-MFT will not bring multipath tracks and do not need consequent track association.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114262822","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
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信