{"title":"Detecting Gaps between ERP Software and Organizational Needs: A Semantic Similarity Based Approach","authors":"G. Juntao, Zhang Li","doi":"10.1109/WSCS.2008.35","DOIUrl":"https://doi.org/10.1109/WSCS.2008.35","url":null,"abstract":"Gap analysis is one of the most important phases in implementation of enterprise resource planning (ERP) system. In this paper, an approach is proposed to automatically detect gaps between software capacities and organizational needs based on semantic similarity computation. The approach takes two business process models as input, and one specifies software capacities and the other describes organizational needs. The output of it is a report of gaps. As a matter of fact, the differences between application domain and software discipline make semantic heterogeneity a key problem in gap detection, therefore the technologies of semantic similarity computing are employed to resolve ambiguity issues caused by the use of synonyms or homonyms. In particular, the idea of similarity propagation is introduced to pick out a mapping between corresponding activities and data, and Hungarian algorithm is employed to reduce its time complexity. Then the similarity of whole models is measured according to the minimal total cost of change operations. Finally, an experiment is given to evaluate the method.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121161812","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}
{"title":"Semantic Computing in Scalable Text-to-Speech System","authors":"Zhang Wei, Pang Min-hui, Dai Li-rong","doi":"10.1109/WSCS.2008.7","DOIUrl":"https://doi.org/10.1109/WSCS.2008.7","url":null,"abstract":"Because of diversity of hardware environments, building scalable text-to-speech system is an important issue of Corpus-based text-to-speech system. This paper proposes and analyses three semantic computing problems of building scalable text to speech system: similarity calculation, granular computing and automated instances-pruning process framework. According to these, an acoustic clustering algorithm-NuClustering-VPA and a data ranking algorithm-StaRp-VPA are constructed to pruning synthesis instances. In experiments, the naturalness scored by MOS remains almost unchanged when less than 50% instances are pruned off using these two algorithms and the MOS does not severely degrade when reduction rate is above 50% using StaRp-VPA algorithm.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129844380","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}
{"title":"Computing Semantic Similarities Based on Machine-Readable Dictionaries","authors":"Hui Liu, Jinglei Zhao, R. Lu","doi":"10.1109/WSCS.2008.9","DOIUrl":"https://doi.org/10.1109/WSCS.2008.9","url":null,"abstract":"The measurement of semantic similarity is a foundation work in semantic computing. In this paper the authors study the similarity measure between two words. Different from previous works, this paper suggests a novel method that relies on machine-readable dictionaries for measuring similarities. Machine-readable dictionaries are more widely available than other kinds of lexical resources. If two words have similar definitions, they are semantically similar. A definition is represented by a definition vector. Each dimension represents a word in the dictionary. The score of each dimension in the vector is calculated by a variation of tf*idf. Evaluations show that this method achieves competitive results in both Chinese and English.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129988175","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}
{"title":"MSVM-kNN: Combining SVM and k-NN for Multi-class Text Classification","authors":"Pingpeng Yuan, Yuqin Chen, Hai Jin, Li Huang","doi":"10.1109/WSCS.2008.36","DOIUrl":"https://doi.org/10.1109/WSCS.2008.36","url":null,"abstract":"Text categorization is the process of assigning documents to a set of previously fixed categories. It is widely used in many data-oriented management applications. Many popular algorithms for text categorization have been proposed, such as Naive Bayes, k-Nearest Neighbor (k-NN), Support Vector Machine (SVM). However, those classification approaches do not perform well in every case, for example, SVM can not identify categories of documents correctly when the texts are in cross zones of multi-categories, k-NN cannot effectively solve the problem of overlapped categories borders. In this paper, we propose an approach named as Multi-class SVM-kNN (MSVM-kNN) which is the combination of SVM and k-NN. In the approach, SVM is first used to identify category borders, then k-NN classifies documents among borders. MSVM-kNN can overcome the shortcomings of SVM and k-NN and improve the performance of multi-class text classification. The experimental results show MSVM-kNN performs better than SVM or kNN.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"295 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134099698","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}
Yu Hao, P. Sheu, Ying Shi, Wang Shu, Zhang Guigang, Xie Dan
{"title":"A Kind of Method of Establishing Semantic Information Space Model Based on WSDL4S Document","authors":"Yu Hao, P. Sheu, Ying Shi, Wang Shu, Zhang Guigang, Xie Dan","doi":"10.1109/WSCS.2008.13","DOIUrl":"https://doi.org/10.1109/WSCS.2008.13","url":null,"abstract":"With the increasing development of web service technologies, more and more applications need web services to give strong capabilities. We divide the existing information space into two levels - semantic space and information space. It will make the tranditional operations on web services been abstracted from information space level into semantic space level. Through semantic computing and semantic reasoning, it is more effective to implement the service discovering, searching , and composing etc. We give a semantic resource description framework RDF4S and its description document WSDL4S for semantic web service. This paper presents an approach to establish semantic information space model based on WSDL4S document using data mining technologies and ontology technologies. The method constructs a mapping between general information space and semantic information space. A specific case is given to prove the validity of this method at the end of the paper.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131299314","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}
Tianlin Zhou, Baowen Xu, Liang Shi, Yuming Zhou, Lin Chen
{"title":"Measuring Package Cohesion Based on Context","authors":"Tianlin Zhou, Baowen Xu, Liang Shi, Yuming Zhou, Lin Chen","doi":"10.1109/WSCS.2008.23","DOIUrl":"https://doi.org/10.1109/WSCS.2008.23","url":null,"abstract":"Packages play a critical role to understand, construct and maintain large-scale software systems. As an important design attribute, cohesion can be used to predict the quality of packages. Although a number of package cohesion metrics have been proposed in the last decade, they mainly converge on intra-package data dependences between components, which are inadequate to represent the semantics of packages in many cases. To address this problem, we propose a new cohesion metric for package called SCC on the assumption that two components are related tightly if they have similar contexts. Compared to existing works, SCC uses the common context of two components to infer whether they have close relation or not, which involves both inter- and intra- package data dependences. It is hence able to reveal semantic relations between components. We demonstrate the effectiveness of SCC by case studies.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129160226","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}
{"title":"Applying Generalization Refactoring to Java Generic Programs","authors":"Lin Chen, Baowen Xu, Tianlin Zhou, Yuming Zhou","doi":"10.1109/WSCS.2008.16","DOIUrl":"https://doi.org/10.1109/WSCS.2008.16","url":null,"abstract":"In generalization refactoring, preconditions and allowable source code modifications depend on type constraints of the refactored program. Type constraints of parameterized types should be considered when applying the refactoring to generic programs, otherwise type errors may be brought into the refactored program. Some type constraint rules for Java generic programs are presented to verify the preconditions in the refactoring. The type constraints can be solved by traversing a type constraint graph. Based on the type constraint graph, a refactoring algorithm for extract interface is proposed.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124325475","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}
{"title":"Comparative Analysis of Genetic Algorithm and Ant Colony Algorithm on Solving Traveling Salesman Problem","authors":"Kangshun Li, Lanlan Kang, Wensheng Zhang, Bing Li","doi":"10.1109/WSCS.2008.11","DOIUrl":"https://doi.org/10.1109/WSCS.2008.11","url":null,"abstract":"Ant Colony Algorithm and Genetic Algorithm (GA), two bionic-inspired optimization algorithms, have great potentials to solve the combination optimization problems, respectively used in solving traveling salesman problem, but there are some shortcomings if only one of them is used to solve TSP. Performance comparative analysis have been done by using ACA and GA respectively in solving TSP in this paper. The experiments show the advantages and disadvantages used only ACA or GA, we can overcome the shortcomings if GA and ACA are combined to solve TSP and get faster convergent speed and more accurate results compared with only using ACA or GA.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123779038","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}
{"title":"Automatic System Modeling Approach Based on Semantic Association","authors":"Peng Rong, Keqing He, Liang Peng","doi":"10.1109/WSCS.2008.19","DOIUrl":"https://doi.org/10.1109/WSCS.2008.19","url":null,"abstract":"Domain model, an important asset retrieved from domain analysis, can provide a problem-oriented solution for modeling the domain applications. The focus of this research is to automatically modeling specific domain application according to user requirements with the support of domain models. In this paper, it proposes an association method to establish the semantic association between expected goals which is extracted from user requirement and domain models; based on the association, an automatic modeling method is put forward which utilize the modeling solution of domain models; at the end, an experimental system DGMR Manager is carried out to support the idea of this approach.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126447345","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}
{"title":"A Natural Language Database Interface Based on a Probabilistic Context Free Grammar","authors":"Beibei Huang, Guigang Zhang, P. Sheu","doi":"10.1109/WSCS.2008.14","DOIUrl":"https://doi.org/10.1109/WSCS.2008.14","url":null,"abstract":"This paper presents a natural language interface to relational database. It introduces some classical NLDBI products and their applications and proposes the architecture of a new NLDBI system including its probabilistic context free grammar, the inside and outside probabilities which can be used to construct the parse tree, an algorithm to calculate the probabilities, and the usage of dependency structures and verb subcategorization in analyzing the parse tree. Some experiment results are given to conclude the paper.","PeriodicalId":378383,"journal":{"name":"IEEE International Workshop on Semantic Computing and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129527687","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}