{"title":"Search Method Using the Pixel Value Histogram of ROI for Illegal Copy Image with Geometric Attacks","authors":"H. Kuroda, K. Imamura, M. Fujimura","doi":"10.1109/UNESST.2014.10","DOIUrl":"https://doi.org/10.1109/UNESST.2014.10","url":null,"abstract":"It is very difficult to search the ornament attacked image, since added context into the attacked image by ornament is different from original image. In this paper, it is noted that the process of the decorative frame is applied to the peripheral region of the image, we propose introduction of a mask image to be limited to ROI (region of interesting) for image searching. That is, using the mask image, and measuring the histogram of pixel values in the ROI of each search target image and the original image, then calculate the correlation coefficient between the two histograms. In addition, with respect to the rotation and scaling attack any, we propose a method for determining the amount of the attack. Computer simulation results show the validity of proposed algorithm.","PeriodicalId":195062,"journal":{"name":"2014 7th International Conference on u- and e- Service, Science and Technology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130410376","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}
J. D. Udayan, Hyun-a Park, Hyungseok Kim, Jee-In Kim, Keetae Kim
{"title":"Methodology and Evaluation of Terrain Fusion Based on Different Resolution 2D Images","authors":"J. D. Udayan, Hyun-a Park, Hyungseok Kim, Jee-In Kim, Keetae Kim","doi":"10.1109/UNESST.2014.12","DOIUrl":"https://doi.org/10.1109/UNESST.2014.12","url":null,"abstract":"Currently, digital terrain models (DTMs) are important constituent of any urban navigation system. When modeling the earth's surface in digital form, there occurs voids or gaps in the terrain data. This may result in an erroneous representation of the geographic information system. Terrain fusion is suggested as a solution to fill the voids in the data representation. This paper focuses on this idea and presents a novel terrain fusion methodology and evaluation using satellite imagery (SRTM) and 2D map representation (NDM). We use iso-elevation contour map, a compact feature based representation to evaluate the reference terrain (SRTM) and the fused terrain (SRTM and NDM). We experiment with these criterions of aerial difference, structural similarity and height deviation to estimate the accuracy of fusion methodology. The result shows that the proposed methodology can improve the accuracy in the terrain matching.","PeriodicalId":195062,"journal":{"name":"2014 7th International Conference on u- and e- Service, Science and Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123428176","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":"Spectral Radius as a Measure of Variation in Node Degree for Complex Network Graphs","authors":"N. Meghanathan","doi":"10.1109/UNESST.2014.8","DOIUrl":"https://doi.org/10.1109/UNESST.2014.8","url":null,"abstract":"The spectral radius of a network graph is the largest Eigen value of the adjacency matrix of the graph. We hypothesize the spectral radius to be a measure of the variation in the degrees of the nodes. In this pursuit, we define a metric called the spectral radius ratio for node degree as the ratio of the spectral radius to the average node degree. We validate our hypothesis by determining this metric on some of the commonly studied classical large real-world complex network graphs (undirected) for network analysis. Based on the results collected, we observe the spectral radius ratio for node degree to be positively correlated (correlation coefficient: 0.75) to the coefficient of variation in node degree (the ratio of the average node degree to the standard deviation in node degree), thus confirming our hypothesis.","PeriodicalId":195062,"journal":{"name":"2014 7th International Conference on u- and e- Service, Science and Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125900010","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":"Improving the Success Rate of Concurrent Mobile Transactions by Predicting Time for Execution","authors":"S. A. Moiz, Umesh Kumar Choudhary","doi":"10.1109/UNESST.2014.13","DOIUrl":"https://doi.org/10.1109/UNESST.2014.13","url":null,"abstract":"In mobile database environment maintaining consistency of shard data is a challenging problem. This is because mobile devices may be prone to disconnections and mobility. As a result the transactions are aborted, delayed or frequently restarted. This not only reduces the success rate of transaction but also reduces the overall system throughput. In the proposed strategy attempt is made to increase the success rate of transactions by evaluating expected time for execution of a transaction. The expected time for execution is evaluated using K-Means and KNN (K-Nearest Neighborhood) algorithms. The simulated results show that the proposed strategy works better if sufficient data logs of previous successful transactions are available.","PeriodicalId":195062,"journal":{"name":"2014 7th International Conference on u- and e- Service, Science and Technology","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122568015","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":"Overlapping Community Structure in Co-authorship Networks: A Case Study","authors":"M. Jebabli, H. Cherifi, C. Cherifi, A. Hamouda","doi":"10.1109/UNESST.2014.11","DOIUrl":"https://doi.org/10.1109/UNESST.2014.11","url":null,"abstract":"Community structure is one of the key properties of real-world complex networks. It plays a crucial role in their behaviors and topology. While an important work has been done on the issue of community detection, very little attention has been devoted to the analysis of the community structure. In this paper, we present an extensive investigation of the overlapping community network deduced from a large-scale co-authorship network. The nodes of the overlapping community network rep-resent the functional communities of the co-authorship network, and the links account for the fact that communities share some nodes in the co-authorship network. The comparative evaluation of the topological properties of these two networks shows that they share similar topological properties. These results are very interesting. Indeed, the network of communities seems to be a good representative of the original co-authorship network. With its smaller size, it may be more practical in order to realize various analyses that cannot be performed easily in large-scale real-world networks.","PeriodicalId":195062,"journal":{"name":"2014 7th International Conference on u- and e- Service, Science and Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126620755","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 Study on Rough-Fuzzy Predicate Calculus","authors":"G. Ganesan, B. Satish","doi":"10.1109/UNESST.2014.9","DOIUrl":"https://doi.org/10.1109/UNESST.2014.9","url":null,"abstract":"As Rough Sets and Fuzzy Logic find various applications, several researchers concentrate on hybridizing these techniques. In this line, G.Ganesan et.al., has laid a foundation on hybridized logic. In this paper, we study the implication rules, equivalence rules and quantifiers on fuzzy predicates through rough computing.","PeriodicalId":195062,"journal":{"name":"2014 7th International Conference on u- and e- Service, Science and Technology","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132099689","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":"Outsourcing E-Learning Project in Museums: Case Studies of Public Museums in Taiwan","authors":"K. Huang","doi":"10.1109/UNESST.2014.14","DOIUrl":"https://doi.org/10.1109/UNESST.2014.14","url":null,"abstract":"This article describes the outsourcing of e-learning projects in museums. Because most museums do not have a dedicated unit to develop the e-learning system, they outsource the e-learning project to outside firms. In public museums, the administration usually manage the outsourced e-learning projects as a traditional transaction under standard procedures. In this study, the author pointed out the advantages and limitations of cooperation in several e-learning projects in museums based on perspectives of the relationship of host and outsourcing company. In the end, suggestions for outsourcing practices were summarized through these case studies.","PeriodicalId":195062,"journal":{"name":"2014 7th International Conference on u- and e- Service, Science and Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117046267","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}