The 2nd International Conference on Distributed Frameworks for Multimedia Applications最新文献

A Generic Distributed Architecture for Business Computations. Application to Financial Risk Analysis 业务计算的通用分布式体系结构。在财务风险分析中的应用

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296915

A. DeFrance, S. Vialle, M. Wauquier, P. Akim, D. Dewnarain, R. Loutou, A. Methari

引用次数: 3

Light P2P platform of computing for DAG 用于DAG计算的轻型P2P平台

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296894

F. Hantz

引用次数: 2

Fast Dynamic Programming Based Sequence Alignment Algorithm 基于快速动态规划的序列比对算法

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296909

N. Rashid, R. Abdullah, A. Talib, Z. Ali

{"title":"Fast Dynamic Programming Based Sequence Alignment Algorithm","authors":"N. Rashid, R. Abdullah, A. Talib, Z. Ali","doi":"10.1109/DFMA.2006.296909","DOIUrl":"https://doi.org/10.1109/DFMA.2006.296909","url":null,"abstract":"Protein sequence alignment is basic operation mostly used in protein sequence analysis. The most optimal algorithm used in sequence alignment is based on the dynamic programming method. Smith-Waterman algorithm is the most commonly used dynamic programming based sequence alignment algorithm. However the algorithm uses quadratic time and space. Heuristic algorithm such as FASTA and BLAST were introduced to speed up the sequence alignment algorithm. FASTA is based on word search whereas BLAST is based on maximum segment pairs. In word search algorithm, lists of words from the query and database sequence are being compared to determine if two sequences have a region of sufficient similarity to merit further alignment using the Smith-Waterman Algorithm. All the different algorithms use the substitutions matrix based on the twenty alphabet amino acids. However research shows that reducing the number of amino acids to 10 does not affect the similarity measure. Our proposed algorithm uses the reduced amino acids alphabet to transform the protein sequences into a sequence of integer and uses n-gram to reduce the length of the sequence. Then the Smith-Waterman algorithm is used to get the similarity measure between two sequences. Result shows that the new proposed algorithm is as sensitive as the Smith-Waterman algorithm yet uses less space and performs better","PeriodicalId":333315,"journal":{"name":"The 2nd International Conference on Distributed Frameworks for Multimedia Applications","volume":"224 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133112146","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}

引用次数: 16

Java: From "Hard Coding" to Using an Integrated Development Environment Java:从“硬编码”到使用集成开发环境

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296905

Ali Kattan, R. Abdullah, R. A. Salam

引用次数: 1

Fragile Watermarking for medical Image Authentication 用于医学图像认证的脆弱水印

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296919

I.F. Kallel, M. Kallel, E. Garcia, M. Bouhlel

引用次数: 11

Screening of Diabetic Retinopathy - Automatic Segmentation of Optic Disc in Colour Fundus Images 糖尿病视网膜病变的筛选——彩色眼底图像视盘的自动分割

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296892

S. S. Lee, M. Rajeswari, D. Ramachandram, B. Shaharuddin

{"title":"Screening of Diabetic Retinopathy - Automatic Segmentation of Optic Disc in Colour Fundus Images","authors":"S. S. Lee, M. Rajeswari, D. Ramachandram, B. Shaharuddin","doi":"10.1109/DFMA.2006.296892","DOIUrl":"https://doi.org/10.1109/DFMA.2006.296892","url":null,"abstract":"In this paper, a novel approach to automatically segment the optic disc contour using the center point of an optic disc candidate is proposed. The optic disc segmentation algorithm consists of 2 stages. The first stage involves the removal of blood vessels that obscure the optic disc. The blood vessel structures are detected using morphological operations. These detected structures are then removed by anisotropic diffusion smoothing. The second stage involves the detection of edge points belonging to the optic disc-contour. A number of one dimensional intensity profiles which pass through the center point of optic disc region are then obtained at multiple angles with fixed angular intervals. The modulus maxima of each intensity profile are identified as a contour point for the optic disc. Among these contour points, some of the outliers are removed by re-positioning to a new position which complies with optic disc's shape using spline interpolation. Using these contour points, a coarse contour of the optic disc is constructed. Testing the approach on 23 colour fundus images demonstrates that the proposed algorithm is able to detect the optic disc contour to an accuracy of 92% to that drawn by a human expert","PeriodicalId":333315,"journal":{"name":"The 2nd International Conference on Distributed Frameworks for Multimedia Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132048547","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}

引用次数: 21

Minimizing Security Threats in Multimedia Systems 最小化多媒体系统中的安全威胁

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296907

H. Singh, A.K. Singh, S. Balasubramanian, A. Mohan

引用次数: 5

Assessment of Burst Assembly Algorithms using Real IPv4 Data Traces 使用真实IPv4数据轨迹的突发装配算法评估

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296912

N. M. Garcia, P. Monteiro, M. Freire

引用次数: 4

TEMIC: a New Cooperative Platform for Industrial Tele-Maintenance TEMIC:一个新的工业远程维护合作平台

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296902

M. Brahma, Martine Chaudier, Éric Garcia, Jean-Patrick Gelas, H. Guyennet, F. Hantz, L. Lefèvre, Pascal Lorenz, H. Tobiet

{"title":"TEMIC: a New Cooperative Platform for Industrial Tele-Maintenance","authors":"M. Brahma, Martine Chaudier, Éric Garcia, Jean-Patrick Gelas, H. Guyennet, F. Hantz, L. Lefèvre, Pascal Lorenz, H. Tobiet","doi":"10.1109/DFMA.2006.296902","DOIUrl":"https://doi.org/10.1109/DFMA.2006.296902","url":null,"abstract":"Since the year 2000, the performances that are obtained from the point of view of the networks processors make it possible to use real distribution applications. Particularly, in remote maintenance domain, the network quality makes it possible to have several expertises readily available. As a result, the quality of maintenance increases as it becomes faster, more reliable and highly efficient. The TEMIC tele-maintenance application connects mobile users (via their PDA terminal) to information systems in order to perform activities in areas such as corrective, preventive and conditional maintenance. The TEMIC tele-maintenance platform is based on a three-level architecture: collection and surveillance, intervention and reporting, diagnosis and collaboration. The use of wireless networks is one of the TEMIC distinctive characteristics, which allows connection between mobile tele-maintenance qualified actors. Another distinction is the design of active and autonomous industrial network devices that are easily and efficiently deployable in an industrial setup","PeriodicalId":333315,"journal":{"name":"The 2nd International Conference on Distributed Frameworks for Multimedia Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126102081","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}

引用次数: 5

Using Consistency Management Protocols Over a Communication Management Protocol 在通信管理协议上使用一致性管理协议

The 2nd International Conference on Distributed Frameworks for Multimedia Applications Pub Date : 2006-05-15 DOI: 10.1109/DFMA.2006.296897

J. Henriet

{"title":"Using Consistency Management Protocols Over a Communication Management Protocol","authors":"J. Henriet","doi":"10.1109/DFMA.2006.296897","DOIUrl":"https://doi.org/10.1109/DFMA.2006.296897","url":null,"abstract":"In collaborative environments, sharing notion is everywhere. Concurrency management protocols become very important. We have defined the Chameleon protocol which allows us to obtain a dynamic management of the collaborative architecture on the one hand, and on the other hand, we have improved our consistency management protocol and rendered it optimistic: the Pilgrim and the Optimistic Pilgrim. The originality of the Chameleon is to allow the virtual topology to be reconfigured dynamically Pilgrim protocol and its optimistic version Optimistic Pilgrim protocol manage shared data consistency over our CSCW platform. They are based on a token over a logical ring of sites and ownership mechanisms: each shared parameter has one site which is its owner. Nevertheless, problems may appear when one site becomes inactive according to the Chameleon. Indeed, if this site is the owner of a shared parameter according to one of the versions of the Pilgrim protocol, there may be ownerless shared parameters. Consequently, we have studied and analyzed the cases in which that kind of problem may occurs through a coloured Petri net model. Thus, all the protocols have been modified in order to work well together","PeriodicalId":333315,"journal":{"name":"The 2nd International Conference on Distributed Frameworks for Multimedia Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127751528","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