Semantic-enabled service discovery aggravating the load of service register and decrease the performance of service matching while increasing the recall and precision of service discovery. To decrease the load of register and the performance of service discovery, a two layered P2P model, is introduced in this article. Based on the model, a service discovery algorithm composed of two stages and three steps is proposed. The model is suitable for open environment with multiple coexistent ontologies. And experimental results show that given appropriate setting, the model makes a tradeoff between recall and responding time during service discovery. In addition, the model decreases the mean load of registers efficiently while holding Recall.
{"title":"A two-layered P2P model for semantic service discovery","authors":"Zhi-zhong Liu, Yulan Liu, Yihui He","doi":"10.1360/JOS181922","DOIUrl":"https://doi.org/10.1360/JOS181922","url":null,"abstract":"Semantic-enabled service discovery aggravating the load of service register and decrease the performance of service matching while increasing the recall and precision of service discovery. To decrease the load of register and the performance of service discovery, a two layered P2P model, is introduced in this article. Based on the model, a service discovery algorithm composed of two stages and three steps is proposed. The model is suitable for open environment with multiple coexistent ontologies. And experimental results show that given appropriate setting, the model makes a tradeoff between recall and responding time during service discovery. In addition, the model decreases the mean load of registers efficiently while holding Recall.","PeriodicalId":250833,"journal":{"name":"4th International Conference on New Trends in Information Science and Service Science","volume":"2 s1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130661778","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}
Pub Date : 2010-05-11DOI: 10.4156/AISS.VOL3.ISSUE4.7
Nalinrat Srirajun, Pattarasinee Bhatarakosol, P. Tantasanawong, Sunyoung Han
One part of trustfulness on web services application over the network is confidence of services that providers can guarantee to their customers. Therefore, after the development process, web services developers must be sure that the delivered services are qualified for availability and reliability during their execution. However, there is a critical problem when errors occur during the execution time of the service agent, such as the infinite loop problem in the service process. This unexpected problem of the web services software can cause critical damages in various aspects, especially lives and dead of people. Although there are various methods have been proposed to protect the unexpected errors, most of them are procedures in the verification and validation during the development processes. Nevertheless, these methods cannot completely solve the inifnite loop problem since this problem is usually occurred by an unexpected values obtained from the execution of request and response processes . Therefore, this paper proposed a system architecture includes with a protection mechanism that completely detect and protect the unbound loop problem of web services when request services of each requester are under the dynamic situation. This proposed solution can guarantee that users will definitly be protected from a critical lost occurred from the unexpected infinite loop of the web services system. Consequently, all service agents with dynamic loop control condition can be trustable.
{"title":"Trustable web services with dynamic confidence time interval","authors":"Nalinrat Srirajun, Pattarasinee Bhatarakosol, P. Tantasanawong, Sunyoung Han","doi":"10.4156/AISS.VOL3.ISSUE4.7","DOIUrl":"https://doi.org/10.4156/AISS.VOL3.ISSUE4.7","url":null,"abstract":"One part of trustfulness on web services application over the network is confidence of services that providers can guarantee to their customers. Therefore, after the development process, web services developers must be sure that the delivered services are qualified for availability and reliability during their execution. However, there is a critical problem when errors occur during the execution time of the service agent, such as the infinite loop problem in the service process. This unexpected problem of the web services software can cause critical damages in various aspects, especially lives and dead of people. Although there are various methods have been proposed to protect the unexpected errors, most of them are procedures in the verification and validation during the development processes. Nevertheless, these methods cannot completely solve the inifnite loop problem since this problem is usually occurred by an unexpected values obtained from the execution of request and response processes . Therefore, this paper proposed a system architecture includes with a protection mechanism that completely detect and protect the unbound loop problem of web services when request services of each requester are under the dynamic situation. This proposed solution can guarantee that users will definitly be protected from a critical lost occurred from the unexpected infinite loop of the web services system. Consequently, all service agents with dynamic loop control condition can be trustable.","PeriodicalId":250833,"journal":{"name":"4th International Conference on New Trends in Information Science and Service Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124809163","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}
Pub Date : 2010-05-11DOI: 10.4156/IJACT.VOL3.ISSUE11.33
Bo Zhou, Chao Wu
With the widely usage of online social networks, people come to realize the necessity of making the social network more semantic. However, the lack of definition of connections hinders the fully applications of online social networks and transform them towards more semantic way. So in this paper, we try to overcome this problem by modeling the social tie connection in online social networks with an object-oriented approach based on extended RDF vocabulary. In our method, the connections are modeled as object entity, with attributes describing their content, and operations defining the legal manipulation upon them. The connections have inheritance relationships between them and thus form an inheritance tree. We presented our consideration in designing the object-oriented model of connection; and developed a prototype to show its advantages over the traditional approach.
{"title":"Modeling social ties with an object oriented approach","authors":"Bo Zhou, Chao Wu","doi":"10.4156/IJACT.VOL3.ISSUE11.33","DOIUrl":"https://doi.org/10.4156/IJACT.VOL3.ISSUE11.33","url":null,"abstract":"With the widely usage of online social networks, people come to realize the necessity of making the social network more semantic. However, the lack of definition of connections hinders the fully applications of online social networks and transform them towards more semantic way. So in this paper, we try to overcome this problem by modeling the social tie connection in online social networks with an object-oriented approach based on extended RDF vocabulary. In our method, the connections are modeled as object entity, with attributes describing their content, and operations defining the legal manipulation upon them. The connections have inheritance relationships between them and thus form an inheritance tree. We presented our consideration in designing the object-oriented model of connection; and developed a prototype to show its advantages over the traditional approach.","PeriodicalId":250833,"journal":{"name":"4th International Conference on New Trends in Information Science and Service Science","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126671086","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}
Pub Date : 2010-05-11DOI: 10.4156/IJIPM.VOL2.ISSUE3.9
Sophia Banu Rahaman, M. Shashi
Internet mediated health education and support offers several advantages. The convenience and ease of access to information is mesmerizing the healthcare sector setting the trend for e-Health. This was in an attempt to convey the promises, principles, excitement around e-commerce to the health arena, and give an account of the new possibilities the Internet is opening up to the area of health care virtually collaborating everything related to computers and medicine. The healthcare environment is generally ‘information rich’ but ‘knowledge poor’. There is a wealth of data available within the healthcare systems but they lack effective analysis tools to discover hidden relationships and trends in data. Valuable knowledge can be discovered with the application of sequential mining technique to equip patients with knowledge for managing health for disease specific better care and understanding through e-Health.
{"title":"Sequential mining equips e-Health with knowledge for managing diabetes","authors":"Sophia Banu Rahaman, M. Shashi","doi":"10.4156/IJIPM.VOL2.ISSUE3.9","DOIUrl":"https://doi.org/10.4156/IJIPM.VOL2.ISSUE3.9","url":null,"abstract":"Internet mediated health education and support offers several advantages. The convenience and ease of access to information is mesmerizing the healthcare sector setting the trend for e-Health. This was in an attempt to convey the promises, principles, excitement around e-commerce to the health arena, and give an account of the new possibilities the Internet is opening up to the area of health care virtually collaborating everything related to computers and medicine. The healthcare environment is generally ‘information rich’ but ‘knowledge poor’. There is a wealth of data available within the healthcare systems but they lack effective analysis tools to discover hidden relationships and trends in data. Valuable knowledge can be discovered with the application of sequential mining technique to equip patients with knowledge for managing health for disease specific better care and understanding through e-Health.","PeriodicalId":250833,"journal":{"name":"4th International Conference on New Trends in Information Science and Service Science","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133379690","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}
Pub Date : 2010-05-11DOI: 10.4156/IJEI.VOL2.ISSUE1.2
Myoungbeom Chung, Il-Ju Ko, Daesik Jang
Obscene image detection refers to the process of identifying obscene and pornographic portions in images previously extracted from a given video file; a process that constitutes the core of the broader obscene-video filtering system. Existing obscene-image detection methods rely on information about image texture such as RGB proportions, color-distribution histograms, and YIG to track the skin-color and edge information of the image concerned. Existing methods, however, are not very accurate when it comes to determining the obscenity level in low-quality UCC videos. This paper proposes an improved method that first utilizes Canny Edge to analyze the fine grains of the image to determine whether the image is of high or low quality, and then employs to determine whether the image passes the final obscenity test. In order to check for the efficacy of this method, an arbitrarily selected batch of images was first put through the Canny Edge test to separate the batch into two groups based on the image-quality level. The images were then tested for their obscenity levels twice, first with an existing method and then with the method proposed in this paper. Results were then analyzed, which showed that the new method yielded results that were about 10% more accurate.
{"title":"Obscene image detection algorithm using high-and low-quality images","authors":"Myoungbeom Chung, Il-Ju Ko, Daesik Jang","doi":"10.4156/IJEI.VOL2.ISSUE1.2","DOIUrl":"https://doi.org/10.4156/IJEI.VOL2.ISSUE1.2","url":null,"abstract":"Obscene image detection refers to the process of identifying obscene and pornographic portions in images previously extracted from a given video file; a process that constitutes the core of the broader obscene-video filtering system. Existing obscene-image detection methods rely on information about image texture such as RGB proportions, color-distribution histograms, and YIG to track the skin-color and edge information of the image concerned. Existing methods, however, are not very accurate when it comes to determining the obscenity level in low-quality UCC videos. This paper proposes an improved method that first utilizes Canny Edge to analyze the fine grains of the image to determine whether the image is of high or low quality, and then employs to determine whether the image passes the final obscenity test. In order to check for the efficacy of this method, an arbitrarily selected batch of images was first put through the Canny Edge test to separate the batch into two groups based on the image-quality level. The images were then tested for their obscenity levels twice, first with an existing method and then with the method proposed in this paper. Results were then analyzed, which showed that the new method yielded results that were about 10% more accurate.","PeriodicalId":250833,"journal":{"name":"4th International Conference on New Trends in Information Science and Service Science","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125433607","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}
Pub Date : 2010-05-11DOI: 10.4156/JNIT.VOL1.ISSUE3.4
O. Hou, Heigen Hsu, Jiann-Min Yang
As the improvement of computing power, texting mining becomes more focused than before. In order to realize the literature productivity of such territory, we analyze the literatures on SSCI database with subjects as “Text Mining”. Applied the methodology of bibliometrics, we found several outcomes in this research. First, the distribution of frequency indexes of author's productivity fulfills Lotka's Law. Second, we also apply Price's Square Root Law & Pareto Principle to check the result and found that are not compliance with both of these. Third, from the distribution of the number of paper published each year we conclude the topic of “Text Mining” is still in peak period but may achieve mature stage in the near future. Finally, 56.25% of authors only contribute 1 paper and 82.74% authors' outcomes are less or equal 3. Contrarily, there are 6 authors with over 10 published papers and the most productive one even owns 37 papers on SSCI database.
{"title":"An empirical investigation of research productivity on Text Mining — in bibliometrics view","authors":"O. Hou, Heigen Hsu, Jiann-Min Yang","doi":"10.4156/JNIT.VOL1.ISSUE3.4","DOIUrl":"https://doi.org/10.4156/JNIT.VOL1.ISSUE3.4","url":null,"abstract":"As the improvement of computing power, texting mining becomes more focused than before. In order to realize the literature productivity of such territory, we analyze the literatures on SSCI database with subjects as “Text Mining”. Applied the methodology of bibliometrics, we found several outcomes in this research. First, the distribution of frequency indexes of author's productivity fulfills Lotka's Law. Second, we also apply Price's Square Root Law & Pareto Principle to check the result and found that are not compliance with both of these. Third, from the distribution of the number of paper published each year we conclude the topic of “Text Mining” is still in peak period but may achieve mature stage in the near future. Finally, 56.25% of authors only contribute 1 paper and 82.74% authors' outcomes are less or equal 3. Contrarily, there are 6 authors with over 10 published papers and the most productive one even owns 37 papers on SSCI database.","PeriodicalId":250833,"journal":{"name":"4th International Conference on New Trends in Information Science and Service Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115180204","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
扫码关注我们
求助内容：
应助结果提醒方式：