Pub Date : 2011-09-01DOI: 10.1109/ICAWST.2011.6163114
Dawei Zhang, F. Sun, Xu Cheng, Chao Liu
In order to solve the problem that enterprise-level users mass data storage and high-speed data processing services growth, and the traditional storage system can not meet the data services business growth, enterprise file cloud storage system is proposed. It is based on Hadoop, uses Linux cluster technology, distributed file systems and cloud computing framework, provides large-scale data storage and data storage flexible extension. This paper compares private cloud storage and traditional storage model, analyzes the advantage and feasibility of private cloud storage technology, presents mass data storage and data storage flexible extension methods based on Hadoop. Theoretical analysis shows that the enterprise private cloud storage platform is suit for critical business applications, online transaction processing, the platform can meet mass data storage, is easy to expand the scale of data.
{"title":"Research on hadoop-based enterprise file cloud storage system","authors":"Dawei Zhang, F. Sun, Xu Cheng, Chao Liu","doi":"10.1109/ICAWST.2011.6163114","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163114","url":null,"abstract":"In order to solve the problem that enterprise-level users mass data storage and high-speed data processing services growth, and the traditional storage system can not meet the data services business growth, enterprise file cloud storage system is proposed. It is based on Hadoop, uses Linux cluster technology, distributed file systems and cloud computing framework, provides large-scale data storage and data storage flexible extension. This paper compares private cloud storage and traditional storage model, analyzes the advantage and feasibility of private cloud storage technology, presents mass data storage and data storage flexible extension methods based on Hadoop. Theoretical analysis shows that the enterprise private cloud storage platform is suit for critical business applications, online transaction processing, the platform can meet mass data storage, is easy to expand the scale of data.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116512595","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163156
Dongyang Zhu, Xiaohong Ma
Mixing matrix is the key issue in the under-determined blind source separation with sparse representation. The performance of traditional clustering method degrades when the sources do not satisfy W-disjoint orthogonal condition. This paper puts forward an effective method, which sets less condition on the sparseness of the sources, to improve the estimation of the mixing matrix. Firstly, we detect the points in the time-frequency domain of the observations that only single source contributes. Samples at these points are more reliable for the mixing matrix estimation. Secondly, the number of sources, which often needs to be known a priori, is estimated through the characteristics of the observed signals. Finally, an improved initial cluster center selection method is presented for the defects of the traditional K-means cluster algorithm. The numerical performance of the proposed methods are provided highlighting their performance gain compared to existing ones, especially in the cases where the number of sources is unknown and the sources are relatively less sparse.
{"title":"Mixing matrix estimation based on single-source point identification and improved clustering method","authors":"Dongyang Zhu, Xiaohong Ma","doi":"10.1109/ICAWST.2011.6163156","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163156","url":null,"abstract":"Mixing matrix is the key issue in the under-determined blind source separation with sparse representation. The performance of traditional clustering method degrades when the sources do not satisfy W-disjoint orthogonal condition. This paper puts forward an effective method, which sets less condition on the sparseness of the sources, to improve the estimation of the mixing matrix. Firstly, we detect the points in the time-frequency domain of the observations that only single source contributes. Samples at these points are more reliable for the mixing matrix estimation. Secondly, the number of sources, which often needs to be known a priori, is estimated through the characteristics of the observed signals. Finally, an improved initial cluster center selection method is presented for the defects of the traditional K-means cluster algorithm. The numerical performance of the proposed methods are provided highlighting their performance gain compared to existing ones, especially in the cases where the number of sources is unknown and the sources are relatively less sparse.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131853943","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163147
Zhanjiang Zhi, Yi Sun
Image inpainting is an important work in the field of image processing. The basic idea of inpainting algorithm is to fill-in regions with available information from their surroundings. In this paper, we propose two image inpainting models based on variational method. The paper shows that the diffusion performance of the proposed models for image inpainting are superior to total variational (TV) model according to the physical characteristics in local coordinates. The experimental results show the effective performance of the proposed models in restoring text removal, scratched photos, and even removal of entire objects from images.
{"title":"Image inpainting based on energy minimization","authors":"Zhanjiang Zhi, Yi Sun","doi":"10.1109/ICAWST.2011.6163147","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163147","url":null,"abstract":"Image inpainting is an important work in the field of image processing. The basic idea of inpainting algorithm is to fill-in regions with available information from their surroundings. In this paper, we propose two image inpainting models based on variational method. The paper shows that the diffusion performance of the proposed models for image inpainting are superior to total variational (TV) model according to the physical characteristics in local coordinates. The experimental results show the effective performance of the proposed models in restoring text removal, scratched photos, and even removal of entire objects from images.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"449 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125799152","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163137
Mingwei Li, Zhibo Li
Wireless fidelity (Wi-Fi) is one of the most popular network technologies today. It is widely used in consumer electronics, industrial control and network monitoring. In this paper, we will introduce a real-time wireless image transmission system. This system is based on Wi-Fi module, ARM, and using the Linux operating system controls the wireless transceiver. In our system, we transmit images with variable size. The data rate of the system is 3Mbps at least and 15Mbps at most. The Wi-Fi module uses infrastructure mode network of IEEE802.11. The camera transmits data and command with PC through the wireless router.
{"title":"Design of embedded wireless network camera","authors":"Mingwei Li, Zhibo Li","doi":"10.1109/ICAWST.2011.6163137","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163137","url":null,"abstract":"Wireless fidelity (Wi-Fi) is one of the most popular network technologies today. It is widely used in consumer electronics, industrial control and network monitoring. In this paper, we will introduce a real-time wireless image transmission system. This system is based on Wi-Fi module, ARM, and using the Linux operating system controls the wireless transceiver. In our system, we transmit images with variable size. The data rate of the system is 3Mbps at least and 15Mbps at most. The Wi-Fi module uses infrastructure mode network of IEEE802.11. The camera transmits data and command with PC through the wireless router.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121727003","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163141
Xiaoqiong Tan, Ruimin Hu, Zhaoping Wang, Xuesong Cao
Traditional overlay multicast tree rearrange routing algorithm takes the approach of iterative optimization which is based on the residual degree, However in the sparse residual degree distribution, the proportion of optimization is low. This paper proposes a new algorithm of rerouting that is independent of residual degree, adopting Sorted sub-trees Exchange Strategy instead of residual degree migration strategy. The proposed approach can effectively reduce the overall delay. Experiments show that when remaining degree of the trees is less than 15% of the total, the proposed algorithm would enhance 5% –10% delay optimization ratio. The result can apply to the maintenance of the real-time group multimedia services distribution system, and can provide sustainable Quality of Service(QoS) for long time users.
{"title":"An optimized overlay multicast sub-tree rearrangement algorithm","authors":"Xiaoqiong Tan, Ruimin Hu, Zhaoping Wang, Xuesong Cao","doi":"10.1109/ICAWST.2011.6163141","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163141","url":null,"abstract":"Traditional overlay multicast tree rearrange routing algorithm takes the approach of iterative optimization which is based on the residual degree, However in the sparse residual degree distribution, the proportion of optimization is low. This paper proposes a new algorithm of rerouting that is independent of residual degree, adopting Sorted sub-trees Exchange Strategy instead of residual degree migration strategy. The proposed approach can effectively reduce the overall delay. Experiments show that when remaining degree of the trees is less than 15% of the total, the proposed algorithm would enhance 5% –10% delay optimization ratio. The result can apply to the maintenance of the real-time group multimedia services distribution system, and can provide sustainable Quality of Service(QoS) for long time users.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124948249","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163131
Jia-Chen Wang, Qiuhua Lin, F. Cong, V. Calhoun
The spatial components included in complex-valued functional magnetic resonance imaging (fMRI) data are generally assumed to be noncircular signals. In this paper, we try to quantitatively investigate the noncircularity of fMRI with a measure called the degree of impropriety (DOI). Two semi-blind complex ICA algorithms, the kurtosis maximization (KM) algorithm suitable for separating noncircular sources and the complex fastICA algorithm (CfastICA) derived for recovering circular signals, are performed to estimate the spatial components, and two kinds of fMRI data including a simulated complex-valued fMRI dataset and a real complex-valued fMRI data are used for DOI tests. Results show that, semi-blind KM algorithm always outperforms semi-blind CfastICA algorithm, the DOI indices for the estimated components from the real fMRI data are smaller than those from the simulated fMRI data but significantly larger than typical circular signals. Therefore, it is reasonable to conclude that the complex-valued components of fMRI are noncircular.
{"title":"A quantitative analysis of noncircularity for complex-valued fMRI based on semi-blind ICA","authors":"Jia-Chen Wang, Qiuhua Lin, F. Cong, V. Calhoun","doi":"10.1109/ICAWST.2011.6163131","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163131","url":null,"abstract":"The spatial components included in complex-valued functional magnetic resonance imaging (fMRI) data are generally assumed to be noncircular signals. In this paper, we try to quantitatively investigate the noncircularity of fMRI with a measure called the degree of impropriety (DOI). Two semi-blind complex ICA algorithms, the kurtosis maximization (KM) algorithm suitable for separating noncircular sources and the complex fastICA algorithm (CfastICA) derived for recovering circular signals, are performed to estimate the spatial components, and two kinds of fMRI data including a simulated complex-valued fMRI dataset and a real complex-valued fMRI data are used for DOI tests. Results show that, semi-blind KM algorithm always outperforms semi-blind CfastICA algorithm, the DOI indices for the estimated components from the real fMRI data are smaller than those from the simulated fMRI data but significantly larger than typical circular signals. Therefore, it is reasonable to conclude that the complex-valued components of fMRI are noncircular.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126394274","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163092
Jianhua Li, Jinri Yang
Edge detection with sub pixel accuracy is a vital step of vision measurement technology. In this paper, a novel sub-pixel edge detecting algorithm based on orthogonal moment is proposed. The proposed approach locates the edge points with different method for different edges. For the ideal edges, it uses the orthogonal moment based method, and for the blurred edges, the centroid based method is used. Experimental results demonstrate that the proposed method prevails in robustness and high precision compared with traditional method.
{"title":"A sub-pixel edge detection approach based on orthogonal moment","authors":"Jianhua Li, Jinri Yang","doi":"10.1109/ICAWST.2011.6163092","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163092","url":null,"abstract":"Edge detection with sub pixel accuracy is a vital step of vision measurement technology. In this paper, a novel sub-pixel edge detecting algorithm based on orthogonal moment is proposed. The proposed approach locates the edge points with different method for different edges. For the ideal edges, it uses the orthogonal moment based method, and for the blurred edges, the centroid based method is used. Experimental results demonstrate that the proposed method prevails in robustness and high precision compared with traditional method.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129040755","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163140
Xueming Wang, Fuming Sun, Dongxia Wang
In view of the problem in the image retrieval that the returned images don't match the query tag in the current fast-growing social media websites, i.e., the returned images from the web are irrelevant to the query, thus in this paper we improve the existing image ranking method which based on relevance of Bayesian and diversity of semantic, and take the representative into account in order to get better images results that we want. The final returned images results are generated by the algorithm proposed in this paper which takes relevance, diversity and representative into account and calculates the diverse score based on both the feature similarity and semantic similarity. The experimental results show its superior performance.
{"title":"Social image reranking with diversity, representative and relevance","authors":"Xueming Wang, Fuming Sun, Dongxia Wang","doi":"10.1109/ICAWST.2011.6163140","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163140","url":null,"abstract":"In view of the problem in the image retrieval that the returned images don't match the query tag in the current fast-growing social media websites, i.e., the returned images from the web are irrelevant to the query, thus in this paper we improve the existing image ranking method which based on relevance of Bayesian and diversity of semantic, and take the representative into account in order to get better images results that we want. The final returned images results are generated by the algorithm proposed in this paper which takes relevance, diversity and representative into account and calculates the diverse score based on both the feature similarity and semantic similarity. The experimental results show its superior performance.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"22 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124295139","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163107
Kyohei Watarai, Qiangfu Zhao, H. Hayashi
A Neural Network Tree (NNTree) is a hybrid learning model. NNTrees are more suitable for structural learning and can make decisions faster than normal neural networks. The goal of this research is to embed the NNTrees into different portable devices. To reach this goal, it is necessary to induce compact NNTrees that can be implemented easily on a chip. So far, we have tried several dimensionality reduction approaches, including principle component analysis (PCA), linear discriminant analysis (LDA), direct centroid (DC) approach, and discriminative multiple centroid (DMC) approach. In this paper, we investigate the discriminant rough null space (DRNS) approach.
{"title":"Inducing compact NNTrees using discriminant rough null space method","authors":"Kyohei Watarai, Qiangfu Zhao, H. Hayashi","doi":"10.1109/ICAWST.2011.6163107","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163107","url":null,"abstract":"A Neural Network Tree (NNTree) is a hybrid learning model. NNTrees are more suitable for structural learning and can make decisions faster than normal neural networks. The goal of this research is to embed the NNTrees into different portable devices. To reach this goal, it is necessary to induce compact NNTrees that can be implemented easily on a chip. So far, we have tried several dimensionality reduction approaches, including principle component analysis (PCA), linear discriminant analysis (LDA), direct centroid (DC) approach, and discriminative multiple centroid (DMC) approach. In this paper, we investigate the discriminant rough null space (DRNS) approach.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"38 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120885029","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 : 2011-09-01DOI: 10.1109/ICAWST.2011.6163109
R. Komiya, Incheon Paik, M. Hisada
Web applications make life more convenient through on the activities. Many web applications have several kind of user input (e.g. personal information, a user's comment of commercial goods, etc.) for the activities. However, there are various vulnerabilities in input functions of web applications. It is possible to try malicious actions using free accessibility of the web applications. The attacks by exploitation of these input vulnerabilities enable to be performed by injecting malicious web code; it enables one to perform various illegal actions, such as SQL Injection Attacks (SQLIAs) and Cross Site Scripting (XSS). These actions come down to theft, replacing personal information, or phishing. Many solutions have devised for the malicious web code, such as AMNESIA [1] and SQL Check [2], etc. The methods use parser for the code, and limited to fixed and very small patterns, and are difficult to adapt to variations. Machine learning method can give leverage to cover far broader range of malicious web code and is easy to adapt to variations and changes. Therefore, we suggests adaptable classification of malicious web code by machine learning approach such as Support Vector Machine (SVM)[3], Naïve-Bayes[4], and k-Nearest Neighbor Algorithm[5] for detecting the exploitation user inputs.
{"title":"Classification of malicious web code by machine learning","authors":"R. Komiya, Incheon Paik, M. Hisada","doi":"10.1109/ICAWST.2011.6163109","DOIUrl":"https://doi.org/10.1109/ICAWST.2011.6163109","url":null,"abstract":"Web applications make life more convenient through on the activities. Many web applications have several kind of user input (e.g. personal information, a user's comment of commercial goods, etc.) for the activities. However, there are various vulnerabilities in input functions of web applications. It is possible to try malicious actions using free accessibility of the web applications. The attacks by exploitation of these input vulnerabilities enable to be performed by injecting malicious web code; it enables one to perform various illegal actions, such as SQL Injection Attacks (SQLIAs) and Cross Site Scripting (XSS). These actions come down to theft, replacing personal information, or phishing. Many solutions have devised for the malicious web code, such as AMNESIA [1] and SQL Check [2], etc. The methods use parser for the code, and limited to fixed and very small patterns, and are difficult to adapt to variations. Machine learning method can give leverage to cover far broader range of malicious web code and is easy to adapt to variations and changes. Therefore, we suggests adaptable classification of malicious web code by machine learning approach such as Support Vector Machine (SVM)[3], Naïve-Bayes[4], and k-Nearest Neighbor Algorithm[5] for detecting the exploitation user inputs.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132506951","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
扫码关注我们
求助内容：
应助结果提醒方式：