Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775667
Y. Khalil, Adel Said Elmaghraby
Operational continuity of data centers faces challenges by experienced cyber attackers and occasional natural disasters. Assessment of a data center's resilience for complex and realistic scenarios is very important for various reasons such as: system specification, design and enhancement. Yet data center resilience evaluation is a demanding process because of the complexity of its systems and the multidimensional aspects required for a resilient system. This paper illustrates data center resilience evaluation test-bed and its monitoring system. This test-bed can provide a realistic testing environment and capable to implement multiple operating and attacking scenarios.
{"title":"Data Center Resilience Evaluation Test-bed: Design and Implementation","authors":"Y. Khalil, Adel Said Elmaghraby","doi":"10.1109/ISSPIT.2008.4775667","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775667","url":null,"abstract":"Operational continuity of data centers faces challenges by experienced cyber attackers and occasional natural disasters. Assessment of a data center's resilience for complex and realistic scenarios is very important for various reasons such as: system specification, design and enhancement. Yet data center resilience evaluation is a demanding process because of the complexity of its systems and the multidimensional aspects required for a resilient system. This paper illustrates data center resilience evaluation test-bed and its monitoring system. This test-bed can provide a realistic testing environment and capable to implement multiple operating and attacking scenarios.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130380859","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775684
M. Frackiewicz, H. Palus
The main goal of colour quantization methods is a colour reduction with minimum colour error. In this paper were investigated six following colour quantization techniques: the classical median cut, improved median cut, clustering k-means technique in two colour versions (RGB, CIELAB) and also two versions of relative novel technique named k-harmonic means. The comparison presented here was based on testing of ten natural colour images for quantization into 16, 64 and 256 colours. In evaluation process two criteria were used: the mean squared quantization error (MSE) and the average error in the CIELAB colour space (DeltaE). During tests the efficiency of k-harmonic means applied to colour quantization has been proved.
{"title":"Clustering with K-Harmonic Means Applied to Colour Image Quantization","authors":"M. Frackiewicz, H. Palus","doi":"10.1109/ISSPIT.2008.4775684","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775684","url":null,"abstract":"The main goal of colour quantization methods is a colour reduction with minimum colour error. In this paper were investigated six following colour quantization techniques: the classical median cut, improved median cut, clustering k-means technique in two colour versions (RGB, CIELAB) and also two versions of relative novel technique named k-harmonic means. The comparison presented here was based on testing of ten natural colour images for quantization into 16, 64 and 256 colours. In evaluation process two criteria were used: the mean squared quantization error (MSE) and the average error in the CIELAB colour space (DeltaE). During tests the efficiency of k-harmonic means applied to colour quantization has been proved.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133258354","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775656
S. Hamad, R. Ammar, M. E. Khalifa, T. Fergany
Distributed Object Oriented (DOO) applications have been developed for solving complex problems in various scientific fields. One of the most important aspects of the DOO systems is the efficient distribution of software classes among different nodes in order to solve the mismatch problem that may appear when the software structure does not match up the available hardware organization. We have proposed a multistep approach for restructuring DOO software. According to this approach, the OO system is partitioned into clusters that are then merged into larger groups forming what we call Merged Cluster Graph. The last step in this approach is concerned by mapping these merged clusters onto the target distributed architecture. Generally, the mapping problem is intractable thus allowing only for efficient heuristics. This paper presents two algorithms to solve the mapping problem using a randomized approach. The proposed algorithms has proved to be efficient, Simple and easy to understand and implement. Furthermore, the performance of the proposed algorithms was tested against some existing deterministic techniques. The experimental results showed an outstanding performance of the proposed algorithms in minimizing the overall mapping cost of the produced assignments.
{"title":"Randomized Algorithms for Mapping Clustered Object-Oriented Software onto Distributed Architectures","authors":"S. Hamad, R. Ammar, M. E. Khalifa, T. Fergany","doi":"10.1109/ISSPIT.2008.4775656","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775656","url":null,"abstract":"Distributed Object Oriented (DOO) applications have been developed for solving complex problems in various scientific fields. One of the most important aspects of the DOO systems is the efficient distribution of software classes among different nodes in order to solve the mismatch problem that may appear when the software structure does not match up the available hardware organization. We have proposed a multistep approach for restructuring DOO software. According to this approach, the OO system is partitioned into clusters that are then merged into larger groups forming what we call Merged Cluster Graph. The last step in this approach is concerned by mapping these merged clusters onto the target distributed architecture. Generally, the mapping problem is intractable thus allowing only for efficient heuristics. This paper presents two algorithms to solve the mapping problem using a randomized approach. The proposed algorithms has proved to be efficient, Simple and easy to understand and implement. Furthermore, the performance of the proposed algorithms was tested against some existing deterministic techniques. The experimental results showed an outstanding performance of the proposed algorithms in minimizing the overall mapping cost of the produced assignments.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130836492","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775705
F. Garcia-Ugalde, B. Psenicka
First part of this paper a very simple algorithm for the design of a second-order state-space digital filter (SDF) was developed on the condition that the sensitivity of the coefficients in the state-space digital filter (SDF) are spread uniformly to all coefficients of the SDF. In the second part, section III, was developed a matrix algorithm for designing state-space digital filters for arbitrary filter order without low coefficient sensitivity.
{"title":"On the design of state-space digital filters","authors":"F. Garcia-Ugalde, B. Psenicka","doi":"10.1109/ISSPIT.2008.4775705","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775705","url":null,"abstract":"First part of this paper a very simple algorithm for the design of a second-order state-space digital filter (SDF) was developed on the condition that the sensitivity of the coefficients in the state-space digital filter (SDF) are spread uniformly to all coefficients of the SDF. In the second part, section III, was developed a matrix algorithm for designing state-space digital filters for arbitrary filter order without low coefficient sensitivity.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127771707","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775650
V. Cherkashyn, R. Kountchev, D. He, R. Kountcheva
New adaptive method for image compression based on pyramid decomposition with neural networks with error back propagation (BPNN) is presented in this paper. The processed image is divided in blocks and then each is compressed in the space of the hidden layers of 3-layer BPNNs, which build the so-called inverse difference pyramid. The results of the new method modeling are compared with these, obtained using the image compression standards JPEG and JPEG2000.
{"title":"Adaptive Image Pyramidal Representation","authors":"V. Cherkashyn, R. Kountchev, D. He, R. Kountcheva","doi":"10.1109/ISSPIT.2008.4775650","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775650","url":null,"abstract":"New adaptive method for image compression based on pyramid decomposition with neural networks with error back propagation (BPNN) is presented in this paper. The processed image is divided in blocks and then each is compressed in the space of the hidden layers of 3-layer BPNNs, which build the so-called inverse difference pyramid. The results of the new method modeling are compared with these, obtained using the image compression standards JPEG and JPEG2000.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126097710","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775668
M. Fahmy, G. Raheem, U. S. Mohamed, O. Fahmy, G. Fahmy
In this paper we briefly describe the results of a recent research on how to construct and implement Bspline wavelet basis. Next, a novel technique based on using Bspline wavelet basis, is proposed for signal de-noising and image compression. Extensive simulation results, have shown that the proposed technique competes very well with other methods using classical orthogonal and bi-orthogonal wavelets. Bsplines example are given.
{"title":"Denoising and Image Compression Using Bspline Wavelets","authors":"M. Fahmy, G. Raheem, U. S. Mohamed, O. Fahmy, G. Fahmy","doi":"10.1109/ISSPIT.2008.4775668","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775668","url":null,"abstract":"In this paper we briefly describe the results of a recent research on how to construct and implement Bspline wavelet basis. Next, a novel technique based on using Bspline wavelet basis, is proposed for signal de-noising and image compression. Extensive simulation results, have shown that the proposed technique competes very well with other methods using classical orthogonal and bi-orthogonal wavelets. Bsplines example are given.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130211347","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775715
A. Sapru, R. Lakkundi, N. Ahmed
Multimedia applications have revolutionized mobile phone usage, with emphasis on interaction between user and the phone. Camera being an integral part of new generation phones can be used to felicitate this interaction using machine vision techniques. Vision algorithms have been explored to be ported on to mobile devices, however due to real-time complexity limitation these algorithms have not been largely deployed in embedded mobile applications. In this paper we propose and implement a machine vision algorithm well suited for embedded applications. The algorithm uses a predefined angular motion of human arm for camera control purpose. The algorithm being low complex is also implemented on an OMAP 2420-H4 board, which is largely used by mobile phone manufacturers.
{"title":"Gesture Recognition by Line Fitting Over Significant Pixels","authors":"A. Sapru, R. Lakkundi, N. Ahmed","doi":"10.1109/ISSPIT.2008.4775715","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775715","url":null,"abstract":"Multimedia applications have revolutionized mobile phone usage, with emphasis on interaction between user and the phone. Camera being an integral part of new generation phones can be used to felicitate this interaction using machine vision techniques. Vision algorithms have been explored to be ported on to mobile devices, however due to real-time complexity limitation these algorithms have not been largely deployed in embedded mobile applications. In this paper we propose and implement a machine vision algorithm well suited for embedded applications. The algorithm uses a predefined angular motion of human arm for camera control purpose. The algorithm being low complex is also implemented on an OMAP 2420-H4 board, which is largely used by mobile phone manufacturers.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129661083","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775708
S. Hajipour, M. Shamsollahi, H. Mamaghanian, V. Abootalebi
The activity generated in the brain in response to external stimulations which is named the evoked potential (EP) is typically buried in the background EEG. Because of the low signal to noise ratio of EPs, it is difficult to record single trial evoked potentials. The traditional technique which is based on ensemble averaging destroys the dynamic information of single trials. In this paper, a new method has been proposed based on generalized eigen value decomposition to extract single trial EPs from single channel EEG recordings. The extraction of the N75-P100-N135 complex in simulated and actual visual evoked potentials is mainly taken under consideration. To illustrate the effectiveness of the proposed algorithm, it is compared with the iterative ICA method.
{"title":"Extracting Single Trial Visual Evoked Potentials Using Iterative Generalized Eigen Value Decomposition","authors":"S. Hajipour, M. Shamsollahi, H. Mamaghanian, V. Abootalebi","doi":"10.1109/ISSPIT.2008.4775708","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775708","url":null,"abstract":"The activity generated in the brain in response to external stimulations which is named the evoked potential (EP) is typically buried in the background EEG. Because of the low signal to noise ratio of EPs, it is difficult to record single trial evoked potentials. The traditional technique which is based on ensemble averaging destroys the dynamic information of single trials. In this paper, a new method has been proposed based on generalized eigen value decomposition to extract single trial EPs from single channel EEG recordings. The extraction of the N75-P100-N135 complex in simulated and actual visual evoked potentials is mainly taken under consideration. To illustrate the effectiveness of the proposed algorithm, it is compared with the iterative ICA method.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128809859","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775654
J. D. de Carvalho, H. Veiga, P. Gomes, A. Reis, R. Costa
Rapidly growing communication networks and high requirement applications have led to increasing demands on bandwidth. This development has been a motivation for the study of new technologies. It is the case of e.g. WiMAX (based on IEEE 802.16) that can be used to simply and quickly extend medium and long distance backbones at very competitive prices. In the present work an initial evaluation is made of this technology for point-to-point links, using Alvarion equipments. Several results are presented and discussed at OSI levels 3 and 4.
{"title":"A Contribution to Experimental Performance Evaluation of Point-to-Point WiMAX Links","authors":"J. D. de Carvalho, H. Veiga, P. Gomes, A. Reis, R. Costa","doi":"10.1109/ISSPIT.2008.4775654","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775654","url":null,"abstract":"Rapidly growing communication networks and high requirement applications have led to increasing demands on bandwidth. This development has been a motivation for the study of new technologies. It is the case of e.g. WiMAX (based on IEEE 802.16) that can be used to simply and quickly extend medium and long distance backbones at very competitive prices. In the present work an initial evaluation is made of this technology for point-to-point links, using Alvarion equipments. Several results are presented and discussed at OSI levels 3 and 4.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117181716","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}
Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775691
R. Mironov, R. Kountchev
A modified method for 2D adaptive interpolation of contour images of sign language interpreter is presented. The adaptation is based on the local information from the four neighborhood pixels of processed image and the interpolation kind is changed to zero or bi-linear one. The presented method is used in a system for transmission of contour images of sign language interpreter for deaf people training. The experimental results obtained by simulation of the developed algorithm show that the quality of interpolated images is better than that obtained with the classic low order (zero and first) 2D interpolation and the computational complexity is lower than that of the high order 2D interpolation (spline and cubic).
{"title":"Adaptive Contour Image Interpolation for Sign Language Interpretations","authors":"R. Mironov, R. Kountchev","doi":"10.1109/ISSPIT.2008.4775691","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775691","url":null,"abstract":"A modified method for 2D adaptive interpolation of contour images of sign language interpreter is presented. The adaptation is based on the local information from the four neighborhood pixels of processed image and the interpolation kind is changed to zero or bi-linear one. The presented method is used in a system for transmission of contour images of sign language interpreter for deaf people training. The experimental results obtained by simulation of the developed algorithm show that the quality of interpolated images is better than that obtained with the classic low order (zero and first) 2D interpolation and the computational complexity is lower than that of the high order 2D interpolation (spline and cubic).","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122793024","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：