2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks最新文献_第6页

Analysis of Interpolated FIR Filter for VoIP in Noisy Enviroment 噪声环境下VoIP的插值FIR滤波器分析

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.69

H. Singh, Sarabjeet Singh, R. Sarin, Jasvir Singh

引用次数: 2

A Discrete-Event Solver for Repairable Flow Networks with Complex Topology 复杂拓扑可修流网络的离散事件求解器

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.13

Michael T. Todinov

引用次数: 1

Discrete Time Linear Optimal Repetitive Control - A Low Order Controller Scheme 离散时间线性最优重复控制-一种低阶控制器方案

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.50

Youde Han, D. Owens, B. Chu

引用次数: 2

DTBSVMs: A New Approach for Road Sign Recognition dtbsvm:一种新的道路标志识别方法

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.17

Hossein Pazhoumand-dar, M. Yaghoobi

引用次数: 11

Data Mining Techniques for Modelling the Influence of Daily Extreme Weather Conditions on Grapevine, Wine Quality and Perennial Crop Yield 模拟每日极端天气条件对葡萄、葡萄酒品质和多年生作物产量影响的数据挖掘技术

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.15

S. Shanmuganathan, P. Sallis, A. Narayanan

引用次数: 10

Visualisation of Earth Deformation in 2D 二维地球变形可视化

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.29

Nor Anita Fairos bt. Ismail, S. N. Kamarudin, M. Rahim, Jianguo Liu, P. Mason

引用次数: 0

PAL: A Path Selection Algorithm for Life Critical Data 生命关键数据的路径选择算法

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.49

Sadik Armagan, Enda Fallon, Yuansong Qiao

{"title":"PAL: A Path Selection Algorithm for Life Critical Data","authors":"Sadik Armagan, Enda Fallon, Yuansong Qiao","doi":"10.1109/CICSyN.2010.49","DOIUrl":"https://doi.org/10.1109/CICSyN.2010.49","url":null,"abstract":"The real time data transmission facilities provided by Personal Area Networks (PAN) can improve both the life expectancy and living conditions of patients following cardiac surgery. The limited signal range of such devices however, coupled with the life critical nature of the data transferred places strict performance limits on the mobility protocol. The Stream Control Transmission Protocol (SCTP) can support mobility through its multi-homing feature. SCTP has 2 core features (1) analyzing performance metrics which trigger network migration (2) implementing the physical migration from one network path to another. We illustrate that as a transport layer protocol which adheres to protocol boundaries SCTP’s network evaluation is performance limited, as Bluetooth MAC retransmissions distort end-to-end calculations. We propose a division of functionality in which SCTP is responsible for network migration while we propose a new Path Selection Algorithm for Life Critical Data (PAL) which defines a Media Independent Handover (MIH) oriented trigger to control path switchover. PAL illustrates the importance of Bluetooth MAC retransmissions as a performance metric over traditional metrics such as Received Signal Strength (RSS).","PeriodicalId":358023,"journal":{"name":"2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks","volume":"29 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116198447","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

A Binomial Heap Algorithm for Self-Recognition in Exclusive Management on Autonomic Grid Networks 自主网格网络排他管理中自识别的二项堆算法

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.59

M. Bahrami, Peyman Arebi

引用次数: 2

H.264 Compressed Domain Watermarking in Content Delivery Network (CDN) Environment 内容分发网络(CDN)环境下的H.264压缩域水印

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.66

T. Chattopadhyay, Aniruddha Sinha, Asmita Hardikar

{"title":"H.264 Compressed Domain Watermarking in Content Delivery Network (CDN) Environment","authors":"T. Chattopadhyay, Aniruddha Sinha, Asmita Hardikar","doi":"10.1109/CICSyN.2010.66","DOIUrl":"https://doi.org/10.1109/CICSyN.2010.66","url":null,"abstract":"Over the years it has been observed that a hacker, finds it less difficult to break any encryption key, even though it may require large number of attempts, specially with advent of high-speed machines. Therefore, an encryption method alone is not sufficient for copyright protection and ownership authentication of stored and streamed videos. Digital watermarking techniques have been proposed for this purpose. A fast method of watermarking of streamed H.264 video data is proposed in the present work to meet the real time criteria of a streaming CDN server. The approach involves a blind watermarking scheme that inserts watermark in transformed coefficients of Independent Decoder Refresh (IDR) frames of the streamed H.264. As these IDR frames are then required to reconstruct the P frames, the proposed scheme can ensure security for both type of frames namely I and P. The method also may include a hashing technique to hash the entire group of pictures (GOP) into a 128-bit number. This number, in turn, is used as watermark for the next GOP to ensure the integrity feature of the watermarking scheme.","PeriodicalId":358023,"journal":{"name":"2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129057301","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

A Particle Swarm Optimization Approach for Routing in VLSI 超大规模集成电路中路由的粒子群优化方法

2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks Pub Date : 2010-07-28 DOI: 10.1109/CICSyN.2010.42

M. N. Ayob, Z. Yusof, Asrul Adam, A. F. Z. Abidin, I. Ibrahim, Z. Ibrahim, S. Sudin, N. Shaikh-Husin, M. Hani

{"title":"A Particle Swarm Optimization Approach for Routing in VLSI","authors":"M. N. Ayob, Z. Yusof, Asrul Adam, A. F. Z. Abidin, I. Ibrahim, Z. Ibrahim, S. Sudin, N. Shaikh-Husin, M. Hani","doi":"10.1109/CICSyN.2010.42","DOIUrl":"https://doi.org/10.1109/CICSyN.2010.42","url":null,"abstract":"The performance of very large scale integration (VLSI) circuits is depends on the interconnected routing in the circuits. In VLSI routing, wire sizing, buffer sizing, and buffer insertion are techniques to improve power dissipation, area usage, noise, crosstalk, and time delay. Without considering buffer insertion, the shortest path in routing is assumed having the minimum delay and better performance. However, the interconnect delay can be further improved if buffers are inserted at proper locations along the routing path. Hence, this paper proposes a heuristic technique to simultaneously find the optimal routing path and buffer location for minimal interconnect delay in VLSI based on particle swarm optimization (PSO). PSO is a robust stochastic optimization technique based on the movement and information sharing of swarms. In this study, location of doglegs is employed to model the particles that represent the routing solutions in VLSI. The proposed approach has a good potential in VLSI routing and can be further extended in future","PeriodicalId":358023,"journal":{"name":"2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123403411","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}

引用次数: 24