2008 IEEE International Conference on Signal Image Technology and Internet Based Systems最新文献_第5页

Computing the Probabilities of Operations in Vector Models for Uncertain Spatial Data 计算不确定空间数据矢量模型的操作概率

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.23

Erlend Tøssebro, M. Nygård

引用次数: 2

An Ontology-Based Reuse Approach for Information Systems Engineering 基于本体的信息系统工程重用方法

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.88

P. Ramadour, C. Cauvet

{"title":"An Ontology-Based Reuse Approach for Information Systems Engineering","authors":"P. Ramadour, C. Cauvet","doi":"10.1109/SITIS.2008.88","DOIUrl":"https://doi.org/10.1109/SITIS.2008.88","url":null,"abstract":"In the world-wide web context, availability of software components increases the possibility of applying a reuse approach in software development. Thus, component retrieval is a key problem, both for software industry and for end-users, moreover for open source community which uses more and more components-based software engineering approaches.The OMG has defined a unified framework for reusable items (so-called ¿assets¿) descriptions. Even if this framework supports description of a large variety of components, it reduces retrieval aspects to keywords search without considering user¿s profile and user¿s need within the current task. We believe that the retrieval difficulty is related to the crucial problem of interaction between component providers and users (i.e. the consumers). This interaction can be supported and even automated by increasing the expressiveness of the language used for encoding component properties and formulating queries, enhancing therefore the quality of the retrieval. In this research, we propose to use common ontologies for representing user¿s profiles, user¿s needs and semantic knowledge of the components. These ontologies also support reasoning on components and matching of provided and required components. The approach makes use of business domain ontologies and ontology of the domain of information system engineering. The paper describes how these ontologies can be used both at design time for asset descriptions and user¿s profiles definition and at reuse time for matching user¿s requirements, user¿s profiles and asset descriptors.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131915843","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}

引用次数: 2

Admon: I/O Workload Management by ViSaGe Administration and Monitoring Service Admon: I/O工作负载管理由ViSaGe管理和监控服务

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.65

S. Traboulsi, J. Jorda, A. Mzoughi

{"title":"Admon: I/O Workload Management by ViSaGe Administration and Monitoring Service","authors":"S. Traboulsi, J. Jorda, A. Mzoughi","doi":"10.1109/SITIS.2008.65","DOIUrl":"https://doi.org/10.1109/SITIS.2008.65","url":null,"abstract":"Virtualization in grid environments is a recent way to improve platform usage. ViSaGe is a middleware designed to provide set of functionalities needed for storage virtualizaion: transparent reliable remote access to data and distributed data management. ViSaGe aggregates distributed physical storage resources. However, ensuring the performances of data access in grid environment is a major issue, as large amount of data are stored and constantly accessed, and directly involved into tasks execution time. Especially, the placement and selection of replicated data are made particularly difficult because of the dynamic nature of grid environments - grid nodes workload variations. The workload variations represent the state of the system resources (CPU, disks and networks). These variations are mainly perceived by a monitoring system. Several monitoring systems exist in the literature. They monitor system resources consumption and applications but none of these systems presents the whole of the pertinent characteristics for ViSaGe. ViSaGe needs a system that analyzes nodes workload during runtime execution for improving data storage management. Therefore, ViSaGe Administration and monitoring service, namely Admon, is proposed. In this paper, we present Admon and its workload prediction model. Admon allows to dynamically placing data according to resources usage, especially disk I/O workload, ensuring the best performances while limiting the monitoring overhead. Experiments show the relevance of Admon decisions.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133918445","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}

引用次数: 0

Evaluation of Twig Pattern Queries Based on Ordered Tree Matching 基于有序树匹配的小枝模式查询评估

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.32

Yangjun Chen, D. Cooke

引用次数: 1

Databases of Personal Identifiable Information 个人身份资料资料库

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.49

S. Al-Fedaghi, B. Thalheim

引用次数: 7

A Fast Fingerprint Classification Algorithm by Tracing Ridge-Flow Patterns 基于脊流模式的指纹快速分类算法

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.101

N. Nain, Bhavitavya Bhadviya, B. Gautham, D. Kumar, B. Deepak

引用次数: 17

Core Labeling: A New Way to Compress Transitive Closure 核心标注:压缩传递闭包的一种新方法

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.31

Yangjun Chen, Yibin Chen

{"title":"Core Labeling: A New Way to Compress Transitive Closure","authors":"Yangjun Chen, Yibin Chen","doi":"10.1109/SITIS.2008.31","DOIUrl":"https://doi.org/10.1109/SITIS.2008.31","url":null,"abstract":"A graph reachability query, as one of the primary tasks in numerous applications, is to find whether two given data objects, u and v, are related in any way in a large and complex dataset. Formally, the query is about to find if v is reachable from u in a directed graph which is large in size. In this paper, we focus ourselves on building a reachability labeling for large directed graphs, in order to process reachability queries efficiently. A new approach is proposed to compress transitive closure to support reachability checkings. The approach consists of two schemes, called Core-I labeling and Core-II labeling, respectively. For a graph G with n nodes and e edges, the labeling time of Core-I is bounded by O(n + e + t¿min{b, s}), where b is the number of the leaf nodes of a spanning tree of G, t is the number of non-tree edges (edges that do not appear in the spanning tree) and s is the number of the start nodes of all non-tree edges in G. The space overhead is bounded by O(n + s¿min{b, s}) and the querying time is O(log(min{b, s})). Core-II needs O(n + e + t¿min{b, s} + d¿s¿logmin{b, s}) labeling time and O(n + d¿s) space, where d is the number of the end nodes of all non-tree edges in G. But the query time is reduced to O(1). Experiments have been performed, showing that our method is promising.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123223492","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}

引用次数: 3

Design Space Exploration for a Custom VLIW Architecture: Direct Photo Printer Hardware Setting Using VEX Compiler 自定义VLIW架构的设计空间探索:使用VEX编译器直接设置照片打印机硬件

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.69

D. Saptono, V. Brost, Fan Yang, E. Prasetyo

引用次数: 12

Improved Geometric Warping-Based Watermarking 改进的几何翘曲水印

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.36

Dima Pröfrock, M. Schlauweg, E. Müller

{"title":"Improved Geometric Warping-Based Watermarking","authors":"Dima Pröfrock, M. Schlauweg, E. Müller","doi":"10.1109/SITIS.2008.36","DOIUrl":"https://doi.org/10.1109/SITIS.2008.36","url":null,"abstract":"In this paper, we propose a blind geometric warping-based watermarking for images and videos. We put emphasis on high robustness and security as well as decreased complexity. Our previous works have shown that the geometric structure of images and videos is a suitable embedding domain for watermark information. To describe the geometric structure, detection or segmentation methods are used, which can result in additional security holes, in more required computing effort, in loss of robustness and in loss of watermark blindness. In this work, we propose a watermarking approach that doesn¿t use detection and segmentation processes. Our watermark approach is based on the result of a filtering that is used to describe the geometric structure. Additionally, an efficient realisation of the filter is developed and a scheme of watermark embedding is proposed. The watermark bits are spreaded over the whole frame and coded in the spatial positions of edges and corners. We show that the resulting watermark can be embedded without visible quality degradations. Beside of this, it achieves high robustness to strong lossy compression and other distortions at a high watermark capacity.For example, a H.264/AVC compression that degrades the video quality down to PSNR of 20.6 dB induces a watermark Bit Error Rate of 0.0013 at a watermark capacity of 20 bits per frame.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116890171","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}

引用次数: 1

An Analysis of Approaches to XML Schema Inference XML模式推理方法分析

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems Pub Date : 2008-11-30 DOI: 10.1109/SITIS.2008.12

I. Holubová

引用次数: 15