{"title":"Provenance Collection in Reservoir Management Workflow Environments","authors":"Fan Sun, Jing Zhao, K. Gomadam, V. Prasanna","doi":"10.1109/ITNG.2010.222","DOIUrl":"https://doi.org/10.1109/ITNG.2010.222","url":null,"abstract":"There has been a recent push towards applying information technology principles, such as workflows, to bring greater efficiency to reservoir management tasks. These workflows are data intensive in nature, and the data is derived from heterogenous data sources. This has placed an emphasis on the quality and reliability of data that is used in reservoir engineering applications. Data provenance is metadata that pertains to the history of the data and can be used to assess data quality. In this paper, we present an approach for collecting provenance information from application logs in the domain of reservoir engineering. In doing so, we address challenges due to: 1) the lack of a workflow orchestration framework in reservoir engineering and 2) the inability of many reservoir engineering applications to collect provenance information. We present an approach that uses the workflow instances detection algorithm and the Open Provenance Model (OPM) for capturing provenance information from the logs.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123020803","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":"Real-Time Monitoring of Fetus Movements and Uterine Contractions Using MEMS Acoustic Sensor","authors":"Sarwan Kumar, S. Anand, A. Sengupta","doi":"10.1109/ITNG.2010.161","DOIUrl":"https://doi.org/10.1109/ITNG.2010.161","url":null,"abstract":"In this paper, the parameters to be measured non- invasively are fetal movement and uterine contractions with the help of novel MEMS based piezoelectric sensor as these may impose stress on the fetus. The recording was performed on 10 pregnant women in the age group of 26-38 weeks of gestation. The sensor shows the good results.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"30 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120922065","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}
Steven R. Young, I. Arel, T. Karnowski, Derek C. Rose
{"title":"A Fast and Stable Incremental Clustering Algorithm","authors":"Steven R. Young, I. Arel, T. Karnowski, Derek C. Rose","doi":"10.1109/ITNG.2010.148","DOIUrl":"https://doi.org/10.1109/ITNG.2010.148","url":null,"abstract":"Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or batch) processing, in which the clustering process repeatedly sweeps through a set of data samples in an attempt to capture its underlying structure in a compact and efficient way. However, many recent applications require that the clustering algorithm be online, or incremental, in the that there is no a priori set of samples to process but rather samples are provided one iteration at a time. Accordingly, the clustering algorithm is expected to gradually improve its prototype (or centroid) constructs. Several problems emerge in this context, particularly relating to the stability of the process and its speed of convergence. In this paper, we present a fast and stable incremental clustering algorithm, which is computationally modest and imposes minimal memory requirements. Simulation results clearly demonstrate the advantages of the proposed framework in a variety of practical scenarios.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121168229","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":"Image Retrieval Using Color Moment Invariant","authors":"X. Duanmu","doi":"10.1109/ITNG.2010.231","DOIUrl":"https://doi.org/10.1109/ITNG.2010.231","url":null,"abstract":"This paper describes a new color image retrieval method using color moment invariant. The representative colors are computed from each image instead of being fixed in a given color space, thus allowing the feature representation to be accurate as well as compact. Different from previous methods, the proposed method uses small image descriptors and it is adaptive to the context of the image itself by a two-stage clustering technique. Experiments on the image library COIL-100 demonstrate the effectiveness of this method.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123882478","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 Task Oriented Hybrid Framework for Interface Architecture Design","authors":"Umer Rashid, M. A. Bhatti, I. A. Niaz","doi":"10.1109/ITNG.2010.160","DOIUrl":"https://doi.org/10.1109/ITNG.2010.160","url":null,"abstract":"Task Analysis techniques models the human activity for the computer based systems. The role of task analysis is vital in the interface design. In recent years, various task analysis techniques have been explored by the researchers, which include Hierarchical Task Analysis (HTA), Cognitive Task Analysis (CTA), Link Analysis (LA), and Timeline Analysis (TA). We have explored that task analysis techniques have certain limitations. They mostly discuss a particular type of domain specific problem. HTA discuss only functional decomposition of the main task into sub-tasks. CTA only models cognitive activity which leads quality attributes in interface design. LA models possible linkage among interface constructs. TA organizes interface artifacts with respect to time. Task Analysis techniques cannot discuss an architectural approach for interface design. Task Analysis techniques requires enhancements. We propose a hybrid framework for the interface architecture design. The proposed framework is based on the outcomes of HTA and CTA, and provides architectural approach to map outcomes of both techniques on interface design using LA and TA. The proposed framework organizes the system’s resources using resource model. The hybrid framework also provides the mapping mechanism for the interface architecture design by considering functional as well as quality attributes in the interface design. The proposed framework provides graphical notations for the task analysis which provides an architectural approach for interface design.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131576246","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":"Accurate Assessment of Link Loss Rate in Wireless Mesh Networks","authors":"Bing Qi, S. Biaz, Fangyang Shen","doi":"10.1109/ITNG.2010.229","DOIUrl":"https://doi.org/10.1109/ITNG.2010.229","url":null,"abstract":"A number of routing metrics have been proposed to select a path with better performance in wireless mesh networks. Most of them partially rely on link loss rates when evaluating the paths’ performance. Thus it is essential to accurately measure the link loss rate. Currently, a broadcast based probe mechanism is commonly used by routing metrics to estimate the link loss rates. However, this mechanism often yields inaccurate link loss rates. Based on our extensive simulations, we find out that the limitations of this mechanism are due to: 1) the use of basic (lowest) data rates to probe the loss rate while the link might be used with a higher data rate; 2) the assumption that links are symmetric, which is not true in real case; 3) the low number of packet probes used to measure the link loss rate. This work proposes appropriate solutions to the above weaknesses. Our experimental results indicate that the proposed modifications are able to measure the link loss rate with more accuracy.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127680787","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 Supervised Learning Method in Monitoring Linear Profile","authors":"S. Z. Hosseinifard, M. Abdollahian","doi":"10.1109/ITNG.2010.167","DOIUrl":"https://doi.org/10.1109/ITNG.2010.167","url":null,"abstract":"In some practical situations, the quality of a process or product is characterized by a relationship (profile) between a response variable and one or more explanatory variables. Such profiles can be modeled using linear or nonlinear regression models. In this paper we propose a supervised feed forward neural network to detect and classify drift shifts in linear profiles. The proposed method contains three networks and the efficacy of the model is assessed using average run length criterion.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128109618","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 Set Associative Cache Architecture","authors":"S. Subha","doi":"10.1109/ITNG.2010.130","DOIUrl":"https://doi.org/10.1109/ITNG.2010.130","url":null,"abstract":"Traditional set associative caches have fixed number of sets with fixed number of ways in each set. This paper proposes a new set associative architecture. The mapping of an address to a set is expanded to a subset of the number of sets by XOR'ing the address with 0, 1, 2, 4... (number of sets/2). The line is placed in any of the available ways in this mapping. If the cache is full, the cache is like a traditional set associative cache. The number of ways that a line can be placed in a partially filled cache is increased by this mapping. The algorithm is simulated on SPEC 2K benchmarks. An average decrease of 13% in average memory access time is observed. The average memory access time for 256.bzip2 shows degradation. The consumption of energy increases as a function of the cache size.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134224376","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":"Color Image Compression Using Wavelet and Ridgelet Transform","authors":"M. Joshi, R. R. Manthalhkar, Y. Joshi","doi":"10.1109/ITNG.2010.137","DOIUrl":"https://doi.org/10.1109/ITNG.2010.137","url":null,"abstract":"Image Compression is a widely explored research area. Many compression standards are existing. But still there is a scope for higher compression with quality reconstruction. The introduction of wavelets gave a different dimension to the compression. This paper aims at exploration of use of Ridgelet Transform and Wavelet Transform for color images. The Ridgelet Transform gives better PSNR performance over a wider range of percentage of retained coefficients. By selecting proper thresholding method, better results for PSNR have been obtained. Color images in the YCbCr color model are used. Extensive analysis has been carried out to arrive at the conclusion.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134634779","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 Private and Anonymous Data Repository Service","authors":"Jarrod Trevathan, W. Read","doi":"10.1109/ITNG.2010.108","DOIUrl":"https://doi.org/10.1109/ITNG.2010.108","url":null,"abstract":"This paper describes a security problem involving an online data repository which acts as a proxy for multiple companies allowing their customers to perform online services (e.g., pay invoices). The repository's host is trusted to honestly fulfil its duties in maintaining the data in a manner consistent with each companies' required services. However, the information stored by the repository remains private in that the repository's host cannot openly read any companies' operational data, nor does it learn the identities of any companies' customers. We contrast several approaches describing their viability for web deployment using existing technologies. This is a fundamentally new security problem with no established literature or clearly defined cryptographic solution. The project originated from a commercial attempt to design a secure online data archive that allows a customer to pay and view invoices online.","PeriodicalId":379699,"journal":{"name":"2010 Seventh International Conference on Information Technology: New Generations","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133039556","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}