The main reason why conceptual modeling is still considered an "art" rather than a mature engineering discipline is that the quality evaluation system of conceptual model has not been well established. In order to address this problem, based on ISO / IEC 25012, 25020 standards, and combined with extensive research and experiences of experts, we propose the preliminary ontology for classifying quality characteristics of conceptual models. This paper discussed its application in establishing a standard for conceptual model quality model and typical evaluation process. As a starting point, the ontology can effectively support the establishment of conceptual model quality evaluation standard, and is available to improve the quality evaluation methods.
{"title":"Towards a Preliminary Ontology for Conceptual Model Quality Evaluating","authors":"Yu-dong Qi, Ning Qu, Xiao-fang Xie","doi":"10.1109/WISM.2010.51","DOIUrl":"https://doi.org/10.1109/WISM.2010.51","url":null,"abstract":"The main reason why conceptual modeling is still considered an \"art\" rather than a mature engineering discipline is that the quality evaluation system of conceptual model has not been well established. In order to address this problem, based on ISO / IEC 25012, 25020 standards, and combined with extensive research and experiences of experts, we propose the preliminary ontology for classifying quality characteristics of conceptual models. This paper discussed its application in establishing a standard for conceptual model quality model and typical evaluation process. As a starting point, the ontology can effectively support the establishment of conceptual model quality evaluation standard, and is available to improve the quality evaluation methods.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129029852","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}
We have proposed a document representation model based on query and content, this model uses users’ query behavior and content information of documents for representing document. The pragmatic information from users’ implicit feedback and the semantic and syntactic information from documents are integrated to dynamically regulate the term-weight of index database. In this paper, our document representation model is applied to website search engine and the key parameters of this model are determined by experiments. The results show that this model can consequently improve precision ratio in information retrieval.
{"title":"Study on Application of Document Representation Model Based on Query and Content Information in Website Search Engine","authors":"Zuo Zhou, Hui Jiang, Jia-yu Ma, Xiao-Hua Yang","doi":"10.1109/WISM.2010.156","DOIUrl":"https://doi.org/10.1109/WISM.2010.156","url":null,"abstract":"We have proposed a document representation model based on query and content, this model uses users’ query behavior and content information of documents for representing document. The pragmatic information from users’ implicit feedback and the semantic and syntactic information from documents are integrated to dynamically regulate the term-weight of index database. In this paper, our document representation model is applied to website search engine and the key parameters of this model are determined by experiments. The results show that this model can consequently improve precision ratio in information retrieval.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129071635","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}
The paper utilizes competency evaluation model based on gray relational analysis to assess marketing staff competency. An empirical case is given for an automobile company's marketing staff competency evaluation to prove the validity of the model.
{"title":"The Evaluation Method of Marketing Staff Competency Based on Gray Relational Analysis","authors":"Haojie Liu, Juan Wang, Jiahai Yuan, Minpeng Xiong","doi":"10.1109/WISM.2010.37","DOIUrl":"https://doi.org/10.1109/WISM.2010.37","url":null,"abstract":"The paper utilizes competency evaluation model based on gray relational analysis to assess marketing staff competency. An empirical case is given for an automobile company's marketing staff competency evaluation to prove the validity of the model.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128043358","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}
Text Classification is an important field of research. There are a number of approaches to classify text documents. However, there is an important challenge to improve the computational efficiency and recall. In this paper, we propose a novel framework to segment Chinese words, generate word vectors, train the corpus and make prediction. Based on the text classification technology, we successfully help the Chinese disabled persons to acquire job opportunities efficiently in real word. The results show that using this method to build the classifier yields better results than traditional methods. We also experimentally show that careful selection of a subset of features to represent the documents can improve the performance of the classifiers.
{"title":"Using Text Categorization to Find Job Opportunities","authors":"Shilin Zhang, Mei Gu","doi":"10.1109/WISM.2010.47","DOIUrl":"https://doi.org/10.1109/WISM.2010.47","url":null,"abstract":"Text Classification is an important field of research. There are a number of approaches to classify text documents. However, there is an important challenge to improve the computational efficiency and recall. In this paper, we propose a novel framework to segment Chinese words, generate word vectors, train the corpus and make prediction. Based on the text classification technology, we successfully help the Chinese disabled persons to acquire job opportunities efficiently in real word. The results show that using this method to build the classifier yields better results than traditional methods. We also experimentally show that careful selection of a subset of features to represent the documents can improve the performance of the classifiers.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130508036","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}
This paper deals with the problem of stochastic robust asymptotically stability for a class of uncertain stochastic nonlinear time-varying systems with time-delays. The parametric uncertainties are assumed to be time-varying and norm bounded. The time-delay factors are unknown and time-varying with known bounds. The aim of this paper is to design a memory less state feedback control law such that the closed-loop system is stochastically asymptotical stable in the mean square for all admissible parameter uncertainties. A new sufficient condition for the existence of such controllers is presented based on the linear matrix inequality (LMI) approach. Numerical example is given to illustrate the effectiveness of the developed method.
{"title":"Delay-Dependent Robust Stability of Uncertain Stochastic Nonlinear Time-Varying Systems with Time-Delays","authors":"Hongyan Cui, Cunchen Gao","doi":"10.1109/WISM.2010.73","DOIUrl":"https://doi.org/10.1109/WISM.2010.73","url":null,"abstract":"This paper deals with the problem of stochastic robust asymptotically stability for a class of uncertain stochastic nonlinear time-varying systems with time-delays. The parametric uncertainties are assumed to be time-varying and norm bounded. The time-delay factors are unknown and time-varying with known bounds. The aim of this paper is to design a memory less state feedback control law such that the closed-loop system is stochastically asymptotical stable in the mean square for all admissible parameter uncertainties. A new sufficient condition for the existence of such controllers is presented based on the linear matrix inequality (LMI) approach. Numerical example is given to illustrate the effectiveness of the developed method.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129225490","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}
There are many problems in the present research of teaching and application of E-Learning, such as theories separated, theoretical basis indistinct, technique used indiscriminately, lack of interaction, knowledge extension short and reflection insufficient, etc. So the ideal effect of knowledge extension, based on modern instructional theories, could not be reached. Focused on these problems, combined teaching practice and course characteristics, summed by an analogy and structural analysis, this paper mainly shows the interdependent relationships of the three levels research methods, which are the theoretical, technical and activity level. Therefore, it puts forward a new clear idea for theoretical research on E-learning.
{"title":"E-learning Teaching Method Research and Ideas","authors":"Shulei Wu, Chun-mei Song, Huandong Chen, Jinmei Zhan","doi":"10.1109/WISM.2010.136","DOIUrl":"https://doi.org/10.1109/WISM.2010.136","url":null,"abstract":"There are many problems in the present research of teaching and application of E-Learning, such as theories separated, theoretical basis indistinct, technique used indiscriminately, lack of interaction, knowledge extension short and reflection insufficient, etc. So the ideal effect of knowledge extension, based on modern instructional theories, could not be reached. Focused on these problems, combined teaching practice and course characteristics, summed by an analogy and structural analysis, this paper mainly shows the interdependent relationships of the three levels research methods, which are the theoretical, technical and activity level. Therefore, it puts forward a new clear idea for theoretical research on E-learning.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128019706","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}
Data mining basing on Privacy preservation has become a research hot point now. Web usage mining is one kind of data mining applications, and how to prevent data leakiness in web usage mining is also an important issue. In this paper, we present an effective method for privacy preserving association rule mining in the web usage mining, Secondary Random Response Column Replacement (SRRCR) to improve the privacy preservation and mining accuracy. Then, a privacy preserving association rule mining algorithm based on SRRCR is presented, which can achieve significant improvements in terms of privacy and efficiency. Finally, we present experimental results that validate the algorithms by applying it on real datasets.
{"title":"A Method for Privacy Preserving Mining of Association Rules Based on Web Usage Mining","authors":"Yan Wang, Jiajin Le, Dongmei Huang","doi":"10.1109/WISM.2010.66","DOIUrl":"https://doi.org/10.1109/WISM.2010.66","url":null,"abstract":"Data mining basing on Privacy preservation has become a research hot point now. Web usage mining is one kind of data mining applications, and how to prevent data leakiness in web usage mining is also an important issue. In this paper, we present an effective method for privacy preserving association rule mining in the web usage mining, Secondary Random Response Column Replacement (SRRCR) to improve the privacy preservation and mining accuracy. Then, a privacy preserving association rule mining algorithm based on SRRCR is presented, which can achieve significant improvements in terms of privacy and efficiency. Finally, we present experimental results that validate the algorithms by applying it on real datasets.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117191761","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}
Two-dimensional bar code is one of the most basic and key technologies to achieve the process of identifying information technology for the Internet of things. This paper focuses on book management based on two-dimensional bar code through Visual Basic.NET and SQL Server databases. It can achieve anti-counterfeiting, automatic book information entry, reader identification and library lending management. It can also achieve a seamless transition from the existing one-dimensional bar code ISBN to two-dimensional bar code ISBN.
{"title":"The Two-Dimensional Bar Code Application in Book Management","authors":"Xuechen He","doi":"10.1109/WISM.2010.58","DOIUrl":"https://doi.org/10.1109/WISM.2010.58","url":null,"abstract":"Two-dimensional bar code is one of the most basic and key technologies to achieve the process of identifying information technology for the Internet of things. This paper focuses on book management based on two-dimensional bar code through Visual Basic.NET and SQL Server databases. It can achieve anti-counterfeiting, automatic book information entry, reader identification and library lending management. It can also achieve a seamless transition from the existing one-dimensional bar code ISBN to two-dimensional bar code ISBN.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115653717","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}
Dinghui Zhang, Jianwei Zhang, Yuping Wang, Saisai Xu, You Li
According to the particular properties of discrete chaotic sequences, and combining the structure characters of digital images, obeying the common encryption principles of digital images, a discrete chaotic exclusive OR encryption scheme of digital images is carefully studied and proposed. In the light of the size of a digital image which needs to be encrypted, and producing a corresponding binary chaotic sequence, a binary exclusive OR operation between the binary chaotic sequence and the digital image is implemented to carry out the encryption of the digital image. The working performances of the encryption scheme is tested and analyzed. The digital image encryption scheme presented in this paper has both a good encrypting effect and stronger security, and is practical, which is a symmetric and loss less encryption system.
{"title":"Discrete Chaotic Exclusive OR Encryption of Digital Image","authors":"Dinghui Zhang, Jianwei Zhang, Yuping Wang, Saisai Xu, You Li","doi":"10.1109/WISM.2010.74","DOIUrl":"https://doi.org/10.1109/WISM.2010.74","url":null,"abstract":"According to the particular properties of discrete chaotic sequences, and combining the structure characters of digital images, obeying the common encryption principles of digital images, a discrete chaotic exclusive OR encryption scheme of digital images is carefully studied and proposed. In the light of the size of a digital image which needs to be encrypted, and producing a corresponding binary chaotic sequence, a binary exclusive OR operation between the binary chaotic sequence and the digital image is implemented to carry out the encryption of the digital image. The working performances of the encryption scheme is tested and analyzed. The digital image encryption scheme presented in this paper has both a good encrypting effect and stronger security, and is practical, which is a symmetric and loss less encryption system.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131512323","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}
Compared with wavelet, tight frame let has goodtime-frequency analysis ability. In this paper, we propose anew digital image watermarking algorithm based on tight frame let. In our method, the host image is firstly decomposed by frame let. Secondly, the watermark image is transformed by Arnold scrambling and then is embedded in the lowest frequency sub band of the host image. Experimental results show that the proposed method gains good performance in robustness and imperceptibility with respect to traditional image processing including noise attack, filtering and JPEG compression. Moreover, the watermark imperceptibility of our method is better than that of wavelet.
{"title":"A Digital Image Watermarking Method Based on Tight Framelet","authors":"Runhai Jiao, Biying Lin","doi":"10.1109/WISM.2010.86","DOIUrl":"https://doi.org/10.1109/WISM.2010.86","url":null,"abstract":"Compared with wavelet, tight frame let has goodtime-frequency analysis ability. In this paper, we propose anew digital image watermarking algorithm based on tight frame let. In our method, the host image is firstly decomposed by frame let. Secondly, the watermark image is transformed by Arnold scrambling and then is embedded in the lowest frequency sub band of the host image. Experimental results show that the proposed method gains good performance in robustness and imperceptibility with respect to traditional image processing including noise attack, filtering and JPEG compression. Moreover, the watermark imperceptibility of our method is better than that of wavelet.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116059338","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：