{"title":"Multi-level Experience Retrieval for the Personal Lifelog Media System","authors":"Baud Haryo Prananto, Ig-Jae Kim, Hyoung-Gon Kim","doi":"10.1109/SITIS.2007.87","DOIUrl":"https://doi.org/10.1109/SITIS.2007.87","url":null,"abstract":"Personal lifelog media system stores and retrieves userpsilas every day experiences in the form of multimedia data format. This system involves huge amount of data and requires a metadata database system to enable user to retrieve the desired media efficiently. This paper proposes a multi-level abstracted metadata DB design to retrieve every day experiences in various ways with a user-friendly web interface. The simulated performance with real lifelog media data shows that suggested multi-level metadata DB structure can retrieve experience media data around four times more efficient compared with usual single-level annotation-based metadata database in the sense of retrieval time.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124740556","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":"An Adaptive Selection of the Scale and Orientation in Kernel Based Tracking","authors":"Qifeng Qiao, Dali Zhang, Yu Peng","doi":"10.1109/SITIS.2007.141","DOIUrl":"https://doi.org/10.1109/SITIS.2007.141","url":null,"abstract":"A new approach to adapt the kernel scale and orientation in real-time tracking is proposed. The iterative procedure, mean shift, is the key point to find the most credible target location. Though it performs well in some bad conditions, such as camera motion, partial occlusions, and background clutters, it has limited performance on tracking the object with the changing size. In this paper, the adaptive filters were modified and integrated with the mean shift process to estimate both the object position and the matrix describing the kernel shape. The previous states on both the position and the matrix are used to predict and maintain a better approximation of the kernel scale and orientation. Some experiments prove the superior performance of our new method. It has advantages in tracking the objects changing in scale or orientation and is less prone to the background clutter and occlusions.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127311436","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":"Computationally Efficient Quantitative Testing of Image Segmentation with a Genetic Algorithm","authors":"H. Al-Muhairi, M. Fleury, A. Clark","doi":"10.1109/SITIS.2007.100","DOIUrl":"https://doi.org/10.1109/SITIS.2007.100","url":null,"abstract":"Quantitative testing of segmentation algorithms implies rigorous testing against ground truth segmentations. Though under-reported in the literature, the performance of a segmentation algorithm depends on the choice of input parameters. The paper reports wide variety both in evaluation time and segmentation results for an example mean-shift algorithm. When testing extends over an algorithmpsilas parameter space, then the search for satisfactory settings has a considerable cost in time. This paper considers the use of a genetic algorithm (GA) to avoid an exhaustive search. As application of the GA drastically reduces search times, the paper investigates how best to apply the GA in terms of initial candidate population, convergence speed, and application of a final polishing round. The GA parameter search forms part of a three-component computation environment aimed at automating the search and reducing the evaluation time. The first component relies on scripted testing and collation of results. The second component transfers to a commodity cluster computer. And the third component applies a genetic algorithm to avoid an exhaustive search.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125161614","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":"An Efficient Strip-Mining Algorithm for Improving SRF Bandwidth Utilization on Imagine","authors":"Wenjing Yang, Jing Du, F. Ao, Xuejun Yang","doi":"10.1109/SITIS.2007.23","DOIUrl":"https://doi.org/10.1109/SITIS.2007.23","url":null,"abstract":"Strip-mining is a crucial technique for memory hierarchy optimization. In this paper, we propose an efficient strip-mining algorithm for improving SRF bandwidth utilization on Imagine. Firstly, we present how to determine the optimal kernel set for strip-mining. The process is based on a novel structure proposed by us, namely kernel reuse graph. Secondly, we select the optimal strip size, so as to achieve the tradeoff between stream reuse and stream prefetching. Finally, we propose the efficient strip-mining algorithm, which is implemented in Scompiler. The experiment results show that our strip-mining algorithm is a practical and promising solution to improve SRF locality and hide the memory access overhead effectively on Imagine.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123070143","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":"Improved Schemes for Node Clustering in Decentralized Peer-to-Peer Networks","authors":"Yanxiang He, Haowen Liu, Fubao Zhu","doi":"10.1109/SITIS.2007.13","DOIUrl":"https://doi.org/10.1109/SITIS.2007.13","url":null,"abstract":"Node Clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. In this work, We propose two distributed approaches for node clustering that based on the scaled coverage measure (SCM), a measure of the accuracy of the partition of the network into clusters. The novelty of our approaches is to process nodes in local vicinity in special orders. Simulation study shows that our approach derives a more accurate partition with less orphan nodes, and converges faster than previously proposed methods, for both random topologies and power law topologies.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124753438","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":"An Adaptive Collaborative Filtering Algorithm for Online Reputation Systems","authors":"Min Zuo, Jianhua Li, Gongshen Liu","doi":"10.1109/SITIS.2007.72","DOIUrl":"https://doi.org/10.1109/SITIS.2007.72","url":null,"abstract":"This paper presents an adaptive collaborative filtering algorithm to help users of online reputation systems avoid the misleading of dishonest ratings. This algorithm evaluates the trustworthiness of ratings by comparing the raterspsila opinions with the opinions of the evaluator, and gives the ratings proper weights before including them into the final judgment. Different weighting functions are applied to positive and negative ratings adaptively so that the weights can better capture the characteristics of various types of malicious raters. Simulations prove that the proposed algorithm can effectively avoid misleading ratings, minimize their bad influences on trust evaluation, and help users make more reliable trust decisions from a personal point of view.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121144612","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":"Distributed Frequent Closed Itemsets Mining","authors":"Chun Liu, Zheng Zheng, K. Cai, Shichao Zhang","doi":"10.1109/SITIS.2007.64","DOIUrl":"https://doi.org/10.1109/SITIS.2007.64","url":null,"abstract":"As many large organizations have multiple data sources and the scale of dataset becomes larger and larger, it is inevitable to carry out data mining in the distributed environment. In this paper, we address the problem of mining global frequent closed itemsets in distributed environment. A novel algorithm is proposed to obtain global frequent closed itemsets with exact frequency and it is shown that the algorithm can determine all the global frequent closed itemsets. A new data structure is developed to maintain the closed itemsets. Then an efficient implementation is provided based on the structure. Experimental results show that the proposed algorithm is effective.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128285070","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":"Searching Services \"on the Web\": A Public Web Services Discovery Approach","authors":"Chen Wu, E. Chang","doi":"10.1109/SITIS.2007.17","DOIUrl":"https://doi.org/10.1109/SITIS.2007.17","url":null,"abstract":"With the surge of Service-Oriented Architecture (SOA) and Web services, service discovery has become increasingly crucial. Public Web services that are available \"on the Web\" provide unlimited values for a great number of online service consumers and developers. However, the public UDDI Business Registry - the primary service discovery mechanism over the Internet - has been shut down permanently since 2006. This has raised serious problems for public Web services discovery. In this paper, we propose a WSDL-based public Web service discovery approach. It provides a simple-to-use yet effective Web service discovery mechanism that can retrieve relevant Web services directly from the Internet to suffice various requirements. The major contributions of this paper include: (1) a review on the state-of-the-art WSDL-based Web services discovery approaches; (2) the unique WSDL crawling and manipulation algorithms catering for the Vector Space Model, and (3) a proof-of-concept prototype - an online Web services search engine - based on the proposed approach.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131036338","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":"Content Synchronization in Replicated Grid Database Resources","authors":"M. Ciglan, L. Hluchý","doi":"10.1109/SITIS.2007.123","DOIUrl":"https://doi.org/10.1109/SITIS.2007.123","url":null,"abstract":"Widely used approach to increase data availability and fault tolerance in grid systems is the data replication. Most of the grid data management and data replication solutions deal purely with read-only data sets. There is a lack of the tools that enable the management of updatable grid database replicas. This work presents a set of services for the replica content synchronization, which are designed to support relational and XML data resources, provide the interoperability of heterogeneous systems and enable the utilization of proven methods for consistency handling to synchronize replicas in the heterogeneous grid environment. The main component of proposed system is the update propagation service that coordinates the functionality of other involved middleware services. We present the prototype implementation and summarize achieved results. The achievements include the empowerment of multiple legacy grid middleware components by increasing their availability and the tolerance to the faults.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132347830","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 Negotiation Efficiency and Success in Automated Trust Negotiation","authors":"Hongwei Lu, Bailing Liu","doi":"10.1109/SITIS.2007.27","DOIUrl":"https://doi.org/10.1109/SITIS.2007.27","url":null,"abstract":"Automated trust negotiation (ATN) is an approach that establishes mutual trust between strangers by gradually requesting and disclosing digitally signed credentials. Previous work on ATN mainly focuses on how to protect sensitive information about negotiators. However, the efficiency and success, which are primary goals of ATN, are not sufficiently considered. In this paper, we extend existing policy languages by adding two basic and expressive operators to them, which is one key to improve negotiation efficiency. Several problems that can not be effectively solved using traditional policy languages are presented, they can be effectively and efficiently settled by the extended policy languages, and several examples are also given. Furthermore, we develop an associated protocol taking advantages of oblivious signature based envelope (OSBE) and two new concepts explored in this paper. We also prove that the extended policy languages and the associated protocol together greatly improve negotiation efficiency and success under some conditions without sensitive information leakage in ATN.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114070066","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}