Pub Date : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866666
A. Diaconu
Nowadays, increasingly more, it seems that using the most popular games' sets of rules, particularly on new images' encryption algorithms designing branch, leads to crystallization of a new paradigm in the field of cryptography. Motivated by this, present paper aims to assess performances of a digital images' encryption scheme that uses chaos-based Sudoku Grids.
{"title":"An image encryption algorithm with a chaotic dynamical system based Sudoku Grid","authors":"A. Diaconu","doi":"10.1109/ICCOMM.2014.6866666","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866666","url":null,"abstract":"Nowadays, increasingly more, it seems that using the most popular games' sets of rules, particularly on new images' encryption algorithms designing branch, leads to crystallization of a new paradigm in the field of cryptography. Motivated by this, present paper aims to assess performances of a digital images' encryption scheme that uses chaos-based Sudoku Grids.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131689630","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866667
Ladislav Burita
The paper describes the Knowledge Management System (KMS) about military universities (MilUNI), mostly in the NATO environment, but it also includes all European countries. The goal of the MilUNI is to support the cooperation among universities in education, research, and the staff and students exchange. The KMS is based on the Topic Maps theory using the AToM (Aion Topic Maps engine) software. Special attention is paid to the ontology design, Knowledge Base (KB) development, and application processing when using the KMS. The KMS includes the KB with interface for administrator, architect, and editor and the Knowledge Portal for user access. The search procedures in the KMS are mentioned. The paper concludes with suggestions for the further development of the system.
{"title":"Knowledge Management System for military universities cooperation","authors":"Ladislav Burita","doi":"10.1109/ICCOMM.2014.6866667","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866667","url":null,"abstract":"The paper describes the Knowledge Management System (KMS) about military universities (MilUNI), mostly in the NATO environment, but it also includes all European countries. The goal of the MilUNI is to support the cooperation among universities in education, research, and the staff and students exchange. The KMS is based on the Topic Maps theory using the AToM (Aion Topic Maps engine) software. Special attention is paid to the ontology design, Knowledge Base (KB) development, and application processing when using the KMS. The KMS includes the KB with interface for administrator, architect, and editor and the Knowledge Portal for user access. The search procedures in the KMS are mentioned. The paper concludes with suggestions for the further development of the system.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124043907","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866753
Adelina Ochian, G. Suciu, O. Fratu, C. Voicu, Victor Suciu
Using heterogeneous clouds has been considered to improve performance of big-data analytics for healthcare platforms. However, the problem of the delay when transferring big-data over the network needs to be addressed. The purpose of this paper is to analyze and compare existing cloud computing environments (PaaS, IaaS) in order to implement middleware services. Understanding the differences and similarities between cloud technologies will help in the interconnection of healthcare platforms. The paper provides a general overview of the techniques and interfaces for cloud computing middleware services, and proposes a cloud architecture for healthcare. Cloud middleware enables heterogeneous devices to act as data sources and to integrate data from other healthcare platforms, but specific APIs need to be developed. Furthermore, security and management problems need to be addressed, given the heterogeneous nature of the communication and computing environment. The present paper fills a gap in the electronic healthcare register literature by providing an overview of cloud computing middleware services and standardized interfaces for the integration with medical devices.
{"title":"An overview of cloud middleware services for interconnection of healthcare platforms","authors":"Adelina Ochian, G. Suciu, O. Fratu, C. Voicu, Victor Suciu","doi":"10.1109/ICCOMM.2014.6866753","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866753","url":null,"abstract":"Using heterogeneous clouds has been considered to improve performance of big-data analytics for healthcare platforms. However, the problem of the delay when transferring big-data over the network needs to be addressed. The purpose of this paper is to analyze and compare existing cloud computing environments (PaaS, IaaS) in order to implement middleware services. Understanding the differences and similarities between cloud technologies will help in the interconnection of healthcare platforms. The paper provides a general overview of the techniques and interfaces for cloud computing middleware services, and proposes a cloud architecture for healthcare. Cloud middleware enables heterogeneous devices to act as data sources and to integrate data from other healthcare platforms, but specific APIs need to be developed. Furthermore, security and management problems need to be addressed, given the heterogeneous nature of the communication and computing environment. The present paper fills a gap in the electronic healthcare register literature by providing an overview of cloud computing middleware services and standardized interfaces for the integration with medical devices.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129971866","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866670
Ning He, Shuoqing Yao, O. Yoshie
In this paper we introduce a novel approach that robust automatic speech features recognition of one's emotion is achieved in a classification model named decision forest. The 13th order of Mel-frequency ceptstrum coefficients (MFCC) vector is processed as the multivariate data that will be imported to our classifier. In order to draw underlying and inductive information behind the MFCC feature, our decision forest classifier contains two stages to make classification, a supervised clustering based pattern extraction stage and a soft discretization based decision forest stage. Finally, a Japanese emotion corpus used for training and evaluation is described in detail. The results in recognition of six discrete emotions exceeded a mean value of 81% recognition rate.
{"title":"Emotional speech classification in consensus building","authors":"Ning He, Shuoqing Yao, O. Yoshie","doi":"10.1109/ICCOMM.2014.6866670","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866670","url":null,"abstract":"In this paper we introduce a novel approach that robust automatic speech features recognition of one's emotion is achieved in a classification model named decision forest. The 13th order of Mel-frequency ceptstrum coefficients (MFCC) vector is processed as the multivariate data that will be imported to our classifier. In order to draw underlying and inductive information behind the MFCC feature, our decision forest classifier contains two stages to make classification, a supervised clustering based pattern extraction stage and a soft discretization based decision forest stage. Finally, a Japanese emotion corpus used for training and evaluation is described in detail. The results in recognition of six discrete emotions exceeded a mean value of 81% recognition rate.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130774708","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866747
F. Popescu, F. Enache, I. Vizitiu, P. Ciotirnae
In this paper we propose a new approach for characterization of home appliances load signature (electrical fingerprint) from Recurrence Plot Analysis (RPA) perspective, with the goal of non-intrusive appliance load monitoring (NIALM), promoted as enabling technology to save energy consumption and to lower consumers electrical bills. In our research work, RPA is adopted as an analysis tool of non-linear load current waveform in phase space and it is considered as innovative signal processing method alongside the traditional time and frequency based methods.
{"title":"Recurrence Plot Analysis for characterization of appliance load signature","authors":"F. Popescu, F. Enache, I. Vizitiu, P. Ciotirnae","doi":"10.1109/ICCOMM.2014.6866747","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866747","url":null,"abstract":"In this paper we propose a new approach for characterization of home appliances load signature (electrical fingerprint) from Recurrence Plot Analysis (RPA) perspective, with the goal of non-intrusive appliance load monitoring (NIALM), promoted as enabling technology to save energy consumption and to lower consumers electrical bills. In our research work, RPA is adopted as an analysis tool of non-linear load current waveform in phase space and it is considered as innovative signal processing method alongside the traditional time and frequency based methods.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127960221","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}
In this paper we present an electronic voting system based on Homomorphic encryption to ensure anonymity, privacy, and reliability in the voting. Homomorphic encryption is a subset of privacy homomorphism. It is capable of computing the encrypted data directly and also encrypting the result of the operation automatically. For this reason it has a wide range of applications including secure multi-party computation, database encryption, electronic voting, etc. In this paper, we make use of the homomorphic encryption mechanism to design and implement an electronic voting system that supports the separation of privileges among voters, tellers, and announcers. Our experimental results show the system not only ensures anonymity in voting but also presents cheating during the counting process.
{"title":"An anonymous voting system based on homomorphic encryption","authors":"Yingming Zhao, Yue Pan, Sanchao Wang, Junxing Zhang","doi":"10.1109/ICCOMM.2014.6866682","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866682","url":null,"abstract":"In this paper we present an electronic voting system based on Homomorphic encryption to ensure anonymity, privacy, and reliability in the voting. Homomorphic encryption is a subset of privacy homomorphism. It is capable of computing the encrypted data directly and also encrypting the result of the operation automatically. For this reason it has a wide range of applications including secure multi-party computation, database encryption, electronic voting, etc. In this paper, we make use of the homomorphic encryption mechanism to design and implement an electronic voting system that supports the separation of privileges among voters, tellers, and announcers. Our experimental results show the system not only ensures anonymity in voting but also presents cheating during the counting process.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125545735","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866766
A. Paun, C. Vladeanu
This paper presents an analytical study on the outage performance of dual-hop amplify-and-forward relaying systems operating over flat Nakagami-m fading channels. More specifically, the cumulative distribution function (CDF) of the end-to-end signal-to-noise ratio (SNR) is derived. We consider the case of non-integer values for fading shape factors, m, at each of two consecutive hops. The tighter analytical expression for the CDF, obtained using the bivariate H-function and G-function, is applied to evaluate the outage probability of the system under study. The analytical results of the outage probability are in accordance with Monte-Carlo simulation results and outperform the previously reported upper bounds for the low and medium SNR.
{"title":"On the outage probability of dual-hop AF relaying over Nakagami-m fading channels","authors":"A. Paun, C. Vladeanu","doi":"10.1109/ICCOMM.2014.6866766","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866766","url":null,"abstract":"This paper presents an analytical study on the outage performance of dual-hop amplify-and-forward relaying systems operating over flat Nakagami-m fading channels. More specifically, the cumulative distribution function (CDF) of the end-to-end signal-to-noise ratio (SNR) is derived. We consider the case of non-integer values for fading shape factors, m, at each of two consecutive hops. The tighter analytical expression for the CDF, obtained using the bivariate H-function and G-function, is applied to evaluate the outage probability of the system under study. The analytical results of the outage probability are in accordance with Monte-Carlo simulation results and outperform the previously reported upper bounds for the low and medium SNR.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126494719","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866718
D. Popescu, M. Varga, V. Bota
The increased demand of spectrally efficient wireless transmissions requires accurate performance prediction mechanisms. A promising prediction method for OFDM transmission using convolutional turbo codes is based on the mean mutual information per coded bits. This paper aims to study the accuracy provided by the theoretical method used to compute the mean mutual information per coded bit presented in literature by comparison to the results obtained from measurements. The results obtained showed that for point-to-point transmissions over both Gaussian and frequency-selective channels, the theoretical method provides good accuracies while for coordinated multipoint transmissions over frequency-selective channels, the analytical method loses its accuracy as the distributions of the combined LLRs can no longer be considered combinations of Gaussian distributions.
{"title":"Accuracy evaluation of the theoretical approximation of the mean mutual information per coded bit in coordinated multi point transmissions","authors":"D. Popescu, M. Varga, V. Bota","doi":"10.1109/ICCOMM.2014.6866718","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866718","url":null,"abstract":"The increased demand of spectrally efficient wireless transmissions requires accurate performance prediction mechanisms. A promising prediction method for OFDM transmission using convolutional turbo codes is based on the mean mutual information per coded bits. This paper aims to study the accuracy provided by the theoretical method used to compute the mean mutual information per coded bit presented in literature by comparison to the results obtained from measurements. The results obtained showed that for point-to-point transmissions over both Gaussian and frequency-selective channels, the theoretical method provides good accuracies while for coordinated multipoint transmissions over frequency-selective channels, the analytical method loses its accuracy as the distributions of the combined LLRs can no longer be considered combinations of Gaussian distributions.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116609490","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866697
Laura Vegh, L. Miclea
In a time where technologies come and go, when most of the areas of our lives are rely one way or another on electronic devices and the internet, security is a crucial aspect, always needed. Technologies may rise and fall, but the area of security remains necessary at all times. For this reason the research for new algorithms, new and improved methods is constant. Cyber-physical systems are designed as a network of interconnected devices with physical input and output and represent a new direction in the information systems world. In the present paper we present a solution for the security of communication in cyber-physical systems with hierarchical access by combining cryptography and steganography.
{"title":"Securing communication in cyber-physical systems using steganography and cryptography","authors":"Laura Vegh, L. Miclea","doi":"10.1109/ICCOMM.2014.6866697","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866697","url":null,"abstract":"In a time where technologies come and go, when most of the areas of our lives are rely one way or another on electronic devices and the internet, security is a crucial aspect, always needed. Technologies may rise and fall, but the area of security remains necessary at all times. For this reason the research for new algorithms, new and improved methods is constant. Cyber-physical systems are designed as a network of interconnected devices with physical input and output and represent a new direction in the information systems world. In the present paper we present a solution for the security of communication in cyber-physical systems with hierarchical access by combining cryptography and steganography.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134165911","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866755
Cezar Plesca, Luciana Morogan
Robust image hashing seeks to transform a given input image into a shorter hashed version using a key-dependent non-invertible transform. These hashes find extensive applications in content authentication, image indexing for database search and watermarking. Modern robust hashing algorithms consist of feature extraction, a randomization stage to introduce non-invertibility, followed by quantization and binary encoding to produce a binary hash. This paper describes a novel algorithm for generating an image hash based on Log-Polar transform features. The Log-Polar transform is a part of the Fourier-Mellin transformation, often used in image recognition and registration techniques due to its invariant properties to geometric operations. First, we show that the proposed perceptual hash is resistant to content-preserving operations like compression, noise addition, moderate geometric and filtering. Second, we illustrate the discriminative capability of our hash in order to rapidly distinguish between two perceptually different images. Third, we study the security of our method for image authentication purposes. Finally, we show that the proposed hashing method can provide both excellent security and robustness.
{"title":"Efficient and robust perceptual hashing using log-polar image representation","authors":"Cezar Plesca, Luciana Morogan","doi":"10.1109/ICCOMM.2014.6866755","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866755","url":null,"abstract":"Robust image hashing seeks to transform a given input image into a shorter hashed version using a key-dependent non-invertible transform. These hashes find extensive applications in content authentication, image indexing for database search and watermarking. Modern robust hashing algorithms consist of feature extraction, a randomization stage to introduce non-invertibility, followed by quantization and binary encoding to produce a binary hash. This paper describes a novel algorithm for generating an image hash based on Log-Polar transform features. The Log-Polar transform is a part of the Fourier-Mellin transformation, often used in image recognition and registration techniques due to its invariant properties to geometric operations. First, we show that the proposed perceptual hash is resistant to content-preserving operations like compression, noise addition, moderate geometric and filtering. Second, we illustrate the discriminative capability of our hash in order to rapidly distinguish between two perceptually different images. Third, we study the security of our method for image authentication purposes. Finally, we show that the proposed hashing method can provide both excellent security and robustness.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116712630","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
扫码关注我们
求助内容：
应助结果提醒方式：