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

2008 International Multi-symposiums on Computer and Computational Sciences最新文献

筛选
英文 中文
Short-Wave Aviation Communication Signal Analysis and Aircraft Classification 短波航空通信信号分析与航空器分类
2008 International Multi-symposiums on Computer and Computational Sciences Pub Date : 2008-10-18 DOI: 10.1109/IMSCCS.2008.24
Liu Feng, Li Xueyao, Liang Zhilan
{"title":"Short-Wave Aviation Communication Signal Analysis and Aircraft Classification","authors":"Liu Feng, Li Xueyao, Liang Zhilan","doi":"10.1109/IMSCCS.2008.24","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.24","url":null,"abstract":"This paper investigates how to classify the type of the aircraft based on the aviation communication signal. Hilbert-Huang Transform (HHT) is introduced to adaptively decompose the cockpit voice into several IMFs, then the IMFs can be used as the features of the aircraft for identifying the type. To alleviate the problem of mode mixing caused by the signal intermittency in EMD, a novel method EEMD is applied here in decomposing short-wave aviation communication. The results show that the performance of HHT based on EEMD is better than that of original EMD in decomposition and classification.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116050946","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 Method for Measuring Semantic Similarity of Concepts in the Same Ontology 同一本体中概念语义相似度的度量方法
2008 International Multi-symposiums on Computer and Computational Sciences Pub Date : 2008-10-18 DOI: 10.1109/IMSCCS.2008.22
Xianghua Xu, Jia-lai Huang, Jian Wan, Congfeng Jiang
{"title":"A Method for Measuring Semantic Similarity of Concepts in the Same Ontology","authors":"Xianghua Xu, Jia-lai Huang, Jian Wan, Congfeng Jiang","doi":"10.1109/IMSCCS.2008.22","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.22","url":null,"abstract":"The present methods for measuring concepts semantic similarity only focus on certain influencing factors, have poor convergence performances and canpsilat calculate accurately. This paper compares three kinds of ontology-based semantic similarity calculation models. On this basis, an improved algorithm that inherits the distance-based calculation model is proposed. In this approach, node depth, local density and node attributes are newly quantified and the granularity degree of clusters is firstly combined with other five factors: local density, node depth, link type, link strength, node attribute. The experimental results show that this method provides an effective quantification for the semantic relationships, and can calculate semantic similarity more precisely.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129365571","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}
引用次数: 10
Direct Orthogonal Discriminant Analysis 直接正交判别分析
2008 International Multi-symposiums on Computer and Computational Sciences Pub Date : 2008-10-18 DOI: 10.1109/IMSCCS.2008.25
Yu'e Lin, Guochang Gu, Haibo Liu, Jing Shen
{"title":"Direct Orthogonal Discriminant Analysis","authors":"Yu'e Lin, Guochang Gu, Haibo Liu, Jing Shen","doi":"10.1109/IMSCCS.2008.25","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.25","url":null,"abstract":"Orthogonal discriminant analysis algorithms have recently been proposed. However, these methods donpsilat address the singularity problem in the high dimensional feature space. In this paper, we present a new method called direct orthogonal discriminant analysis (DODA), which is able to extract all the orthogonal discriminant vectors simultaneously in the high-dimensional feature space and does not suffer the singularity problem. This method is very simple and easy to be implemented. Experimental results show that the proposed method is very competitive in comparison with some existing dimensionality reduction algorithms.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129108702","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 Fast Spectral Method to Solve Document Cluster Ensemble Problem 一种快速谱法求解文档聚类集成问题
2008 International Multi-symposiums on Computer and Computational Sciences Pub Date : 2008-10-18 DOI: 10.1109/IMSCCS.2008.8
Sen Xu, Zhimao Lu, Guochang Gu
{"title":"A Fast Spectral Method to Solve Document Cluster Ensemble Problem","authors":"Sen Xu, Zhimao Lu, Guochang Gu","doi":"10.1109/IMSCCS.2008.8","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.8","url":null,"abstract":"The critical problem in cluster ensemble is how to combine clusterers to yield a final superior clustering result. In this paper, we introduce a spectral method to solve document cluster ensemble problem. Since spectral clustering inevitably needs to compute the eigenvalues and eigenvectors of a matrix, for large scale document datasets, itpsilas computationally intractable. By using algebraic transformation to similarity matrix we get a feasible algorithm. Experiments on TREC and Reuters document sets show that our spectral algorithm yields better clustering results than other typical cluster ensemble techniques without high computational cost.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130051329","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 NoC-Based High Performance Deadlock Avoidance Routing Algorithm 一种基于noc的高性能死锁避免路由算法
2008 International Multi-symposiums on Computer and Computational Sciences Pub Date : 2008-10-18 DOI: 10.1109/IMSCCS.2008.39
Zhaohui Song, Guangsheng Ma, Dalei Song
{"title":"A NoC-Based High Performance Deadlock Avoidance Routing Algorithm","authors":"Zhaohui Song, Guangsheng Ma, Dalei Song","doi":"10.1109/IMSCCS.2008.39","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.39","url":null,"abstract":"To help optimize Network-on-Chip (NoC) communication performance while ensuring deadlock avoidance routing, a high performance deadlock avoidance routing algorithm in routing table based NoC routers is presented, a cycle in channel dependency graph expressing NoCpsilas routing communication can be broken by restricting the routing function of some node while ensuring destination reachability of each communication pair to avoid the deadlock. Performance evaluation is demonstrated that the proposed deadlock avoidance routing algorithm have higher performance.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527237","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
Embedded Gene Selection for Imbalanced Microarray Data Analysis 嵌入式基因选择的不平衡微阵列数据分析
2008 International Multi-symposiums on Computer and Computational Sciences Pub Date : 2008-10-18 DOI: 10.1109/IMSCCS.2008.33
Guozheng Li, Hao-Hua Meng, Jun Ni
{"title":"Embedded Gene Selection for Imbalanced Microarray Data Analysis","authors":"Guozheng Li, Hao-Hua Meng, Jun Ni","doi":"10.1109/IMSCCS.2008.33","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.33","url":null,"abstract":"Most of microarray data sets are imbalanced, i.e. the number of positive examples is much less than that of negative, which will hurt performance of classifiers when it is used for tumor classification. Though it is critical, few previous works paid attention to this problem. Here we propose embedded gene selection with two algorithms i.e. EGSEE (Embedded Gene Selection for EasyEnsemble) and EGSIEE (Embedded Gene Selection for Individuals of EasyEnsemble) to treat this problem and improve generalization performance of the EasyEnsemble classifier. Experimental results on several microarray data sets show that compared with the previous two filter feature selection methods, EGSEE and EGSIEE obtain better performance.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114758299","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}
引用次数: 8
Topic-Sensitive Link-Ranking Approach for Academic Expert Recruiting 面向学术专家招聘的主题敏感链接排序方法
2008 International Multi-symposiums on Computer and Computational Sciences Pub Date : 2008-10-01 DOI: 10.1109/IMSCCS.2008.35
Hao Wu, Hao Li, Xuejie Zhang, Shaowen Yao
{"title":"Topic-Sensitive Link-Ranking Approach for Academic Expert Recruiting","authors":"Hao Wu, Hao Li, Xuejie Zhang, Shaowen Yao","doi":"10.1109/IMSCCS.2008.35","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.35","url":null,"abstract":"The problem of academic expert recruiting is concerned with finding the experts on a specified research field. It has many real-world applications and has recently attracted much attention. However, the existing methods are not versatile and entirely suit for the special requirements from academic area where the co-authorship and the citation relation play important roles in judging researcherspsila achievement. In this paper, we propose and develop a flexible data schema and a topic-sensitive co-pagerank algorithm for studying this problem. The main idea is measuring the authorspsila authorities with considering topics bias on the basis of their social networks and citation networks, and then, recommending expert candidates for the requests. To infer association between authors and topics, we derive a probability model on the basis of latent Dirichlet allocation (LDA) model. We further propose several techniques such as reasoning the interested topics of query, modeling author profile on the supporting documents to instruct the practices. Our experiments show that the proposed strategies are all effective to improve retrieval accuracy.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115971022","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
Data-Structure-Model for Data Integration in Distributed Systems 分布式系统数据集成的数据结构模型
2008 International Multi-symposiums on Computer and Computational Sciences Pub Date : 2008-10-01 DOI: 10.1109/IMSCCS.2008.45
Zhe Zhang, Min Song, Daxin Liu, Zhengxian Wei, Hongbin Wang, J. Ni
{"title":"Data-Structure-Model for Data Integration in Distributed Systems","authors":"Zhe Zhang, Min Song, Daxin Liu, Zhengxian Wei, Hongbin Wang, J. Ni","doi":"10.1109/IMSCCS.2008.45","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.45","url":null,"abstract":"Data integration is one of key issues about data exchange and information sharing in distributed computing environment. It is necessary to develop a data structure model which can be used to enhance the data integration for distributed systems. In this paper, we propose a data structure model by which the organization of levels and flexibility of the expression within the systems can be established. This model is based on the spatial integration data method (SIDM) that builds a characteristic relationship between data types and data items. The conception and algebraic descriptions of the method is presented in terms of the object of spatial data and function of display of meta-data. A criterion is proposed to feature the algebraic operations for data integration being implemented in a distributed system.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121373473","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学术官方微信